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 be nonzero, , , , and . Suppose and satisfy and Let be the orthonormal left singular vectors of with singular values strictly greater than , and let contain those singular values. Write for their number, , and , using empty matrices when . Then , the eigenvalues of lie in , and some threshold-band target of Threshold-band singular-value approximation obeys
Facts & Assumptions
Given: The matrices and bounds in the Statement. Matrices are real and all projections below are orthogonal.
The Every linear map between finite-dimensional real or complex inner product spaces admits a singular value decomposition identifies the nonzero eigenvalues of and . The Real spectral theorem: a self-adjoint endomorphism of a finite-dimensional real inner product space has an orthonormal eigenbasis diagonalizes every real symmetric matrix used below.
Cauchy-Schwarz with its equality case, the triangle inequality for , the parallelogram law and polarisation applies to matrix entries, giving and .
A Threshold-band singular-value approximation is , where projects onto singular values at least and is any projection supported in the band .
Proof
Set , , , , and . Since and each retained eigenvalue exceeds , , so . For , . Therefore is the projection onto the range of . Also has Frobenius norm at most . By the SVD, the nonzero eigenvalues of are those of , giving . For , use and the same bounds with empty matrices.
We record the spectral comparisons explicitly. For a symmetric with decreasing eigenvalues, : the span of its first eigenvectors attains the value, and every -dimensional intersects the span of the eigenvectors numbered onward. Thus . Moreover over projections : in an eigenbasis the diagonal entries of are in and sum to , so moving their weight to the first indices maximizes the sum. By [F2] the top- sums for differ by at most . Pad matrices by zero blocks when dimensions differ. Applying these comparisons to and , and using [F1] between , gives and a top- sum difference at most .
If , is positive semidefinite. Hence . Also . Combining these inequalities with the top- comparisons in step 1.2 gives . The variational formula gives . If , .
Let count eigenvalues of strictly greater than . Between indices and , every crossing eigenvalue lies within of , by step 1.2 and the strict threshold rule for . There are at most crossing indices: if , then since each of its first eigenvalues exceeds and ; if , then . Thus the difference between the sums of the largest values of and all positive values of is at most . Put in an eigenbasis of . Since , the nonnegative threshold deficit is For the same crossing argument applies, and zero eigenvalues can be padded without changing the sums.
Let project onto eigenvalues respectively in , , and . Write for the part of on the first and third sets, and . Both outside gaps from are at least , so and . This uses no strict separation of eigenvalues within the band.
On the band space, is a positive contraction. Let be its spectral projection onto eigenvalues at least . In an eigenbasis of , . For the last inequality, the high cross block satisfies and the low block satisfies . These squares sum to at most .
Evaluate by summing its rows in an eigenbasis of . Its high contribution is , because there. Its low contribution is at most , and its band contribution is at most . Thus the sum is at most . By [F3], is a permitted target. Finally ; the triangle inequality gives the result. The same block formulas cover empty high, band or low spaces, , repeated eigenvalues, , and both endpoint conventions.
Depends on
- Threshold-band singular-value approximation
- Every linear map between finite-dimensional real or complex inner product spaces admits a singular value decomposition
- Real spectral theorem: a self-adjoint endomorphism of a finite-dimensional real inner product space has an orthonormal eigenbasis
- Cauchy-Schwarz $\lvert\langle x,y\rangle\rvert \le \lVert x\rVert_2\lVert y\rVert_2$ with its equality case, the triangle inequality for $\lVert\cdot\rVert_2$, the parallelogram law and polarisation
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
- Ewin Tang, A quantum-inspired classical algorithm for recommendation systems, version 3 (standard reference, not scraped)