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.
Leverage scores are basis-independent and sum to the dimension
Statement
Let have dimension , where . For any orthonormal basis matrix , let . Then these values are independent of the chosen orthonormal basis, satisfy and , and exactly when the -th row of is zero.
Facts & Assumptions
Given: A finite-dimensional subspace of positive dimension and an orthonormal basis matrix .
The leverage score is for an orthonormal basis matrix (Row leverage scores of a finite-dimensional subspace).
The columns of are orthonormal, so (Row leverage scores of a finite-dimensional subspace).
Proof
Given: The hypotheses in the Statement.
Let be another orthonormal basis matrix of , and set . Since each column of lies in , the orthogonal projection fixes it, so . Thus . The square matrix is unitary, and right multiplication by preserves the Euclidean norm of every row; hence for every .
Writing for column of , finite-sum reordering gives , because every column is a unit vector.
Put . Then and by [F2], so is an orthogonal decomposition. Also , using . Therefore , and exactly when , which is exactly when row of is zero.
Depends on
Used by
- With-replacement leverage-score row sampling and rescaling Algorithm
- Zero leverage rows and a maximally coherent one-dimensional design Example
- Leverage-score row sampling embeds the column space Theorem
Cited to discharge well-definedness by Row leverage scores of a finite-dimensional subspace.
Dependency tree · two levels
2 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
- David P. Woodruff, Sketching as a Tool for Numerical Linear Algebra, §2.4 (standard reference, not scraped)
- Michael W. Mahoney, Randomized Algorithms for Matrices and Data, §4.1 (standard reference, not scraped)