Alphabeta Math
Pipeline-generated
How statement and proof provenance work

The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.

  • Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
  • AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
  • AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.

These labels describe origin, not correctness: citations and verification chips remain separate evidence.

Robust Covariance and Sparse Robust Estimation

1 · Prerequisites

2 · Summary

This page separates two observation models that can produce different covariance guarantees. Under Gaussian Huber contamination, an arbitrary probability law contaminates an iid sample while the target remains the clean Gaussian covariance. Under a clean heavy-tail model, the sample is uncorrupted and the finite matrix variance controls the covariance procedure. It proves dense and single-block sparse Gaussian Huber rates in squared operator norm, with global and bounded-class Borel maximizing selectors. A local trace-aware theorem proves the clean heavy-tail guarantee under D=max⁡{d,(tr⁡Σ/σ0)2} and the stated sample condition, including the same-sample pilot. Separate counterexamples refute the source's two-axis trace comparison and its former intrinsic-ratio-only pilot guarantee; they do not refute the trace-aware theorem.

Clean heavy-tail covariance

The radial-truncation estimator retains its original same-sample geometric- median pilot and adaptive scale rule. Its complete proof separates ambient dimension from intrinsic matrix variance. Local Golden–Thompson and matrix Bernstein arguments give a known-mean bound for every sample size; a uniform pilot-ball comparison handles a pilot computed from the same observations. A trace-aware sufficient sample condition gives the fixed-scale and adaptive constants three and eighteen for every clean finite-fourth-moment law. The adaptive proof pays the common pilot failure once and recovers the unrounded logarithmic probability factor through sharper event budgets. The companion axis-family counterexample shows why the former intrinsic- ratio-only sample condition fails, independently of the separate two-axis counterexample to the source trace inequality.

3 · Logical flowchart

4 · Definitions, theorems and proofs

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-6-luna)Open item page →

Covariance matrix of a finite-dimensional random vector

Definition

Let X=(X1,…,Xp) be a measurable random vector in Rp, where p≥1 is finite, and assume E∥X∥22<∞. Define the mean coordinatewise by μj=EXj and define the covariance matrix by Σ:=E[(X−μ)(X−μ)T], where each entry is the expectation of the corresponding real random variable. Write tr⁡(Σ)=∑j=1pΣjj.

The well-definedness lemma proves these expectations are finite, Σ is symmetric positive semidefinite, and tr⁡(Σ)=E∥X−μ∥22.

LemmaStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-6-luna)Open item page →

Finite-dimensional Golden–Thompson trace inequality

Statement

For Hermitian matrices H,K∈Cp×p with p≥1, tr⁡exp⁡(H+K)≤tr⁡(exp⁡(H)exp⁡(K)). Here exp⁡(A)=∑j=0∞Aj/j! is the norm-convergent finite-matrix exponential series. No commutativity assumption is imposed.

Facts & Assumptions

Given: The Hermitian matrices H,K and the usual Euclidean operator norm. The trace is the sum of diagonal entries as in The trace tr⁡(A) as the sum of the diagonal entries.

[F1]

The finite singular value decomposition is supplied by Every linear map between finite-dimensional real or complex inner product spaces admits a singular value decomposition. If sj(A) are the singular values, set ∥A∥q=(∑jsj(A)q)1/q for q≥1. The operator norm is the largest singular value; this follows immediately by applying the diagonal singular-value matrix to a unit vector. Unitary multiplication preserves these norms.

[F2]

Complex spectral theorem: a normal endomorphism of a finite-dimensional complex inner product space has an orthonormal eigenbasis, and conversely supplies orthonormal eigenbases for Hermitian matrices. In particular exp⁡(itH) is unitary for real t, and exp⁡(H) is positive definite. The exponential series converges uniformly on every norm-bounded matrix set, because ∥Aj/j!∥≤∥A∥j/j!; thus it is continuous and its entries are entire functions of a scalar complex multiplier.

[F3]

Hadamard three-lines theorem: a bounded continuous scalar function on 0≤Re⁡z≤1 that is holomorphic inside and has boundary moduli at most M0,M1 satisfies ∣f(s)∣≤M01−sM1s for 0<s<1.

Proof

technique · direct
1.1F1givenalgebra

We first record two elementary trace estimates. If A=Udiag⁡(aj)V∗ is a singular value decomposition, cyclically expanding the finite diagonal sum gives tr⁡(AB)=∑jaj⟨V∗BUej,ej⟩, so ∣tr⁡(AB)∣≤∥A∥1∥B∥op. Also tr⁡(AB)=∑i,jAijBji, so scalar Cauchy–Schwarz gives ∣tr⁡(AB)∣≤∥A∥2∥B∥2, since ∥A∥22=tr⁡(A∗A)=∑i,j∣Aij∣2 by the singular value decomposition. These arguments also prove the trace cyclicity used here by interchanging two finite sums.

1.2F1F2algebra

Set F(z)=exp⁡(zH/2)exp⁡(zK/2) and M=∥exp⁡(H/2)exp⁡(K/2)∥2>0. The function F is entrywise entire and uniformly bounded on the closed strip: for z=x+iy each exponential is the product of a bounded positive real exponential with a unitary imaginary exponential of the same Hermitian matrix. On the line x=0, ∥F(iy)∥op=1. On x=1, the identity F(1+iy)=exp⁡(iyH/2)exp⁡(H/2)exp⁡(K/2)exp⁡(iyK/2) and unitary invariance give ∥F(1+iy)∥2=M.

1.3F1constructalgebra

We need a finite eigenvalue comparison only for a diagonalizable invertible matrix A. Order its eigenvalue moduli and its singular values decreasingly. For 1≤k≤p, the kth exterior space has the orthonormal wedge basis ej1∧⋯∧ejk, j1<⋯<jk, and its induced map sends a wedge to the wedge of the images. This defines the finite matrix ⋀kA directly by multilinearity and alternation. The singular value decomposition makes its norm ∏j=1ksj(A): wedges of the two singular-vector orthonormal bases give diagonal coefficients consisting of all k-fold singular-value products. Wedges of the first k independent eigenvectors are nonzero eigenvectors with eigenvalue ∏j=1kλj(A); nonvanishing follows by expanding independent vectors in a basis and noting that some k-minor is nonzero. The norm bounds the modulus of an eigenvalue, proving ∏j=1k∣λj(A)∣≤∏j=1ksj(A). This uses only finite bases and finite determinants.

2.1F1F2F3step 1.1step 1.2constructalgebra

Fix 0<s<1, put q=2/s and q′=2/(2−s), and choose a singular value decomposition F(s)=Udiag⁡(aj)V∗. All aj are positive because F(s) is invertible. Set N=(∑jajq)1/q>0 and bj=(aj/N)q−1, so ∑jbjq′=1. Define G(z)=Vdiag⁡(exp⁡(q′(1−z/2)log⁡bj))U∗ and g(z)=tr⁡(G(z)F(z)). These functions are continuous and bounded on the closed strip and holomorphic inside: their entries are finite sums of entire exponentials and their moduli are bounded uniformly in the imaginary coordinate. On its left boundary ∥G(iy)∥1=∑jbjq′=1, and on its right boundary ∥G(1+iy)∥2=(∑jbjq′)1/2=1. The two trace estimates of step 1.1 therefore bound ∣g∣ by 1 and M on the respective boundaries. Since q′(1−s/2)=1, one has g(s)=∑jajbj=N. Applying [F3] yields ∥F(s)∥2/s≤Ms.

2.2step 1.3algebra

Put xj=log⁡∣λj(A)∣ and yj=log⁡sj(A) in decreasing order. Step 1.3 gives ∑j=1kxj≤∑j=1kyj for every k. For any real u, the positive terms form an initial segment, so ∑j(xj−u)+=max⁡0≤k≤p(∑j=1kxj−ku)≤∑j(yj−u)+. For every c>0, multiply by c2ecu and integrate: c2∫−∞x(x−u)ecu du=ecx, as follows by evaluating the elementary exponential primitive at finite lower limits and sending that limit to −∞. The finite sums can be integrated termwise and all integrands are nonnegative, giving ∑j∣λj(A)∣c≤∑jsj(A)c.

3.1F2step 1.2step 2.1step 2.2algebra

For each integer n≥2, let An=F(1/n). It is similar to the positive definite matrix exp⁡(K/4n)exp⁡(H/2n)exp⁡(K/4n), since conjugating An by exp⁡(K/4n) gives that matrix. Thus [F2] makes An diagonalizable with positive eigenvalues. Apply step 2.2 with c=2n and step 2.1 with s=1/n to obtain tr⁡(An2n)≤∑jsj(An)2n=∥An∥2n2n≤M2.

4.1F1F2step 1.1step 3.1algebra∎

The exponential series gives An=I+(H+K)/(2n)+O(n−2) and Bn:=exp⁡((H+K)/(2n))=I+(H+K)/(2n)+O(n−2) in operator norm, where the constants depend only on the fixed matrices. Also ∥An∥,∥Bn∥≤ec/n for one fixed c. The telescoping identity AN−BN=∑j=0N−1Aj(A−B)BN−1−j, valid by cancellation without commutativity, gives ∥An2n−Bn2n∥=O(n−1). The addition law for exponential series of scalar multiples of one matrix gives Bn2n=exp⁡(H+K). Therefore tr⁡exp⁡(H+K)=lim⁡ntr⁡(An2n)≤M2=tr⁡(exp⁡(H)exp⁡(K)), using ∣tr⁡C∣≤p∥C∥op and cyclicity to evaluate the Hilbert–Schmidt square M2. This is the claimed inequality.

LemmaStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-6-luna)Open item page →

The Gaussian matrix-depth scale constant exists uniquely

Statement

Let Φ(t)=N(0,1)((−∞,t]). There is a unique β>0 such that Φ(β)=3/4.

Facts & Assumptions

Given: The standard normal probability law N(0,1).

[F1]

Standard normal and normal laws defines N(0,1) by the positive even density e−x2/2/2π, whose integral over R is one.

[F2]

Continuity from below for measures: measures of increasing measurable sets converge to the measure of their union.

Proof

1.1F1F2algebra

Since the standard-normal density is bounded by 1/2π, ∣Φ(t+h)−Φ(t)∣≤∣h∣/2π; hence Φ is continuous. The density is positive, so its integral over every nonempty interval is positive and Φ is strictly increasing. Evenness and total mass one give Φ(0)=1/2. Applying [F2] to (−∞,n] as n→∞ gives Φ(n)→1.

2.1step 1.1F3construct∎

Choose an integer n with Φ(n)>3/4. By [F3] on [0,n], some q∈(0,n) satisfies Φ(q)=3/4; strict increase from step 1.1 makes q unique. Then β=q2>0 is the unique positive value with Φ(β)=3/4.

LemmaStatement: AI-adaptedProof: AI-adaptedOpen item page →

Uniform deviation for squared-projection slabs

Statement

Let X1,…,XN be independent random elements of Rp with common Borel probability law P. Let S1,…,Sm⊆[p] be nonempty coordinate sets with ∣Sj∣≤s, where m,s≥1, and define VSj:={u∈Rp:∥u∥2=1, ui=0 for i∉Sj}. For u∈VSj and t∈R, put Au,t:={x∈Rp:∣uTx∣2≤t} and PN(A):=N−1∑i=1N1{Xi∈A}. There is a universal constant C such that, for every 0<δ<1, P ⁣(max⁡1≤j≤msup⁡u∈VSjt∈R∣PN(Au,t)−P(Au,t)∣≤C[s+1N+log⁡(m/δ)N])≥1−δ. The same bound holds for the upper-tail sets {x:∣uTx∣2≥t}.

Facts & Assumptions

Given: Independent random elements, their common law P, a finite support family (Sj)j=1m, and 0<δ<1.

[F1]

Independent random elements: independence means the generated event sigma-algebras factor on finite intersections.

[F3]

Dominated convergence: pointwise convergence of indicators bounded by 1 passes to their probabilities.

[F4]

Continuity from below for measures: probabilities of increasing measurable sets converge to the probability of their union.

[F5]

Jensen's integral inequality for a probability measure: Jensen's inequality applies to the bounded empirical-process suprema below.

[F7]

The norm ∥v∥=⟨v,v⟩ induced by a real or complex inner product and Cauchy–Schwarz: ∣⟨x,y⟩∣≤∥x∥ ∥y∥, with equality exactly for dependent pairs give the Euclidean norm and Cauchy--Schwarz inequality. The inner-product norm is definite, homogeneous, and satisfies the triangle inequality gives homogeneity and the triangle inequality, hence ∣∥v∥2−∥w∥2∣≤∥v−w∥2.

[F8]
[F9]

The rationals embed densely in the reals places a rational strictly between any two reals; Q is countably infinite gives a fixed enumeration of the rationals.

Proof

1.1F1F2F3F7F9construct

The supremum is measurable. Fix S with d=∣S∣. By [F9], rational vectors supported in S can be enumerated by enumerating their finite tuples of rational indices in increasing sum; their nonzero normalizations form a countable subclass of VS. For u∈VS and each k≥1, choose the first rational tuple qk in that enumeration satisfying ∣(qk)i−ui∣<1/(4dk2) for i∈S. Such a tuple exists by rational density, and ∥qk−u∥2<1/(4k2), so qk≠0. With uk=qk/∥qk∥2, [F7] gives ∥uk−u∥2≤∣1−∥qk∥2∣+∥qk−u∥2≤2∥qk−u∥2≤k−2. For t≥0, choose the first rational tk∈(t+1/k,t+2/k) in the fixed enumeration. Cauchy--Schwarz yields ∣(ukTx)2−(uTx)2∣≤2∥x∥22k−2. Thus 1Auk,tk(x)→1Au,t(x) for every x, including boundary points: at equality the threshold margin 1/k eventually exceeds this error, while away from equality convergence preserves the strict sign. By [F3] their P-probabilities converge; finite empirical probabilities converge too. Negative thresholds give the empty set, already represented by rational thresholds. Hence the supremum equals that over the countable subclass of normalized rational vectors and rational thresholds, and is measurable. The first-element rules use no choice axiom.

1.2F1algebra

Fix a support S of size k≤s. Trace patterns of affine halfspaces on r fixed points are sign patterns of r affine hyperplanes in a (k+1)-dimensional parameter space. The number of open regions is at most ∑ℓ=0k+1(rℓ): adding one hyperplane creates at most the number of regions cut on that hyperplane, so induction on r and the dimension gives Pascal's recurrence and this sum. Weak-boundary traces are also counted, since on a finite point set a halfspace threshold can be increased slightly without changing its trace.

2.1step 1.2algebra

A slab Au,t with t≥0 is the intersection of the halfspaces uTx≤t and −uTx≤t in the same k coordinates; when t<0 it is empty. Hence its trace count on r points is at most (∑ℓ=0k+1(rℓ))2. For r≥q:=k+1, set x=q/r. Since xℓ≥xq for ℓ≤q, ∑ℓ=0q(rℓ)≤x−q(1+x)r≤(er/q)q. If r≥16q, then 2r>(er/q)2q: the logarithmic difference is positive at r/q=16 and has positive derivative thereafter. Thus r points cannot be shattered by the slab class, so its VC dimension is at most 16(k+1)≤16(s+1).

2.2F1F2F5F6step 1.1algebra

