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.
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
Depends on
Used by
- Best s-term ℓ1 approximation error Definition
- The ℓ2 robust nullspace property Definition
- A nontrivial three-column matrix with the nullspace property Example
- A two-column matrix where basis pursuit is not unique Example
- Identity design: noiseless recovery and a noisy minimax lower bound Example
- A block-tail estimate for the largest coordinates Lemma
- A feasible finite-dimensional BPDN problem attains its minimum Lemma
- A uniform stability margin for the nullspace cone Lemma
- Exact basis-pursuit recovery under the strict nullspace property Theorem
Dependency tree · two levels
24 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.
Sources
- Simon Foucart and Holger Rauhut, A Mathematical Introduction to Compressive Sensing, §4.1, Definition 4.1 (standard reference, not scraped)
- Afonso S. Bandeira, Ten Lectures and Forty-Two Open Problems in the Mathematics of Data Science, §6.3 (standard reference, not scraped)