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.
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.
Depends on
- Real Stiefel and Grassmann optimization conventions
- Tangent spaces and Frobenius projections on Stiefel and Grassmann
- The Riemannian gradient is the metric dual of the differential
- The Riemannian gradient vanishes exactly at the critical points
- The Jacobian matrix of partial derivatives and the gradient in the scalar-valued case
- The Euclidean inner product $\langle x,y\rangle = \sum_{k<n} x_k y_k$ on $\mathbb{R}^n$
- Stiefel spaces, Grassmannians, and tautological bundles
Used by
Dependency tree · two levels
31 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.
Sources
- P.-A. Absil, R. Mahony, and R. Sepulchre, Optimization Algorithms on Matrix Manifolds, Chapter 3 (2008) (standard reference, not scraped)
- Nicolas Boumal, An Introduction to Optimization on Smooth Manifolds (2023 prepublication) (standard reference, not scraped)