Skip to content

When an additive clock is unique

An ordered rank-one return structure permits a faithful additive scalar clock only up to positive rescaling. Independent return directions and path-dependent delays show where that uniqueness stops.

In this article
  1. What clock uniqueness should mean
  2. The elementary counting proof
  3. The rank-one generalization
  4. Why rank one cannot be omitted
  5. An additive delay need not be a global time
  6. How to use the theorem in model building
Key ideasSources & reading

01What clock uniqueness should mean

If two instruments both count the same completed returns, their numerical readings may differ only because one reports seconds and the other reports another unit. The draft proves a precise version of this statement under ordered rank-one assumptions. It does not claim that every possible temporal quantity in every SMM/DTT realization is the same clock.

The distinction matters because inner generation and outer observation are different roles, but different roles do not automatically create independent scalar durations. A model can have a rich internal phase and memory structure while its completed return order admits only one faithful additive scalar calibration up to scale.

02The elementary counting proof

Consider a completed-return monoid isomorphic to the nonnegative integers. An additive clock θ obeys θ(n+m)=θ(n)+θ(m) and θ(0)=0. Let δ=θ(1). Repeated addition then forces θ(n)=nδ. If δ>0, distinct return counts have distinct readings; if δ=0, the clock detects nothing.

Thus any two faithful clocks θ and ψ satisfy ψ(n)=[ψ(1)/θ(1)]θ(n). The conversion factor is positive. No additional dynamics was needed for this elementary result, but the premise that all completed advances lie on one countable direction is doing real work.

θ(n)=nδ, δ>0
ψ=(ψ(1)/θ(1))θ
A commuting square shows that a branch operation before or after an admitted clock test gives the same statistic. Resolution evolution changes the clock.
Figure 1. A protected clock ignores branch operations. In the stated stationary finite-dimensional model, branch invisibility is equivalent to the branch generator commuting with the resolution-evolved clock observable algebra. It is a criterion to verify, not an automatic law for every clock. View full size ↗

03The rank-one generalization

The draft allows a commutative cancellative monoid whose associated difference group is torsion-free and has rational rank one. Informally, all increments are rationally related to one nonzero reference increment u. For every group element g, there are integers n>0 and m with ng=mu.

Normalize u to one and define λu(g)=m/n. Torsion-freeness makes this independent of the chosen integers, while common denominators prove additivity. The ordered positive cone fixes the sign. Every faithful additive scalar clock is consequently δλu for a unique δ>0. This includes finer rational subdivisions without adding a second independent clock direction.

ng=mu ⇒ λu(g)=m/n
θ(g)=δλu(g)

04Why rank one cannot be omitted

For a monoid with two independent nonnegative counts, such as pairs (m,n), additive clocks can assign independent weights: θ(m,n)=am+bn. Different ratios a/b need not be related by one overall scale. This is a simple counterexample to deriving scalar uniqueness merely because clocks factor through the same observable action.

Physical clock universality is stronger still. One must show that all admitted material instruments couple to the relevant completed order in the required way. A theorem about additive maps on a selected monoid does not prove that an ungated oscillator, a protected logical clock, and a transport delay all realize those maps.

05An additive delay need not be a global time

A clock can assign a duration to each history of advances and add those durations under composition. Such an assignment is a cocycle. To obtain a global event clock t, one additionally needs every assigned delay to equal t(final)−t(initial).

For example, an advance that loops back to the identical event could have a nonzero additive winding delay. No single-valued event time can represent that delay as an endpoint difference. The loop remembers history that the event label does not. This is a useful DTT lesson: a record quotient can retain an event while discarding the winding information needed for a path-dependent duration.

Δt(b∘a)=Δt(b)+Δt(a)
Exactness: Δt(a)=t(tgt a)−t(src a)

06How to use the theorem in model building

First specify which completed returns observers can distinguish and prove their composition law. Next determine the effective ordered monoid and test the rank-one conditions. Then construct an actual additive readout and calibrate one positive reference increment. Only after these steps is “unique up to units” justified.

The result fits the SMM ambition of a common origin of temporal order, but leaves the absolute scale open. The value of δ is a physical calibration unless a source dynamics selects a ratio to independently defined standards. Nor does this theorem establish Lorentzian proper time, universal clock response, or the necessity of six nested inner stages. It isolates a rigorous and useful uniqueness claim from those further questions.

KEEP THE CONNECTION

Key ideas

  • Rank-one additive clocks differ only by a positive scale.
  • Higher-rank return structures can support independent clock weights.
  • A global event time requires exactness in addition to additive delays.

Scope of the argument. Conditional uniqueness of scalar calibration; no absolute time unit or universal material-clock law is derived.

Sources & further reading

  1. SMM_DTT_Axioms_v4.pdfWorking draft, pp. 27–30
Source editions and catalogue entries
Working manuscript

Observation-Rooted Reconstruction of Outer Record Order in the Single Monad–Dual-Time Framework

Working manuscript. Article-level references identify the consulted sections and the scope of the interpretation. No public URL was supplied for this exact manuscript version.

Source register →