Companion paper Version 2
A Massive Configuration Completion of the Quantum Measurement Programme
Event timing, semibounded material records, retained resources, and an autonomous finite-horizon realization
We construct a semibounded material realization of a complete finite quantum measurement chain within a massive-configuration theory. Its physical premises are the universal spinor Schrödinger inventory, the Bohmian kinetic-momentum guidance law and complete initial equilibrium with a finite independent ready stock. Smooth forced harmonic traps give exact physical-time pointer paths and null laws. Finite coherent reaction resources retain pending excitation, loss products, fuel and reset receivers. Stationary conditional traps protect actual earlier records through copying, reset and noncommuting continuation with an inaccessible reference.
A retained massive clock realizes the programme autonomously. Weighted derivative estimates control complete retained-wave error and, separately, the absolute archive flux needed for historical faithfulness. The closure theorem includes pre-reset transfer error and applies Gaussian truncation only to the final retained-output comparator. We give complete proofs, a nontrivial finite example and explicit rival processes. An equivariant diffusion has mutually singular microscopic paths while retaining reliable macroscopic records, so successful records alone do not select the guidance law uniquely.
The result is a constitutive completion with controlled finite-resource output and history errors on a finite nonrelativistic domain. It is separate from the pilot-medium completion's discrete Bell-path limit: no actual internal spin jumps or Bell waiting law are assumed or derived here. The calculated crossing-time law concerns the specified pointer; an additional timestamp instrument requires its own dynamics.
1 The massive constitution and its relation to event selection
The integrated monograph, version 2 [1], develops two constitutive completions of the measurement programme. The present paper gives the massive-configuration construction as a self-contained argument. The companion pilot paper [2] derives a controlled discrete Bell-path limit under a different interaction catalogue and preparation assumptions. Each completion uses one compatible material constitution throughout its source, records, resources and continuation.
For the original finite complete configurations, its target is
Selecting this discrete law requires individual edge-current realization, elimination of symmetric surplus traffic, and the complete conditional timing law. Earlier routes in the monograph establish the following conditional implications:
Canonical kinetics. Primitive binary additivity, endpoint gauge covariance and a common action unit fix bond torques. Conservative packet export then feeds a supplied complete additive Markov pair-reaction generator. Scalar participation, absence of other reactions, calibrated populations, and the two-scale limit yield full tagged-path convergence. Gauge invariance alone allows the explicitly displayed loop-force bypass.
Relative entropy. Expected individual edge matching, a neutral positive Markov reference, path-relative-entropy minimization, and a zero-background prescription already select the whole law, even from history-dependent candidates. The reference and the prescription are statistical physics, not consequences of ignorance.
Chambers. Norm-squared volumes, rectified normalized portals, no other transfer, and fresh Poisson stirring already give the complete path limit, including nodes. Coherent daughters and adaptive readiness have their own premises. Finite stirring is itself an equivariant non-Bell theory.
MPBT. The minimal positive-trace statement concerns the Jordan decomposition of expected signed incidence. It neither equates a smooth current measure to a sample counting measure nor determines the conditional waiting law.
The version 2 pilot completion replaces its comparison clocks and instantaneous cancellation by an independently prepared spatial gas and finite-speed packet recombination, with a controlled path limit [2]. That result retains its own physical premises. The massive construction below has a different ontology and does not use its event mechanism. The monograph also contains continuous guidance and a first-order translation detector; the latter is self-adjoint but unbounded below. Guidance, equivariance and effective branching have established provenance; the material construction here uses positive kinetic energy, confining traps and a retained controller.
The advance here is a common massive, semibounded material construction, including a retained autonomous controller and a history-protection estimate. It supplies the physical contacts through the very Hamiltonian that supplies motion. The source may have spin or other internal amplitudes, but an internal basis label is not an additional definite position or an independently jumping actual sector. Equation (1) therefore ceases to be a law required of that label. An experiment that can coherently read such a label must have a material pointer, which is included in the dynamics.
Scope of the main result.
For a finite input system, arbitrary inaccessible reference, a finite resource bank, and a finite programme of coherent gates and material position records, we construct an exact autonomous dynamics. At any prescribed positive tolerance its record instrument and retained quantum output approximate the specified ideal finite instrument, and its physical records remain faithful to their earlier declarations with a stated error. No source-state copies, primitive Poisson clocks, irreversible collapse, or free mathematical path recorder are supplied. The needed initial equilibrium and velocity law are named physical axioms. These additional physical premises define the scope of the completion.
2 The complete constitution and its statistical provenance
Use finitely many massive coordinates , a finite internal material space containing source, actuators, fuel, memories and spent products, and an inaccessible . The complete state is
A quantum clock coordinate is appended in Section 7. Coordinates of otherwise passive source particles can be included in confining ground states. Internal spin is part of ; there is no extra actual spin assignment.
Every source contact, recorder, controller, protection device and reset receiver belongs to the same spinor Schrödinger inventory. Its admitted Hamiltonians are
with self-adjoint semibounded realizations specified below. Every operation is identity on . There is no additional classical device that reads a nonlinear function of a source ray without participating in this wave dynamics.
This last inventory statement is a physical restriction, not a theorem about every imaginable substance. It makes access and reaction compatible in this model: adding a contact changes and hence the wave controlling the actual motion. In particular a neutral ray meter from a different hybrid constitution cannot be appended without changing the theory.
Physical material positions have velocity given by the local real kinetic momentum per unit mass:
The formula is used only where . There are no further random displacements or circulation terms.
This is the standard Bohmian law, with established provenance [3, 4, 6]. Its independent physical content is differentiable material motion governed by wave kinetic momentum. For a scalar wave it says . Separating the real Schrödinger equation gives
Its gradient determines acceleration along the flow. This is a concrete mechanical postulate; it does not minimize a graph traffic functional. Symmetry or continuity alone does not force it, as Section 10 demonstrates.
Conditional on each supplied classical preparation description , the full initial configuration law is
Fresh ready cells and the clock are supplied in specified product waves, independent of the unknown input. There is a finite stock. No subsequent reset is assumed to generate a fresh seed conditional on an arbitrarily exposed microscopic past.
This is the only stochastic/ensemble input in the adopted dynamics. Initial and the deterministic flow generate every later probability. It is not derived from source/readout incompleteness, from equilibration, or from a typicality slogan. The equilibrium and conditional-wave literature distinguishes these issues [5]. For example a real stationary wave has , so an initially nonequilibrium distribution is stationary too. Universal dynamical equilibration is false in this class without additional hypotheses.
2.1 Self-adjointness, domains and nodes
The driven library uses scalar confining quadratics, affine coordinate terms with finite Hermitian coefficients, bounded smooth matrix potentials, and finitely many smooth time windows. On each fixed finite programme, all coefficients and their required derivatives are bounded. Completing the square bounds affine forces below. Finite internal gates are bounded. The resulting oscillator operator plus infinitesimally oscillator-bounded affine terms and bounded potentials is self-adjoint on the oscillator domain. Smooth vectors are preserved on finite intervals. One can verify the last assertion by commuting through the equation: scalar quadratics keep total order fixed, affine terms lower derivative order, and bounded smooth terms contribute only lower derivatives. Finite sums of Gaussian packets used below are such vectors.
Suppose the wave is on each programme interval and
For the smooth nonsingular inventory above, the guidance flow exists throughout for -almost every initial position and pushes to . It neither loses mass at a node nor reaches infinity in finite time with positive equilibrium probability.
Direct differentiation using the Hermitian potential gives . On compact subsets of , the locally smooth velocity has a unique flow and the continuity equation gives partial equivariance up to its exit. Under this killed flow, the position distribution is dominated by .
Expected distance travelled before exit is bounded by
Escape to infinity would require infinite distance. To control nodes, along a surviving path differentiate . Its expected total variation is bounded by
Here and . Reaching a node while remaining in a bounded region would send to , which has probability zero by the preceding bound. Initial nodes have zero probability. Exhaust the local domains; there is no remaining loss of mass. Domination by the normalized density then becomes equality. Finitely many switches concatenate without a new random draw. This is the current-integrability argument underlying the general existence theorem of Teufel and Tumulka [7]; no theorem for arbitrary singular potentials is imported.
□The autonomous Hamiltonian below has an additional scalar free kinetic term and smooth bounded functions of the clock multiplying affine pointer operators. The same commutator estimates, now also including clock weights and derivatives, give smooth finite-moment evolution and (6). Its initial clock packet has finite momentum moments at each finite mass. Thus the lemma covers the complete state, not just a reduced pointer.
2.2 The law on complete histories
Let be the almost-sure flow. The complete path measure is explicitly
Continuous path space is standard Borel, so regular conditional laws for a finite or countably generated record history exist. For any past event of positive probability, the conditional future is the normalized restriction of the initial integral to its preimage under the flow. Given the complete initial state the future is deterministic. Given only coarse past records it is usually history dependent. Predictable crossing times need not have a compensator absolutely continuous in . No Bell intensity, Markov hazard or exponential threshold is asserted in this filtration.
Where the pointwise current vanishes for an interval, positions are fixed. Current reversal reverses the corresponding instantaneous velocity, with its accumulated initial-position information retained. Nodes are handled by Lemma 2.4; conditioning on a zero-probability event is not assigned a normalized daughter.
3 An exact massive detector in physical time
Let act on a retained internal control label. First a finite internal unitary correlates this label with projectors of the unknown source, giving . No actual internal jump is introduced by this operation. Prepare one oscillator in its ground packet
Choose a smooth centre trajectory , , with at both ends, and set
This operator is nonnegative. No first-order unbounded-below translation is used. A convenient explicit choice is
Smooth higher-order endpoint interpolation can be used when all clock-window derivatives are required; the 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.
For this primitive, is an internal/reference vector, with no unresolved older spatial coordinates. Writing , the wave is
For ,
Let , where is the standard normal CDF. The complete actual pointer path is
In particular during the monotone write.
Substitute the Gaussian ansatz into the Schrödinger equation. The coefficient of is and its scalar coefficient is precisely the displayed ; the Gaussian width stays at its ground value. Internal labels are orthogonal, so there are no cross terms in or . Now and . Differentiating gives (4). 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 . Let for the initially right-hand tail , and otherwise let be its first subsequent threshold crossing, with if none occurs before . This convention retains the finite false-ready tail
It is not an assertion that a preliminary check of readiness is noninvasive. Monotonicity in Proposition 3.1 gives the complete law
The positive-time density integrates to ; together with the initial atom and final null it normalizes to one. Conditional on no pre-trigger event the survival is ; conditional on no crossing by , its instantaneous hazard, where defined, is
This is a derived physical-time formula, not a memoryless source-sector clock. Continuing a return pulse uses the same rank , not a newly sampled waiting time. A dark hold with 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 . The integrated 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 is
The global wave remains (10), including both packets. For an arbitrary past record event , equation (7) rather than a present-sector projection supplies the conditional continuation. A timestamp reader would be an additional interaction and would change this wave; equation (13) 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 [9].
3.2 Energy and force resources
In branch 1,
It is finite for the explicit trajectory. The work in the driven description is . 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.
4 A full finite source–actuator–resource module
Here is a nontrivial receptor that is physically in the same inventory. On a finite factor use orthogonal states
They include the following actual material degrees in their internal wave description:
| State | Production | Fuel | Site | Excitation | Memory | Remnant |
|---|---|---|---|---|---|---|
| 1 | 1 | ready | 0 | blank | vacuum | |
| 0 | 1 | ready | mode | blank | vacuum | |
| 0 | 0 | spent | 0 | capture | ||
| 0 | 1 | ready | 0 | blank | loss |
Assign energy to a production cofactor, fuel unit, excitation and loss remnant, and to a capture remnant; the displayed labels are degenerate. Every row has total resource energy . Hence the conversion gates conserve this resource energy exactly while spending readiness and retaining energy in products. Their full tensor-factor implementation is defined to be zero outside the indicated equal-energy active subspace. Other exhausted sectors stay present.
For source projectors , set
These Hermitian generators have norm one on their active subspaces. Nonoverlapping pulses and with areas give exactly
Indeed each generator is a two-dimensional rotation, and the active sectors are orthogonal. There was no sampled reaction time in this calculation. Reduced excitation populations are not actual level trajectories in the adopted ontology. The actual event is a subsequent spatial registration governed by Sections 2–3.
The finite response has four exact orthogonal status weights (and ideal resolved-pointer probabilities):
The pending excitation remains a vector in the actual model at a finite cutoff. Continuing processes it coherently; a finite closed receptor can recur. A zero response window does not erase it. Neither an absorbing boundary nor a restart clock is imposed when a coefficient begins to populate .
4.1 Physical null, capture and loss
Use three spatial readout centres for captured , null, and captured . The same forced oscillator construction applies to each orthogonal control projector, using signed trajectories. Noncaptured components share the null packet. Nearest-centre cells have worst tail at most , with . The ideal orthogonal-label comparator has capture coefficient
and complete null vector
Only for a declared reduced comparison, tracing gives
Equation (19), along with pointer and all receiving systems, is the retained continuation. Equation (20) is not a global collapse rule. Finite spatial classifiers approximate these ideal labels; Section 8 bounds the complete output error.
4.2 Finite stock and exhaustion
For a promised -epoch experiment allocate ready cells, their blank archives, and receivers. Gate the active conversion only on sectors containing the required cofactor, fuel, site and blank capacity. Extend the unitary by identity on explicitly exhausted sectors, which can be spatially flagged by the same writer. A failed or null attempt does not receive a new for free. The consumed-ready-cell count is bounded by the allocated finite schedule; no infinite Poisson bath is hidden in this implementation.
5 Physical records that remain true about their past
After a write, retain its internal orthogonal key and hold the pointer in
Known branch phases can be corrected by bounded internal potentials. A single stationary packet need not have compact support; its classification error was already accounted for.
Suppose the wave after the write has form
where denotes all other coordinates and internal factors. Future gates preserve , hold as in (21), and may be noncommuting on the source or act on . Then pointwise on the complete configuration space. The actual coordinate and its finite readout label remain exactly fixed throughout that interval.
Orthogonality of the key eliminates cross terms. Each remaining contribution to is , which is real. Equation (4) gives the conclusion away from the almost-sure excluded nodes.
□This is a path statement, not an inference from equal endpoint weights. It controls actual old declarations even when later source measurements do not commute with the first. Unknown interactions that violate its Hamiltonian conditions require their own bound.
5.1 A genuine copy and its classification error
Copy the key by a finite reversible unitary into a blank internal factor, amplify that factor into a fresh massive pointer, and retain both. Throughout this operation the old key is preserved, so Theorem 5.1 holds for the old actual position. If the two classifiers have worst errors , their disagreement probability is at most . To prove it, expand their joint squared-norm density over the orthogonal key and apply a union bound to the two conditional Gaussian tails. The key in this proof is an orthogonal expansion index, not an additional secretly actual spin variable. The copy is faithful to the first actual declaration because the old pointer stayed fixed during the write; its finite misclassification remains in the bound.
5.2 Reset with the receiving system retained
Supply an identical ready factor and let be SWAP. With
an old entangled state is transferred as
The old pending excitation, remnant, lost product and reference correlation remain in . Identical free resource Hamiltonians have .
There is a subtle control issue: if a stationary trap followed the old label, a bare SWAP would change its centre. The exact physical repair is
Its propagator is by differentiation. Because is coordinate independent, it preserves the position density and current pointwise. The old spatial record remains held while the trap's controlling key is transferred to . The potential is a unitary conjugate of a nonnegative matrix potential plus a bounded matrix, so it stays semibounded. Expanding its square gives a scalar quadratic term and affine matrix coefficients, within the common inventory. Simply declaring a rewired trap after SWAP would omit this interaction.
If the original pointer itself is to be restored, a reverse smooth forced trap can take its branch centre back to zero while a copied key/record or receiving cell is retained. The receiving systems carry the old correlations. Future use proceeds from this full state and its conditional law; it is not assigned an independent fresh initial rank merely because a local packet now looks ready. The finite measurement theorem below uses a finite stock of fresh pointers; reset is included as a real operation and as a return test.
5.3 Feedback from a literal spatial record
An internal key-controlled source gate is an exact coherent operation, but it follows a finite position display only up to the display's error. Literal position feedback also belongs to (3). Let be smooth, , equal to zero for and one for , with . Let be a bounded Hermitian source generator and compare
The second gives the intended branch gate. Define
Duhamel, evaluated on the exactly stationary ideal packet, gives
This bound is uniform in an inaccessible reference. The physical position contact has reciprocal backaction; it is not claimed to leave the actual pointer fixed. The derivative and crossing estimate in Section 7 supplies a history bound as well. Thus literal spatial feedback, rather than an idealized outside observer, has a complete implementation.
Here is a multiplication operator on the wave, not a coefficient obtained by inserting the actual into an externally controlled Hamiltonian.
6 Protected coherent transport in the same inventory
Actual archive storage and protection of unknown logical amplitudes are different tasks. The monograph's bounded internal gap construction can be implemented here without a stochastic interface. To display its nonempty domain, encode two qubits into four by
Let , , and , with identities on the retained internal nuisance systems and inaccessible reference understood. Set
The penalty satisfies and . Assume the bounded self-adjoint operators are stationary on the protected exposure, with , , and
The 's act on retained finite internal nuisance systems. During the protected exposure, the spatial holding Hamiltonian is a commuting spectator; it is factored out. We do not assert a bounded-norm theorem for arbitrary unbounded coordinate couplings. One-site Paulis anticommute with a stabilizer, so . All encoding and decoding gates are finite internal unitaries.
For ,
The same bound holds with every inaccessible reference and retained internal nuisance system included.
Decompose the complete internal bank as and define its compressed blocks
where and act on their respective subspaces and . Then
The stated bounds imply
Thus the norm-convergent integral
satisfies and . Indeed the integrand has norm at most ; differentiating it and integrating its vanishing boundary term gives the identity. Here has inverse-energy units; it is not physical time. The skew-adjoint block operator
Put . Differentiation and integration yield
These conjugations are unitary, so
Two changes of frame and Duhamel in physical time therefore give
On , the last unperturbed propagator agrees with . The trivial norm bound two completes (27). Tensoring an identity preserves each operator norm, so the same estimate retains the inaccessible reference and nuisance bank.
□This is the monograph's coherent protection estimate, with its assumptions preserved; Hamiltonian error suppression has independent primary precedent [10]. Its role here is compatibility with actual material writes and records, not selection of a noise generator.
7 An autonomous massive controller, including archive-history error
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 (24), 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 (28).
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 a Gaussian with mean , 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 (4) on the full wave.
The initial wave is , including all prepared apparatus and retained resources. Let be its exact evolution under (29). Compare it to
The free clock has mean and width
The comparator includes the clock; it is not a reduced apparatus state.
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 (29),
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 (31); 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: (33) 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 (22) supplies the required pointwise zero, including during noncommuting continuation on the other factors. The transported reset (24) also preserves that current. Finite clock tails therefore produce a quantified finite-horizon historical error, rather than being incorrectly declared harmless from endpoint equivariance.
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 . 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.
8 Complete instruments, references and finite histories
Let be a finite family on the unknown input satisfying . The map
is an isometry because it preserves inner products. Extend an orthonormal basis of its range to a full basis to obtain a finite unitary. A finite Hermitian logarithm supplies a bounded pulse. Alternatively the explicit resource rotations above give a fixed nontrivial family directly. The gate compiler in Section 7 implements these gates while retaining all spatial storage. This argument concerns preparation-independent linear finite instruments; it does not admit arbitrary nonlinear ray maps.
8.1 The exact finite pointer output and a strong comparator
For one stage the physical isometry has form
(or its finite multicoordinate version). Let be the disjoint physical readout regions and
The cut packets define a comparison isometry with ideal disjoint records on the same retained space. They are not claimed to be physical Gaussian preparations. If a smooth comparison packet is wanted, smooth the cut in an arbitrarily narrow boundary strip and add its norm error.
If , then
The same bound holds after tensoring any reference; it bounds the trace distance between the full pure outputs and hence the half-diamond distance of the resulting physical output channels. Any subsequent common coherent return acting on all retained factors preserves the full-state bound.
The packet squared difference is . Orthogonality of the retained key gives
For normalized vectors their pure-state trace distance is no greater than their norm difference. The proof is unchanged with an identity on . Unitary invariance and channel contractivity prove the last claims. No continuity assertion for raw guidance paths is being used.
□For a source-only reduced instrument, tracing pointer and key would give weights and daughter mixtures. Our comparison instead retains , pointer packets, resources and . The classical label channel is a representation of final physical regions: for a final wave , its unnormalized output is , optionally with a classical index. It is not a law that the global wave is physically projected at that time. When previously separated waves are to be recombined, use their complete coherent vector, not a dephased classical record representation.
8.2 Noncommuting continuation without a fresh probability postulate
After a first projective write , a stored key and a copy, let be a source unitary and a noncommuting second projector family. With a fresh second pointer, the ideal complete vector is
with further coherent indices included if resource vectors are not single basis states. They are never discarded merely because the display says null. For exact key-controlled gates, the actual finite displayed probabilities are
where and similarly for . Since the first actual pointer is held, this is also the law of its earlier declaration and the later declaration. Its classical history error from the ideal finite instrument is at most . For literal position feedback add (26) and keep its separate immutable archive. Conditional normalization costs the ordinary probability denominator; it is not an unqualified exact branch rule.
Fix a finite programme of the stated resource gates, massive writes, copies, retained resets, bounded protected internal exposures, and coherent or smooth spatial feedback. Let its horizon be and let at most physical record registers be declared. Supply the complete equilibrium initial law and the finite ready stock. Then:
The autonomous model (29) has a conservative complete actual path law given by (7), including its clock and all returning systems.
For worst Gaussian classification tails , total full-wave protection/gate error , and the clock error , its complete final retained-state error against the ideal disjoint-record instrument on the same retained output space—including the clock, keys, resource products, reset receivers and reference—is at most
(40)The convention is trace distance for the complete retained quantum output (or half-diamond distance for its linear output channel), together with probabilities of physical records. It is not TV distance on the ontic pair : different exact global waves need not be close in that much stronger sense.
During specified holds, let be the sum of the surface budgets (35). If a declared working register is copied and then intentionally reset, also include a transfer budget : sum the pair-classification errors and the complete endpoint comparison error at each such copy cut. The law of actual historical declarations and their retained final displays differs from the ideal record law by at most
(41)For registers declared directly in their permanent archive and never transferred, . In the exact driven key-preserving library, and the sharper purely classical classification bound is when every displayed occurrence is included and no other perturbation is present.
For every fixed finite ideal programme and tolerance , finite pointer separations, protection gaps where used, feedback profiles and clock resources can be chosen so that these displayed bounds are below . The exact physical theory remains (3)–(5); only finite resources are adjusted.
Conservative existence was established for the complete smooth domain in Lemma 2.4. Every stage is a finite unitary in that domain. Multiply the stages retaining every old key and resource, including reset receivers. First compare perturbed gates to the nominal driven key-controlled programme, using Proposition 6.1 and feedback Duhamel on the nominal stage inputs. In particular, each protection-stage comparison is evaluated on its encoded ideal prefix in the promised subspace ; earlier leakage is carried by the common actual suffix, not assumed absent. Each suffix is a common unitary, so prefix discrepancies are preserved; the estimates are uniform over the unknown input and with the specified prepared material bank. Add the clock's full retained-wave error.
At the final comparison cut, the nominal wave is an orthogonal history-key expansion with real Gaussian factors for each retained display and the complete source/resource coefficients. These displays include all replacement archive receivers; an intentionally reset original pointer is a ready factor, not a carrier of its former record. Truncate these display packets into their assigned cells only at this cut. On a branch, the norm-squared mass removed from its product of packets is at most . Orthogonality of the retained history keys then gives a full vector error at most by the proof of Lemma 8.1. This yields a disjoint-record comparator with precisely the ideal history coefficients, on the same full retained space. Pure-state trace distance and position readout contractivity prove (40). Cut packets are not propagated as if they were stationary oscillator ground states; the support truncation is a final comparison construction only. Subsequent common coherent returns preserve its full-state error but need not preserve its initial record separation.
For history, couple a path's earlier declared labels to its actual final archived labels on the same probability space. A held label can change only by a specified surface crossing. A transfer to a fresh copy can additionally mismatch at the copy cut: its joint endpoint probability is bounded by in the nominal wave, plus the complete comparison error at that cut. Stop protecting the old register when its deliberate reset begins, and protect the receiving archive from then on. Theorem 7.3 and a union bound therefore give mismatch probability at most . Comparing final records to the ideal law costs . This proves (41) without a path-TV inference from wave closeness.
For feasibility first choose pointer separations to make Gaussian tails small. Any literal feedback derivative residual can simultaneously be made small by the Gaussian-tail estimate after Theorem 7.3, with a separate archive if used. Choose bounded internal protection gaps large enough for the finite sum of (27); no unbounded nuisance operators have been included. The finite apparatus inventory is then fixed. Its constants are finite. Increase and choose so both clock-wave and archive-history bounds become arbitrarily small. All choices are finite at positive . The limits are taken in this order, not uniformly over an unbounded growing graph or an infinite observation horizon.
□Conditioning and returning branches.
Let be laws on the same retained output or declared-history space, with . For a common event , write and . If both and , Lemma A.1 gives conditional classical error at most ; the sufficient condition guarantees . The same lemma gives the quantum normalization bound for positive unnormalized outputs on the same retained space, again requiring both traces to be positive. A zero-probability event has no normalized conditional branch, and capping an error estimate at one does not create that branch. Arbitrarily rare branches have no uniform guarantee.
Equation (38) and its general resource version, rather than a single sampled daughter, specify a complete return experiment. The reference is never accessed; all source maps tensor . A common subsequent unitary acts on the complete retained state, including every returning controller and receiver. It preserves the full-state error but need not preserve record separation or historical readability after an intentional echo. Those claims retain the separate holding and transfer hypotheses of Theorem 8.2.
Preparation information is retained.
In the autonomous theory the clock's actual position is part of the initial configuration. Exposing it, or any other microscopic coordinate, changes the conditioning in (7). A physically acquired coordinate record must be an extra material coupling and retain its receiver. A factorized ready packet at a fixed time does not prove independence conditional on every hypothetical unrecorded previous passage time. The theorem uses complete initial equilibrium and a finite independent stock; it does not invoke the monograph's conditional nodal extraction as a nonexistent global preparation theorem.
9 A complete finite example and reproducible calculations
Use as projectors and set
The receptor weights are exactly
Take one unknown source with an inaccessible two-dimensional reference:
The reduced source coherence is . Neither independent copies nor reference control are used.
9.1 Null followed by an incompatible measurement
The ideal orthogonal-record null map is , with trace ; its retained coherent null is the vector (19). A later probe in this ideal comparator gives
To verify, write and apply (20) term by term, or expand (19) and trace only the named factor. The trace of the displayed matrix is ; its normalized reference state is the matrix with entries divided by . For the unnormalized reference state is
Their sum is , an explicit reference consistency check. A frozen original input would instead give ; a fully -dephased daughter would give . Both fail this finite experiment.
9.2 Captured copy, reset, spatial feedback and a second record
Copy the captured label, retain its spatial archive, reset by (24), keeping , and use
Apply an write to a fresh pointer. The ideal branch coefficients, with all resource factors attached, are
Their probabilities are
| Retained first record | Second | Second |
|---|---|---|
They sum to capture probability . Reference daughters are and , respectively. Literal spatial feedback uses the smooth contact, with , and the bound (26). The copied archive remains held while the working pointer can recoil. Thus the exact table is the ideal target with explicit finite classifier, feedback and clock errors, not an assertion that finite Gaussian records are orthogonal.
9.3 A complete reversal remains a different experiment
In the driven bank, if every response, source gate, copy and spatial write is coherently undone with all receiving systems, that full bank wave returns to its input, up to a known common phase. Resetting only while a copy or survives does not achieve that return. A later incompatible probe distinguishes the two retained states. No global projection has been inserted at a declaration. In the finite autonomous realization the controller also remains in the complete state: its recoil and entanglement are bounded by the clock comparison, not claimed to be exactly undone by these apparatus inverse pulses.
An inverse need not negate a massive kinetic energy. For the piecewise constant half-period alternative to (9), a trap centred at sends a ground packet centred at zero to one centred at in time . Each conditional oscillator has common equally spaced spectrum, so evolution for is . Evolving for a complementary positive duration realizes the inverse, up to a common phase. Finite internal gate inverses reverse a bounded matrix term. Smooth forced displacements can likewise be undone on the specified coherent packets by a reversed centre trajectory and known phase correction. A claim of inversion on an arbitrary oscillator state would require its full propagator rather than this restricted packet identity.
9.4 Reproducible symbolic and numerical calculations
The accompanying reproducibility/integration_verification.py checks the full vector, resource unitarity, status weights, null reference matrices, feedback probabilities, complete SWAP export and the noncommuting transported-trap identity. Its exact symbolic checks support the displayed algebra. The writer calculations below can be reproduced with reproducibility/numerical_checks.py; execution instructions and result files are included with the source.
For the exact quintic writer with , , , , and , direct quadrature and inverse-CDF calculations give
| Quantity | Value |
|---|---|
| Initial right-tail atom | |
| Later threshold crossing | |
| Final no-crossing null | |
| Sum |
The symbolic Schrödinger residual is exactly zero. An independent finite-difference evaluation had relative residual below ; the quantile ODE residual was below and the first-passage quadrature discrepancy below . Figure 1 uses these parameters. No simulation evidence is used to assert a universal event-law selection.
10 Adversarial comparison and the fate of the three obligations
The strongest candidate must survive a rival that preserves more than endpoint Born weights. We give such a rival and state precisely what it defeats.
10.1 Same local net current, mutually singular paths
For a smooth positive density of the same complete wave, define an equivariant diffusion by
Its Brownian innovations are an explicit additional stochastic premise. The Fokker–Planck current is , so it matches even the local current, not just its divergence. We only assert its global existence where checked below; this is an equivariant diffusion rival, not a claim that every axiom of Nelson's stochastic mechanics has been derived.
For a stationary harmonic ground-state pointer centred at zero, the adopted theory has . The rival is the globally well-posed Ornstein–Uhlenbeck process
It has the identical invariant Gaussian density but moves at positive times. More strongly, on any its path law and the adopted guidance path law have TV distance one: Brownian diffusion paths have quadratic variation , whereas the absolutely continuous guidance paths have zero. These are disjoint measurable path events. The comparison does not require an experimentally admitted passive quadratic-variation meter.
Use the same semibounded Hamiltonian
and the equal superposition of its two spin-labelled ground packets. Its stationary density is
The adopted configuration is fixed. The diffusion (45) has smooth globally Lipschitz drift
and invariant law . For , the probability it changes the sign record during is no greater than
Set and . On , : the sign is that of , a concave function vanishing at zero and positive at for . Thus on both sides of the central interval. Stop at the first hit of zero. The Itô–Tanaka formula gives only nonpositive interior drift and a nonpositive local-time contribution at zero; its positive contributions are . Since and stationarity gives ,
Finally . Sign change requires a hit of zero, so the same bound applies. Existence and invariance follow directly from the displayed Lipschitz drift and the stationary Fokker–Planck equation.
□Thus arbitrarily reliable finite-horizon records can coexist with mutually singular microscopic paths. The velocity postulate selects the adopted law within the new theory; record success does not independently force that postulate. Deterministic divergence-free changes provide further rivals: in an isotropic real two-dimensional Gaussian, preserves the same density while changing a sign record with probability for . This particular rotor is a counterexample to inference from continuity, not a proposed fully symmetry-constrained replacement. More general quantum-equivalent deterministic alternatives are established in primary work [8].
10.2 A finite discrete rival with a sharp complete-path discriminator
On the monograph's finite graph, let
It preserves individual net currents, support and equilibrium and remains Markov. On a binary monotone write with , the rates per are forward and backward. The wave weights are , its final state is 1, and expected total jump count is ; integrability of this count and vanishing nodal holding survival give a nonexplosive path law.
A path with exactly one jump at has density
The Bell law has exactly one jump, uniform in . Since , the common mass of the two path measures is precisely the integral of this rival one-jump density. Therefore
This is a concrete surviving balanced-traffic countermodel with exact Born endpoints. It is not an independently selected new event mechanism. It confirms why endpoint agreement, even with correct individual net currents, would be insufficient to claim Bell closure.
10.3 The three selection obligations in the adopted continuum
Individual current realization. The kinetic-momentum postulate specifies the pointwise material current . Equivariance and the flow derive expected net flux through each physical interface. There is no freely reassigned cycle current within that postulate. This does not identify those interfaces with arbitrary finite internal Hamiltonian matrix edges in (1).
Surplus traffic. At a regular point of an interface the velocity has one sign and actual crossings realize its local direction. If an entire interface is integrated or microscopic coordinates are omitted, opposite directions on different patches give
In general . Coarse countertraffic and recrossing can survive. Neither their absence nor graph Bell minimality is falsely claimed. No extra Brownian traffic is allowed by the stated mechanical law.
Conditional timing. Equations (4) and (7) give the whole path and every conditional history, including current reversals and nulls. The explicit physical-time first-passage example has a derived nonexponential law. Other waiting laws are different constitutions, not unresolved free choices inside this one. Coarse histories generally fail Markov closure and are not assigned Bell rates by projection.
The alternative therefore closes the operational programme with a selected physical motion law and its material contacts. It gives up the original finite-sector microscopic claim rather than pretending to derive it.
11 Integration with the monograph and scope of the completion
| Dependency | Status in this completion |
|---|---|
| Source/readout descent and predictive representations | Retained as mathematical statements about declared maps and controls; they do not generate probability. |
| Hamiltonian current identities | Retained for whatever finite internal decomposition is mathematically specified. They are not automatically actual spin-jump currents. |
| Canonical packets, kinetic chemistry, entropy selection, MPBT and stirred chambers | Their conditional results stay intact. They are not premises of this alternative source constitution. The separate pilot completion supplies its own controlled Bell-path limit under its stated premises. |
| Actual finite-sector and Bell generator | Replaced by complete massive positions and the kinetic-momentum flow. No microscopic Bell-path equivalence is asserted. |
| Continuous configuration records | The existing guidance/record logic is retained. The material realization is strengthened to positive kinetic energy, confining traps, finite resource gates and a retained autonomous controller. |
| Finite receptors, loss and pending excitation | Implemented as full coherent resource vectors and subsequent spatial recording. Intrinsic absorbing jumps and frozen-null rules from other constitutions are not imported. |
| Archive truth | Proved by pointwise stationary storage and, for the finite autonomous controller, a derivative-controlled absolute-flux bound. Endpoint equivariance alone is not used as history truth. |
| Protection | The bounded complete-internal-bank gap theorem is retained on its commuting spatial-spectator domain. Arbitrary unbounded material disturbances are outside it. |
| Preparation | Complete initial equilibrium and a finite independent ready stock are physical assumptions. Conditional subsystem preparation does not become universal equilibrium. |
| Reset and returning keys | The receiver, spent products, copied records and transported trap control are kept explicitly, including in the clock comparison. |
| Continuation and reference | Full coherent vectors and common unitary return bounds retain . Effective daughter instruments have only their declared separated-record domain. |
Provenance and physical assumptions.
Bohmian motion, equilibrium-conditioned measurement analysis, and the general existence mechanism have established provenance. The present paper does not claim historical priority for those ingredients. Its directly proved contribution is their explicit use in a single finite semibounded resource model, the transported-trap reset, smooth massive writer and full null example, and the controller graph-norm-to-archive-history estimate needed to make autonomous integration defensible. The numerical work checks explicit formulas. Universal material admission, kinetic-momentum motion, and the complete initial equilibrium law are proposed constitutive premises relative to the earlier source/readout programme.
Constitutive and effective conclusions.
The result is an internal completion of the stated finite nonrelativistic measurement constitution, with controlled autonomous retained-output and historical-faithfulness estimates. Guidance and complete initial equilibrium remain postulates. The discrete Bell process in (1) belongs to a separate ontology; the pilot paper [2] establishes its controlled effective realization under different premises. Neither completion supplies an unstated premise of the other.
Limits that remain real.
We have not proved universal physical necessity of guidance, derived equilibrium from arbitrary initial data, built a relativistic theory or an unlimited autonomous memory, or established TV continuity of unrecorded trajectories under small Hamiltonian perturbations. The finite material inventory and its ideal engineered interactions are a theoretical realization, not a claim of laboratory fabrication. The autonomous clock, memory separations and protection gaps have stated resource costs. The surviving rival diffusion refutes uniqueness from operational record success; it does not leave a stochastic rule unspecified inside the adopted constitution. This paper establishes the massive alternative and its declared measurement-chain estimates; its continuous paths do not constitute a derivation of discrete Bell jumps.
A A compact proof of complete output and conditioning bounds
For normalized , the pure-state trace distance satisfies
Any common quantum channel, including a final position classification and an identity on a retained reference, contracts trace distance. These comparisons use the same complete retained output space. Restricting to a common event gives positive unnormalized outputs; normalization requires that the event have positive probability in both compared models.
Let be two probability laws on the same retained output or history space, with . For a common event , put and . If both and , then
The sufficient condition ensures . For positive unnormalized quantum outputs on the same retained space, if , and , then
Here is sufficient for positivity of the second trace.
For a measurable set , add and subtract . The first difference is at most , and the second is at most , since . Taking the supremum proves the classical estimate. For the quantum estimate add and subtract , use positivity to obtain , and use :
The upper bounds one and two are the maximal respective distances. Finally or proves the positivity claims.
□The lemma applies to complete path laws only when a joint path-law bound on that common space has actually been established. In Theorem 8.2, controls complete retained quantum outputs and their physical readout probabilities, while controls the stated classical declaration-and-display histories. Neither bound asserts closeness of raw guidance trajectories or TV closeness of the ontic pair . A discarded reservoir, a missing key, or an abstract sampled path cannot be identified with an existing physical record by conditioning. A zero-probability event has no normalized conditional branch, and arbitrarily rare events have no uniform conditional guarantee.
B Reproducibility and interpretation of the checks
The source package includes the figure asset, exact symbolic checks and deterministic numerical evaluations with execution instructions. The symbolic checks evaluate the finite resource and continuation algebra. The numerical checks evaluate the exact writer, quantile trajectories, threshold law and displayed error diagnostics at the stated parameters. They support these explicit examples; the complete construction and its hypotheses are established by the proofs in the paper.
The source also retains the distinction between a mathematical path law and a physical record. Historical faithfulness uses stationary holding, copy-cut transfer and absolute archive flux. Small retained-wave error is not promoted to total-variation closeness of arbitrary unrecorded microscopic trajectories. Likewise, output agreement does not establish universal physical necessity of the chosen guidance and preparation postulates.
Bibliography
- [1]
Jeremy Rodgers, Shadow Theory and Quantum Measurement: Source Dynamics, Event Laws, and Physical Records — Two Constitutive Completions, integrated monograph, version 2, 15 September 2026. Zenodo preprint. doi:10.5281/zenodo.22774584. Chapters 28–31 contain the massive construction, corrected conditioning lemma and retained-output/history scope; Chapter 35 consolidates its relation to the separate pilot completion. The arguments needed here are included in the present paper.
- [2]
Jeremy Rodgers, A Deterministic Pilot Medium: Bell Path Selection and Autonomous Material Records, version 2, 15 September 2026. Zenodo preprint. doi:10.5281/zenodo.22774634. A separate constitutive completion with a controlled physical-time Bell-path limit, cited for comparison.
- [3]
D. Bohm, A suggested interpretation of the quantum theory in terms of “hidden” variables. I, Physical Review 85, 166–179 (1952). doi:10.1103/PhysRev.85.166.
- [4]
D. Bohm, A suggested interpretation of the quantum theory in terms of “hidden” variables. II, Physical Review 85, 180–193 (1952). doi:10.1103/PhysRev.85.180.
- [5]
D. Dürr, S. Goldstein and N. Zanghì, Quantum equilibrium and the origin of absolute uncertainty, Journal of Statistical Physics 67, 843–907 (1992). arXiv:quant-ph/0308039. In particular, the complete initial equilibrium measure and conditional-probability analysis; no claim of global relaxation is imported.
- [6]
D. Dürr, S. Goldstein and N. Zanghì, Quantum equilibrium and the role of operators as observables in quantum theory, Journal of Statistical Physics 116, 959–1055 (2004). doi:10.1023/B:JOSS.0000037234.80916.d0; arXiv:quant-ph/0308038.
- [7]
S. Teufel and R. Tumulka, Simple proof for global existence of Bohmian trajectories, Communications in Mathematical Physics 258, 349–365 (2005). doi:10.1007/s00220-005-1302-0; arXiv:math-ph/0406030. The current-integrability assumptions and the spinor theorem are checked in Section 2.
- [8]
E. Deotto and G. C. Ghirardi, Bohmian mechanics revisited, Foundations of Physics 28, 1–30 (1998). doi:10.1023/A:1018752202576; arXiv:quant-ph/9704021.
- [9]
S. Goldstein, R. Tumulka and N. Zanghì, Arrival times versus detection times, Foundations of Physics 54, 63 (2024). doi:10.1007/s10701-024-00798-y; arXiv:2405.04607.
- [10]
M. Marvian and D. A. Lidar, Error suppression for Hamiltonian-based quantum computation using subsystem codes, Physical Review Letters 118, 030504 (2017). doi:10.1103/PhysRevLett.118.030504; arXiv:1606.03795.