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.

Sparse recovery and nullspace certificates

1 · Prerequisites

2 · Logical flowchart

3 · Definitions, theorems and proofs

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-6-luna)verified 2026-10-22 (gpt-6.1-sol)Open item page →

The strict nullspace property

Definition

Let m,n∈N with m,n≥1, and let A∈Mm×n(R)=Rm×n. Put [m]:={1,…,m} and [n]:={1,…,n}. The library indexes vector coordinates and matrix columns by n={0,…,n−1} and matrix rows by m={0,…,m−1}. Throughout this item use the canonical relabeling j↦j−1 from [n] to the library's coordinate and column indices, and similarly from [m] for rows. Thus write uj:=u(j−1) and Aij:=A(i−1,j−1). For u∈Rn, define the matrix-vector product by (Au)i:=∑j=1nAijuj(i∈[m]), and define ker⁡A:={h∈Rn:Ah=0}. For h∈Rn and S⊆[n], let hS∈Rn be the vector whose jth coordinate is hj for j∈S and 0 for j∉S; write Sc:=[n]∖S. For u∈Rn, write ∥u∥1:=∑j=1n∣uj∣, the same p=1 norm as the library's finite-dimensional norm under this coordinate relabeling. For s∈N with 1≤s≤n, the matrix A satisfies the strict nullspace property of order s if ∥hS∥1<∥hSc∥1 for every nonzero h∈ker⁡A and every S⊆[n] with ∣S∣≤s. This condition concerns exact kernel vectors only and says nothing about vectors with Ah≠0.

TheoremStatement: Literature-sourcedProof: AI-generatedjudge pass (gpt-6-luna)verified 2026-10-22 (gpt-6.1-sol)Open item page →

Exact basis-pursuit recovery under the strict nullspace property

Statement

Let m,n,s∈N with m,n≥1 and 1≤s≤n, and let A∈Rm×n satisfy the strict nullspace property of order s. Use one-based coordinate labels j=1,…,n, with coordinate j identified with the library's coordinate j−1. If x†∈Rn has at most s nonzero coordinates, then x† is the unique minimizer of ∑j=1n∣zj∣ over all z∈Rn satisfying Az=Ax†. This is a noiseless exact-data result; it makes no exact-recovery or support-recovery assertion for noisy observations.

Facts & Assumptions

Given: Integers m,n≥1, an integer 1≤s≤n, a matrix A∈Rm×n satisfying the strict nullspace property of order s, and a vector x†∈Rn with at most s nonzero coordinates.

[F1]

The strict nullspace property: for every nonzero h∈ker⁡A and every S⊆[n] with ∣S∣≤s, ∥hS∥1<∥hSc∥1.

[F2]

The p-norms ∥x∥p for rational p≥1, and ∥x∥∞: ∥u∥1=∑j=1n∣uj∣ for u∈Rn.

[F4]

A norm on a real vector space, the induced metric, and the dictionary with the metric axioms: every norm N satisfies the triangle inequality N(u+v)≤N(u)+N(v).

[F5]

The strict nullspace property: under its coordinate relabeling, (Au)i=∑j=1nAijuj for each row i.

[F6]

Laws of finite sums and finite products: finite sums are additive, so ∑j=1n(bj−cj)=∑j=1nbj−∑j=1ncj for real lists.

Proof

1.1givenF1F5F6constructalgebra

Let S:={j∈[n]:xj†≠0}, so ∣S∣≤s. For any feasible z≠x†, put h:=z−x†. For each row i, [F5] and [F6] give (Ah)i=∑j=1nAij(zj−xj†)=∑j=1nAijzj−∑j=1nAijxj†=(Az)i−(Ax†)i=0, so h∈ker⁡A and h≠0. Hence [F1] gives ∥hS∥1<∥hSc∥1.

2.1givenF1F2F3F4step 1.1algebra∎

