Composing operations and identifying histories with the same completed record can generate a relational space. A finite translation model makes this exact, while predictive closure explains what the archive must retain.
A source before spatial coordinates
A point in ordinary geometry already has neighbours, distances and a surrounding space. The SMM starting point is different: unity belongs to the origin of generation, while spatial multiplicity belongs to its distinguishable results. This changes the mathematical question from where the source is located to how its operations become related records.
A useful model therefore specifies a state space, an update and retained memory before assigning physical coordinates. One active operation can work on an extensive archive. The archive is part of the model's physical resources; its complexity does not disappear because the active controller is unique.
Operations become histories
Let a state be z=(r,m), where r is a current record label and m contains the information needed for future evolution. An elementary operation acts on z. A finite ordered sequence of operations is a history, and histories compose when the output of one is a permitted input of the next.
At this stage an operation label such as a does not mean movement along an already existing axis. Its spatial interpretation is earned later by its relations to other operations. Reversibility, commutation and return conditions are especially useful: they tell us whether operations can be undone, reordered or recognized as closed sequences.
Completion turns histories into records
DTT distinguishes generative work from completed availability. Write C(h) for the record produced when history h completes, and O for the tests through which that record is distinguished. The public readout is Π=O∘C. Two long histories can have the same public result even when their internal work differs.
For records to compose consistently, the equivalence must survive admitted preparations and continuations. This requirement gives the quotient a practical meaning: an observer may use a completed record without knowing which equivalent history produced it.
Worked example: 125 records from three operations
Choose labels r=(x,y,z) with each entry an integer modulo five. Let P₁, P₂ and P₃ increment the corresponding entry. These three permutations commute. Starting from (0,0,0), a history with net operation counts (n₁,n₂,n₃) ends at the corresponding residues modulo five.
Records ≅ ℤ³/(5ℤ)³; number of records = 5³ = 125.
Appending one generator defines an edge between records. Each record has six signed nearest neighbours. The spatial interpretation now comes from the completed operation graph. The three generators and their commuting table are supplied in this example; the calculation demonstrates formation from structured operations, rather than selection of three generators from no structure.
Identity resides in relations
Relabel every record by a permutation and transform all operation tables consistently. The written names change, but adjacency and closed histories remain the same. This is a basic relational principle: a record's role is determined by its connections, rather than by the numeral assigned to it.
The shortest return along each generator in the example has length five. A local observer can therefore detect neighbourhood structure before completing a path that reveals global periodicity. Different larger relational systems may share the same small neighbourhoods. Local spatial appearance consequently does not determine the global topology of the archive.
A spatial record must retain its future
A snapshot can omit information that controls the next completion. If U is the source update, a deterministic public update V exists precisely when equal current readouts always have equal next readouts:
Then V(Π(z))=Π(Uz) is well defined.
The proof is direct. The proposed formula for V cannot depend on the chosen representative z of a public state. Conversely, the displayed implication guarantees that independence. When it fails, the remedy is to retain the missing memory, change the completion boundary or describe the public evolution with memory. A visually complete spatial picture need not yet be a complete predictive state.
What makes these relations geometric?
Adjacency is an important first output, but a metric needs a rule for comparing edges or paths. Assigning unit cost to every allowed generator gives a graph distance. Assigning different positive costs produces another calibrated metric on the same records. Thus operation composition and length measurement are related but distinct ingredients.
A bare real vector space illustrates why extra structure matters. If every invertible map is an automorphism of the supplied data, an invariant bilinear form B must satisfy B(2v,2w)=B(v,w). Bilinearity makes the left side 4B(v,w), forcing B=0. A nonzero length standard must therefore be selected by additional source, detector or calibration structure.
The next constructive step
The SMM/DTT programme can now ask a focused question: which autonomous source law prepares the relational memory, certifies completion and preserves the relations during later motion? The six nested inner roles can organize that work, while the seventh role makes the resulting archive available.
A useful next model should state its memory capacity, permissible operations and success criterion, then show that the same rule repeatedly produces stable neighbourhoods. It should also compare nearby admissible rules. If all of them preserve the same observable geometry, the construction has acquired robustness; if small changes select different dimensions or nonlocal links, those differences identify the physical principle still needed.
Continue with the articles
- One action, two temporal roles
Inner generation and outer record order can be roles of one process. A completed return becomes an observable advance only when its action respects the retained records and their tests.
- When two histories count as the same observation
Completion identifies histories that leave the same record, while observation identifies records that available tests cannot distinguish. Their combined quotient is consistent only with the declared operations and contexts.
- Test languages and observable quotients
A test language determines which records an observer can distinguish. Enlarging that language refines the observable quotient and reveals when apparently different instruments retain the same information.
- Programmed geometry and spontaneous selection
A programmed serial source can prepare a periodic lattice and reproduce its local neighborhoods exactly. This establishes feasibility while leaving spontaneous selection, dimension choice, and persistent growth as separate tasks.
- What spatial readout forgets
Different inner states can share one spatial readout and still have different successors. A concrete counterexample and a kernel-preservation criterion identify the memory needed for autonomous completed evolution.
- Why a bare source does not imply spacetime
A structureless source cannot select a nonzero metric, an oriented vector or a proper causal cone while preserving every change of representation. Recurrence, composition and observable readout supply the additional structure needed for an SMM/DTT reconstruction.