E_sign_monomial
Provedcombinatoricsprobabilityrademacher
Sign-cube (Rademacher) orthogonality. Encode a sign assignment on the finite index set by the subset of coordinates carrying (the complement carries ): the sign of coordinate is . Averaging the sign monomial uniformly over all assignments (, weight each) yields
This is the classical Rademacher orthogonality with , the sign-survival step of the moment method (Buchholz, Math. Ann. 319 (2001) §2). The left-hand sum is over all subsets of the coordinate set, i.e. the uniform expectation over the discrete cube .
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 sorrySource
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