Let εi be independent uniform signs, independent of the sample, and let X1′,…,XN′ be an independent copy. Jensen's inequality [F5], conditional on the original sample, gives Esup⁡A∣PN(A)−P(A)∣≤Esup⁡A∣PN(A)−PN′(A)∣. Each pair (Xi,Xi′) is exchangeable, so independently swapping its coordinates with sign εi leaves the joint law unchanged. The triangle inequality then gives Esup⁡A∣PN(A)−P(A)∣≤2 Esup⁡A∣N−1∑i=1Nεi1A(Xi)∣. The ghost sample and signs exist on finite product spaces by [F6]; all suprema use the countable class from step 1.1.

2.3F1F2step 1.1algebra

Replacing one observation changes every empirical set probability by at most 1/N, so the supremum F changes by at most 1/N. In the Doob martingale of F, each conditional increment therefore has a range of width at most 1/N. If a random variable lies in an interval of width c, the log-mgf of its centered version has second derivative equal to a tilted variance at most c2/4; integrating twice gives Eeλ(Y−EY)≤eλ2c2/8. Iterating these bounds and optimizing the exponential Markov inequality yields P(F−EF>t)≤e−2Nt2.

3.1step 2.1algebra

On a fixed N-point sample the trace class is finite. For 0<ρ≤1, if M traces are pairwise separated by more than ρ in d(A,B)=PN(A△B), sample r=⌈3ρ−2log⁡(2M)⌉ coordinates uniformly with replacement. For a fixed pair the probability that the traces agree at all sampled coordinates is at most e−rρ2; a union bound over pairs shows that some coordinate sample distinguishes all M traces. Put D=16(s+1). If r<D, then M≤2r≤2D. If r≥D, step 2.1 bounds the trace count by (er/q)2q≤(er/D)2D, where q=∣S∣+1≤D; the inequality follows because a↦alog⁡(er/a) is increasing for 0<a≤r. Writing y=log⁡(M)/D, the choice of r gives r≤Cρ−2D(y+1) and hence y≤2log⁡(Cρ−2(y+1)). Put A=log⁡(Cρ−2)≥1. If y≥10, then log⁡(y+1)≤y/4, so y≤4A; if y<10, then y<10A. Thus y≤10A≤20log⁡(C0/ρ) for a universal C0. After increasing C0, the same bound covers r<D. A maximal ρ-separated set is a ρ-net, so N(ρ)≤(C0/ρ)20D.

4.1F8step 3.1algebra

To obtain the sign MGF bound used for chaining, for t≥0 put h(t)=t−tanh⁡t. Then h(0)=0 and h′(t)=1−sech⁡2t=tanh⁡2t≥0 by [F8]; the mean value theorem gives h(t)≥0. Put g(t)=t2/2−log⁡(cosh⁡t). Then g(0)=0 and g′(t)=h(t)≥0, so g(t)≥0; evenness extends the bound to every real t. Hence cosh⁡t≤et2/2. Conditional on the sample, the sign process ZA=N−1∑iεi1A(Xi) therefore has increments satisfying Eεeλ(ZA−ZB)≤eλ2d(A,B)2/(2N), by multiplying the independent sign MGFs with coefficients λ(1A(Xi)−1B(Xi))/N. Choose empirical L2 nets Tj at radii 2−j. Telescope each trace through its nearest net points; adjacent levels differ by at most 3⋅2−j in d. For L centered sub-Gaussian variables with common proxy σ2, Emax⁡ℓ≤L∣Wℓ∣≤σ2log⁡(2L) follows by Jensen's inequality applied to the log-sum-exp of eλWℓ and e−λWℓ, followed by minimization in λ. Thus the conditional expected supremum is at most CN(1+∑j≥12−jlog⁡(2N(2−j)N(2−j+1))). The finite trace class makes the sum terminate.

5.1step 3.1step 2.2step 4.1algebra

From step 3.1, log⁡N(ρ)≤20Dlog⁡(C0/ρ). Therefore the dyadic sum in step 4.1 is at most CD∑j≥12−jj+1≤C′D; the base trace contributes at most N−1/2 by Cauchy--Schwarz. Combining the symmetrization bound from step 2.2 with the chaining bound from step 4.1 yields Esup⁡A∣PN(A)−P(A)∣≤C′′(s+1)/N.

6.1step 5.1step 2.3algebra

Apply step 2.3 with t=log⁡(m/δ)/(2N) separately to each support class and take a union bound over its m supports. Combining with step 5.1 proves the displayed probability bound after increasing the universal constant C.

7.1F4step 6.1algebra∎

For any u,t, {x:∣uTx∣2<t}=⋃k≥1{x:∣uTx∣2≤t−1/k}, an increasing union. Continuity from below [F4] makes both P and PN probabilities converge to those of the strict lower-tail set. The deviation bound in step 6.1 holds at every threshold, so it passes to this limit. Taking complements gives the same bound for the upper weak tails {∣uTx∣2≥t}.

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-6-luna)Open item page →

Bounded-spectrum covariance class

Definition

For M>0 and p≥1, define Fp(M):={Σ∈Rp×p:Σ=ΣT, Σ⪰0, ∥Σ∥op≤M}. For positive semidefinite Σ, the operator norm is its largest eigenvalue, so this is the bounded-spectrum covariance class.

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-6-luna)Open item page →

Matrix variance for covariance estimation

Definition

For a random vector X∈Rp with mean μ and covariance Σ as in Covariance matrix of a finite-dimensional random vector, assume E∥X−μ∥24<∞. Its matrix variance is σ02:=∥E ⁣[∥X−μ∥22(X−μ)(X−μ)T]∥op. When ∥Σ∥op>0, define the intrinsic ratio d:=σ02∥Σ∥op2.

The expectation is entrywise. The finite fourth moment makes every entry integrable. This definition imposes neither Huber contamination nor sample replacement.

LemmaStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-6-luna)Open item page →

Bounded independent matrix Bernstein bound from the trace exponential

Statement

Let B1,…,Bm be independent centered random Hermitian q×q matrices, q,m≥1. Suppose R>0, v≥0, and ∥Bi∥op≤Ralmost surely,∥EBi2∥op≤v(1≤i≤m). Writing Y=∑i=1mBi, for 0<s<3/R one has Etr⁡exp⁡(sY)≤qexp⁡(ms2v2(1−sR/3)). Consequently, for u>0 when v>0, P{λmax⁡(Y)≥u}≤qexp⁡(−u22(mv+Ru/3)). For every b>0, the following convenient forms also hold: P{λmax⁡(Y)>2mvb+2Rb3}≤qe−b,P{∥Y∥op>2mvb+2Rb3}≤2qe−b. If v=0, all Bi and Y vanish almost surely, so the displayed positive-threshold conclusions remain valid.

Facts & Assumptions

Given: The matrices, constants and independent laws of the statement, with expectation as in Expectation of a nonnegative or integrable random variable. Matrix expectation is taken entrywise. The uniform bound makes all entries and all exponential series integrable.

[F1]

Complex spectral theorem: a normal endomorphism of a finite-dimensional complex inner product space has an orthonormal eigenbasis, and conversely supplies the Hermitian spectral calculus. The semidefinite order A⪯C means x∗(C−A)x≥0 for every vector x. Expectation preserves this order, by taking the expectation of each quadratic form.

[F2]

Finite-dimensional Golden–Thompson trace inequality gives tr⁡exp⁡(H+K)≤tr⁡(exp⁡(H)exp⁡(K)) for Hermitian matrices. Trace is as in The trace tr⁡(A) as the sum of the diagonal entries.

[F3]

Independence is in the sense of Independent random elements. By Independent random elements have product joint law, integration of a bounded measurable function of these matrices can be performed successively over their product law.

[F4]

The scalar Markov bound for a nonnegative random variable is Markov's inequality for random variables.

Proof

technique · direct
1.1givenF1algebra

Fix 0<s<3/R. If ∣x∣≤R and k≥2 is an integer, then xk≤Rk−2x2, including odd k and negative x. Applying the spectral calculus and taking expectations gives EBik⪯Rk−2EBi2. Since k!≥2⋅3k−2 for every k≥2 (start at k=2 and multiply by k+1≥3), the exponential series and EBi=0 yield Eexp⁡(sBi)⪯I+g(s)EBi2⪯eg(s)vI, where g(s)=s2/[2(1−sR/3)]. The first inequality is the sum of the convergent geometric majorant ∑k≥2skRk−2/k!≤g(s), and the second uses 0⪯EBi2⪯vI and the scalar inequality 1+a≤ea. Termwise expectation is justified by the uniform norm majorant ∑k(sR)k/k!.

2.1F1F2F3step 1.1algebra

Let Yj=∑i=1jBi, with Y0=0. For each fixed value of Yj−1, [F2] and integration over the independent Bj give EBjtr⁡exp⁡(sYj−1+sBj)≤tr⁡(exp⁡(sYj−1)Eexp⁡(sBj))≤eg(s)vtr⁡exp⁡(sYj−1). The last implication follows because P⪰0 and Q⪯cI imply tr⁡(PQ)≤ctr⁡P: diagonalize P and sum its nonnegative eigenvalues times the bounded diagonal quadratic forms of Q. Successive integration using [F3] and iteration from tr⁡I=q prove Etr⁡exp⁡(sY)≤qemg(s)v.

3.1F1F4step 2.1choosealgebra

By [F1], tr⁡exp⁡(sY)≥exp⁡(sλmax⁡(Y)). Markov's inequality [F4] and step 2.1 therefore give P{λmax⁡(Y)≥u}≤qexp⁡(−su+mg(s)v) for every u>0 and 0<s<3/R. If v>0, choose s=u/(mv+Ru/3), which belongs to that interval. Substitution gives −su+mg(s)v=−u2/[2(mv+Ru/3)], proving the stated tail bound. The same fixed-parameter bound with > in place of ≥ will also be used below.

4.1F1step 3.1algebra

For b>0 set u=2mvb+2Rb/3. Expanding its square shows u2≥2b(mv+Ru/3): with a=2mvb and c=2Rb/3, the two sides are respectively a2+2ac+c2 and a2+ac+c2. Thus step 3.1 bounds the one-sided failure by qe−b. Applying the same argument to −Bi and taking the union of the two failures bounds the norm failure by 2qe−b, since the norm of a Hermitian matrix is the larger of its maximum eigenvalue and the maximum eigenvalue of its negative.

5.1givenF1step 2.1step 4.1algebra∎

Finally, if v=0, then for each coordinate vector ej, E∥Biej∥22=ej∗(EBi2)ej=0. A nonnegative random variable with zero expectation vanishes almost surely: otherwise one of the events where it exceeds 1/n would have positive probability and positive contribution to the expectation. Intersecting the finitely many full-probability coordinate events gives Bi=0 almost surely; a further finite intersection covers all i. The trace mgf is then q and both strict positive-threshold events are empty. This covers the remaining case and completes all conclusions.

LemmaStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-6-luna)Open item page →

A finite second moment defines a positive semidefinite covariance matrix

Statement

If X∈Rp is measurable and E∥X∥22<∞, then μ=EX and Σ=E[(X−μ)(X−μ)T] in Covariance matrix of a finite-dimensional random vector are well-defined entrywise, Σ is symmetric positive semidefinite, and tr⁡(Σ)=E∥X−μ∥22.

Facts & Assumptions

Given: A finite-dimensional measurable random vector X with E∥X∥22<∞.

[F1]

Covariance matrix of a finite-dimensional random vector defines the mean coordinatewise and covariance entries by E[(Xj−μj)(Xk−μk)].

[F2]

Expectation of a nonnegative or integrable random variable: finite expectation is defined for integrable real random variables.

Proof

1.1givenF1F2algebra

For each coordinate, ∣Xj∣≤∥X∥2 and ∣x∣≤(1+x2)/2 imply E∣Xj∣<∞, so every μj exists. Also E(Xj−μj)2<∞, since (Xj−μj)2≤2Xj2+2μj2.

2.1step 1.1F1F2algebra

For every pair j,k, 2∣(Xj−μj)(Xk−μk)∣≤(Xj−μj)2+(Xk−μk)2. Thus every covariance entry is integrable; all entries are finite and symmetry follows from commutativity of multiplication.

3.1step 2.1F1F2algebra∎

For a∈Rp, aTΣa=E[(aT(X−μ))2]≥0, so Σ is positive semidefinite. Summing the diagonal entries gives tr⁡(Σ)=∑jE(Xj−μj)2=E∑j(Xj−μj)2=E∥X−μ∥22; the sum is finite.

AlgorithmAlgorithm: AI-adaptedProof: Not applicablejudge pass (gpt-6-luna)Open item page →

Adaptive truncated covariance estimator

Definition

Input a finite sample X1,…,Xm∈Rp, confidence parameter β>1, and positive finite scale bounds 0<σmin⁡≤σmax⁡. The computational domain requires k=⌊3.5β⌋+1≤m/2. Statistical guarantees are stated separately: for a clean iid finite-fourth-moment law, use the matrix variance of Matrix variance for covariance estimation and a bracket containing σ0. The statistical conditions are not needed merely to evaluate this finite-sample procedure.

Call Geometric median of block means on (X1,…,Xm) with block count k to obtain the pilot μ^. Use its consecutive blocks in index order, of size ⌊m/k⌋+1 for the first m−k⌊m/k⌋ blocks and ⌊m/k⌋ for the rest. This uses the same sample and is not a sample split.

For a real symmetric matrix A=Qdiag⁡(λi)QT, define ψ(A)=Qdiag⁡(ψ(λi))QT, where ψ(x)=sign⁡(x)min⁡(∣x∣,1). The real spectral theorem makes this definition independent of the chosen orthonormal eigenbasis. Define the finite grid and truncation thresholds σj=2jσmin⁡,J={j∈Z:σmin⁡≤σj<2σmax⁡},θj=1σjβm. For every j∈J, form Σ^m,j=1mθj∑i=1mψ ⁣(θj(Xi−μ^)(Xi−μ^)T). Choose the smallest j∗∈J such that ∥Σ^m,k′−Σ^m,j∗∥op≤6σk′βmfor every k′∈J, k′>j∗, and output Σ^∗=Σ^m,j∗.

This is the clean heavy-tail moment procedure. It makes no Huber contamination or sample-replacement guarantee.

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-6-luna)Open item page →

Single-block sparse covariance class and restricted directions

Definition

For S⊆[p], let G(S):={A=AT∈Rp×p:Aij=0 whenever i∉S or j∉S}, and, for an integer 1≤s≤p, let G(s):=⋃S⊆[p]∣S∣≤sG(S),Fp,s(M):={Σ∈Fp(M):Σ−diag⁡(Σ)∈G(s)}. Here diag⁡(Σ) is the diagonal matrix with the same diagonal entries as Σ. Thus all nonzero off-diagonal entries lie in one common coordinate block of size at most s; no row-sparsity condition is implied.

For S⊆[p], define VS:={u∈Rp:∥u∥2=1, ui=0 for i∉S}. When 1≤s≤p/2, the restricted direction set is Us:=⋃S⊆[p]∣S∣=2sVS.

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-6-luna)Open item page →

Gaussian Huber contamination model for covariance estimation

Definition

Let p≥1, 0≤ϵ≤1, and let Σ be a real positive semidefinite p×p covariance matrix. For any Borel probability law Q on Rp, define Pϵ,Σ,Q:=(1−ϵ)Np(0,Σ)+ϵQ, where Np(0,Σ) is the finite-dimensional Gaussian law from Multivariate normal law, including singular covariance. A sample in this model consists of independent observations with common law Pϵ,Σ,Q. The target is the covariance Σ of the uncontaminated Gaussian component, not the covariance of the mixture.

