Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Statewise versus operator Bell causality in finite quantum sequential growth: exact separation and recovery at dimension two

Kenichi Osaki

Published Aug 9, 2026• 1 citation
Publisher

Abstract

We present a bounded analysis of the finite, nonsingular, occurrence-ON quantum sequential-growth presentation at dimension d=2 and source stages n<=4. The preprint records five ledger-bound results: a frozen strong/strong commutativity baseline; an exact rational fixed-vector/general-covariance and reachable-state/martingale witness of noncommutativity; a source-native Eq. (120) lemma; commutativity on a proper reconstruction slice; and conditional statewise-to-operator recovery lemmas. Its purpose is to make the distinction between statewise and operator semantics auditable, rather than to classify all finite semantics. In particular, it does not claim the full 955 or 721 profiles, a complete finite occurrence-ON classification, or a reachable-visible witness. The bounded U2 auxiliary-ideal investigation is retained as a reproducibility and resource-boundary record, not as a unit-ideal theorem.

DOI
10.5281/zenodo.21861532

Related papers

Bell Causality and Operational Rigidity in Quantum Sequential Growth: What noncommuting transition operators can do on reachable causal-set histories

Thomas G Hamilton

A quantum sequential-growth dynamics should allow interference between causal-set histories while respecting the causal and relabelling principles that constrain classical growth. Recent work on causal-past-ordered Bell causality (CPOBC) allows noncommuting transition operators, raising a physical question: can this algebraic freedom act nontrivially on histories that the dynamics actually prepares? For invertible operator-valued growth satisfying the operator Markov sum rule and strict state-vector covariance, we prove a dimension-independent answer for immediate sibling births. At every reached parent with at least two elements, the gregarious operators of its children act identically on the parent's state, and all same-parent transition commutators annihilate that state. The proof uses only source-faithful spectator reductions; it assumes neither operator-level covariance nor global factorization. An all-stage dark-sector model shows why this is not a theorem of operator commutativity. The local conclusion strengthens to the full cyclic module generated by the transitions of any fixed reached parent, ruling out an irreducible transition algebra on that parent for carrier dimension at least two. Conditional reductions and three-dimensional examples delineate the surviving possibilities, including a measure-level effect at the exceptional singleton junction. To our knowledge, this on-state rigidity consequence has not previously been isolated for this CPOBC convention. We identify, but do not resolve, the question of independent non-sibling quantum-measure effects at later births. Contents of this record: the manuscript (PDF) and its LaTeX source, and a certificates bundle. The bundle holds seven standalone Python scripts that reproduce every finite-stage computation in the paper, using exact rational or algebraic-number arithmetic. It also contains logs, result files and SHA-256 checksums. Reproducibility: the scripts use only the Python standard library. Unzip the bundle, create an empty folder, and from it run: python -I ../certificates/run_all.py. All outputs are written to the current folder. Status: research preprint, not peer reviewed. Companion to T. G. Hamilton, "Noncommutative quantum sequential growth under state-level covariance: existence, fixed-seed rigidity, and geometric limits", Zenodo (2026), doi:10.5281/zenodo.23953788.

•Nov 6, 2026•1 citation

Which Bell Causality? Operational Abelianization and a Rideout–Sorkin Theorem for Quantum Sequential Growth

Thomas G Hamilton

