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.

Uniform localization of translated past-boundary cuts

Statement

Assume Countable Choice and Dependent Choice for the causal inputs. Use the hypotheses and resulting smooth normal-flow collar of the compact normal-flow lemma in a smooth time-oriented stationary Lorentzian four-manifold E=Rv×Σ∘, with temporal v, smooth spacelike section Σ, nonempty compact boundary S, and induced Riemannian metric h0. Use componentwise intrinsic distance dh0, with value +∞ between distinct components, and put ρ(x)=inf⁡s∈Sdh0(x,s), extended stationarily. Thus components missing S have ρ=+∞. Supply the distance collar R=c(S×[0,η])={0≤ρ≤η} and normal flow Ψz(x)=(z,ψz(x)) on interior points, and put Sη=c(S×{η}).

Let B⊂Σ be compact, with B=int⁡ΣB‾ Σ and smooth outer boundary Γ=∂ΣB⊂Σ∘. Require R⊂int⁡ΣB. Put Ω=(int⁡ΣB)∩Σ∘; the specified cylinder is C=Rv×Γ, assumed timelike, and its inside means precisely Rv×Ω. In particular B is the full closed spatial region used here, rather than an unspecified compact subset of the inside.

Let Q⊂C be a nonempty compact target with min⁡Qv>0, and set P=IE−(Q). Identify x∈Σ∘ with (0,x)∈E and assume B∩{ρ≥b}⊂P for some 0<b<η/4. Suppose ∣dρ/dv∣≤Cρ for future causal curves whenever 0<ρ<a0, for fixed C≥0 and a0>0 within the stationary boundary-distance collar, with Q projecting outside {ρ<a0}.

Then there exist δ0>0 and 0<a<b such that for every ∣z∣≤2δ0 the cut Dz=({z}×Ω)∩∂EP is compact and satisfies Dz⊂Ψz({a/2≤ρ≤η/2})⊂Ψz(R∖∂R). The interior flow collar Ψz(R∖S) is inside C. There are fixed neighborhoods US,Uη of S,Sη, respectively, relative to R, such that Ψz(US)∩P=∅ and Ψz(Uη)⊂P for all these z; S itself is excluded from E and hence from P.

Facts & Assumptions

[F1]

The supplied smooth distance collar is compact; its normal flow has stationary-coordinate form Ψz(x)=(z,ψzx) on the interior, with smooth spatial flow and inverse for common small times. The spatial flow preserves S. A compact normal-flow collar has uniformly small area distortion

[F2]

A compact finite-time target outside a causal collar cannot be reached from section time zero at distances below the collar exit radius times e−Cmax⁡Qv. The same result applies to a stationary translate of the target. A finite temporal target cannot be reached from a sufficiently small collar

[F3]

Chronological pasts are open past sets in the smooth time-oriented Lorentzian four-manifold, under the stated Countable Choice and Dependent Choice hypotheses. For arbitrary Q⊂E, P=IE−(Q)={p∈E:∃q∈Q, p≪Eq}=⋃q∈QIE−(q). These are mathematical causal results. Causal curves, chronological and causal reachability, and inextendibility Openness of the chronological future and past, openness of the chronological relation, and closure of future and past sets Push-up rule 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

[F4]

All curves and chronological boundaries are relative to E; future temporal v increases along future causal curves. Interior, closure, boundary and relative neighborhoods use the manifold and subspace topologies. Causal exterior, chronological boundaries and Cauchy data Interior, closure, boundary, exterior, derived set and isolated point in a topological space Subspace topology: the traces of the open sets, its closed sets and its bases, the continuity of the inclusion, and the characteristic property of a map into a subspace

[F5]

Compactness is intrinsic open-cover compactness; the ambient-cover criterion permits finite subcovers. On a compatible metric space this agrees with metric compactness. Closed subsets of compact metric spaces and continuous images of compact metric spaces are compact, and continuous real functions attain extrema on nonempty compact metric spaces. For the metric-space results, use d^(x,y)=min⁡(1,dh0(x,y)) and dE((v,x),(w,y))=∣v−w∣+d^(x,y). Truncation preserves the triangle inequality, and balls of radius less than one lie in a component and give its original topology. The product metric therefore gives the manifold topology on E. Open cover, subcover, and compact topological space; a compact subset is a subspace that is compact in its own right A subspace is compact exactly when every family of open subsets of the ambient space covering it, indexed or not, has finitely many members covering it For a metric space with its metric topology, compactness in the topological sense is compactness in the metric sense, and the two notions of compact subset coincide A closed subset of a compact metric space is compact The image of a compact metric space under a continuous map is compact, and so is the image of any compact subset A continuous real-valued function on a nonempty compact metric space is bounded and attains a greatest and a least value

[F6]

