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.

The truncated past height is Lipschitz and has exactly the pulled-back cuts as levels

Statement

Assume Countable Choice and Dependent Choice for the supplied causal-curve results. Use the stationary inside region W, its section-zero closed base B, the chronological past P=IE−(Q) and the common smooth normal-flow collar of the uniform translated-cut localization lemma. Choose the collar width η sufficiently small that R=c(S×[0,η])⊂Int⁡ΣB, as is possible because B contains a neighborhood of compact S, and take the localization data for this collar. Let δ0>0 be the common localization time bound. There is 0<δ∗≤δ0 such that, for every 0<δ≤δ∗, define u(x)=sup⁡({−2δ}∪{z∈[−2δ,2δ]:Ψzx∈P}),x∈R. Membership in P⊂E is false on the fixed boundary S outside E. For x,y∈R let d0(x,y) be the infimum of the h0-lengths of piecewise C1 paths in R joining them, with value +∞ when there is no such path, and put dR(x,y)=min⁡{d0(x,y),1}. This is a finite metric inducing the collar topology, including on its boundary and across its possibly distinct connected components.

Then u is globally Lipschitz for dR and for the intrinsic path distance on each connected component. It equals −2δ near S and 2δ near Sη, and for every ∣z∣<2δ satisfies {u=z}=Ψ−z(Dz),Dz={v=z}∩∂EP∩W. For ∣z∣≤2δ, the entire flowed interior collar is inside the cylinder: Ψz(R∖S)⊂W. Its remaining boundary points S are fixed by the extended flow and belong to the closed inside region in the smooth completion.

Facts & Assumptions

[F1]

The localization data supply the inside base B, the compact cuts Dz, their containment in Ψz(R∖∂R), and uniform neighborhoods of S outside P and of Sη inside P for ∣z∣≤2δ0. The additional collar choice R⊂Int⁡ΣB is made in the Statement, rather than inferred from containment of the cuts. Uniform localization of translated past-boundary cuts

[F2]

The common smooth normal flow fixes S, is future timelike on interior fibers, and in the exterior stationary product is Ψz(x)=(z,ψz(x)), with ψz the smooth spatial flow of −X. Its common time domain contains the compact collar, and h0 is a smooth positive definite metric up to both collar boundaries. A compact normal-flow collar has uniformly small area distortion

[F3]

Chronological pasts are open past sets. If p∈P‾ then I−(p)⊂P; chronological reachability is transitive, and the push-up rule applies. The boundary ∂EP is achronal by the time reverse of the open-future-set theorem: locally every point of an open chronological past has a short future timelike segment remaining in that past, so I−(P)=P, as required for that time-reversed application. Openness of the chronological future and past, openness of the chronological relation, and closure of future and past sets Push-up rule Achronal boundaries are locally Lipschitz graphs, topological hypersurfaces and null for smooth volume densities

[F4]

The truncated supremum, the exterior-relative boundary, the fixed-boundary convention and the inside-restricted cut use the supplied height definitions. Truncated causal-boundary height for smooth approximation

[A1]

Countable Choice and Dependent Choice are assumed in their set-theoretic senses. They discharge the explicit choice hypotheses of all three causal suppliers in [F3], including their uses below; no physical assumption is made. The Axiom of Countable Choice (AC_ω) The axiom of dependent choice: a relation in which every element is related to something admits an ℕ-indexed chain

[F5]

The length of a piecewise C1 path is the sum of the integrals of h0(γ˙,γ˙) over its pieces. The path infimum and the truncation defining d0 and dR are defined in the Statement; their boundary, component and topology properties are proved below. Riemannian speed and length

Proof

Given: The collar choice, localization data and choice assumptions in the Statement.

Goal: Prove cylinder containment, the exact level identity, and global Lipschitz regularity with the specified distances.

1.1givenF1F2F4

If R is empty all conclusions are vacuous; hence assume it is nonempty. Put U=Int⁡ΣB. In the supplied collar coordinates, compactness of S and openness of U give a uniform positive collar width with c(S×[0,η])⊂U; choose this before taking the localization data. The continuous spatial flow satisfies ψ0(x)=x on compact R⊂U. The inverse image of U under (z,x)↦ψz(x) is open and contains {0}×R. A finite subcover gives one positive time interval on which ψz(R)⊂U. Reduce δ∗≤δ0 so that ∣z∣≤2δ∗ lies in this interval and in the common flow domain. The stationary cylinder's inside is invariant under stationary translation; hence Ψz(R∖S)⊂W, while the extended flow fixes S. This containment is a separate compactness argument, not a converse to cut localization.

1.2F2F5givenconstruct

