KKL.lowDegreePart
defimported Lean
The low-degree part of $f$ at level $k$ keeps only the Fourier coefficients of degree at most $k$: \[ f_{\le k}(x) \;=\; \sum_{\abs{S}\le k} \hat f(S)\,\chi_S(x). \]
Statement
set_option maxHeartbeats 800000 in open scoped BigOperators in open BooleanAnalysis in variable {n : ℕ} in open Classical in noncomputable def KKL.lowDegreePart (f : BooleanFunc n) (k : ℕ) : BooleanFunc n
- Defined in
- TCSlib, `KKL.lowDegreePart`
- 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.lowDegreePart← KKL.lowDegreePart (TCSlib/BooleanAnalysis/KKL.lean:68): verbatim
- Verified
- 07 Oct 2026
- Axioms
- none listed
- Built on 3
- BooleanAnalysis.fourierCoeffThe Fourier--Walsh coefficient of $f$ at frequency $S$ is…
- BooleanAnalysis.chiSThe Walsh--Fourier character associated to $S\subseteq[n]$ is…
- BooleanAnalysis.BooleanFuncA Boolean function of arity $n$ is a function $f : \{0,1\}^n \to \bbr$.
- Used by 6
- 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…
- 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.low_plus_high_eqLow and high degree parts reconstruct the function. Let $f : \{0,1\}^n \to \bbr$ be a Boolean function and let $k \in \bbn$ be a threshold…
- KKL.fourierCoeff_lowDegreePartFourier coefficients of the low-degree truncation. Let $f\colon\{0,1\}^n\to\bbr$ be a Boolean function and $k$ a natural number. For every…
- KKL.lowDegreePart_depends_on_influentialLow-degree part is close to a junta on the influential coordinates. Let $f:\{0,1\}^n\to\bbr$ be a Boolean function, let $k$ be a natural…
- KKL.lowDegree_approxLow-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…
Lean source view module on GitHub
set_option maxHeartbeats 800000 in open scoped BigOperators in open BooleanAnalysis in variable {n : ℕ} in open Classical in /-- The low-degree truncation of `f`: keep Fourier coefficients at levels `<= k`. `f_{<=k}(x) = sum_{|S| <= k} fhat(S) * chi_S(x)`. **Source:** [OD14, Ch. 10]. -/ noncomputable def KKL.lowDegreePart (f : BooleanFunc n) (k : ℕ) : BooleanFunc n := fun x => ∑ S : Finset (Fin n), if S.card ≤ k then fourierCoeff f S * chiS S x else 0