Intrinsic distance induces the manifold topology on each component, including at the boundary. Components are open. On a component meeting S, ρ is finite and 1-Lipschitz, hence continuous; on a component missing S it is +∞. Thus each threshold set {ρ≥r} is closed and {ρ<r} is open for finite r>0. Riemannian distance on a connected manifold Extended riemannian distance on a disconnected manifold The riemannian distance topology is the manifold topology Distance from a point to a subset Distance to a nonempty subset is one lipschitz

Proof

Given: The hypotheses in the Statement.

Goal: Establish compact translated cuts, their uniform annular localization and both endpoint margins.

1.1givenF3F4F5F6

By [F6], L=B∩{ρ≥b} is closed in compact B, so [F5] makes it compact. It avoids S and is contained in P at time zero. Write Tz(x)=(z,x). Since P is open, the open section sets O for which some ϵ>0 gives Tz(O)⊂P whenever ∣z∣<ϵ cover L. Take finitely many such sets covering L and, for each of these finitely many sets, one admissible ϵ. Their union W and the positive minimum τ of these finitely many numbers satisfy Tz(W)⊂P for ∣z∣<τ. This makes no simultaneous choice over all points of L. Every x∈Ω with ρ(x)≥b belongs to L, so none of these points can give a boundary cut. Also Γ∩R=∅ because R⊂int⁡ΣB; hence Γ⊂L⊂W. Thus this argument controls the entire specified inside and an open neighborhood of its outer boundary. No graph-section compact-core theorem is used.

1.2givenF2F3F4F5F6

Put VQ=max⁡Qv, finite by [F5], and choose 0<z0<min⁡Qv/2. For ∣z∣≤z0, the stationary translate T−zQ is compact, has positive minimum time and maximum time VQ−z, and has the same spatial projection as Q. Stationary translation preserves the metric, time orientation and causal curves in E, so [F2] applied to T−zQ excludes reachability from (z,x) whenever 0<ρ(x)<a0e−C(VQ−z). Set d∗=a0e−C(VQ+z0)>0 and choose 0<a<min⁡(b/2,d∗/4). The open spacetime region {∣v∣<z0, 0<ρ<d∗} is disjoint from P, and therefore also from ∂EP: each of its points has an open neighborhood disjoint from P. In particular, all points with ∣v∣<z0 and 0<ρ≤2a avoid both P and its boundary. Points of S are separately absent from E.

2.1givenF1F4F5F6step 1.1step 1.2

For ∣z∣<min⁡(τ,z0), steps 1.1 and 1.2 put every cut point in Tz{2a<ρ<b}. The annulus A={2a≤ρ≤b} is a closed subset of compact R, hence compact by [F5]. The full annulus lies in Ω because A⊂R⊂int⁡ΣB and A∩S=∅. Its stationary translate Tz(A) is compact. In fact Dz=∂EP∩Tz(A): localization gives one inclusion, and the other follows from A⊂Ω. The boundary ∂EP is closed in E, so Dz is a closed subset of that compact translated annulus and is compact. This uses the full annulus supplied by the collar, not an annulus inferred from a graph-core result.

3.1givenF1F4F5F6step 2.1

At time zero, A is contained in the open collar annulus {a/2<ρ<η/2}, since 2a>a/2 and b<η/4. Smooth inverse-flow dependence and compactness of A keep ψ−z(A) in this annulus for all sufficiently small ∣z∣. The spatial inverse-flow identity gives Tz(A)⊂Ψz({a/2≤ρ≤η/2}). This latter closed annulus lies in R∖∂R. Similarly, the open set int⁡ΣB contains compact R, so continuity and a finite subcover give a common time interval on which ψz(R)⊂int⁡ΣB. The spatial flow preserves S and keeps interior points interior by [F1]. Thus the whole interior flow collar stays in Rv×Ω, and the two required localization inclusions follow.

4.1givenF1F4F5F6step 1.1step 1.2step 2.1step 3.1∎

By continuity of the spatial flow on compact S, preservation of S and ρ∣S=0, there are a fixed relative neighborhood US of S in R and a common small time interval with ρ(ψzx)<2a for x∈US. The slice Sη=R∩{ρ=η} is closed in compact R and hence compact. By continuity on Sη, where ρ=η>b, there are a fixed relative neighborhood Uη of Sη and a common small time interval with ρ(ψzx)>b for x∈Uη. Step 3.1 keeps these spatial images in B. Step 1.2 therefore excludes the interior points of Ψz(US) from P, while step 1.1 puts Ψz(Uη) in P, since its spatial images belong to L. The points of S remain outside P by the boundary convention. Choose δ0>0 so that ∣z∣≤2δ0 lies strictly within every common time interval just obtained, including ∣z∣<min⁡(τ,z0). This gives both fixed endpoint neighborhoods, compact cuts and the asserted localization uniformly on the closed time range.

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.