energy_filter_trace4_kernel_conditional
For a real ℓ^(4/3) sequence a, if T(k) equals the triple quartic lattice sum weighted by the unnormalized centered-binomial kernel, then T(k)/√k tends to √π/2 times the lattice convolution-square constant.
Statement
theorem energy_filter_trace4_kernel_conditional (a : ℤ → ℝ) (ha : Memℓp a (4/3)) (T : ℕ → ℝ) (hidentity : ∀ k : ℕ, T k = ∑' p : ℤ × ℤ × ℤ, (a p.1 * a p.2.1 * a p.2.2 * a (p.1-p.2.1+p.2.2)) * (∑' t : ℤ, energy_filter_centered_binomial_weight k t * energy_filter_centered_binomial_weight k (t+p.1) * energy_filter_centered_binomial_weight k (t+p.2.1) * energy_filter_centered_binomial_weight k (t+p.2.1-p.2.2))) : Filter.Tendsto (fun k : ℕ => T k / Real.sqrt (k:ℝ)) Filter.atTop (nhds (energy_filter_sequence_lattice_s4 a * (Real.sqrt Real.pi / 2)))
- Source
- OP-892: conditional fourth-trace reduction.
- Verified
- 14 Nov 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 7
- energy_filter_sequence_abs_quartic_cycle_summableFor every real ℓ^(4/3) sequence a, the absolute values of a(u)a(v)a(w)a(u−v+w) are summable over integer triples (u,v,w).
- energy_filter_sequence_convolution_pointwise_summableFor a square-summable a and any m, the convolution series sum_j a j * a (m - j) is absolutely summable.
- energy_filter_quartic_tannery_to_s4If the absolute quartic cycle and each convolution are summable, a uniformly bounded shifted kernel with a common pointwise limit…
- energy_filter_centered_binomial_quartic_kernel_limitFor any fixed integer shifts u, v and w, the sum of the product of four shifted centered binomial weights, divided by √k, tends to √π/2.
- energy_filter_centered_binomial_quartic_kernel_uniformThere is a positive constant uniformly bounding, for every k ≥ 1 and all integer shifts u, v and w, the absolute quartic shifted…
- energy_filter_centered_binomial_weightFor a natural k and integer s, the centered binomial weight is the real ratio choose(2k,k+s)/choose(2k,k) when −k ≤ s ≤ k, and is zero…
- energy_filter_sequence_lattice_s4For a real sequence a on Z, energy_filter_sequence_lattice_s4 a is the sum over m in Z of the squared discrete convolution (sum_{j in Z}…
- Used by 1
- energy_filter_trace4_shifted_normalized_limitFor any real integer sequence in ℓ^(4/3), the exact fourfold binomial trace sum divided by the fourth power of the central coefficient and…
The proof, explained
By dividing the given representation of T(k) by √k, the quotient T(k)/√k is expressed as a triple quartic lattice sum over ℤ³ weighted by a normalized centered-binomial correlation kernel K. This kernel converges pointwise to √π/2 and is uniformly bounded for all k ≥ 1. Dominated convergence for quartic lattice sums (Tannery's theorem for ℓ^(4/3) sequences) allows the limit as k → ∞ to be interchanged with the summation, yielding the convolution-square constant s₄(a) multiplied by √π/2.
Define the normalized quartic kernel K(k, u, v, w) by dividing the four-point correlation sum of centered binomial weights by √k.
We define K(k, u, v, w) to be (1/√k) ∑_{t ∈ ℤ} w_k(t) w_k(t+u) w_k(t+v) w_k(t+w), isolating the normalized weight factor in the sum for T(k)/√k.
let K : ℕ → ℤ → ℤ → ℤ → ℝ := fun k u v w => (∑' t : ℤ, energy_filter_centered_binomial_weight k t * energy_filter_centered_binomial_weight k (t+u) * energy_filter_centered_binomial_weight k (t+v) * energy_filter_centered_binomial_weight k (t+w)) / Real.sqrt (k:ℝ)
The sequence a satisfies the required cycle and convolution summability conditions, and the kernel K converges pointwise to √π/2.
Applying `energy_filter_sequence_abs_quartic_cycle_summable` to a ∈ ℓ^(4/3) proves that the 4-cycle product of a is absolutely summable on ℤ³. The convolution sum ∑ⱼ a(j) a(m - j) is summable for every m by `energy_filter_sequence_convolution_pointwise_summable`. Finally, for each fixed triple of shifts (u, v, w), K(k, u, v, w) converges to √π/2 as k → ∞ by `energy_filter_centered_binomial_quartic_kernel_limit`.
uses
energy_filter_sequence_abs_quartic_cycle_summable,energy_filter_sequence_convolution_pointwise_summable,energy_filter_centered_binomial_quartic_kernel_limithave hab := energy_filter_sequence_abs_quartic_cycle_summable a ha have hconv : ∀ m : ℤ, Summable (fun j : ℤ => a j * a (m-j)) := energy_filter_sequence_convolution_pointwise_summable a ha have hlim : ∀ u v w, Filter.Tendsto (fun k => K k u v w) Filter.atTop (nhds (Real.sqrt Real.pi/2)) := energy_filter_centered_binomial_quartic_kernel_limit
The normalized kernel K is eventually uniformly bounded in absolute value by a constant C.
By `energy_filter_centered_binomial_quartic_kernel_uniform`, there is a constant C > 0 such that |K(k, u, v, w)| ≤ C holds for all k ≥ 1 and all shifts u, v, w. Since k ≥ 1 holds eventually as k → ∞ (via `Filter.eventually_ge_atTop`), the uniform bound holds eventually along the filter.
uses
energy_filter_centered_binomial_quartic_kernel_uniform,Filter.eventually_ge_atTopobtain ⟨C,hC,hbound⟩ := energy_filter_centered_binomial_quartic_kernel_uniform have hb : ∀ᶠ k in Filter.atTop, ∀ u v w, |K k u v w| ≤ C := by filter_upwards [Filter.eventually_ge_atTop 1] with k hk exact hbound k hk
The lattice sum with kernel K converges to s₄(a) · (√π/2) as k → ∞.
We apply Tannery's theorem for quartic lattice sums (`energy_filter_quartic_tannery_to_s4`), which uses the summability of the quartic coefficient cycle, the pointwise convergence of K to √π/2, and the uniform bound C to deduce that ∑_p a(p₁) a(p₂) a(p₃) a(p₁ - p₂ + p₃) K(k, p₁, p₂, p₂ - p₃) tends to s₄(a) · (√π/2).
uses
energy_filter_quartic_tannery_to_s4have ht := energy_filter_quartic_tannery_to_s4 a K (Real.sqrt Real.pi/2) C hC.le hab hconv hlim hbThe normalized quantity T(k)/√k is identically equal to this kernel lattice sum, hence converges to s₄(a) · (√π/2). automation
Using limit congruence (`ht.congr'`), it suffices to show that T(k)/√k equals the sum for all k. Expanding T(k) with `hidentity`, pulling the division by √k inside the sum over p via `tsum_div_const`, and equating summands term by term with `tsum_congr`, the definition of K and elementary ring arithmetic (`ring`) establish the equality.
uses
tsum_div_const,tsum_congrapply ht.congr' filter_upwards [] with k rw [hidentity k, ← tsum_div_const] apply tsum_congr intro p dsimp [K] ring
energy_filter_sequence_abs_quartic_cycle_summable- For any sequence a in ℓ^(4/3)(ℤ), the quartic cycle product |a(p₁) a(p₂) a(p₃) a(p₁ - p₂ + p₃)| is summable over (p₁, p₂, p₃) ∈ ℤ³.
energy_filter_sequence_convolution_pointwise_summable- For any sequence a in ℓ^(4/3)(ℤ) and any integer m, the auto-convolution sum ∑ⱼ a(j) a(m - j) converges absolutely.
energy_filter_centered_binomial_quartic_kernel_limit- For any fixed integer shifts u, v, w, the quartic correlation sum of centered binomial weights divided by √k converges to √π/2 as k → ∞.
energy_filter_centered_binomial_quartic_kernel_uniform- There exists a positive constant C such that for all k ≥ 1 and all integer shifts u, v, w, the quartic correlation sum divided by √k is bounded in absolute value by C.
Filter.eventually_ge_atTop- In any preorder, a given element a is eventually bounded by elements going to infinity (here, 1 ≤ k eventually holds as k → ∞).
energy_filter_quartic_tannery_to_s4- If an ℓ^(4/3) sequence satisfies the cycle and convolution summability conditions, and a kernel K(k, u, v, w) is uniformly bounded for large k and converges pointwise to c, then the weighted sum ∑_p a(p₁) a(p₂) a(p₃) a(p₁ - p₂ + p₃) K(k, p₁, p₂, p₂ - p₃) converges to s₄(a) · c.
tsum_div_const- An infinite sum of terms each divided by a constant equals the total sum divided by that constant.
tsum_congr- If two functions agree on every term, their infinite sums are equal.
- The algebraic equivalence between each summand of T(k)/√k and the term-by-term definition using the kernel K is handled by the `ring` tactic.
Written by a model (gemini-3.8-flash) from the Lean proof and the goal states Lean reported at each step. Lean verified the proof; this explanation is a reading aid and is not itself machine-checked.
Lean source view module on GitHub
Choose a tactic — a marked line — to see the goals Lean had before and after it, as in Lean’s infoview. Step with ← → or j k.
theorem energy_filter_trace4_kernel_conditional (a : ℤ → ℝ) (ha : Memℓp a (4/3)) (T : ℕ → ℝ) (hidentity : ∀ k : ℕ, T k = ∑' p : ℤ × ℤ × ℤ, (a p.1 * a p.2.1 * a p.2.2 * a (p.1-p.2.1+p.2.2)) * (∑' t : ℤ, energy_filter_centered_binomial_weight k t * energy_filter_centered_binomial_weight k (t+p.1) * energy_filter_centered_binomial_weight k (t+p.2.1) * energy_filter_centered_binomial_weight k (t+p.2.1-p.2.2))) : Filter.Tendsto (fun k : ℕ => T k / Real.sqrt (k:ℝ)) Filter.atTop (nhds (energy_filter_sequence_lattice_s4 a * (Real.sqrt Real.pi / 2))) := by let K : ℕ → ℤ → ℤ → ℤ → ℝ := fun k u v w => (∑' t : ℤ, energy_filter_centered_binomial_weight k t * energy_filter_centered_binomial_weight k (t+u) * energy_filter_centered_binomial_weight k (t+v) * energy_filter_centered_binomial_weight k (t+w)) / Real.sqrt (k:ℝ) have hab := energy_filter_sequence_abs_quartic_cycle_summable a ha have hconv : ∀ m : ℤ, Summable (fun j : ℤ => a j * a (m-j)) := energy_filter_sequence_convolution_pointwise_summable a ha have hlim : ∀ u v w, Filter.Tendsto (fun k => K k u v w) Filter.atTop (nhds (Real.sqrt Real.pi/2)) := energy_filter_centered_binomial_quartic_kernel_limit obtain ⟨C,hC,hbound⟩ := energy_filter_centered_binomial_quartic_kernel_uniform have hb : ∀ᶠ k in Filter.atTop, ∀ u v w, |K k u v w| ≤ C := by filter_upwards [Filter.eventually_ge_atTop 1] with k hk exact hbound k hk have ht := energy_filter_quartic_tannery_to_s4 a K (Real.sqrt Real.pi/2) C hC.le hab hconv hlim hb apply ht.congr' filter_upwards [] with k rw [hidentity k, ← tsum_div_const] apply tsum_congr intro p dsimp [K] ring