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.
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.
Depends on
Used by
- Finite-budget Riemannian trust-region method Algorithm
- Polar retraction on the complex Grassmannian Definition
- Complex finite-basis PC-VAR optimization on Grassmann Example
- Finite-dimensional complex Stiefel and Grassmann manifolds are compact Proposition
- Gradient of a unitary-invariant Hermitian projector energy Proposition
- Complex Stiefel and Grassmann tangent projections Theorem
- The complex Grassmann polar map is a first-order retraction Theorem
Dependency tree · two levels
21 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 3 (2008) (standard reference, not scraped)
- Nicolas Boumal, An Introduction to Optimization on Smooth Manifolds (2023 prepublication) (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)