Skip to content
Shadow Theory

Section 3 4 October 2026

An exact massive detector in physical time

Reading position 4 of 15

3 An exact massive detector in physical time

Let A=∣1⟩⟨1∣A=\ket{1}\bra{1} act on a retained internal control label. First a finite internal unitary correlates this label with projectors P0,P1P_0,P_1 of the unknown source, giving ∑aPaψ∣a⟩\sum_a P_a\psi\ket a. No actual internal jump is introduced by this operation. Prepare one oscillator in its ground packet

ϕ0(y)=(2πσ2)−1/4e−y2/(4σ2),σ2=ℏ2Mω. \phi_0(y)=(2\pi\sigma^2)^{-1/4}e^{-y^2/(4\sigma^2)},\qquad \sigma^2=\frac{\hbar}{2M\omega}.

Choose a smooth centre trajectory b(0)=0b(0)=0, b(Tw)=Lb(T_w)=L, with b˙=b¨=0\dot b=\ddot b=0 at both ends, and set

c(t)=b(t)+b¨(t)ω2,Hw(t)=py22M+Mω22(y−c(t)A)2. c(t)=b(t)+\frac{\ddot b(t)}{\omega^2},\qquad H_w(t)=\frac{p_y^2}{2M}+\frac{M\omega^2}{2}\bigl(y-c(t)A\bigr)^2. (7)

This operator is nonnegative. No first-order unbounded-below translation is used. A convenient explicit choice is

b(t)=L(10s3−15s4+6s5),s=t/Tw,b˙=30LTws2(1−s)2≥0. b(t)=L(10s^3-15s^4+6s^5),\quad s=t/T_w,\quad \dot b=\frac{30L}{T_w}s^2(1-s)^2\ge0. (8)

Smooth higher-order endpoint interpolation can be used when all clock-window derivatives are required; the C2C^2 quintic suffices for the exact writer and the finite-order estimates here. The trap may overshoot the packet centre during acceleration; its finite displacement and force are resources.

Proposition 3.1 (Exact wave and selected actual motion)

For this primitive, ψ\psi is an internal/reference vector, with no unresolved older spatial coordinates. Writing pa=∥Paψ∥2p_a=\norm{P_a\psi}^2, the wave is

Ψt(y)=P0ψ∣0⟩ e−iωt/2ϕ0(y)+P1ψ∣1⟩ eiθ(t)eiMb˙(t)(y−b(t))/ℏϕ0(y−b(t)),θ˙=Mb˙22ℏ−Mω2(b−c)22ℏ−ω2.\begin{align} \Psi_t(y)&=P_0\psi\ket0\,e^{-i\omega t/2}\phi_0(y) +P_1\psi\ket1\,e^{i\theta(t)}e^{iM\dot b(t)(y-b(t))/\hbar}\phi_0(y-b(t)),\tag{9}\\ \dot\theta&=\frac{M\dot b^2}{2\hbar}-\frac{M\omega^2(b-c)^2}{2\hbar}-\frac\omega2. \notag\end{align}

For gσ=∣ϕ0∣2g_\sigma=|\phi_0|^2,

ρt(y)=p0gσ(y)+p1gσ(y−b(t)),jt(y)=p1b˙(t)gσ(y−b(t)). \rho_t(y)=p_0g_\sigma(y)+p_1g_\sigma(y-b(t)),\qquad j_t(y)=p_1\dot b(t)g_\sigma(y-b(t)). (10)

Let Ft(y)=p0F(y/σ)+p1F((y−b(t))/σ)F_t(y)=p_0\Ncdf(y/\sigma)+p_1\Ncdf((y-b(t))/\sigma), where F\Ncdf is the standard normal CDF. The complete actual pointer path is

Yt=Ft−1(U),U=F(Y0/σ)∼Unif⁡(0,1). Y_t=F_t^{-1}(U),\qquad U=\Ncdf(Y_0/\sigma)\sim\operatorname{Unif}(0,1). (11)

In particular 0≤Y˙t≤b˙(t)0\le\dot Y_t\le\dot b(t) during the monotone write.

Proof

Substitute the Gaussian ansatz into the Schrödinger equation. The coefficient of y−by-b is Mb¨=−Mω2(b−c)M\ddot b=-M\omega^2(b-c) and its scalar coefficient is precisely the displayed θ˙\dot\theta; the Gaussian width stays at its ground value. Internal labels are orthogonal, so there are no cross terms in ρ\rho or jj. Now ∂tFt=−jt\partial_tF_t=-j_t and ∂yFt=ρt>0\partial_yF_t=\rho_t>0. Differentiating Ft(Yt)=UF_t(Y_t)=U gives (3). The initial inverse transform supplies the uniform rank, without a second randomness postulate.

