NIM paper · interactive edition Interactive edition · paper, explanations and Lean proofs.

Definition 6.1The degree->k Fourier tail and (k,ε)-spectral band-limitation

Checked definition or construction Lean contains the definition or construction, with checked properties.

1 Paper text

Definition 6.1 (Fourier tail / spectral bandwidth) For k∈Nk\in\N, define the degree->k>k Fourier tail Tail>k(f)  =  ∑S⊆[n]: ∣S∣>kf^(S)2.\mathrm{Tail}_{>k}(f)\;=\;\sum_{S\subseteq[n]:\,|S|>k}\hat f(S)^2. For ε≥0\varepsilon\ge0, we say ff is (k,ε)(k,\varepsilon)-spectrally band-limited if Tail>k(f)≤ε\mathrm{Tail}_{>k}(f)\le \varepsilon.

Generated from paper_jmlr.tex, lines 950–957.

2 Explain this

The tail above degree kk is the total squared Fourier weight on sets larger than kk. A function is (k,ε)(k,\varepsilon)-band-limited if that weight is at most ε\varepsilon: almost all of its "energy" is at low frequency. For a ±1\pm1-valued function the total weight is 11, so the tail is the fraction of energy above degree kk.

3 How this is formalised

Fourier.tail is Tail>k(f)=∑∣S∣>kf^(S)2\mathrm{Tail}_{>k}(f)=\sum_{|S|>k}\hat f(S)^2 and Fourier.BandLimited is "tail at most ε\varepsilon". RealFourier.tailF_eq connects the Mathlib-cube version RealFourier.tailF to the list-cube definition used elsewhere.

Coverage record
Paper anchordef:fourier-tail (manuscript label)
Displayed asDefinition 6.1
ClaimThe degree->k Fourier tail and (k,ε)-spectral band-limitation
Coverage categoryChecked definition or construction
Statement sourcepaper_jmlr.tex lines 950–957; SHA-256 of the normalised block source 4323de922f0b0666…
Lean declarations
Audited correspondence rowsdef:fourier-tail
Explanationsexplain/def:fourier-tail, formal/def:fourier-tail
Build evidencefresh isolated rebuild, audit report

4 Lean statement and source

Principal declarations

theorem RealFourier.tailF_eq

Module RealFourier (lean/phase8/RealFourier.lean, lines 161–165) · file SHA-256 e0e69edd199d8650… Axioms reported by the fresh build: propext, Classical.choice, Quot.sound

Statement as elaborated and printed by Lean 4.26.0

∀ {n : ℕ} (F : (Fin n → Bool) → ℝ) (k : ℕ),
  NimAudit.RealFourier.tailF F k = NimAudit.Fourier.tail n (NimAudit.RealFourier.lift F) k
Exact source text, lines 161–165
161theorem tailF_eq {n : ℕ} (F : (Fin n → Bool) → ℝ) (k : ℕ) : tailF F k = tail n (lift F) k := by162  unfold tailF tail163  rw [gs_eq_fintype_sum]164  apply Finset.sum_congr rfl; intro S _165  rw [ones_toL, fhat_eq_coef]

Project declarations in the statement: Fourier.tail, RealFourier.lift, RealFourier.tailF

Project declarations used by the proof or definition body

Bridge.bitvecs, Bridge.ones, Fourier.coef, Fourier.tail, Noise.gs, RealFourier.fhat, RealFourier.fhat_eq_coef, RealFourier.gs_eq_fintype_sum, RealFourier.lift, RealFourier.ones_toL, RealFourier.tailF, RealFourier.toL

def Fourier.tail

Module Fourier (lean/phase8/Fourier.lean, lines 380–382) · file SHA-256 afffe6072d707e40…

Degree-> k Fourier tail Tail_{>k}(f) = Σ_{|S| > k} f̂(S)².

Statement as elaborated and printed by Lean 4.26.0

{R : Type} → [Grind.Field R] → ℕ → (List Bool → R) → ℕ → R
Exact source text, lines 380–382
380/-- Degree-> k Fourier tail Tail_{>k}(f) = Σ_{|S| > k} f̂(S)². -/381def tail (n : Nat) (f : List Bool → R) (k : Nat) : R :=382  gs (bitvecs n) (fun S => if k < ones S then coef n f S ^ 2 else 0)

Project declarations in the statement: none

Project declarations used by the proof or definition body

Bridge.bitvecs, Bridge.ones, Fourier.coef, Noise.gs

def Fourier.BandLimited

Module Fourier (lean/phase8/Fourier.lean, lines 384–385) · file SHA-256 afffe6072d707e40…

(k, ε)-spectrally band-limited.

Statement as elaborated and printed by Lean 4.26.0

{R : Type} → [Grind.Field R] → [LE R] → ℕ → (List Bool → R) → ℕ → R → Prop
Exact source text, lines 384–385
384/-- (k, ε)-spectrally band-limited. -/385def BandLimited (n : Nat) (f : List Bool → R) (k : Nat) (ε : R) : Prop := tail n f k ≤ ε

Project declarations in the statement: none

Project declarations used by the proof or definition body

Fourier.tail

Definitions these statements use

def RealFourier.tailF

Module RealFourier (lean/phase8/RealFourier.lean, lines 157–159) · file SHA-256 e0e69edd199d8650…

Degree-> k tail (Fin form).

Statement as elaborated and printed by Lean 4.26.0

{n : ℕ} → ((Fin n → Bool) → ℝ) → ℕ → ℝ
Exact source text, lines 157–159
157/-- Degree-> k tail (Fin form). -/158noncomputable def tailF {n : ℕ} (F : (Fin n → Bool) → ℝ) (k : ℕ) : ℝ :=159  ∑ S : Fin n → Bool, if k < ∑ i, (if S i then 1 else 0) then fhat F S ^ 2 else 0

Project declarations in the statement: none

Project declarations used by the proof or definition body

RealFourier.fhat

def RealFourier.lift

Module RealFourier (lean/phase8/RealFourier.lean, lines 91–93) · file SHA-256 e0e69edd199d8650…

Lift of a function on Fin n → Bool to lists (0 off the cube).

Statement as elaborated and printed by Lean 4.26.0

{n : ℕ} → ((Fin n → Bool) → ℝ) → List Bool → ℝ
Exact source text, lines 91–93
91/-- Lift of a function on Fin n → Bool to lists (0 off the cube). -/92noncomputable def lift {n : ℕ} (F : (Fin n → Bool) → ℝ) (x : List Bool) : ℝ :=93  if h : x.length = n then F (fun i => x[i.1]'(by omega)) else 0

Project declarations in the statement: none

Project declarations used by the proof or definition body

none

Full modules

ModuleFileLinesImports
Fourierlean/phase8/Fourier.lean1379NoiseModel
RealFourierlean/phase8/RealFourier.lean275Mathlib.Data.Real.Archimedean, Mathlib.Data.Fintype.BigOperators, Mathlib.Algebra.BigOperators.Fin, Mathlib.Tactic.Linarith, Mathlib.Tactic.Positivity, Mathlib.Tactic.FieldSimp, Mathlib.Tactic.NormNum, Mathlib.Tactic.Ring, Fourier, RealNoise

Build evidence: fresh isolated rebuild of all 38 bundled modules with Lean (version 4.26.0, started 2026-10-10T15:21:56Z, finished 2026-10-10T15:27:00Z: 38/38 modules compiled, 1588 axiom reports, no errors. See Build for the commands and the independent audit of 2026-10-10 (dated evidence).