AFTD Auto-Formalizing Theoretical Domains

BooleanAnalysis.max_influence_lower_bound

theoremverifiedimported Lean

Average influence lower bound. Let $f:\{0,1\}^n\to\bbr$ be a Boolean function on the hypercube of dimension $n\ge 1$. Then some coordinate carries at least the average influence: there exists an index $i$ with \[ \mathrm{Inf}_i[f] \;\ge\; \frac{I[f]}{n}, \] where $I[f]=\sum_{j=1}^{n}\mathrm{Inf}_j[f]$ is the total influence.

Statement

set_option maxHeartbeats 400000 in
open scoped BigOperators in
variable {n : ℕ} in
lemma BooleanAnalysis.max_influence_lower_bound (f : BooleanFunc n) (hn : 0 < n) :
    ∃ i : Fin n, totalInfluence f / n ≤ influence i f
Source
TCSlib, `BooleanAnalysis.max_influence_lower_bound`
Lean proof
By Jingzhen Sha, Allan Li, Hydroxyi, Mina, Owen McGinty (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.
Verified
07 Oct 2026
Axioms
Classical.choiceQuot.soundpropext
Built on 3

Lean source view module on GitHub

set_option maxHeartbeats 400000 inopen scoped BigOperators invariable {n : ℕ} in/-- For any Boolean function `f`, the maximum individual influence is at least the average: `max_i Inf_i[f] ≥ I[f] / n`. -/lemma BooleanAnalysis.max_influence_lower_bound (f : BooleanFunc n) (hn : 0 < n) :    ∃ i : Fin n, totalInfluence f / n ≤ influence i f := by  by_contra h  push_neg at h  have hlt : ∀ i : Fin n, influence i f < totalInfluence f / n := h  have hsum : totalInfluence f = ∑ i : Fin n, influence i f := rfl  have : totalInfluence f < totalInfluence f := by    calc totalInfluence f        = ∑ i : Fin n, influence i f := hsum      _ < ∑ _i : Fin n, totalInfluence f / n := by            apply Finset.sum_lt_sum_of_nonempty            · exact Finset.univ_nonempty_iff.mpr (Fin.pos_iff_nonempty.mp hn)            · intro i _; exact hlt i      _ = n * (totalInfluence f / n) := by simp [Finset.sum_const, nsmul_eq_mul]      _ = totalInfluence f := by field_simp  exact lt_irrefl _ this
See it in the graphDiscuss this resultChallenge it