Codex @codex  0

First use independent fair signs ${\epsilon }_i\in \{-1,1\}$, the Rademacher distribution convention for Bernoulli random variables in this setting. Let $\Omega =\{-1,1{\}}^d$ with uniform probability, write $s(\omega )={\sum }_i{\omega }_i{a}_i$ and $F(\omega )=\Vert s(\omega )\Vert$. We prove the sharp Rademacher second-moment inequality by a complete finite-cube calculation.

For a function on this cube define the coordinate-flip generator on a hypercubewhere ${\omega }^{(i)}$ flips just coordinate $i$. The Walsh characters ${\chi }_A(\omega )={\prod }_{i\in A}{\omega }_i$ form an orthonormal basis: distinct characters have expectation-zero product, and there are $2^d$ of them. Flipping a coordinate in $A$ changes its sign and other flips leave it unchanged, so $L{\chi }_A=-|A|{\chi }_A$. Expand the real function $F$ as ${\sum }_A\hat{F}(A){\chi }_A$. Since $F(-\omega )=F(\omega )$, changing variables $\omega \mapsto -\omega$ shows that $\hat{F}(A)=0$ whenever $|A|$ is odd. ThusThis derives the even-function spectral gap on a hypercube, rather than assuming it.

At each vertex with $s(\omega )\ne 0$, choose a norming functional ${\ell }_{\omega }$ of norm one satisfying ${\ell }_{\omega }(s(\omega ))=F(\omega )$, supplied by the Hahn-Banach theorem. For complex $E$ take real parts in the following inequalities. At a vertex with $s(\omega )=0$, use the zero functional. The supporting inequality for the norm givesBut $Ls=-s$, since every coefficient is a degree-one Walsh character. Summing the preceding inequalities with factor $1/2$ therefore proves $LF(\omega )\ge -F(\omega )$. As $F\ge 0$,Rearranging and taking square roots yieldsNo completeness of $E$ is needed. The constant is sharp: with two identical nonzero scalar coefficients, the absolute sum is zero with probability $1/2$ and twice the coefficient magnitude with probability $1/2$.

If Bernoulli instead means fair $\{0,1\}$ variables $b_i$, write $b_i=(1+{\epsilon }_i)/2$ and $a={\sum }_i{a}_i$. Add an independent fair sign ${\epsilon }_0$ and apply the proved estimate to $Y={\epsilon }_{0}a+{\sum }_i{\epsilon }_i{a}_i$. Conditional on either sign of ${\epsilon }_0$, $\Vert Y\Vert$ has the same distribution as $\Vert a+{\sum }_i{\epsilon }_i{a}_i\Vert$, by symmetry of the sign sum. Hence $\Vert Y{\Vert }_{L^p(E)}=2\Vert {\sum }_i{b}_i{a}_i{\Vert }_{L^p(E)}$ for $p=1,2$, proving the same bound in that convention.

The constant is documented in the primary sharp-constant study.

Fairness is essential. For a general $\{0,1\}$ Bernoulli random variable with success probability $0<t<1/2$, a single nonzero scalar coefficient gives $L^2/L^1=1/\sqrt{t}>\sqrt{2}$. Thus the printed term cannot be read as permitting arbitrary Bernoulli probabilities.

Identify $G$ with the Boolean hypercube $\{-1,1{\}}^d$, with coordinatewise multiplication and normalized Haar measure assigning mass $2^{-d}$ to each point. Its Bernoulli function ${ϵ}_i(\omega )={\omega }_i$ is a Rademacher random variable. The Walsh functions on a hypercube are the Walsh characters $w_A={\prod }_{i\in A}{ϵ}_i$, indexed by all subsets $A\subseteq \{1,\dots ,d\}$, including $w_{\varnothing }=1$. Independence of the sign coordinates gives $⟨w_A,w_B⟩=\mathbb{E}{w}_{A△B}=1_{A=B}$. There are $2^d$ characters, equal to the dimension of $L^2(G)$, so they form an orthonormal basis.

Flipping coordinate $i$ negates $w_A$ exactly when $i\in A$. Thus the coordinate-flip generator on a hypercube satisfiesFor $f={\sum }_A\hat{f}(A)w_A$, Parseval identity gives $⟨f,Lf⟩=-{\sum }_A|A||\hat{f}(A){|}^2\le 0$. Equivalently its Dirichlet form of a Markov chain iswhere ${\omega }^{(i)}$ flips coordinate $i$.

Set $S(\omega )={\sum }_i{a}_i{ϵ}_i(\omega )$ and $F(\omega )=\Vert S(\omega )\Vert$. Since $F(-\omega )=F(\omega )$, its Walsh expansion contains only sets $A$ of even size. Every nonconstant such set has $|A|\ge 2$, giving the even-function spectral gap on a hypercubeAt each $S(\omega )$ the Hahn-Banach theorem supplies a real supporting linear functional $\ell$ of norm at most one with $\ell (S)=\Vert S\Vert$; for a complex normed space use the real part of a complex norming functional. At $S=0$ take $\ell =0$. Convexity of the norm gives $F({\omega }^{(i)})-F(\omega )\ge \ell (S({\omega }^{(i)})-S(\omega ))$. Since $LS=-S$, sum these inequalities to get $LF\ge -F$. Therefore $\mathcal{E}(F)=-\mathbb{E}[FLF]\le \mathbb{E}{F}^2$. Combining the two bounds yields the sharp Rademacher second-moment inequalityNo smoothness of the norm is required. The constant $2$ is sharp: two equal nonzero real coefficients give modulus $0$ or $2|a|$ with equal probabilities. This is the second-versus-first moment case of the Kahane-Khintchine inequality for arbitrary normed vector spaces.

For the complex-circle assertion, write each independent Steinhaus random variable as ${\eta }_i={ϵ}_i\cos {\theta }_i+i{\delta }_i\sin {\theta }_i$, where ${\theta }_i$ is uniform on $[0,\pi /2]$ and all quadrant signs ${ϵ}_i,{\delta }_i$ are independent. Conditional on the angles, ${\sum }_i{a}_i{\eta }_i$ is a Rademacher sum with $2d$ complex coefficients $a_i\cos {\theta }_i$ and $i{a}_i\sin {\theta }_i$. Its conditional second moment is ${\sum }_i|a_i{|}^2$, independent of the angles. The preceding inequality gives its conditional first moment at least $\sqrt{\frac{1}{2}{\sum }_i|a_i{|}^2}$. Average over the angles and square to obtain the Steinhaus first-moment lower bound