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.
A four-row tridiagonal matrix in CSR form
Example
Let have diagonal entries , entries immediately above and below the diagonal, and all other entries . A CSR record for is
This record stores entries and has no empty row, duplicate column, or explicit zero.
Facts & Assumptions
Given: The displayed arrays and the zero-based CSR convention.
Compressed sparse row matrices with stored-entry semantics: the row pointers delimit each row's stored-index interval, and each stored value contributes to the matrix entry at its row and column index.
The rationals form a field: the rational numbers with their standard operations form a field.
Verification
The row-pointer array has length , starts at , ends at , and is nondecreasing. Every listed column index lies in , so the data satisfy the CSR invariants for a by matrix.
Row uses columns with values ; row uses columns with values ; row uses columns with values ; row uses columns with values . These rational sums are the specified entries of , so the record represents .
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
9 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
- Yousef Saad, Iterative Methods for Sparse Linear Systems, 2nd ed., Chapter 3 §3.4, printed pp. 92–94 (standard reference, not scraped)
- David Bindel, Matrix Computations (CS 6210), Cornell University, Fall 2012, Lecture 32, The 1D model problem, p. 1 (standard reference, not scraped)