Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passjudge 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.

Leverage scores are basis-independent and sum to the dimension

Statement

Let U⊆Kn have dimension d≥1, where K∈{R,C}. For any orthonormal basis matrix Q∈Kn×d, let ℓi=∥ei∗Q∥22. Then these values are independent of the chosen orthonormal basis, satisfy 0≤ℓi≤1 and ∑i=0n−1ℓi=d, and ℓi=0 exactly when the i-th row of Q is zero.

Facts & Assumptions

Given: A finite-dimensional subspace U⊆Kn of positive dimension and an orthonormal basis matrix Q.

[F1]

The leverage score is ℓi(U)=∥ei∗Q∥22 for an orthonormal basis matrix Q (Row leverage scores of a finite-dimensional subspace).

[F2]

The columns of Q are orthonormal, so Q∗Q=Id (Row leverage scores of a finite-dimensional subspace).

Proof

Given: The hypotheses in the Statement.

1.1F1F2algebra

Let Q′ be another orthonormal basis matrix of U, and set W=Q∗Q′. Since each column of Q′ lies in U=Ran⁡(Q), the orthogonal projection QQ∗ fixes it, so Q′=QQ∗Q′=QW. Thus W∗W=Q′∗QQ∗Q′=Q′∗Q′=Id. The square matrix W is unitary, and right multiplication by W preserves the Euclidean norm of every row; hence ∥ei∗Q′∥22=∥ei∗Q∥22 for every i.

1.2F1F2algebra

Writing qj for column j of Q, finite-sum reordering gives ∑i=0n−1ℓi=∑i∑j=0d−1∣Qij∣2=∑j∥qj∥22=d, because every column is a unit vector.

2.1F1F2algebra∎

Put P=QQ∗. Then P=P∗ and P2=P by [F2], so ei=Pei+(I−P)ei is an orthogonal decomposition. Also ℓi=∥Q∗ei∥22=∥QQ∗ei∥22=∥Pei∥22, using Q∗Q=Id. Therefore 0≤ℓi≤∥ei∥22=1, and ℓi=0 exactly when Q∗ei=0, which is exactly when row i of Q is zero.

Depends on

Used by

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