Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passjudge pass (gpt-6-luna)
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 n>p≥1 and let X∈Rn×p have full column rank. Then there are matrices Q∈Rn×p and R∈Rp×p such that

X=QR,

where QTQ=Ip and R is upper triangular with positive diagonal. The columns of Q can be completed to an orthonormal basis [Q Q0] of Rn, with Q0∈Rn×(n−p). For PX:=X(XTX)−1XT, one has PX=QQT.

Facts & Assumptions

Given: Integers n>p≥1 and a full-column-rank matrix X∈Rn×p.

[F1]

Every subspace W of a finite-dimensional inner-product space V has an orthogonal decomposition V=W⊕W⊥. For a subspace W of a finite-dimensional inner product space, V=W⊕W⊥

[F2]

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

[F3]

Every invertible square real matrix A has a factorization A=UT with U orthogonal and T upper triangular with positive diagonal. 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

Proof

Given: The hypotheses in the Statement.

1.1givenF1F2F4F5choosealgebra

Let W=col⁡X. The columns of X are a basis of W, so dim⁡W=p. By [F1], Rn=W⊕W⊥. Since W⊥ is a subspace of the finite-dimensional space Rn, [F4] makes it finite-dimensional; [F5] then gives n=dim⁡W+dim⁡W⊥, so dim⁡W⊥=n−p. By [F2], choose an orthonormal basis of W⊥ and index its n−p vectors as zp+1,…,zn. The columns of A=[X zp+1 ⋯ zn] form a basis of Rn: their X-part spans W, their remaining part spans W⊥, and the direct sum in [F1] makes the union linearly independent. Thus A is invertible.

2.1step 1.1F3algebra

Apply [F3] to write A=UT, where U is orthogonal and T is upper triangular with positive diagonal. Let Q be the first p columns of U, let Q0 be its remaining columns, and let R be the leading p×p block of T. Because Tij=0 when i>j, every entry below row p in its first p columns is zero. The first p columns of A are therefore X=QR. The matrix R is upper triangular with positive diagonal, while U=[Q Q0] gives QTQ=Ip and the required orthonormal completion.

3.1step 2.1algebra∎

Since R is invertible, XTX=RTR and (XTX)−1=R−1R−T. Hence PX=QR(RTR)−1RTQT=QQT, because R(RTR)−1RT=Ip.

Depends on

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