Classical Rideout–Sorkin growth is constrained by Bell-type spectator independence, whose equivalent scalar formulations need not remain equivalent for noncommuting quantum transitions. We ask which comparison domains matter for the finite-cylinder predictions of causal-past-ordered quantum sequential growth. Four conventions are distinguished: own-core, direct, source-faithful, and broad. With invertible finite-dimensional transitions, an operator Markov sum rule, and strict covariance of reached vectors, direct Bell implies a parent-independent precursor factorization and a faithful commutative algebra on the reached module. This yields an algebra-valued Rideout–Sorkin reconstruction with a single exceptional junction correction. Although the four conventions have strictly different full-matrix solution classes, the operator defects in three separating examples are invisible on reached states. By contrast, an explicit all-stage rank-two own-core model violates a direct-Bell graft constraint at the level of its Gram kernel, establishing a genuine predictive separation. An all-stage broad-Bell example and a general visibility criterion show that the junction correction can also affect finite-cylinder interference. These results distinguish full operator identities from reached dynamics and coherent finite-cylinder data; they do not claim an extension to covariant infinite-history events. Contents of this record: the manuscript (PDF) and its LaTeX source, and a certificates bundle. The bundle holds ten standalone Python scripts that check every finite computation cited in the paper using exact integer and rational arithmetic, together with their result files and SHA-256 checksums. Reproducibility: the scripts use only the Python standard library. Unzip the bundle and, inside its folder, run: python3 run_all.py. It verifies the checksums, runs all ten certificates and reports ALL PASS. The all-stage theorems are proved in the manuscript; the scripts are finite checks. Status: research preprint, not peer reviewed. Third paper in a series, following T. G. Hamilton, "Noncommutative quantum sequential growth under state-level covariance: existence, fixed-seed rigidity, and geometric limits", Zenodo (2026), doi:10.5281/zenodo.23953788, and "Bell causality and operational rigidity in quantum sequential growth", Zenodo (2026), doi:10.5281/zenodo.24006143.Version 2 (13 November 2026): revised for submission to Physical Review D. Adds a mechanism theorem for own-core predictive separation in a stated class of complete models: all normalized precursor factors commute, the only possible obstruction is the two-chain graft, all nine birth-six target pairs are decided, and the complete Gram kernel is direct-Bell realizable if and only if the three-chain growth weight is not split. Exact-arithmetic certificates: doi:10.5281/zenodo.24159976.

•Nov 9, 2026•1 citation

Intrinsic Classification of Quantum Sequential Growth: Gram Kernels, First-Junction Realization, and the Equivalence of Bell Conventions

Thomas G Hamilton

In quantum sequential growth of causal sets, the coherent predictions for finite histories are summarized by the Gram kernel of the reached history vectors, which fixes all finite-cylinder interference. A formally consistent kernel need not come from any complete growth dynamics, so a realization criterion decides which candidate quantum causal processes are admissible. For finite-dimensional, causal-past-ordered growth, and building on the operational descent and Bell-convention results of a preceding paper, we answer two questions. Realizability: a kernel arises from a complete direct-Bell model if and only if it satisfies five intrinsic conditions. Four of them (normalization, positivity and refinement; invertible graft graphs; commutation; Markov invertibility) reconstruct the unique minimal commutative late dynamics, and a first-junction rank condition decides whether that dynamics lifts. Sufficiency is proved by an injective-envelope dilation, which yields a full broad-Bell model on a carrier of dimension at most 2·dim(U)·rank(K), also when the relevant algebra is nonsemisimple. Consequently direct, source-faithful and broad Bell causality have identical kernel classes, despite their different full-matrix model classes. Observational completeness: apart from the empty/singleton pair, two finite causal sets are identified by every such model exactly when they have equal size and equal augmented past-profile multisets. Explicit examples show that a realizable kernel can require a carrier larger than its reached space, and that a consistent reduced kernel can fail the first-junction condition. We separate these finite-cylinder results from own-core classification, infinite-history extension and finite-prefix recognition. Contents of this record: the manuscript (PDF) and its LaTeX source, and a certificates bundle. The bundle holds twelve standalone Python programs that check every finite computation cited in the paper using exact integer and rational arithmetic, together with their result files and SHA-256 checksums. Reproducibility: the programs use only the Python standard library. Unzip the bundle and, inside its folder, run: python3 run_all.py. It verifies the checksums, runs all twelve programs and reports ALL 12 PROGRAMS PASSED. The all-stage theorems are proved in the manuscript; the programs are finite checks. Status: research preprint, not peer reviewed. Fourth paper in a series; it builds directly on T. G. Hamilton, "Which Bell causality? Operational abelianization and a Rideout–Sorkin theorem for quantum sequential growth", Zenodo (2026), doi:10.5281/zenodo.24083829, which in turn follows doi:10.5281/zenodo.24006143 and doi:10.5281/zenodo.23953788.Version 2 (13 November 2026): revised for submission to Physical Review D as a companion to “Which Bell causality?” (doi:10.5281/zenodo.24181929). Mathematics unchanged; presentation, references and the statement of the own-core open problem updated.

•Nov 9, 2026•1 citation

Structure and rigidity of own-core quantum sequential growth

Thomas G Hamilton