□

3.1 Actual timing, false-ready tails and null continuation

Put a threshold h=L/2h=L/2. Let τ=0\tau=0 for the initially right-hand tail Y0≥hY_0\ge h, and otherwise let τ\tau be its first subsequent threshold crossing, with τ=∞\tau=\infty if none occurs before TwT_w. This convention retains the finite false-ready tail

δ=F‾(L2σ),P(τ=0)=δ. \delta=\Ntail\left(\frac{L}{2\sigma}\right),\qquad \Prb(\tau=0)=\delta.

It is not an assertion that a preliminary check of readiness is noninvasive. Monotonicity in Proposition 3.1 gives the complete law

P(τ>t)=Ft(h),P(τ∈dt)=p1b˙(t)gσ(h−b(t)) dt(0<t<Tw),P(τ=∞)=p0(1−δ)+p1δ.\begin{align} \Prb(\tau>t)&=F_t(h),\qquad \Prb(\tau\in dt)=p_1\dot b(t)g_\sigma(h-b(t))\,dt\quad(0<t<T_w),\tag{12}\\ \Prb(\tau=\infty)&=p_0(1-\delta)+p_1\delta. \notag\end{align}

The positive-time density integrates to p1(1−2δ)p_1(1-2\delta); together with the initial atom and final null it normalizes to one. Conditional on no pre-trigger event the survival is Ft(h)/F0(h)F_t(h)/F_0(h); conditional on no crossing by tt, its instantaneous hazard, where defined, is

p1b˙(t)gσ(h−b(t))Ft(h). \frac{p_1\dot b(t)g_\sigma(h-b(t))}{F_t(h)}. (13)

This is a derived physical-time formula, not a memoryless source-sector clock. Continuing a return pulse uses the same rank UU, not a newly sampled waiting time. A dark hold with b˙=0\dot b=0 has zero pointer current.

If an input is entangled with older spatial memories, the full velocity is evaluated before integrating those coordinates out. When they are held fixed, the quantile argument applies separately to their conditional spinor fibres, with the corresponding conditional pap_a. The integrated pap_a still determines marginal density but generally does not determine an individual joint trajectory. For moving old coordinates, use the complete guidance equation rather than this one-dimensional primitive formula.

The conditional position law after a null at tt is

P(Yt∈dy∣τ>t)=1y<hρt(y)Ft(h) dy. \Prb(Y_t\in dy\mid\tau>t)=\frac{1_{y<h}\rho_t(y)}{F_t(h)}\,dy.

The global wave remains (9), including both packets. For an arbitrary past record event BB, equation (6) rather than a present-sector projection supplies the conditional continuation. A timestamp reader would be an additional interaction and would change this wave; equation (12) describes this specified pointer without an extra timestamp apparatus. A finite timestamp claim requires those contacts and their complete dynamics; the first-crossing formula alone does not construct that reader. Unmeasured arrivals and recorded detection times need not coincide [10].

Autonomous equilibrium records: apparatus and record construction
Figure 1. The massive writer with L/σ=8L/\sigma=8, p1=0.65p_1=0.65, Tw=1T_w=1 and ω=π\omega=\pi. A controlled trap drives a Gaussian packet; mixture-quantile paths at ranks 0.04,0.20,0.40,0.60,0.75,0.85,0.960.04, 0.20, 0.40, 0.60, 0.75, 0.85, 0.96 produce the threshold-time distribution. The dashed line in the middle panel is h/σ=4h/\sigma=4. These are deterministic evaluations of the displayed equations, not a trajectory-stability estimate for the complete autonomous apparatus.

3.2 Energy and force resources

In branch 1,

⟨Hw(t)⟩=ℏω2+M2b˙2+Mω22(b−c)2. \langle H_w(t)\rangle=\frac{\hbar\omega}{2} +\frac M2\dot b^2+\frac{M\omega^2}{2}(b-c)^2. (14)

It is finite for the explicit trajectory. The work in the driven description is ∫⟨∂tHw⟩dt\int\langle\partial_tH_w\rangle dt. It vanishes between the initial ground state and the final ground state of the shifted holding trap, but nonzero energy is borrowed and returned during the pulse. The autonomous clock below carries this exchange. Zero net work is not zero transient work or an unlimited source of reset readiness.