Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

E_sign_monomial

Proved

by Harry_Xu · Jun 23, 2026 · Mathlib 0df444a (Lean v4.33.1)

combinatoricsprobabilityrademacher

Sign-cube (Rademacher) orthogonality. Encode a ±1\pm 1±1 sign assignment on the finite index set ι={1,…,n1}×{1,…,n2}\iota = \{1,\dots,n_1\}\times\{1,\dots,n_2\}ι={1,…,n1​}×{1,…,n2​} by the subset ε⊆ι\varepsilon \subseteq \iotaε⊆ι of coordinates carrying +1+1+1 (the complement carries −1-1−1): the sign of coordinate ccc is σc=1[c∈ε]−1[c∉ε]\sigma_c = \mathbf{1}[c\in\varepsilon] - \mathbf{1}[c\notin\varepsilon]σc​=1[c∈ε]−1[c∈/ε]. Averaging the sign monomial ∏cσc mc\prod_c \sigma_c^{\,m_c}∏c​σcmc​​ uniformly over all 2N2^N2N assignments (N=∣ι∣N = |\iota|N=∣ι∣, weight 2−N2^{-N}2−N each) yields

E[∏cσc mc]={1if every mc is even,0otherwise.\mathbb{E}\Big[\textstyle\prod_c \sigma_c^{\,m_c}\Big] = \begin{cases} 1 & \text{if every } m_c \text{ is even},\\ 0 & \text{otherwise.}\end{cases}E[∏c​σcmc​​]={10​if every mc​ is even,otherwise.​

This is the classical Rademacher orthogonality E[∏cεcmc]=∏cE[εcmc]\mathbb{E}[\prod_c \varepsilon_c^{m_c}] = \prod_c \mathbb{E}[\varepsilon_c^{m_c}]E[∏c​εcmc​​]=∏c​E[εcmc​​] with E[εm]=1[m even]\mathbb{E}[\varepsilon^m]=\mathbf{1}[m\text{ even}]E[εm]=1[m even], the sign-survival step of the moment method (Buchholz, Math. Ann. 319 (2001) §2). The left-hand sum is over all subsets ε\varepsilonε of the coordinate set, i.e. the uniform expectation over the discrete cube {±1}N\{\pm1\}^N{±1}N.

Preamble
import Mathlib
open scoped BigOperators
Formal statement
theorem E_sign_monomial {n1 n2 : Nat} (mult : (Fin n1 × Fin n2) → ℕ) :
    ((1 : ℝ) / 2) ^ Fintype.card (Fin n1 × Fin n2) *
        ∑ eps : Finset (Fin n1 × Fin n2),
          ∏ c : (Fin n1 × Fin n2),
            (if c ∈ eps then (1 : ℝ) else -1) ^ (mult c)
      = if (∀ c, Even (mult c)) then 1 else 0 := by sorry
Source
Buchholz, Operator Khintchine inequality in non-commutative probability, Math. Ann. 319 (2001) 1-16, section 2; CR2009 (arXiv:0805.4471) section 6.1 Lemma 6.1

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