Alphabeta Math
Pipeline-generated
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.

Riemannian optimization on stiefel and grassmann manifolds

1 · Prerequisites

2 · Summary

This page develops first-order geometry and optimization for real orthonormal frames and their Grassmann quotient, plus the complex Grassmann geometry needed for Hermitian projector models. It fixes the real Frobenius metric on complex coordinates, proves tangent and projected-gradient formulas, and gives exact-domain real QR and polar retractions, a complex polar retraction, and projected real Stiefel/Grassmann vector transport. The algorithm entries define finite-budget retraction Armijo and an OPT3-matched real or complex Grassmann trust-region method. The complexity results prove Armijo and trust-region first-order O(ε−2) bounds under their stated pullback regularity and subproblem conditions; the trust-region count includes accepted and rejected outer trials.

Grassmann objectives must be invariant under changes of orthonormal frame. Finite search or subproblem budgets can return failure and carry no unconditional success guarantee. The trust-region result is first-order; no second-order complexity claim is made here. The complex model treats complex matrix spaces as real vector spaces with metric Re⁡tr⁡(U∗V).

3 · Logical flowchart

4 · Definitions, theorems and proofs

DefinitionDefinition: Literature-sourcedProof: AI-generatedOpen item page →

Real Stiefel and Grassmann optimization conventions

Definition

For integers 1≤r≤n, the real Stiefel manifold is St⁡(n,r):={X∈Rn×r:XTX=Ir}. The real Grassmannian Gr⁡(r,n) is the set of r-dimensional linear subspaces of Rn, identified with the quotient of St⁡(n,r) by the right action X↦XQ of O⁡(r). A frame X represents the subspace [X]=range⁡(X).

On matrix spaces use the Frobenius inner product ⟨U,V⟩F=tr⁡(UTV). Give Stiefel its induced metric. On the Grassmann quotient use the quotient metric: identify a tangent vector at [X] with its unique horizontal representative Z satisfying XTZ=0, and pair horizontal representatives by the Frobenius inner product. A Grassmann formula written with a frame representative must be unchanged under (X,Z)↦(XQ,ZQ) for Q∈O⁡(r).

For a square real matrix M, set sym⁡(M)=(M+MT)/2.

Facts & Assumptions

Given: Integers 1≤r≤n and the real matrix spaces with their Euclidean topology.

[F1]

The right action of O⁡(r) on orthonormal frames changes frame but not the represented subspace, and its quotient is the Grassmannian (Stiefel spaces, Grassmannians, and tautological bundles).

[F2]

A Riemannian metric is a smooth symmetric positive-definite bilinear form on each tangent space (Riemannian metric and riemannian manifold).

[F3]

The Euclidean inner product on a finite real coordinate space is the sum of coordinatewise products (The Euclidean inner product ⟨x,y⟩=∑k<nxkyk on Rn).

[F4]

A Grassmannian point is an r-dimensional subspace of the ambient vector space (The Grassmannian of r-dimensional subspaces of a finite-dimensional vector space).

Proof

technique · direct verification of the metric convention
1.1givenF2F3algebra

For any real matrix U, ⟨U,U⟩F=∑i,jUij2, so this pairing is symmetric bilinear and positive for every nonzero U by [F3]. Its restriction to each tangent or horizontal subspace is therefore a positive-definite inner product, as required by [F2].

1.2F1givenalgebra

In a local Grassmann graph chart, choose a smooth orthonormal frame section X(u) from the local frame-bundle trivialization in [F1], and set P(u)=X(u)X(u)T. For a chart tangent v, differentiating X(u)TX(u)=I gives A=X(u)TDXu[v] skew-symmetric. The first term X(u)A is vertical: for every skew-symmetric A, the Cayley curve Q(t)=(Ir−t2A)−1(Ir+t2A) satisfies Q(t)TQ(t)=Ir near zero and Q(t)=Ir+tA+O(t2). Thus Z=(I−X(u)X(u)T)DXu[v] is the unique horizontal representative of v. Then DPu[v]=ZX(u)T+X(u)ZT. For horizontal Z,W, direct expansion gives 12⟨ZXT+XZT,WXT+XWT⟩F=⟨Z,W⟩F. Thus the quotient pairing has smooth coefficients in every graph chart. In a local product chart of the frame bundle, matrix entries vary smoothly, so the ambient Frobenius pairing has smooth coefficients on Stiefel as well.

2.1F1F4givenalgebra∎

By [F4], each frame represents an r-dimensional subspace, and [F1] identifies frames representing the same subspace by the right orthogonal action. For QTQ=Ir, cyclicity of trace gives ⟨UQ,VQ⟩F=tr⁡(QTUTVQ)=tr⁡(UTV). Thus the action is isometric and the horizontal pairing is independent of the chosen orthonormal frame.

DefinitionDefinition: Literature-sourcedProof: AI-generatedjudge pass (gpt-6-luna)Open item page →

Complex Stiefel and Grassmann optimization conventions

Definition

For 1≤r≤n, set St⁡C(n,r)={X∈Cn×r:X∗X=Ir} and Gr⁡C(r,n)=St⁡C(n,r)/U⁡(r). The class [X] represents the complex column space of X; two orthonormal frames represent the same space exactly when they differ by right multiplication by a unitary r×r matrix. Regard each complex matrix space as a real vector space and use the real Frobenius inner product ⟨U,V⟩R:=Re⁡tr⁡(U∗V). Give the complex Stiefel manifold its induced metric. On the complex Grassmann quotient, represent tangent vectors horizontally by matrices Z with X∗Z=0 and pair these representatives by ⟨⋅,⋅⟩R. For A=A0+iA1∈Cn×r, write ρ(A):=(A0−A1A1A0)∈R2n×2r for its realification, the real matrix acting on real/imaginary coordinates as A acts on complex coordinates. Write Herm⁡(A)=(A+A∗)/2.

Facts & Assumptions

Given: Integers 1≤r≤n and complex matrix spaces with their usual real-coordinate topology.

[F1]

A Riemannian metric is a smooth positive-definite real bilinear pairing on each tangent space (Riemannian metric and riemannian manifold).

[F2]

The coordinatewise product on a finite real coordinate space is its Euclidean inner product (The Euclidean inner product ⟨x,y⟩=∑k<nxkyk on Rn).

[F3]

Complex Stiefel frames are quotiented by the right unitary action, and graph charts give the Grassmannian's local coordinates (Stiefel spaces, Grassmannians, and tautological bundles).

Proof

technique · identify complex matrices with pairs of real matrices and verify the quotient pairing
1.1F1F2givenalgebra

Write U=A+iB and V=C+iD with real matrices. For z=x+iy, ρ(U)(x,y)=(Ax−By,Bx+Ay), the real and imaginary parts of Uz; hence ρ(UV)=ρ(U)ρ(V), ρ(U)T=ρ(U∗), and, when U is invertible, ρ(U−1)=ρ(U)−1. Also ⟨U,V⟩R=tr⁡(ATC+BTD), the ordinary Euclidean inner product on the real and imaginary coordinates. It is real bilinear, symmetric, and positive on nonzero matrices by [F2]; its restriction to each real tangent space is positive definite, as required by [F1].

1.2F1F2F3givenalgebra

In a local complex Grassmann graph chart, choose a smooth orthonormal frame section X(u) from the frame-bundle trivialization in [F3], and set P(u)=X(u)X(u)∗. For a chart tangent v, differentiating X(u)∗X(u)=I makes A=X(u)∗DXu[v] skew-Hermitian. The first term X(u)A is vertical: for every skew-Hermitian A, the Cayley curve Q(t)=(Ir−t2A)−1(Ir+t2A) satisfies Q(t)∗Q(t)=Ir near zero and Q(t)=Ir+tA+O(t2). Thus the horizontal component Z=(I−X(u)X(u)∗)DXu[v] is the unique representative of v. Then DPu[v]=ZX(u)∗+X(u)Z∗. For horizontal Z,W, direct expansion gives 12Re⁡tr⁡((ZX∗+XZ∗)∗(WX∗+XW∗))=Re⁡tr⁡(Z∗W). Hence the quotient pairing has smooth coefficients in every graph chart. In a local product chart of the frame bundle, matrix entries vary smoothly, so the ambient real Frobenius pairing has smooth coefficients on the complex Stiefel space as well.

