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 — Examples

1 · Prerequisites

2 · Summary

These examples check the Gaussian Huber model, the single-common-block sparsity convention, and a clean polynomial-tail law with finite matrix variance. The counterexamples distinguish three failures: the two-axis law refutes the auxiliary trace comparison, the growing-axis family refutes the former d-only pilot sample condition, and the zero estimator refutes an uncapped all-regime lower rate on a bounded-spectrum class. The active trace-aware covariance theorem and capped lower rate remain supported by their local proofs.

Pilot centering and intrinsic variance

The new axis-family example keeps intrinsic matrix variance bounded while its trace grows. On an event of probability approaching one, the same-sample geometric-median pilot makes radial truncation erase the leading covariance direction. A joint sample/dimension/confidence sequence makes the former ambient-dimension failure guarantee nonvacuous and still contradicts it. The earlier two-axis example is retained for its distinct auxiliary trace comparison. These clean heavy-tail examples do not describe Huber contamination.

Dense lower bounds at large dimension

The zero-estimator counterexample shows why a bounded-spectrum covariance class cannot have an uncapped all-dimension lower rate. The all-regime Gaussian Huber lower bound uses the capped scale, while its original small-dimension rate and the separate upper confidence conditions remain intact.

3 · Logical flowchart

4 · Definitions, theorems and proofs

None yet.

5 · Examples, counterexamples and false statements

CounterexampleConstruction: AI-generatedVerification: AI-generatedjudge pass (gpt-6-luna)Open item page →

Matrix variance need not dominate trace covariance times operator norm

Statement refuted

For every centered square-integrable random vector Z with finite fourth moment, the matrix variance σ02=∥E[∥Z∥22ZZT]∥op is at least tr⁡(Σ)∥Σ∥op, where Σ=E[ZZT].

Facts & Assumptions

[F1]

Covariance matrix of a finite-dimensional random vector: for a centered vector, Σ=E[ZZT].

[F2]

Matrix variance for covariance estimation: σ02=∥E[∥Z∥22ZZT]∥op.

[F3]

The operator norm is zero on the zero domain and otherwise is max_{||v||=1} ||Tv||: the operator norm is the maximum of ∥Av∥2 over unit vectors.

[F4]

Real spectral theorem: a self-adjoint endomorphism of a finite-dimensional real inner product space has an orthonormal eigenbasis: a real symmetric matrix has an orthonormal eigenbasis, so the operator norm of a diagonal symmetric matrix is the largest absolute diagonal entry.

Counterexample

1.1givenF1algebra

In R2, let Z take values ±4/3 e1 with total probability 3/4 (each sign has probability 3/8), and ±2 e2 with total probability 1/4 (each sign has probability 1/8). Symmetry gives EZ=0, and finite support gives a finite fourth moment.

1.2givenF1F4algebra

Direct summation and [F1] give Σ=E[ZZT]=diag⁡(1,1/2), hence tr⁡(Σ)=3/2 and ∥Σ∥op=1 by [F4].

2.1F2F3F4step 1.2algebra∎

The value of ∥Z∥22 is 4/3 on the first pair and 2 on the second, so E[∥Z∥22ZZT]=diag⁡ ⁣(34(43)2,14(2)2)=diag⁡(4/3,1). Its operator norm is 4/3<3/2=tr⁡(Σ)∥Σ∥op by [F4]. Thus the statement is false.

Remarks

This refutes the auxiliary inequality used in Minsker–Wei, Corollary 5.1, for arbitrary dependent coordinates. It does not by itself refute their covariance-estimator theorem; another argument or corrected hypotheses would be needed.

ExampleConstruction: AI-generatedVerification: AI-generatedjudge pass (gpt-6-luna)Open item page →

A polynomial-tail law with finite matrix variance

Example

For r>1 let ζ(r)=∑k=1∞k−r. On Ω=Z∖{0} with its power-set sigma-algebra, let P=∑k=1∞12ζ(6)k6(δk+δ−k). Set X(ω)=ω. Thus the two atoms k,−k each have mass 1/(2ζ(6)k6).

Facts & Assumptions

Given: The countable atomic construction in the Example and the covariance and matrix-variance conventions.

[F2]

Probability measures and probability spaces: a measure whose total mass is one is a probability measure.

[F3]

Random elements and real random variables, A measurable function between measurable spaces, and The Borel sigma-algebra of a topological space: the identity map from the full power-set sigma-algebra is a measurable real random variable.

[F5]

For rational p>0, ∑1/kp converges iff p>1: ζ(2), ζ(4), and ζ(6) are finite positive real numbers.

