From one source to a world of relations
Build spatial relations from source operations, completed histories and retained records, with an exact finite example and a predictive-state test.
Read the guideSpace from generative relations
Build a spatial description one relationship at a time: which records are distinct, which are neighbours, how they are measured, and how influence passes between them.
A spatial description contains more than coordinates. It distinguishes locations, assigns neighbours, compares distances, and says which changes can influence one another. The SMM starting point moves these relations into the explanation: the Single Monad is a proposed source of the relational structure, rather than an object already occupying one of its locations. DTT then asks how the relations are assembled through inner activity and made available through outer completion.
The first useful mathematical distinction is between a source address and an observable site. In a six-digit binary example there are 64 addresses. Pairing the digits by differences gives three coordinates, each with values −1, 0, and 1, hence 27 sites. Multiple addresses can produce the same site. This simple calculation already raises a physical question: does observation retain the multiplicity, average it, or select a representative? The answer affects the measured distribution over space.
The nested levels describe functional dependencies. In the paired construction, the first role opens one direction and its partner acts along that same direction. The pattern repeats for the second and third directions, giving ranks 1, 1, 2, 2, 3, 3. The seventh role is completion. This is a precise organization of a supplied readout; determining why the source selects that organization is a further part of the programme.
Locality enters through the transitions that are permitted between records. If a graph defines neighbouring sites, the minimum number of edges between two sites defines a graph distance. If each update can cross at most one edge, a localized disturbance stays inside an expanding graph ball. Adding one long-range edge can change both the distance and the available propagation paths. Geometry and dynamics therefore have to be developed together.
Readout rank, scaling dimension, and spectral dimension answer different questions. A linear map has an image rank. A refinement process can have a count-to-scale exponent. A diffusion process has a return probability from which another dimensional diagnostic can be extracted. The pages below explain these distinctions with calculations, then ask when the diagnostics agree.
Physical geometry also needs a clock. A displacement bound becomes a speed bound only after its delay is tied to a physical readout. The geometry–clock guide shows how a common encoder can relate refinement and duration, and why changing the clock response can change the resulting ratio. The final guide addresses continuum approximation and stability: which relations persist when resolution changes or the model is perturbed?
Start with source relations if you want the conceptual route. Start with the six-level example if you want an explicit construction. Then follow locality, distance, refinement, clocks, and limits. Together these form a research path from the origin of distinctions to a measurable spatial world.
Choose a topic below, or read the guides in order. Each page includes an explanation, a worked connection, and a route into the article collection.
Build spatial relations from source operations, completed histories and retained records, with an exact finite example and a predictive-state test.
Read the guideFollow a six-digit generative hierarchy, derive the rank sequence 1, 1, 2, 2, 3, 3, and see why completion differs from a seventh coordinate.
Read the guideDerive the scalar-insensitive quaternionic quotient, examine detector completeness, and calculate how phase alignment affects stable 3D readout.
Read the guideConstruct neighbourhoods from completed operations, prove a finite support-growth bound, and identify the memory rules required for local transport.
Read the guideRecover weighted path distance from a normalized edge operator, distinguish it from spectral dimension, and calculate calibration and error bounds.
Read the guideDerive dimension from branching and scale, work through a three-dimensional refinement example, and identify the extra interface behind a clock ratio.
Read the guideConnect completed record order to clock readings, derive a finite-update speed bound, and distinguish Lorentz-cone geometry from physical universality.
Read the guideStudy refinement, local diffusion, lattice errors and stability to see what a finite SMM/DTT archive must establish before supporting continuum physics.
Read the guideThe articles develop several complementary constructions. Quaternionic phase composition supports a conditional rank-three readout; record histories organize retained distinctions; translation and transport rules make neighbourhood relations operational. These are different stages of reconstruction. A count of three directions does not by itself supply calibrated lengths or explain why local interactions persist.
The next question is selection. A programmed lattice demonstrates that geometry can be represented, while a source mechanism must explain why that organisation is produced and maintained. Reading across the geometry route reveals the information costs, memory requirements, and transport conditions that connect an algebraic carrier with a spatial world observers can compare.
Study how accessible phase operations and scalar-insensitive detectors produce a local three-dimensional module, while keeping global spatial structure and calibration as distinct tasks.
Examine the record relations, preparation costs, and update rules needed to generate neighbours and preserve local transport through repeated completion cycles.
Follow the additional steps from adjacency and spectral response to distance, cone structure, and calibrated geometry, with their different operational meanings made explicit.
Positive multiplicative norm, finite dimension, associativity, and two noncommuting circular phases select a quaternionic carrier. The algebraic conclusion is rigorous within those hypotheses, whose physical selection remains open.
Read article →Removing the scalar center of a quaternionic carrier leaves a three-dimensional readout space. Accessible rotations or a suitable finite acquisition protocol are needed to ensure that detectors actually recover all three directions.
Read article →Lattice-like signed operation tables are rare in the stated permutation ensemble, with an entropy penalty of order N log N. Bounded selection costs cannot overcome that asymptotic disadvantage under the theorem's assumptions.
Read article →Preparing a geometric memory with appreciable probability requires relative entropy when geometry is rare in the reference ensemble. The bound quantifies information resources without automatically identifying them with work or elapsed time.
Read article →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.
Read article →A generated graph predicts local influence only when later operations respect its edges and retained ports. Guarded transport supplies a finite-update support bound while exposing runtime and controller-memory requirements.
Read article →A positive horizontal metric and a nonzero temporal one-form define a Lorentzian metric with one negative direction. The signature proof leaves clock integrability, observer equivalence, and gravitational dynamics distinct.
Read article →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.
Read article →The glossary explains the vocabulary; the reading paths connect the ideas; the source register points to the original arguments.