Alphabeta Math
LemmaStatement: Literature-sourcedProof: Literature-sourcedPipeline-generatedaudited 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.

Precompact trajectory tails have nonempty compact connected flow-invariant limit sets

Statement

Let γ:RM be a full negative-gradient trajectory and let Φ be its flow. If γ([0,)) is compact, then

ω(γ):=T0γ([T,))

is nonempty, compact, connected, and invariant under every Φs. The analogous conclusion holds for α(γ):=T0γ((,T]) when its negative tail has compact closure.

Facts & Assumptions

Given: A full trajectory γ and a compact closure K of its positive tail.

[F2]

The maximal flow is continuous and obeys Φs(γ(t))=γ(t+s) whenever defined (The fundamental theorem on flows).

Proof

technique · direct
1.1

Each KT:=γ([T,)) is a nonempty closed subset of K, the family is decreasing, and each KT is connected because it is the closure of the connected image of [T,).

given
2.1

If T0KT were empty, the open sets KKT would cover K; [F1] would give finitely many of them that cover. Since the KT decrease, one already covers, contradicting KT. Thus ω(γ) is nonempty; it is closed in K, hence compact, and the nested connected-set argument makes it connected.

F1step 1.1
3.1

For fixed s and any T, [F2] sends γ([T,)) into γ([T+s,)) after increasing T if necessary. Continuity therefore sends ω(γ) into itself; applying the same argument to s gives equality.

F2step 2.1
4.1

Replacing t by t gives the asserted nonempty compact connected invariant set α(γ) for a precompact negative tail.

step 1.1step 2.1step 3.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