AFTD Auto-Formalizing Theoretical Domains

BoolFourier.expectation

defimported Lean

For $f : \{0,1\}^n \to \mathbb{R}$, the uniform expectation is \[ \mathbb{E}[f] = \frac{1}{2^n} \sum_{x \in \{0,1\}^n} f(x). \]

Statement

set_option relaxedAutoImplicit false in
set_option autoImplicit false in
open Finset BooleanAnalysis in
noncomputable def BoolFourier.expectation {n : ℕ} (f : BoolFun n) : ℝ
Defined in
TCSlib, `BoolFourier.expectation`
Lean proof
By Prastik Mohanraj, from github.com/Shilun-Allan-Li/tcslib at c8a02591b1e5 (Copyright (c) 2026 Prastik Mohanraj. All rights reserved, 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 1
  • BoolFourier.BoolFunA Boolean function of arity $n$ is an element of type $\{0,1\}^n \to \mathbb{R}$, defined as an abbreviation for…
Used by 14

Lean source view module on GitHub

set_option relaxedAutoImplicit false in
set_option autoImplicit false in
open Finset BooleanAnalysis in
/-- Defines uniform expectation on the Boolean cube. **Source:** [OD14, §1.3]. -/
noncomputable def BoolFourier.expectation {n : ℕ} (f : BoolFun n) : ℝ :=
  (Finset.sum Finset.univ fun x => f x) / (2 : ℝ) ^ n

-- E[∏_i g_i(x_i)] = ∏_i (g_i(false) + g_i(true)) / 2
See it in the graphDiscuss this resultChallenge it