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.

Composition of continuation maps on homology

Statement

Assume the Axiom of Choice (The Axiom of Choice). Let (fs01,gs01) and (fs12,gs12) be regular continuation data from (f0,g0) to (f1,g1) and from (f1,g1) to (f2,g2) on a closed manifold M, with continuation maps Φ10 and Φ21 (The continuation chain map, Morse--Smale pairs).

Then there exists a regular continuation datum (fs02,gs02) from (f0,g0) to (f2,g2), obtained by splicing the two data with a large gluing window and then making an arbitrarily small generic perturbation fixing the ends, such that [Φ20]=[Φ21]∘[Φ10]:HM∗(f0,g0;Λ)⟶HM∗(f2,g2;Λ). In particular the canonical isomorphisms of Morse homology compose, and Φ02 does not depend on the splicing choices on homology (Morse homology of a Morse--Smale pair).

Facts & Assumptions

Given: The Axiom of Choice, the three Morse--Smale metric pairs, and the two regular continuation data.

[F1]

Regular data can be obtained by arbitrarily small function-and-metric perturbations supported in their interior, with fixed ends; regularity is transverse finite-window endpoint matching (A regular continuation datum between Morse--Smale pairs).

[F2]

Two fixed continuation windows separated by a long autonomous plateau have exact anchor-matching charts. At infinite plateau length the equations are the product of the two regular piece equations; finite charts retain (T,u) (Finite flow matching gives local charts at metric-end broken trajectories).

[F3]

Pointed metric-gradient height paths have a uniform integrable square-root speed bound, and limits split at every actual critical hit; fixed continuation windows converge unshifted relative to their own origins (Continuation trajectories are compact up to breaking).

[F4]

Endpoint sequences orient regular solution kernels; the mixed passage normal blocks have positive determinant (Orientation lines orient the continuation moduli spaces compatibly with gluing).

[F5]

Continuation counts are chain maps; maps of any two regular data with the same ends induce the same homology map (The continuation count is a chain map, Homotopic continuation data give chain homotopic maps, The continuation chain map, Morse homology of a Morse--Smale pair).

Proof

technique · direct, by two fixed-anchor matching and converse compactness
1.1F1F2givenconstruct

Place the first continuation window at a left time origin and the second at a right time origin, separated by an autonomous plateau of the middle pair with length T. Outside the two windows keep the first negative and second positive autonomous ends. Translating each original window in this way gives a smooth spliced datum; the profiles are already constant near their window ends, so their joins are smooth. Retain the label (T,u) in its solution family. In particular identical constant profiles and a constant curve at different T remain different labelled family members.

2.1F1F3step 1.1

Let Tn→∞ and let un be rigid-index solutions of these data from a degree-k critical point p to a degree-k critical point q. Extract the two windows after translating each to its own fixed origin, and the outside pointed tails, by [F3]. Apply the same end height extraction to the plateau, which is autonomous on a compact manifold; its total energy drop is bounded by the range of the middle Morse function. The limit has a first regular continuation piece, a finite middle critical chain, a second regular continuation piece, and possible outer autonomous breaks. Each continuation piece has nonnegative index difference by regularity, and each nonconstant autonomous piece has positive index drop by the actual metric transverse-disk argument of [F3]. Their telescoping sum is ind⁡(p)−ind⁡(q)=0. Hence every autonomous break is absent, both continuation pieces are rigid, and their intermediate critical point is the same. This proves that every long-plateau rigid sequence limits to a pair (u01,u12) of the stated kind. The identical extraction for any endpoint pair of negative index difference would express that negative total as a sum of the two original regular continuation index differences and positive autonomous drops, a contradiction. Hence for each negative-index critical pair there is a plateau threshold beyond which no solution exists. There are finitely many critical pairs, so take their maximum threshold: every sufficiently long unperturbed plateau has no negative-index solutions at any pair.

3.1F2F3F4step 2.1algebra

There are finitely many such pairs by rigid finiteness in [F3]. At each pair the two-anchor chart of [F2] has equations a=Aleft(αT(a,b)), b=Bright(ζT(a,b)) on open boundary-data balls, with identity unknown derivative at infinite length. It gives precisely one nearby rigid solution for every sufficiently large T, and its finite normal derivative is invertible, so that solution is regular. The inverse coverage in [F2] and extraction in step 2.1 show that these finitely many charts exhaust all rigid solutions for all large T: otherwise a sequence outside them would converge to one of their pairs and then be covered. Their neighbourhoods may be chosen disjoint in the broken-pair coordinates. Thus the gluing is a bijection. In the ordered endpoint determinant sequence, the first piece compares the input ray at p with the intermediate unstable-normal ray with sign τ(u01); the second compares that same intermediate ray with the target ray with sign τ(u12). The intermediate rays cancel in their ordered composition. The passage block is positive by [F4], and the finite matching normal matrix has determinant sign that of its identity limit. Therefore the glued rigid sign is exactly τ(u01)τ(u12). Summing proves the chain-level equality of the rigid counts for the unperturbed long plateau.

4.1F1F3F5step 2.1step 3.1construct

At a fixed sufficiently large T, the unperturbed datum need not be regular at nonzero index differences. Apply [F1] to make an arbitrarily small generic interior perturbation that is regular at all pairs. The finitely many rigid-index solutions in step 3.1 already have invertible endpoint normal derivatives, so the finite implicit-function theorem continues each uniquely, preserving its sign. No additional rigid solution can appear away from these neighbourhoods for perturbations tending to zero: uniform pointed-tail and window extraction in [F3] would limit such a sequence to a rigid solution of the unperturbed datum. An outer autonomous break would make the unperturbed middle have negative index difference, forbidden by the uniform long-plateau exclusion in step 2.1. Thus no outer break occurs; the limit is one of the already regular rigid solutions of step 3.1 and lies in its same local chart, a contradiction. Thus a sufficiently small regular perturbation preserves the entire rigid count, and its chain map is Φ21Φ10.

5.1F5step 4.1∎

By [F5] this equality descends to homology. Every other regular splicing with the same fixed end pairs has the same homology map by the augmented chain-homotopy theorem of [F5], independently of plateau length and small perturbation. This proves [Φ20]=[Φ21][Φ10] and the asserted independence of the splicing choices.

Depends on

Used by

Dependency tree · two levels

71 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