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.

✓ 3 results · all verified · 2 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 1 not AI-judged were verified by owner audit (typically over a confirmed judge false positive), not failures.

Interpolative cur and nystrom decompositions — Examples

1 · Prerequisites

2 · Summary

The examples compute an exact rank-two skeleton CUR reconstruction, exhibit a prescribed one-column interpolant that misses the dominant singular direction, and verify a positive-semidefinite Nyström residual on a two-dimensional matrix.

3 · Logical flowchart

4 · Definitions, theorems and proofs

None yet.

5 · Examples, counterexamples and false statements

CounterexampleConstruction: AI-generatedVerification: AI-generatedprecheck passjudge pass (gpt-6-luna)Open item page →

A prescribed column can miss the dominant direction

Statement refuted

For every real matrix A∈Rm×n with m≥n≥2, every integer 1≤k<n, and every prescribed ordered list J of k distinct valid column indices, there is a matrix T∈Rk×n with T(:,J)=Ik, max⁡i,j∣Tij∣≤1, and ∥A−A(:,J)T∥2≤1+k(n−k) σk+1(A), where ∥⋅∥2 is the Euclidean operator norm and σj(A) is the jth singular value.

Facts & Assumptions

Given: The claimed universal bound above.

[A1]

Consider A=[10001], k=1, and the prescribed index set J=(2).

Given: The matrix, rank parameter, and prescribed selected column in [A1].

Counterexample

1.1givenA1algebra

Any 1×2 matrix satisfying T(:,J)=1 has the form T=(t,1). The coefficient condition gives ∣t∣≤1, and direct multiplication gives A−A(:,J)T=[100−t0]. Its spectral norm is the Euclidean norm of its first column, 100+∣t∣2≥10.

2.1A1step 1.1algebra∎

The singular values of the diagonal matrix in [A1] are 10 and 1, so the proposed upper bound is 1+1⋅(2−1) σ2(A)=2. Since 10>2, no such T satisfies the claim.

ExampleConstruction: AI-generatedVerification: AI-generatedprecheck passOpen item page →

An exact rank-two CUR reconstruction from a nonsingular cross

Example

Take A=[101011112], and select I=J=(1,2). The resulting skeleton CUR factors reconstruct A exactly.

Facts & Assumptions

Given: The displayed matrix A and ordered row and column selections I=J=(1,2).

[A1]

The matrix and index lists are exactly those stated in the Example.

[F1]

Skeleton and projected least-squares CUR cores: C=A(:,J), R=A(I,:), W=A(I,J), and the skeleton reconstruction is CW†R.

[F2]

Skeleton CUR is exact for a full-rank cross: if rank⁡(A)=rank⁡(W)=k, then CW†R=A.

[F3]

The Moore--Penrose pseudoinverse A+ as the solution of the four Penrose equations: a Moore-Penrose inverse satisfies the four Penrose equations.

[F4]

Every finite real or complex matrix has a unique Moore--Penrose pseudoinverse: every finite matrix has a unique Moore-Penrose inverse.

Given: A and I,J from [A1].

Verification

1.1givenA1F1F3F4algebra

Direct extraction gives C=[100111], R=[101011], and W=I2. Since I2 satisfies the four Penrose equations [F3], uniqueness [F4] gives W†=I2; [F1] therefore gives the reconstruction CR.

2.1A1F2F3F4step 1.1algebra∎

Multiplication yields CR=[101011112]=A. The identity I2 satisfies the Penrose equations [F3], hence equals W† by uniqueness [F4]. The third row of A is the sum of the first two, and the first two are independent, so rank⁡(A)=2=rank⁡(W). Hence [F2] also applies and confirms the exact skeleton CUR identity.

ExampleConstruction: AI-generatedVerification: AI-generatedprecheck passjudge pass (gpt-6-luna)Open item page →

A PSD Nyström residual remains positive semidefinite

Example

For A=diag⁡(4,1) and S=e1, the Nyström approximation is diag⁡(4,0) and its residual is the positive-semidefinite matrix diag⁡(0,1).

Facts & Assumptions

Given: A=diag⁡(4,1) and the one-column sketch S=e1.

[A1]

The matrix A and sketch S are those stated in the Example.

[F1]

The positive-semidefinite Nyström approximation: A^nys=AS(S∗AS)†S∗A.

[F2]

Nyström is positive semidefinite, dominated by A, and exact when it captures the range: 0⪯A^nys⪯A for every PSD A and conformal sketch.

[F3]

The Moore--Penrose pseudoinverse A+ as the solution of the four Penrose equations: the Moore-Penrose inverse is characterized by the four Penrose equations.

[F4]

Every finite real or complex matrix has a unique Moore--Penrose pseudoinverse: every finite matrix has a unique Moore-Penrose inverse.

Given: A,S from [A1].

Verification

1.1givenA1F1F3F4algebra

We have AS=(4,0)T and S∗AS=[4]. The scalar [1/4] satisfies all four equations [F3], so it is the Moore-Penrose inverse by uniqueness [F4]. Substitution in [F1] gives A^nys=diag⁡(4,0).

2.1A1F2step 1.1algebra∎

Subtracting from A gives A−A^nys=diag⁡(0,1), which is positive semidefinite by its nonnegative diagonal entries. The general order statement [F2] also gives 0⪯A^nys⪯A in this instance.