2.1F3givenstep 1.1algebra∎

The complex frame quotient and its local graph charts are those of [F3]. For unitary Q, cyclicity of trace and QQ∗=I give ⟨UQ,VQ⟩R=Re⁡tr⁡(Q∗U∗VQ)=Re⁡tr⁡(U∗V). Thus the right unitary action is isometric, and the Frobenius pairing of horizontal representatives is independent of the chosen orthonormal frame.

PropositionStatement: Literature-sourcedProof: AI-generatedOpen item page →

Finite-dimensional Stiefel and Grassmann manifolds are compact

Statement

For 1≤r≤n, St⁡(n,r) is a nonempty closed bounded subset of Rn×r, and Gr⁡(r,n) is compact as its continuous quotient image. Hence both spaces are compact.

Facts & Assumptions

Given: Integers 1≤r≤n and the Stiefel and quotient definitions of Real Stiefel and Grassmann optimization conventions.

[F2]

The quotient map q:X↦[X] is continuous for the quotient topology and is surjective by the quotient definition in the real conventions.

Proof

technique · Heine–Borel followed by the open-cover definition of quotient compactness
1.1givenF1algebra

The equations XTX=Ir are polynomial equations in the entries, so their common zero set is closed. Also ∥X∥F2=tr⁡(XTX)=r, so the set is bounded. The matrix with columns e1,…,er belongs to it, so it is nonempty.

2.1F1F2step 1.1choose

Let U be any open cover of Gr⁡(r,n). By [F2], the sets q−1(U) for U∈U are open in St⁡(n,r) and cover it. Compactness from step 1.1 gives U1,…,Uk∈U whose preimages cover St⁡(n,r). Since q is surjective, U1,…,Uk cover Gr⁡(r,n). Thus the quotient is compact directly from the open-cover definition.

3.1step 1.1step 2.1∎

Step 1.1 proves compactness of St⁡(n,r) and step 2.1 proves compactness of Gr⁡(r,n), as claimed.

PropositionStatement: Literature-sourcedProof: AI-generatedjudge pass (gpt-6-luna)Open item page →

Finite-dimensional complex Stiefel and Grassmann manifolds are compact

Statement

For 1≤r≤n, St⁡C(n,r) is a nonempty closed bounded subset of the real coordinate space R2nr, and Gr⁡C(r,n) is its continuous quotient image. Both spaces are compact.

Facts & Assumptions

Given: 1≤r≤n and the complex Stiefel and quotient definitions of Complex Stiefel and Grassmann optimization conventions.

[F1]

Complex matrix entries are real and imaginary coordinates in a finite-dimensional real Euclidean space (Complex Stiefel and Grassmann optimization conventions).

[F3]

The quotient map q:X↦[X] is continuous for the quotient topology and is surjective by the complex quotient definition.

Proof

technique · apply Heine–Borel to the frame constraint and pull back arbitrary open covers along the quotient map
1.1F1givenalgebra

The map X↦X∗X is continuous in the real and imaginary coordinates, so its inverse image of the closed singleton {Ir} is closed. Also ∥X∥F2=tr⁡(X∗X)=r on this set, so it is bounded. The frame [e1 ⋯ er] shows it is nonempty.

2.1F1F2F3givenstep 1.1choose

Let U be any open cover of Gr⁡C(r,n). By [F3], the sets q−1(U) for U∈U are open in St⁡C(n,r) and cover it. Compactness from step 1.1 gives U1,…,Uk∈U whose preimages cover St⁡C(n,r). Surjectivity of q then makes U1,…,Uk a cover of Gr⁡C(r,n). Thus the quotient is compact directly from the open-cover definition.

3.1F1F2F3step 1.1step 2.1∎

Step 1.1 proves compactness of St⁡C(n,r) and step 2.1 proves compactness of Gr⁡C(r,n), as claimed.

TheoremStatement: Literature-sourcedProof: AI-generatedOpen item page →

Tangent spaces and Frobenius projections on Stiefel and Grassmann

Statement

For X∈St⁡(n,r), the tangent space and its Frobenius orthogonal projection are TXSt⁡(n,r)={Z:XTZ+ZTX=0},ΠXSt(G)=G−Xsym⁡(XTG). For [X]∈Gr⁡(r,n), its tangent vectors have unique horizontal representatives Z with XTZ=0, and the quotient-metric projection of an ambient G to this horizontal space is ΠXGr(G)=(I−XXT)G.

Facts & Assumptions

Given: 1≤r≤n, XTX=Ir, and the Frobenius metrics of Real Stiefel and Grassmann optimization conventions.

[F1]

The Stiefel constraint map is F(X)=XTX−Ir, and the Grassmannian is the quotient of orthonormal frames by the right orthogonal action (Stiefel spaces, Grassmannians, and tautological bundles).

[F2]

At a regular level, the tangent space is the kernel of the differential (The tangent space of a regular level set is the kernel).

Proof

technique · differentiate the Stiefel constraint and orthogonally decompose matrices
1.1F1F2givenalgebra

The derivative of F at X is DFX[Z]=XTZ+ZTX. It is onto the symmetric matrices because for any symmetric H, the choice Z=XH/2 gives DFX[Z]=H. Thus 0 is a regular value; [F2] identifies the tangent space with the displayed kernel.

2.1givenstep 1.1algebra

Write S=sym⁡(XTG). Then XT(G−XS)+(G−XS)TX=0, so G−XS is tangent. For every symmetric H and tangent Z, ⟨XH,Z⟩F=tr⁡(HXTZ)=0 because XTZ is skew-symmetric. Hence XS is normal and G−XS is the orthogonal projection.

2.2F1givenstep 1.1algebra

A curve Q(t) in O⁡(r) through Ir has Ω=Q′(0) skew-symmetric by differentiating Q(t)TQ(t)=Ir. Conversely, for any skew-symmetric Ω, the Cayley curve Q(t)=(Ir−t2Ω)−1(Ir+t2Ω) is defined near zero, satisfies Q(t)TQ(t)=Ir, and has Q(t)=Ir+tΩ+O(t2); hence the vertical tangent directions are exactly XΩ. Every Stiefel tangent Z decomposes as Z=XΩ+(I−XXT)Z, where Ω=XTZ is skew and the second term is horizontal. These summands are orthogonal, so the quotient tangent is represented uniquely by the horizontal summand.

3.1F1givenstep 2.2algebra∎

The matrix (I−XXT)G is horizontal. For every horizontal Z, ⟨G−(I−XXT)G,Z⟩F=⟨XXTG,Z⟩F=0, since XTZ=0. Therefore it is the quotient-metric projection. Under X↦XQ and G↦GQ it becomes (I−XXT)GQ, the same tangent vector in the changed representative.

TheoremStatement: Literature-sourcedProof: AI-generatedjudge pass (gpt-6-luna)Open item page →

Complex Stiefel and Grassmann tangent projections

Statement

For X∈St⁡C(n,r), as a real manifold, TXSt⁡C(n,r)={Z:X∗Z+Z∗X=0} and ΠXSt(G)=G−XHerm⁡(X∗G). The complex Grassmann tangent has the unique horizontal representative X∗Z=0, and its quotient-metric projection is ΠXGr(G)=(I−XX∗)G.

Facts & Assumptions

Given: 1≤r≤n, X∗X=Ir, and the real Frobenius metrics of Complex Stiefel and Grassmann optimization conventions.