This is the covariance specialization of the Huber model in Huber contamination model. It is distinct from a clean heavy-tail moment model and from adversarial sample replacement.

LemmaStatement: AI-adaptedProof: AI-generatedjudge pass (gpt-6-luna)Open item page →

Exact block budget for the covariance geometric-median pilot

Statement

Assume Countable Choice. Let X1,…,Xm∈Rp be iid with mean μ, finite covariance Σ, and T=tr⁡Σ. For β>1, put k=⌊3.5β⌋+1≤m/2. Partition the sample into k consecutive blocks by the deterministic balanced rule of Geometric median of block means, and let μ^ be the selected minimum-norm geometric median of their block means. Then P ⁣(∥μ^−μ∥2>11T(β+1)m)≤e−β. In particular the larger radius B=112Tβ/m has the same failure bound. This proves the prescribed covariance-pilot block count without relying on the robust-mean theorem's different confidence convention.

Facts & Assumptions

Given: Countable Choice, iid observations with finite covariance, the balanced block partition, and β>1, k=⌊3.5β⌋+1≤m/2.

[F1]

A geometric median is close when a strict majority is close: if a geometric median of k points is farther than Car from z, more than ak points are farther than r from z, where Ca=(1−a)/1−2a for 0<a<1/2.

[F2]

Covariance matrix of a finite-dimensional random vector: T=tr⁡Σ=E∥Xi−μ∥22.

[F3]

Independent random elements, Disjoint groups of an independent sigma-algebra family remain independent, Measurable coordinatewise functions preserve independence, Independent random elements have product joint law, and Fubini's theorem for L^1 functions on a sigma-finite product: disjoint blocks of an iid sample, their block means, and the bad-block indicators are independent; integrable cross-products of independent centered vectors have expectation zero by the product law and Fubini.

[F5]

The natural logarithm as the inverse of the exponential function, Order, continuity, range, and the product, quotient, and reciprocal laws for the natural logarithm, The natural logarithm has derivative 1/x and equals the integral from 1 to x of 1/t, The chain rule, in one line from Carathéodory: if g is differentiable at c and f is differentiable at g(c), then f∘g is differentiable at c with (f∘g)′(c)=f′(g(c)) g′(c), Sums, scalar multiples, products and quotients: (f+g)′(c)=f′(c)+g′(c), (αf)′(c)=αf′(c), (fg)′(c)=f′(c)g(c)+f(c)g′(c), and (f/g)′(c)=(f′(c)g(c)−f(c)g′(c))/g(c)2 when g(c)≠0, The mean value theorem, as the case g(x)=x of Cauchy's: for f continuous on [a,b] with a<b and differentiable on (a,b) there is c∈(a,b) with f(b)−f(a)=f′(c)(b−a), The first fundamental theorem: if f is integrable on [a,b] and continuous at c, then F′(c)=f(c); in particular a continuous f has F as a primitive, and For ∣r∣<1 the sequence rk is null, and for ∣r∣>1 the sequence ∣r∣k diverges to +∞: the logarithm has derivative 1/x and its laws, the chain rule and FTC apply, the mean value theorem turns a zero derivative into constancy, and tN→0 for 0<t<1. These facts justify the logarithmic series calculation in step 3.1.

[F7]

Geometric median of block means, Measurable minimum-norm geometric-median selection, and The Axiom of Countable Choice (ACω): the prescribed deterministic partition and minimum-norm geometric-median selector are single-valued and Borel under Countable Choice.

Proof

technique · direct

Given: The iid sample, its finite covariance, the deterministic balanced partition, Countable Choice, and the displayed β,k conditions.

1.1givenF2F3F4F7algebra

Suppose T>0, put a=7/18, q=1/10, b=⌊m/k⌋, and r=T/(qb). For a block of size bj, expand E∥bj−1∑i∈Bj(Xi−μ)∥22: diagonal terms sum to bjT by [F2], and each cross term has expectation zero by [F3], because it is integrable by [F4] and the centered factors are independent. Thus E∥Mj−μ∥22=T/bj≤T/b. Markov [F4] gives P(∥Mj−μ∥2>r)≤q. Grouping and measurable images in [F3] make the bad-block indicators independent.

2.1F1F3F4F6step 1.1algebra

Let W be the number of bad blocks. For any λ>0, independence gives EeλW≤(1−q+qeλ)k: each Bernoulli factor is 1+P(bad)(eλ−1)≤1+q(eλ−1), and [F3, F6] factor the product. Since a>q, choose λ=log⁡(a(1−q)/(q(1−a)))>0. Markov [F4] then gives P(W≥ak)≤e−kψ(a;q), where ψ(a;q)=alog⁡(a/q)+(1−a)log⁡((1−a)/(1−q)), by substituting this λ and simplifying. By [F1], ∥μ^−μ∥2>Car implies W>ak, so its probability is at most this bound.

3.1F5F6step 2.1algebra

For x>1 put t=(x−1)/(x+1)∈(0,1), so x=(1+t)/(1−t). For 0≤u≤t, the function g(u)=log⁡((1+u)/(1−u)) has g(0)=0 and, by [F5], g′(u)=1/(1+u)+1/(1−u)=2/(1−u2). The function I(u)=2∫0u(1−v2)−1dv has the same derivative by FTC and the same value at zero, so the mean value theorem applied to g−I gives g(t)=I(t). Integrating 11−u2=∑j=0Nu2j+u2N+21−u2 yields the partial logarithm series plus a remainder between zero and 2t2N+3/((2N+3)(1−t2)), which tends to zero by [F5]. Thus log⁡x=2∑j≥0t2j+1/(2j+1). For t1=13/22 and t2=13/68, the positive series and its geometric tail give log⁡(35/9)>2(t1+t13/3+t15/5+t17/7)>27/20 and log⁡(81/55)≤2(t2+t23/3+t25/(5(1−t22)))<39/100. Hence ψ(7/18;1/10)>(7/18)(27/20)−(11/18)(39/100)=43/150>2/7. Since k>(7/2)β, [F6] gives e−kψ<e−β.

4.1givenF2F4F7step 3.1algebra∎

For a=7/18 and q=1/10, Ca2=121/72. Since b≥m/(2k) and k≤(7/2)β+1, the radius in step 3.1 satisfies Ca2r2≤(605/18)((7/2)β+1)T/m≤121(β+1)T/m. Thus the event at radius 11T(β+1)/m is contained in the event bounded in step 3.1. If T=0, Markov's inequality applied to ∥Xi−μ∥22 shows Xi=μ almost surely for each i; a finite intersection makes every block mean equal μ, and the selected median equals μ. Finally, because β>1, 112Tβ/m is at least the stated radius.

LemmaStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-6-luna)Open item page →

The covariance matrix variance ratio is at least one

Statement

Let X∈Rp have finite fourth moment, mean μ, nonzero covariance Σ, and matrix variance σ02 as in Covariance matrix of a finite-dimensional random vector and Matrix variance for covariance estimation. Then d:=σ02∥Σ∥op2≥1.

Facts & Assumptions

Given: A finite-dimensional random vector X with E∥X−μ∥24<∞ and nonzero covariance Σ.

[F1]

Covariance matrix of a finite-dimensional random vector: Σ is symmetric positive semidefinite and E[(vT(X−μ))2]=vTΣv.

[F2]

Matrix variance for covariance estimation: σ02=∥E[∥X−μ∥22(X−μ)(X−μ)T]∥op.

[F3]

Real spectral theorem: a self-adjoint endomorphism of a finite-dimensional real inner product space has an orthonormal eigenbasis: a nonzero positive semidefinite matrix has a unit eigenvector for its largest eigenvalue, equal to its operator norm.

Proof

1.1F1F2F3algebra

Put Y=X−μ and choose a unit top eigenvector v of Σ, with λ=vTΣv=∥Σ∥op>0 by [F1] and [F3]. The positive semidefinite matrix inside [F2] has operator norm at least its quadratic form at v, so σ02≥E[∥Y∥22(vTY)2]≥E[(vTY)4]. The second inequality follows pointwise from ∥Y∥22≥(vTY)2.

2.1F1F4step 1.1algebra∎

The finite fourth moment makes W=vTY square-integrable. By [F4], E[W4]≥(E[W2])2=λ2. Hence σ02≥∥Σ∥op2, and division by this positive quantity proves d≥1.

LemmaStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-6-luna)Open item page →

Oracle-truncated covariance and vector concentration under finite matrix variance

Statement

Let Z1,…,Zm be independent copies of a centered random vector Z∈Rp, p,m≥1, with nonzero covariance Σ=EZZT and finite fourth moment. Write T=tr⁡Σ,σ02=∥E[∥Z∥22ZZT]∥op. For β>1, σ≥σ0, and t=β/m, set θ=tσ,R=1θ,w(z)=min⁡{1,R∥z∥22},w(0)=1, S=1m∑i=1mw(Zi)ZiZiT,V=1m∑i=1mw(Zi)Zi. Then there are events ES,EV such that P(ESc)≤pe−β,P(EVc)≤p+12e−β, and on the respective events ∥S−Σ∥op≤(2+log⁡2β)σt<2710σt, ∥V∥2≤σ0θ+2Tt+8t3θ. The same S also has the sharper-radius, larger-failure alternative P{∥S−Σ∥op>(2+23+14)σt}≤2pe−β. No independence between these events and a statistic formed from the same sample is asserted or needed.

Facts & Assumptions

Given: The independent vectors and finite-moment assumptions in the statement. Covariance and matrix variance have the meanings in Covariance matrix of a finite-dimensional random vector and Matrix variance for covariance estimation. The fourth moment makes every matrix and scalar expectation used below finite.

[F1]

Real spectral theorem: a self-adjoint endomorphism of a finite-dimensional real inner product space has an orthonormal eigenbasis supplies spectral calculus for real symmetric matrices. For A=zzT, A2=∥z∥22zzT, and the sole possibly nonzero eigenvalue of A is ∥z∥22. Semidefinite order is tested on quadratic forms and is preserved by expectation.

[F2]

Bounded independent matrix Bernstein bound from the trace exponential: for independent centered Hermitian q×q matrices Bi with ∥Bi∥≤R0 and ∥EBi2∥≤v, one has Etr⁡exp⁡(s∑iBi)≤qexp⁡(ms2v/[2(1−sR0/3)]) for 0<s<3/R0. It also proves the associated fixed-parameter one-sided Chernoff bound and the explicit one-sided radius 2mvb+2R0b/3 with failure qe−b; the two-sided failure is 2qe−b.

[F3]

Cauchy–Schwarz in Cauchy–Schwarz: ∣⟨x,y⟩∣≤∥x∥ ∥y∥, with equality exactly for dependent pairs, applied to square-integrable scalar random variables with inner product E(UW), gives ∣E(UW)∣2≤EU2EW2. This expectation inner product may be read on the quotient by almost-sure equality. Independence is as in Independent random elements and is preserved under deterministic measurable transformations, by taking preimages of the defining independent events.

Proof

technique · direct
1.1givenF1F3algebra

Put A=ZZT and Aθ=w(Z)ZZT. The weight is a Borel function, including its declared value at zero, so all transformations used here preserve the independence of the samples by [F3]. The rank-one spectral calculus gives 0⪯Aθ⪯RI and Aθ2⪯A2. For a scalar x≥0, (x−R)+≤x2/(4R): the inequality is immediate for x≤R, and for x≥R it is equivalent to (x−2R)2≥0. Applying it to the eigenvalues of A proves 0⪯A−Aθ⪯θA2/4. Therefore 0⪯Σ−EAθ⪯θEA2/4 and ∥Σ−EAθ∥op≤θσ02/4. Nonzero covariance also implies σ0>0: a positive variance in some unit direction forces E[∥Z∥2⟨Z,v⟩2]≥E⟨Z,v⟩4>0. Thus the displayed thresholds are well-defined.

1.2givenF1F3algebra

Put Y=w(Z)Z. Its norm is at most 1/θ: for ∥Z∥≤R use ∥Y∥≤R, and otherwise use ∥Y∥=R/∥Z∥≤R. Since EZ=0, EY=−E[(1−w(Z))Z]. For a unit vector v, apply [F3] to U=∥Z∥⟨Z,v⟩ and W=(1−w(Z))/∥Z∥, assigning W=0 at zero. Then EU2≤σ02 by matrix variance, and W2≤θ pointwise: it vanishes on ∥Z∥2≤R, and elsewhere is at most 1/∥Z∥2≤1/R. Thus ∣⟨EY,v⟩∣≤σ0θ. Taking the Euclidean dual supremum proves ∥EY∥≤σ0θ.

2.1F1step 1.1algebra

Set Bi=Aθ,i−EAθ. Since both matrices subtracted lie between 0 and RI, −RI⪯Bi⪯RI, whence ∥Bi∥op≤R. Expanding the square and taking expectations, without any commutativity requirement, gives EBi2=EAθ2−(EAθ)2⪯EA2. The left side is positive semidefinite; hence its norm is at most σ02. The matrices Bi are independent and centered.

2.2F1step 1.1step 1.2constructalgebra

For a vector y∈Rp define its symmetric dilation D(y)=(0yTy0) of size p+1. Its square is diag⁡(∥y∥22,yyT); its nonzero eigenvalues when y≠0 are ∥y∥2 and −∥y∥2, as is checked on the span of (1,0) and (0,y/∥y∥). It vanishes on the orthogonal complement, so λmax⁡(D(y))=∥D(y)∥op=∥y∥2, also at zero. For Ci=D(Yi−EY), step 1.2 gives ∥Ci∥≤2/θ. The square identity gives ECi2=diag⁡(E∥Y−EY∥2,E[(Y−EY)(Y−EY)T]). Its norm is at most E∥Y−EY∥2≤E∥Y∥2≤E∥Z∥2=T; for the lower block, test a unit vector and bound its squared scalar projection by the squared norm. The Ci are independent centered symmetric matrices.

3.1F2step 1.1step 2.1choosealgebra

Let b=β+log⁡2 and use [F2] with the fixed Chernoff parameter s=θ; it is admissible since θR=1<3. Its exponent bound is 3mθ2σ02/4. Consequently, for u=3mθσ02/4+b/θ, the one-sided failure is at most pe−b; apply the same statement to −Bi and take a union to obtain P{∥S−EAθ∥op>3θσ02/4+b/(mθ)}≤2pe−b=pe−β. Adding the bias from step 1.1 and using σ0≤σ yields θσ02+b/(mθ)≤(2+(log⁡2)/β)σt. Define ES by this bound. Finally log⁡2<7/10 since the first four nonnegative terms of e7/10 sum to 1+7/10+49/200+343/6000>2; since β>1, the claimed strict bound by 27/10 follows.

3.2F2step 1.1step 2.1algebra

For the alternative radius, apply the two-sided explicit form in [F2] to the same Bi, now with confidence parameter β. After division by m its radius is 2σ02β/m+2Rβ/(3m). Adding the bias θσ02/4 and substituting R=1/θ, θ=t/σ, and σ0≤σ, gives the displayed radius (2+2/3+1/4)σt with failure at most 2pe−β.

4.1F2step 3.1step 3.2step 1.2step 2.2algebra∎

Apply the one-sided explicit Bernstein bound [F2] to Ci with dimension p+1, bound R0=2/θ, variance bound v=T and confidence b=β+log⁡2. Since λmax⁡(∑iCi)=∥∑i(Yi−EY)∥, division by m gives ∥V−EY∥≤2Tb/m+4b/(3mθ) outside probability (p+1)e−b=(p+1)e−β/2. Because log⁡2<1<β, one has b<2β, and the radius is at most 2Tt+8t/(3θ). Adding step 1.2 proves the stated vector bound and defines EV. The two events were obtained from the original independent observations without conditioning on any other statistic. Together with steps 3.1 and 3.2 this proves every asserted conclusion.

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-6-luna)Open item page →

