Alphabeta Math
LemmaStatement: AI-generatedProof: AI-generated
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.

An interior compact causal trajectory has a finite-time endpoint

Statement

Assume the Axiom of Choice and the stationary ADM causal conventions of the section-time speed lemma. If a causal curve (v,x(v)), v∈[v0,v∗), with v∗<∞, has spatial image in a compact interior subset K⊂S, then it converges to a point (v∗,p)∈E. The corresponding conclusion holds at a finite lower endpoint. Consequently neither end of a causal curve that is inextendible in E can have finite section time while its spatial projection stays in an interior compact set.

Facts & Assumptions

Given: The data and hypotheses in the Statement.

Goal: The conclusions stated there.

[F1]

The Axiom of Choice supplies inherited countable and dependent choice assumptions. The Axiom of Choice AC implies DC implies countable choice

[F2]

A causal curve in section time is locally Lipschitz and has ∣x′∣h≤N+∣X∣h; inextendibility is absence of an endpoint. ADM section time and causal spatial speed

[F4]

A positive-definite smooth metric uniformly bounds the Euclidean norm on a compact coordinate ball. Local comparison of a riemannian metric with the euclidean metric

[F5]

For absolutely continuous coordinate functions the integral of the derivative gives their endpoint difference. Fundamental theorem of calculus for absolutely continuous functions

[F6]

A continuous real-valued function on a nonempty compact metric space is bounded. A continuous real-valued function on a nonempty compact metric space is bounded and attains a greatest and a least value

Proof

1.1F1F2F3F4F6choose

The smooth ADM data make N+∣X∣h continuous on K. Since x(v0)∈K, this compact set is nonempty. The extreme-value theorem therefore bounds N+∣X∣h on K, say by B. Choose times vj↑v∗; compactness gives a subsequence for which x(vj)→p∈K. Take an interior coordinate ball centered at p, with coordinate radius r>0 and compact closure in its chart. Metric comparison on its closure gives h(Y,Y)≥c∣Y∣e2 for c>0. Thus while the curve remains in the ball, ∣x′∣e≤B/c=:D almost everywhere.

2.1F1F2F5step 1.1algebra∎

Choose a subsequence time vj so late that its coordinate distance from the center is less than r/4 and D(v∗−vj)<r/4; for D=0 only the first condition is needed. Were there a subsequent exit from the coordinate ball, continuity would give a first exit, but integration of the coordinate speed up to that exit would give total displacement less than r/4, contradicting the required displacement of more than 3r/4. Hence the whole remaining tail stays in that chart. Its coordinates are D-Lipschitz and are Cauchy as v↑v∗. They converge to the coordinate of p, since the chosen subsequence does. Thus (v,x(v))→(v∗,p)∈E. The argument with reversed parameter direction treats a finite lower endpoint. Such a limit contradicts precisely the endpoint definition of inextendibility.

Depends on

Used by · 2

Dependency tree · 2 levels

Each result is drawn at its shortest distance from this item. Arrows run from prerequisites to the items that use them; this item has a heavier outline. External source nodes link directly to the cited text. The view shows up to two dependency steps; open a prerequisite to continue.