Lab · AT-0011 / AT-0016 / AT-0020
Relational Universe
One deterministic network, three ways of getting from A to B: cross the distance, change the distance, or change the relational address. Every number below is read out of stored model state.
Model inputs
Rendering is bounded for large models: relations are prioritised by geodesic membership, change status and strength. The model itself is always evaluated in full.
Initial D(A,B)
3.6734
Final D(A,B)
1.0895
Adjacency cost C_A
1.1200
Adjacency gain Γ_A
2.3071
|ΔD| / C_A
Identity deviation ΔI
0.0504
Modified relations
3
Transition count
8
Runtime
—
Visual evidence · AT-0011 · adjacency
08 · R(A,CC) raised 0.633 → 0.773
D at this step
1.0895
C_A at this step
1.1200
ΔI at this step
0.0504
Relations changed
3 / 3
Evidence
non-negativity ok · symmetry ok · triangle inequality ok · identity of indiscernibles ok
Graph connected; shortest-path solution finite and NaN-free.
AT-0 has no time coordinate, no Lorentzian structure and no light cones. Causal behaviour cannot be evaluated until AT-4.
No stress-energy tensor is defined in this model. Energy-condition analysis begins at AT-5.
Whether these graph distances embed into a recognisable manifold is untested until AT-3.
No mapping from relational couplings to measurable physical quantities exists. Graph-distance reduction is not physical distance reduction.
ΔI = 0.0504 against tolerance 0.350. Identity is a stipulated bookkeeping vector, not a physical state.
No mapping exists from a relational-state edit to the displacement of any physical object. State-transition mode is arithmetic on a state vector.
Discovery engine · AT-0020
Bounded search for candidate transformations
The optimiser is not told which relation to change. It proposes bounded edits, evaluates each against the real stored model state, and reports the whole population — including everything that failed.