Can a source without spatial position generate a stable notion of neighborhood and a finite speed of influence between completed records? This article compares the source-based construction with Causal dynamical triangulations, identifies their strongest point of contact, and works through a concrete example that separates a valid mathematical result from the further physical relation needed to explain observations.
Causal order and spatial proximity encode different information. A causal relation states which events can influence which others. A spatial distance compares records on an appropriate common slice or through a relational protocol. A graph can have a finite propagation speed relative to its edges while still being physically nonlocal if those edges join arbitrarily distant readouts.
Locality therefore has two stages: the interaction structure must be generated, and the dynamics must respect that structure. An inequality bounding propagation on an already chosen graph addresses the second stage. It does not explain why that graph resembles three-dimensional space. This separation makes the challenge sharper and gives partial achievements a clear place in the overall reconstruction. [1] [2]
The Single Monad is nonspatial, so its alleged unity cannot be represented as a point that sends ordinary signals from a hidden location. In DTT, locality would belong to the relations among completed records. The six inner levels could produce and retain a neighborhood structure; outer time would order observable influence through that structure.
A single controller is not enough to explain locality if it is allowed to update any record pair independently. A stronger rule lets the same retained relations restrict both record formation and later transport. Then memory is physically important: it preserves which comparisons count as nearby, rather than being an inert log appended after spatial interactions have already been assumed.
Causal dynamical triangulations defines a sum over discretized geometries with a specified causal organization and action. Macroscopic behavior is studied through ensembles and scaling, rather than by treating one fixed triangulation as the final spacetime. Diffusion-based dimension is one useful probe of the generated ensemble. Its numerical behavior is a result inside the model.
The comparison with DTT concerns how a regulated construction produces an extended geometry with stable large-scale observables. A nested inner process is not a triangulation time coordinate, and a computational update used to sample an ensemble is not an observer's clock. Distinguishing these roles is essential when interpreting emergent temporal and spatial behavior. [3]
CDT builds causal organization into its admissible geometric histories, so it already distinguishes physically allowed temporal relations from arbitrary graph connectivity. DTT's source programme aims to explain why such restrictions arise from one generative mechanism. The comparison is therefore about selection rules: are causal neighborhoods outputs of source dynamics or conditions placed on the histories before the calculation begins?
A temporal model could be informative if a completion criterion rejects relational configurations that fail to support consistent local transport. However, rejection must have a physical implementation and resource cost, rather than silently conditioning on a rare desired geometry. The six nested levels could organize the local consistency tests and retained memory that preserve the selected neighborhood. The propagation calculation below then measures what those neighborhoods accomplish after they exist. CDT also reminds us that a causal geometric ensemble and an algorithm for sampling it have different time variables. DTT's claimed physical update needs an operational clock, not an identification with sampling iterations. A strong result would join admissible history generation, clock calibration and effective propagation in a single construction with a clearly stated continuum regime. [3]
On a chain with nearest-neighbor updates, suppose a disturbance can cross at most one edge of length a during each completed interval δτ. A record N edges away cannot respond before Nδτ, giving an exact circuit cone with v=a/δτ. This uses a bounded-depth update with strictly local gates.
Continuous-time Hamiltonians generally give a different result: a Lieb–Robinson estimate bounds a distant commutator by a constant times exp[−μ(d−vt)]. The tail is small rather than exactly zero outside the effective cone. If d−vt=10/μ, the exponential factor is about 4.54×10⁻⁵. Neither result determines a physical speed until the edge length and the clock interval are independently identified. Nor does either prove that the source generated the chain. [1] [2]
d and a are physical distances only after readout calibration; μ has inverse-distance units. C depends on observables and interaction assumptions.
A neighborhood rule can also fail through rare long links. Suppose almost all edges connect nearby records but a small fraction join distant regions. A short graph path may then connect points that appear far apart in the geometric readout. The propagation bound remains valid in graph distance while failing to express the intended physical locality. A source law must therefore constrain the relation between graph distance and measured distance, not merely the number of edges crossed per update. This gives a precise role to retained memory: it can preserve compatible neighborhood relations and prevent later operations from introducing unaccounted shortcuts.
This comparison suggests a strong attainable result: a joint theorem for neighborhood retention and propagation under one autonomous update. It would explain why a spatially organized record persists and why perturbations remain confined to its effective cone. That is more informative than postulating all-to-all generation followed by a local outer description, because it identifies the actual mechanism suppressing observable nonlocal shortcuts.
THE SAME QUESTION, DIFFERENT STARTING POINTS
| Question | SMM/DTT | Causal dynamical triangulations |
|---|---|---|
| Starting physical structure | One nonspatial source; six nested inner functional levels produce records accessible through outer completion. | An ensemble of causally organized piecewise-flat geometries. |
| The central mechanism in this topic | A physical completion rule should select causal neighborhoods and maintain them. | Causal restrictions are part of the geometric histories included in the ensemble. |
| How the claim is made operational | A source-to-record map must define geometry, material response and physical clocks with shared inputs. | Path-sum weights, numerical observables and refinement toward a continuum regime. |
| Meaning of agreement | Agreement is a compatibility result; a source-selected relation or fixed residual would add explanatory content. | The stated framework provides a benchmark within its own assumptions and established domain. |
KEEP THE CONNECTION
Develops the source construction or operational distinction used in this comparison.
Develops the source construction or operational distinction used in this comparison.
Develops the source construction or operational distinction used in this comparison.
References support the comparator and the specific mathematical or interpretive claims indicated. SMM/DTT connections are developed in the analysis above.
How these comparisons distinguish premises, results and physical claims
SMONAD
Share this page, or keep a clear reference to the work you are reading.
Use this reference for the explanation on this page. “n.d.” means its first publication date is not specified; the update date is recorded separately.