[F1]

The Stiefel frame set is the level set of X↦X∗X−Ir, and the Grassmann space is its quotient by the right unitary action (Complex Stiefel and Grassmann optimization conventions).

[F2]

The tangent of a regular level set is the kernel of the level-map differential (The tangent space of a regular level set is the kernel).

[F3]

The complex Grassmann quotient has graph charts, and its frame bundle has right unitary fibers (Stiefel spaces, Grassmannians, and tautological bundles).

Proof

technique · differentiate the Hermitian constraint and orthogonally decompose into vertical, horizontal, and normal components
1.1F1F2givenalgebra

Regard the Hermitian r×r matrices as a real vector space. The derivative of F(X)=X∗X−Ir is DFX[Z]=X∗Z+Z∗X. It is onto that space: for any Hermitian H, Z=XH/2 gives DFX[Z]=H. Hence the level is regular, and [F2] gives the displayed tangent kernel.

2.1givenstep 1.1algebra

Set S=Herm⁡(X∗G). Then X∗(G−XS)+(G−XS)∗X=0, so G−XS is tangent. For tangent Z, put K=X∗Z, which is skew-Hermitian. For Hermitian S, tr⁡(SK)‾=−tr⁡(SK) by adjoint and cyclic-trace identities; thus Re⁡tr⁡(SK)=0. Therefore XS is normal in the real Frobenius metric, and the stated formula is the Stiefel orthogonal projection.

2.2F1F3givenstep 1.1algebra

A curve Q(t) in U⁡(r) through Ir has Ω=Q′(0) skew-Hermitian by differentiating Q(t)∗Q(t)=Ir. Conversely, for any skew-Hermitian Ω, the Cayley curve Q(t)=(Ir−t2Ω)−1(Ir+t2Ω) is defined near zero, satisfies Q(t)∗Q(t)=Ir, and has Q(t)=Ir+tΩ+O(t2); hence the vertical tangent directions are exactly XΩ. Every Stiefel tangent decomposes as Z=XΩ+(I−XX∗)Z with Ω=X∗Z. The second summand is horizontal. For any vertical XΩ and horizontal W, ⟨XΩ,W⟩R=Re⁡tr⁡(Ω∗X∗W)=0, so the summands are orthogonal. The decomposition is unique, and the graph-chart quotient identifies its horizontal component with the quotient tangent.

3.1F1givenstep 2.2algebra∎

The matrix (I−XX∗)G is horizontal. For every horizontal Z, ⟨G−(I−XX∗)G,Z⟩R=Re⁡tr⁡((XX∗G)∗Z)=Re⁡tr⁡(G∗XX∗Z)=0 since X∗Z=0. Thus it is the horizontal orthogonal projection. Under (X,G)↦(XQ,GQ) for unitary Q, it transforms to (I−XX∗)GQ, the same tangent vector in the changed frame.

PropositionStatement: Literature-sourcedProof: AI-generatedOpen item page →

Projected Euclidean gradients are the Stiefel and Grassmann gradients

Statement

Let F be smooth on an open neighborhood of St⁡(n,r), and write G=∇F(X) for its Euclidean gradient. Its restriction to Stiefel has Riemannian gradient G−Xsym⁡(XTG). If F(XQ)=F(X) for every Q∈O⁡(r), it descends to a smooth Grassmann objective and its gradient has horizontal representative (I−XXT)G. In either metric, gradient zero is equivalent to a critical point of the restricted objective.

Facts & Assumptions

Given: 1≤r≤n, a smooth ambient F, X∈St⁡(n,r), and, for the Grassmann conclusion, right-orthogonal invariance.

[F1]

The Frobenius projections to Stiefel and Grassmann tangent representatives are the formulas in Tangent spaces and Frobenius projections on Stiefel and Grassmann.

[F2]

A Riemannian gradient is the metric dual of the differential (The Riemannian gradient is the metric dual of the differential).

[F3]

Right multiplication by an orthogonal matrix changes the frame representative but not its subspace (Stiefel spaces, Grassmannians, and tautological bundles).

[F4]

The Jacobian definition gives the coordinate partial derivatives of F as the entries of G=∇F(X) (The Jacobian matrix of partial derivatives and the gradient in the scalar-valued case); for a smooth F, its differential is linear and its value on a coordinate-basis matrix is the corresponding partial derivative.

[F5]

The Riemannian gradient vanishes exactly at critical points of a smooth function (The Riemannian gradient vanishes exactly at the critical points).

[F6]

The Frobenius pairing is the Euclidean coordinate inner product on matrix entries (The Euclidean inner product ⟨x,y⟩=∑k<nxkyk on Rn).

Proof

technique · identify the metric dual by orthogonal projection
1.1F1F2F4F6givenalgebra

Let Eij be the coordinate-basis matrices. Smoothness of F makes dFX linear, and by the definition in [F4], dFX[Eij]=∂ijF(X)=Gij. Expanding Z=∑i,jZijEij therefore gives dFX[Z]=∑i,jGijZij=⟨G,Z⟩F. Restriction to Stiefel has this same differential on tangent vectors. By [F1], ΠXStG is tangent and G−ΠXStG is normal, hence ⟨ΠXStG,Z⟩F=⟨G,Z⟩F. The metric-dual characterization [F2] proves the Stiefel formula.

1.2F3givenalgebra

Invariance and [F3] make f([X])=F(X) well-defined. The graph charts for the quotient in [F3] provide smooth local frame sections; in each chart, f is the composition of F with such a section and is therefore smooth. For each skew-symmetric Ω, the Cayley curve Q(t)=(Ir−t2Ω)−1(Ir+t2Ω) satisfies Q(t)TQ(t)=Ir near zero by direct multiplication and has Q(t)=Ir+tΩ+O(t2). Invariance makes F(XQ(t)) constant, so dFX[XΩ]=0 for every vertical tangent; consequently the differential descends to horizontal representatives.

2.1F1F2F4F5F6givenstep 1.2∎

For a horizontal Z, the descended differential is ⟨G,Z⟩F by [F4] and [F6]. By [F1], (I−XXT)G is horizontal and its difference from G is orthogonal to every horizontal Z, so it is the metric dual on the quotient. [F5] gives the asserted equivalence between a zero gradient and criticality on each manifold.

DefinitionDefinition: Literature-sourcedProof: AI-generatedjudge pass (gpt-6-luna)Open item page →

Polar retraction on the complex Grassmannian

Definition

For X∈St⁡C(n,r) and horizontal η∈T[X]Gr⁡C(r,n), so X∗η=0, define RXpol(η)=(X+η)((X+η)∗(X+η))−1/2 and R[X]pol(η)=range⁡(RXpol(η)). The inverse square root is the inverse of the unique positive-definite Hermitian square root. The horizontal condition gives (X+η)∗(X+η)=I+η∗η≻0, so this map is defined for every horizontal tangent vector, and its frame representative is unchanged as a Grassmann point when (X,η) is replaced by (XQ,ηQ) with unitary Q.

Facts & Assumptions

Given: X∈St⁡C(n,r) and horizontal η as in Complex Stiefel and Grassmann tangent projections.

[F1]

A horizontal representative satisfies X∗η=0 (Complex Stiefel and Grassmann tangent projections).

[F2]

On a finite-dimensional real or complex inner-product space, a nonnegative operator has a unique nonnegative square root; for a positive-definite input its eigenvalues are the positive square roots of the input eigenvalues, so the root is positive definite and invertible (A non-negative operator has a unique non-negative square root).

[F3]

The complex Grassmannian is the quotient of complex orthonormal frames by right unitary changes of frame (Stiefel spaces, Grassmannians, and tautological bundles).

Proof

technique · verify full rank, orthonormality, and unitary equivariance of the polar formula
1.1F1F2givenalgebra

