Bonami.moment_eq_expect
theoremverifiedimported Lean
Moments equal expectations under the uniform law. Let $f : \{0,1\}^n \to \bbr$ be a Boolean function of arity $n$, let $p$ be a natural number, and let $P$ be a probability measure on the Boolean hypercube $\{0,1\}^n$ that assigns to each singleton $\{x\}$ the uniform weight $2^{-n}$. Then the $p$-th moment of $f$ under $P$ equals the expectation of $f^p$ under the uniform measure: \[ \int f^p \, dP \;=\; \E\!\left[f^p\right] \;=\; 2^{-n}\sum_{x\in\{0,1\}^n} f(x)^p. \]
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in open BooleanAnalysis in open MeasureTheory Set Filter ProbabilityTheory BooleanAnalysis Real in variable {Ω : Type*} [MeasurableSpace Ω] {μ : Measure Ω} [IsProbabilityMeasure μ] in lemma Bonami.moment_eq_expect {n : ℕ} (f : BooleanFunc n) (p : ℕ) (P : Measure (BoolCube n)) [IsProbabilityMeasure P] (hP_unif : ∀ x, (P {x}).toReal = uniformWeight n) : moment f p P = expect (fun x ↦ f x ^ p)
- Source
- TCSlib, `Bonami.moment_eq_expect`
- Lean proof
- By 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.Bonami.moment_eq_expect← Bonami.moment_eq_expect (TCSlib/BooleanAnalysis/Hypercontractivity/Bonami.lean:131): verbatim
- Verified
- 07 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 4
- BooleanAnalysis.uniformWeightThe uniform probability measure on $\{0,1\}^n$ assigns weight $2^{-n}$ to each point.
- BooleanAnalysis.expectThe expectation of $f$ under the uniform measure: \[ \E[f] \;=\; 2^{-n}\sum_{x\in\{0,1\}^n} f(x). \]
- BooleanAnalysis.BoolCubeThe Boolean hypercube of dimension $n$ is $\{0,1\}^n$, represented as the function type $\mathrm{Fin}\,n \to \mathrm{Bool}$.
- BooleanAnalysis.BooleanFuncA Boolean function of arity $n$ is a function $f : \{0,1\}^n \to \bbr$.
- Used by 1
- Bonami.bonami_lemmaBonami's hypercontractivity lemma for low-degree functions. Let $f : \{0,1\}^n \to \bbr$ be a Boolean function whose Fourier expansion has…
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 inopen BooleanAnalysis inopen MeasureTheory Set Filter ProbabilityTheory BooleanAnalysis Real invariable {Ω : Type*} [MeasurableSpace Ω] {μ : Measure Ω} [IsProbabilityMeasure μ] in/-- Identifies finite-space moments under a uniform measure with combinatorial expectations. **Source:** [OD14, Cor. 9.6 (uniform-measure specialization)]. -/lemma Bonami.moment_eq_expect {n : ℕ} (f : BooleanFunc n) (p : ℕ) (P : Measure (BoolCube n)) [IsProbabilityMeasure P] (hP_unif : ∀ x, (P {x}).toReal = uniformWeight n) : moment f p P = expect (fun x ↦ f x ^ p) := by rw [moment] simp only [Pi.pow_apply, Integrable.of_finite, integral_fintype, smul_eq_mul] unfold expect rw [Finset.mul_sum] apply Finset.sum_congr rfl intro x _ have h_meas_x : (P.real {x}) = uniformWeight n := hP_unif x rw [h_meas_x]