Alphabeta Math
Pipeline-generated
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.

✓ 8 results · all verified · 3 also independently AI-judged
Every result on this page is machine-checked by a proof checker and read in full and owner-audited; the judge is an additional, independent cross-model AI review of the proofs. The 5 not AI-judged were verified by owner audit (typically over a confirmed judge false positive), not failures.

Sketched least squares and subspace embeddings

1 · Prerequisites

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 span⁡(Ran⁡(A),b). Embedding Ran⁡(A) alone does not suffice. The page also defines the QR right preconditioner and proves its singular-value bounds under an embedding of Ran⁡(A). 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

AlgorithmAlgorithm: Literature-sourcedProof: Not applicablejudge pass (gpt-6-luna)Open item page →

Rank-aware sketch-and-solve least squares

Definition

Input A∈Kn×p, b∈Kn, a supplied sketch S∈Km×n, and a finite nonnegative integer SVD sweep budget N, where K∈{R,C}. Form C=SA and c=Sb, and call Rank-thresholded least squares by the singular value decomposition on (C,c) with threshold τ=0 and budget N.

If the call returns exact-arithmetic convergence with an exact SVD record, return success, the exact rank r=rank⁡(C), the canonical minimum-norm vector x^=C+c, and the separately computed sketched and physical residuals ∥Cx^−c∥2 and ∥Ax^−b∥2. 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.

DefinitionDefinition: Literature-sourcedProof: Not applicableOpen item page →

Oblivious squared-norm subspace embeddings

Definition

Let K∈{R,C}, let n,m≥1, and use ∥x∥22=∑i∣xi∣2 on Kn. For a fixed subspace U⊆Kn and 0<ε<1, a matrix S∈Km×n is an ε-subspace embedding for U when

(1−ε)∥x∥22≤∥Sx∥22≤(1+ε)∥x∥22for every x∈U.

For an integer d with 0≤d≤n and 0<δ<1, a distribution D on m×n matrices is an (ε,δ) oblivious ℓ2 subspace embedding for dimension d if, for every fixed d-dimensional subspace U⊆Kn chosen independently of the draw,

Pr⁡S∼D{S is an ε-subspace embedding for U}≥1−δ.

The subspace is fixed before sampling, but the guarantee is stated separately for each such U; it does not assert that one draw preserves all d-dimensional subspaces simultaneously. For a matrix A, an embedding of Ran⁡(A) means the property on its column space. For least-squares residuals Ax−b, the relevant subspace is span⁡(Ran⁡(A),b).

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-6-luna)Open item page →

Right preconditioner from the reduced QR factor of a sketch

Definition

Let A∈Kn×d, S∈Km×n, and suppose a reduced QR factorization of SA is supplied:

SA=QR,Q∗Q=Id,

where R∈Kd×d is upper triangular and nonsingular. The sketch-QR right preconditioner is

PS:=R−1.

It is undefined when no such reduced factorization with nonsingular R is available. The matrix being preconditioned is the original A, through APS; SA is used to construct PS.

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-6-luna)Open item page →

Row leverage scores of a finite-dimensional subspace

Definition

Let K∈{R,C}, and let U⊆Kn have dimension d≥1. Choose a matrix Q∈Kn×d whose columns are an orthonormal basis of U, so Q∗Q=Id. For 0≤i<n, define the i-th row leverage score of U by

ℓi(U):=∥ei∗Q∥22,

where ei is the i-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

LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-6-luna)Open item page →

A sphere net controls a real or complex Hermitian operator norm

Statement

Let d≥1, K∈{R,C}, and let H∈Kd×d be Hermitian. Regard Cd as R2d for distances. A 1/4-net N of the unit sphere exists with ∣N∣≤9d over R, and ∣N∣≤92d over C. For every such net,

∥H∥2≤2max⁡v∈N∣v∗Hv∣.

Facts & Assumptions

Given: A Hermitian d×d matrix over K, with d≥1, and the Euclidean operator norm.

[F2]

The unit sphere in Rq has a 1/4-net of size at most (1+8)q=9q (Finite epsilon nets of the Euclidean sphere).

[F3]