By [F3], ∥⋅∥1 is a norm, so [F4] gives its triangle inequality. On S, zS=xS†+hS, hence ∥x†∥1=∥xS†∥1=∥zS−hS∥1≤∥zS∥1+∥hS∥1. On Sc, x† vanishes and zSc=hSc, so z=zS+hSc with disjoint coordinate supports and ∥z∥1=∥zS∥1+∥hSc∥1. By step 1.1, this is strictly greater than ∥zS∥1+∥hS∥1≥∥x†∥1. Thus every feasible vector distinct from x† has strictly larger objective, and x†, which is feasible, is the unique minimizer.

LemmaStatement: Literature-sourcedProof: AI-generatedverified 2026-10-22 (gpt-6.1-sol)Open item page →

A uniform stability margin for the nullspace cone

Statement

Let m,n,s∈N with m,n≥1 and 1≤s≤n, and let A∈Rm×n. Use one-based coordinate labels j=1,…,n, with coordinate j identified with the library's coordinate j−1. Assume that ∑j∈S∣hj∣<∑j∉S∣hj∣ for every nonzero h∈Rn with Ah=0 and every S⊆{1,…,n} with ∣S∣≤s. Then there is a constant ρ∈(0,1) such that ∑j∈S∣hj∣≤ρ∑j∉S∣hj∣ for every h∈Rn with Ah=0 and every S⊆{1,…,n} with ∣S∣≤s. The estimate is only on the exact kernel and gives no bound for vectors with Ah≠0.

Facts & Assumptions

Given: Integers m,n≥1, 1≤s≤n, a matrix A∈Rm×n satisfying the strict nullspace inequalities in the Statement, and ker⁡A:={h∈Rn:Ah=0}.

[F1]

The strict nullspace property: for every nonzero h∈ker⁡A and every S⊆[n] with ∣S∣≤s, ∥hS∥1<∥hSc∥1, where hS is zero outside S.

[F2]

The p-norms ∥x∥p for rational p≥1, and ∥x∥∞: ∥x∥1=∑j=1n∣xj∣ on Rn.

[F3]

The p-norms ∥x∥p for rational p≥1, and ∥x∥∞: ∥x∥2=(∑j=1nxj2)1/2 on Rn.

[F5]

Each ∥⋅∥p is a norm on Rn, and the induced metrics are exactly d1, d2 and d∞ of the published metric-spaces page: both ∥⋅∥1 and ∥⋅∥2 are norms on Rn, and d2(u,v)=∥u−v∥2 for n≥1.

[F6]

A norm on a real vector space, the induced metric, and the dictionary with the metric axioms: a norm satisfies absolute homogeneity, N(λv)=∣λ∣N(v).

[F8]

For a nonempty subset of Rn with n≥1, compactness, closedness and boundedness, pseudocompactness, and attainment of extrema by every continuous real-valued function are equivalent: closed bounded subsets of Rn are compact, and continuous real-valued functions on nonempty compact subsets attain their maxima; this result is choice-free.

[F9]

Every nonempty finite set of reals has a maximum and a minimum: every nonempty finite set of real numbers has a maximum.

[F10]

Laws of finite sums and finite products: finite sums are monotone termwise; every nonnegative term is at most its sum, and adjoining nonnegative terms cannot decrease the sum.

[F11]

The strict nullspace property: under its coordinate relabeling, (Au)i=∑j=1nAijuj for each row i.

[F12]

The Euclidean inner product ⟨x,y⟩=∑k<nxkyk on Rn: for the row vector ri with coordinates (ri)j=Aij, ⟨ri,u⟩=∑j=1nAijuj.

[F13]

Laws of finite sums and finite products: additivity and scalar multiplication of finite sums give ∑j=1nAij(uj−vj)=∑j=1nAijuj−∑j=1nAijvj.

[F15]

Squaring is monotone on the nonnegatives: for nonnegative reals a,b, a≤b if and only if a2≤b2.

Proof

1.1givenF3F4F5F8F11F12F13F14constructchoose

