BoolBLR.triple_expectation_eq_cube_fourier_aux_h_convolution
Fourier expansion of the self-convolution. Let $f : \{0,1\}^n \to \{0,1\}$ be a Boolean-valued function, and let $g : \{0,1\}^n \to \bbr$ be its $\pm 1$ lift, $g(x) = (-1)^{f(x)}$. Writing $g * g$ for the self-convolution $(g * g)(x) = \E_{y}\bigl[g(y)\,g(x \oplus y)\bigr]$ with respect to the uniform measure, and $\hat g(S) = \E[g\,\chi_S]$ for the Fourier coefficient of $g$ at $S$, one has for every $x \in \{0,1\}^n$ \[ (g * g)(x) \;=\; \sum_{S \subseteq [n]} \hat g(S)^2\, \chi_S(x), \] where $\chi_S(x) = \prod_{i \in S} (-1)^{x_i}$ is the Walsh character of $S$. That is, the self-convolution of $g$ has Fourier coefficients $\hat g(S)^2$.
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in open Finset BoolFourier in lemma BoolBLR.triple_expectation_eq_cube_fourier_aux_h_convolution {n : ℕ} (f : BoolFourier.hypercube n → Bool) : ∀ (x : BooleanAnalysis.BoolCube n), BoolFourier.convolution (lift_pm1 f) (lift_pm1 f) x = ∑ S, BoolFourier.fourier_coeff (lift_pm1 f) S ^ 2 * BoolFourier.char_S S x
- Source
- TCSlib, `BoolBLR.triple_expectation_eq_cube_fourier_aux_h_convolution`
- 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.BoolBLR.triple_expectation_eq_cube_fourier_aux_h_convolution← BoolBLR.triple_expectation_eq_cube_fourier_aux_h_convolution (TCSlib/BooleanAnalysis/BLR/BoolBLR.lean:222): verbatim
- Verified
- 07 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 8
- BoolFourier.char_SFor a set $S \subseteq [n]$, the Walsh character $\chi_S : \{0,1\}^n \to \mathbb{R}$ is \[ \chi_S(x) = \prod_{i \in S} (-1)^{x_i}, \]…
- BoolFourier.convolutionThe convolution of $f, g : \{0,1\}^n \to \mathbb{R}$ is the function \[ (f * g)(x) = \mathbb{E}_{y}\bigl[f(y)\,g(x \oplus y)\bigr]. \]
- BoolFourier.hypercubeThe Boolean hypercube of dimension $n$ is the type $\{0,1\}^n$, defined as an abbreviation for
BooleanAnalysis.BoolCube$n$. - BooleanAnalysis.BoolCubeThe Boolean hypercube of dimension $n$ is $\{0,1\}^n$, represented as the function type $\mathrm{Fin}\,n \to \mathrm{Bool}$.
- BoolFourier.fourier_coeff_convolutionConvolution theorem on the Boolean cube. Let $n$ be a natural number, and let $f, g : \{0,1\}^n \to \bbr$ be Boolean functions. Then for…
- BoolFourier.fourier_coeffThe Fourier coefficient of $f : \{0,1\}^n \to \mathbb{R}$ at $S \subseteq [n]$ is \[ \hat f(S) = \langle f, \chi_S \rangle. \]
- BoolFourier.fourier_expansionFourier–Walsh expansion. Let $f : \{0,1\}^n \to \bbr$ be a Boolean function and let $x \in \{0,1\}^n$. Then $f$ agrees pointwise with the…
- BoolBLR.lift_pm1Given $f : \{0,1\}^n \to \{0,1\}$, its $\pm 1$ lift $\texttt{BoolBLR.lift\_pm1}\,f : \{0,1\}^n \to \mathbb{R}$ is defined by…
- Used by 1
- BoolBLR.triple_expectation_eq_cube_fourierCube of Fourier coefficients as an autocorrelation expectation. Let $f : \{0,1\}^n \to \{0,1\}$ be a Boolean-valued function on the…
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 Finset BoolFourier inlemma BoolBLR.triple_expectation_eq_cube_fourier_aux_h_convolution {n : ℕ} (f : BoolFourier.hypercube n → Bool) : ∀ (x : BooleanAnalysis.BoolCube n), BoolFourier.convolution (lift_pm1 f) (lift_pm1 f) x = ∑ S, BoolFourier.fourier_coeff (lift_pm1 f) S ^ 2 * BoolFourier.char_S S x := by intro x; convert fourier_expansion ( BoolFourier.convolution ( lift_pm1 f ) ( lift_pm1 f ) ) x using 1; exact Finset.sum_congr rfl fun _ _ => by rw [ fourier_coeff_convolution ] ; ring;