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.
The continuation chain map
Definition
Assume the Axiom of Choice (The Axiom of Choice). Let be a regular continuation datum from to on a closed manifold (A regular continuation datum between Morse--Smale pairs, Morse--Smale pairs).
Over , for every define extended linearly (The mod-two Morse chain group). The coefficient sum is finite because for the moduli space is compact and zero-dimensional, hence finite (Continuation trajectories are compact up to breaking, part 3), and each critical set is finite (A Morse function on a compact manifold has finitely many critical points, Nondegenerate critical points, nullity, index, and coindex). Only index-matched pairs are counted: negative index difference gives an empty space, while positive index difference may give a nonempty positive-dimensional space, which has no zero-dimensional count in this definition. Thus preserves degree by its displayed formula.
Over fix an orientation (a positive ray in the orientation line) at every critical point of both pairs (The orientation line of a Morse critical point). Define, with the signs of Orientation lines orient the continuation moduli spaces compatibly with gluing, extended linearly (The signed Morse differential over the integers). Here too the inner sum is finite by compactness and the dimension formula, and the outer sum is finite by finiteness of the critical set. The modules are over with the scalar action of The integers as equivalence classes of pairs of naturals and over with the scalar action of The congruence class and the quotient set (Unital left and right modules over a ring; unqualified module means left module).
In both cases is a well-defined homomorphism of graded modules, called the continuation map of the datum. It records the datum, not only its two ends, and it is not induced by a time-translation quotient. The continuation equation is generally not translation invariant; for constant data it is autonomous, and the same unquotiented counting convention applies. That is a chain map is proved separately on this page (Orientation lines orient the continuation moduli spaces compatibly with gluing is used only for the signs in the integral branch).
The metric-end complexes in these formulas are supplied by Arbitrary metric Morse--Smale end counts form finite Morse chain complexes. That lemma extends the same finite count and ordered sign conventions to arbitrary metric ends; it does not assume a normalized Morse-coordinate form for their gradients.
Depends on
- A regular continuation datum between Morse--Smale pairs
- Continuation trajectories are compact up to breaking
- Orientation lines orient the continuation moduli spaces compatibly with gluing
- The mod-two Morse chain group
- The signed Morse differential over the integers
- The orientation line of a Morse critical point
- A Morse function on a compact manifold has finitely many critical points
- The Axiom of Choice
- The integers as equivalence classes of pairs of naturals
- The congruence class $[a]_n$ and the quotient set $\mathbb{Z}/n$
- Unital left and right modules over a ring; unqualified module means left module
- Morse--Smale pairs
- Nondegenerate critical points, nullity, index, and coindex
- Arbitrary metric Morse--Smale end counts form finite Morse chain complexes
Used by
- Continuation across a birth--death pair adds an acyclic summand Example
- The continuation map of constant data is the identity Lemma
- Composition of continuation maps on homology Theorem
- Homotopic continuation data give chain homotopic maps Theorem
- Morse homology is naturally isomorphic to singular homology Theorem
- Reverse continuation is an inverse on Morse homology Theorem
- The continuation count is a chain map Theorem
Dependency tree · two levels
77 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
- Alexander F. Ritter, Part III Morse Homology (Cambridge lecture notes, complete author PDF, 115 pp.) (standard reference, not scraped)
- Michael Hutchings, Math 242 Lecture 21: Invariance via continuation maps (notes by Jackson Van Dyke, complete PDF) (standard reference, not scraped)
- Udhav Fowdar, A Functional Analytic Approach to Morse Homology (UCL 4th-year project, complete PDF, 93 pp.) (standard reference, not scraped)