How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
The 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.
Depends on
- Polar retraction on the complex Grassmannian
- Complex Stiefel and Grassmann optimization conventions
- Stiefel spaces, Grassmannians, and tautological bundles
- Complex Stiefel and Grassmann tangent projections
- Positive-definite bundle endomorphisms have smooth positive square roots
- Matrix inversion preserves $C^k$ regularity where the determinant is nonzero
Used by
Dependency tree · two levels
20 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
- Peter A. Absil, Robert Mahony, and Rodolphe Sepulchre, Optimization Algorithms on Matrix Manifolds, Chapter 4 (2008) (standard reference, not scraped)
- Nicholas D. S. Manton, Optimization algorithms exploiting unitary constraints, IEEE Transactions on Signal Processing 50 (2002), §§IV and VI (standard reference, not scraped)
- Nicolas Boumal, An Introduction to Optimization on Smooth Manifolds (2023 prepublication) (standard reference, not scraped)