Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-generatedPipeline-generatedjudge pass (gpt-6-luna)
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.

A deterministic threshold-band bound for two Gram sketches

Statement

Let A∈Rm×n be nonzero, F=∥A∥F, 0<σ≤F, K=F2/σ2, and 0<η≤1. Suppose S∈Rq×n and W∈Rq×q satisfy ∥W∥F=F and ∥ATA−STS∥F≤tF2,∥SST−WWT∥F≤tF2,0<tK≤12. Let U be the orthonormal left singular vectors of W with singular values strictly greater than σ, and let Σ contain those singular values. Write k for their number, V=STUΣ−1, and M=VVT, using empty matrices when k=0. Then k<K, the eigenvalues of VTV lie in [1−tK,1+tK], and some threshold-band target of Threshold-band singular-value approximation obeys ∥AM−Aσ,η∥F≤F(tK+77tK/η).

Facts & Assumptions

Given: The matrices and bounds in the Statement. Matrices are real and all projections below are orthogonal.

[F2]

Cauchy-Schwarz ∣⟨x,y⟩∣≤∥x∥2∥y∥2 with its equality case, the triangle inequality for ∥⋅∥2, the parallelogram law and polarisation applies to matrix entries, giving ∣tr⁡(XTY)∣≤∥X∥F∥Y∥F and ∥X∥op≤∥X∥F.

[F3]

A Threshold-band singular-value approximation is A(P1+Q), where P1 projects onto singular values at least σ(1+η) and Q is any projection supported in the band [σ(1−η),σ(1+η)).

Proof

1.1givenF1F2algebracases

Set H=ATA, G=STS, B=SST, C=WWT, and a=σ2. Since tr⁡C=F2 and each retained eigenvalue exceeds a, ka<F2, so k<K. For k>0, T=UTBU≥Σ2−tF2I≥(a−tF2)I>0. Therefore P=STUT−1UTS is the projection onto the range of V. Also VTV−I=Σ−1UT(B−C)UΣ−1 has Frobenius norm at most tK. By the SVD, the nonzero eigenvalues of M−P are those of VTV−I, giving ∥M−P∥F≤tK. For k=0, use P=M=0 and the same bounds with empty matrices.

1.2givenF1F2algebra

We record the spectral comparisons explicitly. For a symmetric J with decreasing eigenvalues, λj(J)=max⁡dim⁡E=jmin⁡x∈E,∥x∥=1xTJx: the span of its first j eigenvectors attains the value, and every j-dimensional E intersects the span of the eigenvectors numbered j onward. Thus ∣λj(J)−λj(J′)∣≤∥J−J′∥op. Moreover ∑j≤kλj(J)=max⁡rank⁡R=ktr⁡(RJ) over projections R: in an eigenbasis the diagonal entries of R are in [0,1] and sum to k, so moving their weight to the first k indices maximizes the sum. By [F2] the top-k sums for J,J′ differ by at most k∥J−J′∥F. Pad matrices by zero blocks when dimensions differ. Applying these comparisons to H,G and B,C, and using [F1] between G,B, gives ∣λj(H)−λj(C)∣≤2tF2 and a top-k sum difference at most 2ktF2.

2.1step 1.1step 1.2F1F2algebracases

If k>0, UTB2U−T2=UTB(I−UUT)BU is positive semidefinite. Hence tr⁡(PG)=tr⁡[(UTB2U)T−1]≥tr⁡T≥∑j≤kλj(C)−ktF2. Also tr⁡(PH)≥tr⁡(PG)−ktF2. Combining these inequalities with the top-k comparisons in step 1.2 gives Δ:=∑j≤kλj(H)−tr⁡(PH)≤4ktF2. The variational formula gives Δ≥0. If k=0, Δ=0.

3.1step 1.1step 1.2step 2.1algebra

Let r count eigenvalues of H strictly greater than a. Between indices k and r, every crossing eigenvalue lies within 2tF2 of a, by step 1.2 and the strict threshold rule for C. There are at most K crossing indices: if r>k, then r<K since each of its first r eigenvalues exceeds a and tr⁡H=F2; if k>r, then k<K. Thus the difference between the sums of the largest k values of λj(H)−a and all positive values of λj(H)−a is at most 2KtF2 . Put pj=⟨ej,Pej⟩ in an eigenbasis of H. Since ∑jpj=k, the nonnegative threshold deficit is Δa=∑λj>a(λj−a)(1−pj)+∑λj≤a(a−λj)pj≤Δ+2KtF2≤6KtF2. For k=0 the same crossing argument applies, and zero eigenvalues can be padded without changing the sums.

4.1step 3.1algebra

Let P1,P2,P3 project onto eigenvalues respectively in [a(1+η)2,∞), [a(1−η)2,a(1+η)2), and [0,a(1−η)2). Write E for the part of Δa on the first and third sets, and L=tr⁡[P1(I−P)]+tr⁡(P3P). Both outside gaps from a are at least ηa, so L≤E/(ηa) and E≤6KtF2≤7KtF2. This uses no strict separation of eigenvalues within the band.

5.1F1step 4.1algebraconstruct

On the band space, R=P2PP2 is a positive contraction. Let Q be its spectral projection onto eigenvalues at least 1/2. In an eigenbasis of R, ∥P2P−Q∥F2=∑smin⁡(s,1−s)≤2∑ss(1−s)=2∥P2P(I−P2)∥F2≤2L. For the last inequality, the high cross block satisfies ∥P2PP1∥F=∥P2(I−P)P1∥F≤∥(I−P)P1∥F and the low block satisfies ∥P2PP3∥F≤∥PP3∥F. These squares sum to at most L.

6.1F2F3step 1.1step 4.1step 5.1algebra∎

Evaluate ∥A(P−P1−Q)∥F2 by summing its rows in an eigenbasis of H. Its high contribution is ∑P1λj(1−pj)≤2E/η, because λ/(λ−a)≤2/η there. Its low contribution is at most aL, and its band contribution is at most a(1+η)2∥P2P−Q∥F2≤8aL. Thus the sum is at most 11E/η≤77tKF2/η. By [F3], A(P1+Q) is a permitted target. Finally ∥A(M−P)∥F≤∥A∥op∥M−P∥F≤FtK; the triangle inequality gives the result. The same block formulas cover empty high, band or low spaces, k=0, repeated eigenvalues, η=1, and both endpoint conventions.

Depends on

Used by

Dependency tree · two levels

26 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