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.
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.
Depends on
Used by
Dependency tree · two levels
12 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)