Skip to article frontmatterSkip to article content
Site not loading correctly?

This may be due to an incorrect BASE_URL configuration. See the MyST Documentation for reference.

The static quadratic-chaos input and the two-tail obstruction

The time-zero version of two-color covariance control is already a strong statement. The intrinsic estimate used here is Theorem 25.1, from Letwin’s July 2026 version-1 preprint Letwin, 2026. Its application to a localized posterior separates intrinsic quadratic control from the covariance-alignment problem created by unwhitening. The quantified two-tail configuration at the end of the chapter is the static obstruction that both branches of the fixed-cut approach must respect: it fixes the covariance weight of the near-Cheeger variant and marks the boundary of what slice-wise verification can establish for the all-cut variant.

Let X∼νX\sim\nu be isotropic and log-concave, and put

Z=XXT−I.Z=XX^T-I.

For a color

g=1E−ppq,p=ν(E),q=1−p,g=\frac{\one_E-p}{\sqrt{pq}}, \qquad p=\nu(E),\quad q=1-p,

one computes

E[gZ]=pq(ΣE−ΣF+(q−p)δδT).\E[gZ]=\sqrt{pq}\left(\Sigma_E-\Sigma_F+(q-p)\delta\delta^T\right).

At exact balance, p=q=1/2p=q=1/2, this is 12(ΣE−ΣF)\frac12(\Sigma_E-\Sigma_F).

Why ordinary thin shell did not suffice

The thin-shell theorem controls the radial quadratic form:

Var⁡(∣X∣2)≤Cn,\Var(\abs X^2)\le Cn,

which is (25.5) only for M=I/nM=I/\sqrt n. Applying thin shell to every projection PP gives

Var⁡(XTPX)≤Crank⁡(P).\Var(X^TPX)\le C\operatorname{rank}(P).

For a positive semidefinite matrix M=∫0∞Ps dsM=\int_0^\infty P_s\dd s, where Ps=1{M≥s}P_s=\one_{\{M\ge s\}}, Minkowski yields

∥XTMX−Tr⁡M∥L2≤C∫0∞rank⁡(Ps) ds.\norm{X^TMX-\Tr M}_{L^2} \le C\int_0^\infty\sqrt{\operatorname{rank}(P_s)}\dd s.

The right-hand side is the Lorentz ℓ2,1\ell_{2,1} norm of the eigenvalue sequence of MM, bounded by Clog⁡n∥M∥HSC\sqrt{\log n}\norm M_{\HS}. Thus projection thin-shell estimates by themselves give only

Var⁡(XTMX)≲log⁡n ∥M∥HS2,\Var(X^TMX)\lesssim \log n\,\norm M_{\HS}^2,

a factor log⁡n\log n away from the dimension-free conclusion of Theorem 25.1.

Projection tests cannot remove the logarithm

The logarithm is not merely an artifact of the integration. There is an abstract positive operator TT on symmetric matrices such that

⟨P,TP⟩≤Crank⁡(P)\inner{P}{TP}\le C\operatorname{rank}(P)

for every orthogonal projection PP, while ∥T∥op≃log⁡n\norm T_{\op}\simeq\log n.

Let

Hn=∑i=1n1i,N=diag⁡(1Hn,12Hn,…,1nHn),H_n=\sum_{i=1}^n\frac1i, \qquad N=\diag\left(\frac1{\sqrt{H_n}},\frac1{\sqrt{2H_n}},\ldots,\frac1{\sqrt{nH_n}}\right),

so that ∥N∥HS=1\norm N_{\HS}=1, and define

T(M)=Hn⟨M,N⟩N.T(M)=H_n\inner{M}{N}N.

Ky Fan’s principle gives, for every rank-rr projection PP,

⟨P,N⟩≤∑i=1r1iHn≤2rHn.\inner{P}{N}\le\sum_{i=1}^r\frac1{\sqrt{iH_n}}\le2\sqrt{\frac r{H_n}}.

Therefore ⟨P,TP⟩≤4r\inner{P}{TP}\le4r, whereas ∥T∥op=Hn≃log⁡n\norm T_{\op}=H_n\simeq\log n. This is not a log-concave counterexample. It shows that projection tests alone cannot imply quadratic-chaos thin shell; Letwin’s proof escapes the obstruction by using moment measures and a matrix Stein kernel rather than only projection data.

Static lesson

A fixed-cut argument cannot rely only on radial information or on projection tests. Theorem 25.1 supplies the full intrinsic quadratic-chaos estimate, but Corollary 25.1 shows exactly what whitening loses: the Euclidean Riccati source may still be amplified by λmax⁡(At)2\lmax(A_t)^2. The remaining task is therefore dynamic or geometric control of the alignment with AtA_t, attached to the fixed cut EE.

The quantified two-tail obstruction and the weight calibration

The following sharpens the qualitative two-tail warning above by tracking the excess of the configuration, not only its covariance contrast. It is the static obstruction used in covariance-weighted form by the near-Cheeger variant (Chapter The fixed cut: the near-Cheeger variant) and the configuration whose dynamical occupation the all-cut variant must control (Chapter The fixed cut: the mass martingale and the Carleson estimate).

What this chapter argues against

The two remarks below name the proof shapes the computations of this chapter argue against. Each records what a proof should not try to do, not a theorem; later chapters cite them as heuristic barriers, never as a step in a proof.

References
  1. Letwin, B. (2026). The KLS Constant is O(\log1/4 n).
  2. Carbery, A., & Wright, J. (2001). Distributional and Lq Norm Inequalities for Polynomials over Convex Bodies in \mathbbRn. Mathematical Research Letters, 8(3), 233–248. 10.4310/MRL.2001.v8.n3.a1