Manuscript VII-F@1 · VII-F.tex · lemma · 2d81c03f
Lemma: Polyhedral graph criterion
An explicit seam-compatible slicing family › Spacelikeness, ordering, and embedding · lines 440–482 · proof included or linked
VII-F@1#lem:graph
Let be continuous functions on a Euclidean cone, piecewise affine in finitely many developed sectors. Suppose that every affine branch has spatial gradient of norm at most . Then the graph of is embedded and spacelike on each face, and
If, in addition,
for and , then the graphs are strictly time ordered. If near the boundary of a compact spatial patch, they match the prescribed translating resting exterior there.
Proof. On a face with gradient , the induced metric is
For every spatial tangent vector ,
Integrating the gradient bound along piecewise linear spatial paths and taking the infimum of path lengths gives the global Lipschitz bound. The projection of a graph to the cone is a homeomorphism, so the graph is embedded.
In the ultrastatic product, a causal curve between two points requires its time difference to be at least the spatial distance. The strict Lipschitz bound therefore also gives acausality between distinct graph points. At the apex, spacelikeness is understood in this uniformly Lipschitz, stratified sense.
The ordering and exterior statements follow directly from their respective hypotheses.
Displayed formulas in this passage
unlabeled · line 447
unlabeled · line 451
unlabeled · line 461
unlabeled · line 465