META–CAUSAL: The Geometry of Predictive Memory and the Limits of Reconstructibility investigates a fundamental question: how much internal memory is required to reproduce an observable process, and how much of its hidden structure can be recovered from measurements? The monograph connects predictive memory, spectral invariants, and operational reconstruction across classical stochastic and quantum models. Its central perspective is that a simple observed signal need not admit a simple internal realization. Memory requirements depend on positivity, probability normalization, accessible measurements, and the distinction between exact reproduction and approximation. A principal result turns the approximation of a periodic spike into an exact fractional matching problem on a divisor hypergraph. For a spike of amplitude b, with 0 < b ≤ 1, repeating every n steps, the optimal uniform error of an m-state homogeneous Markov model, where 1 ≤ m < n, is Eₘ = b/(1 + νₘ). Here νₘ is the largest fractional matching mass attainable within the available cycle budget. This correspondence produces explicit stochastic constructions and matching lower bounds, revealing a staircase of memory thresholds. For period 210, the exact values include E₁₀₀ = 2b/7 and E₁₀₇ = b/4; period 1050 exhibits an additional plateau at 3b/8. A universal rational polytope organizes the possible error levels through determinant formulas, while a structural analysis identifies the final three thresholds for an arbitrary number of distinct prime divisors without enumerating the polytope’s vertices. The broader investigation examines what observations preserve, what they conceal, and what remains certifiable under noise. Spectral witnesses, positive realizations, finite-sample topological certificates, and geometric models involving S³, Hopf structures, and Berger metrics address complementary aspects of this problem. In open quantum systems, the distinction between a damping gap and a purity gap separates dynamical relaxation from the stability of stationary-state topology. The resulting framework combines exact mathematical statements, rational computational certificates, and explicitly conditional physical models. Its contribution is a concrete account of how algebraic, combinatorial, and geometric structure governs both the cost of prediction and the limits of reconstruction.
META–CAUSAL: The Geometry of Predictive Memory and the Limits of Reconstructibility investigates a fundamental question: how much internal memory is required to reproduce an observable process, and how much of its hidden structure can be recovered from measurements? The monograph connects predictive memory, spectral invariants, and operational reconstruction across classical stochastic and quantum models. Its central perspective is that a simple observed signal need not admit a simple internal realization. Memory requirements depend on positivity, probability normalization, accessible measurements, and the distinction between exact reproduction and approximation. A principal result turns the approximation of a periodic spike into an exact fractional matching problem on a divisor hypergraph. For a spike of amplitude b, with 0 < b ≤ 1, repeating every n steps, the optimal uniform error of an m-state homogeneous Markov model, where 1 ≤ m < n, is Eₘ = b/(1 + νₘ). Here νₘ is the largest fractional matching mass attainable within the available cycle budget. This correspondence produces explicit stochastic constructions and matching lower bounds, revealing a staircase of memory thresholds. For period 210, the exact values include E₁₀₀ = 2b/7 and E₁₀₇ = b/4; period 1050 exhibits an additional plateau at 3b/8. A universal rational polytope organizes the possible error levels through determinant formulas, while a structural analysis identifies the final three thresholds for an arbitrary number of distinct prime divisors without enumerating the polytope’s vertices. The broader investigation examines what observations preserve, what they conceal, and what remains certifiable under noise. Spectral witnesses, positive realizations, finite-sample topological certificates, and geometric models involving S³, Hopf structures, and Berger metrics address complementary aspects of this problem. In open quantum systems, the distinction between a damping gap and a purity gap separates dynamical relaxation from the stability of stationary-state topology. The resulting framework combines exact mathematical statements, rational computational certificates, and explicitly conditional physical models. Its contribution is a concrete account of how algebraic, combinatorial, and geometric structure governs both the cost of prediction and the limits of reconstruction.
A quantum processor is controlled through a sequence of operations distributed across time. Its reliability therefore depends on more than the decay observed when the device is left undisturbed. Environmental correlations, stochastic timing, intervention history, acceptance rules, and the observable being computed can all change which errors matter and which protection strategy is justified. The Subordinator Renormalization Problem examines this dependence through an integrated treatment of stochastic clocks, fractional dynamics, multi-time quantum processes, task-specific protection, and finite-sample certification. Its central question is precise: how can temporal resolution be changed and environmental memory compressed while preserving the predictions required by a specified quantum task, including the effects of permitted interventions and their full physical cost? Scientific motivation Coherence time, average gate fidelity, qubit count, and scalar measures of non-Markovianity characterize different aspects of a quantum device. They do not individually determine whether a particular computation can deliver a reliable answer within a given resource budget. A reduced model may reproduce uncontrolled relaxation while omitting correlations that become consequential under pulses, measurements, resets, or subsequent gates. This manuscript investigates the information that must survive a reduction of the noise description. It develops task-sufficient memory as an operational requirement: two process descriptions may be treated as equivalent only when they preserve the declared output expectations, acceptance probabilities, and costs for every allowed future continuation. Stochastic clocks and fractional quantum dynamics The mathematical framework connects Lévy subordinators, Bernstein functions, inverse stable clocks, renewal processes, Caputo fractional derivatives, and Mittag–Leffler relaxation with completely positive quantum dynamics. A central distinction concerns direct and inverse time changes. Direct Bochner subordination of a quantum dynamical semigroup can preserve the semigroup composition law while modifying its generator. An inverse stable clock generally produces a fractional evolution family without that composition law. Fractional powers of generators and fractional derivatives in physical time consequently represent different constructions and cannot be interpreted interchangeably. The manuscript also separates a change of time units from a physical change of the clock law. It derives an exact scaling identity within a fixed stable family and specifies the dimensions of the corresponding relaxation parameter. This identifies what scale covariance establishes and what would require additional evidence of physical control over the environment. The clock-reset problem For inverse stable relaxation, uninterrupted evolution and evolution with an independently renewed hidden clock generally yield different predictions. The paper derives a short-time expansion quantifying the difference between the coherence multiplier after uninterrupted evolution for twice a given duration and the product obtained from two independently renewed intervals. This result makes an otherwise hidden modeling assumption experimentally meaningful. A reset assumption changes the predicted observable response. Whether a real operation renews the relevant environmental variables must therefore be part of the physical model. The analysis includes closed-form calculations for the half-order Mittag–Leffler relaxation, checks of scale covariance, and verification of the deterministic-clock limit. Identical decoherence curves and different control responses An explicit Gaussian dephasing construction provides a separate identification counterexample. A continuum of noise processes produces exactly the same uncontrolled quantum channel at every time, while displaying different responses to spin echo. The entire family has zero Breuer–Laine–Piilo backflow in its uncontrolled reduced dynamics. Nevertheless, its temporal correlations determine whether an echo helps or harms once pulse imperfections are included. The construction shows why uncontrolled channel information alone can be insufficient for an intervention-dependent decision. The relevant distinction is operational: noise processes that look identical during idle evolution can require different control choices. The Gaussian construction and the inverse stable clock analysis are distinct models. Together, they expose complementary requirements on a predictive description, without identifying either construction as a universal microscopic model of a quantum device. Task-sufficient representations and mathematical guarantees The paper formulates exact equivalence of multi-time processes relative to a specified family of interventions, terminal observables, acceptance rules, and resource costs. For a finite linear family, it characterizes the corresponding task quotient and establishes its minimal dimension within linear encoders admitting exact recovery of the contract predictions. Approximate reductions are treated through explicit stability bounds. These bounds show how errors in unnormalized output moments, acceptance probabilities, and attempt costs propagate into conditional expectations and cost per accepted outcome. Low acceptance can amplify a small modeling error and erase an apparent resource advantage. A robust-selection result identifies the feasibility margins required when choosing a policy from approximate predictions. The framework thereby connects process reduction to a concrete accuracy requirement. Finite-sample certification and resource accounting The manuscript derives simultaneous finite-sample certificates for conditional task bias and expected cost per accepted outcome. The guarantees remain valid after data-dependent selection within a fixed finite candidate family, under the stated assumptions of independent reset attempts, bounded observations and costs, and an independently trusted ideal reference. The accounting includes rejected attempts and distinguishes systematic task bias from statistical sampling uncertainty. It also charges characterization, compilation, classical computation, and revalidation to the total resource objective. This distinction matters because a nominal reduction in the cost of one execution can require an unaffordable calibration campaign. A useful controller must improve the complete calculation at matched task accuracy and confidence. Reproducible numerical investigation A classical numerical study evaluates ten pulse policies across three correlation regimes and two contracted observables. The calculations include analytic population predictions, Gaussian trajectory sampling, density-matrix consistency checks, and repeated finite-shot calibration experiments. The results exhibit task-dependent protection choices: a sequence beneficial for one observable can introduce unnecessary error for another. They also distinguish the absence of a certified policy from a general claim that no feasible control exists. Conventional calibrated Hahn echo and the corresponding two-pulse sequence match the best control performance in this benchmark. The study establishes identification and certification results within its declared models; scalable compression, hardware advantage, and reductions in fault-tolerance overhead remain open research objectives. Meaning of the subordinator renormalization problem The title names an operational research problem: construct a change of temporal resolution together with a compressed memory representation and a consistent update rule that preserve all contracted predictions under the permitted controls. The challenge includes causality, complete positivity where applicable, normalization, conditional updates, approximation error, and total resource cost. A small collection of fitted moments is insufficient unless these properties can be maintained through subsequent interventions. The manuscript uses renormalization in the sense of scale change and retention of operationally relevant information. It formulates the conditions a useful reduction must satisfy rather than claiming a completed Wilsonian flow or a new universality class. Relevance and readership The work is intended for researchers in quantum computing, open quantum systems, quantum control, noise characterization, quantum error correction, stochastic processes, fractional calculus, and mathematical model reduction. Its broader engineering relevance is the connection between a model’s predictive sufficiency and the reliable computational output obtained for the resources consumed. The proposed research direction is to identify physical families in which the memory relevant to a useful task can be represented, learned, and updated more efficiently than a full process description. Manuscript contents Version 2.0 comprises 23 pages, four figures, four propositions, one corollary, a finite-sample certification theorem, mathematical appendices, a glossary of 47 terms, and 49 bibliographic references. The bibliography covers stochastic clocks and fractional analysis, quantum dynamical semigroups, environmental memory, process tensors, noise spectroscopy, control, fault tolerance, and statistical certification. About the author Dr. Marcos Eduardo Elias is a Brazilian engineer, mathematician, computer scientist, and entrepreneur based in São Paulo. He is Chairman of Instituto Ramanujan and works with Holosystems on quantum algorithms, stochastic modeling, and the connection between mathematical research and physical computation. His interests include open quantum systems, adaptive quantum–classical optimization, cryptography, and decision-making under uncertainty. Acknowledgments The author gratefully acknowledges Holosystems Quantum Computing Systems for the institutional and intellectual setting in which the
This work develops a mathematical and computational investigation of the Einstein–Bohr boundary problem by reformulating it as a problem of representation, projection, reconstruction, and empirical identifiability. Rather than beginning with a predetermined interpretation of quantum mechanics, the study asks a more constrained question: what mathematical structure would be required for an observer-independent carrier of physical states to be describable, reconstructable, and empirically distinguishable from standard quantum-mechanical explanations? A generalized carrier, denoted by Ω, is introduced as an algebraic-dynamical structure whose observable consequences arise through context-dependent projections. This formulation permits mathematical description without requiring a global, context-independent assignment of classical values. The resulting framework is examined against quantum contextuality, Bell/CHSH constraints, incomplete witness bases, information loss under projection, reconstruction ambiguity, dynamical consistency, and observational equivalence. A sequence of computational Model-Lab investigations then addresses a stronger problem: even if such a carrier can be mathematically represented, can it be empirically identified? History dependence, hidden memory, non-Markovian dynamics, causal breaks, system resets, and latent-state models are tested against increasingly strong quantum countermodels. These investigations show that several apparently distinctive signatures are insufficient by themselves. In particular, history dependence and memory can be reproduced by enlarged system–environment quantum models, and strong statistical evidence for memory does not automatically constitute evidence for an additional ontology. The analysis therefore proceeds to possible post-quantum escape routes. No-signalling supra-quantum correlations, nonlinear dynamics, complete-positivity boundaries, ancilla consistency, process-tensor descriptions, and higher-order quantum-process alternatives are examined as successive admissibility tests. These investigations motivate a hierarchy of constraints that any empirically meaningful extension must survive before a deviation from standard quantum modeling can reasonably be interpreted as evidence for additional physical structure. The final part develops a resource-bounded empirical discrimination program. Instead of allowing hidden environments or memory resources to grow without limit, the admissible quantum countermodel class is constrained by independently established physical resources. A synthetic memory-dimension experiment demonstrates how temporal process complexity can, under explicitly stated representation-dependent assumptions, provide a witness against a bounded-memory null class. Finite-sample simulations and adversarial null-model stress tests are used to explore the statistical behavior of this approach. The central conclusion is deliberately limited: Ω can be mathematically described within the developed model class, but mathematical describability does not establish its physical existence or unique empirical identification. Memory, history dependence, non-Markovianity, and unusual correlations are likewise insufficient on their own. Independent empirical warrant would require observations that cannot be reproduced by any admissible standard quantum model after environment, memory, causal, higher-order, and other relevant resources have been independently constrained. The work consequently transforms the original ontological question into a more precise experimental one: what observation would remain outside the equivalence class of all resource-bounded quantum-process explanations while continuing to satisfy the required probabilistic, causal, compositional, and physical consistency conditions? The accompanying computational artifacts document the Model-Lab simulations, identifiability tests, post-quantum model campaign, resource-bounded experiment, and adversarial null-model analysis. These numerical investigations are computational experiments and should not be interpreted as laboratory evidence for physics beyond quantum mechanics.
How much internal quantum memory is needed to reproduce a stationary stochastic process, and how does reducing that memory change the environmental resources required when output records are retained? This paper establishes exact quantum-source constructions and resource bounds under explicitly specified readout and retained-output conditions. A general completion theorem identifies the minimum Hilbert-space dimension for stationary triple data in the orthogonal-current-symbol source class: it equals the sum of the complex positive-semidefinite ranks of the middle-symbol slices. An attaining construction reproduces the entire canonical stationary order-two process. For the delayed trine process, the minimum classical hidden Markov model requires nine states at every non-independent parameter value. Quantum instruments reproduce the same complete output law using four-dimensional memory throughout the parameter range, with four dimensions proved necessary in a certified low-noise regime and three dimensions both sufficient and necessary on an explicit high-noise interval. The paper then separates reusable memory dimension from environmental dilation cost. On the certified high-noise interval, the exact one-step Pareto frontier consists of a three-dimensional source with recorded-channel Choi rank nine and a four-dimensional source with rank three. Here, Choi rank measures the minimum initially pure environmental remainder dimension for the channel retaining both the emitted classical symbol and final quantum memory. A separate mixed-support qutrit construction at noise parameter 0.99 improves complete-history costs and gives upper bounds close to universal lower bounds. These results show why optimizing a single step need not optimize a retained multi-step history. The analysis also distinguishes complete channels, fixed-input states and archive-only outputs, and demonstrates how access to a retained reference can distinguish generators with identical passive output statistics. Full-word proofs, algebraic complete-positivity certificates, a technical companion and reproducibility materials accompany the results. The exact intermediate memory boundary and complete-history optimum remain open. All results use standard quantum probabilities and apply to the stated operational resource models; they do not establish total hardware, energy or thermodynamic minima.
When does operational distinguishability contain sufficient information to identify physical structure? We address this question through a resource-relative framework of Operational Informational Distinguishability (OID), designed to investigate the mathematical consistency of identifiability across quantum states, information geometry, and physical processes. An operational observer is characterized by (\mathcal{D}=(\mathcal{A},\mathcal{M},\mathcal{R},\delta)), whose labelled outcome distributions define an operational signature and induce equivalence classes of physically indistinguishable realizations. We establish an exact reconstruction criterion: a proposed geometric assignment factors uniquely through the operational signature if and only if it is constant on these equivalence classes. This provides a necessary-and-sufficient condition for operational reconstruction, while separating identifiability from the additional requirements of local non-degeneracy and stability. For faithful finite-dimensional quantum-state manifolds, we establish the measurement–information-geometric hierarchy[g^{(\mathcal{M})}\preceq g^{\mathrm{SLD}}\preceq g^{\mathrm{BKM}}relating measurement-restricted Fisher information, the symmetric logarithmic derivative metric, and the Bogoliubov–Kubo–Mori metric. We clarify the directional attainability of the SLD bound and its distinction from simultaneous multiparameter attainability. As an explicit algebraic result, we characterize the operator span generated by diagonal phase modulation of cyclic-shift eigenstate projectors in the one-excitation sector: it is precisely the constant-diagonal Hermitian subspace, of dimension (N^{2}-N+1), leaving (N-1) independent population directions unresolved. Adjoining site-basis projectors restores informational completeness. This idealized construction is connected to experimentally realized entangled measurements of (W) states. We further extend operational distinguishability to quantum processes through tester-restricted signatures and divergences, explicitly separating signalling from intervention-defined causal influence. Finally, we introduce accumulated information-geometric path length as a candidate operational clock parameter, without identifying it with physical time. By relating these constructions to holographic information-distance bounds, bulk entanglement, conditional mutual information and recovery, and recent approaches to emergent geometry and informational time, we formulate a central testable question: can a common resource-relative distinguishability structure remain identifiable, stable, and compositionally consistent across states, processes, geometry, temporal ordering, and causality? The framework makes both constructive reconstruction and mathematically explicit obstructions possible, providing a falsifiable methodological program rather than presupposing the emergence or unification of physical structure.
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
We develop a conditionally closed reconstruction of quantum mechanics from exactly three physical axioms: microscopic ontic definiteness and finite localization, physical reality of the spacetime--vacuum substrate, and persistent causal source--response coupling. Wave functions, Hilbert spaces, complex amplitudes, density operators, the Born rule, commutation relations, Fock spaces, path integrals, completely positive maps, and Markovian dynamics are introduced only as derived mathematical or operational structures, not as additional physical axioms. The construction distinguishes the actual finite carrier and its causal history from the quantum state used to represent preparations, transformations, and measurement probabilities. It derives unitary dynamics from self-adjoint Hamiltonians, formulates spectral observables and probability currents, and states the explicit equilibrium, additivity, noncontextuality, and calibration conditions required for the Born representation. Measurement is described through instruments, pointer dynamics, stable records, weak values, continuous monitoring, diffusive and counting trajectories, and operational error--disturbance relations. Quantum trajectories remain record-conditioned predictive representations rather than automatically ontic paths. Composite systems, identical particles, spin, entanglement entropy, purification, steering, Bell correlations, dense coding, and no-broadcasting are developed on declared tensor-product and symmetry domains. Open-system dynamics are formulated through causal Volterra equations, memory kernels, initial-slip terms, auxiliary-mode realizations, and unitary dilations. Existence, positivity, complete positivity, trace preservation, no-signalling, and energy closure are treated as logically distinct properties. Semiclassical pseudodifferential calculus, controlled path-integral convergence, Ehrenfest-time bounds, semiclassical measures, decoherence, and macroscopic-record stability define the quantum--classical interface. Topological phases, defect-bound states, relativistic wave equations, infrared dressing, and effective quantum-field-theory domains are incorporated with explicit applicability and error conditions. Numerical spectral certification, statistical model comparison, twenty-five benchmark models, theorem-status ledgers, and a complete experimental statistical protocol provide falsification and replication criteria. The resulting framework preserves standard quantum mechanics on its validated domain while isolating finite-core and historical corrections as conditional, quantitatively bounded, and experimentally testable extensions. **Keywords** Quantum foundations; topological quantum mechanics; historical memory; three-axiom reconstruction; Born rule; quantum measurement; weak measurement; quantum trajectories; entanglement; spin and statistics; open quantum systems; Volterra equations; semiclassical limit; quantum topology; numerical certification; experimental falsification.