Matrix depth and covariance estimators

Definition

For p≥1, write Sp−1:={u∈Rp:∥u∥2=1}. Let U be a nonempty subset of this sphere, let P be a probability law on Rp, and let Γ⪰0. Its matrix depth relative to U is DU(Γ,P):=inf⁡u∈Umin⁡{P((uTX)2≤uTΓu),P((uTX)2≥uTΓu)}, where X has law P. Both weak inequalities include ties.

For observations x1,…,xn, let Pn:=1n∑i=1nδxi on the Borel sigma-algebra of Rp (The Borel sigma-algebra of a topological space). Each Dirac measure is a probability measure by The Dirac set function at a point and A Dirac set function is a probability measure. Their finite nonnegative weighted sum is a measure by Nonnegative scalar multiples and countable weighted sums of measures and Nonnegative scalar multiples and countable weighted sums of measures are measures, and its total mass is n−1∑i1=1; hence Pn is a probability law by Probability measures and probability spaces. Let β>0 be the constant of The Gaussian matrix-depth scale constant exists uniquely. The global dense depth correspondence is Argmax⁡Γ⪰0DSp−1(Γ,Pn), over symmetric positive semidefinite matrices. For 1≤s≤p/2, define the global single-block class Fp,s:=⋃c>0Fp,s(c) and the global single-block sparse correspondence Argmax⁡Γ∈Fp,sDUs(Γ,Pn). These are the unrestricted-spectrum versions; no known spectral bound is needed to define their selectors.

For known M>0, the dense bounded-class depth correspondence is Argmax⁡Γ∈Fp(βM)DSp−1(Γ,Pn). For known integer 1≤s≤p/2, the single-block sparse version is Argmax⁡Γ∈Fp,s(βM)DUs(Γ,Pn), where the classes and Us are defined in Bounded-spectrum covariance class and Single-block sparse covariance class and restricted directions. A measurable matrix-depth estimator is a Borel measurable selector Γ^ from the applicable argmax correspondence, with covariance output Σ^=Γ^/β. Either global correspondence or the applicable bounded-class correspondence may be used. The compact search restriction contains βΣ whenever the target belongs to the corresponding class; it makes no computational feasibility claim.

Remarks

Existence of a maximizer and existence of a measurable selector are separate obligations. Both are proved locally for the bounded classes, and the measurable-selection lemma also proves existence of Borel global maximizers by a data-dependent compact cap. Global argmax fibers are not asserted compact.

LemmaStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-6-luna)Open item page →

The adaptive truncated covariance procedure is well-defined on its declared domain

Statement

On the input domain in Adaptive truncated covariance estimator, the adaptive truncated covariance procedure is total and Borel measurable as a function of the sample.

Facts & Assumptions

Given: A finite sample in Rp, β>1, and positive finite scale bounds with the algorithm's declared block-count condition.

[F1]

Adaptive truncated covariance estimator specifies a finite block partition, the geometric-median pilot, spectral truncation, a finite scale grid, and a least-index selection rule.

[F2]

Measurable minimum-norm geometric-median selection: the geometric median pilot is a Borel function of its block means.

[F3]

Real spectral theorem: a self-adjoint endomorphism of a finite-dimensional real inner product space has an orthonormal eigenbasis: real symmetric matrices admit orthonormal eigenbases, so the scalar truncation defines a basis-independent matrix function.

[F4]

Polynomials are uniformly dense in C([a,b],R) for every closed interval: every continuous scalar function on a compact real interval is uniformly approximable by polynomials.

[F5]

Every complete ordered field is Archimedean: every finite real number is smaller than some natural number.

Proof

1.1F1F2algebra

The integer k=⌊3.5β⌋+1 satisfies 1≤k≤m/2 on the declared domain. The deterministic balanced partition therefore has k nonempty blocks, and each block mean is a continuous linear function of the sample. By [F2], applying the minimum-norm geometric median gives a single-valued Borel pilot.

1.2F1F3F4F5algebra

For each finite symmetric matrix, [F3] defines its spectral truncation independently of the eigenbasis. To check continuity in the matrix, let An→A be symmetric and choose R larger than all their operator norms. By [F4], approximate the scalar clipping function uniformly on [−R,R] by a polynomial q within η>0. Spectral diagonalization [F3] gives ∥ψ(B)−q(B)∥op≤η for B=A,An; polynomial evaluation is continuous in matrix entries, so q(An)→q(A). Hence lim sup⁡n∥ψ(An)−ψ(A)∥op≤2η, and letting η↓0 proves continuity. Each θj is positive and finite. The grid consists exactly of integers 0≤j<L, where L=log⁡2(2σmax⁡/σmin⁡)≥1; it is finite by [F5] and nonempty since j=0 belongs to it.

2.1F1step 1.1step 1.2algebra∎

The largest grid index satisfies the agreement rule vacuously, so the set of admissible indices is nonempty and has a least element j∗. For each fixed pair of indices, the matrix difference is Borel in the sample: the pilot is Borel by step 1.1 and the remaining finite matrix operations and truncation are continuous by step 1.2. Its operator norm is Borel as the composition with a continuous norm. Therefore the event that a given index satisfies all finitely many comparisons is Borel; taking the least among finitely many such indices is a Borel rule. The output is thus defined and Borel on the whole declared domain.

LemmaStatement: AI-adaptedProof: AI-generatedjudge pass (gpt-6-luna)Open item page →

Fixed-scale matrix-truncated covariance deviation under finite matrix variance

Statement

Assume Countable Choice for the specified geometric-median pilot. Let Xi∈Rp, 1≤i≤m, be iid with mean μ, nonzero covariance Σ, finite fourth central moment and matrix variance σ02 as in Matrix variance for covariance estimation. Put L=∥Σ∥op,T=tr⁡Σ,d=σ02/L2,D=max⁡{d,(T/σ0)2}. For σ≥σ0, β>1 set t=β/m, θ=t/σ and Σ^θ=1mθ∑iψ ⁣(θ(Xi−μ^)(Xi−μ^)T). For any measurable pilot, any B≥0 and any event E on which ∥μ^−μ∥≤B, there is an event G with P(Gc)≤hpe−β, hp=(3p+1)/2, such that on E∩G, ∥Σ^θ−Σ∥op≤a0σt+qM+2B(W+qM)+B2, where a0=27/10, q=2Bθ+B2θ, M=L+a0σt and W=σ0θ+2Tt+8t/(3θ). The concentration event is constructed from the true centered observations and the inequality is uniform over the pilot ball; no independence of the pilot and sample is assumed.

For the exact pilot of Adaptive truncated covariance estimator, the explicit sufficient sample condition m≥1016Dβ therefore gives P ⁣(∥Σ^θ−Σ∥op>3σβ/m)≤(hp+1)e−β≤5pe−β. Every finite-fourth-moment law is retained under this trace-aware sample condition; no coordinate independence or bounded-kurtosis assumption is added. If the mean is supplied exactly, the stronger bound 2.7σβ/m holds with failure at most pe−β for every m≥1, without the D sample condition.

Facts & Assumptions

Given: The iid sample, matrix moments, scales, confidence and stated pilot/event conventions. The probability factor p denotes ambient dimension, whereas d is an intrinsic moment ratio.

[F1]

With Zi=Xi−μ, w(z)=min⁡{1,1/(θ∥z∥2)}, w(0)=1, the oracle matrices S=m−1∑iw(Zi)ZiZiT and vectors V=m−1∑iw(Zi)Zi obey ∥S−Σ∥≤a0σt and ∥V∥≤W, except on events of probability pe−β and (p+1)e−β/2, respectively. Oracle-truncated covariance and vector concentration under finite matrix variance.

[F2]

The specified balanced-block geometric-median pilot has radius 112Tβ/m with failure at most e−β whenever k=⌊3.5β⌋+1≤m/2. Exact block budget for the covariance geometric-median pilot.

[F3]

For nonzero covariance the intrinsic ratio d≥1. The covariance matrix variance ratio is at least one.

Proof

1.1givenF1algebra

Intersect the two oracle events [F1], at cost hpe−β. Put R=1/θ and wu(z)=min⁡{1,R/∥z−u∥2}, interpreted as one at z=u. For ∥u∥≤B, the ratio hu(z)=wu(z)/w(z)=max⁡(R,∥z∥2)/max⁡(R,∥z−u∥2) lies in [(1+B/R)−2,(1+B/R)2]. Indeed max⁡(R,∥z∥)≤max⁡(R,∥z−u∥)+B, and the reverse follows by swapping the two vectors. Thus ∣hu−1∣≤q=2Bθ+B2θ.

2.1givenF1step 1.1algebra

Expand Su=m−1∑iwu(Zi)(Zi−u)(Zi−u)T. The perturbation of its ZiZiT part has norm at most q∥S∥, because its scalar coefficients have absolute value at most q and the summands are positive semidefinite. For the cross vector, scalar Cauchy–Schwarz and w2≤w give ∥m−1∑i(hu−1)w(Zi)Zi∥≤q∥S∥. Hence ∥Su−Σ∥≤∥S−Σ∥+q∥S∥+2B(∥V∥+q∥S∥)+B2, since 0≤wu≤1. This bound is pointwise for every u in the ball, so it applies to the random same-sample u=μ^−μ on E, without conditioning on it. The first conclusion follows using ∥S∥≤M and [F1].

3.1givenF1F2F3step 2.1algebra∎

For the prescribed pilot take B=112Tt<16Tt. The condition m≥1016Dβ and [F3] imply k≤4.5β≤m/2, so [F2] applies. By homogeneity, replace Z by Z/L and σ by σ/L: then T,σ0,σ scale by 1/L, θ by L, S,Σ by 1/L, and D is unchanged. It therefore suffices to normalize by L so L=1, T=ρ, σ0=d and σ≥d≥1. Put η=Dt≤10−16 and H=σt. Using D≥d, ρ2/d≤D and t≤η≤1, direct substitution gives B2/H≤256η, B/H≤16η1/4 and q≤288η1/4t. Therefore qM/H≤1066η1/4 and 2BqM/H≤18432η: indeed qM/H≤288η1/4H(1+2710H)/σ, and H≤σ, σ≥1 give H(1+2710H)/σ2≤σ(1+2710σ)/σ2≤3710<4, hence the square-root factor is at most 37/10<2. The three terms in 2BW/H are at most 32η1/4, 64η and 86η1/4, respectively: use Bσ0θ/H≤16η1/4, ρt/σ≤η and Bt/(θH)≤16η1/4. In total the perturbation beyond 2710H is at most 1184η1/4+18752η≤118588106<310. Step 2.1 is thus strictly below 3H. Undo the normalization and add the single pilot failure to obtain (hp+1)e−β≤5pe−β. For known mean, u=B=0 and only the oracle matrix event is needed, proving the last assertion.

Remarks

The sufficient condition Dβ replaces a false general dβ claim; Intrinsic matrix variance alone does not control pilot-centered covariance truncation ↗ gives an explicit counterexample to that original estimator guarantee. Under a separately proved extra relation tr⁡Σ≤dL, one has D=d, recovering that sample-size regime. The auxiliary comparison cannot be assumed for arbitrary dependence. The uniform pilot formula above can be sharper than this sufficient sample condition when a pilot has a better separately established accuracy bound.

LemmaStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-6-luna)Open item page →

The Gaussian Huber covariance mixture is a probability law

Statement

For every admissible p,ϵ,Σ,Q in Gaussian Huber contamination model for covariance estimation, Pϵ,Σ,Q is a probability measure on the Borel subsets of Rp.

Facts & Assumptions

Given: A probability law Np(0,Σ), a Borel probability law Q, and 0≤ϵ≤1.

[F1]

Gaussian Huber contamination model for covariance estimation defines Pϵ,Σ,Q=(1−ϵ)Np(0,Σ)+ϵQ.

[F2]

Probability measures and probability spaces: both component laws are nonnegative, countably additive, and have total mass one.

Proof

1.1F1F2givenalgebra

For each Borel set A, the mixture assigns Pϵ,Σ,Q(A)=(1−ϵ)Np(0,Σ)(A)+ϵQ(A), which is nonnegative because both coefficients are nonnegative. Its value at the empty set is zero because each component measure vanishes there.

2.1F1F2step 1.1algebra∎

Let (Aj)j≥1 be pairwise disjoint Borel sets. Countable additivity of the two component laws in [F2] gives their values on the union as the corresponding nonnegative series; distributing the fixed nonnegative coefficients over partial sums and taking limits yields Pϵ,Σ,Q(⋃jAj)=∑jPϵ,Σ,Q(Aj). The total mass is (1−ϵ)+ϵ=1. Together with step 1.1, these are the probability-measure axioms.

LemmaStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-6-luna)Open item page →

Lepski scale selection transfers fixed-scale covariance bounds

Statement

Let Σ≠0, σ0>0, m≥1, β>1 and 0<σmin⁡≤σ0≤σmax⁡. Use the finite grid and agreement rule of Adaptive truncated covariance estimator, with measurable matrix estimates on that grid. Put Lg=log⁡2(2σmax⁡/σmin⁡),J={0,…,⌈Lg⌉−1},jˉ=⌈log⁡2(σ0/σmin⁡)⌉,N+=⌈Lg⌉−jˉ. On any event on which every j≥jˉ satisfies ∥Σ^j−Σ∥≤3σjβ/m, the selected estimate satisfies ∥Σ^∗−Σ∥<18σ0β/m. If the individual failures are at most qj, its success probability is at least 1−∑j≥jˉqj. For the prescribed same-sample estimator, when the hypotheses of Fixed-scale matrix-truncated covariance deviation under finite matrix variance hold at every required scale, its individual failure bounds qj=5pe−β give success probability at least 1−5p⌈Lg⌉e−β. The shared-event bound below counts the common pilot failure once.

More sharply, suppose a common event E has P(Ec)≤δ, and for each j≥jˉ an event Gj has P(Gjc)≤he−β, with the stated fixed-scale bound valid on E∩Gj. Then success is at least 1−δ−hN+e−β. No independence between scales or the pilot and covariance estimates is required. The exact grid cardinality is ⌈Lg⌉, not the generally false unrounded bound ∣J∣≤Lg.

Facts & Assumptions

Given: The bracket, positive finite grid scales, matrix estimates and deterministic agreement rule in the statement, with the stated probability assumptions when invoked.

[F1]

The scale grid is σj=2jσmin⁡; the agreement rule selects the smallest index whose estimate is within 6σkβ/m of every larger-scale estimate. Adaptive truncated covariance estimator.

[F2]

The finite agreement rule has a valid index since its largest grid index satisfies every comparison vacuously. The adaptive truncated covariance procedure is well-defined on its declared domain.

[F3]

Under its trace-aware sample condition, the prescribed pilot in Fixed-scale matrix-truncated covariance deviation under finite matrix variance has fixed-scale failure probability at most 5pe−β for each scale σ≥σ0.

Proof

1.1givenF1F2algebra

The grid condition is 0≤j<Lg, so it has exactly ⌈Lg⌉ elements. The first scale at or above σ0 is jˉ, and σjˉ<2σ0≤2σmax⁡ puts it in the grid. Thus exactly N+ required scales are j≥jˉ, with N+≥1.

