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.
Precompact trajectory tails have nonempty compact connected flow-invariant limit sets
Statement
Let be a full negative-gradient trajectory and let be its flow. If is compact, then
is nonempty, compact, connected, and invariant under every . The analogous conclusion holds for when its negative tail has compact closure.
Facts & Assumptions
Given: A full trajectory and a compact closure of its positive tail.
A compact space has the finite-subcover property (Open cover, subcover, and compact topological space; a compact subset is a subspace that is compact in its own right).
The maximal flow is continuous and obeys whenever defined (The fundamental theorem on flows).
Proof
Each is a nonempty closed subset of , the family is decreasing, and each is connected because it is the closure of the connected image of .
If were empty, the open sets would cover ; [F1] would give finitely many of them that cover. Since the decrease, one already covers, contradicting . Thus is nonempty; it is closed in , hence compact, and the nested connected-set argument makes it connected.
For fixed and any , [F2] sends into after increasing if necessary. Continuity therefore sends into itself; applying the same argument to gives equality.
Replacing by gives the asserted nonempty compact connected invariant set for a precompact negative tail.
Depends on
Used by
Dependency tree · two levels
14 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)