[F6]

Covariance matrix of a finite-dimensional random vector and Matrix variance for covariance estimation: for p=1 and mean zero, Σ=EX2 and σ02=EX4.

[F7]

Cauchy-Schwarz for random variables: on a probability space, E∣X∣≤(EX2)1/2 when X is square-integrable.

Verification

1.1F1F2F3F5algebra

By [F1], P is a measure, and its total mass is ζ(6)−1∑k=1∞k−6=1 by [F5]. Thus [F2] makes P a probability measure. The identity map is the real random variable specified by [F3], and P(X=±k)=1/(2ζ(6)k6) for each k≥1.

1.2F1F4F5F7algebra

For q=2 and q=4, the truncations YN=∣X∣q1{∣X∣≤N} are nonnegative simple functions increasing to ∣X∣q. By [F4] and the finite atom masses, E∣X∣q=lim⁡N→∞EYN=1ζ(6)∑k=1∞kq−6=ζ(6−q)ζ(6)<∞, where convergence is [F5]. In particular X is integrable by [F7], and its symmetric atom masses give EX=0.

2.1F5F6step 1.2algebra

By [F6], the covariance is Σ=ζ(4)/ζ(6)>0, while the scalar matrix variance is σ02=ζ(2)/ζ(6)<∞. Therefore d=σ02Σ2=ζ(2)ζ(6)ζ(4)2 is finite and positive.

3.1F1F4step 1.1algebra∎

Fix t>0. The simple truncations WN=et∣X∣1{∣X∣≤N} increase to et∣X∣, so [F4] gives Eet∣X∣=1ζ(6)∑k=1∞etkk−6=+∞. Indeed the ratio of successive summands is et(k/(k+1))6→et>1, so the summands do not tend to zero and the series diverges. The law has polynomially decaying atom masses, finite matrix variance, and no finite positive exponential moment.

CounterexampleConstruction: AI-generatedVerification: AI-generatedjudge pass (gpt-6-luna)Open item page →

A bounded covariance class forces a capped lower rate

Statement refuted

For fixed M>0, there are positive constants CM,c0 such that for every p,n≥1 and 0≤ϵ≤1, inf⁡Σ^sup⁡Σ∈Fp(M)sup⁡QPϵ,Σ,Q⊗n{∥Σ^−Σ∥op2≥CM((p/n)∨ϵ2)}≥c0, where the infimum ranges over all Borel matrix-valued estimators.

Facts & Assumptions

Given: AC, a fixed M>0, proposed positive constants CM,c0, and the bounded-spectrum Gaussian Huber model.

[F1]

Bounded-spectrum covariance class: every Σ∈Fp(M) is positive semidefinite with ∥Σ∥op≤M.

[F2]

The operator norm is zero on the zero domain and otherwise is max_{||v||=1} ||Tv||: changing the sign of a matrix preserves its operator norm.

[F3]

Every complete ordered field is Archimedean: the natural numbers are unbounded above in the real field.

[F4]

Gaussian Huber contamination model for covariance estimation gives the Gaussian Huber sample laws. Their Gaussian convention retains The Axiom of Choice; the pointwise loss bound below is independent of the sampling law.

Counterexample

1.1F1F2F4givenalgebra

The constant zero-matrix estimator is Borel, since the inverse image of any Borel set is either the entire sample space or empty. For every target in the class its squared operator loss is ∥0−Σ∥op2=∥Σ∥op2≤M2 by [F1]–[F2], for every possible observation and every contaminant.

2.1F3F4step 1.1givenchoosealgebra∎

By [F3], choose an integer p>M2/CM, and take n=1, ϵ=0. The proposed threshold is CMp>M2, so the tail event for the zero estimator is empty under every target and contaminant by step 1.1. Its worst-case probability, hence the nonnegative minimax infimum, is zero, contradicting c0>0. Thus an uncapped all-dimension lower rate is false; the bounded loss requires a cap such as min⁡{1,(p/n)∨ϵ2} in a valid matching lower statement.

CounterexampleConstruction: AI-generatedVerification: AI-generatedjudge pass (gpt-6-luna)Open item page →

Intrinsic matrix variance alone does not control pilot-centered covariance truncation

Statement refuted

There is a universal C such that every clean iid finite-fourth-moment law with nonzero covariance, intrinsic matrix-variance ratio d=σ02/∥Σ∥op2 and m≥Cdβ has the following guarantees for the same-sample geometric-median pilot procedure: the fixed-scale error is at most 3σβ/m, with failure at most 5de−β, and the adaptive error is at most 18σ0β/m, with failure at most 5dlog⁡2(2σmax⁡/σmin⁡)e−β. Even replacing the failure prefactor d by ambient dimension p does not make the Cdβ sample condition sufficient in general.

