Environmental fragments provide indirect access to pointer information, but fragment-averaged accessibility need not determine where microscopic branch dependence resides. For an environment of N subsystems, we quantify fragment pointer information by the Holevo quantity, which upper-bounds accessible classical information, and average it over fragments of equal size. Assuming two pure pointer-conditioned environmental branches share an identical, branch-independent rest outside a carrier, we establish an exact support-projection identity and a hypergeometric formula for the complete averaged accessibility curve. A carrier of size at most two is sufficient for a finite-N order-2 constraint; for N = 4, this yields A2 = A4/6 + 4A1/3 and A3 = A4/2 + A1. The converse fails in general: an interval-certified, computer-assisted N = 4 state-space construction satisfies these relations while having minimal carrier size four. We distinguish this distributed state-space witness from realizations in the tested five-qubit controlled-gate circuits. Using the pre-operation conditional branch state and the known gate, a prospectively frozen mechanism catalog correctly classified 417/417 protocol-defined, outcome-conditioned scored events at theta = pi/2; 28 post-R0 events among 445 eligible instances were handled separately. Paired sampled-parameter tests classified 320/320 scored events at each of theta = pi/3 and 2pi/3; these paired evaluations are not independent circuit replications. A separate retrospective numerical census classified 70/70 near-zero-residual R0 events as low-carrier within the sampled circuit population. Finally, an exact product-local preservation lemma supplies a sufficient condition for invariance of fragment accessibility, not a complete characterization. Together, these results separate exact operational constraints, nonunique microscopic realizations, and circuit-specific dynamical selection.
Environmental fragments provide indirect access to pointer information, but fragment-averaged accessibility need not determine where microscopic branch dependence resides. For an environment of N subsystems, we quantify fragment pointer information by the Holevo quantity, which upper-bounds accessible classical information, and average it over fragments of equal size. Assuming two pure pointer-conditioned environmental branches share an identical, branch-independent rest outside a carrier, we establish an exact support-projection identity and a hypergeometric formula for the complete averaged accessibility curve. A carrier of size at most two is sufficient for a finite-N order-2 constraint; for N = 4, this yields A2 = A4/6 + 4A1/3 and A3 = A4/2 + A1. The converse fails in general: an interval-certified, computer-assisted N = 4 state-space construction satisfies these relations while having minimal carrier size four. We distinguish this distributed state-space witness from realizations in the tested five-qubit controlled-gate circuits. Using the pre-operation conditional branch state and the known gate, a prospectively frozen mechanism catalog correctly classified 417/417 protocol-defined, outcome-conditioned scored events at theta = pi/2; 28 post-R0 events among 445 eligible instances were handled separately. Paired sampled-parameter tests classified 320/320 scored events at each of theta = pi/3 and 2pi/3; these paired evaluations are not independent circuit replications. A separate retrospective numerical census classified 70/70 near-zero-residual R0 events as low-carrier within the sampled circuit population. Finally, an exact product-local preservation lemma supplies a sufficient condition for invariance of fragment accessibility, not a complete characterization. Together, these results separate exact operational constraints, nonunique microscopic realizations, and circuit-specific dynamical selection.
Fragment-size averages of the pointer Holevo information summarize how quantum environmental records are accessed without specifying their microscopic locations. We give a focused N=4 non-identifiability result: assuming the previously archived interval-certified root for a four-qubit two-branch witness, a second, two-carrier pure-branch ensemble exists with exactly the same complete size-averaged Holevo curve (A1, A2, A3, A4). The key additional step is a rational-interval verification of g(c) < 4A1 < 2g(sqrt(c)), where g(t) = h2((1+t)/2) and c is the overlap of the original branches. Continuity then provides the matching two-carrier ensemble, and the support-projection identity forces agreement at the remaining fragment sizes. Independent 16-dimensional state-vector calculations reproduce the matching averaged curves to floating-point precision; these diagnostics are not used as a substitute for the existence proof. The result concerns one certified curve in an equiprobable two-branch pure-state model, not equality of every individual fragment's information, an open family of curves, or arbitrary environment sizes. The original Krawczyk certificate is a documented imported premise and was not rerun in the present extension audit. Unrefereed preprint. Scientific claims are conditional on the archived original OBS01 certified-root premise. Supporting files provide numerical and interval checks, recorded base certificates and their hashes. Base Krawczyk/Arb computations were not rerun in this extension. This is not a claim of global priority or experimental realization. Manuscript, original notes and data are CC BY 4.0; original Python code is MIT; embedded archived materials retain their applicable component notices and rights. AI-assisted work is disclosed in the manuscript.
Fragment-size-averaged Holevo-information curves omit the identities of environmental fragments. We construct a restricted four-qubit example in which two equal-prior orthogonal pure-branch ensembles have exactly the same fragment-size-averaged Holevo curve (0, 1/6, 1/2, 1) and all four labeled singleton Holevo values equal to zero, while their minimum pure-common-rest carrier sizes differ (2 versus 4). Subject to the correctness of a reduced entropy formula and validated directed interval arithmetic, this coincidence persists for every choice of six raw amplitude coordinates in an explicit product box, with a unique two-coordinate correction inside a common root box. The solution family is open in the six free coordinates, not in the full coefficient or observational space. Analytic exact-rational sign bounds show that the two ensembles are separated by the pattern of labeled two-site fragment information (one positive pair versus three). Combining quantum Pinsker's inequality and an exact-rational simplex bound yields a permutation-invariant second-moment gap larger than 0.6128 bit², conditional on the existence certificate. The release includes the manuscript source, exact reports, four frozen phase source packages, original figure data, checksums, code, and AI-assistance disclosure. This is an unreviewed preprint, not a theorem about general carrier estimation, operational quantum data hiding, local indistinguishability, or finite-shot measurements. Independent priority assessment and comprehensive external peer review remain outstanding.
Abstract Decoherence suppresses interference, but an observer’s ability to reconstruct a classical pointer value depends on additional resources: distinguishable conditional environmental states, an allowed measurement, sufficient accessible fragments, and sufficiently independent records. We provide an explicit minimal quantum-to-operational bridge that places these requirements in one chain. A system qubit is correlated with conditional environmental qubit states, permitting exact expressions for residual coherence, quantum mutual information, pointer Holevo information, accessible information, and Helstrom discrimination error. Full density-matrix calculations validate the formulas across 280 endpoint and interior cases. An accessible-sector/hidden-bath construction shows that coherence can fall below 2.3 × 10⁻⁵ while the observer’s record information and error remain fixed at 0.0803 bits and 0.4009. Measurement policies shift recovery thresholds: for record overlap 0.8 and error tolerance 0.05, collective or optimized adaptive-local discrimination requires four fragments, a fixed canonical-basis measurement requires six, and repeated one-fragment Helstrom measurements followed by classical decoding require seven. More importantly, records matched at the one-fragment level can have radically different collective behavior. For a binary pointer, the common-mode classical channel has an exact accessible-information ceiling of 1 − h₂(0.1) = 0.5310 bits, while the noncommuting hidden-memory ensemble approaches the same Holevo-information ceiling; matched independent records approach one bit and zero error. Disjoint observer counts and unanimous agreement likewise depend on shared error structure. Finally, declared local measurements induce classical record channels that are subjected to held-out model selection, predictive checks, abstention, and simultaneous finite-sample threshold certification. The resulting framework supplies the validated quantum-to-operational record model used in the companion analysis of operational capacity bounds for distinguishable decoherent histories.
Correction in version 1.1 (2026-10-18) The Decimal/Fraction interval engine distributed with version 1.0 used context-sensitive Decimal unary negation and absolute value on interval endpoints. These operations can round inward, so the recorded P02G certificate in v1.0 should not be treated as a rigorously outward-rounded enclosure. Version 1.1 repairs those operations using exact copy_negate() and copy_abs(), hardens the second interval implementation's row-bound selection, and regenerates the interval reports, checksums, and reproducibility manifest. The certified rectangle, theorem scope, and all 34 mathematical environments in the manuscript remain unchanged. Repaired P02G and the separately implemented mpmath.iv P02J both pass the original theorem gates. The result remains conditional computer-assisted mathematical evidence, not formal machine verification or external peer review. Previous version (v1.0): https://doi.org/10.5281/zenodo.23438614 This unrefereed research preprint establishes a computer-assisted, quantitatively certified non-identifiability result for fragment-size-averaged Holevo information in an N=4 environment with two equiprobable pure pointer-conditioned branches. For every point in an explicitly specified closed rational rectangle of coordinate area 4 × 10^-14, two realizations of the complete averaged Holevo information curve exist: one with minimum pure-common-rest carrier size two and another with carrier size four. The proof combines a uniform parameterized contraction mapping, directed interval arithmetic with a second interval implementation, and an intermediate-value construction. Reproducibility materials include the certification programs, frozen numerical certificates, SHA-256 checksums, and a standalone 200-state numerical comparison against direct 16-dimensional partial traces. Both interval implementations share the underlying analytic Holevo reduction and do not constitute independent symbolic proofs. The conclusions are restricted to N=4, equiprobable pure branches, fragment-size-averaged Holevo information, and the specified carrier definition. They do not establish non-identifiability for arbitrary N, mixed states, unequal priors, or individual labeled-fragment information. This is an unrefereed preprint, not a formally verified or peer-reviewed mathematical theorem. Comprehensive novelty priority is not claimed. Licensing: The manuscript and original documentation/data are provided under CC BY 4.0 where applicable. Original Python research code is provided under the MIT License. The accompanying reproducibility archive specifies licenses on a per-file basis. AI assistance disclosure: OpenAI ChatGPT assisted with mathematical analysis, Python implementation, numerical and interval verification, manuscript preparation, and quality assurance. Claude contributed critical assessment and adversarial review assistance. Neither AI system is a coauthor or an external scientific referee. The human author, Yoichi Tsujisawa, assumes responsibility for the research and its publication.
Abstract Decoherent-histories methods identify time-extended alternatives whose diagonal weights may support probabilistic interpretation, while environmental-record approaches ask which alternatives a specified observer can recover. We formulate their intersection as a finite branch-record packing problem generated from one cross-branch construction. A codebook is admissible only if its declared coarse-graining obeys a bounded probability-sum-rule error and its accessible states can be decoded under a specified observer policy with finite error. Uniform reweighting defines a geometric packing number; a communication interpretation additionally requires a preparation instrument. Retrospective resolution is stricter: the base history family is exhaustive, selected histories must cover sufficient physical diagonal weight and be individually recoverable, and the same declared quantum-to-classical measurement channel used for decoding must preserve approximate consistency after histories are refined by its registered outcomes. This measurement-refined condition quantitatively controls the difference between the actual outcome distribution and the normalized diagonal classical-quantum prediction. For uniform branch-record packing and its communication realizations, general converses follow from accessible dimension, fixed outcome count, Holevo-Fano information, and hypothesis testing. Exact models quantify record compression, access, memory, measurement policy, temporal dependence, and shared latent errors. In a jointly realized four-bit benchmark, scalar consistency and recovery admit six histories, whereas direct measurement-refined consistency under the declared local Helstrom instrument admits four at the same tolerances. Finite-sample procedures distinguish held-out recovery achievability, structure-conditional consistency certification, structural converses, independently constructed parameter intervals, and abstention.
Paper 5 of 11 — A General Theory of Answerability The eleven-paper TUS OS mathematical research programme Abstract This paper identifies and formalises a system-level phenomenon in exact quantum representation: an independently constituted deterministic native system can admit multiple exact quantum-operational views whose minimum representation resources can depend sharply on a precommitted access contract, while the native system itself remains unchanged. The quantum representation is therefore neither constitutive of the native system nor a post hoc encoding selected to reproduce a prescribed quantum target. It is an exact operational representation of behaviour exposed by a declared contract on an independently fixed structural target. We introduce two mathematical definitions. An Analog Quantum View (AQV) is the distinguished operational-equivalence class containing every exact permitted finite-dimensional quantum realisation of the behaviour exposed by a nonvacuous, precommitted access contract, under complete persistent-resource accounting. An Anchored Analog Quantum System (AAQS) is an independently constituted, provenance-bearing native system admitting a nonempty contract-indexed family of such views while preserving native identity, native quotient independence and protected provenance outside the quantum representation. The definition excludes circular construction, candidate-dependent post-selection, hidden side information and untyped resource comparisons; the additional properness criterion excludes recognition based solely on the universal orthogonal-sector embedding. TUS OS is proved to be a proper Anchored Analog Quantum System on its 64-input abstract canonical corpus. Its independently defined native structural quotient is canonically isomorphic, as a complete deterministic transition-output system, to deterministic predictive equivalence and to the canonical six-bit carrier, with exact deterministic predictive minimum 64. On this same carrier-faithful structural target, within a fixed no-persistent-side-memory quantum representation category, the minimum Hilbert dimension depends sharply on the permitted operational access. The complete static Atlas has exact minimum d_Atlas^min = 4, whereas recovery-complete LANDING selected-line instrument access and recovery-complete GUIDANCE selected-line readout each have exact minimum d_L,instr^min = d_G,read^min = 64. These yield two exact factor-16 fixed-target, fixed-category resource separations. Recovery-complete state-only common-CPTP access remains bounded by 32 ≤ d_CPTP^min ≤ 64. A separate exact classical–quantum construction retains the certified four-dimensional quantum component together with a 32-state complement-orbit memory. Under the declared componentwise resource order, this hybrid and the 64-sector no-persistent-memory construction are Pareto-incomparable rather than competing estimates of a single resource minimum. The resulting TUS OS Anchored Analog Quantum System Theorem composes native recognition, predictive identity, contract-indexed quantum representation and conservative downstream interpretation without collapsing their domains. Predictive Synthesis and Analog Quantum Views are sibling constructions from independently fixed native identity: neither constructs the other, and neither reconstructs the Native Witness. Provenance and receipt custody remain outside the quantum target, while lawful Domain Binding and downstream human, rules-engine or AI interpretation, operating under independently fixed interfaces and gates, preserve protected native identity and source authority and cannot strengthen the governing evidential ceiling. No claim is made of physical quantum execution, quantum ontology, encoding of question text as a quantum state, quantum advantage, unrestricted domain coverage or model-independent correctness. Realised-instance inheritance remains conditional and target-specific rather than an unrestricted theorem over all TUS OS executions. The paper reports a retrospective prior-art audit through 11 August 2026 that identified no earlier or contemporary public disclosure whose documented properties were found to satisfy the complete AAQS conjunction. Subject to that audited public-record scope, TUS OS is the first formally demonstrated Anchored Analog Quantum System identified in the record examined. This is a system-class priority claim rather than a claim that the constituent ideas—quantum representations of classical processes, predictive equivalence, provenance, resource orderings or noninterference—are themselves novel. Supporting General Theory Programme This paper is Paper 5 in the TUS OS quantum-operational and Answerability research programme. Building on Papers 1–4, it organises the established geometry, operational structure, complete-future theory, process closure, and native Triadic synthesis through the theory of Anchored Analog Quantum Systems, establishing TUS OS as a proper instance of that framework. Papers 6–7 extend the programme through contract-relative quantum realisation, resource separation, operational observability, and contract-induced resource transitions; Papers 8–9 develop generic Answerability theory and calculus; Paper 10 proves the protected and executable realisation of TUS OS; and Paper 11 closes the programme with A General Theory of Answerability, establishing Structural Identity, Recognition, the canonical mandatory protected core, and lawful Realisation Freedom. Paper 1 — Canonical Tetrahedral Qubit-State Geometry in the TUS OS TriadXOR Completion, Receipt Verification and the Qubit-Geometric Semantic WitnessEstablishes the canonical tetrahedral geometry, unique XOR completion, exact qubit-SIC representation and centred-face trine geometry. Paper 2 — The TUS OS Operational CalculusClassical Construction of Exact Qubit Prepare–Measure Behaviour from a Receipt-Custodied Engine ArchitectureEstablishes exact full-carrier qubit prepare–measure behaviour from the deterministic classical engine under the declared Coordinate-Incidence Operational Harness. For each lawful foundation, the 64 six-bit carriers map to exactly 27 anchor-relative qubit preparations under one foundation-defined tetrahedral-SIC Harness, while the separately declared face Harness gives the exact trine table. Paper 3 — From Finite Relational Structure to Qubit Operational FormAmbient Foundations, Canonical Subatlas, Exact Global Quantum Dimension, GUIDANCE Witness, Sequential Closure and Global Representation in TUS OSExtends the local prepare–measure construction to the complete family of completed foundations and the canonical TUS OS subatlas. Every completed foundation has the same 27-class qubit operational quotient; pair relations between charts provide exact carrier-reconstruction structure; the repeated-common-effect static Atlas has exact minimum complex Hilbert dimension 4; and the frozen complete principal future language has deterministic predictive-state minimum 64. Paper 4 — Technical Volume I — Formal Foundations and the Complete-Future CorpusNative Contract, Statistical Discrimination and the Invariant Probability ModuleFixes the formal native domain, complete principal terminal future-experiment language and one-common-word experiment class; establishes complete statistical separation of distinct carrier pairs and the exact parity-resolved pairwise total-variation optimum; determines complement reachability; and proves that the rational invariant probability module generated by the complete terminal probability language has dimension 33. Paper 4 — Technical Volume II — Orthogonality, Process Closure and Native Triadic SynthesisEstablishes universal complement-support orthogonality and its propagation under exact common-CPTP dynamics, giving the certified same-parity support graph and the bound 32 ≤ d_CPTP^min ≤ 64, while leaving cross-parity forcing and the exact state-only common-CPTP minimum unresolved. It further establishes recovery-complete LANDING and GUIDANCE process/readout results, exact 64-dimensional selected-line instrument/readout minima at their declared contracts, an exact four-dimensional-quantum-plus-32-state-classical hybrid construction, joint LANDING–GUIDANCE compatibility, and the native structural/predictive quotient correspondence. Paper 5 — TUS OS as an Anchored Analog Quantum SystemNative Witnesses, Predictive Synthesis, and Access-Contract Resource SeparationDefines Analog Quantum Views and Anchored Analog Quantum Systems and proves that TUS OS is a proper Anchored Analog Quantum System on its 64-input abstract canonical corpus. It elevates the inherited structural/predictive correspondence into the Predictive Synthesis Identity Theorem, organises the inherited exact quantum-operational representations through typed access contracts and resource accounting, and composes native recognition, predictive identity, contract-indexed quantum representation and conditional downstream claim-custody preservation into the TUS OS Anchored Analog Quantum System Theorem. The 64 inputs are an abstract canonical corpus, not 64 asserted receipt executions. Paper 6 — Contract-Relative Quantum Realisations of Classical ProcessesPredictive Compression, Vanishing Worst-Case Causal-State Transparency, and Finite-Dimensional BreakdownGeneralises the access-dependent resource phenomenon beyond the TUS-specific discovery corpus by formalising the contract-relative achievable-resource object (S,C,𝔐,ε) ⟼ Ach(S,C;𝔐,ε), and establishes three exact contract-relative regimes: strict finite separation, unbounded finite separation and finite-capacity breakdown. These are instantiated respectively by the TUS OS 4→64 separation, the periodically modulated decay 2→N exact prediction-to-transparency separation, and dual-Poisson finite-capacity breakdown for every positive uniform worst-case transparency threshold. Paper 7 — Operational O