Counting exponent, metric distance, and locality must be established separately, then related through a common source-generated algebra and operator.
The preprint and the reconstruction target
Non-Commutative Geometric Foundations for the Emergence of Spatial Dimensions and Physical Structures from Complex-Time Spectral Triples is a public preprint. Its abstract proposes hierarchical temporal compactification and a spectral account of emergent structure. This guide develops a reading test for those proposals, extending A211.
Three statements can sound similar while proving different things: a carrier has three independent directions; an eigenvalue count grows cubically; or accessible records form a space with local three-dimensional metric behavior. An argument must state which result each calculation delivers.
Count an explicit family of modes
Take nonnegative integers n₁,n₂,n₃ and positive weights ω₁,ω₂,ω₃. The region ω₁n₁+ω₂n₂+ω₃n₃≤Λ is a tetrahedron in mode-index space. Its continuum volume is Λ³/(6ω₁ω₂ω₃), giving the leading lattice-count growth at large Λ.
The cubic exponent follows from the three independent supplied indices. This is a useful exact asymptotic target for a source model, but changing the number of indices changes the exponent. A derivation of dimensional selection must explain why the underlying carrier has this index structure.
Ask what a detector can distinguish
Suppose records carry labels (x,y,z), but every admitted detector function depends only on x and y. The accessible spatial quotient identifies all records with the same pair (x,y), irrespective of z. A three-entry label has then produced only two distinguishable directions for that interface.
If later transport allows a z-dependent effect to reach the detector, that reduced quotient is no longer predictively sufficient. Observable dimension must therefore be assessed against the chosen test family and its future continuations. The structure of a source carrier and the structure of its public records can differ.
Show how a relation becomes a distance
For a finite chain of records, assign a positive cost to each allowed neighboring transition. A path cost is the sum of its edge costs, and distance is the least such cost. Positivity and connectedness ensure finite distances; reversing edges with the same costs gives symmetry.
Those conditions are inputs until the source creates them. A spectral operator can encode the same comparisons, but the commutator bound must actually reproduce finite distances on the intended states. Merely matching the mode-count exponent does not establish this. The two-point calculation in the noncommutative guide is the smallest illustration.
Open the full-size diagram →
Locality must persist under evolution
A graph can have recognizable neighborhoods while its dynamics jumps arbitrarily between distant vertices. Conversely, a local dynamics can be programmed on a graph without explaining why that graph was selected. Formation, selection, and persistence are therefore separate tasks.
SMM asks one source to generate the relations. DTT organizes their nested construction and completed publication. The rank sequence 1,1,2,2,3,3 is a candidate organization of readout roles; it does not by itself supply a metric, a probability favoring local graphs, or a transport Hamiltonian respecting their neighborhoods.
A three-column audit
Read A211 together with A155–A157 and A123–A128. For each claimed geometry, make three columns: spectral count, operational distance, and allowed propagation. Write a concrete definition and a verified result in every column before joining them.
The strongest next finite example would derive the graph, the normalized spectral operator, and the transport rule from the same retained-history update. Which locality property survives repeated completion? Does a controlled large-system limit produce stable metric behavior? These questions turn the claim that time creates space into a sequence of measurable and reproducible constructions.
Continue with the articles
- Spatial dimensions from spectral triples: a guide
A structured entry point to the listed emergence proposal. Explain what counts as reconstructing a spatial dimension and what further work is needed to recover distance, dynamics, and empirical geometry.
- Three-frequency counting and inner spectral dimension
Introduce the cubic eigenvalue-counting result for the inner operator. Explain why including the separate outer circle changes the count in the compact auxiliary model.
- Why spectral dimension does not determine distance
Use the draft’s counterexample to show that an operator can have a useful eigenvalue count while giving infinite distances between localized states. Dimension and metric require separate checks.
- Graph distance from a normalized spectral block
Introduce the graph-block construction whose Connes distance equals weighted shortest-path distance. Explain the normalization assumptions behind that equality.
- 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.
- 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.
Sources and reading
Read the original source for its exact formulation and edition. The examples on this page are explanatory reconstructions.