Deterministic Registration-Cycle Realization of Quadratic Projective Weights in Registration Theory: An Explicit Born-Form Existence Construction and the Remaining Linear-Coupling Problem
This timestamp records a bounded milestone in Registration Theory (Physical Foundations): an explicit deterministic preparation-measurement-reset model that reproduces the binary quadratic projective weight νP,I(Bi) = ||Pi v||² / ||v||² in a controlled tangent/refinement limit, while isolating the remaining unproved physical bridge.The construction combines an already-derived isotropic rank-three H4 relational sector, a finite fine-registration fiber, a deterministic cyclic successor that visits each fine state exactly once per period, and the existing retained-registration detector result that post-threshold outcome is fixed by the sign of the incoming imbalance and reset returns the detector to readiness. Uniform finite-cycle visitation gives an exact empirical measure on the fine fiber. In the directional refinement limit, full-rank lattice counting in the isotropic H4 tangent geometry gives uniform spherical area. With the explicit linear seed coupling δ = ε(λ̂·nI + mP,I), the detector basins become spherical caps with relative area (1 + m)/2, and the projective contrast identity m = ⟨v,(2Pi−I)v⟩/||v||² yields the quadratic projective weight.The paper does not claim that canonical ACRF-4 has derived the Born rule. The decisive linear particle-apparatus coupling is an additional model assumption, not a result already forced by ACRF-4 or by the detector sign-preservation theorem. A sensitivity theorem shows that replacing the linear offset m by a general function f(m) changes the limiting frequency law to (1 + f(m))/2 on the unsaturated interval. Thus deterministic cycling and isotropic geometry alone do not select the Born form.The contribution is therefore an explicit deterministic RT-compatible Born-form existence construction with a precise claim boundary. The named next proof obligation is H-B/U8: derive the linear tangent particle-apparatus coupling, including its relative coefficient, directly from canonical ACRF-4 dynamics rather than choosing it phenomenologically. Canonical theory name: Registration Theory (Physical Foundations). Version: 1.0.
This timestamp records a bounded milestone in Registration Theory (Physical Foundations): an explicit deterministic preparation-measurement-reset model that reproduces the binary quadratic projective weight νP,I(Bi) = ||Pi v||² / ||v||² in a controlled tangent/refinement limit, while isolating the remaining unproved physical bridge.The construction combines an already-derived isotropic rank-three H4 relational sector, a finite fine-registration fiber, a deterministic cyclic successor that visits each fine state exactly once per period, and the existing retained-registration detector result that post-threshold outcome is fixed by the sign of the incoming imbalance and reset returns the detector to readiness. Uniform finite-cycle visitation gives an exact empirical measure on the fine fiber. In the directional refinement limit, full-rank lattice counting in the isotropic H4 tangent geometry gives uniform spherical area. With the explicit linear seed coupling δ = ε(λ̂·nI + mP,I), the detector basins become spherical caps with relative area (1 + m)/2, and the projective contrast identity m = ⟨v,(2Pi−I)v⟩/||v||² yields the quadratic projective weight.The paper does not claim that canonical ACRF-4 has derived the Born rule. The decisive linear particle-apparatus coupling is an additional model assumption, not a result already forced by ACRF-4 or by the detector sign-preservation theorem. A sensitivity theorem shows that replacing the linear offset m by a general function f(m) changes the limiting frequency law to (1 + f(m))/2 on the unsaturated interval. Thus deterministic cycling and isotropic geometry alone do not select the Born form.The contribution is therefore an explicit deterministic RT-compatible Born-form existence construction with a precise claim boundary. The named next proof obligation is H-B/U8: derive the linear tangent particle-apparatus coupling, including its relative coefficient, directly from canonical ACRF-4 dynamics rather than choosing it phenomenologically. Canonical theory name: Registration Theory (Physical Foundations). Version: 1.0.
This status report asks whether Registration Theory (RT) derives the qubit Born rule, P(+) = cos²φ, from its own deterministic registration dynamics, or only hosts a construction that reproduces it. RT's canonical finite model is the four-node adaptive consequence-registration field (ACRF-4).Main results:A conditional Born theorem. If the preparation–measurement map supplies (C1) an additive seed, (C2) a fine-state distribution equal to the planar shadow of the uniform 2-sphere, and (C3) a consequence angle locked to twice the preparation–apparatus angle, then ACRF's exact receiver seed yields P(+) = cos²φ. Condition (C2) is shown to be necessary (Cramér–Wold).Native quadratic structure. RT's bilateral phase invariant ζ satisfies tr(P̂_U P̂_V) = (1 + Re ζ²)/2 = cos²Δ, a gauge-invariant projector overlap with the Born form, and the angle doubling follows from RT's sign-gauge quotient. Square-root ledger coordinates realize a Pythagorean split, S = s cos²θ and T = s sin²θ.Obstructions:At detector readiness, the receiver seed is exactly bilinear and does not depend on the coordinate that sets the native Born weight.Phase-only sufficiency fails by explicit counterexample: identical ζ with opposite seed signs.Tangent isotropy is broken by the same boundary couplings that produce the seed.Readiness restricts the seed-visible fine state to a circle, which gives the wrong probability law.A full so(3) commutator algebra generated by retained history is generic and does not by itself select the spherical measure.Conclusion: RT currently hosts, but does not derive, the Born rule. The report identifies the single missing object, a preparation–measurement map, and lists preregistered tests, including a recorded prediction of failure for the isotropy test. It also states one falsifiable consequence: small deviations from Born frequencies concentrated near the outcome threshold.Every claim is labeled exact [E], numerically verified [V], or reported from project audits [R]. The accompanying Python script (rt_born_checks.py, NumPy, fixed seeds) reproduces every [V] claim.Computations, adversarial checks and drafting were assisted by AI language models. The author is responsible for the content.
This timestamped note records a controlled Registration Theory result concerning the quantum measurement problem and the Born rule.Using the frozen canonical ACRF-4 dynamics, complementary linear cross-registration amplitudes were tested as candidate measurement channels. In a ready-state construction, the normalized receiver-successor consequence followed the Born-shaped partition cos²(Δ):sin²(Δ) to high numerical accuracy, with a maximum absolute deviation of 3.84 × 10⁻⁴ across the tested angles.A second test removed any imposed probabilistic branch rule and allowed the two whole measurement channels to compete deterministically for first threshold crossing under repeated canonical successor evolution. That mechanism failed to reproduce Born frequencies, with a maximum absolute error of approximately 0.253. The failure is retained as a negative result rather than adjusted away.A subsequent preregistered microcapture test examined whether a macroscopic ensemble of near-ready receiver elements converts aggregate cross-registration consequence linearly into newly activated microscopic capture events. Exchangeability between matched complementary channels was recovered in the controlled 45° construction, but fixed-resolution microcapture linearity failed: a finite consequence threshold produces a zero-activation region in the weak-coupling limit.Together, these results narrow the remaining Registration Theory measurement problem. The quadratic Born-shaped consequence appears naturally in the canonical receiver dynamics, while the unresolved bridge is the conversion of that consequence into microscopic retained-record hazards. The next theorem target is a near-critical retained-margin mechanism in which continuous registration transfer acts on a distribution of detector elements close to commitment.The accompanying CSV and text files provide the numerical outputs and run summaries for the successor first-capture and preregistered microcapture tests.
This paper establishes a conditional Born-frequency limit within canonical ACRF-4 and tests each bridge of the proposed measurement mechanism without inserting a Born probability rule.The result begins from a previously timestamped finding that complementary linear cross-registration channels produce a canonical receiver-successor consequence partition closely following cos^2(Delta):sin^2(Delta), while a deterministic whole-channel first-threshold mechanism fails. The present work replaces that failed mechanism with a native ACRF critical surface derived from the exact local stability of the centered receiver odd mode. The corresponding multiplier is Lambda=(alpha-beta p_S) sech^2[(alpha+beta p_S-mu/2)m_S], with readiness margin q=1-Lambda.A Near-Critical Registration Capture Theorem is proved conditionally: if a macroscopic ready apparatus has a smooth nonzero density of microreceivers near q=0, if weak canonical consequence shifts native stability linearly as DeltaLambda=kappa Gamma+o(Gamma), and if complementary channels are exchangeable, then the newly committed microreceiver fraction is linear in Gamma. The macroscopic capture ratio therefore approaches the normalized canonical consequence ratio, and in the weak-coupling two-channel construction approaches cos^2(Delta).The theorem premises are then tested numerically using the frozen canonical ACRF-4 successor and retained-edge update. The source-induced retained receiver-edge response scales as |Delta p_S| proportional to Gamma^0.999977. Native near-critical crossing count is linear in aggregate canonical consequence with R^2=0.996247 in a power-enhanced test. A direct seven-angle closure test gives an underlying consequence-ratio error below 2.3 x 10^-5 and a finite native crossing-ratio mean absolute error of 0.0150. An independent finite-size study finds the crossing-ratio error scales as N^-0.4816 and, more directly, as N_cross^-0.4916, consistent with inverse-square-root finite-count convergence rather than a persistent systematic departure.Two negative controls are retained as part of the result: a whole-channel threshold race produces winner-take-all behavior, and a fixed positive microscopic consequence threshold creates a weak-coupling dead zone. The paper therefore isolates the remaining RT proof obligations to deriving the physical near-critical apparatus ensemble, proving the coarse-grained relation between canonical retained structure and detector memory, and extending the construction beyond two-channel measurements.
A constructive deterministic existence theorem for an explicitly defined ideal Enchan position detector. A stable real pre-Fix branch supplies a conserved canonical action. A cell-compatible canonical router maps the incoming state into physical receiver cells; a detector-side common covariant connection produces the region/history wall bias; a finite-width Hamiltonian pulse yields the canonical decision kick in the impulsive limit; a zero-threshold one-wall stage amplifies its sign; and a reversible wall-memory swap with an auxiliary record tape preserves outcomes while exactly re-preparing the active wall. The resulting actual repeated record frequency is the normalized channel action, and under the stated countably complete detector-cell refinement it defines a normalized countably additive position measure. The conventional Born projector-norm formula is compared only after the native derivation is frozen. The bundled numerical scripts verify selected regulated action, wall, channel-geometry, and answer-check identities; they do not numerically implement or validate the final full reversible one-cycle detector map.
We study how much of the Hilbert-space and Born-rule structure of quantum theory can be obtained from operational primitives that involve records but not probabilities. The setting is a regime in which coherent alternatives recombine without leaving a stable record. We obtain three results of different kinds. Geometry. From composable contributions, record-inert reversible controls and amplitude scalings, under named conditions, we obtain a real inner-product event geometry. The existence of the inner product is equivalent to bounded mixing and is assumed in that form. In a worked interferometer with one mode per channel, the metric is not an input: metric-free port swaps and phase flips fix the form up to scale, and boundedness only forces the other controls to preserve it. Its uniqueness up to scale, the orthogonality of distinct outcomes, and the representation of events by orthogonal projections are derived. Obstruction. This geometry, even with full symmetry about the preparation and exact dyadic standards, does not select the quadratic weight: the preparation mixed with the maximally mixed state survives. The structural operations exhibited here certify only values on which the quadratic weight equals the counting weight. On restricted event families where Gleason’s theorem is unavailable, a calibration order oriented by the quadratic magnitude selects it: given exact standards, a state is the quadratic one exactly when it respects all such brackets. Whether such an orientation can be earned is the open problem. Given such brackets and refinement only to a finite depth K, every admissible state lies within 2^-K of the quadratic weight, without the Archimedean step. On the full projection lattice, Gleason’s theorem with null support, or sphere-transitive symmetry with null support, gives other conditional routes. Bridge. A predictive probability kernel is introduced separately. Its identification with the real quadratic weight ||P_A ψ||² / ||ψ||² is conditional on kernel-admission hypotheses, one of which is equivalent to the Born value; the complex form needs phase invariance in addition. The hypotheses select a class of contexts, and none is shown to be forced. For each we state the physical feature it expresses and a sufficient condition where one is known, and we work out one apparatus in which the geometry-stage hypotheses hold together. For all but one we give a context in which it fails (for the founding conditions, one that leaves the regime); for the remaining one, TCC-1, we give an illustration. This paper is the first in a series built on a common framework, Structural Ledger Consistency (in preparation).
Registration Theory proposes that physical reality begins not with objects situated in a pre-given spacetime, but with interactions that create and preserve distinguishable relations—registrations—from which objects, information, dimensionality, time, and effective geometry may emerge. This paper examines one finite-dimensional mathematical component of that broader program. Given a positive-semidefinite registration operator R and a fixed linear resolution map A_S associated with a system S, it studies the resolved operator D_S = A_S R A_S†. The paper establishes that D_S is well-defined, self-adjoint, and positive semidefinite; derives its factorization, rank identity, and rank bounds; and proves continuous dependence on perturbations of R and A_S. Under the additional assumption that A_S is contractive, the trace of D_S cannot exceed the trace of R, with equality when A_S is isometric on the support of R. The principal result concerns threshold effective rank: the number of eigenvalues of D_S above a specified threshold. This count is locally stable when the threshold is separated from the spectrum by a positive gap. Explicit counterexamples demonstrate why the stated assumptions and strict perturbation bounds matter. The results do not derive spacetime, physical dimensionality, Lorentzian signature, or an empirical law. The threshold effective rank is a spectral statistic rather than a physical spatial dimension. The paper instead establishes a limited mathematical prerequisite for future work connecting system-relative resolution to effective dimensionality and geometry. This version revises and supersedes v1, previously titled “Existence and Stability of Finite Pre-Geometric Resolution Structures in Registration Theory.” The core construction and theorem package are unchanged, while the trace theorem has been refined to match the verified result and the exposition, framing, limitations, and physical motivation have been substantially revised.