The Decision-Theoretic Origin of the Admissibility Threshold This note addresses the last order-one constant in the decoherence-cliff mechanism: the admissibility threshold Iadm. It argues that this threshold is not a free parameter, but the entropy required to decide between the two branches of a superposition. Purpose Article 20 derived a decoherence-cliff law whose location depends on the ratio between a total admissibility cost and a per-step information rate. The per-step rate was already identified with the mutual Fisher information. This note identifies the remaining total cost. Main Argument Reconstructive admissibility is operationalised as a binary decision between two branches of a superposition. The accumulated record is treated as a sequential log-likelihood process, and the closure occurs when this process first crosses the reconstructibility boundary. Rate versus Threshold The note separates two quantities that must not be confused: the per-step rate, fixed by Wald's identity as a Kullback–Leibler divergence, which reduces in the soft regime to the mutual Fisher information; the threshold, which is a total information and therefore must be an entropy, not another per-step divergence. Threshold Value The admissibility threshold is identified with the branch entropy: Iadm = H(p). For a balanced two-branch superposition, this gives: Iadm = ln 2. The resulting cliff location is therefore: Nc = H(p) τD / τmin, with no remaining free order-one constant. Physical Identification The key physical input is the standard entropy identity for decoherence: when a pure two-branch superposition decoheres into a classical mixture, the entropy increase is exactly the Shannon entropy of the branch weights. The note identifies this entropy increase with the relative-entropy recovery of the reconstructive closure. Status The decision-theoretic rate, the dimensional separation between rate and threshold, and the decoherence entropy identity are established under the framework of Articles 19 and 20. The exact equality Iadm = H(p) remains conditional on identifying Article 19's relative-entropy recovery with decoherence entropy, and on the initial branch being pure. Conclusion The note turns the admissibility threshold from an adjustable constant into a decision-theoretic and entropic quantity. In the clean balanced case, the decoherence cliff becomes parameter-free: the threshold is the entropy produced by making a branch definite.
The Decision-Theoretic Origin of the Admissibility Threshold This note addresses the last order-one constant in the decoherence-cliff mechanism: the admissibility threshold Iadm. It argues that this threshold is not a free parameter, but the entropy required to decide between the two branches of a superposition. Purpose Article 20 derived a decoherence-cliff law whose location depends on the ratio between a total admissibility cost and a per-step information rate. The per-step rate was already identified with the mutual Fisher information. This note identifies the remaining total cost. Main Argument Reconstructive admissibility is operationalised as a binary decision between two branches of a superposition. The accumulated record is treated as a sequential log-likelihood process, and the closure occurs when this process first crosses the reconstructibility boundary. Rate versus Threshold The note separates two quantities that must not be confused: the per-step rate, fixed by Wald's identity as a Kullback–Leibler divergence, which reduces in the soft regime to the mutual Fisher information; the threshold, which is a total information and therefore must be an entropy, not another per-step divergence. Threshold Value The admissibility threshold is identified with the branch entropy: Iadm = H(p). For a balanced two-branch superposition, this gives: Iadm = ln 2. The resulting cliff location is therefore: Nc = H(p) τD / τmin, with no remaining free order-one constant. Physical Identification The key physical input is the standard entropy identity for decoherence: when a pure two-branch superposition decoheres into a classical mixture, the entropy increase is exactly the Shannon entropy of the branch weights. The note identifies this entropy increase with the relative-entropy recovery of the reconstructive closure. Status The decision-theoretic rate, the dimensional separation between rate and threshold, and the decoherence entropy identity are established under the framework of Articles 19 and 20. The exact equality Iadm = H(p) remains conditional on identifying Article 19's relative-entropy recovery with decoherence entropy, and on the initial branch being pure. Conclusion The note turns the admissibility threshold from an adjustable constant into a decision-theoretic and entropic quantity. In the clean balanced case, the decoherence cliff becomes parameter-free: the threshold is the entropy produced by making a branch definite.
Record-Conditioned Reduction and the Decoherence Cliff This paper proposes a falsifiable reconstruction-based account of quantum measurement. Its central claim is that the loss of interference is not merely a smooth Markovian decay, but a first-passage phenomenon: coherence persists until a reconstructive admissibility threshold is crossed. Purpose Building on the causal-segment structure of Article 19, the paper interprets measurement as the moment when a coherent reconstruction can no longer remain admissible because the record has accumulated enough information to distinguish the branches. Main Idea A superposition remains reconstructively admissible while the branch information is below a threshold. Once the accumulated record crosses that boundary, the coherent segment closes and the system undergoes record-conditioned reduction. The Decoherence Cliff The visibility of interference is identified with the survival probability of a first-passage process. This predicts a characteristic “cliff”: a sharp loss of visibility around a critical number of elementary causal steps. The cliff location is governed by: Nc = Iadm / Îmut where Îmut is the per-step mutual Fisher information and Iadm is the total admissibility threshold. Empirical Content The model predicts a threshold law rather than a simple exponential decay. Its distinctive signature is a sharp transition whose location scales with the coherence window, together with a Fano-factor structure different from ordinary Markovian decoherence. Relation to Decision Theory The admissibility threshold is later identified with the branch entropy H(p), giving Iadm = ln 2 for a balanced superposition. This turns the cliff location into a parameter-free prediction in the ideal pure-branch case. Status The paper is a preprint-level proposal in the foundations of quantum mechanics. Its strongest content is the falsifiable replacement of smooth decoherence by a first-passage admissibility threshold. Its remaining burden is to establish the strong impossibility result against signed-increment or hidden Markovian reformulations. Conclusion This paper reframes measurement as the crossing of a reconstructive admissibility boundary. If correct, reduction is not an added postulate but the observable cliff produced when a coherent causal segment ceases to be globally admissible.
Dynamical collapse models secure the occurrence of definite outcomes, and decoherence theory explains the dynamical stability of preferred bases. Two structural questions are frequently run together in discussions of what these accounts leave open: which set of channels serves as the collapse basis, and what distinguishes the realised outcome among the admissible ones. We separate the two and give each a variational formulation that is provably consistent with standard quantum statistics. For the second question we define the outcome cost of a target outcome law as the minimal relative entropy, on the path space of the collapse dynamics, of any trajectory measure realising that law. We prove that this cost equals the Kullback–Leibler divergence from the Born distribution, so that the Born law is the unique zero-cost outcome law and the cost of a single outcome k is its surprisal −log pk. For continuous quantum-non-demolition collapse we show that the least-cost dynamics conditioned on outcome k is the Doob h-transform of the collapse dynamics, and that −log pk equals the expected integrated squared steering drift. For the first question we prove that, under pure-dephasing system–environment coupling, the coarsest channel set with zero decoherence cost is the eigen-decomposition of the coupling observable, and we state a compatibility condition that collapse operators must meet to share this basis. Finally, we show that sharp-threshold mathematics applies naturally to the registration of an outcome in redundant environmental records, not to the selection of the outcome itself. The framework introduces no new dynamics, does not derive the Born rule, and makes no empirical predictions beyond those of the underlying collapse model.
Observer-information entropy production quantifies the loss of recoverable information about a physical source when an already formed observation undergoes source-independent irreversible degradation. The statistical second-law statement Σobs[s,t]=I(X;Rs)−I(X;Rt)=I(X;Rs∣Rt)≥0 follows from data processing, but by itself it does not identify a physical energetic or thermodynamic cost. This paper establishes such a connection within an explicit and deliberately restricted stochastic-thermodynamic regime. We consider a finite observer memory Rt coupled to a single heat bath at temperature T. A source label X is fixed during the passive relaxation, the transition generator of Rt is independent of X, and the memory dynamics satisfies detailed balance with respect to a strictly positive equilibrium law q. For the joint source--memory ensemble and for the unconditioned memory marginal, we define the standard stochastic-thermodynamic entropy-production rates. Using the relative-entropy chain rule and the detailed-balance H-theorem, we prove the exact correlation-dissipation decomposition kBS˙totXR=σobs+kBS˙totR. Consequently, S˙totXR≥kBσobs,ΔStotXR[s,t]≥kBΣobs[s,t]. At fixed temperature the same result is an excess-free-energy dissipation bound, \[ \Fex_{XR}(s)-\Fex_{XR}(t) \ge k_BT\Sigma_{\mathrm{obs}}[s,t]. \] Equality holds when the memory marginal remains at equilibrium, in which case all thermodynamic irreversibility is attributable to the destruction of source--record correlation. A symmetric two-state memory provides an exactly solvable saturation example. The result is not a universal Landauer principle. It constrains total entropy production and loss of nonequilibrium free energy during passive decorrelation; it does not assert a universal heat or work cost for arbitrary information loss. Driven memories, source-dependent transition rates, active measurement, feedback, multiple reservoirs, and nonequilibrium steady states require the broader information-thermodynamic bookkeeping developed in stochastic thermodynamics. We then place the thermodynamic result beside two Fisher--Shannon bridges. Under Gaussian observation heat flow Yt=X+Bt, observer-information dissipation obeys the exact identity σobs(t)=21(td−J(Yt))=2t21mmse(X∣Yt), while pairwise statistical distinguishability obeys \[ \frac{d}{dt}\KL(p_t\|q_t) =-\frac12\Jrel(p_t\|q_t). \] Recent temporal-Fisher speed-limit results provide a complementary route from physical entropy production to the speed of probability evolution. Together these results separate three objects that are often conflated: thermodynamic irreversibility, Shannon information loss about the physical source, and Fisher-geometric statistical motion. The paper thereby supplies a physical-cost layer for observer information theory without identifying information with energy or thermodynamic entropy.
Articles 1–8 constitute the published core of the reconstruction programme; within the later work, Articles 19 and 20 are also published. The present paper provides a status map of the full working architecture, Articles 1–21. This architecture is not homogeneous in status: some papers extend the core framework, others formulate conditional mechanisms, and some are explicitly exploratory notes. The purpose of this paper is to make these distinctions explicit rather than to present all components as equally established. The paper fixes the primitive hypotheses of the programme, identifies its load-bearing results, separates established statements from conditional mechanisms, and locates the remaining open problems. It is intended as a logical charter for the series: a guide to what belongs to the published core, what is under active development, and what remains exploratory. The established framework reconstructs a number of known structures and possesses a limited but non-trivial prohibitive content: certain classes of universes are incompatible with its closure architecture, while several candidate mechanisms remain conditional. Until recently it offered no distinctive quantitative prediction beyond known physics — numerical predictions arose only in exploratory extensions whose additional assumptions remained unproved. Article 20 changes this. From the established causal foundation — the atomicity of the elementary (length-one) closure of Article 19 — it derives the programme's first distinctive, falsifiable prediction: because admissibility is a decided binary property, its closure is a first-passage time, and the rigidity of first passage forces a decoherence cliff (a threshold loss of interference visibility) in the soft-photon regime, where standard decoherence predicts a smooth exponential. The deviation is derived, not fitted. A refit of the 2004 thermal-emission data places them in a regime where cliff and decoherence coincide, so the prediction is not yet tested, but it lies within reach of existing matter-wave interferometry. The central challenge has accordingly shifted. Of the three routes to empirical distinctiveness — a unique closure principle, a boundary-condition selection mechanism, or a quantitative prediction following from the established framework alone — the third now exists. The open questions are no longer internal consistency, but the experimental test of this prediction and the closure of its single residual freedom: the order-one decision-theoretic cost of resolving the admissibility predicate, conjectured to equal the relative entropy of the resolved branch.
We prove that decoherence is practically irreversible through a purely information-theoretic mechanism that invokes neither the second law of thermodynamics nor Hilbert space dimensionality arguments. In branching decoherence dynamics, the frame variable (the relative phase between pointer sectors) is stored as a ramp secret in an access structure induced by redundant environment records. A bounded-memory reversal agent faces a scouting–recovery complementarity: measuring fragments to identify records induces back-action that degrades subsequent frame recovery. This tradeoff yields a meta-Nyquist gap governing the agent's net coherent-information gain rate. When pointer redundancy exceeds a critical threshold, the gap turns negative and the agent enters a renewal trap — an absorbing regime in which coherent qubits are lost faster than useful fragments can be incorporated. The main result (the Informational Irreversibility Theorem) shows that frame recovery probability is exponentially close to chance for any adaptive LOCC protocol. Five extensions establish universality: channel independence via Lindbladian spectral gaps, robustness under partial quantum error correction, a passive–active duality between the meta-Nyquist threshold and the fault-tolerance threshold, an optimal redundancy analysis revealing that quantum Darwinism maximizes the informational cost of reversing classicality, and a thermodynamic separation via an explicit pure-state model with zero entropy. Additional results include a categorical duality functor, tight spectral bounds for physical noise channels, multi-party verifier networks, and an adversarial extension connecting to Byzantine fault tolerance.
Any finite-resolution description of a physical system incurs two costs: an information cost, quantifying microscopic complexity via relative entropy, and an ordering cost, quantifying geometric or structural organization. The Entropy–Order Balance (EOB) framework postulates that realized physical laws correspond to Lyapunov-stable equilibria of the total cost functional. Part I showed that the gravitational sector — Einstein's field equations and the cosmological constant — emerges as the stable ordering response. This paper shows that quantum mechanics emerges as the stable information response. Starting from the same five operational axioms applied to resolution windows with smooth Riemannian structure, supplemented by Lyapunov stability and two standard GPT-to-quantum hypotheses (reversible subgroup, local tomography/purification), the paper derives: State-space convexity from variational stability — a result that standard quantum reconstruction programs (Hardy 2001, Chiribella–D'Ariano–Perinotti 2011) assume as a postulate Hilbert space structure and completely positive trace-preserving (CPTP) dynamics Born rule probabilities from decision-theoretic stability over KL divergence Measurement as a barrier-dominance phenomenon: inter-sector transitions in the EOB functional are exponentially suppressed in apparatus size, producing effective state reduction without a collapse postulate A universal decoherence timescale τ_dec = d_S/c depending only on system dimension and the same constant c that determines Λ = cH₀² in Part I Pointer basis selection via Holevo quantity maximization Conditional extensions requiring additional AQFT inputs (Bisognano–Wichmann property, Haag–Kastler net structure) yield an area-law entropy exponent d = 2 and identification of the EOB balance scale with the Planck length. Part I (companion paper) derives Einstein's field equations and the cosmological constant from the same axiomatic framework.