A causal set represents discrete events and their causal ordering, while quantum sequential growth assigns coherent vectors to alternative birth histories. Earlier work showed that a weak, “own-core” form of Bell causality can permit finite-cylinder predictions forbidden by stronger forms. This article asks how rigid that extra freedom is, including when the first nonempty transition is nonscalar. We exhaust the nonsingular two-dimensional cyclic scalar-singleton chart. At its noncommuting witness, the exact birth-six Jacobian has 348 variables, rank 340, and kernel dimension eight; at birth seven it has 1,620 variables, rank 1,611, and kernel dimension nine. An explicit invertible all-stage family integrates every tangent in both kernels, giving smooth finite-cutoff solution germs. We also determine the role of nonscalar singleton transitions on a two-dimensional carrier with one common gregarious matrix from size three onward. Bell causality alone does not force broad Bell, as an exact noncovariant counterexample demonstrates. In contrast, strict reached-vector covariance and full spanning force each nonscalar model on this locus to satisfy broad Bell on its original matrices, even when early gregarious matrices do not commute. Consequently, on the complete spanning two-dimensional common-matrix locus, own-core predictions exceed the direct-Bell class exactly for a scalar singleton with a split three-chain weight. Explicit all-stage nonscalar models show that kernels outside the scalar-singleton class do exist but already satisfy broad Bell. Block-extension spaces and three-dimensional slices delimit the result. Higher-dimensional, nonspanning and non-common-matrix cases remain open.

•Nov 13, 2026•0 citations

Relational Information, Classical Records, and Preparation-Aware Quantum Recovery

Qingchun Zhang

This preprint studies operational equivalence and recovery in a twenty-dimensional residual system with a fixed four-sector representation of dimensions 8, 8, 2 and 2. It distinguishes what a declared observation algebra can detect, what a channel preserves, and what a retained classical record makes recoverable. Record-resolved criteria separate useful reversible-error records from unrelated labels and measured-sector records, even when the discarded channel is the same. For a specified coarse-record model, the work identifies exactly recoverable observable algebras and proves an optimal entanglement-fidelity expression on a fixed four-state orbit code. Preparation-aware recovery is then classified over all one-use isometric subspaces in the stated family. An explicit ten-dimensional marker code attains exact recovery under a specified stochastic record where the whole-sector support restriction permits only eight dimensions. Its encoding, nonbaseline marker measurement, and conditional inverse operations remain supplied resources. Scoped Lean evidence verifies the explicit arbitrary-complex-matrix recovery construction and related finite identities; it does not formalize the general complete-positivity/reference framework or optimal-dimension theorem. The recorded-error model is not derived from the companion exchange-timing model, and no protection of its long pulse sequence is claimed.

•Sep 10, 2026•0 citations

Contract-Relative Quantum Realisations of Classical Processes

Mark Whitlock

