Sharp quarter bound for the overlap of a normalized orbit cutoff with a nonzero translate
ProvedMasulloAudit.sharp_quarter_bound_for_normalized_orbit_shift_overlapfinite-sumsgraph-theoryharmonic-analysistrace-formula
Fix . For any nonnegative finitely supported weight on with , its overlap with its translate satisfies
The bound is attained for every such , by placing weight at each of and . The integer lattice indexes the orbit in the one-prime cutoff model for the orbital-trace audit.
Preamble
import Mathlib.Data.Finsupp.Basic import Mathlib.Data.Real.Basic open Finset
Formal statement
theorem MasulloAudit.sharp_quarter_bound_for_normalized_orbit_shift_overlap (d : ℤ) (hd : d ≠ 0) :
(∀ w : ℤ →₀ ℝ, (∀ i : ℤ, 0 ≤ w i) → (∑ i ∈ w.support, w i) = 1 →
(∑ i ∈ w.support, w i * w (i+d)) ≤ 1/4) ∧
(∃ w : ℤ →₀ ℝ, (∀ i : ℤ, 0 ≤ w i) ∧ (∑ i ∈ w.support, w i) = 1 ∧
(∑ i ∈ w.support, w i * w (i+d)) = 1/4) := by sorrySource
The extremal inequality is the path-forest case of T. S. Motzkin and E. G. Straus, “Maxima for graphs and a new proof of a theorem of Turán”, Canadian J. Math. 17 (1965), 533–540, https://doi.org/10.4153/CJM-1965-053-6. The rational-idèle cutoff example assigning mass 1/2 to each of two neighboring translates and producing overlap 1/4 is recorded at https://github.com/mccorvie/riemann-masullo/issues/1358#issuecomment-7054088460. This proof specializes the elementary bipartition argument to integer translates for every nonzero step.