The inner-product Parseval identity for the biased Boolean cube
ProvedNarrowDNF.Fourier.inner_parsevalcombinatoricsnarrow-dnf-authors-importprobabilitystoc-2027
Let be finite, , and . For the normalized characters , define and similarly for . Then
This identifies the product-measure inner product with the Euclidean inner product of the Fourier coefficient arrays. Taking gives the usual equality between the second moment and the sum of squared coefficients.
Preamble
import Mathlib.Algebra.BigOperators.GroupWithZero.Finset
import Mathlib.Algebra.BigOperators.Ring.Finset
import Mathlib.Algebra.Order.BigOperators.Group.Finset
import Mathlib.Algebra.Order.BigOperators.Ring.Finset
import Mathlib.Analysis.SpecialFunctions.Sqrt
import Mathlib.Data.Fintype.BigOperators
import Mathlib.Data.Fintype.Pi
import Mathlib.Data.Real.Basic
import Mathlib.Logic.Equiv.Prod
import Mathlib.Tactic.FieldSimp
import Mathlib.Tactic.Linarith
import Mathlib.Tactic.Ring
import Definitions.Def_NarrowDNF_Fourier
import Definitions.Def_NarrowDNF_Influence
import Definitions.Def_NarrowDNF_ProductMeasure
import Theorems.Thm_NarrowDNF_Fourier_expansion
namespace NarrowDNF.FiberShift
end NarrowDNF.FiberShift
namespace NarrowDNF.Fourier
end NarrowDNF.Fourier
namespace NarrowDNF.Influence
end NarrowDNF.Influence
namespace NarrowDNF.ProductMeasure
end NarrowDNF.ProductMeasure
noncomputable section
open scoped BigOperators
open NarrowDNF
open NarrowDNF.Fourier
section Cube
variable {ι : Type*} [Fintype ι] [DecidableEq ι]
Formal statement
theorem NarrowDNF.Fourier.inner_parseval {p : ℝ} (hp0 : 0 < p) (hp1 : p < 1)
(f g : (ι → Bool) → ℝ) :
ProductMeasure.expectation p (fun x => f x * g x) =
∑ s : ι → Bool, coefficient p f s * coefficient p g s := by sorrySource