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.

Flow reparametrization realizes a level isotopy

Statement

Assume ACω. Let X be a complete downward gradient-like field for a smooth function f on a smooth manifold, let f−1[a,b] be a compact regular band, and let ht, t∈[0,1], be a smooth isotopy of f−1(b) with h0=id whose support is contained in a compact subset. Then there is a complete downward gradient-like field X′ for f, equal to X outside f−1(a,b), such that the diffeomorphism f−1(a)→f−1(b) obtained by following X′-trajectories backwards equals h1∘φ, where φ is the corresponding diffeomorphism for X.

Facts & Assumptions

[F1]

Regular interval diffeomorphism: Assume ACω. If a<b and the closed band K=f−1([a,b]) of a smooth function on a boundaryless manifold is compact and critical-point-free, its normalized flow gives a level-preserving diffeomorphism T:Ma×[a,b]→K, T(x,t)=Φt−a(x).

[F2]

The fundamental theorem on flows: Let X be a smooth vector field on M. For each p∈M, let γp:Ip→M be the maximal integral curve through p, and set D:={(t,p)∈R×M:t∈Ip}, Φ(t,p):=γp(t). Then D is open in R×M, each fibre Dp is an interval containing 0, the map Φ:D→M is smooth, and Φ is the unique maximal local flow generated by X.

[F3]

A manifold bump for a compact set inside an open set: Let M be a smooth manifold, let K⊆M be compact, and let W⊆M be open with K⊆W. Then there exists a smooth function ρ:M→[0,1] that equals 1 on an open neighbourhood of K and satisfies supp⁡(ρ)⊆W.

[F4]

Compactly supported smooth vector fields are complete: Assume ACω (The Axiom of Countable Choice (ACω)). Every compactly supported smooth vector field on a smooth manifold is complete.

[F5]

Time-t flow maps are diffeomorphisms between open domains: Let Φ:D→M be the maximal flow of a smooth vector field X. For each t∈R, the time-t map Φt:Dt→D−t, Φt(p):=Φ(t,p), where Dt:={p:(t,p)∈D}, is a diffeomorphism with inverse Φ−t.

[F6]

Pushforwards and pullbacks of vector fields by a diffeomorphism: Assume ACω, so that TM and TN carry their canonical smooth structures. Let F:M→N be a diffeomorphism. For a smooth vector field X on M, the pushforward F∗X is the unique vector field on N that is F-related to X, explicitly (F∗X)F(p):=dFp(Xp). Because F and F−1 are smooth, the pushforward is a smooth vector field.

Proof

Given: The objects and hypotheses in the statement, and the compact regular band K=f−1[a,b].

1.1F1F2givenalgebra

On K the function λ:=−df(X) is smooth and strictly positive, because K has no critical point and df(X)<0 off the critical set; it is bounded below by a constant c>0 as K is compact. Put Z:=X/λ on K, so df(Z)=−1. By [F1], equivalently reversing the normalized downward flow, T(q,s)=Φb−sZ(q) is a level-preserving diffeomorphism T:f−1(b)×[a,b]→K with f(T(q,s))=s and T(q,b)=q; in these coordinates Z corresponds to −∂s, and the X-trajectory transport φ:f−1(a)→f−1(b) is φ(T(q,a))=q.

2.1F6step 1.1constructchoose

Choose a smooth function α:[a,b]→[0,1] with α=0 on a neighbourhood of a and α=1 on a neighbourhood of b; it exists by [F3] after a translation and rescaling of the interval. Define a diffeomorphism F of f−1(b)×[a,b] by F(q,s):=(hα(s)(q),s), with inverse (q,s)↦(hα(s)−1(q),s); thus F preserves the level coordinate, it is the identity near s=a, and its restriction to s=b is h1. Let X^ be the field on K whose coordinates under T are F∗(−∂s).

3.1F6step 1.1step 2.1algebra

The field X^ is smooth, and df(X^)=−1: on each level set f=s the differential of F pushes −∂s to a vector whose level component is −1 and whose tangential component is horizontal, so X^ descends the levels at unit speed. Because α is constant near the ends of [a,b], F∗(−∂s)=−∂s on a neighbourhood of f−1(a)∪f−1(b), hence X^=Z there. Define X′:=λX^ on the closed band K and X′:=X outside K. The two definitions agree on a neighbourhood of ∂K, so X′ is a smooth field on all of M; on K one has df(X′)=−λ<0, and off K the field is X, which is downward gradient-like and has all of its critical points outside K. Hence X′ is downward gradient-like for f and equals X outside f−1(a,b).

4.1F2F4F5step 1.1step 3.1algebra

The field X′ is complete. A smooth trajectory confined to the compact band extends across every finite time endpoint by local flow existence and a finite chart cover. Moreover f strictly decreases along every nonconstant X′-trajectory, so such a trajectory meets the band K in at most one time interval; inside K the coordinates F−1∘T−1 turn X′ into a positive rescaling of −∂s, with λ≥c>0, so the time spent in K is at most (b−a)/c; outside K trajectories are X-trajectories, and X is complete. A maximal X′-trajectory therefore has no finite endpoint: after crossing K it agrees with a maximal X-trajectory, which is defined on all of R.

5.1step 1.1step 2.1step 3.1algebra∎

Compute the level transport of X′. Trajectories of X′ and of X^ have the same images because X′=λX^ with λ>0; under T, the X^-trajectories are the images under F of the −∂s-trajectories. Take x=T(q,a)∈f−1(a) and follow the X′-trajectory backwards, or equivalently the normalized ascending field −X′/λ: in (q,s)-coordinates it runs through F−1(q,a)=(q,a) because F is the identity near s=a, then through (q,a+u) at ascending normalized parameter u, then through F(q,a+u)=(hα(a+u)(q),a+u). At ascending normalized time u=b−a this is (h1(q),b)=h1(q)∈f−1(b). Since φ(x)=q, the transport of X′ from level a to level b is exactly h1∘φ.

Depends on

Used by

Dependency tree · two levels

30 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