Part II of the SFIT Stochastic-Braid Substrate series asks which additional structure would be required for outcome records to occur with Born-rule frequencies \(|\psi_k|^2\), and how much of that structure the substrate itself could plausibly supply. Part I established that persistent stochastic defects generate braid-group structure with orthogonal representations preserving \(\|\psi\|^2\), but made no claim about outcome probabilities; pure braiding cannot produce definite records, since orthogonal invertible maps cannot drive the internal state to a basis state. This paper studies a classical absorber race. Each channel \(k\) has an environment oscillator driven at resonance by a force linear in the carrier amplitude \(\psi_k\); a record is produced by the first channel whose absorbed drive work exceeds a random threshold. The quadratic dependence of absorption on \(\psi_k\) is derived rather than assumed: a harmonic absorber gives \(P_k = g^2\psi_k^2/(2\gamma)\), while an anharmonic (Duffing) absorber yields fitted exponents of 1.65 at weak drive and 0.74 at strong drive, showing that the quadratic law holds only in the linear-response regime. With exponentially distributed thresholds, record frequencies agree with \(|\psi_k|^2\) within sampling error for all tested states in \(n = 2, 3\) and 4 channels. With fixed, uniform, or gamma-distributed thresholds of shape \(k > 1\), frequencies depart from Born values toward the largest weight - already at a total-variation distance of 0.09 at \(k = 1.5\). This is the behaviour characterized by Yellott's theorem: within races with independent, identically distributed thresholds, choice probabilities proportional to rates for three or more alternatives require exponential thresholds. The paper distinguishes this \(n \geq 3\) condition (number of competing alternatives) from the \(n \geq 3\) condition in Gleason's theorem (state-space dimension). Oscillator simulations match the exact race integral throughout, and thermal noise up to \(k_BT = 0.1\) leaves frequencies unchanged when records are triggered by drive work. The result is explicitly conditional. Linear coupling, steady drive, channel independence and symmetry, memoryless thresholds, and mutual exclusion of records are assumptions of the model, not consequences of Part I; Table 2 lists all conditions and their status. The paper identifies memoryless thresholds (potentially supplied by the exponentially timed velocity reversals of Part I) as the most promising substrate contribution, states a pre-registered decision rule for testing it, and proposes further tests (start-from-rest ramps, total-energy triggers, over-dispersed thresholds). No derivation of the Born rule from the substrate is claimed; the mechanism is presented as a candidate, with the task for SFIT made specific. Simulation code (stage_c_absorber.py) reproducing all numbers from fixed random seeds accompanies the preprint.
Part II of the SFIT Stochastic-Braid Substrate series asks which additional structure would be required for outcome records to occur with Born-rule frequencies (|\psi_k|^2), and how much of that structure the substrate itself could plausibly supply. Part I established that persistent stochastic defects generate braid-group structure with orthogonal representations preserving (|\psi|^2), but made no claim about outcome probabilities; pure braiding cannot produce definite records, since orthogonal invertible maps cannot drive the internal state to a basis state. This paper studies a classical absorber race. Each channel (k) has an environment oscillator driven at resonance by a force linear in the carrier amplitude (\psi_k); a record is produced by the first channel whose absorbed drive work exceeds a random threshold. The quadratic dependence of absorption on (\psi_k) is derived rather than assumed: a harmonic absorber gives (P_k = g^2\psi_k^2/(2\gamma)), while an anharmonic (Duffing) absorber yields fitted exponents of 1.65 at weak drive and 0.74 at strong drive, showing that the quadratic law holds only in the linear-response regime. With exponentially distributed thresholds, record frequencies agree with (|\psi_k|^2) within sampling error for all tested states in (n = 2, 3) and 4 channels. With fixed, uniform, or gamma-distributed thresholds of shape (k > 1), frequencies depart from Born values toward the largest weight - already at a total-variation distance of 0.09 at (k = 1.5). This is the behaviour characterized by Yellott's theorem: within races with independent, identically distributed thresholds, choice probabilities proportional to rates for three or more alternatives require exponential thresholds. The paper distinguishes this (n \geq 3) condition (number of competing alternatives) from the (n \geq 3) condition in Gleason's theorem (state-space dimension). Oscillator simulations match the exact race integral throughout, and thermal noise up to (k_BT = 0.1) leaves frequencies unchanged when records are triggered by drive work. The result is explicitly conditional. Linear coupling, steady drive, channel independence and symmetry, memoryless thresholds, and mutual exclusion of records are assumptions of the model, not consequences of Part I; Table 2 lists all conditions and their status. The paper identifies memoryless thresholds (potentially supplied by the exponentially timed velocity reversals of Part I) as the most promising substrate contribution, states a pre-registered decision rule for testing it, and proposes further tests (start-from-rest ramps, total-energy triggers, over-dispersed thresholds). No derivation of the Born rule from the substrate is claimed; the mechanism is presented as a candidate, with the task for SFIT made specific. Simulation code (stage_c_absorber.py) reproducing all numbers from fixed random seeds accompanies the preprint.
This deposit contains the manuscript and the three analysis scripts (with outputs and SHA-256 hashes) for Part III of the SFIT Stochastic-Braid Substrate series. The paper separates three objects that are often conflated in attempts to obtain quantum measurement statistics from a classical substrate: (i) the substrate configuration (positions, velocities, helicities of the Part I defects), (ii) the channel population xk≥0, ∑kxk=1, and (iii) the record probability P(k), i.e. the probability that a physical record names channel k. The Born rule relates (iii) to (ii); it says nothing by itself about how (ii) arises from (i). The paper asks three questions and reports the status of each: 1. Can a shared, finite carrier enforce exclusive records? In a coupled-mode model with explicit local detectors, detector-local back-reaction lowers the gated coincidence parameter from α=1.00 to α=0.57–0.60 at the strongest back-reaction tested, but only when detector thresholds are comparable to the carrier energy. At thresholds one-twentieth of the carrier energy, α stays at 0.96–1.00. Strong exclusion (α<0.1) was not reached in any of 136 configurations. Result: partial suppression only. 2. Under what conditions does record selection reproduce Born weights? Two sufficient routes are identified, each with a precisely quantified fragility. Route 1: exactly memoryless (exponential) detector thresholds give Born frequencies by a common-time-change argument; gamma thresholds of shape 2 depart by TV distance 0.08–0.15. Route 2: a bounded martingale for channel populations absorbed at a vertex gives Born weights for any functional form of the exchange law; a first-passage bound and a converse are proved (given absorption, zero conditional drift is necessary), and a biased exchange kernel is shown to follow the Kimura fixation formula, so zero drift must hold to order 1/M in the number of exchange units. Common-mode noise on the shared carrier cannot substitute for detector-local randomness: with fixed thresholds the largest channel fires first in every run, at every reversal rate. 3. Does Part I supply these conditions? No. The Part I helicity representation acts by permutation matrices, and no permutation action yields zero conditional drift for any filtration unless it is the identity (for pairwise-distinct populations). Measured on the Part I crossing process, the drift is nonzero at every test state, and populations are rearranged but never concentrated; sector populations are exactly invariant. This identifies braiding as neutral with respect to record selection. Scope and caveats. No derivation of the Born rule or of quantum superposition from the substrate is claimed. The internal state ψ is an input; the exchange kernel of Route 2 is global and postulated; memoryless detector thresholds (Route 1) are assumed; strong exclusion was not achieved; and the first-passage record of Proposition 3 (α=0 by conservation) has not been combined with local detectors in simulation. Real amplitudes suffice for the single-system statistics studied, but real-amplitude quantum theory is experimentally distinguishable from complex quantum theory in network scenarios. Each result in the manuscript is tagged [DERIVED], [ASSUMED], or [TESTED]. Three scripts produce every number in the paper; each states its model, metrics, controls, predictions and decision rules in its header, fixed before the runs reported. The scripts were not preregistered; this deposit supplies them together with their outputs and hashes to support reproducibility.
This paper investigates whether the one-dimensional stochastic dynamics of the SFIT stochastic-braid substrate can supply the conditionally fair exchange sign required for Born-weighted record formation. Building on Part III, which established that Born-weighted outcomes follow when channel populations form a bounded martingale absorbed at a vertex, we examine two possible sources of exchange signs in the one-dimensional ring dynamics: velocity reversals and defect-crossing orientations. The analysis identifies two distinct obstructions. First, velocity-reversal signs alternate for each defect, producing systematic second-order drift rather than conditionally fair exchange. Second, crossing orientations are constrained by the cyclic order of defects on the ring. We prove that this orientation is determined by the preceding crossing history and therefore cannot supply a conditionally fair sign. This is a topological obstruction, independent of the particular population jump law whenever that law responds to the crossing sign. For the carrier-mediated exchange law studied here, the obstruction produces a measurable departure from Born-weighted outcomes. At reversal rate γ = 1, the resulting bias is approximately +0.056 in the probability of the initially largest channel, remains essentially unchanged across the tested exchange amplitudes, and is statistically distinct from the martingale prediction. We then construct a reduced predictive model using only the substrate's measured pair-crossing statistics and the topological orientation rule. The model predicts record probabilities without fitting parameters to carrier outcomes. Across multiple reversal rates, initial population states, and time-step settings, its predictions agree with independent carrier simulations within the stated uncertainty. An ablation retaining only marginal pair frequencies fails to reproduce the reversal-rate dependence, demonstrating the importance of pair-sequence memory. At γ = 4, convergence of the finite-history model is not established, and that case is explicitly reported as a model limit rather than a successful validation. The results establish that the one-dimensional ring-crossing mechanism does not provide the fair-sign condition needed for the martingale route to Born-weighted records. Instead, the substrate's deterministic topological orientation constraint, together with the memory of its crossing sequence, predicts the resulting departure from Born statistics. The study is limited to the one-dimensional ring configuration and the specified carrier-mediated jump law. In particular, it does not settle whether the braid-generator sign in the planar dynamics of Part I can be conditionally fair. That remains a separate question for genuine two-dimensional braid geometry. Part IV therefore provides a topological no-go result for the one-dimensional fair-exchange route and a quantitative, independently tested account of the record bias that replaces it.
Can a Born-type probability structure arise on a substrate that is only a finite stochastic process? A stochastic program built from six primitive operations supplies the final matrix; a specified layered architecture constructs, from its outputs, a record layer, a two-dimensional real carrier and a quadratic law, and supports an adopted Born calculus. The six operations alone do not give this structure, and the square-root encoding and the projection are construction choices. Our main contribution is the architecture: a directed acyclic graph whose arrows are each marked as derived, chosen, adopted or standard mathematics, with the kind of check behind each. On registered populations, a snapshot predictor whose rank-two case is the law predicts the substrate's sampled label frequencies with lower aggregate loss than named competitors, and, in the construction's canonical basis, its cross terms carry its advantage over the diagonal rule. In each of 2,122 census cases the encoded state is not a function of the anonymous initial record description: two point preparations sharing all three labels differ by at least 1/25 in the trace probability of raw label 0, a statement about exact data, not operational access. This bound is retrospective: the registered bound 3/20 fails in 117 cases of the full census. On the original worked case the updates by the final matrix and its square do not lift to the carrier. The measurement rules are adopted: Lüders tests, all densities and effects, and additivity; on them the trace rule is unique, and finite ontic models with additive responses, and measurable preparation-noncontextual representations preserving the specified mixtures, are excluded. We do not claim that the substrate produces the measurement rule, that the layer forms in the run, or a derivation of quantum theory. The source code of the stochastic program, the constructions, the reproduction pipeline, the verification commands and the Lean 4 proofs are available at https://github.com/ioannist/six-birds-born (release v1.0). AI systems were used throughout this work, as the manuscript describes; the author directed the research, made the scientific decisions and is responsible for the content.
Quantum mechanics predicts outcome statistics via the Born rule, yet remains operationally under-specified with respect to how, and on what timescale, a single outcome becomes definite in an experimental record. In many platforms, identical Born-compliant outcome histograms can be produced either by a time-extended physical closure process, in which competing channels accumulate influence until a decision event, or by purely readout-level mappings and post-processing applied to measurement records. This under-determination motivates an operational question: which broad classes of readout-based explanations remain viable given finite-time, resolution-dependent data alone? Here we formulate an operational exclusion criterion relative to a broad null family of readout-only, memoryless models. In this null family, for each temporal resolution Delta t, the reported outcome is generated by a (possibly stochastic and nonlinear) mapping from a single-shot record R to an outcome Y, with no decision-level internal state persisting across Delta t settings and no dependence on sweep direction or parameter history. Under these structural assumptions, sweep-history dependence is excluded by construction. Using Delta t as a single experimentally controlled parameter, interpreted as an effective integration window, we define three operational quantities. The first is a Born distance D_B(Delta t), measuring the deviation between the observed outcome distribution at resolution Delta t and the corresponding Born-rule prediction. The second is a convergence-rate proxy gamma(Delta t), defined as the negative derivative of D_B with respect to the logarithm of Delta t, which quantifies the tendency toward convergence to Born statistics as temporal resolution is increased. The third is a hysteresis-based memory witness M(Delta t), defined as the absolute difference between Born distances obtained from increasing and decreasing Delta t sweeps. We then state a conditional trade-off for stateful closure explanations. Over Delta t ranges where these quantities are well defined, a positive convergence tendency gamma(Delta t) greater than zero is generically expected to be accompanied by nonzero path dependence M(Delta t) greater than zero. This expectation can be summarized by an upper bound of the form: gamma(Delta t) is less than or equal to C times M(Delta t), plus a correction term epsilon(Delta t). Here C depends on coarse structural features of the closure process, such as the number of competing channels and the sharpness of decision thresholds, while epsilon collects finite-sample and finite-resolution effects. An efficiency ratio eta(Delta t), defined as gamma(Delta t) divided by M(Delta t), is introduced as a diagnostic. Within the null family, where M(Delta t) is identically zero, any sustained claim of finite positive gamma necessarily drives eta to diverge, signaling incompatibility with the readout-only, memoryless assumptions. The framework does not propose new dynamics or modify quantum theory. Instead, it specifies an operational protocol and a coupled signature set whose robust observation would render the readout-only, memoryless null family insufficient as an explanation of finite-time Born convergence. Robustness controls, including sweep-rate variation, randomized Delta t ordering, and mapping-invariance checks, are outlined to separate decision-level path dependence from trivial instrumental artifacts.
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.
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).