Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passjudge 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.

Critical values of disjoint trajectory closures can be interchanged

Statement

Assume ACω. Let (f,X) be adapted on a compact triad, and choose regular 0<u<c<c′<v<1 such that the critical set in K=f−1[u,v] consists exactly of finite clusters P,Q at values c,c′. Suppose there is no X-trajectory from a point of Q to a point of P. Then for any a,a′∈(u,v), including a>a′ or a=a′, there is an adapted Morse g with the same critical points and indices as f, g=a on P, g=a′ on Q, and X still downward gradient-like for g. The function is f outside the interior of K and near its two end levels, and is f plus a constant near every critical point. On a triad with just these two critical clusters, one may also use its face levels as u,v.

Facts & Assumptions

[F1]

Morse function adapted to a cobordism gives strict descent and the exact linear Morse-chart flow, with trajectories stopped on exiting a face.

[F2]

The fundamental theorem on flows gives unique smooth flow; Regular interval diffeomorphism gives finite regular-level transport.

[F3]

A manifold bump for a compact set inside an open set separates disjoint compact subsets of a regular level by a smooth function.

[F4]

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 a,a′∈(u,v).

1.1F1F2givenalgebra

Any trajectory staying in K indefinitely at one end converges to a critical point. Indeed f is monotone and bounded; if an accumulation point were regular, a small flow neighbourhood with −df(X) 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 K, 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 KP,KQ 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.

2.1F1F2step 1.1algebra

These trajectory sets are compact. Choose disjoint small Morse blocks about the finitely many points. Outside the blocks −df(X) 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 u(t)=e2tu(0), v(t)=e−2tv(0) 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 K. The same equations show that regular trajectories approaching KP have lower-level exits approaching KP∩f−1(u), and similarly for Q: 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.

3.1F2F3step 1.1step 2.1construct

On the lower regular level choose a smooth b equal to zero near KP∩f−1(u) and one near KQ∩f−1(u) by [F3]; empty subsets impose no condition. Every trajectory outside KP∪KQ 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 β=b∘σ there, and set β=0 on KP, β=1 on KQ. Step 2.1 and the constant neighbourhood values of b 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 dβ(X)=0. 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.

4.1F4step 3.1construct

Rescale [F4] from [0,1] to [u,v] and obtain increasing ϕ0,ϕ1 fixed near u,v, with ϕ0(s)=s+a−c near c and ϕ1(s)=s+a′−c′ near c′. Their supports may span both critical values. Put G(s,t)=(1−t)ϕ0(s)+tϕ1(s) and g=G(f,β) on K, extended by f outside. The identity near the end levels makes this extension smooth.

5.1F1step 3.1step 4.1algebra∎

Since ∂sG>0 and dβ(X)=0, dg(X)=(∂sG)df(X)<0 off the critical set. Near P the function is f+a−c, and near Q it is f+a′−c′; 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 G stays in [u,v], preserving endpoint fibres of the original adapted function, and the same complete collar carrier supplies X.

Depends on

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