Alphabeta Math
TheoremStatement: Literature-sourcedProof: Literature-sourcedPipeline-generatedjudge pass (gpt-6.1-sol)
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.

Compactness up to breaking of Morse trajectory spaces

Statement

Assume the Axiom of Choice. Let (f,X) be Morse--Smale on a closed manifold M, with X downward gradient-like in the normalized Morse-coordinate sense, and let p≠q be critical points. Every sequence in M(p,q) has a subsequence converging after independent time shifts in Cloc∞ to a broken trajectory from p to q. The height-map compactification M‾(p,q) is compact, metrizable and second countable, with M(p,q) open and dense. Its height parametrization identifies it homeomorphically with a compact subset of C0([f(q),f(p)],M) with the compact-open topology. Every broken limit has at most λ(p)−λ(q) components. If f(p)≤f(q) both trajectory spaces are empty.

Facts & Assumptions

Given: AC, the stated pair and endpoints.

[A1]

AC supplies the metric and the compactness/choice inputs below (The Axiom of Choice, AC implies DC implies countable choice).

[F1]

Broken strings have strictly decreasing critical values and indices, and length bounded by the index drop (Broken Morse trajectories, Breaking length is bounded by the index drop).

[F2]

The height topology is the uniform topology on the injective image v↦hv; on a compact metric domain it is compact-open topology (Geometric convergence to a broken trajectory, On a nonempty compact metric domain, the compact-open topology is the uniform topology).

[F3]

The flow is smooth and unique, df(X)<0 away from critical points, and near a critical point c the local model is X=(2u,−2z), f=f(c)−∣u∣2+∣z∣2 (The fundamental theorem on flows, Downward gradient-like vector fields for a Morse function, Local stable and unstable manifolds at a Morse critical point).

[F5]

Under AC, M has a compatible metric, and equicontinuous families into a compact metric target have compact compact-open closure (Topological manifolds are metrizable and paracompact, Under Choice, an equicontinuous family into a compact metric target has compact compact-open closure).

[F8]

Under AC an auxiliary Riemannian metric exists; its distance on a connected component is a metric inducing the manifold topology and is bounded above by curve lengths, with uniform chart norm comparison on compact chart closures (Every smooth manifold admits a riemannian metric, Riemannian distance on a connected manifold, Riemannian distance is a metric, The riemannian distance topology is the manifold topology, Local comparison of a riemannian metric with the euclidean metric). Components of a manifold are open; being components they are also closed, hence compact here (Components of a topological manifold are open and at most countable).

[F7]

Every broken trajectory is a limit of ordinary ones (Every broken trajectory is a limit of ordinary trajectories).

Proof

technique · direct, by compactness of height parametrizations
1.1A1F1F3F4F5F8algebra

If p,q lie in different components, both trajectory spaces are empty. Otherwise work on their compact connected component and fix the compatible metric of [F5] and the auxiliary metric of [F8]. Suppose f(p)>f(q). Each height curve hv is continuous by its component endpoint limits and [F1]. In a Morse chart of value α=f(c) its Euclidean speed at a noncritical height a satisfies ∣dhvda∣=12∣u∣2+∣z∣2≤12∣a−α∣. Away from finitely many smaller critical charts, ∣X∣/∣df(X)∣ is bounded on a compact set. In the auxiliary Riemannian metric, [F8] bounds chart norm comparisons on compact chart closures. Thus the length over any height interval of length δ is at most Lδ+C∑αδ, uniformly in v: integrate ∣a−α∣−1/2, whose integral over such an interval is at most 4δ, and add the finitely many chart bounds. The estimate also holds across breaks by continuity and addition of lengths. Since Riemannian distance is bounded by these lengths, it proves equicontinuity in that distance; limits at finitely many breaks preserve the distance bound by continuity. Passage to the compatible metric uses uniform continuity on the compact component.

2.1F1F3F4step 1.1

Let hvn→h uniformly. Then h(f(q))=q, h(f(p))=p and f(h(a))=a. The set Z of heights at which h(a) is critical is finite by [F4] and includes both endpoints. On each component J of [f(q),f(p)]∖Z, a small compact subinterval has image separated from the critical set. For large n the approximating curves have no break there and solve hvn′=X(hvn)/df(X)(hvn). Passing to the integral equation on this compact subinterval gives the same equation for h; uniqueness makes its pieces one orbit on all of J. Its endpoints are critical by continuity. Reparametrizing by flow time gives a nonconstant full trajectory between them: a smooth flow cannot reach or leave an equilibrium in finite time, by uniqueness in [F3]. Thus every interval between consecutive heights in Z is a connecting component, including any newly acquired break; h is the height map of a broken trajectory. Its length is bounded by [F1]. This proves that the height image is closed in the uniform metric mapping space.

2.2F2F3F4step 1.1

For an ordinary sequence, uniform height convergence to hv implies shift convergence: select a noncritical height in each component of v, translate each trajectory to that crossing, and use smooth flow dependence at the converging initial points in [F3]. Conversely, shift convergence implies pointwise height convergence at every noncritical point of every component, by the unique transverse level crossing. Those heights are dense in the closed height interval. Equicontinuity from step 1.1 and continuity of hv upgrade convergence on this dense set to uniform convergence: a finite sufficiently fine height mesh controls every value by the triangle inequality. Consequently the two convergence criteria agree. For r=1, the same argument identifies the height topology with the compact-open time-translation quotient and its regular-level slice.

3.1A1F2F3F5F6step 1.1step 2.1

By step 1.1 and [F5] the closure of the height image is compact; by step 2.1 it is the image itself. The height metric in [F2] therefore makes M‾(p,q) compact and metrizable, and [F6] makes it second countable. The image statement is exactly the defining identification in [F2]. If f(p)≤f(q) the spaces are empty by strict descent and the same conclusions hold for the empty image.

4.1A1F1F3F4F6F7step 3.1step 2.2∎

The ordinary stratum is open. Otherwise a sequence of broken height maps would approach an ordinary height map; by finiteness in [F4], after a subsequence one of their intermediate critical points would be a fixed c, forcing hv(f(c))=c. An ordinary connecting orbit has no intermediate critical point by flow uniqueness, a contradiction. Density is [F7]. Sequential compactness from step 3.1 and [F6], together with step 2.2, proves the asserted subsequence convergence, and [F1] bounds its length.

Depends on

Used by

Cited to discharge well-definedness by Geometric convergence to a broken trajectory.

Dependency tree · two levels

100 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