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.
Every Morse function admits a complete downward gradient-like field on a closed manifold
Statement
If is a closed smooth manifold and is Morse, then admits a complete downward gradient-like vector field.
Facts & Assumptions
Given: A closed smooth manifold and a Morse function .
has finitely many critical points (A Morse function on a compact manifold has finitely many critical points).
Every smooth vector field on a compact manifold is complete (Every smooth vector field on a compact manifold is complete).
A downward gradient-like field must have strict descent off the critical set and the stated Morse-coordinate model at every critical point (Downward gradient-like vector fields for a Morse function).
Proof
By [F1], choose pairwise disjoint Morse-coordinate neighbourhoods of the finitely many critical points, and smaller neighbourhoods inside them. On each smaller neighbourhood prescribe the local field in [F3].
On the complement of the smaller neighbourhoods, is nowhere zero. In each coordinate patch choose a vector with ; a partition of unity and cutoffs that equal one on the smaller neighbourhoods patch these choices with the prescribed local fields to a smooth satisfying both clauses of [F3].
The resulting is smooth on the compact manifold , so [F2] makes it complete. Therefore it is the required complete downward gradient-like field.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
13 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
- Ralph L. Cohen, Bundles, Manifolds, and Homotopy, Proposition 13.6 (standard reference, not scraped)