Version 3 (2026-08). One correction, chair-directed after an independent text-only rebuild: the setting's conventions dictionary is regenerated from the code of record. The pointer packet is an ENERGY-basis Gaussian launched at tick zero (v1/v2 described it as a tick-space packet of tick-width sigma_n; the temporal width is in fact the inverse, NC/(4 pi sigma_n) ticks); the tick-state sign convention, the second geometry's sigma_n = 3, the twin/control definitions, and the post-selection probabilities are now printed; a standing text-only rebuild gate (fresh implementation from the setting paragraph alone, matching the exact conditioned state at 3.5e-14) guards the dictionary. Every published number stands (the independent rebuild reproduced the NC = 24 physics cold, the lane's first exterior verification, recorded in the data-and-code paragraph); the dictionary was broken. The methods law is minted program-wide: a geometry prints its dictionary, generated from the code, never transcribed. Version 2 (2026-08). Changes from v1: the clock-width profile is completed end to end: v1's spike-plus-plateau is the interior of a measured disturbance VALLEY with an optimal clock width (minimum at sigma_n* = 2.5; the broad side rises 93x by sigma_n = 24, tracked by the value law against exact evolution at ratios 0.985 and 0.995), so the least-disturbing clock is neither time-sharp nor energy-sharp; a pre-registered identification of the plateau with the sharp-clock limit was killed by a factor of 160 and is ledgered; the open problems are re-posed at the valley's optimum. When a finite quantum clock gates a register's interactions and the run is conditioned on the clock's final reading, the register's conditioned dynamics is derived at two orders and machine-verified against exact evolution. First order: the drive is the complex Aharonov-Albert-Vaidman weak value of the gating window projector (real part = Hermitian envelope, imaginary part = post-selection reweighting); a twin evolved under this envelope removes the entire first-order mismatch a mean-envelope control retains (state-metric deficits g^1.1 vs g^2.1, factor 56 at g = 0.1). Second order: the deficit is governed by the connected two-time window correlator under post-selection, resolved along the interaction picture; the resulting parameter-free value law matches measured deficits at ratios 0.92-1.05 across the clock-width grid and at a second geometry (1.03-1.07). The when/what trade-off of a participating clock is promoted from confounded excess to derived law: the disturbance is the connected fluctuation of the clock's timing answer, its clock-width profile is a predicted spike-plus-plateau (not a power law), and two earlier exponent claims are superseded with the reconciliation recorded. Two honest derivation failures (equal-time invisibility resurrected by the interaction picture; the kernel belonging inside the integral) are ledgered as the steps that located the law.
Version 3 (2026-08). One correction, chair-directed after an independent text-only rebuild: the setting's conventions dictionary is regenerated from the code of record. The pointer packet is an ENERGY-basis Gaussian launched at tick zero (v1/v2 described it as a tick-space packet of tick-width sigma_n; the temporal width is in fact the inverse, NC/(4 pi sigma_n) ticks); the tick-state sign convention, the second geometry's sigma_n = 3, the twin/control definitions, and the post-selection probabilities are now printed; a standing text-only rebuild gate (fresh implementation from the setting paragraph alone, matching the exact conditioned state at 3.5e-14) guards the dictionary. Every published number stands (the independent rebuild reproduced the NC = 24 physics cold, the lane's first exterior verification, recorded in the data-and-code paragraph); the dictionary was broken. The methods law is minted program-wide: a geometry prints its dictionary, generated from the code, never transcribed. Version 2 (2026-08). Changes from v1: the clock-width profile is completed end to end: v1's spike-plus-plateau is the interior of a measured disturbance VALLEY with an optimal clock width (minimum at sigma_n* = 2.5; the broad side rises 93x by sigma_n = 24, tracked by the value law against exact evolution at ratios 0.985 and 0.995), so the least-disturbing clock is neither time-sharp nor energy-sharp; a pre-registered identification of the plateau with the sharp-clock limit was killed by a factor of 160 and is ledgered; the open problems are re-posed at the valley's optimum. When a finite quantum clock gates a register's interactions and the run is conditioned on the clock's final reading, the register's conditioned dynamics is derived at two orders and machine-verified against exact evolution. First order: the drive is the complex Aharonov-Albert-Vaidman weak value of the gating window projector (real part = Hermitian envelope, imaginary part = post-selection reweighting); a twin evolved under this envelope removes the entire first-order mismatch a mean-envelope control retains (state-metric deficits g^1.1 vs g^2.1, factor 56 at g = 0.1). Second order: the deficit is governed by the connected two-time window correlator under post-selection, resolved along the interaction picture; the resulting parameter-free value law matches measured deficits at ratios 0.92-1.05 across the clock-width grid and at a second geometry (1.03-1.07). The when/what trade-off of a participating clock is promoted from confounded excess to derived law: the disturbance is the connected fluctuation of the clock's timing answer, its clock-width profile is a predicted spike-plus-plateau (not a power law), and two earlier exponent claims are superseded with the reconciliation recorded. Two honest derivation failures (equal-time invisibility resurrected by the interaction picture; the kernel belonging inside the integral) are ledgered as the steps that located the law.
Version 4 (2026-08-25). Two additions from the correction campaign, carried as dated in-body correction records. The (2,5) entry, printed as a prediction in v3, is now census-exact -- and it was the wall law's first divergence test. At the constructed maximal-wall stratum point the stiff transverse count is exactly 10, so alpha_stratum(2,5) = 5; a fresh 60k ensemble's calibrated read is consistent with 5, with alpha = 10 (the superseded single-wall count's prediction) excluded at p = 0.000 and demonstrated power ~ 1; and a stratum-conditional paired ladder tracks the exact rank-10 Hessian form to <= 0.002 while a rank-20 comparator separates by >= 2.7 on identical draws. The law m_C(2,d) = 2(d-1) is census-exact at d = 3, 4, 5, now including the first point where it diverges (by 2x) from the superseded count. The (3,4) entry, printed open in v3, is now a PAIR of statements, and neither alone is alpha(3,4). The posted product-wall counting landed census-exact (alpha_stratum(3,4) = 5, so the asymptotic exponent satisfies alpha(3,4) <= 5), while the accessible window at n = 3e4 is steeper (calibrated 90 percent set [5.4, 6.9], with the previously read 4.0-4.1 excluded at power ~ 1): the codim-10 stratum's prefactor has not engaged at reachable depth, and window and asymptote have visibly decoupled. This is the scope lesson of the (d >= 3) x (d' > d) regime -- census plus conditional ladder measure the law, global windows measure the pre-asymptotic shoulder -- and it retro-explains the earlier fresh-seed ladders' instability as shoulder reads. Version 3 (2026-08-20). One SUPERSESSION: the qutrit-qutrit exponent closes. Versions 1 and 2 left alpha(3,3) open, v1 by a small-sample fit reading 3.25 and v2 by the bracket [2.3, 3.0] read off a descending window ladder. Both readings were artifacts of the estimator problem for which the pair-type table was already corrected in v2. The descent is attenuation tracking sample count rather than tail depth: an ensemble drawn from an EXACT alpha = 3.0 law descends by 0.62 across the ladder against the real data's 0.34, so a descending ladder is evidence FOR a constant exponent, not against one. Replacing the window fit with a calibrated Monte-Carlo test and inverting it over candidate exponents gives alpha(3,3) = 3.0 at p = 0.517 with a 90 percent confidence set [2.75, 3.10]; v1's 3.25 is excluded at p = 0.017. Power against alternatives is 0.990 / 0.590 / 0.120 / 0.575 / 0.990 / 1.000 at true alpha = 2.50 / 2.75 / 3.00 / 3.25 / 3.50 / 4.00. An independent re-audit at n = 10^4 reads flat near three on two seeds. Disclosed defect, carried in the paper: the test's own calibration row missed at the low edge (rejection rate 0.207 at a nominal 0.10 when the truth is alpha = 2.50, 4.4 standard errors high), so the lower end of the confidence set is softer than printed. This ensemble separates 3.0 from 3.25 with about 58 percent power and has none to separate 3.0 from 2.95. The (3,3) CARRIER family remains unattributed: the exponent is settled, the stratum that carries the accessible tail there is not. Version 2 (2026-08). Changes from v1: the pair-type exponent table is corrected (v1's alpha(2,4) = 2.08 was a 50-sample order-statistics fluctuation, placed at the 0.15th percentile of its own estimator's sampling distribution; three independent codebases now agree on the wall law alpha(2,d) = d, census-exact at d = 3 and 4); the transverse constant 1/12 is derived in closed form (diagonal cost 1/6, halved by the congruent partner's equal-cost correction); the (2,3) tail's carrier stratum is fully attributed (an isotropic-intertwiner family sharing the exponent 3); the qutrit-qutrit exponent is honestly bracketed open at [2.3, 3.0]; and the dispersion rule (tail-exponent fits print bootstrap dispersion or do not print) is adopted. The v2 ledger appendix carries the correction anatomy. Why is the multipartite certification constant heavy-tailed, where does the tail live, and what kills it? Localization: the credential pencil is exactly block-diagonal over party-subset supports; the tail is the worst pair; geometry statistics reconstruct from pair statistics (14/14 factor-band comparisons). The law: a frame-congruence theorem: whenever the two parties' operation frames subtend equal Bloch angles, the rotation intertwining them is an exact common kernel direction; the zero set is codimension one at generic angles, transverse growth is universally quadratic (mu = (Delta theta)^2/12), and the qubit-pair tail exponent is exactly 1/2 (the previously measured 0.39 is the finite-window slope of this law). The dichotomy: pairs containing a d >= 3 party measure exponents 2.08 to 3.69 because higher-dimensional operation pairs carry many local invariants that must all match: freedom helps the certifier. Engineering: heterogeneous dimension profiles tame the tail; qubit-pair presence splits all measured geometries into two clean classes; screening is a five-minute two-party calculation. Pre-registered; two entry gates that caught wrong conventions and all deaths ledgered.
The slowly varying envelope (SVE) reduction of a gapped classical electromagnetic carrier predicts the single-particle Schrödinger equation as an exact identity plus a closed-form residual: the constrained vector MacCullagh carrier admits an exact per-branch balance whose retained part is the Schrödinger operator and whose sole marked approximation leaves a closed-form remainder, quadratic in the detuning. Under the single identification below, the carrier branch ℏω(k) is the relativistic energy function E(p) = m2 c4 + c2 p2 and the envelope generator ℏ[ω(k) − ωC ] is p its kinetic part E(p) − mc2 , recovered consistently in three cross-checking registers—the Foldy– Wouthuysen operator, the dispersion Taylor series, and direct numerics—with leading correction the fine-structure term −p4 /8m3 c2 . A parameter-free model reproduces the archived residual slopes to 10−4 , the fitted exponent converging to the predicted 2. One action-scale identification, ℏωC = mc2 , enters exactly once as an input; by Buckingham-π the reduction fixes the coefficient c2 /ωC = ω ′′ (0), matched to ℏ/m under the identification, and leaves one free scale, so ℏ is supplied, not derived. The result is a dynamical correspondence at the envelope stratum, not a derivation of quantum mechanics: |ψ|2 is normalized wave action, never a Born probability, and an explicit ledger fences what the correspondence forces, permits, and does not produce—the Born rule, state reduction, quantized charge, and entanglement—each with its standing theorem or structural fact. Companion no-go paper: "Constraining Classical Field Models of Self-Generated Particle Structure: Successive No-Go Theorems", DOI 10.5281/zenodo.21531712 (all versions). The two papers are co-posted and cross-cite by concept DOI. This record additionally carries the complete Track S/N/P code-and-data archive (envelope-code-v3.35.zip): symbolic-audit, numerical, and magnitude pipelines with their test suites (106, 20, and 13 tests), all figure-generating scripts, the campaign manifests (track_n_campaign_summary.json and companions), and dependency floors (code/requirements.txt). Version 2 (September 2026). Retitled ("a Gapped Electromagnetic Carrier") and substantially revised; 49 → 31 pages. Principal changes since v1: (i) the reduction theorem now carries explicit hypotheses — ψ₀ ∈ H^{s+4} via a bounded-multiplier argument, with a band-limit alternative and the H^s-weighted packet functional K_{4,s} (eighth-moment form) replacing the earlier spectral-scale shorthand; (ii) the residual analysis adds the finite-sweep bias law with a parameter-free model reproducing all archived window slopes to 1e-4, guarded by a committed test file; (iii) Sections V and VI are merged and the four scope tables consolidated into a single honesty-ledger table with explicit class codes; (iv) the Wolff placement is rebuilt as a three-horn trilemma mirroring the companion paper; (v) the conclusion is rewritten, situating the result against the independent kinematic (Zhang) and intrinsic-periodicity (Puddu) routes; (vi) the effective-medium reading of the gapped carrier is stated as a constant-coefficient effective field theory with no substrate assumed or determined; (vii) the carrier branch and the envelope generator are distinguished throughout, the companion dependence is stated results-based, and the long-time figure marks the Gaussian-packet breakdown estimate; (viii) all printed record DOIs now use the Zenodo concept (all-versions) DOIs. A complete change ledger (paper1_delta_v3.13_to_v3.35.pdf) accompany this version, together with the complete Track S/N/P code and data archive (envelope-code-v3.35.zip).
Quantum mechanics is taught from five postulates: a state is a vector in a complex space; left alone it turns by a unitary step that an energy operator generates; a measurement returns an outcome with a probability equal to a squared length; the state afterwards is the part that matches the outcome; and two systems together live in the product of their spaces. The textbook does not say where the five come from. We read each of them as a statement about one object, the recognition ledger, a record of events that is written in postings and never erased, and we say for each how much of it is then a theorem. The guiding sentence is short: histories that leave no record add, and what is on the record is counted. The record's clock makes a complex unit. The tick of the eight-position register has no complete set of real stationary states, and on the states that four ticks reverse, two ticks square to minus one. For a law on a finite-dimensional space whose factors all lie above zero, the unitary step is fixed up to its unit: a linear rule for the step that uses only the law between two records, keeps every length, regroups and is continuous is exp(−icH) with H = −log T, where T is the law itself. The square follows, for reads of a register's positions, from two principal properties and three mild ones: a read that weighs each position by its own value and adds over positions, is silent on an empty position and is never less for a larger value, and whose total is blind to a common turn of the register, is the sum of squares. For reads along other splittings of a space the square is a hypothesis. Two acts can be read together exactly when they commute, and reading one first moves the other's weights by an amount we give in closed form, never more than one half. Where a crossing takes held states off the held part, a contact divides a held state into a part left exactly as it was and a part with one crossing applied, with squared lengths cos²θ and sin²θ; where it keeps them held, the contact reads one sign of the register and nothing else. Two blocks of one cube compose by the product, their acts commute, and their correlations have three ceilings, 2, 2√2 and 4, for acts that only read, acts that write, and tables that merely do not signal; the cube reaches 2√2 exactly. Each theorem is proved on the page from premises we name, and we say postulate by postulate what that gives. The second follows from four statements about a linear step. The third follows for reads of positions, given that a read is taken position by position, which is owed. For the first, the clock makes a complex unit with no premise, the one such unit that is a whole number of ticks; that states are complex rests on a premise about the clock that is close to the conclusion, that a held register is among the states the unit acts on is a working statement, and from the second postulate on the spaces are taken complex, as in the textbook. Of the fourth the algebra is proved; the weights and the state afterwards are the textbook's, and that one outcome occurs is owed. The fifth is proved for two blocks of one cube and owed for two laboratories, where published network experiments exclude a real product whose sources share nothing. Several of the theorems are known results of the textbook's own mathematics, and the ledger enters through what their objects are identified with. What is owed is named in four statements, and we say how exact each is. The paper closes with twelve paradoxes of quantum mechanics, from the double slit to Wigner's friend, each in three lines: the puzzle, what the record says, and what is owed. Eleven of the twelve wait on the same owed statement, and every number they return is the textbook's own.