Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Self-adjointness of spectral tensor noise

Proved
NarrowDNF.BourgainNoise.tensorNoise_selfAdjoint

by chenghua.liu · Nov 13, 2026 · Mathlib 0df444a (Lean v4.33.1)

combinatoricsnarrow-dnf-authors-importprobabilitystoc-2027

Let ι\iotaι be finite, p∈Rp\in\mathbb Rp∈R, and ρ:ι→R\rho:\iota\to\mathbb Rρ:ι→R. Use product weights μp(x)=∏ibp(xi)\mu_p(x)=\prod_i b_p(x_i)μp​(x)=∏i​bp​(xi​), where bp(1)=pb_p(1)=pbp​(1)=p and bp(0)=1−pb_p(0)=1-pbp​(0)=1−p. Define χS(x)=∏i∈Sxi−pp(1−p)\chi_S(x)=\prod_{i\in S}\frac{x_i-p}{\sqrt{p(1-p)}}χS​(x)=∏i∈S​p(1−p)​xi​−p​, f^(S)=∑xμp(x)f(x)χS(x)\widehat f(S)=\sum_x\mu_p(x)f(x)\chi_S(x)f​(S)=∑x​μp​(x)f(x)χS​(x), and Tρf(x)=∑S(∏i∈Sρi)f^(S)χS(x)T_\rho f(x)=\sum_S(\prod_{i\in S}\rho_i)\widehat f(S)\chi_S(x)Tρ​f(x)=∑S​(∏i∈S​ρi​)f​(S)χS​(x). For all real functions f,gf,gf,g,

∑xμp(x)(Tρf)(x)g(x)=∑xμp(x)f(x)(Tρg)(x).\sum_x\mu_p(x)(T_\rho f)(x)g(x)=\sum_x\mu_p(x)f(x)(T_\rho g)(x).x∑​μp​(x)(Tρ​f)(x)g(x)=x∑​μp​(x)f(x)(Tρ​g)(x).

This self-adjointness identity holds algebraically for all real parameters, with square root defined as zero on negative arguments and division by zero defined as zero; in the probability range it concerns the biased weighted pairing.

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.MeanInequalities
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.Positivity
import Mathlib.Tactic.Ring
import Definitions.Def_NarrowDNF_BourgainNoise
import Definitions.Def_NarrowDNF_Fourier
import Definitions.Def_NarrowDNF_Influence
import Definitions.Def_NarrowDNF_ProductMeasure

namespace NarrowDNF.BourgainNoise
end NarrowDNF.BourgainNoise

namespace NarrowDNF.FiberShift
end NarrowDNF.FiberShift

namespace NarrowDNF.Influence
end NarrowDNF.Influence

namespace NarrowDNF.ProductMeasure
end NarrowDNF.ProductMeasure
noncomputable section
open scoped BigOperators
open NarrowDNF
open NarrowDNF.BourgainNoise
section Cube
variable {ι : Type*} [Fintype ι] [DecidableEq ι]
Formal statement
theorem NarrowDNF.BourgainNoise.tensorNoise_selfAdjoint (p : ℝ) (ρ : ι → ℝ)
    (f g : (ι → Bool) → ℝ) :
    ProductMeasure.expectation p (fun x => tensorNoise p ρ f x * g x) =
      ProductMeasure.expectation p (fun x => f x * tensorNoise p ρ g x) := by sorry
Source
https://github.com/liuchliuch/narrow-dnf-lean/blob/eecadd6a5ea0a331d6cf9fd5cb39fc6ec854b372/NarrowDNF/BourgainNoise.lean#L241-L273

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me