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 worked QR factorisation of an invertible real matrix
Example
The invertible matrix
has the QR factorisation
Facts & Assumptions
Given: The displayed real matrix .
QR factorisation applies Gram–Schmidt to the columns and requires an upper-triangular factor with positive diagonal (Every invertible real or complex square matrix has a unique factorisation with orthogonal or unitary and upper triangular with positive real diagonal).
The standard real inner product is the dot product (The standard formulas on and on are inner products).
Gram–Schmidt preserves successive spans while normalising orthogonal residuals (Gram–Schmidt turns every finite independent list into an orthonormal list with the same successive spans).
Verification
The columns are and . By [L2]–[L3], , while normalises to .
The coefficients are , , and , with . Thus is upper triangular with positive diagonal.
Direct multiplication gives , and . This verifies the displayed QR factorisation.
Depends on
- Every invertible real or complex square matrix has a unique factorisation $A=QR$ with $Q$ orthogonal or unitary and $R$ upper triangular with positive real diagonal
- The standard formulas $\langle x,y\rangle=\sum_{k<n}x_k y_k$ on $\mathbb R^n$ and $\sum_{k<n}x_k\overline{y_k}$ on $\mathbb C^n$ are inner products
- Gram–Schmidt turns every finite independent list into an orthonormal list with the same successive spans
Used by
Nothing in the library uses this result yet.
Dependency tree · next 3 levels
Direct dependencies and their dependencies through the next three levels: 54 results over 14 levels. An arrow runs from a result to what uses it, and this result sits at the bottom with a heavier outline. Click the chart to enlarge it.