The inner product satisfies ∣⟨x,y⟩∣≤∥x∥2∥y∥2 over both fields (Cauchy–Schwarz: ∣⟨u,v⟩∣≤∥u∥∥v∥, with equality exactly for linearly dependent vectors).

Proof

Given: The hypotheses in the Statement.

1.1F1choosealgebra

Regard H as a complex Hermitian matrix when K=R. By [F1], it has an orthonormal eigenbasis over C; every eigenvalue is real because Hv=λv and H=H∗ give λ∥v∥22=v∗Hv=v∗Hv‾=λ‾∥v∥22. Choose a unit eigenvector z for an eigenvalue λ of largest absolute value. The diagonalization shows ∥H∥2=∣λ∣ over C. If K=C, set u=z. If K=R, write z=a+ib; since H and λ are real, Ha=λa and Hb=λb, and at least one of a,b is nonzero. Normalize a nonzero part as u. The same diagonalization bounds the real operator norm by ∣λ∣, while u attains that bound, so ∣u∗Hu∣=∣λ∣=∥H∥2 over either field.

2.1F2step 1.1choose

Apply [F2] in real dimension q=d when K=R, and q=2d when K=C, to obtain the stated net-size bound and a v∈N with ∥u−v∥2≤1/4.

3.1F1F3step 1.1step 2.1algebra∎

Since H=H∗ and u,v are unit vectors, ∣u∗Hu−v∗Hv∣≤∣(u−v)∗Hu∣+∣v∗H(u−v)∣≤2∥u−v∥2∥H∥2≤∥H∥2/2, using [F3] and the definition of operator norm. Therefore ∣v∗Hv∣≥∣u∗Hu∣−∥H∥2/2=∥H∥2/2, proving the claimed bound.

LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-6-luna)Open item page →

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.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-6-luna)Open item page →

A converged exact sketch-and-solve run returns a sketch minimizer

Statement

Let C=SA and c=Sb 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 x^ is the unique minimum-Euclidean-norm minimizer of ∥SAx−Sb∥2, and the reported rank is rank⁡(SA). No conclusion is asserted on an inconclusive or finite-precision unverified branch.

Facts & Assumptions

Given: Finite matrices A,S, a vector b, and an exact-arithmetic converged execution of the SVD call in the algorithm.

[F1]

The algorithm forms C=SA, c=Sb and calls the SVD least-squares procedure at strict threshold τ=0; only exact convergence with an exact SVD record is the branch under consideration (Rank-aware sketch-and-solve least squares).

[F2]

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.

1.1F1construct

Set C=SA and c=Sb. By [F1], the converged call uses threshold zero and returns x^=C0+c, where C0 retains exactly the singular values of C that are strictly positive.

2.1step 1.1algebra

In an exact SVD C=UΣV∗, zero singular values contribute zero terms and every positive singular value is retained at threshold zero. Thus C0=UΣV∗=C, including the rank-zero case.

3.1F2step 2.1algebra∎

Apply [F2] to the truncated matrix C0. It says that C0+c is its unique minimum-norm least-squares solution. By step 2.1, C0=C, so x^ is the unique minimum-norm minimizer of ∥Cx−c∥2=∥SAx−Sb∥2; the zero-threshold rank count is precisely the number of positive singular values of C, hence rank⁡(C).

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passOpen item page →

An embedded QR right preconditioner has controlled singular values

Statement

Let n,m,d≥1 with n,m≥d, let A∈Kn×d have full column rank, and let 0<ε<1, and suppose the particular matrix S is an ε-subspace embedding for Ran⁡(A). A reduced QR factorization SA=QR exists and has nonsingular R, so the preconditioner PS=R−1 of Right preconditioner from the reduced QR factor of a sketch is defined. Its right-preconditioned matrix satisfies

11+ε≤σmin⁡(APS)≤σmax⁡(APS)≤11−ε,κ2(APS):=σmax⁡(APS)σmin⁡(APS)≤1+ε1−ε.

Facts & Assumptions

Given: Full-column-rank A, an ε-embedding S on Ran⁡(A), and 0<ε<1.

[F1]