2.1givenF1step 1.1algebra

On the joint fixed-scale event, for every k>jˉ the triangle inequality gives ∥Σ^k−Σ^jˉ∥≤3(σk+σjˉ)β/m≤6σkβ/m. Hence jˉ is admissible and the selected j∗≤jˉ. If they differ, the selection rule gives ∥Σ^j∗−Σ^jˉ∥≤6σjˉβ/m; if equal this distance is zero. Adding the error at jˉ yields ∥Σ^∗−Σ∥≤9σjˉβ/m<18σ0β/m.

3.1F3givenstep 1.1step 2.1algebra∎

A finite union bound costs at most ∑j≥jˉqj for individual failure bounds; under [F3], qj=5pe−β gives the stated 5p⌈Lg⌉e−β bound. For a shared event E, the complement of E∩⋂j≥jˉGj has probability at most δ+hN+e−β; the common failure is counted once. Applying step 2.1 proves all probability assertions.

LemmaStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-6-luna)Open item page →

A matrix-depth maximizer exists on the bounded covariance classes

Statement

For every integer p≥1, every nonempty finite sample in Rp, and every M>0, the dense bounded-class argmax correspondence Argmax⁡Γ∈Fp(βM)DSp−1(Γ,Pn) from Matrix depth and covariance estimators is nonempty compact. If 1≤s≤p/2, the single-block sparse bounded-class argmax Argmax⁡Γ∈Fp,s(βM)DUs(Γ,Pn) is also nonempty compact.

Facts & Assumptions

Given: An integer p≥1, a nonempty finite sample in Rp, its empirical law Pn, a bound M>0, and, for the sparse case, 1≤s≤p/2.

[F1]

Matrix depth and covariance estimators defines empirical matrix depth as the infimum over directions of the minimum of the two empirical weak-tail counts.

[F4]

Upper semicontinuous real map on a topological space: a real map is upper semicontinuous exactly when its strict sublevel sets are open, equivalently its weak superlevel sets are closed.

[F5]

Semicontinuous extreme value theorem on compact Euclidean sets and A closed subset of a compact metric space is compact: an upper semicontinuous real map on a nonempty compact Euclidean set attains its maximum, and a closed subset of a compact space is compact.

Proof

1.1F2F3algebra

Identify the symmetric matrices with their coordinates in Rp2. The dense class K=Fp(βM) is bounded because each entry satisfies ∣Γij∣=∣eiTΓej∣≤∥Γ∥op≤βM by [F3]. It is closed: if Γk→Γ coordinatewise with Γk∈K, then Γ is symmetric, vTΓv=lim⁡kvTΓkv≥0 for every v, and ∥Γv∥2=lim⁡k∥Γkv∥2≤βM∥v∥2 for every v. By the operator-norm definition in [F2], this gives ∥Γ∥op≤βM. Thus K is closed and bounded, so [F3] makes it compact.

1.2F1F4algebra

Fix u and write q(Γ)=uTΓu and ri=(uTxi)2. If Γk→Γ, then q(Γk)→q(Γ). For each i, if ri<q(Γ) or ri>q(Γ), the two weak-tail indicators eventually keep their limiting membership; if ri=q(Γ), the observation is counted in both weak tails at Γ. Therefore the limsup of each finite tail count is at most its value at Γ, and the limsup of their minimum is at most the minimum of their values there. The minimum of the two empirical tails is upper semicontinuous in Γ. The infimum over u remains upper semicontinuous because each strict sublevel set of the infimum is the union of the corresponding open strict sublevel sets from [F4]. Hence Γ↦DU(Γ,Pn) is upper semicontinuous on either search class.

2.1F2F5step 1.1

For each fixed S⊆[p] with ∣S∣≤s, requiring the off-diagonal entries outside S×S to vanish is a finite collection of closed coordinate equalities. Its intersection with the dense compact class is compact by [F5]. There are finitely many such S, and their union is Fp,s(βM) by [F2]. A finite union of compact sets is compact, since any open cover has a finite subcover on each of its finitely many members.

3.1F2F4F5step 1.1step 2.1step 1.2construct∎

Both applicable search classes are nonempty because they contain the zero matrix. By steps 1.1–1.2 they are compact Euclidean sets. By step 1.2, their empirical depth functions are upper semicontinuous, so [F5] gives a maximizer on each applicable class. Its argmax is the nonempty weak superlevel set at that maximum, closed by [F4] and compact by [F5]. This proves the claim.

LemmaStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-6-luna)Open item page →

The scaled Gaussian covariance has matrix depth at least one half

Statement

Let Σ⪰0, let U⊆Sp−1 be nonempty, and let Np(0,Σ) be its centered Gaussian law. If β is the unique positive constant satisfying Φ(β)=3/4, then DU(βΣ,Np(0,Σ))≥12. Equality holds for every direction with positive variance; when Σ=0 the depth is 1.

Facts & Assumptions

Given: A positive semidefinite covariance matrix Σ, a nonempty direction set U⊆Sp−1, and its centered Gaussian law.

[F1]

Matrix depth and covariance estimators defines depth using both weak tails, including their boundary ties.

[F2]

Multivariate normal law, including singular covariance: for u∈Rp, uTX∼N(0,uTΣu) under Np(0,Σ).

[F3]

The Gaussian matrix-depth scale constant exists uniquely: Φ(β)=3/4 for the unique β>0.

[F4]

A nonnegative measurable function has integral 0 exactly when it vanishes almost everywhere: a nonnegative random variable with expectation zero vanishes almost surely.

Proof

1.1F2F3algebra

Fix u∈U and put v=uTΣu≥0. If v>0, [F2] gives uTX=vZ with Z∼N(0,1). The threshold for βΣ is uT(βΣ)u=βv, so P((uTX)2≤βv)=P(∣Z∣≤β)=2Φ(β)−1=12. The normal law has a density, so its boundary has probability zero and P((uTX)2≥βv)=1/2 as well.

2.1F1F2F4step 1.1algebra∎

If v=0, then E(uTX)2=v=0 by [F2]. Fact [F4] implies uTX=0 almost surely. Both weak-tail events at threshold zero then have probability one. Thus in every direction the smaller weak tail is at least 1/2; taking the infimum proves the depth bound. If Σ=0, every direction is in the zero-variance case and the depth equals one.

LemmaStatement: AI-adaptedProof: AI-adaptedOpen item page →

Huber covariance modulus lower bound for unrestricted matrix-valued actions

Statement

Assume AC. Fix p,n≥1, M>0, 0≤ϵ≤1, and let Θ be either Fp(M) from Bounded-spectrum covariance class or Fp,s(M) from Single-block sparse covariance class and restricted directions with 1≤s≤p/2, equipped with its induced Borel sigma-algebra. Let En be the set of Borel maps (Rp)n→Rp×p. The clean family is PΣ=Np(0,Σ). For Σ∈Θ and matrix action A, put ℓ(Σ,A)=∥Σ−A∥op2. Its restriction to Θ×Θ defines the contamination modulus ω(ϵ,Θ) through Huber contamination modulus. Suppose ω(ϵ,Θ)<∞, 0≤M0<∞, 0<c0≤1, and inf⁡Σ^∈Ensup⁡Σ∈ΘPΣ⊗n{ℓ(Σ,Σ^)≥M0}≥c0. Then inf⁡Σ^∈Ensup⁡Σ∈Θsup⁡QPϵ,Σ,Q⊗n{ℓ(Σ,Σ^)≥116(M0∨ω(ϵ,Θ))}≥min⁡(c0,1/2).

Facts & Assumptions

Given: AC, the bounded covariance class, the Gaussian Huber model, its contamination modulus, and the clean tail-risk premise in the Statement.

[F1]

Gaussian Huber contamination model for covariance estimation: one observation has law (1−ϵ)Np(0,Σ)+ϵQ and the sample consists of iid observations from this law.

[F2]

Huber contamination modulus: for ϵ<1, pairs in the modulus satisfy TV(PΣ0,PΣ1)≤ϵ/(1−ϵ); at ϵ=1 all pairs are allowed.

[F3]

TV-close laws have identical Huber mixtures at the contamination threshold: under AC, every pair satisfying [F2] admits contaminants making the two one-observation Huber laws equal.

[F4]

For sigma-finite factors, the product measure exists, has the rectangle formula, is sigma-finite, and is unique: finite product laws are determined by their factor laws and rectangle values.

[F5]
[F6]

The operator norm is zero on the zero domain and otherwise is max_{||v||=1} ||Tv|| and The norm ∥v∥=⟨v,v⟩ induced by a real or complex inner product define the matrix and vector norms. The inner-product norm is definite, homogeneous, and satisfies the triangle inequality gives the vector-norm triangle inequality: for every unit v, ∥(B+C)v∥2≤∥Bv∥2+∥Cv∥2≤∥B∥op+∥C∥op. Taking the supremum gives ∥B+C∥op≤∥B∥op+∥C∥op, without symmetry assumptions on B,C.

Proof

1.1F1givenalgebra

Fix any Σ^∈En. For each Σ∈Θ, choosing Q=PΣ makes the one-observation Huber law equal to the clean law by [F1]. If ω≤M0, then 116(M0∨ω)≤M0, so the robust supremum probability at the smaller threshold is at least the clean supremum probability at M0. The clean premise therefore gives the claimed bound c0 for this estimator. Taking the infimum preserves it.

1.2F1F2F3F4choose

Suppose ω>M0. By the definition of the finite supremum in [F2], there are Σ0,Σ1∈Θ with ℓ(Σ0,Σ1)>ω/2 and satisfying the total-variation condition there; when ϵ=1 every pair is admissible. By [F3], choose contaminants Q0,Q1 whose one-observation Huber laws coincide at a law R1. Their iid sample laws both equal R1⊗n by [F1] and [F4].

2.1F5F6step 1.2algebra

For every matrix action A, the triangle inequality gives max⁡i=0,1ℓ(Σi,A)≥14ℓ(Σ0,Σ1)>18ω(ϵ,Θ)>116(M0∨ω(ϵ,Θ)). Indeed, one of the two distances from A is at least half the distance between Σ0 and Σ1. The two measurable loss events at threshold 14ℓ(Σ0,Σ1) therefore cover the sample space under the common law; their probabilities sum to at least one. One has probability at least 1/2, and its event is contained in the event at the smaller displayed threshold. The robust supremum probability for this estimator is at least 1/2.

3.1step 1.1step 1.2step 2.1algebra∎

Step 1.1 applies when ω≤M0 and steps 1.2–2.1 apply when ω>M0. The bound holds for every Borel matrix-valued estimator, so taking their infimum proves the statement.

LemmaStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-6-luna)Open item page →

The Huber covariance contamination modulus has a quadratic lower bound

Statement

For fixed M>0, 0≤ϵ≤1, and p≥1, the squared operator loss L(Σ0,Σ1)=∥Σ0−Σ1∥op2 has contamination modulus at least cMϵ2 on Fp(M) and on Fp,s(M) for every 1≤s≤p/2.

Facts & Assumptions

Given: The bounded covariance classes, the contamination modulus, the Gaussian Huber covariance model, Pinsker's inequality, and the local Gaussian KL formula.

[F1]

Huber contamination modulus: the modulus uses pairs of clean laws whose total-variation distance is at most ϵ/(1−ϵ); at ϵ=1 the threshold is infinite.

[F2]

Pinsker’s inequality with event-supremum total variation: TV(P,Q)≤D(P∥Q)/2 under TV=sup⁡A∣P(A)−Q(A)∣.

[F3]

Gaussian Huber contamination model for covariance estimation: the clean Gaussian law is Np(0,Σ) with covariance parameter Σ.

[F4]

Kullback–Leibler divergence between nondegenerate centered Gaussian laws: the KL divergence of the positive-definite Gaussian pair is given by its trace-determinant formula.

[F5]

Bounded-spectrum covariance class and Single-block sparse covariance class and restricted directions: a diagonal positive semidefinite matrix with largest eigenvalue at most M lies in the dense class and in every defined single-block class.

Proof

1.1F3F5algebra

For 0<ϵ≤1, set Σ0=(M/2)I and Σ1=(M/2)I+(Mϵ/4)e1e1T. Both are positive definite, their largest eigenvalues are at most 3M/4, and they are diagonal. Thus they belong to the dense class and to every block-sparse class in the Statement by [F5]. Their squared operator separation is M2ϵ2/16.

2.1F2F4step 1.1algebra

Put r=ϵ/2. By [F4], D(Np(0,Σ0)∥Np(0,Σ1))=12[log⁡(1+r)+(1+r)−1−1]≤r24=ϵ216. The derivative of the bracket is r/(1+r)2≤r; integration from 0 proves the inequality. Pinsker [F2] gives TV≤ϵ/32≤ϵ≤ϵ/(1−ϵ) for 0<ϵ<1. At ϵ=1, the modulus threshold is infinite.

3.1F1step 1.1step 2.1∎

The pair from step 1.1 is admissible in the supremum defining the contamination modulus [F1]. Its loss is M2ϵ2/16, so the modulus on both classes is at least that amount. At ϵ=0 the claimed lower bound is zero.

LemmaStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-6-luna)Open item page →

Operator error bound for the Gaussian Huber matrix-depth estimator

Statement

Let X1,…,Xn be independent with common law Pϵ,Σ,Q from Gaussian Huber contamination model for covariance estimation, where Σ∈Fp(M), 0≤ϵ<1/5, Q is arbitrary, and M>0 is fixed. Let Γ^ be a Borel measurable positive semidefinite symmetric matrix-valued statistic satisfying DU(Γ^,Pn)≥DU(βΣ,Pn) for every sample. This includes every measurable global maximizer and every measurable maximizer over a compact search class containing βΣ. For a direction family U=⋃j=1mVSj with m≥1, nonempty Sj⊆[p], integer r≥1, and ∣Sj∣≤r, assume 0<δ<1/2 and C1(r+log⁡(m/δ))/n<1 for a sufficiently large universal C1. Then, uniformly over Q and Σ, sup⁡u∈U∣uT(Γ^/β−Σ)u∣≤CM(ϵ+r+log⁡(m/δ)n) with probability at least 1−2δ. Here CM depends only on the fixed spectrum bound M.

This is a comparison bound. Existence of selectors is separate from this argument; the dense and block-sparse global and bounded-class selectors are proved in the local selection lemma.

Facts & Assumptions

Given: The Gaussian Huber model, a Borel measurable positive semidefinite statistic satisfying the displayed empirical-depth comparison, and the sample-size and confidence conditions in the Statement.

[F1]

Matrix depth and covariance estimators: empirical depth uses both weak tails. The displayed comparison premise applies in particular to a global maximizer or to a maximizer over a class containing βΣ.

[F2]

The scaled Gaussian covariance has matrix depth at least one half: DU(βΣ,Np(0,Σ))≥1/2, including singular directions.

[F3]

Uniform deviation for squared-projection slabs: for N clean independent observations, both squared-projection tail classes over m supports of size at most r have uniform empirical error at most C[(r+1)/N+log⁡(m/δ)/N] with probability at least 1−δ.

[F5]

Multivariate normal law, including singular covariance: if uTΣu=0, then the clean Gaussian projection uTX has law N(0,0)=δ0.

[F6]

Real spectral theorem: a self-adjoint endomorphism of a finite-dimensional real inner product space has an orthonormal eigenbasis and The operator norm is zero on the zero domain and otherwise is max_{||v||=1} ||Tv||: for symmetric B, the map B↦sup⁡u∈U∣uTBu∣ is 1-Lipschitz in operator norm for every nonempty U of unit vectors.

