AFTD Auto-Formalizing Theoretical Domains

Bonami.instIsProbabilityMeasureBoolCubeUniformMeasure

instanceimported Lean

Bonami.instIsProbabilityMeasureBoolCubeUniformMeasure

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
instance Bonami.instIsProbabilityMeasureBoolCubeUniformMeasure (n : ℕ) : IsProbabilityMeasure (uniformMeasure n)
Defined in
TCSlib, `Bonami.instIsProbabilityMeasureBoolCubeUniformMeasure`
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.
Verified
07 Oct 2026
Axioms
none listed
Built on 3
  • Bonami.uniformMeasureThe canonical uniform probability measure on the Boolean hypercube $\{0,1\}^n$.
  • BooleanAnalysis.chiS_singletonValue of a singleton Walsh character. Fix a dimension $n$, a coordinate $i \in [n]$, and a point $x$ of the Boolean hypercube $\{0,1\}^n$.…
  • BooleanAnalysis.flipBit_flipBitBit-flip is an involution. For a point $x$ in the Boolean hypercube $\{0,1\}^n$ and a coordinate $i$, flipping the $i$-th coordinate of…
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

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
instance Bonami.instIsProbabilityMeasureBoolCubeUniformMeasure (n : ℕ) : IsProbabilityMeasure (uniformMeasure n) := by
  unfold uniformMeasure
  infer_instance
See it in the graphDiscuss this resultChallenge it