Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-generated
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.

Broken continuation trajectories and geometric convergence

Definition

Assume ACω (The Axiom of Countable Choice (ACω)) for the smooth-bundle setup. Let (fs,gs) be a regular continuation datum from (f−,g−) to (f+,g+) on a closed manifold M (A regular continuation datum between Morse--Smale pairs), let p∈Crit⁡(f−), q∈Crit⁡(f+) (Morse--Smale pairs), and let C(p,q) be the continuation moduli spaces of the datum.

A broken continuation trajectory from p to q consists of nonconstant autonomous tail pieces and one continuation solution (which may be constant) (γ1−,…,γr−; v; γ1+,…,γs+),r,s≥0, together with critical points p=p0−,p1−,…,pr− of f− and q=p0+,p1+,…,ps+ of f+ such that γi−∈M−(pi−1−,pi−),v∈C(pr−,ps+),γj+∈M+(pj+,pj−1+) for all i,j (Unparametrized Morse trajectory moduli space, A Morse trajectory from one critical point to another). The pieces are read in the temporal order γ1−,…,γr−, v, γs+,γs−1+,…,γ1+; the tuple displays the pieces of the two ends in increasing order of their index-drop chains. The space of broken continuation trajectories from p to q is denoted C‾(p,q); the locus r=s=0 is C(p,q) itself.

The pieces carry the index drops di:=ind⁡(pi−1−)−ind⁡(pi−)≥1,ej:=ind⁡(pj+)−ind⁡(pj−1+)≥1,m:=ind⁡(pr−)−ind⁡(ps+)≥0, which are nonnegative by the emptiness of the corresponding spaces for nonpositive drop (No Morse--Smale trajectories for nonpositive index drop, A regular continuation datum between Morse--Smale pairs), and the index identity ind⁡(p)−ind⁡(q)=r+s+m+∑i=1r(di−1)+∑j=1s(ej−1) holds by telescoping the drops along the two chains (Nondegenerate critical points, nullity, index, and coindex). In particular r+s≤ind⁡(p)−ind⁡(q), and equality holds precisely when every tail piece connects critical points of consecutive index and the middle piece has index difference m=0. The number of tail pieces is bounded by the index drop, exactly as for the broken Morse trajectories of a Morse--Smale pair (Breaking length is bounded by the index drop, Broken Morse trajectories).

A sequence un∈C(p,q) converges geometrically to such a configuration if un→v in C∞ on compact time intervals without shifting the middle solution, and there are shifts ani→−∞ and bnj→+∞ such that un( ⋅+ani)→γi−,un( ⋅+bnj)→γj+ in C∞ on compact intervals, for chosen parametrized representatives of the autonomous orbit classes. Temporal order requires ani+1−ani→+∞ and bnj−1−bnj→+∞. For the middle and each shifted autonomous tail, C0 convergence on compact intervals implies convergence of all derivatives by differentiating the corresponding smooth ODE; the shifted equation on every fixed compact tail interval is eventually the fixed autonomous end equation (The topology of compact convergence on C(X,Y) for metric X and Y: uniform convergence on each compact subset of X, Geometric convergence to a broken trajectory).

The topology on C‾(p,q) uses compact-time tests on the unshifted middle solution and ordered regular-level transversal tests on the autonomous components. A neighbourhood specifies compact intervals and open neighbourhoods of the middle curve on them, and open transversal neighbourhoods along each tail; configurations may smooth some breaks but must pass these tests in the stated order. Shrinking the tests gives a neighbourhood basis, with the compact-convergence topology on the unbroken locus and the corresponding broken-end topology on each stratum. The middle solution's time coordinate is fixed: translating it generally changes the continuation equation. Every middle solution has critical limits by Continuation solutions have critical limits and exponential decay.

Depends on

Used by

Dependency tree · two levels

74 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