On the embedded subspace, (1−ε)∥x∥22≤∥Sx∥22≤(1+ε)∥x∥22 for every x∈Ran⁡(A) (Oblivious squared-norm subspace embeddings).

[F2]

A reduced QR factorization has SA=QR, Q∗Q=Id, and upper-triangular R; Householder or Givens steps construct one for every finite SA (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).

[F3]

Proof

Given: The hypotheses in the Statement.

1.1F1F2givenalgebra

If y∈Kd is nonzero, full column rank gives Ay≠0; then [F1] gives ∥SAy∥22≥(1−ε)∥Ay∥22>0. Thus SA has full column rank. The reduced QR factorization in [F2] exists. If Rv=0, then SAv=QRv=0; injectivity of SA forces v=0, so R is nonsingular and PS=R−1 is defined.

2.1F1F2step 1.1algebra

For any y∈Kd, SAPSy=QRR−1y=Qy, so ∥SAPSy∥22=∥Qy∥22=∥y∥22 by [F2]. Since APSy∈Ran⁡(A), [F1] yields (1−ε)∥APSy∥22≤∥y∥22≤(1+ε)∥APSy∥22.

3.1F3step 2.1algebra

For every unit y, step 2.1 implies 1/1+ε≤∥APSy∥2≤1/1−ε. By [F3], the minimum and maximum of these values over the unit sphere are σmin⁡(APS) and σmax⁡(APS), respectively. This proves both singular-value bounds.

4.1step 3.1algebra∎

The lower bound in step 3.1 is positive, so the ratio defining κ2 is valid. Dividing the upper singular-value bound by the lower one gives κ2(APS)≤(1+ε)/(1−ε).

LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passOpen item page →

Squared-norm concentration for real and normalized complex Gaussians

Statement

Assume Countable Choice for the finite-dimensional Gaussian probability law. Let m≥1, and let g1,…,gm be independent standard real Gaussian scalars or independent normalized complex Gaussian scalars, with E∣gj∣2=1. For 0<t<1,

Pr⁡{∣1m∑j=1m∣gj∣2−1∣≥t}≤2e−mt2/8.

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 0<t<1.

[F1]

A standard real Gaussian scalar has density (2π)−1/2e−x2/2; a normalized complex one has density π−1e−∣z∣2 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.

[F2]

Countable Choice, written ACω, is used in the repository's construction of the finite-dimensional Lebesgue probability measures for these densities (The Axiom of Countable Choice (ACω)).

[F3]

Under Countable Choice, invertible real linear maps scale Lebesgue measure by the absolute determinant (A linear map T of Rn sends Lebesgue measurable sets to Lebesgue measurable sets, with λn(T[E])=∣det⁡T∣ λn(E) when T is invertible and T[E] Lebesgue null when it is not). The corresponding nonnegative-integral identity follows first for indicators, then simple functions and their defining suprema.

[F4]

