Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck pass
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.

Reverse continuation is an inverse on Morse homology

Statement

Assume the Axiom of Choice (The Axiom of Choice). Let (fs,gs) be a regular continuation datum from (f−,g−) to (f+,g+) on a closed manifold M, and let (fˉs,gˉs) be a regular continuation datum from (f+,g+) to (f−,g−) obtained from the reversed family (f−s,g−s) by a sufficiently small generic perturbation fixing the two ends (regular data are residual in the space of paths with fixed ends, as recorded in the definition); denote the continuation maps by Φ and Φˉ (The continuation chain map, A regular continuation datum between Morse--Smale pairs).

Then [Φˉ]∘[Φ]=id⁡HM∗(f−,g−;Λ),[Φ]∘[Φˉ]=id⁡HM∗(f+,g+;Λ), so [Φ]:HM∗(f−,g−;Λ)→HM∗(f+,g+;Λ) is an isomorphism with inverse [Φˉ] (Morse homology of a Morse--Smale pair). In particular the Morse homologies of any two Morse--Smale pairs on a closed manifold are canonically isomorphic by continuation.

Facts & Assumptions

Given: The Axiom of Choice, a regular continuation datum (fs,gs) from (f−,g−) to (f+,g+), and a regular continuation datum (fˉs,gˉs) from (f+,g+) to (f−,g−) obtained by a small generic perturbation, fixing the ends, of the reversed family (f−s,g−s).

[F1]

The reversed family (fˉs(0),gˉs(0)):=(f−s,g−s) is a continuation datum from (f+,g+) to (f−,g−): it is smooth, it equals (f+,g+) for s≤−S and (f−,g−) for s≥S, and its continuation equation is ∂sv=−∇gˉs(0)fˉs(0)(v). Reversing the parameter in a solution u of the original equation gives dds(u(−s))=+∇g−sf−s(u(−s)), the positive-gradient equation, so the solutions of the reversed family are not the time reversals of the solutions of the original equation and regularity of the reversed family is a separate condition. When both the function path and the metric path may vary, regular data form a residual set with fixed ends. Thus the reversed family can be perturbed arbitrarily little in both components, fixing its two ends, to a regular datum; the datum (fˉs,gˉs) of the statement is such a perturbation (A regular continuation datum between Morse--Smale pairs).

[F2]

The composition law: the composite of the continuation maps along a spliced datum is the homology map of that spliced datum, which is independent of the splicing choices (Composition of continuation maps on homology, A regular two-parameter continuation datum).

[F3]

The spliced datum for the pair of reverse data from (f−,g−) back to (f−,g−) is joined by a regular two-parameter family to the constant datum, so the two continuation maps are chain homotopic; the constant datum's continuation map is the identity (Homotopic continuation data give chain homotopic maps, The continuation map of constant data is the identity).

[F4]

Chain homotopic maps induce the same map on homology, and the identity on a chain complex induces the identity on homology (Morse homology of a Morse--Smale pair, The continuation chain map).

Proof

technique · direct
1.1F1given

By [F1] (fˉs,gˉs) is a regular continuation datum from (f+,g+) to (f−,g−), so both Φ and Φˉ are well-defined continuation maps and induce maps on Morse homology; the argument below uses only that the two data join the same two end pairs, in opposite directions.

2.1F2step 1.1

Apply the composition law of [F2] to the pair (Φ,Φˉ) in the order from (f−,g−) to (f+,g+) and back: there is a regular spliced datum from (f−,g−) to itself whose homology map equals [Φˉ]∘[Φ].

3.1F3step 2.1

Applying [F3] to that spliced datum connects it by a regular two-parameter family to the constant datum; hence [Φˉ]∘[Φ] equals the homology map of the constant datum, which is the identity. This gives the first identity.

4.1F4step 3.1∎

The same argument with the roles of the two pairs exchanged gives [Φ]∘[Φˉ]=id⁡HM∗(f+,g+;Λ); the two identities together say that [Φ] is an isomorphism with inverse [Φˉ], which is the last assertion.

Depends on

Used by

Dependency tree · two levels

52 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