Paper 6 of 11 — A General Theory of Answerability The eleven-paper TUS OS mathematical research programme Abstract This paper develops a general theory of how the exact resource cost of representing an independently fixed native system depends on the operational access contract imposed on that system. Rather than assigning a single intrinsic “dimension” to a process or operational object, the paper treats realisation as a fully typed problem determined jointly by the native system, the access contract, the admitted realisation category and the tolerated error. The framework defines contract-indexed achievable resource regions, declared-memory closure, lawful contract restriction and resource monotonicity. Strengthening a contract can require a realisation to preserve or recover distinctions that a weaker behavioural contract is permitted to compress, while the independently fixed native system itself remains unchanged. Lawful contract restriction induces reverse inclusion of achievable regions, but strict separation requires additional lower and upper certificates. For stochastic processes, the paper introduces causal-state transparency as a recovery obligation imposed on an exact autonomous predictor at a declared inspection boundary. All persistent quantum, classical, controller, history and source-side information available at that boundary is included in the resource account. A direct-sum classical–quantum identity-capacity theorem proves that uniform worst-case recovery probability τ across N intrinsic causal classes requires identity capacity at least ⌈τN⌉. The theorem is then applied to two external stochastic-process families. Periodically modulated decay processes exhibit an unbounded finite separation: exact autonomous prediction has minimum identity capacity 2, exact causal-state transparency has minimum capacity N, and every fixed positive transparency threshold forces a lower bound growing as ⌈τN⌉. For the dual-Poisson process, an exact qubit predictor exists under the weak prediction contract, while every positive uniform worst-case transparency threshold makes the finite-capacity achievable region empty. This is a contract-induced loss of finite feasibility on the same native process, not a claim that the process itself ceases to exist or that no larger infinite-capacity realisation could exist. The paper then returns to the TUS OS discovery instance from which the general problem arose. The same independently fixed 64-state canonical target admits a complete static quantum-operational Atlas of exact minimum Hilbert dimension 4, while recovery-complete LANDING selected-line instrument access, GUIDANCE selected-line readout and GUIDANCE selected-line-and-endpoint joint-instrument access each have exact minimum Hilbert dimension 64 within the same declared representation category. The native target does not change; the operational access obligation does. Together, the TUS OS, periodically modulated decay and dual-Poisson results establish three distinct exact contract-relative regimes: strict finite separation: 4 → 64; unbounded finite separation: 2 → N; finite-capacity breakdown: 2 → ∅finite for every τ > 0. These are three instances of one general structural law, not three identical recovery mechanisms. TUS OS uses admitted experiment families that collectively separate its canonical carriers, whereas the stochastic-process results use direct causal-state decoding at a declared inspection boundary. The results establish that finite-capacity behavioural sufficiency does not imply positive uniform worst-case recoverability of native predictive identity, and that exact representation cost is not a context-free property of the native system alone. It depends on the complete typed obligation imposed on an admitted realisation. The paper does not claim physical quantum execution, quantum advantage, a universal scalar resource, equivalence of TUS OS recovery with causal-state transparency, or finite-capacity breakdown for prior-weighted dual-Poisson transparency. Supporting General Theory Programme This paper is Paper 6 in the TUS OS quantum-operational and Answerability research programme. Building on Papers 1–5, it develops the general theory of contract-relative quantum realisations of classical processes, showing that quantum resource requirements are not intrinsic to a process alone but depend on the governing observational, recovery, and transparency contract. Paper 7 extends this into operational observability and the classification of contract-induced resource transitions; Papers 8–9 develop generic Answerability theory and calculus; Paper 10 proves the protected and executable realisation of TUS OS within that calculus; 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, 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 OSEstablishes the repeated-common-effect static Atlas, its exact minimum complex Hilbert dimension 4, exact carrier-reconstruction structure and deterministic predictive-state minimum 64 for the frozen complete principal future language. Paper 4 — Technical Volume I — Formal Foundations and the Complete-Future CorpusNative Contract, Statistical Discrimination and the Invariant Probability ModuleEstablishes the frozen complete principal terminal future-experiment language, complete statistical separation of distinct carrier pairs, exact parity-resolved discrimination results, complement reachability and the 33-dimensional rational invariant probability module. Paper 4 — Technical Volume II — Orthogonality, Process Closure and Native Triadic SynthesisEstablishes universal complement-support orthogonality and its propagation under exact common-CPTP dynamics, the resulting common-CPTP process bounds, recovery-complete LANDING and GUIDANCE results, exact 64-dimensional selected-line instrument/readout minima at their declared contracts, an exact classical–quantum hybrid construction, and the native structural/predictive quotient correspondence. The state-only common-CPTP minimum remains bounded within 32–64 rather than being fixed at 64. 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, proves that TUS OS is a proper Anchored Analog Quantum System on its 64-input abstract canonical corpus, elevates the inherited structural/predictive correspondence into the Predictive Synthesis Identity Theorem, and composes the recognition, predictive, resource and downstream-conservation results into the TUS OS Anchored Analog Quantum System Theorem. 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 Observability and Contract-Induced Resource Transitions in Quantum RealisabilityStructural Classification, Family Scaling, and Finite-Resource BreakdownDevelops a structural classification theory for contract-induced representation-resource transitions, introducing the Contract Distinction System (CDS), CRC cofinal/refinement equivalence, and Certified Observability Transport Theory (COTT). It separates internal divergence from family divergence, classifies baseline-feasible strengthenings as resource-neutral, strict finite, finite-resource breakdown, or UNRESOLVED, and proves exact and asymptotic witnesses including an interface-induced 2→3 separation, the TUS OS 4→64 transition, incrementally unbounded finite separation for periodically modulated decay processes, and finite-resource breakdown for positive-threshold dual-Poisson transparency. Paper 8 — The Resource Geometry of Answerable InferenceIrreducible Answerability Structure, Minimal Sufficient Cores, and Certified Inference-Resource BoundariesDevelops the resource geometry of answerable inference. It formalises lawful-discharge semantics, source-level inferential obligations, answerability-sufficient reductions and irreducible sufficient cores, while keeping semantic structure, certified lower bounds and operational feasibility independently constituted. Gate E establishes a local answerability-to-resource threshold result; globally, exact closure identifies the Pareto-minimal inference-resource

