Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-generatedverified 2026-09-26 (gpt-6-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.

The fundamental theorem on flows

Statement

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.

Facts & Assumptions

Given: A smooth vector field X on M.

[L1]

Every point lies on a unique maximal integral curve (Through each point there is a unique maximal integral curve).

[L2]

Integral curves exist uniquely on uniform local time intervals and depend smoothly on the initial point (Local existence, uniqueness, and smooth dependence for manifold integral curves).

Proof

technique · direct
1.1L1given

By [L1], for each p∈M there is a unique maximal integral curve γp:Ip→M through p. Therefore the set D and the map Φ(t,p)=γp(t) are well defined, each fibre Dp=Ip is an open interval containing 0, and Φ(0,p)=p.

1.2L1L2given

Fix p∈M and s∈Ip, and put q:=Φ(s,p)=γp(s). Then the translated curve t↦γp(t+s) is an integral curve through q on the interval Ip−s:={t:t+s∈Ip}. By uniqueness of maximal integral curves, it agrees with γq on their common domain, so Φ(t,Φ(s,p))=Φ(t+s,p) whenever both sides are defined. The same translation argument applied to γq shows Iq=Ip−s.

2.1L2step 1.1choose

Fix (τ,p0)∈D. The trajectory segment K=γp0([0,τ]) if τ≥0, or K=γp0([τ,0]) if τ<0, is compact. By [L2], every q∈K has an open neighbourhood Uq and a smooth local flow Ψq:(−εq,εq)×Uq→M. A finite subcover of K gives a common lower time bound ε>0 for these finitely many local flows. Partition the interval from 0 to τ as 0=t0,t1,…,tm=τ with ∣tj−tj−1∣<ε. For each j, choose one of the finitely many Uq containing γp0(tj−1) and use its local flow for the time increment tj−tj−1. This requires only finitely many choices.

3.1L2step 1.2step 2.1construct

Starting with the identity near p0, compose the finitely many smooth local time-increment maps from step 2.1. By continuity, shrink the initial neighbourhood U of p0 finitely many times so that every intermediate image lies in the domain of the next local map. The resulting smooth map p↦qm(p) satisfies qm(p0)=γp0(τ); uniqueness of integral curves makes qm(p)=Φ(τ,p) for every p∈U. Apply [L2] once more at qm(p0), and shrink U so that qm(U) lies in its local-flow neighbourhood. For t in a small open interval J about τ, the formula Ψ(t−τ,qm(p)) is smooth on J×U and, by uniqueness, equals Φ(t,p). Hence J×U⊆D. Since (τ,p0) was arbitrary, D is open and Φ is smooth.

4.1step 1.2step 3.1

Step 3.1 makes each slice Dt:={p:(t,p)∈D} open in M. For p∈Dt, step 1.2 gives IΦ(t,p)=Ip−t, so −t∈IΦ(t,p) and hence Φ(t,p)∈D−t. The same step also yields Φ(−t,Φ(t,p))=Φ(0,p)=p, and symmetrically Φ(t,Φ(−t,q))=q for q∈D−t. Thus Φt:Dt→D−t is a diffeomorphism with inverse Φ−t.

5.1step 1.1step 1.2step 3.1step 4.1∎

Steps 1.1-4.1 show that Φ:D→M is a smooth local flow whose time slices are exactly the maximal integral curves of X. Any other local flow of X has the same time slices by uniqueness of integral curves, so its domain is contained in D and its map agrees with Φ. Therefore Φ is the unique maximal local flow generated by X.

Depends on

Used by

…and 34 more results.

Dependency tree · two levels

8 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