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

Geometric convergence to a broken trajectory

Definition

Let (f,X) be a Morse--Smale pair with X downward gradient-like in the normalized Morse-coordinate sense of Downward gradient-like vector fields for a Morse function, on a closed manifold M. Fix a compatible metric d on M (Metric space: d(x,y)=0 iff x=y, symmetry, and the triangle inequality; pseudometric and ultrametric, Topological manifolds are metrizable and paracompact). If f(p)≤f(q), the broken-trajectory space is empty and has the empty topology. Otherwise each broken trajectory v=(v1,…,vr) from p to q has a height parametrization hv:[f(q),f(p)]⟶M. On the height interval of a component, hv(a) is its unique point with f-value a; at an intermediate critical value it is that intermediate critical point, and at the endpoints it is q and p. Strict descent, the component endpoint limits and Broken Morse trajectories make this a continuous map. Its noncritical pieces recover the orbit classes, so v↦hv is injective.

The geometric-convergence topology is the topology transported to M‾(p,q) from this image in C0([f(q),f(p)],M) with the topology of uniform convergence. Equivalently, it is induced by dH(v,w)=max⁡a∈[f(q),f(p)]d(hv(a),hw(a)). The maximum exists because the domain is nonempty and compact. Uniform convergence on this domain is compact-open convergence (The compact-open topology on C(X,Y) for arbitrary topological spaces, On a nonempty compact metric domain, the compact-open topology is the uniform topology). Different compatible metrics on the compact space M give the same topology: the identity between the two compact metric spaces is uniformly continuous, as follows by taking a finite subcover of neighbourhoods on which its oscillation is prescribed.

For ordinary trajectories vn=[γn] and a broken trajectory v=(v1,…,vr), write vn⇝v1#⋯#vr when, for parametrized representatives of the components, there are independent shifts sni such that γn(⋅+sni)→vi in Cloc∞(R,M). Replacing representatives only changes the shifts. Smooth dependence for the flow (The fundamental theorem on flows) implies that C0 convergence on compact time intervals forces all higher derivatives. The equivalence of this shift criterion with convergence in dH is proved in Compactness up to breaking of Morse trajectory spaces ↗.

Here is the neighbourhood description used for gluing (Audin–Damian §3.2.a, printed pp. 60–61). Write p=p0,…,pr=q. Choose disjoint sufficiently small Morse neighbourhoods at all these critical points, including p and q. For each i=1,…,r, prescribe open level-set neighbourhoods Ui−1− of the exit point of vi from the chart at pi−1 and Ui+ of its entry point into the chart at pi. A string w belongs to W(v,U−,U+) if its critical-point string is a subsequence pi0,…,pik with 0=i0<⋯<ik=r, and its jth component exits and enters each intervening chart through the prescribed neighbourhoods, in order. Thus it has at most r components; for r=1 both endpoint transversals are still present.

These sets form a neighbourhood base for the height topology. Shrinking the prescribed transversals controls each compact noncritical segment by smooth finite-time flow dependence; inside a small Morse chart the equations u(t)=e2tu(0), v(t)=e−2tv(0) keep a crossing between its small entry and exit pieces in that chart. This gives uniform height control after subdividing into those finitely many segments and arbitrarily small critical neighbourhoods. Conversely, uniform height closeness forces passage through the prescribed level pieces and permits critical breaks only at points of the limiting string: the critical set is finite and all other critical points are separated from the limiting height graph. The level crossings vary continuously because df(X)≠0 there. This proves the two base containments. On the ordinary stratum the resulting topology is the quotient topology of the parametrized trajectory space, equivalently its regular-level slice topology (A regular level identifies unparametrized trajectories, The unparametrized trajectory space is a smooth manifold, The quotient topology of a surjection, quotient maps, saturated sets, and the quotient of a space by an equivalence relation with its canonical projection); the shift/height equivalence below also verifies this identification.

Depends on

Used by

Dependency tree · two levels

54 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