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.

Proper end radius and exclusion of finite-time spatial infinity

Statement

Assume the Axiom of Choice and the stationary ADM setting of the section-time speed lemma. Let S‾ be a connected smooth three-manifold with compact boundary, with S=int⁡S‾, and a smooth positive-definite extension of h. Smoothness on S‾ is understood in boundary charts by local smooth extension; the metric and differential norms use the section-time speed lemma's conventions, extended to the boundary using the inverse metric. Suppose N and X extend smoothly to S‾, and supply a smooth function R:S‾→[0,∞) such that every sublevel {R≤m} is compact. This is the proper-radius hypothesis. Suppose outside a compact set K0⊂S‾ one has ∣dR∣h(N+∣X∣h)≤C0. Then there is a finite constant CR such that every causal section-time curve satisfies ∣R(x(v))−R(x(v0))∣≤CR∣v−v0∣. In particular its spatial image for bounded section time stays in a compact subset of S‾, although that subset can meet the boundary. One sufficient end realization of this hypothesis is a compact core with finitely many product ends [r0,∞)×Fj, each Fj compact, and a smooth R equal to their unbounded first coordinate outside a larger compact core, with the displayed estimate for that coordinate.

Statement references

Facts & Assumptions

Given: The data and hypotheses in the Statement.

Goal: The conclusions stated there.

[F1]

The Axiom of Choice implies Dependent Choice and Countable Choice, which discharge the choice hypotheses of the causal-curve calculus and the absolutely-continuous fundamental theorem. The Axiom of Choice AC implies DC implies countable choice

[F2]

The section-time speed lemma makes γ(v)=(v,x(v)) a causal, locally Lipschitz curve on the smooth time-oriented Lorentzian four-manifold E=Rv×S and gives ∣(R∘x)′∣≤N∣dR∣h+∣X(R)∣ almost everywhere. Apply clause (b) of the causal-curve calculus to the smooth scalar F:E→R, F(v,p)=R(p): its composite F∘γ=R∘x is locally absolutely continuous. The required Countable Choice and Dependent Choice follow from F1. ADM section time and causal spatial speed Chart independence, concatenation, reparametrization and transitivity for causal curves

[F3]

Absolutely continuous scalar functions are recovered by integrating their almost-everywhere derivatives. Fundamental theorem of calculus for absolutely continuous functions

[F4]

Boundary charts use the local-extension notion of smoothness, smooth maps are continuous, and a Riemannian metric is a smooth positive-definite symmetric tensor, with smoothness up to the boundary where stated. Smooth charts, atlases, and structures with boundary Smooth maps between manifolds with boundary Riemannian metric and riemannian manifold

[F7]

Every closed bounded real interval is compact, and a finite product of compact spaces is compact in the product topology. Heine-Borel by bisection: every closed bounded interval [a,b] is compact A product of finitely many compact spaces is compact in the product topology

[F8]

A closed subspace of a compact space is compact, and a finite union of compact subspaces is compact, including the empty union. A closed subspace of a compact space is compact, and a finite union of compact subspaces is compact

Proof

1.1givenF2F4F5algebra

In a boundary chart write h=(hij). Positive definiteness makes det⁡(hij) nonzero, so the cofactor formula shows that the inverse matrix (hij) is smooth up to the boundary. The identities ∣dR∣h2=∑i,jhij(∂iR)(∂jR) and ∣X∣h2=∑i,jhijXiXj therefore give continuous nonnegative norms, including at boundary points. The vector with components Yi=∑jhij∂jR satisfies h(Y,X)=dR(X) and ∣Y∣h=∣dR∣h, so Cauchy–Schwarz gives ∣X(R)∣≤∣dR∣h∣X∣h. Thus q=N∣dR∣h+∣X(R)∣ is continuous on S‾.

2.1givenF1F2F3F6step 1.1algebra

If K0 is nonempty, let M0 be the maximum of q on K0; if K0 is empty, set M0=0, with no extreme-value assertion needed there. On S∖K0, step 1.1 and the given estimate imply q≤∣dR∣h(N+∣X∣h)≤C0. Hence CR=max⁡{0,C0,M0} bounds q along every spatial curve in S. The section-time speed lemma gives ∣(R∘x)′∣≤CR almost everywhere. On the compact interval between any two section times v,v0 in the domain of the curve, F2 makes the scalar composition absolutely continuous; the fundamental theorem, with its choice hypotheses supplied by F1, gives ∣R(x(v))−R(x(v0))∣≤CR∣v−v0∣.

3.1givenstep 2.1algebra

If ∣v−v0∣≤T, step 2.1 places the image in {R≤R(x(v0))+CRT}, which is compact in S‾ by the supplied proper-radius hypothesis. This proves confinement in the manifold with boundary; it does not exclude boundary accumulation.

4.1givenF4F6F7F8∎

For the sufficient end realization, let C be the larger compact core containing the transition region so that every point outside C lies in a stated product end where R=r. For any real m, put L=max⁡{r0,m}. The interval [r0,L] is compact, so each [r0,L]×Fj is compact; its image under the end identification is compact by continuity. The union P of those finitely many images with C is compact. If R(p)≤m, either p∈C or its end coordinate satisfies r=R(p)≤m≤L, so p∈P. Continuity of R makes {R≤m} closed in S‾, hence closed in P and compact. This includes the case m<r0, where any points of the sublevel already lie in C. A bounded or nonproper reparameterization of an end coordinate alone supplies no such conclusion.

Depends on

Used by · 3

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.