[F7]

A measurable function between measurable spaces and Composition with a Borel measurable outer map preserves measurability: composing a Borel selector with a continuous real-valued function gives a Borel random variable.

Proof

1.1givenalgebra

Expand the finite product mixture law using independent contamination labels. The contaminated count n2 is binomial. For a Bernoulli variable B with mean ϵ, the centered log-mgf g(λ)=log⁡Eeλ(B−ϵ) satisfies g(0)=g′(0)=0 and g′′(λ) is a variance of a tilted Bernoulli law, hence at most 1/4. Integrating twice gives g(λ)≤λ2/8; Chernoff optimization gives n2/n≤ϵ+log⁡(1/δ)/(2n) except on an event of probability δ. Put q=r+log⁡(m/δ). Since C1q/n<1 and C1≥200, the square-root term is at most 1/20. Thus n2/n<1/4 and n1=n−n2>3n/4.

1.2givenF3

Conditional on the label pattern and clean count n1, the clean observations Y1,…,Yn1 are independent with law Np(0,Σ). Apply [F3] with confidence δ. Except on a conditional event of probability δ, every clean empirical tail differs from its Gaussian probability by at most e=C[(r+1)/n1+log⁡(m/δ)/n1].

2.1F1step 1.2algebra

For fixed Γ and u, each full-sample tail count lies between the corresponding clean count and that count plus n2. Taking the minimum of the two tails and then the infimum over u yields nDU(Γ,Pn)≤n1DU(Γ,Pn1Y)+n2,nDU(Γ,Pn)≥n1DU(Γ,Pn1Y). Since DU(Γ^,Pn)≥DU(βΣ,Pn) by the comparison premise, these inequalities imply DU(Γ^,Pn1Y)≥DU(βΣ,Pn1Y)−n2/n1.

3.1F2step 1.1step 1.2step 2.1algebra

On the deviation event in step 1.2, replacing clean empirical depth by population depth costs at most e at each matrix. [F2] and the comparison in step 2.1 therefore imply DU(Γ^,Np(0,Σ))≥1/2−n2/n1−2e. Since r≥1, r+1≤2q and log⁡(m/δ)≤q, we have e≤C(2+1)q/n1≤C(2+1)4/(3C1). Choose C1 large enough that e≤1/24. Step 1.1 gives n2/n1≤1/3. Retain the actual deficit ρ:=n2/n1+2e≤5/12<1/2. Also n1>3n/4 and step 1.1 give n2/n1≤(4/3)(ϵ+log⁡(1/δ)/(2n)), while e≤Cq/n; hence ρ≤C(ϵ+q/n).

4.1F1F2F4step 3.1algebra

Fix u∈U and put v=uTΣu. If v>0, let z=uTΓ^u/v≥0. The Gaussian tails at threshold uTΓ^u are 2Φ(z)−1 and 2−2Φ(z); their minimum is 1/2−2∣Φ(z)−3/4∣. Step 3.1 therefore gives ∣Φ(z)−Φ(β)∣≤ρ/2. The bound ρ≤5/12 places both Gaussian probabilities in the fixed compact interval [13/24,23/24]⊂(0,1). On this interval [F4] gives ∣z−β∣≤Cρ and then ∣z−β∣≤Cρ. Since uT(Γ^/β−Σ)u=(v/β)(z−β) and v≤M, this implies ∣uT(Γ^/β−Σ)u∣≤CMρ≤CM(ϵ+q/n).

5.1F1F5F6F7step 1.1step 1.2step 3.1algebra∎

If v=0, [F5] gives uTX=0 almost surely. If uTΓ^u>0, the upper weak tail is zero, contradicting the positive depth lower bound in step 3.1. Hence uTΓ^u=0 and the quadratic error is zero. Taking the supremum over U is a Borel function of the Borel selector by [F6, F7]; its Lipschitz bound follows by applying the operator-norm inequality to the difference of two candidate matrices. Intersecting the events from steps 1.1–1.2 gives probability at least 1−2δ and the stated bound.

LemmaStatement: Literature-sourcedProof: AI-generatedOpen item page →

Measurable selection of a matrix-depth maximizer

Statement

For every nonempty finite sample, both the bounded-class and global dense and block-sparse argmax correspondences in Matrix depth and covariance estimators admit Borel measurable selectors as functions of the sample. The covariance output obtained by division by β is Borel as well. No computational feasibility is asserted.

Facts & Assumptions

Given: Fix integers n,p≥1, a sample x=(x1,…,xn)∈E:=(Rp)n, and, in the sparse case, 1≤s≤p/2. Identify matrices with Rd, d=p2. First fix c>0 and let K=Fp(c) or K=Fp,s(c), with respectively U=Sp−1 or U=Us. Write D(x,Γ)=DU(Γ,Pn(x)).

[A1]

The Axiom of Choice is inherited through the fixed Gaussian scale β>0 in Matrix depth and covariance estimators and The Axiom of Choice. The construction below makes only least choices from fixed finite orders and adds no choice axiom.

[F1]

Matrix depth and covariance estimators defines empirical depth as the directional infimum of the minimum of two weak-tail counts; both counts include ties.

[F2]

A matrix-depth maximizer exists on the bounded covariance classes proves that K and its empirical argmax fibers are nonempty compact. It applies to any fixed c>0 by taking the bound there to be c/β.

[F3]

Upper semicontinuous real map on a topological space characterizes upper semicontinuity by open strict sublevels, equivalently closed weak superlevels.

[F4]

The Borel sigma-algebra of a topological space defines the Borel sigma-algebra generated by open sets; in particular closed sets and their finite or countable Boolean combinations are Borel.

[F6]

For n at least one, open sets, closed sets, compact sets, open balls, boxes, rational open boxes, and rational half-open boxes generate the Borel sigma-algebra on R^n: rational open boxes generate the finite-dimensional Borel sigma-algebra, so a map with Borel real coordinates is Borel.

Proof

technique · closed finite-level hit sets and a deterministic dyadic-cube construction, followed by a data-dependent compact cap for global maximizers
1.1F1F3givenalgebra

For fixed u, each function (x,Γ)↦(uTxi)2−uTΓu is continuous. Its nonpositive and nonnegative sets are closed, so their indicators are upper semicontinuous: outside a closed set the indicator is locally zero, and at a point of the set its limsup is at most one. Finite sums and the minimum of two upper semicontinuous maps are upper semicontinuous. The infimum over fixed u∈U is also upper semicontinuous because its strict sublevel is the union of the strict sublevels for individual u. Thus D is jointly upper semicontinuous in (x,Γ). Every directional count minimum belongs to {0,1/n,…,1}; the infimum of a nonempty subset of this finite set belongs to the same set. Ties may give depth 1, so the full grid is retained.

1.2F1F7givenalgebra

Put R(x)=max⁡i≤n∥xi∥22. If a positive semidefinite matrix Γ has ∥Γ∥op>R(x), a top unit eigenvector u gives uTΓu=∥Γ∥op>(uTxi)2 for every i, so the empirical upper weak tail is zero and the dense depth is zero. In the global block-sparse class, write Γ as its symmetric block on some support S, ∣S∣≤s, and its diagonal complement. The largest eigenvalue is attained either by a unit eigenvector in that block or by a coordinate vector in the complement; choose the former in a tie when the block is nonempty. Hence a norm-attaining vector has support of size at most s or one, extends to a coordinate set of size 2s, and belongs to Us. The same strict inequality makes the sparse depth zero. This argument selects one appropriate eigenvector and does not claim every eigenvector is supported in a small block.

2.1F2F3step 1.1algebra

For 0≤j≤n and any fixed closed cube Q⊆Rd, let Hj,Q:={x:∃Γ∈K∩Q, D(x,Γ)≥j/n}. This is closed. Indeed its defining superlevel set is closed by step 1.1, and K∩Q is compact. If x0∉Hj,Q, product-open rectangles in the complement of that superlevel set cover {x0}×(K∩Q). Finitely many matrix-coordinate neighborhoods cover K∩Q; intersect their sample-coordinate neighborhoods to obtain a neighborhood of x0 outside Hj,Q. The empty K∩Q case gives the empty hit set. The same argument with Q=Rd gives a closed set Hj:={x:max⁡KD(x,⋅)≥j/n}.

3.1F2F4step 1.1step 2.1algebra

Set Hn+1=∅ and Ej=Hj∖Hj+1 for 0≤j≤n. These are Borel by [F4] and partition E, since the maximum exists by [F2] and takes a value in the finite grid by step 1.1. On Ej, the argmax fiber is A(x)={Γ∈K:D(x,Γ)≥j/n}, so A(x) hits a fixed closed cube Q exactly when x∈Hj,Q.

4.1F2F4step 2.1step 3.1construct

Take a fixed closed cube Q0 containing K; the entry bound in the proof of [F2] permits Q0=[−c,c]d. Repeatedly bisect each coordinate interval into two closed halves, ordering the 2d child cubes lexicographically. On Ej, starting from Q0, retain the first child cube Q with x∈Hj,Q. A child exists because the children cover their parent and the parent meets A(x). Inductively every selected-cube event is Borel: if B is the event selecting a parent with ordered children Q1,…,Q2d, the event selecting Qr is B∩Hj,Qr∖⋃ℓ<rHj,Qℓ. Each level has finitely many cubes, so its selected center am(x) is a finite-valued Borel map. The first-child rule remains unambiguous at overlapping cube boundaries.

5.1A1F2F5F6step 4.1constructalgebra

For fixed x, the sets A(x)∩Qm(x) are nested nonempty compact sets and the cubes have diameter 2cd 2−m→0. Their intersection is nonempty: otherwise their complements would cover the first compact set, and a finite subcover would contradict a later set's nonemptiness. The intersection has at most one point because its diameter is zero; denote the point by Γ^c(x). Since both it and am(x) lie in Qm(x), ∥am(x)−Γ^c(x)∥2 is at most the cube diameter and tends to zero. Thus each coordinate of Γ^c is Borel by [F5], and the matrix-valued map is Borel by [F6]. It belongs to A(x) for every sample. Taking c=βM proves both original bounded-class selection claims.

6.1A1F1F4F6step 1.1step 1.2step 5.1constructalgebra∎

The continuous function R has a Borel integer majorant k(x)=1+⌊R(x)⌋, with {k=ℓ}={ℓ−1≤R<ℓ} for ℓ≥1. On that stratum, step 1.2 shows that every admissible matrix outside the fixed cap ℓ has depth zero. The maximum over the cap is nonnegative, so any cap maximizer is a global maximizer. Apply the explicit construction of steps 1.1–5.1 with c=ℓ for each integer ℓ≥1 and paste those Borel maps on the Borel strata {k=ℓ}. For any open set of matrices, the preimage under this pasted map is the countable union, over ℓ≥1, of the Borel stratum {k=ℓ} intersected with the preimage under its fixed-cap Borel selector; hence the pasted map is Borel. This yields a Borel global maximizer in each class. Global argmax fibers need not be compact when the maximal depth is zero; only their compact capped subfibers are used. Division by the fixed β>0 preserves coordinatewise Borel measurability, proving the covariance-output claim for bounded and global selectors.

TheoremStatement: AI-adaptedProof: AI-generatedjudge pass (gpt-6-luna)Open item page →

Adaptive truncated covariance has a finite matrix-variance operator bound

Statement

Assume Countable Choice. Let X1,…,Xm∈Rp be clean iid observations with mean μ, nonzero covariance Σ, and finite fourth central moment. For the matrix variance in Matrix variance for covariance estimation, put d=σ02∥Σ∥2,D=max⁡{d,(tr⁡Σσ0)2}. Suppose β>1, 0<σmin⁡≤σ0≤σmax⁡ and m≥1016Dβ. The same-sample pilot and original scale/selection rule of Adaptive truncated covariance estimator then satisfy P ⁣(∥Σ^∗−Σ∥op>18σ0βm)≤5plog⁡2 ⁣(2σmax⁡σmin⁡)e−β. Here p is ambient dimension; it is not the intrinsic ratio d. More precisely, with Lg=log⁡2(2σmax⁡/σmin⁡) and N+=⌈Lg⌉−⌈log⁡2(σ0/σmin⁡)⌉, the failure bound is [1+3p+12N+]e−β. The trace-aware sample condition is sufficient, not necessary. All clean finite-fourth-moment laws remain eligible; no coordinate independence, kurtosis bound, contamination or replacement guarantee is imposed. The broader uniform pilot-accuracy formula in Fixed-scale matrix-truncated covariance deviation under finite matrix variance can be used instead of this sufficient sample condition whenever it establishes the same fixed-scale radius for each required scale.

Facts & Assumptions

Given: Countable Choice, the clean iid model, matrix moments, confidence, bracket and sample-size hypothesis in the statement.

[F1]

For every scale σj≥σ0, the fixed-scale proof provides a true-centered concentration event of failure at most hpe−β, hp=(3p+1)/2; on it and the common pilot-radius event the error is at most 3σjβ/m. Fixed-scale matrix-truncated covariance deviation under finite matrix variance.

[F2]

The common prescribed pilot has radius 112tr⁡(Σ)β/m with failure at most e−β. Exact block budget for the covariance geometric-median pilot.

[F3]

Simultaneous required-scale radius-three bounds imply radius eighteen for the selected estimate; the exact number of required scales is N+, and a shared pilot event is paid once. Lepski scale selection transfers fixed-scale covariance bounds.

[F4]

The intrinsic ratio is at least one. The covariance matrix variance ratio is at least one.

Proof

1.1givenF1F2F3F4algebra

Since D≥d≥1 by [F4], m≥9β and the prescribed k≤4.5β≤m/2 is admissible. All finite-grid estimates and the selection rule are defined and measurable. Intersect the common pilot event [F2] with the required concentration events [F1]. Their complement has probability at most [1+hpN+]e−β, by the shared-event conclusion of [F3]. On this intersection all required fixed-scale bounds hold, and [F3] gives the error at most 18σ0β/m.

2.1givenF1F3step 1.1algebra∎

The true grid size is ⌈Lg⌉ and Lg≥1, so N+≤⌈Lg⌉≤2Lg. Therefore 1+hpN+≤1+(3p+1)Lg≤(3p+2)Lg≤5pLg. This proves the unrounded displayed bound by sharper event budgets, rather than the false assertion that the grid has at most Lg elements. The same deterministic argument applies to any separately proved pilot event and fixed-scale interface as stated.

Remarks

The former m≥Cdβ assertion for this unknown-mean estimator is false under arbitrary dependence, as proved by Intrinsic matrix variance alone does not control pilot-centered covariance truncation ↗. The separate two-axis example refutes the trace comparison used by the source. A full known-mean finite-matrix-variance concentration bound, without the trace-aware sample condition, is retained in Oracle-truncated covariance and vector concentration under finite matrix variance.

LemmaStatement: Literature-sourcedProof: AI-adaptedOpen item page →

Clean block-sparse Gaussian covariance has squared operator lower rate s log(ep/s) over n

Statement

Assume AC. Fix M>0 and integers 1≤s≤p/2. There are constants cM,c1>0 such that if slog⁡(ep/s)/n≤c1, then inf⁡Σ^sup⁡Σ∈Fp,s(M)PΣ⊗n ⁣{∥Σ^−Σ∥op2≥cMslog⁡(ep/s)n}≥c1. The infimum is over Borel maps (Rp)n→Rp×p. This is the single-common-block class, not a row-sparsity class.

