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.

Collar barrier against finite section-time boundary arrival

Statement

Assume the Axiom of Choice and the stationary ADM setting with causal curves of the section-time speed lemma. Let the spatial slice be the interior of a smooth manifold S‾ with compact boundary B. A supplied collar is a diffeomorphism [0,ϵ)×B onto a boundary neighborhood; its first coordinate is ρ, and ρ=0 exactly on B. Here diffeomorphism means a bijection that is smooth, with smooth inverse, in boundary charts. Suppose h extends smoothly and positively to the boundary, and in the collar N≤Aρ, ∣X(ρ)∣≤Aρ, and ∣dρ∣h≤A, with A<∞. Fix 0<a<ϵ and define b(x)=min⁡(ρ(x),a) in the collar and b(x)=a outside it. For every causal section-time curve and every two times in its interval, b(x(v))≥b(x(v0))e−C∣v−v0∣, with C=A2+A. Thus no finite section-time endpoint can lie on B, including for curves that leave and re-enter the collar.

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, supplying the choice assumptions of the analytic and smooth-composition suppliers. The Axiom of Choice AC implies DC implies countable choice

[F2]

Every causal curve can use section time; the resulting curve γ(v)=(v,x(v)) is locally Lipschitz in charts, is future causal, and obeys ∣x′+X∣h≤N almost everywhere. The norms, gradient and vector-field action have the conventions in the ADM supplier. ADM section time and causal spatial speed

[F3]

Absolutely continuous scalar functions satisfy the fundamental theorem of calculus. Fundamental theorem of calculus for absolutely continuous functions

[F4]

For a continuous nonnegative function satisfying either oriented integral inequality with constant coefficients, Gronwall gives u(t)≤AeC∣t−t0∣. Gronwall's integral inequality with variable and constant coefficients

[F5]

For a locally absolutely continuous future causal curve with nonzero velocity almost everywhere in a time-oriented smooth Lorentzian four-manifold, composition with a smooth map defined on an open set containing the curve image is locally absolutely continuous and satisfies the chain rule almost everywhere. Apply this statement to restrictions of the curve when the map is only locally defined. Chart independence, concatenation, reparametrization and transitivity for causal curves

[F6]

Cauchy–Schwarz for the inner product h gives ∣dρ(Y)∣=∣h(grad⁡hρ,Y)∣≤∣dρ∣h∣Y∣h at each point where ρ is defined. Cauchy–Schwarz: |⟨ u,v⟩|≤‖ u‖‖ v‖, with equality exactly for linearly dependent vectors

[F7]

Interior points and boundary points of a smooth manifold with boundary are specified by the positive and zero last coordinate, respectively, in a boundary chart; here S=Int⁡S‾ and B=∂S‾. Interior and boundary of a manifold with boundary

[F8]

Smooth structures with boundary are maximal compatible atlases of boundary charts; maps are smooth when their boundary-chart representatives are smooth in the local-extension sense. The collar and its inverse use these conventions. Smooth charts, atlases, and structures with boundary Smooth maps between manifolds with boundary

Proof

1.1F1F2F5F6F8algebra

Let U be the collar intersected with S, an open subset of S. The inverse collar map is smooth in boundary charts; taking its first coordinate makes ρ smooth on U, so the map F(v,p)=ρ(p) below is smooth. On every section-time subarc whose spatial image lies in U, apply smooth composition to F:R×U→R, F(v,p)=ρ(p), and the causal curve γ(v)=(v,x(v)). Then r=ρ∘x is locally absolutely continuous and r′=dρ(x′)=dρ(x′+X)−X(ρ) almost everywhere. The pointwise Cauchy–Schwarz inequality and the ADM vector-speed bound therefore give ∣r′∣≤∣dρ∣h∣x′+X∣h+∣X(ρ)∣≤N∣dρ∣h+∣X(ρ)∣. This uses no global extension of ρ.

2.1F3F4step 1.1givenalgebra

Within a connected time interval on which ρ<a, the speed estimate gives ∣ρ′∣≤Cρ almost everywhere. On any compact subinterval [s,t] of it, the fundamental theorem gives ρ(u)≤ρ(t)+C∫utρ(w) dw for s≤u≤t. The reflected Gronwall inequality yields ρ(s)≤ρ(t)eC(t−s), or ρ(t)≥ρ(s)e−C(t−s). Applying the forward version gives the same lower bound in the reverse orientation.

3.1F2step 2.1algebra∎

For v≥v0, if ρ(x(v))≥a or x(v) is outside the collar, the asserted bound is immediate since b(x(v))=a≥b(x(v0)). Otherwise use the connected component of {u:ρ(x(u))<a} containing v. If the component does not contain v0, its left endpoint ℓ satisfies v0≤ℓ<v, including the case ℓ=v0. Continuity gives ρ(x(ℓ))=a; pass to that endpoint in the previous lower bound. If the component contains v0, use the value ρ(x(v0)) instead. Both cases give the stated estimate with elapsed time at most v−v0. Reversing the time interval proves the other orientation. The positive resulting lower bound for bounded elapsed time excludes all boundary approaches, even with repeated collar entries.

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.