Manuscript VIII-B@3 · VIII-B-v3.tex · lemma · 3aa6baa1
Lemma: Global graph properties
The retuned polyhedral slicing family › Embedding, acausality, and ordering · lines 816–876 · proof included or linked
VIII-B@3#lem:embedding, VIII-B@3#eq:ordering, VIII-B@3#eq:particle-time
For every and :
is globally -Lipschitz in the intrinsic cone distance;
graph projection is a homeomorphism;
on each regular face, the induced metric is at least times the spatial metric;
the graph is acausal.
For ,
The particle intersection is
No regular Minkowski tangent plane is asserted at the particle.
Proof. The affine spatial branches have gradient norm at most , by Lemma lem:gradients; the constant branch has norm zero. Minimum and maximum preserve a common Lipschitz bound. Integrating along paths, using continuity at sector rays, the seam, and the apex, proves the intrinsic global bound.
The inverse projection is , so projection is a homeomorphism. For a graph plane with Cartesian gradient , its induced metric is
This is a coordinate-independent lower bound relative to the spatial metric.
A causal curve between distinct spatial points has time difference at least their intrinsic spatial distance. The graph's time difference is strictly smaller, since . Distinct graph points therefore cannot be causally related.
For fixed , the function is nondecreasing and -Lipschitz in . Adding proves (eq:ordering). At the apex , giving (eq:particle-time).
Displayed formulas in this passage
VIII-B@3#eq:ordering · line 829
VIII-B@3#eq:particle-time · line 836
unlabeled · line 859