Facts & Assumptions

Given: AC, M>0, integers p,n≥1 and 1≤s≤p/2, and clean iid observations with law Np(0,Σ) for an unknown Σ∈Fp,s(M).

[F1]

Single-block sparse covariance class and restricted directions: all off-diagonal entries of a candidate covariance lie in one common block of size at most s.

[F2]

Kullback–Leibler divergence between nondegenerate centered Gaussian laws: the KL divergence between positive-definite centered Gaussian laws is 12[tr⁡(Σ1−1Σ0)−p+log⁡(det⁡Σ1/det⁡Σ0)].

[F3]

Additivity of KL divergence for finite product laws: KL divergence of finite product laws is the sum of the component divergences.

[F4]

Fano’s packing bound with a reference-distribution KL bound: for a uniform finite family with pairwise target separation Δ in a metric space and reference law Q, the average squared-metric risk of any estimator kernel is at least Δ24(1−(KQ+log⁡2)/log⁡N), where KQ=N−1∑j=1ND(Pj∥Q). A classifier with the discrete metric has risk equal to its error probability.

[F5]

Pinsker’s inequality with event-supremum total variation: under the event-supremum total-variation convention, ∥P−Q∥TV≤D(P∥Q)/2.

[F6]

Two-point Le Cam lower bound for squared-error risk: for two scalar targets at distance Δ, every estimator has maximum squared-error risk at least Δ28(1−∥P0−P1∥TV). With binary targets 0,1 and binary actions, this is a testing-error lower bound.

Proof

1.1F1F2F3algebra

Suppose s=1 and p≥3. For 1≤j≤p, let Σj=(M/2)I+hejejT, where h=γMlog⁡p/n. These matrices are diagonal, so [F1] places them in Fp,1(M). Since log⁡p/n≤c1, choose γc1≤1/2 so their largest eigenvalue is at most M. Their pairwise operator distance is h. Relative to Q0=Np(0,(M/2)I), [F2] and t=2h/M≤1 give D(Np(0,Σj)∥Q0)=12[t−log⁡(1+t)]≤t2/4. The inequality follows by integrating x/(1+x)≤x from 0 to t. By [F3], each n-sample KL is at most γ2log⁡p.

1.2F2F3F5F6F7algebra

The remaining case with s=1 is p=2. Let Σ0=(M/2)I and Σ1=(M/2)I+he1e1T, where h=γMlog⁡(2e)/n. The sample-size condition and small γ make both matrices members of F2,1(M). With t=2h/M≤1/2, [F2] gives D(N2(0,Σ0)∥N2(0,Σ1))=12[log⁡(1+t)+(1+t)−1−1]≤t2/4. The derivative of the bracket is t/(1+t)2≤t, proving the inequality. By [F3], choose γ small enough that the n-sample KL is at most 1/2. Pinsker [F5] gives total variation at most 1/2; [F6] then gives maximum binary testing error at least 1/16. A wrong nearest covariance decision forces error at least h/2, and its decision cells are Borel by finite distance comparisons, so [F7] gives an admissible test kernel. Thus one law has probability at least 1/16 of squared error at least h2/4=γ2M2log⁡(2e)/(4n), which is the required rate.

1.3F1constructalgebra

Suppose s≥2, and put k=s−1 and m=⌊(p−1)/k⌋. Since p≥2s, m≥2. Partition km of the p−1 coordinates other than coordinate 1 into k disjoint groups of size m. For each word ω∈[m]k, select its indexed coordinate in every group and form the unit vector vω∈Rp with value k−1/2 on those k coordinates and zero elsewhere. There are mk words. Greedily retain a word and delete its Hamming ball of radius ⌊k/100⌋. Each ball has at most ∑j≤k/100(kj)(m−1)j≤exp⁡ ⁣(kh(1/100)+(k/100)log⁡m) words. To obtain the binomial sum bound, put α=1/100; in 1=∑j=0k(kj)αj(1−α)k−j, each weight for j≤αk is at least e−kh(α), and (m−1)j≤mαk.

2.1F4F7step 1.1algebra

Use the p diagonal matrices from step 1.1 as the packing and Q0⊗n as reference. Choose γ so their average KL is at most 110log⁡p. The Fano factor 1−110−log⁡2/log⁡p>1/4 for p≥3, so [F4] gives classification error greater than 1/16. Classify an estimator by its nearest covariance, resolving ties by least index. This rule is Borel because its decision cells are finite intersections of strict or weak comparisons of continuous distances, and [F7] turns it into a deterministic test kernel. If it is misclassified, the triangle inequality forces operator error at least h/2. Thus the supremum tail probability is greater than 1/16 at threshold h2/4. Because log⁡(ep)=1+log⁡p≤2log⁡p, h2/4≥γ2M2log⁡(ep)/(8n), giving the required rate after reducing cM if needed.

2.2step 1.3algebra

The retained code W has pairwise Hamming distance greater than k/100 and log⁡∣W∣≥k[(99/100)log⁡m−h(1/100)]≥910klog⁡m≥980slog⁡(ep/s). Here h(1/100)<350 and log⁡m≥log⁡2>69100. Also m≥p/(2s) because (p−1)/(s−1)≥p/s and ⌊x⌋≥x/2 for x≥2. Thus log⁡(ep/s)=1+log⁡(p/s)≤1+log⁡2+log⁡m≤4log⁡m, and k≥s/2. Further ∣W∣≥3: if k=1, then m≥3 and no word is removed by a radius-zero ball; if k≥2, the displayed bound gives log⁡∣W∣≥95log⁡2>log⁡3. Distinct code vectors satisfy ∥vω−vω′∥22=2dH(ω,ω′)/k>1/50.

3.1F1step 2.2algebra

Define Σω=(M/2)I+a(e1vωT+vωe1T), where a=γMslog⁡(ep/s)/n. The off-diagonal entries lie in the block formed by coordinate 1 and the k=s−1 selected coordinates, so Σω∈Fp,s(M) by [F1]. The perturbation has eigenvalues a,−a on span⁡{e1,vω} and zero on its orthogonal complement. Choose γc1≤1/4, so a≤M/4; then every Σω is positive definite and has top eigenvalue at most M. For distinct codewords, ∥Σω−Σω′∥op=a∥vω−vω′∥2>a/8.

4.1F2F3step 2.2step 3.1algebra

Let Q0=Np(0,(M/2)I). The relative perturbation has eigenvalues 2a/M,−2a/M and zero otherwise. By [F2], D(Np(0,Σω)∥Q0)=−12log⁡(1−(2a/M)2)≤4(a/M)2. The scalar inequality follows by integrating (1−x)−1≤2 from 0 to x=(2a/M)2≤1/2. By [F3], the n-sample KL to Q0⊗n is at most 4γ2slog⁡(ep/s). Since log⁡∣W∣≥910slog⁡(ep/s)/8, choose γ2≤93200 so this KL is at most 110log⁡∣W∣.

5.1F4F7step 2.2step 3.1step 4.1algebra

The Fano factor obeys 1−110−log⁡2log⁡∣W∣≥1−110−log⁡2log⁡3>14. Thus [F4] gives every classifier error greater than 1/16. Nearest-covariance classification from any estimator is wrong only when its operator error is at least half the separation from step 3.1, hence at least a/16. The finite nearest-code rule is Borel by finite distance comparisons, so [F7] makes it a classifier kernel. The supremum tail probability at threshold a2/256 is therefore greater than 1/16, proving the rate for s≥2.

6.1step 2.1step 1.2step 5.1algebra∎

Choose c1≤1/16 and cM≤γ2M2/256. The bounds from steps 2.1, 1.2, and 5.1 cover the cases s=1,p≥3, s=1,p=2, and s≥2, respectively, and give probability at least c1 at threshold cMslog⁡(ep/s)/n. Taking the infimum over estimators and combining the cases proves the claim.

LemmaStatement: Literature-sourcedProof: AI-adaptedOpen item page →

Clean Gaussian covariance has a capped squared operator lower rate

Statement

Assume AC. Fix M>0. There are constants cM,c1>0 such that if p/n≤c1, inf⁡Σ^sup⁡Σ∈Fp(M)PΣ⊗n ⁣{∥Σ^−Σ∥op2≥cMpn}≥c1. The infimum is over Borel maps (Rp)n→Rp×p. The constants may depend on M, but not on p or n.

In addition, there is aM>0 such that for every p,n≥1, inf⁡Σ^sup⁡Σ∈Fp(M)PΣ⊗n{∥Σ^−Σ∥op2≥aMmin⁡{1,p/n}}≥c1. One may choose 0<c1≤1/16 and aM=min⁡{cMc1/2,M2c1/64} after fixing the constants of the first assertion. Thus the original small-ratio lower bound is retained and the capped extension covers every dimension and sample size.

Facts & Assumptions

Given: AC, M>0, integers p,n≥1, and clean iid observations with law Np(0,Σ) for an unknown Σ∈Fp(M).

[F1]

Bounded-spectrum covariance class: Fp(M) consists of positive semidefinite symmetric matrices with operator norm at most M.

[F2]

Real spectral theorem: a self-adjoint endomorphism of a finite-dimensional real inner product space has an orthonormal eigenbasis and Finite epsilon nets of the Euclidean sphere: a symmetric matrix has operator norm sup⁡∥u∥2=1∣uTAu∣, and the Euclidean unit sphere has a 1/4-net of size at most 9p.

[F3]

Kullback–Leibler divergence between nondegenerate centered Gaussian laws: for positive definite covariance matrices, Gaussian KL equals 12[tr⁡(Σ1−1Σ0)−p+log⁡(det⁡Σ1/det⁡Σ0)].

[F4]

Additivity of KL divergence for finite product laws: KL divergence of finite product laws is the sum of the component divergences.

[F5]

Fano’s packing bound with a reference-distribution KL bound: for a uniform finite family with pairwise target separation Δ in a metric space and reference law Q, the average squared-metric risk of any estimator kernel is at least Δ24(1−(KQ+log⁡2)/log⁡N), where KQ=N−1∑j=1ND(Pj∥Q). A classifier with the discrete metric has risk equal to its error probability.

[F6]

Pinsker’s inequality with event-supremum total variation: under the event-supremum total-variation convention, ∥P−Q∥TV≤D(P∥Q)/2.

[F7]

Two-point Le Cam lower bound for squared-error risk: for two scalar targets at distance Δ, every estimator has maximum squared-error risk at least Δ28(1−∥P0−P1∥TV). With binary targets 0,1 and binary actions, this is a testing-error lower bound.

[F9]
[F11]

Multivariate normal law, including singular covariance, The operator norm is zero on the zero domain and otherwise is max_{||v||=1} ||Tv||, and Composition with a Borel measurable outer map preserves measurability: a fixed zero-padding linear map carries a centered Gaussian to the corresponding covariance-block embedding, including singular covariance; compositions with continuous coordinate embeddings and block extractions preserve Borel measurability. The compression norm inequality used below is proved directly from the operator-norm definition.

Proof

1.1F2F9algebra

First suppose p≥16. Put N0=p(p−1)/2 and let W range over symmetric sign matrices with zero diagonal and independent {−1,1} entries above the diagonal. For fixed unit v, vTWv=2∑i<jWijvivj. For t≥0, put h(t)=t−tanh⁡t and g(t)=t2/2−log⁡(cosh⁡t). By [F9], h(0)=0 and h′(t)=1−sech⁡2t=tanh⁡2t≥0, so the mean value theorem gives h(t)≥0; then g(0)=0 and g′(t)=h(t)≥0. Evenness gives g(t)≥0 for all real t, so cosh⁡t≤et2/2. Since each Wij is a uniform sign and the signs are independent, EeλvTWv=∏i<jEe2λvivjWij=∏i<jcosh⁡(2λvivj)≤exp⁡ ⁣(2λ2∑i<jvi2vj2)≤eλ2. Chernoff's inequality applied to both signs gives Pr⁡(∣vTWv∣>t)≤2e−t2/4. By [F2], use a 1/4-net with at most 9p points; approximating each unit vector changes its quadratic form by at most 12∥W∥op. Thus ∥W∥op≤2max⁡v in net∣vTWv∣. A union bound at t=8p gives failure probability at most 2⋅9pe−16p<1/2. At least half of the sign matrices therefore satisfy ∥W∥op≤16p.

1.2F8constructalgebra

In the finite Hamming cube of upper-triangular signs, greedily retain a good matrix and delete all good matrices within Hamming distance ⌊N0/8⌋. Each deleted ball contains at most ∑j≤N0/8(N0j)≤eN0h(1/8) words, where h(t)=−tlog⁡t−(1−t)log⁡(1−t). For α=1/8, the binomial theorem gives 1=∑j=0N0(N0j)αj(1−α)N0−j. Each weight with j≤αN0 is at least ααN0(1−α)(1−α)N0=e−N0h(α), which proves the ball bound. Greedy deletion retains at least 2N0−1e−N0h(1/8) words. The resulting code W has pairwise Hamming distance greater than N0/8 and log⁡∣W∣≥N0(log⁡2−h(1/8))−log⁡2≥120p2. Here h(1/8)<1950, N0≥p2/3, and p≥16. For distinct code matrices, ∥W−W′∥F2 is eight times their upper-triangular Hamming distance, hence at least N0.

1.3F1F3F4algebra

Now suppose 1≤p≤15. Set Σ0=(M/2)I and Σ1=(M/2)I+he1e1T, where h=γMp/n. The condition p/n≤c1 and small γ make both matrices members of Fp(M). With t=2h/M≤1/2, [F3] gives D(Np(0,Σ0)∥Np(0,Σ1))=12[log⁡(1+t)+(1+t)−1−1]≤t2/4. The derivative of the bracket is t/(1+t)2≤t, proving the bound. By [F4], the n-sample KL is at most γ2p≤15γ2; choose γ so it is at most 1/2.

2.1F1F8step 1.2algebra

Set ΣW=(M/2)I+(a/p)W with a=γMp/n, where γ>0 is sufficiently small. Since ∥W∥op≤16p, the perturbation has norm at most 16a; choose γc1≤1/64 so 16a≤M/4. Thus each ΣW is positive definite and belongs to Fp(M) by [F1]. If W≠W′, [F8] gives ∥ΣW−ΣW′∥op≥ap∥W−W′∥F≥aN0p2≥a2.

2.2F6F7F10step 1.3algebra

Pinsker [F6] gives ∥P0⊗n−P1⊗n∥TV≤1/2. By [F7], every binary test has maximum error probability at least 1/16. The nearest-covariance test from an arbitrary estimator is wrong only when its operator error is at least h/2; its two decision cells are Borel by finite distance comparisons, so [F10] makes it an admissible test kernel. Therefore one of the two laws has probability at least 1/16 of squared error at least h2/4=γ2M2p/(4n). This proves the rate for p≤15.

3.1F3F4step 1.2step 2.1algebra

Let Q0=Np(0,(M/2)I) be a reference law. For each W, the relative perturbation has eigenvalues ri with ∣ri∣≤1/2 and ∑iri=0. By [F3], D(Np(0,ΣW)∥Q0)=12∑i(ri−log⁡(1+ri))≤12∑iri2≤2(a/M)2p. The scalar inequality follows by integrating t/(1+t) from zero to ri and using ∣t/(1+t)∣≤2∣t∣ for ∣t∣≤1/2. Also ∑iri2=4a2∥W∥F2/(M2p) and ∥W∥F2=2N0. By [F4], the average n-sample KL to Q0⊗n is at most 2γ2p2. Choose γ smaller if needed so this is at most 110log⁡∣W∣.

