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
- Absolute and Conditional Convergence; Rearrangement; Products
- Algebraic Closure, Embeddings, and Separability
- Algebraic Extensions, Extension Degree, and Finite Fields
- Binary Operations, Monoids, Groups and Subgroups
- Compactness
- Compactness in Metric Spaces
- Completeness, Completion, and Uniform Continuity
- Composition Series, the Jordan–Hölder Theorem and Solvable Groups
- Congruences, the Integers Modulo n and the Chinese Remainder Theorem
- Connectedness
- Constant Rank, Submersions, Immersions and Regular Level Sets
- Construction of the Natural Numbers
- Construction of the Real Numbers via Cauchy Sequences
- Construction of the Real Numbers via Dedekind Cuts
- Continuity, IVT, EVT, and Uniform Continuity
- Cosets, Index and Lagrange's Theorem
- Countability and Uncountability
- Countability Axioms and Cardinal Functions
- Cw Complexes and Cellular Homology
- Cyclic Groups and Direct Products
- Determinants of Matrices over a Commutative Ring
- Diagonalisation and the Minimal Polynomial
- Direct Matrix Factorisations: LU, Cholesky and QR
- Divisibility, Euclidean Domains, Principal Ideal Domains and Unique Factorisation
- Divisibility, Greatest Common Divisors and Bézout's Identity
- Dual Spaces, Bilinear and Quadratic Forms, and Sylvester's Law of Inertia
- Eigenvalues, Eigenvectors and the Characteristic Polynomial
- Fibrations Fiber Bundles and Homotopy Exact Sequences
- Filters and Ultrafilters
- Finite Counting, Factorials and Binomial Coefficients
- Finite-precision direct factorizations and least squares
- Foundations of the Real Numbers for Analysis
- Gaussian Elimination, Elementary Matrices and Reduced Row Echelon Form
- Gradient Like Vector Fields and Morse Trajectories
- Group Actions, Orbits, Stabilisers and Cayley's Theorem
- Group Homomorphisms and the Isomorphism Theorems
- Hereditary and Productive Behaviour of the Separation Axioms
- Hilbert Space Geometry and Riesz Representation
- Ideals, Quotient Rings and the Isomorphism Theorems for Rings
- Inner Product Spaces, Gram-Schmidt, Projections and Adjoints
- Limits of Real Functions
- limsup, liminf, and Subsequential Limits
- Linear Independence, Bases and Dimension
- Linear Transformations, Rank-Nullity and Quotient Spaces
- Matrices, the Matrix of a Linear Map, and Change of Basis
- Matrix Norms, Condition Numbers and Numerical Stability
- Metric Spaces
- Mixed Partials, Taylor Formulae, and Extrema
- Monotone Functions, Discontinuities, and Continuity Sets
- Monotone Sequences, Bolzano-Weierstrass, and Cauchy Completeness
- Morse Critical Points Hessians and Indices
- Normal Subgroups and Quotient Groups
- Order, Zorn's Lemma, and the Axiom of Choice
- Partitions of Unity and Paracompactness
- Polynomial Rings, the Division Algorithm and Roots
- Power Series and Real-Analytic Functions
- Primes, Euclid's Lemma and the Fundamental Theorem of Arithmetic
- Products Segre and Veronese Embeddings and Grassmannians
- Properties of the Integral and the Working FTC
- Rank Theorems and Embedded Submanifolds
- Relations, Functions, and Quotients
- Riemannian Metrics Length Distance and Volume
- Rings, Subrings, Integral Domains and Fields
- Rⁿ as a Normed Space; Vector-Valued Functions
- Roots, Rational Powers, and Classical Inequalities
- Separation Axioms: the Hierarchy
- Sequences and Limits
- Sequences and Series of Functions; Uniform Convergence
- Series: Convergence and the Nonnegative Tests
- Simple Field Extensions and the Construction of the Complex Numbers
- Smooth Manifolds and Smooth Maps
- Smooth Vector Bundles and Sections
- Splitting Fields
- Subspaces, Products, and Quotients
- Suprema and Infima
- Sylow's Theorems, p-Groups and Nilpotent Groups
- Symmetric Groups, Cycle Decomposition and the Sign Homomorphism
- Symplectic Manifolds, Moser Stability, and Darboux–Weinstein Theory
- Tangent Cotangent and the Differential
- Tensor Fields Exterior Algebra and Differential Forms
- The Cantor Set, Baire Category, and Measure Zero in ℝ
- The Derivative and the Mean Value Theorems
- The Determinant of a Linear Operator, Cofactors and Cramer's Rule
- The Exponential Function
- The Fundamental Theorem of Algebra
- The Fundamental Theorem of Finite Abelian Groups
- The Fundamental Theorems of Calculus
- The Galois Correspondence
- The Inverse and Implicit Function Theorems
- The Inverse Function Theorem Completed
- The Logarithm and General Powers
- The Riemann Integral: Definition and Integrability
- The Spectral Theorem, Positive Operators and Singular Value Decomposition
- The Topology of Euclidean Space
- The Total Derivative in ℝᵐ → ℝⁿ
- The ZFC Axioms and the Basic Set Constructions
- Topological Spaces and Continuity
- Topological Vector Bundles and Grassmannian Classification
- Topology of ℝ
- Triangularisation, Generalised Eigenspaces and Jordan Canonical Form
- Trust region and cubic regularization methods
- Uniform Spaces: the Three Definitions
- Vector Fields Flows and Lie Derivatives
- Vector Spaces, Linear Subspaces, Span and Direct Sums
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 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 .
3 · Logical flowchart
4 · Definitions, theorems and proofs
Real Stiefel and Grassmann optimization conventions
Definition
For integers , the real Stiefel manifold is The real Grassmannian is the set of -dimensional linear subspaces of , identified with the quotient of by the right action of . A frame represents the subspace .
On matrix spaces use the Frobenius inner product . Give Stiefel its induced metric. On the Grassmann quotient use the quotient metric: identify a tangent vector at with its unique horizontal representative satisfying , and pair horizontal representatives by the Frobenius inner product. A Grassmann formula written with a frame representative must be unchanged under for .
For a square real matrix , set .
Facts & Assumptions
Given: Integers and the real matrix spaces with their Euclidean topology.
The right action of on orthonormal frames changes frame but not the represented subspace, and its quotient is the Grassmannian (Stiefel spaces, Grassmannians, and tautological bundles).
A Riemannian metric is a smooth symmetric positive-definite bilinear form on each tangent space (Riemannian metric and riemannian manifold).
The Euclidean inner product on a finite real coordinate space is the sum of coordinatewise products (The Euclidean inner product on ).
A Grassmannian point is an -dimensional subspace of the ambient vector space (The Grassmannian of r-dimensional subspaces of a finite-dimensional vector space).
Proof
For any real matrix , , so this pairing is symmetric bilinear and positive for every nonzero by [F3]. Its restriction to each tangent or horizontal subspace is therefore a positive-definite inner product, as required by [F2].
In a local Grassmann graph chart, choose a smooth orthonormal frame section from the local frame-bundle trivialization in [F1], and set . For a chart tangent , differentiating gives skew-symmetric. The first term is vertical: for every skew-symmetric , the Cayley curve satisfies near zero and . Thus is the unique horizontal representative of . Then . For horizontal , direct expansion gives . 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.
By [F4], each frame represents an -dimensional subspace, and [F1] identifies frames representing the same subspace by the right orthogonal action. For , cyclicity of trace gives . Thus the action is isometric and the horizontal pairing is independent of the chosen orthonormal frame.
Complex Stiefel and Grassmann optimization conventions
Definition
For , set and . The class represents the complex column space of ; two orthonormal frames represent the same space exactly when they differ by right multiplication by a unitary matrix. Regard each complex matrix space as a real vector space and use the real Frobenius inner product Give the complex Stiefel manifold its induced metric. On the complex Grassmann quotient, represent tangent vectors horizontally by matrices with and pair these representatives by . For , write for its realification, the real matrix acting on real/imaginary coordinates as acts on complex coordinates. Write .
Facts & Assumptions
Given: Integers and complex matrix spaces with their usual real-coordinate topology.
A Riemannian metric is a smooth positive-definite real bilinear pairing on each tangent space (Riemannian metric and riemannian manifold).
The coordinatewise product on a finite real coordinate space is its Euclidean inner product (The Euclidean inner product on ).
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
Write and with real matrices. For , , the real and imaginary parts of ; hence , , and, when is invertible, . Also , 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].
In a local complex Grassmann graph chart, choose a smooth orthonormal frame section from the frame-bundle trivialization in [F3], and set . For a chart tangent , differentiating makes skew-Hermitian. The first term is vertical: for every skew-Hermitian , the Cayley curve satisfies near zero and . Thus the horizontal component is the unique representative of . Then . For horizontal , direct expansion gives . 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.
The complex frame quotient and its local graph charts are those of [F3]. For unitary , cyclicity of trace and give . Thus the right unitary action is isometric, and the Frobenius pairing of horizontal representatives is independent of the chosen orthonormal frame.
Finite-dimensional Stiefel and Grassmann manifolds are compact
Statement
For , is a nonempty closed bounded subset of , and is compact as its continuous quotient image. Hence both spaces are compact.
Facts & Assumptions
Given: Integers and the Stiefel and quotient definitions of Real Stiefel and Grassmann optimization conventions.
A subset of finite-dimensional Euclidean space is compact if it is closed and bounded (For a nonempty subset of with , compactness, closedness and boundedness, pseudocompactness, and attainment of extrema by every continuous real-valued function are equivalent).
The quotient map is continuous for the quotient topology and is surjective by the quotient definition in the real conventions.
Proof
The equations are polynomial equations in the entries, so their common zero set is closed. Also , so the set is bounded. The matrix with columns belongs to it, so it is nonempty.
Let be any open cover of . By [F2], the sets for are open in and cover it. Compactness from step 1.1 gives whose preimages cover . Since is surjective, cover . Thus the quotient is compact directly from the open-cover definition.
Step 1.1 proves compactness of and step 2.1 proves compactness of , as claimed.
Finite-dimensional complex Stiefel and Grassmann manifolds are compact
Statement
For , is a nonempty closed bounded subset of the real coordinate space , and is its continuous quotient image. Both spaces are compact.
Facts & Assumptions
Given: and the complex Stiefel and quotient definitions of Complex Stiefel and Grassmann optimization conventions.
Complex matrix entries are real and imaginary coordinates in a finite-dimensional real Euclidean space (Complex Stiefel and Grassmann optimization conventions).
Closed bounded subsets of finite-dimensional Euclidean space are compact (For a nonempty subset of with , compactness, closedness and boundedness, pseudocompactness, and attainment of extrema by every continuous real-valued function are equivalent).
The quotient map is continuous for the quotient topology and is surjective by the complex quotient definition.
Proof
The map is continuous in the real and imaginary coordinates, so its inverse image of the closed singleton is closed. Also on this set, so it is bounded. The frame shows it is nonempty.
Let be any open cover of . By [F3], the sets for are open in and cover it. Compactness from step 1.1 gives whose preimages cover . Surjectivity of then makes a cover of . Thus the quotient is compact directly from the open-cover definition.
Step 1.1 proves compactness of and step 2.1 proves compactness of , as claimed.
Tangent spaces and Frobenius projections on Stiefel and Grassmann
Statement
For , the tangent space and its Frobenius orthogonal projection are For , its tangent vectors have unique horizontal representatives with , and the quotient-metric projection of an ambient to this horizontal space is
Facts & Assumptions
Given: , , and the Frobenius metrics of Real Stiefel and Grassmann optimization conventions.
The Stiefel constraint map is , and the Grassmannian is the quotient of orthonormal frames by the right orthogonal action (Stiefel spaces, Grassmannians, and tautological bundles).
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
The derivative of at is . It is onto the symmetric matrices because for any symmetric , the choice gives . Thus is a regular value; [F2] identifies the tangent space with the displayed kernel.
Write . Then , so is tangent. For every symmetric and tangent , because is skew-symmetric. Hence is normal and is the orthogonal projection.
A curve in through has skew-symmetric by differentiating . Conversely, for any skew-symmetric , the Cayley curve is defined near zero, satisfies , and has ; hence the vertical tangent directions are exactly . Every Stiefel tangent decomposes as , where is skew and the second term is horizontal. These summands are orthogonal, so the quotient tangent is represented uniquely by the horizontal summand.
The matrix is horizontal. For every horizontal , , since . Therefore it is the quotient-metric projection. Under and it becomes , the same tangent vector in the changed representative.
Complex Stiefel and Grassmann tangent projections
Statement
For , as a real manifold, and . The complex Grassmann tangent has the unique horizontal representative , and its quotient-metric projection is .
Facts & Assumptions
Given: , , and the real Frobenius metrics of Complex Stiefel and Grassmann optimization conventions.
The Stiefel frame set is the level set of , and the Grassmann space is its quotient by the right unitary action (Complex Stiefel and Grassmann optimization conventions).
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).
The complex Grassmann quotient has graph charts, and its frame bundle has right unitary fibers (Stiefel spaces, Grassmannians, and tautological bundles).
Proof
Regard the Hermitian matrices as a real vector space. The derivative of is . It is onto that space: for any Hermitian , gives . Hence the level is regular, and [F2] gives the displayed tangent kernel.
Set . Then , so is tangent. For tangent , put , which is skew-Hermitian. For Hermitian , by adjoint and cyclic-trace identities; thus . Therefore is normal in the real Frobenius metric, and the stated formula is the Stiefel orthogonal projection.
A curve in through has skew-Hermitian by differentiating . Conversely, for any skew-Hermitian , the Cayley curve is defined near zero, satisfies , and has ; hence the vertical tangent directions are exactly . Every Stiefel tangent decomposes as with . The second summand is horizontal. For any vertical and horizontal , , so the summands are orthogonal. The decomposition is unique, and the graph-chart quotient identifies its horizontal component with the quotient tangent.
The matrix is horizontal. For every horizontal , since . Thus it is the horizontal orthogonal projection. Under for unitary , it transforms to , the same tangent vector in the changed frame.
Projected Euclidean gradients are the Stiefel and Grassmann gradients
Statement
Let be smooth on an open neighborhood of , and write for its Euclidean gradient. Its restriction to Stiefel has Riemannian gradient . If for every , it descends to a smooth Grassmann objective and its gradient has horizontal representative . In either metric, gradient zero is equivalent to a critical point of the restricted objective.
Facts & Assumptions
Given: , a smooth ambient , , and, for the Grassmann conclusion, right-orthogonal invariance.
The Frobenius projections to Stiefel and Grassmann tangent representatives are the formulas in Tangent spaces and Frobenius projections on Stiefel and Grassmann.
A Riemannian gradient is the metric dual of the differential (The Riemannian gradient is the metric dual of the differential).
Right multiplication by an orthogonal matrix changes the frame representative but not its subspace (Stiefel spaces, Grassmannians, and tautological bundles).
The Jacobian definition gives the coordinate partial derivatives of as the entries of (The Jacobian matrix of partial derivatives and the gradient in the scalar-valued case); for a smooth , its differential is linear and its value on a coordinate-basis matrix is the corresponding partial derivative.
The Riemannian gradient vanishes exactly at critical points of a smooth function (The Riemannian gradient vanishes exactly at the critical points).
The Frobenius pairing is the Euclidean coordinate inner product on matrix entries (The Euclidean inner product on ).
Proof
Let be the coordinate-basis matrices. Smoothness of makes linear, and by the definition in [F4], . Expanding therefore gives . Restriction to Stiefel has this same differential on tangent vectors. By [F1], is tangent and is normal, hence . The metric-dual characterization [F2] proves the Stiefel formula.
Invariance and [F3] make well-defined. The graph charts for the quotient in [F3] provide smooth local frame sections; in each chart, is the composition of with such a section and is therefore smooth. For each skew-symmetric , the Cayley curve satisfies near zero by direct multiplication and has . Invariance makes constant, so for every vertical tangent; consequently the differential descends to horizontal representatives.
For a horizontal , the descended differential is by [F4] and [F6]. By [F1], is horizontal and its difference from is orthogonal to every horizontal , so it is the metric dual on the quotient. [F5] gives the asserted equivalence between a zero gradient and criticality on each manifold.
Polar retraction on the complex Grassmannian
Definition
For and horizontal , so , define and . The inverse square root is the inverse of the unique positive-definite Hermitian square root. The horizontal condition gives , so this map is defined for every horizontal tangent vector, and its frame representative is unchanged as a Grassmann point when is replaced by with unitary .
Facts & Assumptions
Given: and horizontal as in Complex Stiefel and Grassmann tangent projections.
A horizontal representative satisfies (Complex Stiefel and Grassmann tangent projections).
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).
The complex Grassmannian is the quotient of complex orthonormal frames by right unitary changes of frame (Stiefel spaces, Grassmannians, and tautological bundles).
Proof
By [F1], . For every nonzero , , so the Gram matrix is Hermitian positive definite. Apply [F2] on : its unique nonnegative Hermitian square root has strictly positive eigenvalues and is invertible, which defines the inverse root in the formula.
Write and . Since is Hermitian and , we have . Thus is a complex orthonormal frame and its range is a point of the stated Grassmannian.
By the quotient convention [F3], frames related by a unitary matrix represent the same point. For unitary , the Gram matrix of is . Uniqueness of the positive square root gives . Hence the resulting frame is , with the same column space as .
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 , fixes zero, and has frame differential 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 .
Facts & Assumptions
Given: and a horizontal tangent at .
The polar frame and quotient maps are given by the Gram inverse-square-root formula (Polar retraction on the complex Grassmannian).
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).
Horizontal matrices are the representatives of the complex Grassmann tangent (Complex Stiefel and Grassmann tangent projections).
The complex Grassmannian has local graph charts and frame fibers related by right unitary changes (Stiefel spaces, Grassmannians, and tautological bundles).
The realification respects products and inverses, and matrix inversion preserves regularity on the nonvanishing-determinant domain (Complex Stiefel and Grassmann optimization conventions, Matrix inversion preserves regularity where the determinant is nonzero).
Proof
The Gram matrix is Hermitian positive definite by [F1]. Its realification is real symmetric because , and positive definite because, for , . The matrix is real symmetric by the same transpose identity, squares to by [F5], and is positive definite by the same quadratic-form identity. Uniqueness of the positive square root and [F2] therefore make smooth in real coordinates. It stays invertible, so [F5] applied to its realification makes its inverse smooth for every finite , and that inverse is the realification of . The frame formula and its range are smooth.
Fix horizontal and set . The Gram factor has value at zero and derivative zero there because its argument is and the inverse-root map is smooth by [F2] and [F5]. The product rule gives and . By [F3], this is precisely identity on the quotient tangent.
By [F4], the unitary-equivariant frame formula descends through the smooth Grassmann quotient. The definition's computation shows that replacing by changes to , leaving its range unchanged. Its identity differential from step 1.2 is therefore representative-independent.
Gradient of a unitary-invariant Hermitian projector energy
Statement
Let , and let be real-valued and continuously differentiable on an open set of Hermitian matrices containing the rank- orthogonal projectors. Suppose its real Frobenius gradient satisfies for every Hermitian direction . Then is well-defined on and has horizontal gradient
Facts & Assumptions
Given: The real differentiable Hermitian-matrix functional and gradient in the Statement, and .
The frame quotient is by the right unitary action, and complex matrix spaces use the real Frobenius pairing (Complex Stiefel and Grassmann optimization conventions).
The horizontal tangent projection is (Complex Stiefel and Grassmann tangent projections).
A Riemannian gradient is the metric dual of the differential (The Riemannian gradient is the metric dual of the differential).
Complex Grassmann has local graph charts and frame representatives related by right unitary maps (Stiefel spaces, Grassmannians, and tautological bundles).
The complex polar retraction has frame differential for horizontal (The complex Grassmann polar map is a first-order retraction).
Proof
For unitary , , so is independent of the representative. In the local graph charts [F4], it therefore defines a differentiable function on the quotient. Let and . By [F5], and , so differentiating gives and . Since is defined on an open neighborhood of , the chain rule gives the differential of along this Grassmann curve.
Using , cyclicity of trace, and [F1], . The horizontal metric dual is the projection of . By [F2] it equals , which is the claimed gradient by [F3].
QR and polar retractions on Stiefel and Grassmann
Definition
For and , put . On the domain where has full column rank, let be the factor in the unique reduced QR factorization with upper triangular and positive diagonal. Define the QR map by . Define the polar map by where the exponent denotes the inverse of the unique positive-definite square root. For a Grassmann tangent at , use its unique horizontal representative satisfying and define the induced map by taking the output column space. Under , this representative changes to , so the input matrix changes to . The polar formula is right-equivariant: for every .
These are defined only where the displayed input is full rank. In fact, for a Stiefel tangent , always has full column rank, since for every .
Facts & Assumptions
Given: and as in Tangent spaces and Frobenius projections on Stiefel and Grassmann.
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).
A real symmetric matrix has an orthonormal eigenbasis (Real spectral theorem: a self-adjoint endomorphism of a finite-dimensional real inner product space has an orthonormal eigenbasis).
Every positive-definite self-adjoint bundle endomorphism has a unique smooth positive square root (Positive-definite bundle endomorphisms have smooth positive square roots).
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).
A tangent matrix satisfies (Tangent spaces and Frobenius projections on Stiefel and Grassmann).
A Grassmann tangent has a unique horizontal representative, and changing the frame from to changes it from to (Real Stiefel and Grassmann optimization conventions).
Proof
By [F5], tangency gives . Therefore for , Thus has full column rank. More generally, for any full-rank , for , 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.
For full-column-rank , its columns are linearly independent. Apply Gram–Schmidt [F1], writing and . The residuals are nonzero, so has orthonormal columns. Set . For , is orthogonal to , so ; and . Since each lies in , . This constructs a reduced QR factorization with positive diagonal. To check uniqueness, if are two such factorizations, then is orthogonal and upper triangular with positive diagonal. Its first column has only its first entry, which must be by unit norm and positivity; orthogonality zeros the rest of its first row. Induction on the remaining block makes it , so and . For the polar factor , symmetry of the root and its defining square give . Hence both outputs have orthonormal columns. For a Grassmann input, [F6] says a frame change changes to , so the input becomes with the same column space; uniqueness of the positive root gives , so the polar output is multiplied by . 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 is exactly orthogonal (The scaled Householder QR implementation is backward stable). No floating-point retraction guarantee is claimed by this 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 , fix , and have differential . 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: , the full-rank formulas of QR and polar retractions on Stiefel and Grassmann, and .
The retraction maps are the positive-diagonal QR factor and the polar factor of (QR and polar retractions on Stiefel and Grassmann).
Tangency is characterized by (Tangent spaces and Frobenius projections on Stiefel and Grassmann).
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).
The positive square root depends smoothly on a positive-definite matrix (Positive-definite bundle endomorphisms have smooth positive square roots).
Matrix inversion preserves regularity on the nonvanishing-determinant domain (Matrix inversion preserves regularity where the determinant is nonzero).
Proof
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 , the factorizations are , so each map returns .
For the polar map, by [F2]. Its inverse square root equals by smoothness in [F4] and [F5] and its value at . Consequently , so its derivative at zero is .
Set and write its positive-diagonal QR factorization as . By step 1.1, are differentiable near zero; , . Put and , so and is upper triangular. Differentiating shows is skew-symmetric. By [F2], is skew-symmetric; hence is skew-symmetric as well. A real matrix both upper triangular and skew-symmetric is zero, so and .
Under , the inputs and have the same column space. Their QR outputs may differ as frames, but induce the same Grassmann point; the polar output transforms by . Differentiating the induced maps therefore gives the same horizontal class of , which is the identity on the quotient tangent space.
Finite-budget retraction Armijo backtracking
Definition
Let be or , let be smooth, and choose one retraction from QR and polar retractions on Stiefel and Grassmann. At , let . Fix , and an integer budget .
If , return (x, stationary). Otherwise test, in order,
for . At each trial form ;
if the chosen retraction's full-rank condition fails, reject that trial without
evaluating . Otherwise accept and return at the first index
with
If no trial passes, return (x, budget-exhausted).
Finite-budget Riemannian trust-region method
Definition
Let . Let be a real Stiefel manifold , a real Grassmannian , or a complex Grassmannian , 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 . Let be of class and take an initial point . For this regularity, denotes the pointwise metric dual of : in any orthonormal real basis of , it is (the empty sum is zero). This convention agrees with The Riemannian gradient is the metric dual of the differential when is smooth; no infinitely differentiable gradient field is required.
Fix , ,
, a declared model-operator bound , a maximum
radius , an initial radius ,
target , and finite outer cap . Supply
as input a rule that evaluates a family of self-adjoint
real-linear operators at each visited point. On a
Grassmannian, represent this intrinsic operator on the current horizontal
space, consistently under changes of frame. Require
for every , where
with when the tangent space is . Supply a
subproblem routine with a finite operation cap ; on
input of the current model , radius , 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 and , process in order:
- Set . Return if , if , and if .
- Form the real pullback quadratic model With , set and set .
- Call on in the current tangent or horizontal space. If it returned a vector with and , set ; otherwise set . If , replace the candidate by , interpreting that threshold as when . Set .
- If , return . Otherwise evaluate ; if the selected retraction is unavailable, return . If cannot be evaluated, return the same status. Otherwise set .
- If , reject and set . Otherwise accept and set . If also and , set ; in every other accepted case set .
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 .
Projected vector transport on Stiefel and Grassmann
Definition
Let be a source frame, , and . For Stiefel transport let be either the QR or polar endpoint. For Grassmann transport, require to be the unique horizontal representative at , so , and choose , the polar endpoint; the positive-diagonal QR frame is not used for this representative-based quotient transport. Define the projected Stiefel transport and, for a horizontal source representative , define the projected Grassmann transport representative The Grassmann expression is interpreted as a tangent representative at . 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: , a tangent step (horizontal in the Grassmann branch), its Stiefel endpoint or its Grassmann polar endpoint , and a source tangent (or horizontal) representative .
The Stiefel and horizontal projections at a frame are the formulas in Tangent spaces and Frobenius projections on Stiefel and Grassmann.
QR and polar endpoints are orthonormal frames, and the polar endpoint transforms as (QR and polar retractions on Stiefel and Grassmann).
Both retractions fix the zero tangent vector (The QR and polar maps are first-order Stiefel and Grassmann retractions).
Proof
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 and takes values in the stated destination tangent space.
Under a change , [F2] gives the polar endpoint ; hence and the output changes to . This is exactly the changed horizontal representative, so the Grassmann tangent vector is independent of the frame. At , [F3] gives ; a Stiefel tangent has , and a Grassmann horizontal representative has , so both transports return .
Retraction trust-region ratios are accurate at small radii
Statement
Let 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 , and let . Choose a first-order retraction and write on the tangent (or horizontal) space, equipped with its real Frobenius inner product. Suppose is -Lipschitz on the ball for , and let with self-adjoint and real-linear. Define its induced operator norm by and assume . Let be the negative-gradient Cauchy step, and let a feasible trial satisfy for . With a zero denominator interpreted as , if , then its predicted decrease is positive and Consequently, for , if then . If , the ratio equals .
Facts & Assumptions
Given: The pullback, gradient Lipschitz bound, self-adjoint model operator and norm bound, Cauchy-fraction condition, and small-radius safeguard in the Statement.
A first-order real Stiefel/Grassmann or complex Grassmann retraction satisfies (The QR and polar maps are first-order Stiefel and Grassmann retractions, The complex Grassmann polar map is a first-order retraction).
The Riemannian trust-region step is feasible, has predicted decrease at least times Cauchy decrease, and uses the Cauchy step when (Finite-budget Riemannian trust-region method).
The negative-gradient Cauchy step is the segment minimizer with the formula stated in The Cauchy step for a quadratic trust-region model.
In orthonormal real coordinates on the finite-dimensional tangent or horizontal space, the operator has a symmetric matrix with Euclidean induced norm , so the Cauchy decrease estimate gives at least , with the zero-operator convention (The Cauchy step gives a quantitative model decrease).
The matrix norm is compatible with the vector norm and the Euclidean inner product satisfies Cauchy–Schwarz (Induced matrix norms are compatible with matrix-vector multiplication, submultiplicative, and satisfy ||I|| = 1, Cauchy-Schwarz with its equality case, the triangle inequality for , the parallelogram law and polarisation).
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 of Cauchy's: for continuous on with and differentiable on there is with ).
Proof
Write and . The operator norm bound and Cauchy–Schwarz in [F5] give . If , [F3] gives a boundary Cauchy step. If , then , the unconstrained segment minimizer has length , and forces the constrained minimizer to the boundary. Thus in both branches, including .
Choose orthonormal real coordinates on the finite-dimensional tangent or horizontal space. In these coordinates [F4] applies, and . Since and step 1.1 gives , the Cauchy decrease is at least . The trial condition and [F2] therefore give . This verifies that is defined.
Put and . By [F1], . Lipschitz continuity and [F5] give for . Apply [F6] on to obtain . The quadratic model contributes at most beyond the linear term, so Since , step 2.1 gives If , the numerator error is zero and . Otherwise the stated radius threshold makes , hence .
Projected vector transports return tangent representatives
Statement
For every retraction step at , 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 both return the input tangent representative. The Grassmann map is representative-independent under .
Facts & Assumptions
Given: A source frame , tangent step , its Stiefel endpoint or polar Grassmann endpoint , and a source tangent or horizontal representative .
The projected transport formulas are those in Projected vector transport on Stiefel and Grassmann.
The tangent spaces at are characterized by the Stiefel and horizontal equations in Tangent spaces and Frobenius projections on Stiefel and Grassmann.
The retraction maps fix the zero tangent vector (The QR and polar maps are first-order Stiefel and Grassmann retractions).
QR and polar endpoints are frames, and the polar endpoint is right-equivariant (Projected vector transport on Stiefel and Grassmann).
Proof
Put and . Then is skew-symmetric, so . By [F2], is a Stiefel tangent. The projection formulas are linear in and smooth in ; [F3] makes their composition with the retraction smooth in .
The Grassmann output satisfies , so it is horizontal by [F2], and it depends linearly on . Under , [F4] makes the polar endpoint change to . Then and the output changes to , exactly the changed horizontal representative. This proves independence of the represented tangent vector.
At , [F3] gives . If is Stiefel tangent at , is skew-symmetric, so and the Stiefel transport returns . If is horizontal, and . Thus both transports are identity at the zero step, completing the vector-transport conditions.
Uniform pullback smoothness guarantees an Armijo step
Statement
Let or be compact, let be smooth, and let 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 . Assume a uniform bound and a constant such that, for every and , For and a nonstationary iterate, set where a reciprocal of zero is interpreted as . If the finite backtracking budget tests some , then it accepts a step; the first accepted step obeys . For , the bound 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 , and finite budget reaching .
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).
The Riemannian gradient represents the differential in the chosen metric (The Riemannian gradient is the metric dual of the differential).
The finite Armijo search tests and accepts only the sufficient-decrease inequality (Finite-budget retraction Armijo backtracking).
The Euclidean inner product obeys Cauchy–Schwarz (Cauchy-Schwarz with its equality case, the triangle inequality for , the parallelogram law and polarisation).
Proof
Since and , we have . For , has norm , so the entire segment , , lies in the unit ball.
By [F1] and [F2], . The fundamental theorem of calculus along and the assumed Lipschitz bound give The integral bound uses [F4] to estimate the inner product of the gradient difference with . If the last error is zero; otherwise makes the right side at most . Thus every tested satisfies the Armijo test in [F3].
Let be the first tested index with . By step 2.1 this trial passes, so the algorithm stops no later than . If , then because . If , minimality gives , hence . Any earlier accepted grid point is larger still.
Retraction Armijo reaches an epsilon-gradient iterate in finite budget
Statement
Under the hypotheses of Uniform pullback smoothness guarantees an Armijo step, assume is bounded below by and every nonstationary call's finite budget reaches the stated . For accepted updates , In particular, for every , after more than accepted updates, some iterate among the pre-update points has gradient norm at most . The order is 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 , constants , and accepted updates.
Every nonstationary call accepts a step (Uniform pullback smoothness guarantees an Armijo step).
An accepted Armijo update satisfies (Finite-budget retraction Armijo backtracking).
Proof
For every accepted update, [F1] and [F2] imply . Summing for telescopes to At least one of the nonnegative terms is no greater than their average, giving the stated bound.
If every pre-update gradient norm were greater than , the sum in step 1.1 would exceed . This contradicts its upper bound whenever , proving the finite accepted-update claim.
Riemannian trust regions reach an epsilon-gradient iterate
Statement
Let , and let be a compact real Stiefel manifold , a compact real Grassmannian , or a compact complex Grassmannian . Let be of class and take ; set , 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 , define with value on a zero tangent space, and assume for some . Assume the pullback gradients of the chosen first-order retraction are uniformly -Lipschitz on every trial ball of radius at most , for some . Run Finite-budget Riemannian trust-region method with fixed , , , , and target . 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 Then the number of accepted steps and of rejected trials before the first iterate with obey Consequently accepted steps and total trials are as , 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, 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.
The finite-budget Riemannian method uses the ratio thresholds, radius branches, and the Cauchy-decrease safeguard (Finite-budget Riemannian trust-region method).
At sufficiently small radius, the pullback actual-to-predicted ratio is at least (Retraction trust-region ratios are accurate at small radii).
In orthonormal real coordinates, the Cauchy step decrease is at least , with the zero-operator convention (The Cauchy step gives a quantitative model decrease).
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).
The natural logarithm is increasing and obeys product and quotient laws (The natural logarithm as the inverse of the exponential function, Order, continuity, range, and the product, quotient, and reciprocal laws for the natural logarithm).
Every real number is exceeded by an integer (Every complete ordered field is Archimedean).
Proof
If , the real-coordinate Stiefel set is a nonempty compact metric space by [F4], so [F4] gives an attained minimum of . If is either Grassmannian, let be its continuous surjective quotient map from the corresponding real or complex Stiefel set. Then is continuous on that nonempty compact metric frame set and attains its minimum by [F4]. Surjectivity makes this the minimum of on . Thus is finite and attained in every case.
Fix and write . Whenever and , the hypotheses of [F2] hold because . Thus , and [F1] forbids rejection. Therefore every radius before target is at least 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 . Induction proves the claim.
The pointwise gradient convention requires only differentiability. In an orthonormal real tangent basis , write and . Then by linearity, and if has the same pairing with every , taking gives , hence . The zero tangent space has . Thus the gradient is well-defined for a objective. For the chosen first-order retraction, ; the chain rule gives , so the pullback gradient at zero is . All subsequent estimates require only the stated pullback Lipschitz bound and the continuity used in step 1.1.
Choose orthonormal real coordinates on each finite-dimensional tangent or horizontal space. In those coordinates [F3] applies and the matrix norm of is . If , then with the stated infinite-ratio convention when . The first inequality follows from and the definitions of ; the second follows from , , and . By [F1] and [F3], the selected step has predicted decrease at least the Cauchy fraction, hence at least . Every accepted step has , so its actual decrease is at least . 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 . After accepted steps the objective would be below , a contradiction. Thus the target is reached after finitely many accepted steps. Summing their decreases and using step 1.1 gives
If the initial point already meets the target, then and the bounds hold. Otherwise let be the radius after the accepted step that first reaches the target. Each rejected trial multiplies the radius by , and each accepted update multiplies it by a factor . Hence by step 1.2. Taking logarithms using [F5], then rearranging and using , gives This is the asserted rejected-trial bound.
By step 1.1, is finite. The definitions give , so [F5] gives By [F6], for . Thus this radius term is ; step 2.2 gives the same order for , and step 2.3 gives it for . 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
- P.-A. Absil, R. Mahony, and R. Sepulchre, Optimization Algorithms on Matrix Manifolds, Chapter 3 (2008)
- Nicolas Boumal, An Introduction to Optimization on Smooth Manifolds (2023 prepublication)
- Peter A. Absil, Robert Mahony, and Rodolphe Sepulchre, Optimization Algorithms on Matrix Manifolds, Chapter 3 (2008)
- Nicholas D. S. Manton, Optimization algorithms exploiting unitary constraints, IEEE Transactions on Signal Processing 50 (2002), §§IV and VI
- Nicholas D. S. Manton, Optimization algorithms exploiting unitary constraints, IEEE Transactions on Signal Processing 50 (2002), §IV
- Peter A. Absil, Robert Mahony, and Rodolphe Sepulchre, Optimization Algorithms on Matrix Manifolds, Chapter 4 (2008)
- Nicholas D. S. Manton, Optimization algorithms exploiting unitary constraints, IEEE Transactions on Signal Processing 50 (2002), §§VI–VII
- P.-A. Absil, R. Mahony, and R. Sepulchre, Optimization Algorithms on Matrix Manifolds, Chapter 4 (2008)
- Nicolas Boumal, P.-A. Absil, and Coralia Cartis, Global rates of convergence for nonconvex optimization on manifolds (2018), arXiv v2
- P.-A. Absil, R. Mahony, and R. Sepulchre, Optimization Algorithms on Matrix Manifolds, Chapter 7 (2008)