Facts & Assumptions

Given: Countable Choice for the specified minimum-norm pilot; a proposed universal C; the exact prescribed procedure and any deterministic balanced blocks.

[F1]

The covariance algorithm uses the geometric median of its balanced block means, rank-one radial truncation with ψ(t)=min⁡(t,1) for t≥0, and a fixed dyadic scale grid. Adaptive truncated covariance estimator.

[F2]

For a centered vector, covariance is Σ=E[XXT]. Covariance matrix of a finite-dimensional random vector.

[F3]

Matrix variance is σ02=∥E[∥X∥2XXT]∥op. Matrix variance for covariance estimation.

Counterexample

1.1givenF2F3algebraconstruct

Fix β=10, so k=36, and choose a fixed integer m arbitrarily large with m≥2Cβ, bmin⁡=⌊m/k⌋≥2, k(2/3)bmin⁡<1/100 and 182β/m<1/2. For each p≥2, set λ1=1, λj=p−1/2 for j≥2, Sp=∑jλj2=2−1/p, and qj=λj2/Sp. Let X take ±λj/qj ej, each with probability qj/2. It is centered and finitely supported. Direct summation gives Σp=diag⁡(λj), ∥Σp∥op=1, E[∥X∥2XXT]=SpIp and σ02=d=Sp<2. Thus m≥Cdβ for all p, but tr⁡Σp→∞. Tail-axis observations j≥2 have common squared radius Rp2=Spp.

2.1givenF1step 1.1algebra

Let Ep be the event that every block contains at least one tail-axis draw and that all sampled tail axes are distinct. A block has no tail draw with probability (1/Sp)bj; conditional tail-axis labels are uniform on p−1 coordinates. Union bounds give P(Ep)≥1−k(1/Sp)bmin⁡−m(m−1)/(2(p−1))>49/50 for large p. Every geometric median of finite points lies in their convex hull: if x lies outside that compact hull and z is a closest hull point, differentiating the squared distance along the segment from z to any hull point q gives ⟨x−z,q−z⟩≤0. Expanding the square then gives ∥x−q∥2≥∥x−z∥2+∥z−q∥2>∥z−q∥2, so replacing x by z strictly reduces every summand, contradicting median minimality. Write therefore μ^=∑lwlMl with wl≥0, ∑lwl=1. On Ep the tail parts of the block means have disjoint supports and norms at least Rp/bmax⁡, where bmax⁡=⌈m/k⌉. Thus ∥μ^tail∥2≥Rp2∑lwl2/bmax⁡2≥Rp2/(kbmax⁡2), and ∣μ^1∣≤Sp.

3.1givenF1F2F3step 1.1step 2.1algebra

For an axis-one sample, ∥Xi−μ^∥2≥∥μ^tail∥2. For a tail draw in block l, its unique tail coordinate in the pilot is exactly wl/bl times its sample coordinate, so the difference has magnitude at least Rp(1−wl/bl)≥Rp/2. Hence uniformly in i, ∥Xi−μ^∥2≥cmRp2, with cm=min⁡{1/(kbmax⁡2),1/4}>0, whereas ∣(Xi−μ^)1∣≤2Sp. Choose the exact scale bracket σmin⁡=σmax⁡=σ0=Sp. Its grid is {0}, so adaptive and fixed-scale estimates coincide. With θ=σ0−1β/m, all centered samples are clipped for large p, and their rank-one formula gives e1TΣ^e1≤4Sp/(θcmRp2)=4/(θcmp)→0. The true entry is one, so operator error exceeds 1/2 on Ep eventually. Both claimed thresholds are below 1/2 by step 1.1, whereas their claimed failure budget is 5de−10<10e−10<1/1000. This contradicts P(Ep)>49/50. Since m was chosen after an arbitrary proposed C, no universal such C exists.

4.1givenF1F2F3step 1.1step 2.1step 3.1algebra∎