•Aug 14, 2026•0 citations
We present a bounded analysis of the finite, nonsingular, occurrence-ON quantum sequential-growth presentation at dimension d=2 and source stages n<=4. The preprint records five ledger-bound results: a frozen strong/strong commutativity baseline; an exact rational fixed-vector/general-covariance and reachable-state/martingale witness of noncommutativity; a source-native Eq. (120) lemma; commutativity on a proper reconstruction slice; and conditional statewise-to-operator recovery lemmas. Its purpose is to make the distinction between statewise and operator semantics auditable, rather than to classify all finite semantics. In particular, it does not claim the full 955 or 721 profiles, a complete finite occurrence-ON classification, or a reachable-visible witness. The bounded U2 auxiliary-ideal investigation is retained as a reproducibility and resource-boundary record, not as a unit-ideal theorem.
A quantum sequential-growth dynamics should allow interference between causal-set histories while respecting the causal and relabelling principles that constrain classical growth. Recent work on causal-past-ordered Bell causality (CPOBC) allows noncommuting transition operators, raising a physical question: can this algebraic freedom act nontrivially on histories that the dynamics actually prepares? For invertible operator-valued growth satisfying the operator Markov sum rule and strict state-vector covariance, we prove a dimension-independent answer for immediate sibling births. At every reached parent with at least two elements, the gregarious operators of its children act identically on the parent's state, and all same-parent transition commutators annihilate that state. The proof uses only source-faithful spectator reductions; it assumes neither operator-level covariance nor global factorization. An all-stage dark-sector model shows why this is not a theorem of operator commutativity. The local conclusion strengthens to the full cyclic module generated by the transitions of any fixed reached parent, ruling out an irreducible transition algebra on that parent for carrier dimension at least two. Conditional reductions and three-dimensional examples delineate the surviving possibilities, including a measure-level effect at the exceptional singleton junction. To our knowledge, this on-state rigidity consequence has not previously been isolated for this CPOBC convention. We identify, but do not resolve, the question of independent non-sibling quantum-measure effects at later births. Contents of this record: the manuscript (PDF) and its LaTeX source, and a certificates bundle. The bundle holds seven standalone Python scripts that reproduce every finite-stage computation in the paper, using exact rational or algebraic-number arithmetic. It also contains logs, result files and SHA-256 checksums. Reproducibility: the scripts use only the Python standard library. Unzip the bundle, create an empty folder, and from it run: python -I ../certificates/run_all.py. All outputs are written to the current folder. Status: research preprint, not peer reviewed. Companion to T. G. Hamilton, "Noncommutative quantum sequential growth under state-level covariance: existence, fixed-seed rigidity, and geometric limits", Zenodo (2026), doi:10.5281/zenodo.23953788.
Classical Rideout–Sorkin growth is constrained by Bell-type spectator independence, whose equivalent scalar formulations need not remain equivalent for noncommuting quantum transitions. We ask which comparison domains matter for the finite-cylinder predictions of causal-past-ordered quantum sequential growth. Four conventions are distinguished: own-core, direct, source-faithful, and broad. With invertible finite-dimensional transitions, an operator Markov sum rule, and strict covariance of reached vectors, direct Bell implies a parent-independent precursor factorization and a faithful commutative algebra on the reached module. This yields an algebra-valued Rideout–Sorkin reconstruction with a single exceptional junction correction. Although the four conventions have strictly different full-matrix solution classes, the operator defects in three separating examples are invisible on reached states. By contrast, an explicit all-stage rank-two own-core model violates a direct-Bell graft constraint at the level of its Gram kernel, establishing a genuine predictive separation. An all-stage broad-Bell example and a general visibility criterion show that the junction correction can also affect finite-cylinder interference. These results distinguish full operator identities from reached dynamics and coherent finite-cylinder data; they do not claim an extension to covariant infinite-history events. Contents of this record: the manuscript (PDF) and its LaTeX source, and a certificates bundle. The bundle holds ten standalone Python scripts that check every finite computation cited in the paper using exact integer and rational arithmetic, together with their result files and SHA-256 checksums. Reproducibility: the scripts use only the Python standard library. Unzip the bundle and, inside its folder, run: python3 run_all.py. It verifies the checksums, runs all ten certificates and reports ALL PASS. The all-stage theorems are proved in the manuscript; the scripts are finite checks. Status: research preprint, not peer reviewed. Third paper in a series, following T. G. Hamilton, "Noncommutative quantum sequential growth under state-level covariance: existence, fixed-seed rigidity, and geometric limits", Zenodo (2026), doi:10.5281/zenodo.23953788, and "Bell causality and operational rigidity in quantum sequential growth", Zenodo (2026), doi:10.5281/zenodo.24006143.Version 2 (13 November 2026): revised for submission to Physical Review D. Adds a mechanism theorem for own-core predictive separation in a stated class of complete models: all normalized precursor factors commute, the only possible obstruction is the two-chain graft, all nine birth-six target pairs are decided, and the complete Gram kernel is direct-Bell realizable if and only if the three-chain growth weight is not split. Exact-arithmetic certificates: doi:10.5281/zenodo.24159976.
In quantum sequential growth of causal sets, the coherent predictions for finite histories are summarized by the Gram kernel of the reached history vectors, which fixes all finite-cylinder interference. A formally consistent kernel need not come from any complete growth dynamics, so a realization criterion decides which candidate quantum causal processes are admissible. For finite-dimensional, causal-past-ordered growth, and building on the operational descent and Bell-convention results of a preceding paper, we answer two questions. Realizability: a kernel arises from a complete direct-Bell model if and only if it satisfies five intrinsic conditions. Four of them (normalization, positivity and refinement; invertible graft graphs; commutation; Markov invertibility) reconstruct the unique minimal commutative late dynamics, and a first-junction rank condition decides whether that dynamics lifts. Sufficiency is proved by an injective-envelope dilation, which yields a full broad-Bell model on a carrier of dimension at most 2·dim(U)·rank(K), also when the relevant algebra is nonsemisimple. Consequently direct, source-faithful and broad Bell causality have identical kernel classes, despite their different full-matrix model classes. Observational completeness: apart from the empty/singleton pair, two finite causal sets are identified by every such model exactly when they have equal size and equal augmented past-profile multisets. Explicit examples show that a realizable kernel can require a carrier larger than its reached space, and that a consistent reduced kernel can fail the first-junction condition. We separate these finite-cylinder results from own-core classification, infinite-history extension and finite-prefix recognition. Contents of this record: the manuscript (PDF) and its LaTeX source, and a certificates bundle. The bundle holds twelve standalone Python programs that check every finite computation cited in the paper using exact integer and rational arithmetic, together with their result files and SHA-256 checksums. Reproducibility: the programs use only the Python standard library. Unzip the bundle and, inside its folder, run: python3 run_all.py. It verifies the checksums, runs all twelve programs and reports ALL 12 PROGRAMS PASSED. The all-stage theorems are proved in the manuscript; the programs are finite checks. Status: research preprint, not peer reviewed. Fourth paper in a series; it builds directly on T. G. Hamilton, "Which Bell causality? Operational abelianization and a Rideout–Sorkin theorem for quantum sequential growth", Zenodo (2026), doi:10.5281/zenodo.24083829, which in turn follows doi:10.5281/zenodo.24006143 and doi:10.5281/zenodo.23953788.Version 2 (13 November 2026): revised for submission to Physical Review D as a companion to “Which Bell causality?” (doi:10.5281/zenodo.24181929). Mathematics unchanged; presentation, references and the statement of the own-core open problem updated.
A causal set represents discrete events and their causal ordering, while quantum sequential growth assigns coherent vectors to alternative birth histories. Earlier work showed that a weak, “own-core” form of Bell causality can permit finite-cylinder predictions forbidden by stronger forms. This article asks how rigid that extra freedom is, including when the first nonempty transition is nonscalar. We exhaust the nonsingular two-dimensional cyclic scalar-singleton chart. At its noncommuting witness, the exact birth-six Jacobian has 348 variables, rank 340, and kernel dimension eight; at birth seven it has 1,620 variables, rank 1,611, and kernel dimension nine. An explicit invertible all-stage family integrates every tangent in both kernels, giving smooth finite-cutoff solution germs. We also determine the role of nonscalar singleton transitions on a two-dimensional carrier with one common gregarious matrix from size three onward. Bell causality alone does not force broad Bell, as an exact noncovariant counterexample demonstrates. In contrast, strict reached-vector covariance and full spanning force each nonscalar model on this locus to satisfy broad Bell on its original matrices, even when early gregarious matrices do not commute. Consequently, on the complete spanning two-dimensional common-matrix locus, own-core predictions exceed the direct-Bell class exactly for a scalar singleton with a split three-chain weight. Explicit all-stage nonscalar models show that kernels outside the scalar-singleton class do exist but already satisfy broad Bell. Block-extension spaces and three-dimensional slices delimit the result. Higher-dimensional, nonspanning and non-common-matrix cases remain open.
This preprint studies operational equivalence and recovery in a twenty-dimensional residual system with a fixed four-sector representation of dimensions 8, 8, 2 and 2. It distinguishes what a declared observation algebra can detect, what a channel preserves, and what a retained classical record makes recoverable. Record-resolved criteria separate useful reversible-error records from unrelated labels and measured-sector records, even when the discarded channel is the same. For a specified coarse-record model, the work identifies exactly recoverable observable algebras and proves an optimal entanglement-fidelity expression on a fixed four-state orbit code. Preparation-aware recovery is then classified over all one-use isometric subspaces in the stated family. An explicit ten-dimensional marker code attains exact recovery under a specified stochastic record where the whole-sector support restriction permits only eight dimensions. Its encoding, nonbaseline marker measurement, and conditional inverse operations remain supplied resources. Scoped Lean evidence verifies the explicit arbitrary-complex-matrix recovery construction and related finite identities; it does not formalize the general complete-positivity/reference framework or optimal-dimension theorem. The recorded-error model is not derived from the companion exchange-timing model, and no protection of its long pulse sequence is claimed.
Paper 6 of 11 — A General Theory of Answerability The eleven-paper TUS OS mathematical research programme Abstract This paper develops a general theory of how the exact resource cost of representing an independently fixed native system depends on the operational access contract imposed on that system. Rather than assigning a single intrinsic “dimension” to a process or operational object, the paper treats realisation as a fully typed problem determined jointly by the native system, the access contract, the admitted realisation category and the tolerated error. The framework defines contract-indexed achievable resource regions, declared-memory closure, lawful contract restriction and resource monotonicity. Strengthening a contract can require a realisation to preserve or recover distinctions that a weaker behavioural contract is permitted to compress, while the independently fixed native system itself remains unchanged. Lawful contract restriction induces reverse inclusion of achievable regions, but strict separation requires additional lower and upper certificates. For stochastic processes, the paper introduces causal-state transparency as a recovery obligation imposed on an exact autonomous predictor at a declared inspection boundary. All persistent quantum, classical, controller, history and source-side information available at that boundary is included in the resource account. A direct-sum classical–quantum identity-capacity theorem proves that uniform worst-case recovery probability τ across N intrinsic causal classes requires identity capacity at least ⌈τN⌉. The theorem is then applied to two external stochastic-process families. Periodically modulated decay processes exhibit an unbounded finite separation: exact autonomous prediction has minimum identity capacity 2, exact causal-state transparency has minimum capacity N, and every fixed positive transparency threshold forces a lower bound growing as ⌈τN⌉. For the dual-Poisson process, an exact qubit predictor exists under the weak prediction contract, while every positive uniform worst-case transparency threshold makes the finite-capacity achievable region empty. This is a contract-induced loss of finite feasibility on the same native process, not a claim that the process itself ceases to exist or that no larger infinite-capacity realisation could exist. The paper then returns to the TUS OS discovery instance from which the general problem arose. The same independently fixed 64-state canonical target admits a complete static quantum-operational Atlas of exact minimum Hilbert dimension 4, while recovery-complete LANDING selected-line instrument access, GUIDANCE selected-line readout and GUIDANCE selected-line-and-endpoint joint-instrument access each have exact minimum Hilbert dimension 64 within the same declared representation category. The native target does not change; the operational access obligation does. Together, the TUS OS, periodically modulated decay and dual-Poisson results establish three distinct exact contract-relative regimes: strict finite separation: 4 → 64; unbounded finite separation: 2 → N; finite-capacity breakdown: 2 → ∅finite for every τ > 0. These are three instances of one general structural law, not three identical recovery mechanisms. TUS OS uses admitted experiment families that collectively separate its canonical carriers, whereas the stochastic-process results use direct causal-state decoding at a declared inspection boundary. The results establish that finite-capacity behavioural sufficiency does not imply positive uniform worst-case recoverability of native predictive identity, and that exact representation cost is not a context-free property of the native system alone. It depends on the complete typed obligation imposed on an admitted realisation. The paper does not claim physical quantum execution, quantum advantage, a universal scalar resource, equivalence of TUS OS recovery with causal-state transparency, or finite-capacity breakdown for prior-weighted dual-Poisson transparency. Supporting General Theory Programme This paper is Paper 6 in the TUS OS quantum-operational and Answerability research programme. Building on Papers 1–5, it develops the general theory of contract-relative quantum realisations of classical processes, showing that quantum resource requirements are not intrinsic to a process alone but depend on the governing observational, recovery, and transparency contract. Paper 7 extends this into operational observability and the classification of contract-induced resource transitions; Papers 8–9 develop generic Answerability theory and calculus; Paper 10 proves the protected and executable realisation of TUS OS within that calculus; 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, 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 OSEstablishes the repeated-common-effect static Atlas, its exact minimum complex Hilbert dimension 4, exact carrier-reconstruction structure and deterministic predictive-state minimum 64 for the frozen complete principal future language. Paper 4 — Technical Volume I — Formal Foundations and the Complete-Future CorpusNative Contract, Statistical Discrimination and the Invariant Probability ModuleEstablishes the frozen complete principal terminal future-experiment language, complete statistical separation of distinct carrier pairs, exact parity-resolved discrimination results, complement reachability and the 33-dimensional rational invariant probability module. Paper 4 — Technical Volume II — Orthogonality, Process Closure and Native Triadic SynthesisEstablishes universal complement-support orthogonality and its propagation under exact common-CPTP dynamics, the resulting common-CPTP process bounds, recovery-complete LANDING and GUIDANCE results, exact 64-dimensional selected-line instrument/readout minima at their declared contracts, an exact classical–quantum hybrid construction, and the native structural/predictive quotient correspondence. The state-only common-CPTP minimum remains bounded within 32–64 rather than being fixed at 64. 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, proves that TUS OS is a proper Anchored Analog Quantum System on its 64-input abstract canonical corpus, elevates the inherited structural/predictive correspondence into the Predictive Synthesis Identity Theorem, and composes the recognition, predictive, resource and downstream-conservation results into the TUS OS Anchored Analog Quantum System Theorem. 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 Observability and Contract-Induced Resource Transitions in Quantum RealisabilityStructural Classification, Family Scaling, and Finite-Resource BreakdownDevelops a structural classification theory for contract-induced representation-resource transitions, introducing the Contract Distinction System (CDS), CRC cofinal/refinement equivalence, and Certified Observability Transport Theory (COTT). It separates internal divergence from family divergence, classifies baseline-feasible strengthenings as resource-neutral, strict finite, finite-resource breakdown, or UNRESOLVED, and proves exact and asymptotic witnesses including an interface-induced 2→3 separation, the TUS OS 4→64 transition, incrementally unbounded finite separation for periodically modulated decay processes, and finite-resource breakdown for positive-threshold dual-Poisson transparency. Paper 8 — The Resource Geometry of Answerable InferenceIrreducible Answerability Structure, Minimal Sufficient Cores, and Certified Inference-Resource BoundariesDevelops the resource geometry of answerable inference. It formalises lawful-discharge semantics, source-level inferential obligations, answerability-sufficient reductions and irreducible sufficient cores, while keeping semantic structure, certified lower bounds and operational feasibility independently constituted. Gate E establishes a local answerability-to-resource threshold result; globally, exact closure identifies the Pareto-minimal inference-resource