Relation to finite-range models

A specified finite-range schedule may prove a domain-of-dependence bound and admit a saturating relay. Such a theorem concerns the geometry already encoded by its allowed increments.

The present countermodels do not refute a stronger, separately specified calculus. They show that the operational axiom list alone cannot select its geometry. A relay from another model transfers only after its operations, interfaces, and placement have been shown legal. Furthermore, an exact fixed finite increment set has a polyhedral generated cone, by Proposition prop:finitestencil; a Lorentzian limit would require an additional limiting construction rather than an exact finite-stencil identification.