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 precompact end-limit point of a negative-gradient trajectory is critical
Statement
Every point of a nonempty precompact - or -limit set of a full negative-gradient trajectory is a critical point of .
Facts & Assumptions
Given: A full negative-gradient trajectory with a precompact positive or negative tail.
Its tail-limit set is nonempty and flow-invariant (Precompact trajectory tails have nonempty compact connected flow-invariant limit sets).
A noncritical point has nonzero gradient (The Riemannian gradient vanishes exactly at the critical points).
Proof
On a precompact positive tail, is decreasing by [F2] and bounded below because is continuous on its compact closure. It therefore has a finite limit ; every point of is a limit of tail values and has . The same argument, with increasing time reversed, applies to .
Let lie in either limit set. If were noncritical, [F3] and [F2] would give a sufficiently short positive orbit segment from on which strictly decreases.
By [F1] the entire short segment in step 1.2 remains in the same limit set, whereas step 1.1 makes constant there. This contradiction proves that is critical.
Depends on
Used by
Dependency tree · two levels
9 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
- Liviu I. Nicolaescu, An Invitation to Morse Theory, Lemma 2.4.1 (standard reference, not scraped)