Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-generatedPipeline-generatedjudge 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.

The QR and polar maps are first-order Stiefel and Grassmann retractions

Statement

On the full-column-rank domains of QR and polar retractions on Stiefel and Grassmann, the positive-diagonal QR and polar maps are smooth, take values in St⁡(n,r), fix η=0, and have differential DRX(0)[η]=η. Their induced Grassmann maps are independent of the representative and have identity differential under the horizontal tangent identification. Thus they are first-order retractions. This theorem makes no second-order claim; in particular, the QR map need not be second order.

Facts & Assumptions

Given: X∈St⁡(n,r), the full-rank formulas of QR and polar retractions on Stiefel and Grassmann, and η∈TXSt⁡(n,r).

[F1]

The retraction maps are the positive-diagonal QR factor and the polar factor of X+η (QR and polar retractions on Stiefel and Grassmann).

[F2]

Tangency is characterized by XTη+ηTX=0 (Tangent spaces and Frobenius projections on Stiefel and Grassmann).

[F3]

Gram–Schmidt constructs an orthonormal basis on the full-rank domain (Gram–Schmidt turns every finite independent list into an orthonormal list with the same successive spans).

[F4]

The positive square root depends smoothly on a positive-definite matrix (Positive-definite bundle endomorphisms have smooth positive square roots).

[F5]

Matrix inversion preserves Ck regularity on the nonvanishing-determinant domain (Matrix inversion preserves Ck regularity where the determinant is nonzero).

Proof

technique · differentiate each matrix factorization at the zero tangent vector
1.1F1F3F4F5given

On the full-rank set, the Gram–Schmidt recurrences divide only by positive residual norms, so [F3] expresses the QR factors by smooth additions, products, divisions by nonzero functions, and positive square roots. The polar formula is smooth there by [F4], [F5] applied to its positive-definite Gram matrix, and smooth matrix multiplication. Both maps land in Stiefel by [F1]. At η=0, the factorizations are X=XIr, so each map returns X.

1.2F1F2F4F5givenalgebra

For the polar map, Y(t)TY(t)=Ir+t2ηTη by [F2]. Its inverse square root equals Ir+O(t2) by smoothness in [F4] and [F5] and its value Ir at Ir. Consequently RXpol(tη)=X+tη+O(t2), so its derivative at zero is η.

2.1F1F2step 1.1algebra

Set Y(t)=X+tη and write its positive-diagonal QR factorization as Y(t)=Q(t)R(t). By step 1.1, Q,R are differentiable near zero; Q(0)=X, R(0)=Ir. Put W=Q′(0) and U=R′(0), so η=W+XU and U is upper triangular. Differentiating Q(t)TQ(t)=Ir shows XTW is skew-symmetric. By [F2], XTη is skew-symmetric; hence U=XTη−XTW is skew-symmetric as well. A real matrix both upper triangular and skew-symmetric is zero, so U=0 and W=η.

3.1F1step 2.1step 1.2algebra∎

Under (X,η)↦(XQ0,ηQ0), the inputs X+η and (X+η)Q0 have the same column space. Their QR outputs may differ as frames, but induce the same Grassmann point; the polar output transforms by Q0. Differentiating the induced maps therefore gives the same horizontal class of η, which is the identity on the quotient tangent space.

Depends on

Used by

Dependency tree · two levels

23 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