We verify the distance properties without applying a theorem for a connected boundaryless manifold to the whole collar. At any collar point choose nested coordinate balls, or half-balls at a boundary, with compact larger closure. The smooth positive definite matrix of h0, evaluated on that compact set times the Euclidean unit sphere, has positive minimum mi2 and finite maximum Mi2. Thus mi∣w∣≤∣w∣h0≤Mi∣w∣ there. Straight coordinate segments in a convex ball or half-ball have length at most Mi times endpoint displacement. Any path starting at the center and exiting a coordinate radius r has length at least mir, by integrating up to first exit. These estimates show positivity of d0 on distinct points and equality of its local topology with the manifold topology, also at either boundary. Reversal and concatenation of paths give symmetry and the extended triangle inequality. Piecewise C1 reachability classes are open because balls and half-balls are convex; each such class has open complement. They are therefore precisely the connected components, and compactness leaves only finitely many of them. Consequently d0 is finite within a component and infinite across distinct components. Truncation preserves the triangle inequality since min⁡{a+b,1}≤min⁡{a,1}+min⁡{b,1}. It also preserves positivity and all sufficiently small balls. Hence dR is a finite metric with the asserted topology and value 1 between distinct components.

2.1F1F2F3F4A1step 1.1

Fix x∈R∖S. Membership of Ψsx in P is an initial interval of slab times, because its vertical curve is future timelike and P is a past set. Openness excludes its upper endpoint when that endpoint is in the open slab. If u(x)=z with ∣z∣<2δ, the supremum property gives members of P on this fiber approaching Ψzx, which is not itself in P, so Ψzx∈∂EP. Conversely, if Ψzx∈∂EP at an open-slab time, every earlier point of this fiber belongs to P by the chronological-closure property in [F3], and no later one can belong to P, since that would put Ψzx in P. Thus u(x)=z. By step 1.1 every such boundary hit lies in W and therefore in Dz. By [F1] every point of Dz has a unique preimage in the interior collar. This proves both inclusions in the level identity; points of S give no open-slab level because their height is −2δ.

3.1F1F4step 2.1

The fixed inner margin in [F1] has no members of P at any slab time, so the supremum is −2δ there, including S by [F4]. On the fixed outer margin every slab time is in P, so the supremum is 2δ. Remove smaller such neighborhoods to leave a compact annulus strictly away from both collar boundaries. All nonconstant behavior occurs on this annulus.

4.1F2step 3.1

Cover this compact interior annulus by finitely many smaller spatial coordinate balls with closures in larger convex coordinate balls away from S and Sη. The maps (s,y)↦Ψs(x(y)) are smooth flow coordinates: v=s and each spatial flow has smooth inverse. On the compact product of the closed slab and each larger ball, ∂s is future timelike. Continuity and compactness give εi>0 such that ∂s+w is future timelike for every purely spatial coordinate vector with ∣w∣<εi. Thus a coordinate straight segment within this product, with positive time displacement exceeding Ki times its spatial displacement, is future timelike for Ki=1/εi.

5.1F3A1step 2.1step 3.1step 4.1

In one smaller ball suppose u(x(y′))−u(x(y))>Ki∣y′−y∣. Choose open-slab times s,t with u(x(y))<s<t<u(x(y′)) and t−s>Ki∣y′−y∣; this is possible by the strict inequality, including when a height is clipped to a slab endpoint. By the initial-interval property, Ψsx(y)∉P and Ψtx(y′)∈P. The straight segment of step 4.1 joins the former to the latter by a future timelike curve in E, contradicting the past-set property. Interchanging the two points proves ∣u(x(y′))−u(x(y))∣≤Ki∣y′−y∣. Together with the constant neighborhoods from step 3.1 this gives coordinate Lipschitz estimates on a finite cover of the whole collar.

6.1F4F5step 1.1step 2.1step 3.1step 5.1step 1.2∎

Use a finite coordinate cover on which the estimates in step 5.1 or the constant-neighborhood estimates hold and the lower metric bounds in step 1.2 hold. Let L be the maximum of their coordinate Lipschitz constants divided by their positive lower metric bounds, using zero on constant patches. Any piecewise C1 path in R has a finite parameter subdivision with each subpath in one such patch. On a subpath, endpoint coordinate displacement is bounded by its Euclidean length, and this length is at most 1/mi times its h0-length. The coordinate Lipschitz estimate and telescoping therefore give ∣u(x)−u(y)∣≤LLh0(γ). Taking the infimum gives ∣u(x)−u(y)∣≤Ld0(x,y) within each component. If d0(x,y)≥1, including distinct components, boundedness of the defining supremum gives ∣u(x)−u(y)∣≤4δ. Thus in all cases ∣u(x)−u(y)∣≤max⁡{L,4δ}dR(x,y). This proves global Lipschitz regularity, and steps 1.1, 2.1 and 3.1 give all remaining conclusions.

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.