By [F1], (X+η)∗(X+η)=I+η∗η. For every nonzero v∈Cr, v∗(I+η∗η)v=∥v∥22+∥ηv∥22>0, so the Gram matrix is Hermitian positive definite. Apply [F2] on Cr: its unique nonnegative Hermitian square root has strictly positive eigenvalues and is invertible, which defines the inverse root in the formula.

2.1F2givenstep 1.1algebra

Write C=(X+η)∗(X+η) and Y=(X+η)C−1/2. Since C−1/2 is Hermitian and C−1/2CC−1/2=Ir, we have Y∗Y=Ir. Thus Y is a complex orthonormal frame and its range is a point of the stated Grassmannian.

3.1F1F3step 2.1algebra∎

By the quotient convention [F3], frames related by a unitary matrix represent the same point. For unitary Q, the Gram matrix of (XQ,ηQ) is Q∗CQ. Uniqueness of the positive square root gives (Q∗CQ)−1/2=Q∗C−1/2Q. Hence the resulting frame is YQ, with the same column space as Y.

TheoremStatement: Literature-sourcedProof: AI-generatedjudge pass (gpt-6-luna)Open item page →

The complex Grassmann polar map is a first-order retraction

Statement

The frame formula of Polar retraction on the complex Grassmannian is smooth on the horizontal tangent bundle, maps into St⁡C(n,r), fixes zero, and has frame differential DRXpol(0)[η]=η for horizontal η. It is right-unitary equivariant, so its range map is representative-independent and has identity differential under the horizontal tangent identification. Thus it is a first-order retraction on Gr⁡C(r,n).

Facts & Assumptions

Given: X∈St⁡C(n,r) and a horizontal tangent η at [X].

[F1]

The polar frame and quotient maps are given by the Gram inverse-square-root formula (Polar retraction on the complex Grassmannian).

[F2]

The positive square root depends smoothly on real symmetric positive-definite matrices, by applying the real bundle theorem to the trivial Euclidean bundle over that open matrix domain (Positive-definite bundle endomorphisms have smooth positive square roots).

[F3]

Horizontal matrices are the representatives of the complex Grassmann tangent (Complex Stiefel and Grassmann tangent projections).

[F4]

The complex Grassmannian has local graph charts and frame fibers related by right unitary changes (Stiefel spaces, Grassmannians, and tautological bundles).

[F5]

The realification ρ respects products and inverses, and matrix inversion preserves Ck regularity on the nonvanishing-determinant domain (Complex Stiefel and Grassmann optimization conventions, Matrix inversion preserves Ck regularity where the determinant is nonzero).

Proof

technique · differentiate the polar factor at zero and use unitary equivariance to descend to the quotient
1.1F1F2F5givenalgebra

The Gram matrix C(X,η)=I+η∗η is Hermitian positive definite by [F1]. Its realification ρ(C) is real symmetric because ρ(C)T=ρ(C∗)=ρ(C), and positive definite because, for z=x+iy, (x,y)Tρ(C)(x,y)=z∗Cz>0. The matrix ρ(C1/2) is real symmetric by the same transpose identity, squares to ρ(C) by [F5], and is positive definite by the same quadratic-form identity. Uniqueness of the positive square root and [F2] therefore make C1/2 smooth in real coordinates. It stays invertible, so [F5] applied to its realification makes its inverse smooth for every finite k, and that inverse is the realification of C−1/2. The frame formula and its range are smooth.

1.2F1F2F3F5givenalgebra

Fix horizontal η and set Y(t)=(X+tη)(I+t2η∗η)−1/2. The Gram factor has value I at zero and derivative zero there because its argument is I+t2η∗η and the inverse-root map is smooth by [F2] and [F5]. The product rule gives Y(0)=X and Y′(0)=η. By [F3], this is precisely identity on the quotient tangent.

2.1F1F3F4givenstep 1.2algebra∎

By [F4], the unitary-equivariant frame formula descends through the smooth Grassmann quotient. The definition's computation shows that replacing (X,η) by (XQ,ηQ) changes Y to YQ, leaving its range unchanged. Its identity differential from step 1.2 is therefore representative-independent.

PropositionStatement: Literature-sourcedProof: AI-generatedjudge pass (gpt-6-luna)Open item page →

Gradient of a unitary-invariant Hermitian projector energy

Statement

Let 1≤r≤n, and let E be real-valued and continuously differentiable on an open set of Hermitian n×n matrices containing the rank-r orthogonal projectors. Suppose its real Frobenius gradient K(P)=K(P)∗ satisfies DE(P)[H]=Re⁡tr⁡(K(P)∗H) for every Hermitian direction H. Then f([X])=E(XX∗) is well-defined on Gr⁡C(r,n) and has horizontal gradient grad⁡f([X])=2(I−XX∗)K(XX∗)X.

Facts & Assumptions

Given: The real differentiable Hermitian-matrix functional and gradient in the Statement, and X∈St⁡C(n,r).

[F1]

The frame quotient is by the right unitary action, and complex matrix spaces use the real Frobenius pairing (Complex Stiefel and Grassmann optimization conventions).

[F2]

The horizontal tangent projection is G↦(I−XX∗)G (Complex Stiefel and Grassmann tangent projections).

[F3]

A Riemannian gradient is the metric dual of the differential (The Riemannian gradient is the metric dual of the differential).

[F4]

Complex Grassmann has local graph charts and frame representatives related by right unitary maps (Stiefel spaces, Grassmannians, and tautological bundles).

[F5]

The complex polar retraction has frame differential DRX(0)[Z]=Z for horizontal Z (The complex Grassmann polar map is a first-order retraction).

Proof

technique · differentiate the projector map on horizontal directions, then project the ambient metric dual
1.1F1F4F5givenalgebra

For unitary Q, (XQ)(XQ)∗=XX∗, so E(XX∗) is independent of the representative. In the local graph charts [F4], it therefore defines a differentiable function f on the quotient. Let Y(t)=RXpol(tZ) and P(t)=Y(t)Y(t)∗. By [F5], Y(0)=X and Y′(0)=Z, so differentiating gives P(0)=P and P′(0)=ZX∗+XZ∗. Since E is defined on an open neighborhood of P, the chain rule gives the differential of f along this Grassmann curve.

2.1F1F2F3givenstep 1.1algebra∎

Using K=K∗, cyclicity of trace, and [F1], df[X][Z]=Re⁡tr⁡(K(ZX∗+XZ∗))=2Re⁡tr⁡((KX)∗Z)=⟨2KX,Z⟩R. The horizontal metric dual is the projection of 2KX. By [F2] it equals 2(I−XX∗)KX, which is the claimed gradient by [F3].

DefinitionDefinition: Literature-sourcedProof: AI-generatedOpen item page →

QR and polar retractions on Stiefel and Grassmann

Definition

For X∈St⁡(n,r) and η∈TXSt⁡(n,r), put Y=X+η. On the domain where Y has full column rank, let qf⁡(Y) be the Q factor in the unique reduced QR factorization Y=QR with R upper triangular and positive diagonal. Define the QR map by RXQR(η)=qf⁡(X+η). Define the polar map by RXpol(η)=(X+η)((X+η)T(X+η))−1/2, where the exponent denotes the inverse of the unique positive-definite square root. For a Grassmann tangent at [X], use its unique horizontal representative η satisfying XTη=0 and define the induced map by taking the output column space. Under X↦XQ, this representative changes to ηQ, so the input matrix changes to (X+η)Q. The polar formula is right-equivariant: RXQpol(ηQ)=RXpol(η)Q for every Q∈O⁡(r).

These are defined only where the displayed input is full rank. In fact, for a Stiefel tangent η, X+η always has full column rank, since ∥(X+η)v∥22=∥v∥22+∥ηv∥22 for every v∈Rr.

Facts & Assumptions

Given: X∈St⁡(n,r) and η∈TXSt⁡(n,r) as in Tangent spaces and Frobenius projections on Stiefel and Grassmann.

