Alphabeta Math
PropositionStatement: Literature-sourcedProof: Literature-sourcedPipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-06
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.

Proper Morse slabs prevent finite-time escape of connecting trajectories

Statement

Let γ:IM be a maximal negative-gradient trajectory. If its image is contained in a compact Morse slab f1([a,b]), then I=R. Consequently, this applies to any trajectory already known to have endpoint levels in [a,b] and to remain in that slab; it is not a blanket noncompact-completeness assertion.

Facts & Assumptions

Given: A maximal negative-gradient trajectory γ:IM with image in the compact slab K=f1([a,b]).

[F1]

A compact Morse slab is a compact inverse image f1([a,b]) (Proper smooth functions and compact Morse slabs).

[F2]

The energy identity makes fγ nonincreasing (A negative-gradient trajectory satisfies the energy identity).

[F3]

Near every point of M, the vector field has unique integral curves on a uniform local time interval (Local existence, uniqueness, and smooth dependence for manifold integral curves).

[F4]

A maximal integral curve cannot have a genuine extension (Through each point there is a unique maximal integral curve).

Proof

technique · direct
1.1

Suppose the right endpoint T of I were finite. The local flow neighbourhoods supplied by [F3] cover the compact set K in [F1], so finitely many suffice; their time radii have a positive minimum ε.

F1F3assume-contra
2.1

Choose tI with Tt<ε. Since γ(t)K, the corresponding local solution from [F3] extends γ beyond T; uniqueness identifies it with γ on the overlap, contradicting [F4].

F3F4step 1.1choosedischarge-contradiction
3.1

The same argument at the left endpoint proves I=R. If endpoint levels lie in [a,b], [F2] verifies the usual monotone trapping in that slab once the trajectory is known to remain between those levels.

F2step 2.1

Depends on

Used by

Dependency tree · two levels

14 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