KKL.lowDegree_approx
theoremverifiedimported Lean
Low-degree approximation error bound. Let $f\colon\{0,1\}^n\to\bbr$ be a Boolean function and let $k\ge 1$ be an integer. Writing $f_{\le k}(x)=\sum_{\abs S\le k}\hat f(S)\,\chi_S(x)$ for the truncation of $f$ to its Fourier coefficients of degree at most $k$, the squared $L^2$ distance between $f$ and $f_{\le k}$ under the uniform measure on the cube is bounded by \[ \E\big[(f(x)-f_{\le k}(x))^2\big]\;\le\;\frac{I[f]}{k}, \] where $I[f]=\sum_{i=1}^n\mathrm{Inf}_i[f]$ is the total influence of $f$.
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in set_option maxHeartbeats 800000 in open scoped BigOperators in open BooleanAnalysis in variable {n : ℕ} in open Classical in lemma KKL.lowDegree_approx (f : BooleanFunc n) (k : ℕ) (hk : 0 < k) : l2DistSq f (lowDegreePart f k) ≤ totalInfluence f / k
- Source
- TCSlib, `KKL.lowDegree_approx`
- Lean proof
- By Mina, Owen McGinty, Hydroxyi (from the file's git history), from github.com/Shilun-Allan-Li/tcslib at
c8a02591b1e5(Apache-2.0). Compiled here against leanprover/lean4:v4.33.1, Mathlib v4.33.1; written for leanprover/lean4:v4.25.0.KKL.lowDegree_approx← KKL.lowDegree_approx (TCSlib/BooleanAnalysis/KKL.lean:276): verbatim
- Verified
- 07 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 6
- KKL.lowDegreePartThe low-degree part of $f$ at level $k$ keeps only the Fourier coefficients of degree at most $k$:…
- KKL.lowDegree_l2_error$L^2$ error of the low-degree truncation. Let $f : \{0,1\}^n \to \bbr$ be a Boolean function, and for a natural number $k$ let…
- KKL.tail_fourier_weight_boundFourier tail weight bound above level $k$. Let $f : \{0,1\}^n \to \bbr$ be a Boolean function, and let $k$ be a positive integer. Then the…
- BooleanAnalysis.totalInfluence$I[f] = \sum_{i=1}^n \mathrm{Inf}_i[f]$.
- KKL.l2DistSqThe squared $L^2$ distance between two Boolean functions is $\E\big[(f(x) - g(x))^2\big]$ under the uniform measure on the cube.
- BooleanAnalysis.BooleanFuncA Boolean function of arity $n$ is a function $f : \{0,1\}^n \to \bbr$.
- Used by 1
- KKL.friedgut_juntaFriedgut's junta theorem. Let $f : \{0,1\}^n \to \{-1,1\}$ be a $\pm 1$-valued Boolean function with total influence $I[f]$, and let…
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.
set_option autoImplicit true inset_option relaxedAutoImplicit true inset_option maxHeartbeats 800000 inopen scoped BigOperators inopen BooleanAnalysis invariable {n : ℕ} inopen Classical inlemma KKL.lowDegree_approx (f : BooleanFunc n) (k : ℕ) (hk : 0 < k) : l2DistSq f (lowDegreePart f k) ≤ totalInfluence f / k := by rw [lowDegree_l2_error] exact tail_fourier_weight_bound f k hk