For a nonnegative measurable random variable X and a>0, Pr⁡{X≥a}≤EX/a (Markov's inequality for random variables).

[F6]

The probability of a finite union of events is at most the sum of their probabilities (The finite union bound).

[A1]

We use only Countable Choice for those finite Gaussian integrals; no unrestricted Axiom of Choice is assumed.

Proof

Given: The hypotheses in the Statement.

1.1F1F2F3A1algebra

For real Z and θ<1/2, put c=1−2θ>0. By [F3], the substitution u=c x gives EeθZ2=c−1/2(2π)−1/2∫Re−u2/2 du=c−1/2. The prefactored integral is one since [F1] is a probability density. For normalized complex G and θ<1, put d=1−θ>0. On C≃R2, the map u=d z has real determinant d, so [F3] gives Eeθ∣G∣2=d−1π−1∫R2e−∣u∣2 du=d−1. Again the prefactored integral is one by the normalized density [F1]. These identities include the finite integrability ranges needed below.

2.1F1F4F5step 1.1algebra

For the real case, [F4] applied to X=eλ∑jgj2 at the positive threshold a=eλm(1+t), with λ=t/(2(1+t)), and independence together with the first formula of step 1.1 give Pr⁡{m−1∑jgj2≥1+t}≤exp⁡[−m2(t−log⁡(1+t))]. For the complex case use X=eλ∑j∣gj∣2, the same threshold, λ=t/(1+t), and the second formula to obtain the stronger bound exp⁡[−m(t−log⁡(1+t))]. Both positive parameters lie in the finite mgf ranges of step 1.1. By [F5], t−log⁡(1+t)=∫0tu/(1+u) du≥t2/4, so both upper tails are at most e−mt2/8.

2.2F1F4F5step 1.1algebra

For the real lower tail, apply [F4] to X=e−λ∑jgj2 at threshold a=e−λm(1−t)>0 with λ=t/(2(1−t)); for the complex lower tail use X=e−λ∑j∣gj∣2, the same threshold, and λ=t/(1−t). The event X≥a 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 exp⁡[−m2(−t−log⁡(1−t))] and exp⁡[−m(−t−log⁡(1−t))]. By [F5], −t−log⁡(1−t)=∫0tu/(1−u) du≥t2/2, so each is at most e−mt2/8.

3.1step 2.1step 2.2F6algebra∎

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.

AlgorithmAlgorithm: Literature-sourcedProof: Not applicablejudge pass (gpt-6-luna)Open item page →

With-replacement leverage-score row sampling and rescaling

Definition

Input an orthonormal basis matrix Q∈Kn×d with d≥1, a sample count m≥1, a parameter 0<β≤1, and a probability vector π=(π0,…,πn−1) satisfying πi≥βℓi(U)/d, where U=Ran⁡(Q) and ℓi(U) is from Row leverage scores of a finite-dimensional subspace. If the input checks fail, return invalid-input. Otherwise draw indices J1,…,Jm independently with replacement from π. Form S∈Km×n by setting row j to eJj∗/mπJj, and return success, the selected indices, and S.

Because β>0, πi=0 implies ℓi(U)=0; such a row is never sampled, so the scaling never divides by zero. One canonical choice is πi=ℓi(U)/d, 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 S.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passOpen item page →

Embedding span(A,b) gives the sketch-and-solve residual factor

Statement

Let A∈Kn×p, b∈Kn, and 0<ε<1. Suppose the particular sketch S used in Rank-aware sketch-and-solve least squares is an ε-subspace embedding for U=span⁡(Ran⁡(A),{b}). If that algorithm returns an exact-arithmetic converged vector x^, then

∥Ax^−b∥22≤1+ε1−εmin⁡x∈Kp∥Ax−b∥22.

Embedding Ran⁡(A) alone is not a hypothesis for this conclusion.

Facts & Assumptions

Given: Finite A,b, 0<ε<1, an ε-embedding S of U=span⁡(Ran⁡(A),{b}), and an exact converged output x^.

[F1]

Every vector in U has its squared norm multiplied by a factor in [1−ε,1+ε] by S (Oblivious squared-norm subspace embeddings).

[F2]

On the stated converged branch, x^ minimizes ∥SAx−Sb∥2 over all x (A converged exact sketch-and-solve run returns a sketch minimizer).

Proof

Given: The hypotheses in the Statement.

1.1F3choose

By [F3], choose an original least-squares minimizer x∗∈Kp, and write r∗=Ax∗−b, r^=Ax^−b.

2.1givenF1step 1.1algebra

For every x∈Kp, both Ax and b belong to U, so their difference Ax−b belongs to U. In particular [F1] applies to r^ and r∗.

2.2F2step 1.1algebra

By [F2], x^ minimizes the sketched residual, so ∥Sr^∥22≤∥Sr∗∥22; squaring preserves order because both residual norms are nonnegative.

3.1F1step 2.1

The lower inequality in [F1] gives (1−ε)∥r^∥22≤∥Sr^∥22.

3.2F1step 2.1

The upper inequality in [F1] gives ∥Sr∗∥22≤(1+ε)∥r∗∥22.

4.1step 3.1step 2.2step 3.2step 1.1algebra∎

Combining steps 3.1, 2.2 and 3.2 and dividing by 1−ε>0 proves the claimed estimate, since x∗ is an original minimizer by step 1.1.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passOpen item page →

Gaussian sketches embed a fixed subspace at the additive dimension rate

Statement

Assume Countable Choice for the finite-dimensional Gaussian probability law. Let 1≤d≤n, K∈{R,C}, and let U⊆Kn be a fixed d-dimensional subspace. Let G∈Km×n have iid standard real Gaussian entries when K=R, or iid normalized complex Gaussian entries with E∣g∣2=1 when K=C. Put S=G/m. For 0<ε,δ<1, if

m≥192ε−2(d+log⁡(1/δ)),

then with probability at least 1−δ, S is an ε-subspace embedding for U. Thus this Gaussian distribution is an (ε,δ) oblivious ℓ2 subspace embedding for dimension d.

Facts & Assumptions

Given: Countable Choice for the finite Gaussian law, and a fixed subspace U of dimension d, the stated Gaussian law, m≥1, 0<ε,δ<1, and the displayed sample-size condition.

[F1]

An ε-subspace embedding preserves every squared norm on the fixed subspace within factors 1±ε; an (ε,δ) oblivious embedding has this probability for each fixed subspace (Oblivious squared-norm subspace embeddings).

[F2]

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.

[F3]

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).