[F1]

Gram–Schmidt orthonormalization gives an orthonormal basis from a linearly independent ordered family (Gram–Schmidt turns every finite independent list into an orthonormal list with the same successive spans).

[F3]

Every positive-definite self-adjoint bundle endomorphism has a unique smooth positive square root (Positive-definite bundle endomorphisms have smooth positive square roots).

[F4]

A reduced QR factorization writes a full-column-rank matrix as an orthonormal-column factor times an upper-triangular factor (Full, reduced, and column-pivoted computational QR factorisations).

[F5]

A tangent matrix satisfies XTη+ηTX=0 (Tangent spaces and Frobenius projections on Stiefel and Grassmann).

[F6]

A Grassmann tangent has a unique horizontal representative, and changing the frame from X to XQ changes it from η to ηQ (Real Stiefel and Grassmann optimization conventions).

Proof

technique · verify the domains and orthonormality of both formulas
1.1F1F2F3F5givenalgebra

By [F5], tangency gives XTη+ηTX=0. Therefore for v≠0, ∥(X+η)v∥22=∥v∥22+vT(XTη+ηTX)v+∥ηv∥22=∥v∥22+∥ηv∥22>0. Thus X+η has full column rank. More generally, for any full-rank Y, vTYTYv=∥Yv∥22>0 for v≠0, so its Gram matrix is positive definite; [F1] supplies the QR factor, while [F2] diagonalizes the Gram matrix and [F3] supplies its positive square root and inverse.

2.1F1F2F3F4F6givenstep 1.1inductionalgebra∎

For full-column-rank Y=[y1 ⋯ yr], its columns are linearly independent. Apply Gram–Schmidt [F1], writing uj=yj−∑i<j(qiTyj)qi and qj=uj/∥uj∥2. The residuals are nonzero, so Q=[q1 ⋯ qr] has orthonormal columns. Set R=QTY. For i>j, qi is orthogonal to span⁡(y1,…,yj), so Rij=0; and Rjj=qjTyj=∥uj∥2>0. Since each yj lies in span⁡(q1,…,qj), QR=Y. This constructs a reduced QR factorization with positive diagonal. To check uniqueness, if Y=Q1R1=Q2R2 are two such factorizations, then Q2TQ1=R2R1−1 is orthogonal and upper triangular with positive diagonal. Its first column has only its first entry, which must be 1 by unit norm and positivity; orthogonality zeros the rest of its first row. Induction on the remaining block makes it Ir, so Q1=Q2 and R1=R2. For the polar factor U=Y(YTY)−1/2, symmetry of the root and its defining square give UTU=(YTY)−1/2(YTY)(YTY)−1/2=Ir. Hence both outputs have orthonormal columns. For a Grassmann input, [F6] says a frame change X↦XQ0 changes η to ηQ0, so the input Y=X+η becomes YQ0 with the same column space; uniqueness of the positive root gives (Q0TYTYQ0)−1/2=Q0T(YTY)−1/2Q0, so the polar output is multiplied by Q0. Thus the Grassmann outputs are well-defined.

Remark

The formulas here are exact-arithmetic definitions. The finite-precision Householder QR supplier proves a backward-error statement under its operationwise assumptions and does not assert that a computed Q is exactly orthogonal (The scaled Householder QR implementation is backward stable). No floating-point retraction guarantee is claimed by this page.

TheoremStatement: Literature-sourcedProof: AI-generatedjudge pass (gpt-6-luna)Open item page →

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.

AlgorithmAlgorithm: Literature-sourcedProof: Not applicableOpen item page →

Finite-budget retraction Armijo backtracking

Definition

Let M be St⁡(n,r) or Gr⁡(r,n), let f:M→R be smooth, and choose one retraction R from QR and polar retractions on Stiefel and Grassmann. At x∈M, let g=grad⁡f(x). Fix a∈(0,1), β∈(0,1) and an integer budget J≥0.

If g=0, return (x, stationary). Otherwise test, in order, tj=βj for j=0,…,J. At each trial form yj=Rx(−tjg); if the chosen retraction's full-rank condition fails, reject that trial without evaluating f(yj). Otherwise accept and return (yj,tj) at the first index with f(yj)≤f(x)−atj∥g∥2. If no trial passes, return (x, budget-exhausted).

AlgorithmAlgorithm: Literature-sourcedProof: Not applicableOpen item page →

Finite-budget Riemannian trust-region method

Definition

Let 1≤r≤n. Let M be a real Stiefel manifold St⁡(n,r), a real Grassmannian Gr⁡(r,n), or a complex Grassmannian Gr⁡C(r,n), with each tangent space regarded as a real inner-product space under the corresponding Frobenius metric. On a real Stiefel manifold or real Grassmannian choose the induced map of either the real QR or real polar formula from QR and polar retractions on Stiefel and Grassmann; on a complex Grassmannian choose the complex polar map from Polar retraction on the complex Grassmannian. Denote the chosen map by R. Let f:M→R be of class C2 and take an initial point x0∈M. For this regularity, grad⁡f(x) denotes the pointwise metric dual of dfx: in any orthonormal real basis ei of TxM, it is ∑idfx(ei)ei (the empty sum is zero). This convention agrees with The Riemannian gradient is the metric dual of the differential when f is smooth; no infinitely differentiable gradient field is required.

Fix 0<η1<η2<1, 0<γdec<1<γinc, 0<θC≤1, a declared model-operator bound MB≥0, a maximum radius Δmax⁡>0, an initial radius 0<Δ0≤Δmax⁡, target ε≥0, and finite outer cap N∈N0. Supply as input a rule that evaluates a family x↦Bx of self-adjoint real-linear operators Bx:TxM→TxM at each visited point. On a Grassmannian, represent this intrinsic operator on the current horizontal space, consistently under changes of frame. Require ∥Bx∥op≤MB for every x∈M, where ∥Bx∥op:=sup⁡s≠0∥Bxs∥∥s∥, with ∥Bx∥op=0 when the tangent space is {0}. Supply a subproblem routine S with a finite operation cap JS∈N0; on input of the current model mk, radius Δk, and tangent or horizontal space, it terminates within that cap and returns either a vector in that space or failure. No quality guarantee is required because the returned vector is checked below.

