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.
Sketched least squares and subspace embeddings
1 · Prerequisites
- Absolute and Conditional Convergence; Rearrangement; Products
- Algebraic Closure, Embeddings, and Separability
- Algebraic Extensions, Extension Degree, and Finite Fields
- Analyticity of Holomorphic Functions; Liouville and Morera
- Arc Length and Rectifiable Curves
- Areas of Elementary Plane Figures
- Binary Operations, Monoids, Groups and Subgroups
- Bounded Variation and the Riemann–Stieltjes Integral
- Compactness
- Compactness in Metric Spaces
- Completeness, Completion, and Uniform Continuity
- Complex Coordinate and Path Transport
- Complex Differentiability and the Cauchy–Riemann Equations
- Complex Power Series and Analytic Functions
- Composition Series, the Jordan–Hölder Theorem and Solvable Groups
- Computed singular values and rank revealing factorizations
- Concentration
- Congruences, the Integers Modulo n and the Chinese Remainder Theorem
- Connectedness
- Construction of the Natural Numbers
- Construction of the Real Numbers via Cauchy Sequences
- Construction of the Real Numbers via Dedekind Cuts
- Continuity, IVT, EVT, and Uniform Continuity
- Contour Integration
- Cosets, Index and Lagrange's Theorem
- Countability and Uncountability
- Countability Axioms and Cardinal Functions
- Cyclic Groups and Direct Products
- Determinants of Matrices over a Commutative Ring
- Diagonalisation and the Minimal Polynomial
- Direct Matrix Factorisations: LU, Cholesky and QR
- Divisibility, Euclidean Domains, Principal Ideal Domains and Unique Factorisation
- Divisibility, Greatest Common Divisors and Bézout's Identity
- Dual Spaces, Bilinear and Quadratic Forms, and Sylvester's Law of Inertia
- Eigenvalues, Eigenvectors and the Characteristic Polynomial
- Filters and Ultrafilters
- Finite Counting, Factorials and Binomial Coefficients
- Finite Probability and the Probabilistic Method
- Finite Probability Spaces and Random Variables
- Finite-precision direct factorizations and least squares
- Foundations of the Real Numbers for Analysis
- Fubini and Change of Variables
- Fundamental Trigonometric Identities
- Gaussian Elimination, Elementary Matrices and Reduced Row Echelon Form
- Goursat's Theorem and Cauchy's Theorem in a Convex Domain
- Group Actions, Orbits, Stabilisers and Cayley's Theorem
- Group Homomorphisms and the Isomorphism Theorems
- Ideals, Quotient Rings and the Isomorphism Theorems for Rings
- Identifiability and approximation bias in computational inference
- Improper and Parameter-Dependent Multiple Integrals
- Improper Integrals
- Independence Borel Cantelli and Zero One Laws
- Inner Product Spaces, Gram-Schmidt, Projections and Adjoints
- Lebesgue Measure on Euclidean Space
- Limits of Real Functions
- limsup, liminf, and Subsequential Limits
- Line Integrals and the Gradient Theorem
- Linear Independence, Bases and Dimension
- Linear Transformations, Rank-Nullity and Quotient Spaces
- Matrices, the Matrix of a Linear Map, and Change of Basis
- Matrix Norms, Condition Numbers and Numerical Stability
- Measurable Functions and Simple Approximation
- Measures and Their Basic Properties
- Metric Spaces
- Mixed Partials, Taylor Formulae, and Extrema
- Monotone Functions, Discontinuities, and Continuity Sets
- Monotone Sequences, Bolzano-Weierstrass, and Cauchy Completeness
- Normal Subgroups and Quotient Groups
- Order, Zorn's Lemma, and the Axiom of Choice
- Outer Measure and the Caratheodory Extension Theorem
- Partitions of Unity and Paracompactness
- Polynomial Rings, the Division Algorithm and Roots
- Power Series and Real-Analytic Functions
- Primes, Euclid's Lemma and the Fundamental Theorem of Arithmetic
- Probability Spaces Random Variables and Expectation
- Product Measures and the Fubini Tonelli Theorems
- Properties of the Integral and the Working FTC
- Randomized low-rank approximation
- Relations, Functions, and Quotients
- Rings, Subrings, Integral Domains and Fields
- Rⁿ as a Normed Space; Vector-Valued Functions
- Robust Covariance and Sparse Robust Estimation
- Roots, Rational Powers, and Classical Inequalities
- Separation Axioms: the Hierarchy
- Sequences and Limits
- Sequences and Series of Functions; Uniform Convergence
- Series: Convergence and the Nonnegative Tests
- Sigma Algebras and Borel Sets
- Simple Field Extensions and the Construction of the Complex Numbers
- Sine, Cosine, and the Definition of Pi
- Splitting Fields
- Subspaces, Products, and Quotients
- Suprema and Infima
- Sylow's Theorems, p-Groups and Nilpotent Groups
- Symmetric Groups, Cycle Decomposition and the Sign Homomorphism
- The Cantor Set, Baire Category, and Measure Zero in ℝ
- The Complex Exponential and Euler's Formula
- The Derivative and the Mean Value Theorems
- The Determinant of a Linear Operator, Cofactors and Cramer's Rule
- The Exponential Function
- The Fundamental Theorem of Algebra
- The Fundamental Theorem of Finite Abelian Groups
- The Fundamental Theorems of Calculus
- The Galois Correspondence
- The Identity Theorem, the Maximum Principle and the Open Mapping Theorem
- The Inverse and Implicit Function Theorems
- The Lebesgue Integral and the Convergence Theorems
- The Logarithm and General Powers
- The Moore--Penrose Pseudoinverse and Regularised Least Squares
- The Riemann Integral in Rᵐ and Jordan Content
- The Riemann Integral: Definition and Integrability
- The Spectral Theorem, Positive Operators and Singular Value Decomposition
- The Topology of Euclidean Space
- The Total Derivative in ℝᵐ → ℝⁿ
- The ZFC Axioms and the Basic Set Constructions
- Topological Spaces and Continuity
- Topology of ℝ
- Triangularisation, Generalised Eigenspaces and Jordan Canonical Form
- Vector Spaces, Linear Subspaces, Span and Direct Sums
- Volumes of Elementary Solids and Solids of Revolution
2 · Summary
This page develops squared-norm subspace embeddings for a fixed subspace, an iid Gaussian construction with an additive dimension and failure-probability bound, and with-replacement leverage-score row sampling with explicit zero-leverage handling. It defines an exact rank-aware sketch-and-solve procedure and proves its residual guarantee only when the sketch embeds . Embedding alone does not suffice. The page also defines the QR right preconditioner and proves its singular-value bounds under an embedding of . All solve guarantees are exact-arithmetic claims; finite-precision residuals, rank status and solver error certificates remain distinct outputs. Sparse CountSketch and SRHT variants are not specified here.
3 · Logical flowchart
4 · Definitions, theorems and proofs
Rank-aware sketch-and-solve least squares
Definition
Input , , a supplied sketch , and a finite nonnegative integer SVD sweep budget , where . Form and , and call Rank-thresholded least squares by the singular value decomposition on with threshold and budget .
If the call returns exact-arithmetic convergence with an exact SVD record,
return success, the exact rank , the canonical
minimum-norm vector , and the separately computed sketched
and physical residuals and
. The exact-arithmetic solve-error certificate is
zero. If the SVD call returns inconclusive, return its status and supplied
partial diagnostics without claiming a minimizer. In finite precision, return
the computed candidate and the two residual reports separately; mark the rank
unverified unless a certified interval separates every singular-value
comparison from zero, and report a solve-error certificate only when the
solver supplies one. No finite-precision accuracy guarantee is part of this
procedure.
Oblivious squared-norm subspace embeddings
Definition
Let , let , and use on . For a fixed subspace and , a matrix is an -subspace embedding for when
For an integer with and , a distribution on matrices is an oblivious subspace embedding for dimension if, for every fixed -dimensional subspace chosen independently of the draw,
The subspace is fixed before sampling, but the guarantee is stated separately for each such ; it does not assert that one draw preserves all -dimensional subspaces simultaneously. For a matrix , an embedding of means the property on its column space. For least-squares residuals , the relevant subspace is .
Right preconditioner from the reduced QR factor of a sketch
Definition
Let , , and suppose a reduced QR factorization of is supplied:
where is upper triangular and nonsingular. The sketch-QR right preconditioner is
It is undefined when no such reduced factorization with nonsingular is available. The matrix being preconditioned is the original , through ; is used to construct .
Row leverage scores of a finite-dimensional subspace
Definition
Let , and let have dimension . Choose a matrix whose columns are an orthonormal basis of , so . For , define the -th row leverage score of by
where is the -th standard coordinate vector. The following item proves that this value is independent of the chosen orthonormal basis, so the definition is well-defined.
Remarks
Such an orthonormal basis exists for every here by Every finite-dimensional real or complex inner product space has an orthonormal basis.
A sphere net controls a real or complex Hermitian operator norm
Statement
Let , , and let be Hermitian. Regard as for distances. A -net of the unit sphere exists with over , and over . For every such net,
Facts & Assumptions
Given: A Hermitian matrix over , with , and the Euclidean operator norm.
A complex Hermitian matrix has an orthonormal eigenbasis (Complex spectral theorem: a normal endomorphism of a finite-dimensional complex inner product space has an orthonormal eigenbasis, and conversely), and the operator norm is the maximum of over unit vectors (The operator norm is zero on the zero domain and otherwise is max_{||v||=1} ||Tv||).
The unit sphere in has a -net of size at most (Finite epsilon nets of the Euclidean sphere).
The inner product satisfies over both fields (Cauchy–Schwarz: , with equality exactly for linearly dependent vectors).
Proof
Given: The hypotheses in the Statement.
Regard as a complex Hermitian matrix when . By [F1], it has an orthonormal eigenbasis over ; every eigenvalue is real because and give . Choose a unit eigenvector for an eigenvalue of largest absolute value. The diagonalization shows over . If , set . If , write ; since and are real, and , and at least one of is nonzero. Normalize a nonzero part as . The same diagonalization bounds the real operator norm by , while attains that bound, so over either field.
Apply [F2] in real dimension when , and when , to obtain the stated net-size bound and a with .
Since and are unit vectors, , using [F3] and the definition of operator norm. Therefore , proving the claimed bound.
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.
A converged exact sketch-and-solve run returns a sketch minimizer
Statement
Let and be the sketch matrix and response in
Rank-aware sketch-and-solve least squares. In exact arithmetic, if its zero-
threshold SVD call converges and supplies an exact SVD record, the returned
is the unique minimum-Euclidean-norm minimizer of
, and the reported rank is .
No conclusion is asserted on an inconclusive or finite-precision
unverified branch.
Facts & Assumptions
Given: Finite matrices , a vector , and an exact-arithmetic converged execution of the SVD call in the algorithm.
The algorithm forms , and calls the SVD least-squares procedure at strict threshold ; only exact convergence with an exact SVD record is the branch under consideration (Rank-aware sketch-and-solve least squares).
On exact convergence, the SVD threshold solver returns the unique minimum-norm least-squares vector for its truncated model; when every discarded singular value is zero, that is also the solution for the original matrix (The SVD threshold solver gives the unique minimum-norm fit to its truncated model).
Proof
Given: The hypotheses in the Statement.
Set and . By [F1], the converged call uses threshold zero and returns , where retains exactly the singular values of that are strictly positive.
In an exact SVD , zero singular values contribute zero terms and every positive singular value is retained at threshold zero. Thus , including the rank-zero case.
Apply [F2] to the truncated matrix . It says that is its unique minimum-norm least-squares solution. By step 2.1, , so is the unique minimum-norm minimizer of ; the zero-threshold rank count is precisely the number of positive singular values of , hence .
An embedded QR right preconditioner has controlled singular values
Statement
Let with , let have full column rank, and let , and suppose the particular matrix is an -subspace embedding for . A reduced QR factorization exists and has nonsingular , so the preconditioner of Right preconditioner from the reduced QR factor of a sketch is defined. Its right-preconditioned matrix satisfies
Facts & Assumptions
Given: Full-column-rank , an -embedding on , and .
On the embedded subspace, for every (Oblivious squared-norm subspace embeddings).
A reduced QR factorization has , , and upper-triangular ; Householder or Givens steps construct one for every finite (Full, reduced, and column-pivoted computational QR factorisations, Successive Householder or Givens transformations produce full and reduced QR factorisations with the standard dense operation counts).
Singular values give the minimum and maximum expansion of a finite matrix on unit vectors, and condition number here is defined as their positive ratio (Every linear map between finite-dimensional real or complex inner product spaces admits a singular value decomposition, Spectral and Frobenius norms are unitarily invariant, are given by singular values, and satisfy the sharp rank comparison).
Proof
Given: The hypotheses in the Statement.
If is nonzero, full column rank gives ; then [F1] gives . Thus has full column rank. The reduced QR factorization in [F2] exists. If , then ; injectivity of forces , so is nonsingular and is defined.
For any , , so by [F2]. Since , [F1] yields .
For every unit , step 2.1 implies . By [F3], the minimum and maximum of these values over the unit sphere are and , respectively. This proves both singular-value bounds.
The lower bound in step 3.1 is positive, so the ratio defining is valid. Dividing the upper singular-value bound by the lower one gives .
Squared-norm concentration for real and normalized complex Gaussians
Statement
Assume Countable Choice for the finite-dimensional Gaussian probability law. Let , and let be independent standard real Gaussian scalars or independent normalized complex Gaussian scalars, with . For ,
Facts & Assumptions
Given: Countable Choice for the finite Gaussian law, and a finite family of independent standard Gaussian scalars in one of the two declared fields and a parameter .
A standard real Gaussian scalar has density ; a normalized complex one has density and mean squared modulus one (Standard real and normalized complex Gaussian matrix laws). The real and complex densities each have total mass one, zero mean and second moment one under exactly the stated Countable Choice; finite products have unit mass and independent coordinates by Normalization and second moments of the Gaussian matrix laws.
Countable Choice, written , is used in the repository's construction of the finite-dimensional Lebesgue probability measures for these densities (The Axiom of Countable Choice ()).
Under Countable Choice, invertible real linear maps scale Lebesgue measure by the absolute determinant (A linear map of sends Lebesgue measurable sets to Lebesgue measurable sets, with when is invertible and Lebesgue null when it is not). The corresponding nonnegative-integral identity follows first for indicators, then simple functions and their defining suprema.
For a nonnegative measurable random variable and , (Markov's inequality for random variables).
The probability of a finite union of events is at most the sum of their probabilities (The finite union bound).
We use only Countable Choice for those finite Gaussian integrals; no unrestricted Axiom of Choice is assumed.
Proof
Given: The hypotheses in the Statement.
For real and , put . By [F3], the substitution gives . The prefactored integral is one since [F1] is a probability density. For normalized complex and , put . On , the map has real determinant , so [F3] gives . Again the prefactored integral is one by the normalized density [F1]. These identities include the finite integrability ranges needed below.
For the real case, [F4] applied to at the positive threshold , with , and independence together with the first formula of step 1.1 give . For the complex case use , the same threshold, , and the second formula to obtain the stronger bound . Both positive parameters lie in the finite mgf ranges of step 1.1. By [F5], , so both upper tails are at most .
For the real lower tail, apply [F4] to at threshold with ; for the complex lower tail use , the same threshold, and . The event is precisely the lower-tail event because the exponential is decreasing in the squared norm sum. The mgf arguments lie in the finite ranges of step 1.1, and independence again factors the expectations. Step 1.1 gives respective bounds and . By [F5], , so each is at most .
The event in the Statement is the union of the upper and lower tail events bounded in steps 2.1 and 2.2. The finite union bound [F6] therefore gives the claimed sum bound.
With-replacement leverage-score row sampling and rescaling
Definition
Input an orthonormal basis matrix with
, a sample count , a parameter , and a
probability vector satisfying
, where and
is from Row leverage scores of a finite-dimensional subspace. If the input checks
fail, return invalid-input. Otherwise draw indices
independently with replacement from . Form
by setting row to , and return success,
the selected indices, and .
Because , implies ; such a row is never sampled, so the scaling never divides by zero. One canonical choice is , which sets every zero-leverage row's probability to zero. Other admissible distributions may assign positive probability to a zero-leverage row, but that choice wastes samples. Repeated indices are allowed and are distinct rows of .
Embedding span(A,b) gives the sketch-and-solve residual factor
Statement
Let , , and . Suppose the particular sketch used in Rank-aware sketch-and-solve least squares is an -subspace embedding for . If that algorithm returns an exact-arithmetic converged vector , then
Embedding alone is not a hypothesis for this conclusion.
Facts & Assumptions
Given: Finite , , an -embedding of , and an exact converged output .
Every vector in has its squared norm multiplied by a factor in by (Oblivious squared-norm subspace embeddings).
On the stated converged branch, minimizes over all (A converged exact sketch-and-solve run returns a sketch minimizer).
A least-squares minimizer exists for a linear map between finite-dimensional inner-product spaces (For a linear map between finite-dimensional inner-product spaces, minimises if and only if , equivalently ; minimisers exist and any two differ by an element of ).
Proof
Given: The hypotheses in the Statement.
By [F3], choose an original least-squares minimizer , and write , .
For every , both and belong to , so their difference belongs to . In particular [F1] applies to and .
By [F2], minimizes the sketched residual, so ; squaring preserves order because both residual norms are nonnegative.
The lower inequality in [F1] gives .
The upper inequality in [F1] gives .
Combining steps 3.1, 2.2 and 3.2 and dividing by proves the claimed estimate, since is an original minimizer by step 1.1.
Gaussian sketches embed a fixed subspace at the additive dimension rate
Statement
Assume Countable Choice for the finite-dimensional Gaussian probability law. Let , , and let be a fixed -dimensional subspace. Let have iid standard real Gaussian entries when , or iid normalized complex Gaussian entries with when . Put . For , if
then with probability at least , is an -subspace embedding for . Thus this Gaussian distribution is an oblivious subspace embedding for dimension .
Facts & Assumptions
Given: Countable Choice for the finite Gaussian law, and a fixed subspace of dimension , the stated Gaussian law, , , and the displayed sample-size condition.
An -subspace embedding preserves every squared norm on the fixed subspace within factors ; an oblivious embedding has this probability for each fixed subspace (Oblivious squared-norm subspace embeddings).
The real standard and normalized complex Gaussian entries have the densities and independent product law stated in Standard real and normalized complex Gaussian matrix laws. Their unit scalar masses, normalized second moments and all finite-product normalizations and independence are proved under Countable Choice in Normalization and second moments of the Gaussian matrix laws.
Right orthogonal or unitary multiplication preserves the iid Gaussian matrix law, including independence of the resulting entries (Orthogonal and unitary invariance of Gaussian matrix blocks).
A finite-dimensional real or complex inner-product space has an orthonormal basis (Every finite-dimensional real or complex inner product space has an orthonormal basis).
For independent standard real or normalized complex Gaussian scalars, the squared-norm deviation probability is at most for (Squared-norm concentration for real and normalized complex Gaussians).
A complex unit sphere is a real sphere of twice the dimension, and its -net can be chosen with at most points; the Hermitian quadratic net controls the operator norm by factor two (A sphere net controls a real or complex Hermitian operator norm).
The operator norm of is (The operator norm is zero on the zero domain and otherwise is max_{||v||=1} ||Tv||).
The inner product obeys Cauchy--Schwarz over and (Cauchy–Schwarz: , with equality exactly for linearly dependent vectors).
The probability of a finite union of measurable events is at most the sum of their probabilities (The finite union bound).
Countable Choice supplies the finite-dimensional Lebesgue probability laws used in [F2] (The Axiom of Countable Choice ()).
Proof
Given: The hypotheses in the Statement.
Choose an orthonormal basis matrix for , and let be a -net of its unit sphere with , which covers the real case too. For each fixed , is a unit vector. Extend to an orthonormal basis of by applying [F4] to its orthogonal complement; [F3] then shows that has independent standard Gaussian coordinates.
For each fixed , apply [F5] with to obtain . The finite union bound [F9] for the fixed finite net gives . Here the sample-size hypothesis gives , and for .
On the complementary event, put . This is Hermitian and for every . By [F6], . For nonzero , [F7] and [F8] give ; the zero vector satisfies the same inequality. Therefore . Since is an isometry onto , [F1] identifies this as the required embedding inequality for every .
Leverage-score row sampling embeds the column space
Statement
Let , , have orthonormal columns, and let . Let be a probability vector with for , and draw by With-replacement leverage-score row sampling and rescaling with replacement. For , if
then with probability at least ,
Equivalently, is an -subspace embedding for . In the usual confidence range , the simpler sufficient condition
follows. For a matrix of rank , any orthonormal basis of gives the corresponding embedding guarantee on .
Facts & Assumptions
Given: An orthonormal , the stated sampling probabilities and parameters, and the with-replacement sketch draw.
The leverage scores are basis-independent, sum to , and satisfy (Row leverage scores of a finite-dimensional subspace, Leverage scores are basis-independent and sum to the dimension).
Each draw independently samples row with probability and puts in the corresponding row; a zero-probability row has zero leverage and is not sampled (With-replacement leverage-score row sampling and rescaling).
If independent centered Hermitian matrices satisfy and , then for every (Bounded independent matrix Bernstein bound from the trace exponential).
An -embedding has the squared-norm inequality on every vector of the specified subspace (Oblivious squared-norm subspace embeddings).
For Hermitian matrices, write when for every vector ; the operator norm is on a nonzero finite-dimensional domain (The operator norm is zero on the zero domain and otherwise is max_{||v||=1} ||Tv||).
The inner product satisfies Cauchy--Schwarz over both fields (Cauchy–Schwarz: , with equality exactly for linearly dependent vectors).
Proof
Given: The hypotheses in the Statement.
Write , so . For draw , let be its sampled index and define . By [F2], the are independent and ; terms with have by [F1] and contribute zero.
Put and . The rank-one identity and give and . Thus , , and . Hence [F3] applies with both bounds equal to .
Set . By [F3], . Under the first sample-size condition, , so . Also , since . Thus the Bernstein threshold is at most .
From the sampled-row definition in [F2], , so . Step 2.1 therefore proves with probability at least . For nonzero , [F5] and [F6] imply ; the same holds for zero . Thus , and because is an isometry onto its range, this is the embedding property in [F4].
If and , then , hence . Therefore the second stated sample-size condition implies the first. For any rank- matrix , its range is , so the same embedding statement applies to 's column space.
5 · Examples, counterexamples and false statements
None yet.
Sources
- David P. Woodruff, Sketching as a Tool for Numerical Linear Algebra, §2.5, Theorem 21
- Michael W. Mahoney, Randomized Algorithms for Matrices and Data, §4.2
- David P. Woodruff, Sketching as a Tool for Numerical Linear Algebra, §2.1, Definitions 1–2
- Michael W. Mahoney, Randomized Algorithms for Matrices and Data, §2.1
- David P. Woodruff, Sketching as a Tool for Numerical Linear Algebra, §2.6
- Michael W. Mahoney, Randomized Algorithms for Matrices and Data, §4.3
- David P. Woodruff, Sketching as a Tool for Numerical Linear Algebra, §2.4, Definition 16
- Michael W. Mahoney, Randomized Algorithms for Matrices and Data, §4.1
- David P. Woodruff, Sketching as a Tool for Numerical Linear Algebra, §2.1, Lemma 5
- Philippe Rigollet and Jan-Christian Hütter, High-Dimensional Statistics: Lecture Notes, Chapter 1, Lemma 1.18
- David P. Woodruff, Sketching as a Tool for Numerical Linear Algebra, §2.4
- Wen-Wei Lin, Lecture Notes of Matrix Computations, §3.2.2
- David P. Woodruff, Sketching as a Tool for Numerical Linear Algebra, §2.5
- David P. Woodruff, Sketching as a Tool for Numerical Linear Algebra, §2.1, Theorem 4 and §2.2, Lemma 18
- Michael W. Mahoney, Randomized Algorithms for Matrices and Data, §3.1
- David P. Woodruff, Sketching as a Tool for Numerical Linear Algebra, §2.1, Theorem 6
- David P. Woodruff, Sketching as a Tool for Numerical Linear Algebra, §2.4, Theorem 17
- David Woodruff, 15-859T Lecture 4.2, Leverage Score Sampling gives a Subspace Embedding, Claims 2–3
- Joel A. Tropp, An Introduction to Matrix Concentration Inequalities, §6.6