[F4]

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).

[F5]

For independent standard real or normalized complex Gaussian scalars, the squared-norm deviation probability is at most 2e−mt2/8 for 0<t<1 (Squared-norm concentration for real and normalized complex Gaussians).

[F6]

A complex unit sphere is a real sphere of twice the dimension, and its 1/4-net can be chosen with at most 92d points; the Hermitian quadratic net controls the operator norm by factor two (A sphere net controls a real or complex Hermitian operator norm).

[F7]

The operator norm of H is max∥y∥2=1∥Hy∥2 (The operator norm is zero on the zero domain and otherwise is max_{||v||=1} ||Tv||).

[F9]

The probability of a finite union of measurable events is at most the sum of their probabilities (The finite union bound).

[A1]

Countable Choice supplies the finite-dimensional Lebesgue probability laws used in [F2] (The Axiom of Countable Choice (ACω)).

Proof

Given: The hypotheses in the Statement.

1.1F2F3F4F6A1choose

Choose an orthonormal basis matrix Q∈Kn×d for U, and let N be a 1/4-net of its unit sphere with ∣N∣≤92d, which covers the real case too. For each fixed v∈N, Qv is a unit vector. Extend Qv to an orthonormal basis of Kn by applying [F4] to its orthogonal complement; [F3] then shows that GQv has m independent standard Gaussian coordinates.

2.1F5F6F9step 1.1givenalgebra

For each fixed v∈N, apply [F5] with t=ε/2 to obtain Pr⁡{∣∥SQv∥22−1∣≥ε/2}≤2e−mε2/32. The finite union bound [F9] for the fixed finite net gives Pr⁡{∃v∈N:∣∥SQv∥22−1∣≥ε/2}≤2 92de−mε2/32≤2e2dlog⁡9−6d−6log⁡(1/δ)≤δ. Here the sample-size hypothesis gives mε2/32≥6(d+log⁡(1/δ)), and log⁡2+2dlog⁡9<6d for d≥1.

3.1F1F6F7F8step 2.1algebra∎

On the complementary event, put H=Q∗S∗SQ−Id. This is Hermitian and ∣v∗Hv∣=∣∥SQv∥22−1∣<ε/2 for every v∈N. By [F6], ∥H∥2≤ε. For nonzero y, [F7] and [F8] give ∣y∗Hy∣≤∥y∥2∥Hy∥2≤∥H∥2∥y∥22; the zero vector satisfies the same inequality. Therefore (1−ε)∥y∥22≤∥SQy∥22≤(1+ε)∥y∥22. Since Q is an isometry onto U, [F1] identifies this as the required embedding inequality for every x=Qy∈U.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passOpen item page →

Leverage-score row sampling embeds the column space

Statement

Let Q∈Kn×d, d≥1, have orthonormal columns, and let ℓi=∥ei∗Q∥22. Let π be a probability vector with πi≥βℓi/d for 0<β≤1, and draw S by With-replacement leverage-score row sampling and rescaling with replacement. For 0<ε,δ<1, if

m≥8dβε2log⁡(2dδ),

then with probability at least 1−δ,

∥Q∗S∗SQ−Id∥2≤ε.