Starting with x0 and Δ0, process k=0,…,N in order:

  1. Set gk=grad⁡f(xk). Return (xk,stationary) if gk=0, (xk,target-achieved) if ∥gk∥≤ε, and (xk,outer-budget-exhausted) if k=N.
  2. Form the real pullback quadratic model mk(s)=f(xk)+⟨gk,s⟩+12⟨s,Bxks⟩. With ck=⟨gk,Bxkgk⟩, set τk={Δk/∥gk∥,ck≤0,min⁡{∥gk∥2/ck,Δk/∥gk∥},ck>0,pC=−τkgk, and set PC=mk(0)−mk(pC).
  3. Call S on (mk,Δk) in the current tangent or horizontal space. If it returned a vector q with ∥q∥≤Δk and mk(0)−mk(q)≥θCPC, set pk=q; otherwise set pk=pC. If Δk≤∥gk∥/(2MB), replace the candidate by pk=pC, interpreting that threshold as +∞ when MB=0. Set Pk=mk(0)−mk(pk).
  4. If Pk≤0, return (xk,model-evaluation-failure). Otherwise evaluate yk=Rxk(pk); if the selected retraction is unavailable, return (xk,model-evaluation-failure). If f(yk) cannot be evaluated, return the same status. Otherwise set ρk=(f(xk)−f(yk))/Pk.
  5. If ρk<η1, reject and set (xk+1,Δk+1)=(xk,γdecΔk). Otherwise accept and set xk+1=yk. If also ρk≥η2 and ∥pk∥=Δk, set Δk+1=min⁡{γincΔk,Δmax⁡}; in every other accepted case set Δk+1=Δk.

Return the last accepted point with the corresponding stop status. A failed finite subproblem call, infeasible candidate, or candidate that misses the fraction-of-Cauchy test uses pC.

DefinitionDefinition: Literature-sourcedProof: AI-generatedOpen item page →

Projected vector transport on Stiefel and Grassmann

Definition

Let X be a source frame, η∈TXSt⁡(n,r), and Z∈TXSt⁡(n,r). For Stiefel transport let Y=RX(η) be either the QR or polar endpoint. For Grassmann transport, require η to be the unique horizontal representative at [X], so XTη=0, and choose Y=RXpol(η), the polar endpoint; the positive-diagonal QR frame is not used for this representative-based quotient transport. Define the projected Stiefel transport TYSt(Z):=Z−Ysym⁡(YTZ), and, for a horizontal source representative Z, define the projected Grassmann transport representative TYGr(Z):=(I−YYT)Z. The Grassmann expression is interpreted as a tangent representative at [Y]. The polar endpoint is right-equivariant, so the next proposition verifies representative independence, tangency, and identity at a zero step. These projection transports are not claimed to be Levi-Civita parallel transport.

Facts & Assumptions

Given: X∈St⁡(n,r), a tangent step η (horizontal in the Grassmann branch), its Stiefel endpoint Y=RX(η) or its Grassmann polar endpoint Y=RXpol(η), and a source tangent (or horizontal) representative Z.

[F1]

The Stiefel and horizontal projections at a frame Y are the formulas in Tangent spaces and Frobenius projections on Stiefel and Grassmann.

[F2]

QR and polar endpoints are orthonormal frames, and the polar endpoint transforms as RXQpol(ηQ)=RXpol(η)Q (QR and polar retractions on Stiefel and Grassmann).

[F3]

Both retractions fix the zero tangent vector (The QR and polar maps are first-order Stiefel and Grassmann retractions).

Proof

technique · identify each formula as the corresponding orthogonal projection
1.1F1F2given

The first displayed map is exactly the Stiefel tangent projection from [F1], and the second is exactly the horizontal Grassmann projection from [F1]. By [F2], the endpoint is a valid frame; each formula is linear in Z and takes values in the stated destination tangent space.

2.1F1F2F3givenalgebra∎

Under a change (X,η,Z)↦(XQ,ηQ,ZQ), [F2] gives the polar endpoint YQ; hence I−(YQ)(YQ)T=I−YYT and the output changes to VQ. This is exactly the changed horizontal representative, so the Grassmann tangent vector is independent of the frame. At η=0, [F3] gives Y=X; a Stiefel tangent has sym⁡(XTZ)=0, and a Grassmann horizontal representative has XTZ=0, so both transports return Z.

LemmaStatement: Literature-sourcedProof: AI-generatedOpen item page →

Retraction trust-region ratios are accurate at small radii

Statement

Let M be a finite-dimensional real Stiefel or Grassmann manifold, or a complex Grassmannian, with its real Frobenius metric. Regard every tangent space as real, let x∈M, and let g=grad⁡f(x)≠0. Choose a first-order retraction R and write f^x(s)=f(Rx(s)) on the tangent (or horizontal) space, equipped with its real Frobenius inner product. Suppose ∇f^x is LR-Lipschitz on the ball ∥s∥≤Δ for Δ>0, and let mx(s)=f(x)+⟨g,s⟩+12⟨s,Bxs⟩ with Bx self-adjoint and real-linear. Define its induced operator norm by ∥Bx∥op:=sup⁡s≠0∥Bxs∥∥s∥, and assume ∥Bx∥op≤MB. Let pC be the negative-gradient Cauchy step, and let a feasible trial p satisfy mx(0)−mx(p)≥θC[mx(0)−mx(pC)] for 0<θC≤1. With a zero denominator interpreted as +∞, if Δ≤∥g∥/(2MB), then its predicted decrease P is positive and ∣ρ−1∣≤2(LR+MB)ΔθC∥g∥,ρ=f(x)−f(Rx(p))P. Consequently, for 0<η2<1, if Δ≤min⁡{∥g∥2MB,θC(1−η2)∥g∥2(LR+MB)}, then ρ≥η2. If LR+MB=0, the ratio equals 1.

Facts & Assumptions

Given: The C2 pullback, gradient Lipschitz bound, self-adjoint model operator and norm bound, Cauchy-fraction condition, and small-radius safeguard in the Statement.

[F1]

A first-order real Stiefel/Grassmann or complex Grassmann retraction satisfies DRx(0)[s]=s (The QR and polar maps are first-order Stiefel and Grassmann retractions, The complex Grassmann polar map is a first-order retraction).

[F2]

The Riemannian trust-region step is feasible, has predicted decrease at least θC times Cauchy decrease, and uses the Cauchy step when Δ≤∥g∥/(2MB) (Finite-budget Riemannian trust-region method).

[F3]

The negative-gradient Cauchy step is the segment minimizer with the formula stated in The Cauchy step for a quadratic trust-region model.

[F4]

In orthonormal real coordinates on the finite-dimensional tangent or horizontal space, the operator Bx has a symmetric matrix with Euclidean induced norm ∥Bx∥op, so the Cauchy decrease estimate gives at least 12∥g∥min⁡{Δ,∥g∥/∥Bx∥op}, with the zero-operator convention (The Cauchy step gives a quantitative model decrease).

[F6]

A scalar function continuous on a closed interval and differentiable in its interior has an interior point where its derivative is the endpoint slope (The mean value theorem, as the case g(x)=x of Cauchy's: for f continuous on [a,b] with a<b and differentiable on (a,b) there is c∈(a,b) with f(b)−f(a)=f′(c)(b−a)).

Proof

technique · lower-bound the model decrease and compare pullback actual decrease with its quadratic model
1.1F3F5givencasesalgebra

Write a=∥g∥>0 and c=⟨g,Bxg⟩. The operator norm bound and Cauchy–Schwarz in [F5] give c≤∣c∣≤a∥Bxg∥≤MBa2. If c≤0, [F3] gives a boundary Cauchy step. If c>0, then MB>0, the unconstrained segment minimizer has length a3/c≥a/MB, and Δ≤a/(2MB) forces the constrained minimizer to the boundary. Thus ∥pC∥=Δ in both branches, including MB=0.

2.1F2F4givenstep 1.1choosealgebra

Choose orthonormal real coordinates on the finite-dimensional tangent or horizontal space. In these coordinates [F4] applies, and ∥Bx∥2=∥Bx∥op. Since ∥Bx∥op≤MB and step 1.1 gives ∥pC∥=Δ, the Cauchy decrease is at least 12aΔ. The trial condition and [F2] therefore give P=mx(0)−mx(p)≥12θCaΔ>0. This verifies that ρ is defined.

3.1F1F2F5F6givenstep 2.1algebra∎

Put ϕ(t)=f^x(tp) and h(t)=ϕ(t)−ϕ(0)−tϕ′(0). By [F1], ϕ′(0)=⟨g,p⟩. Lipschitz continuity and [F5] give ∣h′(t)∣≤LRt∥p∥2≤LR∥p∥2 for 0≤t≤1. Apply [F6] on [0,1] to obtain ∣h(1)∣≤LR∥p∥2. The quadratic model contributes at most 12MB∥p∥2 beyond the linear term, so ∣f(x)−f(Rx(p))−P∣≤(LR+MB)∥p∥2. Since ∥p∥≤Δ, step 2.1 gives ∣ρ−1∣≤(LR+MB)Δ2θCaΔ/2=2(LR+MB)ΔθCa. If LR+MB=0, the numerator error is zero and ρ=1. Otherwise the stated radius threshold makes ∣ρ−1∣≤1−η2, hence ρ≥η2.

PropositionStatement: Literature-sourcedProof: AI-generatedjudge pass (gpt-6-luna)Open item page →

Projected vector transports return tangent representatives

Statement

For every retraction step η at X, the maps Projected vector transport on Stiefel and Grassmann are smooth linear maps in the source tangent vector and take values in the endpoint tangent spaces; at η=0 both return the input tangent representative. The Grassmann map is representative-independent under (X,η,Z)↦(XQ,ηQ,ZQ).

Facts & Assumptions

Given: A source frame X, tangent step η, its Stiefel endpoint or polar Grassmann endpoint Y, and a source tangent or horizontal representative Z.

[F1]

The projected transport formulas are those in Projected vector transport on Stiefel and Grassmann.

[F2]

The tangent spaces at Y are characterized by the Stiefel and horizontal equations in Tangent spaces and Frobenius projections on Stiefel and Grassmann.

[F3]

The retraction maps fix the zero tangent vector (The QR and polar maps are first-order Stiefel and Grassmann retractions).

[F4]

QR and polar endpoints are frames, and the polar endpoint is right-equivariant (Projected vector transport on Stiefel and Grassmann).

Proof

technique · substitute the projected formulas into the tangent equations
1.1F1F2F3F4givenalgebra

Put S=sym⁡(YTZ) and W=Z−YS. Then YTW=YTZ−S is skew-symmetric, so YTW+WTY=0. By [F2], W is a Stiefel tangent. The projection formulas are linear in Z and smooth in Y; [F3] makes their composition with the retraction smooth in η.

1.2F1F2F4givenalgebra

The Grassmann output V=(I−YYT)Z satisfies YTV=0, so it is horizontal by [F2], and it depends linearly on Z. Under (X,η,Z)↦(XQ,ηQ,ZQ), [F4] makes the polar endpoint Y change to YQ. Then I−(YQ)(YQ)T=I−YYT and the output changes to VQ, exactly the changed horizontal representative. This proves independence of the represented tangent vector.

2.1F1F2F3givenalgebra∎

At η=0, [F3] gives Y=X. If Z is Stiefel tangent at X, XTZ is skew-symmetric, so sym⁡(XTZ)=0 and the Stiefel transport returns Z. If Z is horizontal, XTZ=0 and (I−XXT)Z=Z. Thus both transports are identity at the zero step, completing the vector-transport conditions.

TheoremStatement: Literature-sourcedProof: AI-generatedjudge pass (gpt-6-luna)Open item page →

Uniform pullback smoothness guarantees an Armijo step

Statement

Let M=St⁡(n,r) or Gr⁡(r,n) be compact, let f:M→R be smooth, and let R be a QR or polar retraction with the first-order property of The QR and polar maps are first-order Stiefel and Grassmann retractions. Write f^x(η)=f(Rx(η)). Assume a uniform bound ∥grad⁡f(x)∥≤G and a constant LR≥0 such that, for every x and ∥η∥≤1, ∥grad⁡f^x(η)−grad⁡f^x(0)∥≤LR∥η∥. For a∈(0,1) and a nonstationary iterate, set δ=min⁡{1,(2G)−1,2(1−a)/LR}, where a reciprocal of zero is interpreted as +∞. If the finite backtracking budget tests some tj=βj≤δ, then it accepts a step; the first accepted step obeys t≥βδ. For 0<t≤δ, the bound t∥grad⁡f(x)∥≤1/2 keeps the pullback argument inside its assumed unit tangent ball; an earlier accepted trial may be larger.

Facts & Assumptions

Given: The compact manifold, smooth objective, first-order retraction, constants G,LR,a,β, and finite budget reaching δ.

[F1]

The retraction pullback has derivative at zero equal to the original tangent direction (The QR and polar maps are first-order Stiefel and Grassmann retractions).

[F2]

The Riemannian gradient represents the differential in the chosen metric (The Riemannian gradient is the metric dual of the differential).

[F3]

The finite Armijo search tests tj=βj and accepts only the sufficient-decrease inequality (Finite-budget retraction Armijo backtracking).

Proof

technique · integrate the Lipschitz pullback-gradient bound along the negative-gradient segment
1.1givenalgebra

Since g≠0 and ∥g∥≤G, we have G>0. For 0<t≤δ, η=−tg has norm t∥g∥≤tG≤1/2, so the entire segment sη, 0≤s≤1, lies in the unit ball.

2.1F1F2F3F4givenstep 1.1algebra

By [F1] and [F2], Df^x(0)[η]=⟨g,η⟩=−t∥g∥2. The fundamental theorem of calculus along s↦sη and the assumed Lipschitz bound give f^x(η)≤f(x)−t∥g∥2+∫01LRs∥η∥2 ds=f(x)−t∥g∥2+12LRt2∥g∥2. The integral bound uses [F4] to estimate the inner product of the gradient difference with η. If LR=0 the last error is zero; otherwise t≤2(1−a)/LR makes the right side at most f(x)−at∥g∥2. Thus every tested t≤δ satisfies the Armijo test in [F3].

3.1F3givenstep 2.1algebra∎

Let j be the first tested index with βj≤δ. By step 2.1 this trial passes, so the algorithm stops no later than j. If j=0, then t=1≥βδ because δ≤1. If j>0, minimality gives βj−1>δ, hence βj>βδ. Any earlier accepted grid point is larger still.

TheoremStatement: Literature-sourcedProof: AI-generatedjudge pass (gpt-6-luna)Open item page →

Retraction Armijo reaches an epsilon-gradient iterate in finite budget

Statement

Under the hypotheses of Uniform pullback smoothness guarantees an Armijo step, assume f is bounded below by finf⁡ and every nonstationary call's finite budget reaches the stated δ. For N≥1 accepted updates x0,…,xN, min⁡0≤k<N∥grad⁡f(xk)∥2≤f(x0)−finf⁡aβδN. In particular, for every ϵ>0, after more than (f(x0)−finf⁡)/(aβδϵ2) accepted updates, some iterate among the pre-update points has gradient norm at most ϵ. The order is O(ϵ−2) with the displayed constants fixed. This counts accepted updates; it does not assert an evaluation bound independent of the finite backtracking budgets.

Facts & Assumptions

Given: The Armijo acceptance and step bound, lower bound finf⁡, constants a,β,δ>0, and N accepted updates.

[F1]

Every nonstationary call accepts a step tk≥βδ (Uniform pullback smoothness guarantees an Armijo step).

[F2]

An accepted Armijo update satisfies f(xk+1)≤f(xk)−atk∥grad⁡f(xk)∥2 (Finite-budget retraction Armijo backtracking).

Proof

technique · telescope the sufficient decreases
1.1F1F2givenalgebra

For every accepted update, [F1] and [F2] imply f(xk)−f(xk+1)≥aβδ∥grad⁡f(xk)∥2. Summing for k=0,…,N−1 telescopes to aβδ∑k=0N−1∥grad⁡f(xk)∥2≤f(x0)−f(xN)≤f(x0)−finf⁡. At least one of the N nonnegative terms is no greater than their average, giving the stated bound.

2.1step 1.1givencontradiction∎

If every pre-update gradient norm were greater than ϵ, the sum in step 1.1 would exceed Nϵ2. This contradicts its upper bound whenever N>(f(x0)−finf⁡)/(aβδϵ2), proving the finite accepted-update claim.

TheoremStatement: Literature-sourcedProof: AI-generatedOpen item page →

Riemannian trust regions reach an epsilon-gradient iterate

Statement

Let 1≤r≤n, and let M be a compact real Stiefel manifold St⁡(n,r), a compact real Grassmannian Gr⁡(r,n), or a compact complex Grassmannian Gr⁡C(r,n). Let f:M→R be of class C2 and take x0∈M; set finf⁡=min⁡Mf, whose existence is proved below. Equip each tangent or horizontal space with its real Frobenius inner product. For each self-adjoint real-linear model operator Bx, define ∥Bx∥op:=sup⁡s≠0∥Bxs∥∥s∥, with value 0 on a zero tangent space, and assume ∥Bx∥op≤MB for some MB≥0. Assume the pullback gradients of the chosen first-order retraction are uniformly LR-Lipschitz on every trial ball of radius at most Δmax⁡, for some LR≥0. Run Finite-budget Riemannian trust-region method with fixed 0<η1<η2<1, 0<γdec<1<γinc, 0<θC≤1, 0<Δ0≤Δmax⁡, and target 0<ε≤1. Assume every model and objective evaluation on a valid trial is available. The counts concern the uncapped trial sequence up to its first target iterate; for the finite-cap implementation, choose an outer cap at least the resulting total-trial bound.

Using +∞ for reciprocals of zero, define cδ=min⁡{12MB,θC(1−η2)2(LR+MB)},cR=min⁡{Δ0,γdecmin⁡{cδ,Δmax⁡}}, cP=min⁡{cR,1/MB},cS=12η1θCcP>0,rε=min⁡{Δ0,γdecmin⁡{cδε,Δmax⁡}}. Then the number Ns of accepted steps and Nu of rejected trials before the first iterate with ∥grad⁡f(xk)∥≤ε obey Ns≤f(x0)−finf⁡cSε2,Nu≤log⁡(Δ0/rε)+Nslog⁡γinc∣log⁡γdec∣. Consequently accepted steps and total trials Ns+Nu are O(ε−2) as ε↓0, with all displayed constants fixed. Such a finite cap suffices to return either stationary or target-achieved status, in both cases with gradient norm at most ε; a smaller cap may return outer-budget-exhausted first. The constants and proof count accepted and rejected outer trials; they do not bound inner subproblem operations.

Facts & Assumptions

Given: Compact search manifold, C2 objective with the pointwise gradient convention of Finite-budget Riemannian trust-region method, uniform pullback-gradient Lipschitz and self-adjoint real-linear model-operator bounds, and the trust-region parameter ranges and subproblem safeguards in the Statement.

[F1]

The finite-budget Riemannian method uses the η1,η2 ratio thresholds, γdec,γinc radius branches, and the θC Cauchy-decrease safeguard (Finite-budget Riemannian trust-region method).

[F2]

At sufficiently small radius, the pullback actual-to-predicted ratio is at least η2 (Retraction trust-region ratios are accurate at small radii).

[F3]

In orthonormal real coordinates, the Cauchy step decrease is at least 12∥g∥min⁡{Δ,∥g∥/∥Bx∥op}, with the zero-operator convention (The Cauchy step gives a quantitative model decrease).

[F4]

The real and complex Stiefel frame sets are nonempty compact metric subspaces of finite-dimensional real coordinate spaces, and the quotient maps to the Grassmannians are continuous and onto (Finite-dimensional Stiefel and Grassmann manifolds are compact, Finite-dimensional complex Stiefel and Grassmann manifolds are compact). A continuous real-valued function on a nonempty compact metric space attains its minimum (A continuous real-valued function on a nonempty compact metric space is bounded and attains a greatest and a least value).

[F6]
[F7]

Every real number is exceeded by an integer (Every complete ordered field is Archimedean).

Proof

technique · establish an attained lower bound, derive a radius floor, then count accepted decreases and rejected contractions
1.1F4givencases

If M=St⁡(n,r), the real-coordinate Stiefel set is a nonempty compact metric space by [F4], so [F4] gives an attained minimum of f. If M is either Grassmannian, let q be its continuous surjective quotient map from the corresponding real or complex Stiefel set. Then f∘q is continuous on that nonempty compact metric frame set and attains its minimum by [F4]. Surjectivity makes this the minimum of f on M. Thus finf⁡ is finite and attained in every case.

1.2F1F2giveninductionalgebra

Fix 0<ε≤1 and write δˉε=min⁡{cδε,Δmax⁡}. Whenever ∥gk∥>ε and Δk≤δˉε, the hypotheses of [F2] hold because Δk≤cδ∥gk∥. Thus ρk≥η2>η1, and [F1] forbids rejection. Therefore every radius before target is at least rε=min⁡{Δ0,γdecδˉε}>0. Indeed the initial radius has this bound; an accepted update does not shrink it, and a rejected update starts above δˉε and leaves a radius above γdecδˉε. Induction proves the claim.

2.1givenstep 1.1algebra

The pointwise gradient convention requires only differentiability. In an orthonormal real tangent basis ei, write v=∑iviei and G=∑idfx(ei)ei. Then ⟨G,v⟩=∑idfx(ei)vi=dfx(v) by linearity, and if H has the same pairing with every v, taking v=G−H gives ∥G−H∥2=0, hence G=H. The zero tangent space has G=0. Thus the gradient is well-defined for a C2 objective. For the chosen first-order retraction, DRx(0)[v]=v; the chain rule gives Df^x(0)[v]=dfx[v]=⟨g,v⟩, so the pullback gradient at zero is g. All subsequent estimates require only the stated pullback Lipschitz bound and the continuity used in step 1.1.

2.2F1F3F7F8givenstep 1.1step 1.2chooseassume-contradischarge-contradictionalgebra

Choose orthonormal real coordinates on each finite-dimensional tangent or horizontal space. In those coordinates [F3] applies and the matrix norm of Bx is ∥Bx∥op. If ∥gk∥>ε, then rε≥cRε,min⁡{Δk,∥gk∥/∥Bxk∥op}≥cPε, with the stated infinite-ratio convention when MB=0. The first inequality follows from ε≤1 and the definitions of rε,cR; the second follows from Δk≥rε, ∥gk∥>ε, and ∥Bxk∥op≤MB. By [F1] and [F3], the selected step has predicted decrease at least the Cauchy fraction, hence at least 12θCcPε2. Every accepted step has ρk≥η1, so its actual decrease is at least cSε2. Run the update rule without applying the outer cap. If the target were never reached and only finitely many steps were accepted, the resulting infinite block of rejections would keep the point fixed and force its radius to zero by [F8], contradicting the radius floor in step 1.2. Thus the uncapped process must have infinitely many accepted steps unless it reaches the target. By [F7], choose an integer m>(f(x0)−finf⁡)/(cSε2). After m accepted steps the objective would be below finf⁡, a contradiction. Thus the target is reached after finitely many accepted steps. Summing their decreases and using step 1.1 gives Ns≤f(x0)−finf⁡cSε2.

2.3F1F5givenstep 1.2algebra

If the initial point already meets the target, then Ns=Nu=0 and the bounds hold. Otherwise let ΔT be the radius after the accepted step that first reaches the target. Each rejected trial multiplies the radius by γdec, and each accepted update multiplies it by a factor qj∈[1,γinc]. Hence ΔT=Δ0γdecNu∏j=1Nsqj,ΔT≥rε by step 1.2. Taking logarithms using [F5], then rearranging and using log⁡qj≤log⁡γinc, gives Nu∣log⁡γdec∣=log⁡(Δ0/ΔT)+∑j=1Nslog⁡qj≤log⁡(Δ0/rε)+Nslog⁡γinc. This is the asserted rejected-trial bound.

3.1F1F5F6givenstep 1.1step 1.2step 2.2step 2.3algebra∎

By step 1.1, finf⁡ is finite. The definitions give rε≥cRε, so [F5] gives log⁡(Δ0/rε)≤log⁡(Δ0/(cRε))=log⁡(Δ0/cR)+log⁡(1/ε). By [F6], log⁡(1/ε)≤1/ε≤1/ε2 for 0<ε≤1. Thus this radius term is O(ε−2); step 2.2 gives the same order for Ns, and step 2.3 gives it for Nu. A finite integer outer cap at least the resulting trial bound therefore suffices to return stationary or target-achieved. The algorithm tests zero gradient first, so stationary is possible; either return has gradient norm at most ε.

5 · Examples, counterexamples and false statements

None yet.

Sources