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 Loop quantum gravity, 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.
Loop quantum gravity quantizes geometric variables without fixing a background metric. Spin-network labels organize states, and geometric operators can have discrete spectra. Constraint dynamics and semiclassical states determine how those kinematical structures acquire physical meaning. The programme contains substantial mathematical results, but its candidate microscopic description is not experimentally established.
The useful comparison with DTT concerns the passage from algebraic carriers to physical geometry. Discrete eigenvalues alone do not determine a classical spacetime, just as a nested completion rule alone does not. The models can be compared through the construction of observables, the role of constraints and the emergence of semiclassical correlations, without equating loop labels with inner-time levels. [3] [4]
Spin-network adjacency can organize quantum geometry, but it is not automatically the same as local proximity in a semiclassical metric. A graph may contain links that become long-range connections in a proposed spatial readout. DTT faces an analogous issue if the source can compare arbitrary records during inner generation. Local-looking labels do not prevent physical shortcuts.
The useful comparison is whether the dynamics suppresses or removes such shortcuts in the relevant states. A completion rule could retain only relational links compatible with a stable neighborhood structure, while subsequent updates respect that structure. The six inner levels would then have a concrete role in preparing locality rather than merely preceding it. In loop or spin-foam language, a corresponding statement would concern the relation between combinatorial connectivity, constraints and semiclassical transport. The propagation estimates below apply only after a metric and bounded interactions are identified. They cannot establish that an arbitrary quantum geometry is local. DTT could add an explicit preparation mechanism and resource accounting to this problem, showing why locality is selected and maintained by the same source that generates the records. [3] [4]
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 | Loop quantum gravity |
|---|---|---|
| Starting physical structure | One nonspatial source; six nested inner functional levels produce records accessible through outer completion. | Quantum geometric states described through holonomies, fluxes and constraints. |
| The central mechanism in this topic | Completion should select and preserve neighborhoods that constrain later influence. | Graph connectivity must be related to semiclassical metric locality through states and dynamics. |
| How the claim is made operational | A source-to-record map must define geometry, material response and physical clocks with shared inputs. | Geometric operators, physical-state conditions and semiclassical reconstruction. |
| 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
