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.
Critical values of disjoint trajectory closures can be interchanged
Statement
Assume . Let be adapted on a compact triad, and choose regular such that the critical set in consists exactly of finite clusters at values . Suppose there is no -trajectory from a point of to a point of . Then for any , including or , there is an adapted Morse with the same critical points and indices as , on , on , and still downward gradient-like for . The function is outside the interior of and near its two end levels, and is plus a constant near every critical point. On a triad with just these two critical clusters, one may also use its face levels as .
Facts & Assumptions
Morse function adapted to a cobordism gives strict descent and the exact linear Morse-chart flow, with trajectories stopped on exiting a face.
The fundamental theorem on flows gives unique smooth flow; Regular interval diffeomorphism gives finite regular-level transport.
A manifold bump for a compact set inside an open set separates disjoint compact subsets of a regular level by a smooth function.
Increasing reparametrization of finitely many critical levels supplies increasing interval diffeomorphisms fixed near endpoints and equal to translations near specified interior nodes.
Proof
Given: The regular band, the two clusters with no connecting trajectory, and .
Any trajectory staying in indefinitely at one end converges to a critical point. Indeed is monotone and bounded; if an accumulation point were regular, a small flow neighbourhood with bounded below would cause a fixed positive decrease on each repeated passage, contradicting convergence of its values. Thus all accumulation points are critical. The accumulation set is connected, being the intersection of nested connected closures of trajectory tails in compact , and the critical set is finite, so it is a singleton. Otherwise the trajectory exits through an end level in finite time by regular continuation. Let consist of all points on trajectories having an end in the respective cluster, including the critical points and their boundary exits. The absence of connections implies they are disjoint.
These trajectory sets are compact. Choose disjoint small Morse blocks about the finitely many points. Outside the blocks has a positive lower bound, so the total travel time there is bounded by the value width divided by that bound. A limit of trajectories with an end in a cluster either follows the same finite regular pieces or spends unbounded time in a Morse block. In the latter case the equations , give a broken trajectory with an end at that block's critical point. A break connecting different clusters is excluded; a nonconstant break within one cluster is excluded by equal critical values and strict descent. Thus the limiting point is on a trajectory with an end in the same cluster. This proves closedness in compact . The same equations show that regular trajectories approaching have lower-level exits approaching , and similarly for : a passage near a stable disk exits near the local unstable sphere, whose subsequent regular transport is continuous. At a local minimum with empty unstable sphere, a neighbourhood instead has its forward endpoint at that minimum and contains no through-trajectory.
On the lower regular level choose a smooth equal to zero near and one near by [F3]; empty subsets impose no condition. Every trajectory outside goes between the two end levels by step 1.1. Let assign its lower-level exit, a smooth map by transverse hitting-time inversion and [F2]. Define there, and set on , on . Step 2.1 and the constant neighbourhood values of imply that this extension is constant on a neighbourhood of each critical trajectory set, hence smooth. It is constant along every trajectory by construction, so . This is the orbit extension used in Milnor’s preliminary rearrangement theorem and its finite-cluster extension, pp. 37–39; an arbitrary spatial cutoff would not have this property.
Rescale [F4] from to and obtain increasing fixed near , with near and near . Their supports may span both critical values. Put and on , extended by outside. The identity near the end levels makes this extension smooth.
Since and , off the critical set. Near the function is , and near it is ; consequently the Hessians, indices and exact local field models are unchanged. No new critical point occurs, and all other critical neighbourhoods and the boundary are unchanged. The image of stays in , preserving endpoint fibres of the original adapted function, and the same complete collar carrier supplies .
Depends on
- Morse function adapted to a cobordism
- Stable and unstable sets of a critical point
- A Morse trajectory from one critical point to another
- The fundamental theorem on flows
- Regular interval diffeomorphism
- A manifold bump for a compact set inside an open set
- Smooth locally defined functions can be glued by a partition of unity
- A locally finite sum of smooth functions is smooth
- Morse functions and excellent Morse functions
- The Axiom of Countable Choice ($\mathrm{AC}_\omega$)
- Increasing reparametrization of finitely many critical levels
Used by
Dependency tree · two levels
43 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
- John Milnor, Lectures on the h-Cobordism Theorem (notes by L. Siebenmann and J. Sondow), Theorem 4.1 and Extension 4.2, printed pp. 37–39 (standard reference, not scraped)
- Andrei Pajitnov, Circle-Valued Morse Theory (de Gruyter Studies in Mathematics 32), Chapter 5 Sections 1-3 (pp. 163-189) and Chapter 4 Section 3 (pp. 132-162) (standard reference, not scraped)