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.
Zero leverage rows and a maximally coherent one-dimensional design
Example
Take . Compute its leverage scores and compare one exact leverage-proportional sample with one uniform row sample. Define the coherence here by .
Facts & Assumptions
Given: The one-column orthonormal matrix , the sampling procedure, and one sample with replacement.
Leverage scores are row squared norms of an orthonormal basis and sum to the subspace dimension (Row leverage scores of a finite-dimensional subspace, Leverage scores are basis-independent and sum to the dimension).
Sampling probability is allowed when ; a selected row is rescaled by , with replacement (With-replacement leverage-score row sampling and rescaling).
Embedding on a subspace means squared norms lie in times their original values (Oblivious squared-norm subspace embeddings).
Verification
The row norms of give , agreeing with the sum in [F1]. Thus the last two rows have zero leverage and , the largest possible value since each leverage score is at most one.
With exact probabilities and one sample, [F2] selects row zero with probability one and returns . Then , so the only unit vectors in retain squared norm exactly one. The zero-leverage rows are never sampled.
Uniform probabilities satisfy the lower bound in [F2] with . With one sample, if row zero is drawn, and if row one or two is drawn. For , [F3] requires squared norm in , which contains neither outcome; hence this one-row uniform sample fails with probability one, while the exact leverage sample in step 2.1 succeeds with probability one.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
5 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)