Bonami.uniformWeight_succ
theoremverifiedimported Lean
Uniform weight halves with each added coordinate. For every natural number $n$, the uniform weight $2^{-n}$ assigned to each point of $\{0,1\}^n$ satisfies \[2^{-(n+1)} = \frac{2^{-n}}{2},\] so that the uniform weight on the cube of one higher dimension is half the uniform weight on the original cube.
Statement
open BooleanAnalysis in lemma Bonami.uniformWeight_succ (n : ℕ) : uniformWeight (n + 1) = uniformWeight n / 2
- Source
- TCSlib, `Bonami.uniformWeight_succ`
- Lean proof
- By 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.Bonami.uniformWeight_succ← Bonami.uniformWeight_succ (TCSlib/BooleanAnalysis/Hypercontractivity/Decomposition.lean:80): verbatim
- Verified
- 07 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 1
- BooleanAnalysis.uniformWeightThe uniform probability measure on $\{0,1\}^n$ assigns weight $2^{-n}$ to each point.
- Used by 2
- Bonami.fourierCoeff_diffLastFourier coefficient of the half-difference over the last coordinate. Let $f\colon\{0,1\}^{n+1}\to\bbr$ be a Boolean function on $n+1$…
- Bonami.expect_succ_eqExpectation splits over the last coordinate. Let $\varphi : \{0,1\}^{n+1} \to \bbr$ be a Boolean function on $n+1$ variables, and for a…
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.
open BooleanAnalysis in/-- Computes the uniform weight of an `(n + 1)`-dimensional Boolean cube. **Source:** [OD14, Cor. 9.6 (proof)]. -/lemma Bonami.uniformWeight_succ (n : ℕ) : uniformWeight (n + 1) = uniformWeight n / 2 := by simp [uniformWeight, pow_succ] ring