If ker⁡A={0}, choose ρ=1/2. The only h∈ker⁡A is zero, so both sides of the required inequality are zero for every S. Now suppose ker⁡A≠{0} and define K:={h∈ker⁡A:∥h∥2=1}. This set is nonempty by normalizing a nonzero kernel vector, since [F5] makes its norm positive. To show K is closed, fix x∉K. If Ax≠0, choose a row i with c:=(Ax)i≠0 and let ri be that row as a vector in Rn. By [F11], [F12], and [F13], fi(u):=(Au)i=⟨ri,u⟩ and fi(y)−fi(x)=⟨ri,y−x⟩. By [F4], ∣fi(y)−c∣≤∥ri∥2∥y−x∥2. Moreover, ∥ri∥2>0: otherwise [F5] gives ri=0, which would imply c=⟨ri,x⟩=0. Thus δ:=∣c∣/(2∥ri∥2)>0, and whenever ∥y−x∥2<δ we have ∣fi(y)−c∣<∣c∣/2, so fi(y)≠0 and y∉K. If Ax=0, then ∥x∥2≠1; put δ:=∣∥x∥2−1∣/2>0. By [F14], ∣∥y∥2−∥x∥2∣≤∥y−x∥2, so ∥y−x∥2<δ precludes ∥y∥2=1 and again y∉K. Hence every point outside K has a ball disjoint from K, so K is closed. It is bounded because every h∈K has ∥h∥2=1 and [F5] identifies this with its Euclidean distance from 0. By [F8], K is compact.

2.1step 1.1F1F2F3F5F7F8F10F15algebra

Fix S⊆[n] with ∣S∣≤s and define PS,PSc:Rn→Rn by PSu:=uS and PScu:=uSc. For all u,v∈Rn and every coordinate j, ∣(PSu−PSv)j∣≤∣uj−vj∣; both sides are nonnegative, so the forward implication in [F15] and then [F10] give ∥PSu−PSv∥22≤∥u−v∥22. Both Euclidean norms are nonnegative by [F5], so the converse implication in [F15] yields ∥PSu−PSv∥2≤∥u−v∥2. The same argument applies to PSc, making both coordinate projections 1-Lipschitz, hence continuous for d2. Since ∥⋅∥1 is a norm by [F5] and every norm on Rn is continuous for d2 by [F7], the compositions aS(h):=∥hS∥1 and bS(h):=∥hSc∥1 are continuous. For each h∈K, [F1] gives aS(h)<bS(h), hence bS(h)>0. To verify continuity of rS:=aS/bS at any h0∈K, put a0:=aS(h0) and b0:=bS(h0)>0. Continuity of bS gives a neighborhood of h0 in K on which bS(h)>b0/2. There, ∣rS(h)−rS(h0)∣≤2b0∣aS(h)−a0∣+2a0b02∣bS(h)−b0∣, by splitting the difference of the two quotients. The right side tends to 0 as h→h0, since aS and bS are continuous; thus rS is continuous on K. By [F8] it attains a maximum qS on K, and [F1] at a maximizing point gives 0≤qS<1.

3.1step 1.1step 2.1givenF1F2F9choosealgebra

There are finitely many sets S⊆[n] with ∣S∣≤s, and this family is nonempty because it contains ∅. Therefore [F9] gives q:=max⁡∣S∣≤sqS<1. Choose any h∈K and a coordinate j with hj≠0; then S={j} is admissible because s≥1, and [F2] gives rS(h)>0, so q>0. Set ρ:=(1+q)/2; then q<ρ<1.

4.1step 1.1step 3.1F1F2F3F5F6algebra∎

Let h∈ker⁡A. If h=0, the required inequality is immediate. Otherwise h~:=h/∥h∥2 belongs to K. For every admissible S, [F6] gives rS(h)=rS(h~)≤q<ρ, so ∥hS∥1≤ρ∥hSc∥1. This proves the estimate with one constant for all S and all kernel vectors.

4 · Examples, counterexamples and false statements

None yet.

Sources