Equivalently, S is an ε-subspace embedding for Ran⁡(Q). In the usual confidence range 0<δ≤1/2, the simpler sufficient condition

m≥16dβε2log⁡(dδ)

follows. For a matrix A of rank d, any orthonormal basis Q of Ran⁡(A) gives the corresponding embedding guarantee on Ran⁡(A).

Facts & Assumptions

Given: An orthonormal Q, the stated sampling probabilities and parameters, and the with-replacement sketch draw.

[F1]

The leverage scores are basis-independent, sum to d, and satisfy 0≤ℓi≤1 (Row leverage scores of a finite-dimensional subspace, Leverage scores are basis-independent and sum to the dimension).

[F2]

Each draw independently samples row i with probability πi and puts ei∗/mπi in the corresponding row; a zero-probability row has zero leverage and is not sampled (With-replacement leverage-score row sampling and rescaling).

[F3]

If independent centered Hermitian matrices Bj satisfy ∥Bj∥2≤R and ∥EBj2∥2≤v, then Pr⁡{∥∑j=1mBj∥2>2mv a+2Ra/3}≤2de−a for every a>0 (Bounded independent matrix Bernstein bound from the trace exponential).

[F4]

An ε-embedding has the squared-norm inequality on every vector of the specified subspace (Oblivious squared-norm subspace embeddings).

[F5]

For Hermitian matrices, write X⪯Y when v∗(Y−X)v≥0 for every vector v; the operator norm is max⁡∥v∥2=1∥Mv∥2 on a nonzero finite-dimensional domain (The operator norm is zero on the zero domain and otherwise is max_{||v||=1} ||Tv||).

Proof

Given: The hypotheses in the Statement.

1.1F1F2algebra

Write zi=Q∗ei∈Kd, so ∥zi∥22=ℓi. For draw j, let Jj be its sampled index and define Yj=zJjzJj∗/πJj. By [F2], the Yj are independent and EYj=∑i:πi>0zizi∗=Q∗Q=Id; terms with πi=0 have zi=0 by [F1] and contribute zero.

2.1F1step 1.1F3algebra

Put R=d/β≥1 and Bj=Yj−Id. The rank-one identity (zizi∗)2=ℓizizi∗ and πi≥βℓi/d give ∥Yj∥2=ℓJj/πJj≤R and Yj2⪯RYj. Thus ∥Bj∥2≤max⁡(1,R−1)≤R, EBj=0, and 0⪯EBj2=EYj2−Id⪯(R−1)Id⪯RId. Hence [F3] applies with both bounds equal to R.

3.1F3step 2.1givenalgebra

Set a=log⁡(2d/δ). By [F3], Pr⁡{∥∑j=1mBj∥2>2mRa+2Ra/3}≤2de−a=δ. Under the first sample-size condition, mε2≥8Ra, so 2mRa≤mε/2. Also mε/2≥4Ra/ε≥2Ra/3, since 0<ε<1. Thus the Bernstein threshold is at most mε.

4.1F2F4F5F6step 2.1step 3.1algebra

From the sampled-row definition in [F2], Q∗S∗SQ=m−1∑jYj, so Q∗S∗SQ−Id=m−1∑jBj. Step 2.1 therefore proves ∥Q∗S∗SQ−Id∥2≤ε with probability at least 1−δ. For nonzero y, [F5] and [F6] imply ∣y∗(Q∗S∗SQ−Id)y∣≤∥y∥2∥(Q∗S∗SQ−Id)y∥2≤ε∥y∥22; the same holds for zero y. Thus (1−ε)∥y∥22≤∥SQy∥22≤(1+ε)∥y∥22, and because Q is an isometry onto its range, this is the embedding property in [F4].

5.1givenstep 4.1algebra∎

If 0<δ≤1/2 and d≥1, then d/δ≥2, hence log⁡(2d/δ)=log⁡(d/δ)+log⁡2≤2log⁡(d/δ). Therefore the second stated sample-size condition implies the first. For any rank-d matrix A, its range is Ran⁡(Q), so the same embedding statement applies to A's column space.

5 · Examples, counterexamples and false statements

None yet.

Sources