KKL.influential_coords_card
theoremverifiedimported Lean
Few influential coordinates. Let $f : \{0,1\}^n \to \bbr$ be a Boolean function and let $\tau > 0$. The number of $\tau$-influential coordinates of $f$ — those $i \in [n]$ with $\mathrm{Inf}_i[f] \ge \tau$ — is bounded by \[ \abs{J_\tau(f)} \;\le\; \frac{I[f]}{\tau}, \] where $I[f] = \sum_{i=1}^n \mathrm{Inf}_i[f]$ is the total influence.
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.influential_coords_card (f : BooleanFunc n) (τ : ℝ) (hτ : 0 < τ) : ((influentialCoords f τ).card : ℝ) ≤ totalInfluence f / τ
- Source
- TCSlib, `KKL.influential_coords_card`
- 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.influential_coords_card← KKL.influential_coords_card (TCSlib/BooleanAnalysis/KKL.lean:284): verbatim
- Verified
- 07 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 5
- BooleanAnalysis.influenceThe influence of coordinate $i$ on $f$ measures how often flipping bit $i$ changes the output:…
- BooleanAnalysis.influence_eq_sum_fourierInfluence via Fourier coefficients. Let $f:\{0,1\}^n\to\bbr$ be a Boolean function and fix a coordinate $i\in[n]$. Then the influence of…
- KKL.influentialCoordsThe set of $\tau$-influential coordinates of $f$ is the finite set…
- BooleanAnalysis.totalInfluence$I[f] = \sum_{i=1}^n \mathrm{Inf}_i[f]$.
- 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.influential_coords_card (f : BooleanFunc n) (τ : ℝ) (hτ : 0 < τ) : ((influentialCoords f τ).card : ℝ) ≤ totalInfluence f / τ := by rw [le_div_iff₀ hτ] calc ((influentialCoords f τ).card : ℝ) * τ = (influentialCoords f τ).card • τ := by rw [nsmul_eq_mul] _ ≤ ∑ i ∈ influentialCoords f τ, influence i f := by apply Finset.card_nsmul_le_sum intro i hi exact (Finset.mem_filter.mp hi).2 _ ≤ totalInfluence f := by simp only [totalInfluence] apply Finset.sum_le_univ_sum_of_nonneg intro i rw [influence_eq_sum_fourier] exact Finset.sum_nonneg (fun S _ => by split_ifs <;> positivity)-- Step 12: The lowDegreePart restricted to influential coordinates is a junta.-- More precisely, f_{<=k} depends only on the coordinates appearing in sets S with |S| <= k.-- We state a simpler version: lowDegreePart is a junta on all n coordinates (trivially).-- The real content is that we can restrict to influential coords.