A supplied family of independent commuting operations can generate a spatial address system. Its dimensional rank, metric, local transport, and retained completion are distinct achievements.
The public spatial-formation proposal
The Dynamic Formation of Spatial Dimensions in the Inner Levels of Time has a public preprint version linked below. Its stated theme is formation of spatial structure through nested temporal activity. This page reads that theme through explicit finite constructions and the later article A213, without treating every broad claim in the abstract as a completed reconstruction.
The essential question is whether source relations determine space or whether an already spatial arrangement has simply been given a temporal interpretation. Both can be useful models, but they answer different explanatory questions.
What six inner roles mean
The six inner roles are nested dependencies associated in pairs with three stages of readout. A candidate rank sequence is 1,1,2,2,3,3. A repeated rank can indicate that one operation resolves distinctions within an already opened direction rather than adding another independent direction.
The outer role makes the completed result available. It is not a seventh spatial axis or an additional independent measured clock. To assess a particular construction, identify what is retained from lower roles, what the next role changes, and how successful completion is certified by the source itself.
Open the full-size diagram →
Generate a small relational grid
Take labels (m,n) with m modulo 3 and n modulo 4. Let P increment m and Q increment n. Then P³=Q⁴=I and PQ=QP. Starting at (0,0), the twelve expressions PmQn(0,0) produce twelve distinct records.
This gives a finite two-directional address system. If Q is instead set equal to P on three labels, the two named operations generate only three records and one independent cycle. The example demonstrates why distinct operation names do not prove independent spatial directions: their relations and action on records must be checked.
Add costs and compare paths
Declare P and Q moves, including their inverses, to cost one unit. The shortest-path distance between (0,0) and (1,2) is three. If Q moves cost two, that distance becomes five. The label set and number of directions are unchanged.
Thus addressing does not determine a metric scale or isotropy. A physical source law must justify the costs or derive an operational comparison that fixes them. Likewise, a later update that jumps freely between labels can violate local transport even though the address geometry remains intact.
Make the generated geometry persist
Suppose the observer sees a record only after all required P and Q relations have passed compatibility checks. That is a completion interface. To be autonomous, the model must include the checking degrees of freedom, the flag that signals success, and the memory that preserves the result.
SMM motivates deriving all these functions from one source rather than invoking an external organizer. DTT provides the distinction between internal construction and completed availability. A finite algorithm can demonstrate consistency, while a physical selection principle must additionally explain why the source realizes that algorithm and maintains its resources.
Follow the formation chain
Read A213 with A126 for nested roles, A127 for local transport, A128 for discarded information, and A117–A121 for autonomous records. Then compare A123–A125 on why local structures may need a preparation mechanism.
The next strong result would link the same update to a rank-three readout, a stable neighborhood structure, and a material clock used by propagation. Can the source enforce their agreement across a nontrivial family of settings? Such a joint result would explain more than a programmed grid and would make spatial formation a constraint of the theory rather than one possible implementation.
Continue with the articles
- Dynamic spatial formation: a paper guide
A reading guide to the listed spatial-formation proposal. Organize its hierarchy of inner temporal roles and ask how generated relations become persistent, observable spatial structure.
- Six inner stages and one publication interface
Explain the hierarchy of readout ranks 1, 1, 2, 2, 3, 3 followed by completion. These are nested functional roles rather than six independently readable temporal coordinates.
- Generating a neighborhood and preserving local transport
Separate reconstruction of spatial adjacency from the requirement that subsequent dynamics remain local. Explain the guarded transport rules used to preserve the generated metric.
- What spatial readout forgets
Investigate information lost when a full generative state is reduced to spatial records. Explain why an apparently complete geometry may still be insufficient for autonomous prediction.
- A record that carries its own completion certificate
Introduce autonomous generation of a record and a flag certifying completion. Explain why the certificate must arise from the specified dynamics rather than an external declaration.
- Keeping an observed label stable
Study repeated interrogation of a stored label, including selective measurement backaction. Explain the transport assumptions that preserve the label and the errors they allow.
- Why local geometry can be statistically rare
Explain the entropy barrier to lattice-like relational memories in the stated permutation ensemble. The result concerns a specified preparation problem, not every possible mechanism for emergent space.
- Programmed geometry and spontaneous selection
Compare the draft’s explicit torus preparation with a mechanism that would naturally select geometry. A constructive example proves feasibility while leaving the physical origin of its program open.
Sources and reading
Read the original source for its exact formulation and edition. The examples on this page are explanatory reconstructions.