Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-generatedPipeline-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.

Diagonal covariance lower bound with bounded-risk saturation

Statement

Assume AC, as inherited through Fano’s packing bound with a reference-distribution KL bound. For every n≥1, p≥2, τ>0, 0≤q<1 and c≥0, the minimax squared operator risk of Minimax squared operator risk over Pq(τ,c) of Weak-lq covariance class with directional sub-Gaussian tails satisfies Rn(Pq(τ,c))≥bτ2min⁡{1,log⁡(p)/n}, for an absolute constant b>0. In particular, the lower bound applies when c=0 and when an effective sparse-row count rounds to zero.

Facts & Assumptions

Given: The class, dimensions and tail constant in the statement; all constructed laws are centered independent-coordinate Gaussian laws.

[F1]

A centered multivariate normal vector is a linear image of a standard normal vector. Multivariate normal law, including singular covariance.

[F2]

Diagonal covariance matrices satisfy every stated off-diagonal weak-sparsity radius, including zero. Weak-lq covariance class with directional sub-Gaussian tails.

[F3]

For N separated targets and reference-law average KL at most K, Fano bounds squared metric minimax risk below by Δ2(1−(K+log⁡2)/log⁡N)/4. Fano’s packing bound with a reference-distribution KL bound.

[F6]

Every measurable statistic induces the point-mass probability kernel KT(x,B)=1B(T(x)). A statistic induces a deterministic probability kernel.

[F7]

The positive-definite Gaussian covariance KL formula and finite independent-product KL additivity hold under the stated AC assumption. Kullback–Leibler divergence between nondegenerate centered Gaussian laws, Additivity of KL divergence for finite product laws.

Proof

1.1givenF1F2algebra

Put s=τ/4 and δ=12min⁡{1,log⁡(p+1)/n}. Use p+1 Gaussian laws P0=N(0,sIp) and Pj=N(0,s(Ip+δejejT)), 1≤j≤p. Each covariance has operator norm at most 3τ/8<τ. If Z is standard normal, P(∣Z∣>t)=e−t2/22/π∫0∞e−w2/2−twdw≤e−t2/2. Hence every unit-direction projection of these laws obeys the required tail with parameter τ. Their covariance matrices are diagonal, so [F2] puts every law in every class in the statement.

2.1givenF1F7step 1.1algebra

For j≥1, the Gaussian covariance KL formula with Σj=s(Ip+δejejT) and Σ0=sIp gives D(Pj∥P0)=12(δ−log⁡(1+δ))≤δ2/4, where δ−log⁡(1+δ)=∫0δt/(1+t) dt≤δ2/2. By finite-product KL additivity, D(Pj⊗n∥P0⊗n)=nD(Pj∥P0)≤nδ2/4≤log⁡(p+1)/16. The j=0 divergence is zero, so the reference-law average KL has the same bound.

2.2givenF4F5F6algebrastep 1.1

Use the full matrix action space T=Rp×p and set ρ(A,B)=∥A−B∥op. For a unit vector v, rowwise Cauchy–Schwarz [F5] gives ∥Av∥22≤∑i,jaij2=∥A∥F2, so [F4] gives ∥A∥op≤∥A∥F. Conversely each coordinate unit vector ej has norm one, so ∥A∥F2=∑j∥Aej∥22≤p∥A∥op2. Thus ∥A∥op≤∥A∥F≤p∥A∥op. The maximum definition also gives homogeneity, symmetry under A↦−A, and ∥A+B∥op≤∥A∥op+∥B∥op by the Euclidean triangle inequality on each unit vector. If ∥A∥op=0, all columns Aej vanish, so A=0. Hence ρ is a finite metric by [F5]. The two norm inequalities imply each ball for either metric contains a ball for the other about the same center, so their open sets and therefore their Borel sigma-algebras coincide. Under the entry-list identification Rp×p=Rp2 this is exactly the Euclidean Borel action space in the minimax-risk definition. In particular the diagonal embedding a↦diag⁡(a) is continuous: its Frobenius difference norm is ∥a−b∥2, and its operator difference norm is at most that. All targets in step 1.1 are thus legitimate Borel metric-space points, and every estimator in the minimax definition is measurable into this metric Borel space and induces an admissible deterministic kernel by [F6]. No new choice axiom is used.

3.1F4step 1.1step 2.2algebra

For a diagonal matrix D=diag⁡(a) and a unit vector v, ∥Dv∥22=∑jaj2vj2≤max⁡j∣aj∣2; equality holds at a coordinate unit vector attaining the finite maximum. Hence ∥D∥op=max⁡j∣aj∣. A target difference from the base has one diagonal entry sδ; a difference between two nonbase targets has two entries sδ,−sδ. Every distinct pair therefore has metric separation exactly sδ.

4.1givenF2F3F6step 1.1step 2.1step 2.2step 3.1algebra∎

Apply [F3] to these p+1 targets, with the base sample law as reference. Its bracket is at least 1−1/16−log⁡2/log⁡3>1/4. Thus the risk is at least s2δ2/16≥(τ2/1024)min⁡{1,log⁡p/n}. These finite experiments are subsets of the full class, so the full minimax risk is no smaller.

Depends on

Used by

Dependency tree · two levels

100 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources