Motivated by Complementarity-First's distinction between a relational operation and its physical implementation, we study one-use source refresh in a supplied autonomous classical Hamiltonian model. A moving courier must reach a stationary source, exchange arbitrary internal contents with it, and expose the fresh input and retained old output at one fixed readout time. A positive completed-square kinetic coupling makes the completed exchange depend on spatial area rather than entering speed. A separate position-dependent recovery interaction transfers energy from a main mechanical carrier to a courier that may be nearly stopped. For four real four-coordinate internal registers and two mechanical pairs, the combined construction admits the fixed product domain ||(x,y,b,c)|| ≤ 1, 18.6193 ≤ α ≤ 18.6248, with mechanical preparation independent of the unknown internal data. Exact-rational certificates for a reduced three-coordinate release law, together with recovery estimates, give source completion before time 47 and an interaction-free readout at 33π/2. Certification here concerns reduced-system arithmetic, not a formal-kernel proof or validated integration of all twenty coordinates. Fresh loading is exact; the source/old-output pair has error at most ε_pre ||(x,y,b)||, with ε_pre < 0.007338, against its declared ideal comparison. This is not a whole-processor accuracy bound. The full endpoint retains two additional main-port passages, the remaining internal registers, and both mechanical records. Its mechanical energy allocation excludes immediate reapplication of the same ready-state contract, while a source-only witness excludes an exact payload-only linear reduction. The result supplies a bounded one-use implementation conditional on the stated architecture. Physical rearming, all-input/all-word linear control, and primitive selection of the carrier and interactions remain outside the theorem.
Motivated by Complementarity-First's distinction between a relational operation and its physical implementation, we study one-use source refresh in a supplied autonomous classical Hamiltonian model. A moving courier must reach a stationary source, exchange arbitrary internal contents with it, and expose the fresh input and retained old output at one fixed readout time. A positive completed-square kinetic coupling makes the completed exchange depend on spatial area rather than entering speed. A separate position-dependent recovery interaction transfers energy from a main mechanical carrier to a courier that may be nearly stopped. For four real four-coordinate internal registers and two mechanical pairs, the combined construction admits the fixed product domain ||(x,y,b,c)|| ≤ 1, 18.6193 ≤ α ≤ 18.6248, with mechanical preparation independent of the unknown internal data. Exact-rational certificates for a reduced three-coordinate release law, together with recovery estimates, give source completion before time 47 and an interaction-free readout at 33π/2. Certification here concerns reduced-system arithmetic, not a formal-kernel proof or validated integration of all twenty coordinates. Fresh loading is exact; the source/old-output pair has error at most ε_pre ||(x,y,b)||, with ε_pre < 0.007338, against its declared ideal comparison. This is not a whole-processor accuracy bound. The full endpoint retains two additional main-port passages, the remaining internal registers, and both mechanical records. Its mechanical energy allocation excludes immediate reapplication of the same ready-state contract, while a source-only witness excludes an exact payload-only linear reduction. The result supplies a bounded one-use implementation conditional on the stated architecture. Physical rearming, all-input/all-word linear control, and primitive selection of the carrier and interactions remain outside the theorem.
An autonomous refresh mechanism is not completed by specifying a local exchange map:the same apparatus must reach the exchange, leave it, finish its remaining motion, and deliver itsstate at the prescribed readout time. We construct this connected late route for one specifiedpreparation in the exact-real interpretation of a frozen classical numerical source. The input isa previously certified twenty-coordinate state after entry into coupled occupancy; its validity andretained preparation history are explicit premises. Source-valid continuation establishes occupancyclearing, physical recovery and courier reversal, complete courier passage, a smooth main-wallexcursion, and the remaining main processing. The resulting full state is enclosed at the originalexact dyadic readout time, without an independently chosen switch, momentum reset, or deletion ofinternal phase history. The courier’s completed-square coupling distinguishes canonical momentumfrom physical velocity. At its frozen right cutoff, canonical momentum is continuous while velocityand the assigned source value have different one-sided traces. The completed spatial exchangediffers strictly from the ideal exact-period swap; its small algebraic port residual is distinct fromthe much wider full-state enclosure. Event-dependent times are composed into a common final clockby retaining the actual remaining duration. The result is a conditional fixed-time completion for thesupplied source and preparation, not a time-zero reconstruction, an all-input ideal-model theorem,physical auxiliary attachment, or a second service. Returned local Lean evidence supports selectedcomposition, branch-map, accounting and conditional endpoint results; the cumulative trajectorytheorem is not fully formalized.
A local numerical reference is useful only when a justified flow image enters its domain.In autonomous source refresh, that obligation involves the state of the apparatus, not merely itsselected output registers. We study a supplied 44-coordinate source model and give a conditionalcomposition theorem that retains the original state and time, the interaction contrast, accumulatedpulse area, mechanical histories, and passive transport records. Exact normal-mode reconstructiondistinguishes interval wrapping from physical uncertainty. For an inactive router with positivemomentum, we derive the attained position extrema and a restricted forward marginal-hull equal-ity: retaining correlations does not remove the genuine spread of this particular projection. Aseparate guarded receiving domain admits the wider router record while preserving the originaltime and other 43 coordinate requirements. Source-local factorization then transfers the referenceobservables without deleting a physical coordinate or replacing an evolved state by a stored cen-ter. Smooth continuation, exact negative free transport, and a source-matched integral left-entrylayer are composed under prospective whole-path guards. A positive moment expansion suppliesdirected bounds for the isolated reference, with its interior momentum trace distinguished from thearchived cutoff convention. Fresh bounded calculations reproduce 18 accepted and three rejectedcandidate comparisons at each of two scale labels under their separately declared input hypotheses;these are not service probabilities. The result closes a local conditional implication, not physicalinitialization, complete two-use validation, global floating-program accuracy, or a common-originderivation.
This preprint studies a cycle-reflection operation on a supplied six-qubit realization of paired trigram configurations. A four-matched-pulse identity and a minimum within its stated serial grammar are separated from an ordinary-exchange endpoint construction. The raw full-source reflection and its full domain-safe alternative are different tasks: the latter is excluded by a collective-symmetry obstruction in the admitted source-only exchange model. Strict preservation of the addressable sector throughout the path is also excluded for the full task, while finite-action lower bounds quantify peak no-address population and time-integrated exposure. The paper presents an explicit low-excursion balanced word and a conditional joint clock–amplitude error certificate. Root settings and trajectory inputs remain tied to their supplied computer-assisted certificates. The second internal review reproduced all ten advertised numerical routes and twenty-four outputs using the original programs; this is same-program reproducibility, not independent implementation or external peer review. A separate Lean supplement covers the finite raw/safe operator algebra and the obstruction for arbitrary finite words of the declared algebraic factors. It does not formalize the numerical roots, matrix exponentials, continuous-time dynamics or resource theorems. No global pulse optimum, measured hardware feasibility, general noise tolerance, or automatic connection to the companion recovery code is claimed.
A detector records an event through a succession of physical changes, from its initial response to the recovery of its working state. We construct a complete finite cycle on the local physical--observation phase space of PODA. An incoming carrier traverses fixed interaction regions, with its arrival, speed, and energy transfer governed by an autonomous Hamiltonian bounded below. Six canonical gates write a smooth event profile, amplify the pointer separation, export the record, reverse the working displacement, and exchange the remaining pointer state with a prepared blank. Their exact reference map identifies the selector and mechanical recoil left by record export. The retained core returns on the event-cell plateaus; narrow transition strips contribute a bounded probability of failure and a recoil that depends on the resolution. With a positive free Hamiltonian present throughout the passage, energy conservation and a finite-time perturbation estimate establish faithful writing, finite retention, and return within prescribed tolerances. An explicit binary realization admits nonzero preparation errors, and independent trajectory integrations check the equations and the endpoint map. These results complete the single cycle for the specified local model and incoming family. The calculation follows the archive, carrier, and waste through the output section, making explicit the resources consumed by reset. Preparation of fresh blanks, replenishment of those resources, and storage beyond the proven holding interval remain physical requirements of continued operation.
The papers released after Complementarity-First Foundational Release III developexplicit constructions in which a retained record, a comparison frame, an analytic domain, or apreparation map determines what can be composed and inferred. This review synthesizes fourteenresearch papers in five branches: autonomous source refresh; structured magnetic-core completionand local monopole dynamics; orientation-twisted composition and reciprocal quantum cells; non-linear superconducting response; and Feynman composition, configuration histories, and low-energyinterfaces. The source-refresh studies distinguish an exact spatial exchange from a reusable appara-tus, and an intended smooth model from its exact piecewise numerical source. The magnetic trilogyseparates extension of a structured bundle, observable-specific exterior recovery, energy coercivity,kinetic threshold behavior, and regular local evolution. The quantum-cell papers distinguish coher-ent changes of presentation from physically admitted processes, geometric cells from quantum statespaces, and boundary-word identities from unrestricted refinement invariance. The superconduct-ing comparison separates restricted density equivalence, a specified nonlinear field contrast, andexperimental identification. The four composition papers connect conditional amplitude rules tocontrolled one-dimensional histories, coherent coarse memory, induced metrics, common-windowpreparation, and explicit spectral-selection costs. Cross-branch comparisons identify genuine im-ports without assigning a common physical carrier to mathematically different models. Analyticarguments, finite certificates, historical replays, and partial formalization retain separate eviden-tiary roles. The contribution is a source-attributed release map and a synthesis of compositionand inference boundaries, not a new primitive derivation of quantum theory, matter, or gravity.Publication confirmation, access to the consulted edition, and deposited-file identity are recordedseparately.
A quantum record can have locally accessible populations while its distinguishing phase remains correlated with a distant source. We study this access boundary in a specified finite recording apparatus with a returning, vacuum/one-excitation source. Source-position weights give finite-time cutoff bounds without removing any physical hopping or return coupling. For an initially far-tagged record and its incoherent mixture, every reader in a declared position-preserving local-control class obeys a phase-visibility envelope and a necessary access-time inequality. A separate finite local probe shows why that state-discrimination limit is not an unrestricted limit on distinguishing two dynamical laws: fresh local coherence can reveal a stipulated added dephaser without recovering the old record phase. We construct a bounded, degree-three reader accessing only source positions 1–32. With the initial tag fixed at position 65, exact finite-source arrival certificates and an analytical tail comparison yield recovery uniformly over every finite total source length at least 65. Accessible control faults are charged against the arrived signed-phase norm, while source-moving drift is charged against the full norm. At the fixed deadline 25.02/J, the matched phase-dependent difference between coherent and archive-gated dynamics exceeds 0.005, including the stated simultaneous control faults and four additional absolute response allowances of 0.008 each. Complementary results cover a vacuum-ready source and a stronger endpoint-prepared finite example. The conclusions are conditional on the supplied model, preparations, common realized controls and calibration bounds. They are not a switchable-fundamental-law experiment, a nuisance-independent classifier, an optimal-speed theorem or an end-to-end formal verification. The supporting Lean companion contains 59 declarations in eight modules with accepted returned Mac compilation, type and axiom evidence; physical analytical interfaces remain explicit hypotheses or outside that subset. The deposit files include the main manuscript, technical supplement and full research/reproduction package.