Manuscript En05-B@1 · En05-B.tex · theorem · 8b626460

Theorem: Uniform local event and cone convergence

Euclidean convergence of both past constructions · lines 877–952 · proof included or linked

En05-B@1#thm:cones

Back to manuscript

The embedded events are locally dense in . For every compact source set and compact terminal set, the distance functions to both and converge uniformly to the distance function to , uniformly over embedded terminal events in that terminal set.

The assertion uses full past sets and distance functions, not intersections with arbitrary compact sets.

Proof. A spatial point has a hub within , and a time has a tick within . This proves event approximation.

Fix an embedded terminal , and a point with . Choose a hub within of .

For the metric past, Theorem thm:metric gives

Put

Then , so . Its distance from is at most

which tends to zero uniformly for bounded .

For the scheduled past, Theorem thm:routing gives a scheduled route of duration at most

Choose an earlier source tick using

in the preceding floor formula. The route then finishes no later than tick . Waiting at the terminal supplies a path ending exactly there. The resulting approximation distance is at most

By Lemma lem:physicalcone, both discrete sets are contained in the continuum cone. Their distance functions are therefore no smaller than the continuum distance function.

For source and terminal points in fixed compact sets, a nearest point on the closed continuum cone lies in a uniformly bounded region: the apex itself gives a uniform distance bound. The elapsed-time parameter for those nearest points is therefore uniformly bounded. Apply the preceding approximations to those points. This supplies the reverse distance-function inequality with an error tending uniformly to zero.

Displayed formulas in this passage

  • unlabeled · line 899

  • unlabeled · line 905

  • unlabeled · line 918

  • unlabeled · line 925

  • unlabeled · line 930

  • unlabeled · line 937

Nearby in this section