Emergent Time
Temporal structure requires a specified clock, readout, and dynamics. The categorical kernel supplies none of these automatically. On the chosen site the classifier describes logical subobjects; it is not a set of rank-one projectors. is the selected model dimension, not a theorem forcing seven moments of physical time.
The relational idea of Page and Wootters (1983) is to describe a system conditional on an internal clock reading. Implementing it requires the clock subsystem and the joint state. The constructions below distinguish cyclic labels, a directed history, metric length, and physical calibration.
A supplied cyclic clock
Choose an integer , a free transitive -set , a generator , and a basepoint . Then labels its readings. On the external Boolean algebra , define ; it preserves the Boolean operations and satisfies . This is a definition on the supplied clock labels, not a modality forced on the topos classifier or a guarded “later” modality.
Set . With an independently chosen energy basis and scale , take and define
The finite Fourier sum proves orthonormality and the exact shift identity
The choice of spectrum fixes this realization. A matrix logarithm of the shift has branch ambiguity; it does not uniquely recover a Hamiltonian or its physical scale from logic.
A supplied tensor factor and conditional states
Choose and a density matrix . A labelled one-dimensional O-axis in is a subspace, not a seven-dimensional clock factor. In particular does not give ; the latter is a separately constructed 42-dimensional joint system.
For a supplied self-adjoint constraint
one has and . Stationarity alone does not imply the support constraint: a mixture over two distinct constraint eigenvalues commutes with but cannot be supported in one kernel after an energy shift. T-87 remains conditional on the specified tensor factor and support constraint.
For and , the conditional state is
This gives valid density matrices. A unitary conditional evolution further requires compatible clock and system spectra and the chosen constraint; the tensor product or stationarity alone is insufficient. An interacting or dissipative conditional law requires its own construction.
Cyclic resolution and directed histories
The step is the resolution of the specified spectrum, not a universal quantum of physical or subjective time. The clock repeats after and records only . For identical additive clocks the sum has distinct energies, although the tensor space has dimension ; its period is unchanged. Positional history registers are a different construction.
T-53b supplies an exact finite realization of a specified channel history using a chosen register, Stinespring dilation, and a history constraint; see §11.4. A state-dependent nonlinear trajectory can be reproduced by a constraint fitted to that trajectory; this does not produce one linear CPTP law for all inputs. The verified finite and limiting register constructions are in §11.
T-53a: the exact label-set theorem
Given two based free transitive -sets and , the map
is the unique equivariant bijection carrying to [T]. Freeness makes the formula well-defined modulo , and transitivity proves bijectivity. Without the selected basepoint correspondence there are such bijections, so no canonical one is supplied.
Assigning PW, geometric, or categorical descriptions to these labels is additional model data. The theorem does not identify their processes or prove equal clock rates. Bures arc length is a curve-dependent functional; it can vanish on a stationary curve and reparameterizes a regular curve only where its speed is positive. An invertible path groupoid does not by itself encode irreversible channel histories. A directed depth and cyclic label are not bijective. The former universal equivalence of four temporal constructions is withdrawn [✗]; see §6.
The Arrow of Time
The arrow below belongs to a specified history of quantum processes; it is not derived from a terminal object or the existence of a topos. Choose and linear CPTP channels , and set . Assigning states to the objects of the ordered category and channel composites to its arrows gives a directed history [D]. Its direction is supplied by the order of records; identifying it with physical time requires a separate bridge.
If all are unital, , data processing gives
Entropy is therefore non-decreasing along the specified history [T]. For a fixed unital GKSL semigroup the same statement holds in its parameter . CPTP and unitality are explicit hypotheses, not consequences of orientation toward a terminal object.
Strict loss needs a separate condition: nonunitarity or absence of a CPTP inverse alone does not make the inequality strict at every input. Identity and unitary steps preserve ; a coarse-graining may preserve an already coarse-grained state. If a channel merges two distinct admissible states, there is no common recovering left inverse on that class. An arbitrary functor has no specified linear kernel; “” is not a general criterion for nonequivalence.
A strict decrease of excludes a CPTP recovery that restores both states in the pair after the step. It does not exclude preparing one previously known with a replacement channel; that preparation does not recover information about an unknown input.
Verified strict example. For , choose . When , strict concavity of entropy gives , hence . This channel has zero linear kernel but no CPTP inverse: data processing for a proposed inverse would contradict strictness. This is a non-reversible action under explicit hypotheses, not a universal law of all channels.
Intuitive Explanation of the Arrow
Forgetting is irreversible on a class of records if distinct inputs yield the same output record: the output alone cannot recover the selected input. This property of a specified readout does not prove that every physical step forgets information or that every trajectory tends to one attractor. The directed count and cyclic tick have different types; the tick label alone carries no strict monotonicity.
Relation to CPTP
Fixed GKSL generators give linear CPTP semigroups; specified numerical self-models and rates may instead give a nonlinear state-preserving flow . It cannot be called one CPTP semigroup, and the entropy theorem above does not automatically apply to it. Monotonicity and convergence for the full dynamics require separate proofs.
The former derivations “terminality → collapse of strata → CPTP → universal cosmic arrow” and a general Lyapunov functional for the full nonlinear flow are withdrawn [✗]. The terminal process system is one-dimensional; is a state, not the terminal object or an automatically selected attractor. See the kernel and direct proof.
T-53d: conditional slowing at a fold
Purity alone does not determine a clock rate. With and a fixed Hamiltonian,
This is an upper bound, obtained by writing . A state diagonal in the energy basis has zero unitary speed at any allowed purity; neither nor implies a temporal threshold.
(Fold). Assume a smooth finite-dimensional vector field at an interior equilibrium has a simple zero eigenvalue, all other eigenvalues with negative real parts, and a nondegenerate one-parameter fold. In a smooth center coordinate and the specified evolution parameter, its reduced equation is
For the stable branch has , where is chosen so . Its slow eigenvalue and local relaxation rate satisfy
(ClockReadout). Independently specify a smooth nonnegative rate along this branch, , with . Define the internal clock by . Then
This is T-53d [C under (Fold)+(ClockReadout)]. A fold gives the square-root relaxation scale; identifying that scale with clock speed is the separate readout condition. The normal-form background is given in Kuznetsov’s lecture notes; Kuehn (2009) analyzes how degeneracy changes saddle-node scaling.
Replacing by requires an additional positive linear calibration , . If instead , the rate is linear in that purity difference. No argument sets universally. The former universal freezing, viability equivalence, and infinite subjective-time conclusions are withdrawn [✗]. See the direct proof.
Connections and preserved addresses
The evolution model and its density-preserving compiled step must supply the dynamics. A target, an attractor, and logical support have different types; none selects the clock. The full proof contains the independent finite history-register constructions. Historical addresses below now lead to the corrected scopes on this page.