To obtain a nonvacuous contradiction even with the corrected ambient prefactor, let an integer b→∞ satisfy b≥C, and take βb=2b/2/100, kb=⌊(7/2)βb⌋+1, mb=kbb and pb=⌈eβb/2⌉. These satisfy βb>1 eventually, mb>(7/2)bβb≥Cdβb and balanced blocks all of size b. The no-tail-block error in step 2.1 is at most (9/2)βb(2/3)b=(9/200)(22/3)b→0; the collision error is O(βb2b2e−βb/2)→0. Here cmb=1/(kbb2) eventually and 1/θ=Spbkbb/βb=O(b). Thus the upper bound for the estimated leading entry in step 3.1 is O(βbb5/2e−βb/4)→0, whereas its true entry remains one. The larger advertised error radius is at most 184/(7b)→0, while 5pbe−βb≤10e−βb/2→0. Both failures therefore occur with probability tending to one even though the ambient-prefactor bound would require it to tend to zero. Each asserted vanishing follows since βb grows exponentially in b and e−cβb dominates every fixed power of βb,b; taking logarithms proves these limits directly. This also disproves the dimension-uniform source-shaped guarantee under only m≥Cdβ.

Remarks

The distinct two-axis counterexample Matrix variance need not dominate trace covariance times operator norm refutes the source's auxiliary trace comparison. This family proves failure of the unknown-mean estimator guarantee itself under only the intrinsic-ratio sample condition. It does not refute a correctly proved known-mean bound, a uniform pilot-accuracy interface, or a trace-aware sample requirement.

ExampleConstruction: AI-generatedVerification: AI-adaptedOpen item page →

A covariance matrix with one correlated block

Example

Let p=4, s=2, M=2, ϵ=1/10, and Σ=I4+14(e1e2T+e2e1T),Q=δ0. The observations have law Pϵ,Σ,Q.

Facts & Assumptions

Given: The matrix Σ, block size s=2, bound M=2, and contamination law in the Example.

[F1]

Bounded-spectrum covariance class defines Fp(M) by symmetry, positive semidefiniteness and operator norm at most M. Single-block sparse covariance class and restricted directions additionally requires all off-diagonal entries to lie in one common coordinate block of size at most s and defines Fp,s(M).

[F2]
[F3]

The Gaussian Huber covariance mixture is a probability law proves the mixture's probability-measure property.

[F4]

Real spectral theorem: a self-adjoint endomorphism of a finite-dimensional real inner product space has an orthonormal eigenbasis: the eigenvalues of a real symmetric matrix determine its positive semidefiniteness and operator norm.

[F5]

The Dirac set function at a point and A Dirac set function is a probability measure: a point mass is a probability measure on the Borel space.

Verification

1.1F1F4algebra

The only nonzero off-diagonal entries of Σ are Σ12=Σ21=1/4, both supported in S={1,2}. Its eigenvalues are 5/4,3/4,1,1, so Σ⪰0 and ∥Σ∥op=5/4≤M by [F4]. Since Σ is symmetric, these checks give Σ∈F4(2) and, with the support check, Σ∈F4,2(2) by [F1].

2.1F2F3F5algebra∎

The contaminant Q=δ0 is a probability measure by [F5], and ϵ∈[0,1]. The mixture is a well-defined Huber model by [F2] and [F3]. The structure is one correlated block; it does not assert the column-wise weak-ℓq sparsity condition from the separate sparse covariance model.

ExampleConstruction: AI-generatedVerification: AI-generatedjudge pass (gpt-6-luna)Open item page →

Dense Gaussian Huber covariance model

Example

Let p=2, M=2, ϵ=1/10, Σ=(11/41/41),Q=δ(2,0). Take independent observations with the Gaussian Huber law Pϵ,Σ,Q from Gaussian Huber contamination model for covariance estimation.

Facts & Assumptions

Given: The matrix Σ, M=2, ϵ=1/10, and the point-mass contaminant Q in the Example.

[F1]

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

[F2]

Bounded-spectrum covariance class defines Fp(M) by positive semidefiniteness and the operator-norm bound.

[F3]

The Gaussian Huber covariance mixture is a probability law proves the displayed mixture is a probability law.

[F4]

Real spectral theorem: a self-adjoint endomorphism of a finite-dimensional real inner product space has an orthonormal eigenbasis: the eigenvalues of a real symmetric matrix determine its positive semidefiniteness and operator norm.

[F5]

The Dirac set function at a point and A Dirac set function is a probability measure: a point mass is a probability measure on the Borel space.

Verification

1.1F2F4algebra

The eigenvalues of Σ are 5/4 and 3/4, so Σ is positive definite and ∥Σ∥op=5/4≤2 by [F4]. Thus Σ∈F2(2).

2.1F1F3F5algebra∎

The Dirac law Q=δ(2,0) is a probability measure by [F5], and 0<ϵ<1. By [F1] and [F3], Pϵ,Σ,Q is a well-defined Huber sampling law. The target remains the clean Gaussian covariance Σ, not the covariance of the mixture.

Sources