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
- Binary Operations, Monoids, Groups and Subgroups
- Compactness
- Compactness in Metric Spaces
- Completeness, Completion, and Uniform Continuity
- Construction of the Natural Numbers
- Construction of the Real Numbers via Cauchy Sequences
- Construction of the Real Numbers via Dedekind Cuts
- Countability and Uncountability
- Filters and Ultrafilters
- Finite Counting, Factorials and Binomial Coefficients
- Foundations of the Real Numbers for Analysis
- Linear Independence, Bases and Dimension
- Linear Transformations, Rank-Nullity and Quotient Spaces
- Matrices, the Matrix of a Linear Map, and Change of Basis
- Metric Spaces
- Monotone Sequences, Bolzano-Weierstrass, and Cauchy Completeness
- Order, Zorn's Lemma, and the Axiom of Choice
- Relations, Functions, and Quotients
- Rings, Subrings, Integral Domains and Fields
- Rⁿ as a Normed Space; Vector-Valued Functions
- Roots, Rational Powers, and Classical Inequalities
- Sequences and Limits
- Subspaces, Products, and Quotients
- Suprema and Infima
- The Topology of Euclidean Space
- The ZFC Axioms and the Basic Set Constructions
- Topological Spaces and Continuity
- Vector Spaces, Linear Subspaces, Span and Direct Sums
2 · Logical flowchart
3 · Definitions, theorems and proofs
The strict nullspace property
Definition
Let with , and let . Put and . The library indexes vector coordinates and matrix columns by and matrix rows by . Throughout this item use the canonical relabeling from to the library's coordinate and column indices, and similarly from for rows. Thus write and . For , define the matrix-vector product by and define For and , let be the vector whose th coordinate is for and for ; write . For , write the same norm as the library's finite-dimensional norm under this coordinate relabeling. For with , the matrix satisfies the strict nullspace property of order if for every nonzero and every with . This condition concerns exact kernel vectors only and says nothing about vectors with .
Definition references
The matrix space and its zero-based row and column indices
Matrix-vector multiplication and identity matrices
The finite-dimensional one-norm
Foucart and Rauhut, A Mathematical Introduction to Compressive Sensing, §4.1, Definition 4.1
Bandeira, Ten Lectures and Forty-Two Open Problems in the Mathematics of Data Science, §6.3
Exact basis-pursuit recovery under the strict nullspace property
Statement
Let with and , and let satisfy the strict nullspace property of order . Use one-based coordinate labels , with coordinate identified with the library's coordinate . If has at most nonzero coordinates, then is the unique minimizer of over all satisfying . This is a noiseless exact-data result; it makes no exact-recovery or support-recovery assertion for noisy observations.
Statement references
Facts & Assumptions
Given: Integers , an integer , a matrix satisfying the strict nullspace property of order , and a vector with at most nonzero coordinates.
The strict nullspace property: for every nonzero and every with , .
The -norms for rational , and : for .
Each is a norm on , and the induced metrics are exactly , and of the published metric-spaces page: the p=1 formula is a norm on .
A norm on a real vector space, the induced metric, and the dictionary with the metric axioms: every norm satisfies the triangle inequality .
The strict nullspace property: under its coordinate relabeling, for each row .
Laws of finite sums and finite products: finite sums are additive, so for real lists.
Proof
Let , so . For any feasible , put . For each row , [F5] and [F6] give , so and . Hence [F1] gives .
By [F3], is a norm, so [F4] gives its triangle inequality. On , , hence . On , vanishes and , so with disjoint coordinate supports and . By step 1.1, this is strictly greater than . Thus every feasible vector distinct from has strictly larger objective, and , which is feasible, is the unique minimizer.
A uniform stability margin for the nullspace cone
Statement
Let with and , and let . Use one-based coordinate labels , with coordinate identified with the library's coordinate . Assume that for every nonzero with and every with . Then there is a constant such that for every with and every with . The estimate is only on the exact kernel and gives no bound for vectors with .
Statement references
Strict nullspace property and coordinate conventions
Finite-dimensional one-norm and Euclidean norm
The Euclidean inner product and norm
Norm properties of finite-dimensional p-norms
Continuity of finite-dimensional norms
A finite set of real numbers has a maximum
Cauchy–Schwarz for the Euclidean inner product
Facts & Assumptions
Given: Integers , , a matrix satisfying the strict nullspace inequalities in the Statement, and .
The strict nullspace property: for every nonzero and every with , , where is zero outside .
Each is a norm on , and the induced metrics are exactly , and of the published metric-spaces page: both and are norms on , and for .
A norm on a real vector space, the induced metric, and the dictionary with the metric axioms: a norm satisfies absolute homogeneity, .
The finite and reverse triangle inequalities for a norm; and for every norm on satisfies and is Lipschitz, hence continuous, for : every norm on is continuous for the Euclidean metric.
For a nonempty subset of with , compactness, closedness and boundedness, pseudocompactness, and attainment of extrema by every continuous real-valued function are equivalent: closed bounded subsets of are compact, and continuous real-valued functions on nonempty compact subsets attain their maxima; this result is choice-free.
Every nonempty finite set of reals has a maximum and a minimum: every nonempty finite set of real numbers has a maximum.
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.
The strict nullspace property: under its coordinate relabeling, for each row .
The Euclidean inner product on : for the row vector with coordinates , .
Laws of finite sums and finite products: additivity and scalar multiplication of finite sums give .
Squaring is monotone on the nonnegatives: for nonnegative reals , if and only if .
Proof
If , choose . The only is zero, so both sides of the required inequality are zero for every . Now suppose and define . This set is nonempty by normalizing a nonzero kernel vector, since [F5] makes its norm positive. To show is closed, fix . If , choose a row with and let be that row as a vector in . By [F11], [F12], and [F13], and . By [F4], . Moreover, : otherwise [F5] gives , which would imply . Thus , and whenever we have , so and . If , then ; put . By [F14], , so precludes and again . Hence every point outside has a ball disjoint from , so is closed. It is bounded because every has and [F5] identifies this with its Euclidean distance from . By [F8], is compact.
Fix with and define by and . For all and every coordinate , ; both sides are nonnegative, so the forward implication in [F15] and then [F10] give . Both Euclidean norms are nonnegative by [F5], so the converse implication in [F15] yields . The same argument applies to , making both coordinate projections -Lipschitz, hence continuous for . Since is a norm by [F5] and every norm on is continuous for by [F7], the compositions and are continuous. For each , [F1] gives , hence . To verify continuity of at any , put and . Continuity of gives a neighborhood of in on which . There, by splitting the difference of the two quotients. The right side tends to as , since and are continuous; thus is continuous on . By [F8] it attains a maximum on , and [F1] at a maximizing point gives .
There are finitely many sets with , and this family is nonempty because it contains . Therefore [F9] gives . Choose any and a coordinate with ; then is admissible because , and [F2] gives , so . Set ; then .
Let . If , the required inequality is immediate. Otherwise belongs to . For every admissible , [F6] gives , so . This proves the estimate with one constant for all and all kernel vectors.
4 · Examples, counterexamples and false statements
None yet.
Sources
- Simon Foucart and Holger Rauhut, A Mathematical Introduction to Compressive Sensing, §4.1, Definition 4.1
- Afonso S. Bandeira, Ten Lectures and Forty-Two Open Problems in the Mathematics of Data Science, §6.3
- Simon Foucart and Holger Rauhut, A Mathematical Introduction to Compressive Sensing, §4.1, Theorems 4.4–4.5
- Simon Foucart and Holger Rauhut, A Mathematical Introduction to Compressive Sensing, §4.2, Definition 4.11 and Remark 4.16