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 full-column-rank real matrix has an economy QR factorization
Statement
Let and let have full column rank. Then there are matrices and such that
where and is upper triangular with positive diagonal. The columns of can be completed to an orthonormal basis of , with . For , one has .
Facts & Assumptions
Given: Integers and a full-column-rank matrix .
Every subspace of a finite-dimensional inner-product space has an orthogonal decomposition . For a subspace of a finite-dimensional inner product space,
Every finite-dimensional real or complex inner-product space has an orthonormal basis. Every finite-dimensional real or complex inner product space has an orthonormal basis
Every invertible square real matrix has a factorization with orthogonal and upper triangular 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
A subspace of a finite-dimensional vector space is finite-dimensional. If and is a linear subspace of , then is finite-dimensional, , and if and only if
The dimension of a finite direct sum of finite-dimensional subspaces is the sum of their dimensions. If with every finite-dimensional, then is finite-dimensional and ; in particular
Proof
Given: The hypotheses in the Statement.
Let . The columns of are a basis of , so . By [F1], . Since is a subspace of the finite-dimensional space , [F4] makes it finite-dimensional; [F5] then gives , so . By [F2], choose an orthonormal basis of and index its vectors as . The columns of form a basis of : their -part spans , their remaining part spans , and the direct sum in [F1] makes the union linearly independent. Thus is invertible.
Apply [F3] to write , where is orthogonal and is upper triangular with positive diagonal. Let be the first columns of , let be its remaining columns, and let be the leading block of . Because when , every entry below row in its first columns is zero. The first columns of are therefore . The matrix is upper triangular with positive diagonal, while gives and the required orthonormal completion.
Since is invertible, and . Hence , because .
Depends on
- For a subspace $W$ of a finite-dimensional inner product space, $V=W\oplus W^\perp$
- Every finite-dimensional real or complex inner product space has an orthonormal basis
- If $\dim_F V = n$ and $U$ is a linear subspace of $V$, then $U$ is finite-dimensional, $\dim_F U \le n$, and $\dim_F U = n$ if and only if $U = V$
- If $V = \bigoplus_{i<n} U_i$ with every $U_i$ finite-dimensional, then $V$ is finite-dimensional and $\dim_F V = \sum_{i<n} \dim_F U_i$; in particular $\dim_F(U \oplus W) = \dim_F U + \dim_F W$
- 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
Used by
Dependency tree · two levels
43 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
- Dmitry Panchenko, MIT 18.443 Statistics for Applications, Fall 2006, Section 15: Multiple Linear Regression, PDF pp. 2–4 (standard reference, not scraped)
- Charlotte Wickham, Statistics: Lecture Three — Linear Models, PDF pp. 3–4 (standard reference, not scraped)