Section 7 4 October 2026
An autonomous massive clock and archive current bounds
7 An autonomous massive clock and archive current bounds
External pulse timing is a physical resource. We now include its provider and its recoil in the same Hamiltonian. This step also avoids an invalid inference from small wave error to small path error.
7.1 The complete autonomous Hamiltonian
Resolve a finite smooth driven programme as
The coordinate-independent Hermitian matrix is bounded. All are strictly positive. The are real bounded smooth profiles with bounded derivatives. The are affine Hermitian matrix functions of , possibly plus bounded smooth matrix functions with bounded derivatives. This covers the forced trap (expand its square), finite internal rotations, transported trap controls (23), and smooth position feedback. Any finite coordinate-independent internal unitary while stored oscillators are present can be implemented exactly by
Its kinetic term is unchanged and its scalar quadratic term is unchanged; only finitely many bounded or affine matrix coefficients vary. This provides a direct finite gate compiler within (27).
The stationary protection estimate applies on each constant exposure. A finite programme with sharp bounded internal switches can be replaced by smooth, archive-preserving ramps. If is the difference from that piecewise constant internal programme, its additional full-wave error is at most
and is included in . Once the finite gap and exposure are fixed, sufficiently narrow finite ramps make this cost arbitrarily small. For derivative comparisons, the internal perturbation satisfies ; propagation of this residual uses Lemma 7.1. The ramps preserve the archive keys, or commute with their storage Hamiltonians, so the held archive current remains zero.
For an exactly trap programme use a flat positive bump on and
It is monotone and flat at both endpoints, so the exact writer proof is unchanged. The quintic in the figure instead gives a continuous piecewise-smooth trap profile; smoothing it has a directly bounded integrated residual. No globally smooth extension of its nonzero endpoint third derivative is presumed.
Add a massive clock coordinate , prepared in the unchirped minimum-uncertainty Gaussian
It has mean position , position deviation and mean momentum . Define
This is autonomous and semibounded: bounded profile coefficients and oscillator confinement absorb each affine force by Young's inequality. It is self-adjoint on the free-clock-plus-oscillator domain, with the relative bound of the affine perturbation arbitrarily small. There is no read of the actual clock position followed by an external switch. The quantum potential is the interaction itself, and the actual clock follows (3) on the full wave.
The initial wave is , including all prepared apparatus and retained resources. Let be its exact evolution under (28). Compare it to
The free clock has mean and width
The comparator includes the clock; it is not a reduced apparatus state. Here the driven Hamiltonian contains the chosen protection and spatial-feedback terms: only its external timing is idealized. This driven wave is distinct from the nominal, unperturbed key-controlled wave used to define the target instrument. Their gate comparison does not by itself give an archive-current estimate.
7.2 Derivative control uniform in clock resources
Choose fixed reference length units for the pointer coordinates. For , write
Dimensional powers of those fixed length units are understood; they can equivalently be inserted term by term. The norm integrates over and all internal/reference indices, but differentiates only .
For the fixed finite inventory in (28),
The constant depends on the pointer inventory and the profile bounds, but not on , the mean clock momentum, or the reference dimension. The same estimate holds for the time-dependent ideal propagator.
For each scalar differential monomial , and . Its commutator with the scalar oscillator is a finite sum of monomials of total order at most . An affine potential removes a derivative in each nonzero commutator; multiplication by bounded smooth functions contributes bounded coefficient terms of no higher order. Thus
Matrices need not commute with each other: only their commutators with scalar coordinate operators have been used. Commute through the propagator, apply Duhamel and unitarity, sum, and use Gronwall. These identities hold first on the smooth core; oscillator graph-norm regularization and the same uniform estimate extend them to the displayed domain. The time-dependent case uses uniform coefficient bounds. Tensoring an identity does not change any estimate.
□Assume . For define
Take for the propagation estimate, by unitarity. Then
where is finite and independent of the clock resources. All clock, fuel, receiver, record and reference factors remain in this comparison.
The defect of under the exact Hamiltonian is
The coordinate factor separates under every derivative and multiplier, so
Affine multiplication needs at most of the ideal wave; bounded smooth terms need . Lemma 7.1 bounds these on a fixed horizon. Apply Duhamel in the invariant domain and (30); proves the last inequality. The exact product initial state makes the initial defect zero.
□For example gives error for fixed apparatus. Its mean initial free clock energy is
Every finite member has finite energy and normalizable resources. The ideal limit requires increasing mass/energy; Gaussian packets have unbounded support and are not claimed to have a strict energy cutoff. Total energy is conserved. The clock can recoil and entangle: (32) bounds its complete discrepancy instead of deleting it. These are finite-horizon claims, not a perfect autonomous clock for all time.
7.3 Why the same estimate controls actual archive history
A small wave error alone does not control guidance paths. The estimate provides the extra information needed for a specified retained record surface. Let be one such decision surface. The one-coordinate, Hilbert-valued trace estimates imply
For completeness, follows by integrating the derivative of on a half-line; apply it also to . All other coordinates and the reference are Hilbert-valued parameters.
During a hold interval , suppose the ideal wave has pointwise on and . Let . In equilibrium for the exact autonomous dynamics,
Sum this bound for finitely many retained record surfaces. Add their write/readout errors separately.
Write . Expanding and applying the two trace estimates and Cauchy–Schwarz gives
This bounds absolute flux; cancellation of signed currents is not enough. To avoid a hidden transversality assumption, let smoothly approximate the indicator of one side of , with and . Along almost every complete trajectory,
Equivariance makes its expected right side . A genuine change of side contributes at least one to the limiting variation. Hilbert-valued traces make the current continuous in the normal coordinate as an function of the other coordinates. Fatou and the approximate-identity limit bound its probability by . Insert the preceding inequality and the pointwise-zero ideal current. Lemma 2.4 already handles nodes; no positive lower density is assumed.
□The ideal stored wave (21) supplies the required pointwise zero, including during noncommuting continuation on the other factors. The transported reset (23) also preserves that current. Finite clock tails therefore produce a quantified finite-horizon historical error, rather than being incorrectly declared harmless from endpoint equivariance.
Choosing the archive comparator.
For each promised archive segment, the clock-only choice of is valid when the actual driven comparator has zero archive current. Its gates must preserve that archive's key, implement the exact covariant key transport, or commute with its storage Hamiltonian. The protected logical bank is subject to the commuting-storage hypothesis of Section 6; an arbitrary disturbance of an archive key is not covered. Alternatively, if a zero-current comparator obeys
then use in (34), with bounding . This derivative discrepancy includes propagation through all intervening stages. The quantity cannot replace it.
For position feedback, keep a separate completed archive with its own immutable key. The working pointer may recoil under , while still has zero ideal current by Theorem 5.1. If preservation of is desired as well, repeat the graph-norm proof with residual , propagating it through every subsequent stage up to the end of the promised hold. This supplies the additional just defined. Its norm is computed by differentiating the known Gaussian and twice. Since and its derivatives are supported in the wrong half-line or central buffer, this norm is bounded by a finite polynomial in times
The graph propagation constant grows at most exponentially in for a fixed duration and other fixed parameters, because the affine trap coefficient is linear in . Thus this derivative error, and its surface-flux budget, tend to zero as at fixed . This is an actual controlled limit, not a raw-path TV assertion.