4.1F5F10step 2.1step 3.1algebra

The Fano factor in [F5] satisfies 1−110−log⁡2log⁡∣W∣>12, using log⁡∣W∣≥p2/20 and p≥16. Thus every classifier of the uniform index has error probability greater than 1/8. Classify an estimator by its nearest ΣW, resolving ties by least index. This rule is Borel: its decision cell for index j is the finite intersection of strict distance comparisons against earlier indices and weak comparisons against later indices. If it is wrong, the triangle inequality and step 2.1 force operator error at least a/4. Thus the supremum tail probability at threshold a2/16 is greater than 1/8. Since a2=γ2M2p/n, this proves the rate for p≥16.

5.1step 4.1step 2.2algebra

Choose c1≤1/16 and cM≤γ2M2/16. Steps 4.1 and 2.2 give a probability lower bound at least c1 at threshold cMp/n in their respective dimension ranges. Taking the infimum over estimators and combining the ranges proves the first, small-ratio assertion for all dimensions satisfying its premise.

6.1step 5.1givenalgebra

Abbreviate the constants just established by b=cM>0 and c=c1∈(0,1/16], and put aM=min⁡{bc/2,M2c/64}. If p/n≤c, step 5.1 gives tail probability at least c at threshold bp/n. Since aM≤b and min⁡{1,p/n}≤p/n, lowering the threshold gives the asserted capped bound in this case.

7.1F1F11step 5.1step 6.1givenalgebra

Suppose p/n>c and n≥2/c. Put k=⌊cn⌋, so 1≤k≤p and c/2≤k/n≤c. Let J:Rk→Rp be the zero-padding coordinate isometry. For any Borel ambient matrix estimator A, the rule Ak(y1,…,yn)=JTA(Jy1,…,Jyn)J is Borel by [F11]. For any matrix B, including a nonsymmetric one, ∥JTBJ∥op≤∥B∥op: for each unit u, ∥JTBJu∥2≤∥BJu∥2≤∥B∥op because J is an isometry and JT discards coordinates. Every Θ∈Fk(M) embeds as JΘJT∈Fp(M) by [F1], and [F11] identifies its iid sample with zero-padded Nk(0,Θ) observations. Apply the small-ratio result of step 5.1 in dimension k to Ak. Since ∥Ak−Θ∥op≤∥A−JΘJT∥op, the ambient supremum tail probability is at least c at threshold bk/n≥bc/2≥aMmin⁡{1,p/n}. This holds for every ambient Borel estimator.

7.2F1F3F4F6F7F10step 1.3step 6.1givenalgebra

Suppose p/n>c and n<2/c. Take Σ0=(M/2)Ip and Σ1=Σ0+he1e1T, where h=Mc/4. Both are positive definite in Fp(M) and their operator separation is h. Put t=2h/M=c/2. The scalar KL calculation from step 1.3 and [F3] gives D(P0∥P1)=12[log⁡(1+t)+(1+t)−1−1]≤t2/4=h2/M2; the bracket has derivative t/(1+t)2≤t for t≥0. Thus [F4] gives D(P0⊗n∥P1⊗n)≤nh2/M2<1/8, and [F6] gives total variation at most 1/4. Classify an arbitrary Borel estimator by the nearer of these two covariance matrices, resolving ties by the first index. This is a Borel binary test by [F10]. Apply the expected squared-risk theorem [F7] to that test with scalar targets 0,1: its squared risks are exactly its error probabilities, so their maximum is at least (1−TV)/8≥3/32≥c. A wrong classification forces the original operator error to be at least h/2 by the triangle inequality. The ambient maximum tail probability is therefore at least c at squared threshold h2/4=M2c/64≥aMmin⁡{1,p/n}.

8.1step 6.1step 7.1step 7.2algebra∎

The three cases in steps 6.1, 7.1, and 7.2 cover every p,n≥1. Each establishes the same probability constant c=c1 at threshold aMmin⁡{1,p/n} for every Borel matrix-valued estimator, so taking their infimum proves the all-regime assertion. The preceding small-ratio result remains unchanged.

TheoremStatement: Literature-sourcedProof: AI-adaptedOpen item page →

Dense Gaussian Huber covariance: high-probability upper and capped lower bounds

Statement

Assume AC. Fix M>0. Let X1,…,Xn be independent with common law Pϵ,Σ,Q from Gaussian Huber contamination model for covariance estimation, where Σ∈Fp(M) and Q is arbitrary. If 0≤ϵ<1/5, 0<δ<1/2, and C1(p+log⁡(1/δ))/n<1 for a sufficiently large universal C1, then every Borel measurable dense matrix-depth estimator, from either the global positive semidefinite correspondence or the bounded-class correspondence, Σ^=Γ^/β from Matrix depth and covariance estimators satisfies ∥Σ^−Σ∥op2≤CM[(pn∨ϵ2)+log⁡(1/δ)n] with probability at least 1−2δ, uniformly over Q and Σ∈Fp(M).

Such Borel maximizing selectors exist by Measurable selection of a matrix-depth maximizer.

There are constants cM,cM′>0 such that for every p,n≥1 and every 0≤ϵ≤1, inf⁡Σ~sup⁡Σ∈Fp(M)sup⁡QPϵ,Σ,Q⊗n ⁣{∥Σ~−Σ∥op2≥cMmin⁡{1,pn∨ϵ2}}≥cM′. The infimum is over all Borel maps (Rp)n→Rp×p. The constants may depend on M.

Facts & Assumptions

Given: AC, the Gaussian Huber model, Σ∈Fp(M), arbitrary contaminating law Q, and the stated confidence and sample-size conditions.

[F1]

Operator error bound for the Gaussian Huber matrix-depth estimator gives the directional operator-error bound for the dense sphere family, for a Borel statistic satisfying the empirical-depth comparison.

[F2]

Clean Gaussian covariance has a capped squared operator lower rate gives, under AC, the clean tail-risk lower bound of order min⁡{1,p/n} for all p,n≥1, retaining the original small-ratio result.

[F3]

The Huber covariance contamination modulus has a quadratic lower bound gives ω(ϵ,Fp(M))≥dMϵ2.

[F4]

Huber covariance modulus lower bound for unrestricted matrix-valued actions: under AC, a clean tail-risk lower bound for all matrix-valued estimators and a finite contamination modulus give the Huber lower bound at threshold 116(M0∨ω), for the same unrestricted action space.

[F5]

Real spectral theorem: a self-adjoint endomorphism of a finite-dimensional real inner product space has an orthonormal eigenbasis: for real symmetric A, ∥A∥op=sup⁡∥u∥2=1∣uTAu∣.

[F6]

Bounded-spectrum covariance class: every Σ∈Fp(M) is positive semidefinite and has operator norm at most M.

[F7]

Measurable selection of a matrix-depth maximizer supplies Borel maximizers for the global and bounded-class correspondences. A global maximizer dominates βΣ in depth; in the bounded case βΣ belongs to the search class by the target spectrum bound.

Proof

1.1F1F5F7algebra

By [F7], Borel maximizers exist in both versions and every such maximizer satisfies the comparison premise in [F1]. Take U=Sp−1, one support S1=[p], and r=p in [F1]. For a real symmetric matrix A, [F5] gives ∥A∥op=sup⁡∥u∥2=1∣uTAu∣. Thus ∥Σ^−Σ∥op≤CM(ϵ+(p+log⁡(1/δ))/n). Squaring and using (a+b)2≤2a2+2b2 gives the stated upper rate.

1.2F2F3F4F6algebra

The all-regime clean lower bound [F2] supplies constants aM,b0>0 such that the clean tail-risk premise in [F4] holds for every p,n≥1 with M0=aMmin⁡{1,p/n} and c0=b0. By [F3], the contamination modulus is at least dMϵ2. It is finite because ∥Σ0−Σ1∥op2≤4M2 for every pair in the bounded class.

2.1F2F3F4step 1.2algebra∎

Apply [F4] with the same unrestricted matrix-valued estimator class as in the Statement and the inputs from step 1.2. Its threshold 116(M0∨ω) is at least 116min⁡{aM,dM}(min⁡{1,p/n}∨ϵ2). Since 0≤ϵ≤1, min⁡{1,p/n}∨ϵ2=min⁡{1,(p/n)∨ϵ2}. Lowering to this capped threshold only enlarges the event, and the probability lower bound is min⁡(b0,1/2). Renaming the two positive constants proves the all-dimension lower assertion. Its original uncapped rate remains valid whenever p/n≤1.

Authoring status

The lower proof uses the current batch-17 and batch-31 supplier bodies. The local measurable-selection proof discharges the selector-existence obligation for both global and bounded-class matrix-depth versions.

TheoremStatement: Literature-sourcedProof: AI-adaptedOpen item page →

Single-block sparse Gaussian Huber covariance: high-probability upper and low-ratio lower bounds

Statement

Assume AC. Fix M>0 and an integer 1≤s≤p/2. Let X1,…,Xn be independent with common law Pϵ,Σ,Q from Gaussian Huber contamination model for covariance estimation, where Σ∈Fp,s(M) and Q is arbitrary. If 0≤ϵ<1/5, 0<δ<1/2, and C1slog⁡(ep/s)+log⁡(1/δ)n<1 for sufficiently large universal C1, then every Borel measurable restricted matrix-depth estimator, from either the global single-block correspondence or the bounded-class correspondence, Σ^=Γ^/β satisfies ∥Σ^−Σ∥op2≤CM[(slog⁡(ep/s)n∨ϵ2)+log⁡(1/δ)n] with probability at least 1−2δ, uniformly over Q and Σ∈Fp,s(M).

Such Borel maximizing selectors exist by Measurable selection of a matrix-depth maximizer.

There are constants cM,cM′,c1>0 such that whenever slog⁡(ep/s)/n≤c1, for every 0≤ϵ≤1, inf⁡Σ~sup⁡Σ∈Fp,s(M)sup⁡QPϵ,Σ,Q⊗n ⁣{∥Σ~−Σ∥op2≥cM(slog⁡(ep/s)n∨ϵ2)}≥cM′. The constants may depend on M. The class is one common correlated block, not a row-sparsity class. The infimum is over all Borel maps (Rp)n→Rp×p.

Facts & Assumptions

Given: AC, 1≤s≤p/2, Σ∈Fp,s(M), the Gaussian Huber model, and the stated confidence and sample-size restrictions.

[F1]

Operator error bound for the Gaussian Huber matrix-depth estimator gives the directional error bound over a union of coordinate spheres, for a Borel statistic satisfying the empirical-depth comparison.

[F2]

Clean block-sparse Gaussian covariance has squared operator lower rate s log(ep/s) over n gives, under AC, the clean tail-risk lower bound of order slog⁡(ep/s)/n when its sample-size condition holds.

[F3]

The Huber covariance contamination modulus has a quadratic lower bound gives ω(ϵ,Fp,s(M))≥dMϵ2.

[F4]

Huber covariance modulus lower bound for unrestricted matrix-valued actions: under AC, a clean tail-risk lower bound for all matrix-valued estimators and a finite contamination modulus give the Huber lower bound at threshold 116(M0∨ω), for the same unrestricted action space.

[F5]

Real spectral theorem: a self-adjoint endomorphism of a finite-dimensional real inner product space has an orthonormal eigenbasis: for real symmetric A, ∥A∥op=sup⁡∥u∥2=1∣uTAu∣.

[F6]

Single-block sparse covariance class and restricted directions: off-diagonal support lies in one common coordinate block of size at most s, and the operator norm is bounded by M.

[F10]

Every nonempty finite set of reals has a maximum and a minimum: a nonempty finite set of real numbers has a maximum; applying this to the absolute diagonal entries gives a coordinate attaining their largest absolute value.

[F7]

Measurable selection of a matrix-depth maximizer supplies Borel maximizers for the global and bounded-class correspondences. A global maximizer dominates βΣ in depth; in the bounded case βΣ belongs to the search class by the target spectrum bound.

Proof

1.1F1F5F6F7F8F9F10algebra

By [F7], Borel maximizers exist in both versions and satisfy [F1]'s empirical-depth comparison. Put k=2s and m=(pk). By [F8], m≤pk/k!. Since log⁡x≤log⁡j for x∈[j−1,j] and 2≤j≤k, summing over these intervals and using [F9] gives log⁡k!=∑j=2klog⁡j≥∫1klog⁡x dx=klog⁡k−k+1≥klog⁡k−k. Exponentiating with [F9] yields k!≥(k/e)k, hence m≤(ep/k)k and log⁡m≤2slog⁡(ep/(2s))≤2slog⁡(ep/s). Enumerate the coordinate sets of size 2s and take U=Us, r=2s in [F1]. If A=Σ^−Σ, choose blocks of size at most s supporting the off-diagonal entries of its two summands, and let T be their union. Then ∣T∣≤2s, entries between T and Tc vanish, and the block on Tc is diagonal. Thus A is block diagonal on RT⊕RTc, with symmetric block AT and diagonal block D on Tc. Its operator norm is the larger block norm: for x=xT+xTc, ∥Ax∥22 is the sum of the squared norms of the two block outputs, and a norm-maximizing vector in either nonempty finite-dimensional block attains its block norm. If T≠∅ and either Tc=∅ or ∥AT∥op≥∥D∥op, [F5] gives a unit eigenvector attaining ∥AT∥op, supported in T. If T=∅ and ∥D∥op=0, then A=0, and any coordinate unit vector belongs to Us because p≥2s; it attains ∥A∥op=0. In every remaining case Tc≠∅ and ∥D∥op>∥AT∥op (with the empty-block norm set to zero). Write D=diag⁡(di:i∈Tc). By [F10] choose j∈Tc with ∣dj∣=max⁡i∈Tc∣di∣. For every unit x∈RTc, ∣xTDx∣=∣∑idixi2∣≤max⁡i∣di∣∑ixi2=∣dj∣, and the coordinate vector ej attains equality. By [F5], ej therefore attains ∥D∥op. In either case some unit vector attaining ∥A∥op has support of size at most 2s. Since p≥2s, its support extends to a set of size exactly 2s, so the vector belongs to Us. Conversely every unit vector in Us is among all unit vectors, hence ∥A∥op=sup⁡u∈Us∣uTAu∣ by [F5]. Finally, 2s+log⁡(m/δ)≤4slog⁡(ep/s)+log⁡(1/δ)≤4(slog⁡(ep/s)+log⁡(1/δ)). Squaring [F1]'s bound proves the displayed upper rate after adjusting CM.

1.2F2F3F6algebra

By [F2], the clean lower premise holds at M0=bMslog⁡(ep/s)/n for sufficiently small slog⁡(ep/s)/n, with a fixed positive probability b0. By [F3], the contamination modulus is at least dMϵ2. It is finite because ∥Σ0−Σ1∥op2≤4M2 for all pairs in the bounded class.

2.1F2F3F4step 1.2algebra∎

Apply [F4] with these clean and modulus bounds and the unrestricted matrix-valued estimator class in the Statement. Its threshold 116(M0∨ω) is at least a constant multiple of slog⁡(ep/s)/n∨ϵ2, and the probability lower bound is min⁡(b0,1/2). Lowering the threshold only enlarges the event, which proves the lower assertion for the event probabilities in the Statement.

Authoring status

The lower proof uses the current batch-17 and batch-31 supplier bodies. The local measurable-selection proof discharges the selector-existence obligation for both global and bounded-class matrix-depth versions.

5 · Examples, counterexamples and false statements

None yet.

Sources