When does an observable readout contain all the information needed to determine its underlying source, and when does source information remain inaccessible? This paper extends Shadow Theory’s source–readout framework by distinguishing information preserved in the underlying dynamics from information accessible through a specified class of observations. It develops a conditional source tetralemma, quantitative bounds on hidden information from Bell violations, and operational criteria for distinguishing sealed information from information that can become observable. Under explicitly stated assumptions concerning definite outcomes, measurement independence, and conditional no-signalling, the paper derives lower bounds on source information missing from an initial classical readout. It also examines operationally indistinguishable surrogate models, reversible dynamics that preserve information while restricting access, and finite-resource witnesses of incomplete readouts. The results distinguish mathematical conclusions from physical assumptions and model-specific applications. They do not establish a unique underlying ontology or claim that Bell violations alone prove Shadow Theory. The accompanying Python verification script checks specified numerical bounds, finite constructions, and manuscript consistency conditions. It uses the Python standard library and includes exact rational arithmetic. Version 3.1. Author: Jeremy Rodgers, independent researcher.Project website: https://www.everythingequation.comDOI: 10.5281/zenodo.23077474
When does an observable readout contain all the information needed to determine its underlying source, and when does source information remain inaccessible? This paper extends Shadow Theory’s source–readout framework by distinguishing information preserved in the underlying dynamics from information accessible through a specified class of observations. It develops a conditional source tetralemma, quantitative bounds on hidden information from Bell violations, and operational criteria for distinguishing sealed information from information that can become observable. Under explicitly stated assumptions concerning definite outcomes, measurement independence, and conditional no-signalling, the paper derives lower bounds on source information missing from an initial classical readout. It also examines operationally indistinguishable surrogate models, reversible dynamics that preserve information while restricting access, and finite-resource witnesses of incomplete readouts. The results distinguish mathematical conclusions from physical assumptions and model-specific applications. They do not establish a unique underlying ontology or claim that Bell violations alone prove Shadow Theory. The accompanying Python verification script checks specified numerical bounds, finite constructions, and manuscript consistency conditions. It uses the Python standard library and includes exact rational arithmetic. Version 3.1. Author: Jeremy Rodgers, independent researcher.Project website: https://www.everythingequation.comDOI: 10.5281/zenodo.23077474
This paper develops task-relative reader certification within Shadow Theory’s source–readout programme. It asks how many source copies are needed to validate a fixed quantum reader, and when access to its retained measurement records reduces that cost compared with observing only its final correct-or-incorrect decisions. The reader is fixed before validation and must return a sign after each complete experiment. A trusted evaluator knows the preparation label for scoring, while the reader does not. The analysis distinguishes terminal-error observations, records with trusted ancillary information, and readable measurement trajectories governed by a shared physical response model. For terminal-error validation, the paper establishes exact finite-budget tests and sequential likelihood tests, together with nearly matching information-theoretic lower bounds on expected source consumption. An unrestricted-record result shows why additional archived data alone need not improve certification: an advantage requires specified information or response constraints. A separate trusted-seed construction gives an exact information-projection test. The central quantitative comparison concerns a fixed fourteen-copy reader in a trusted shared-visibility family. To certify a maximum label error of one percent, a trajectory-based validator achieves a false-certificate probability of at most one in 1,048,576 and a nominal acceptance probability of at least 95 percent, using no more than 720,160 source copies. Under the same preparation and physical-response promises, every validator restricted to terminal errors and meeting the same acceptance requirement needs more than 1,992,371 source copies in expectation. At the exact nominal device, an uncapped trajectory-based test accepts almost surely with expected consumption below 254,746 copies. A separate robustness analysis extends likelihood-test validity to a quantified class of conditional response deviations. Finite-cap guarantees and expected stopping costs remain explicitly distinguished. The results demonstrate a certified resource advantage from access to retained classical measurement trajectories, rather than merely an improvement over one chosen terminal-error test. Supporting materials provide the fixed reader, exact certificates and reproducibility procedures. All guarantees depend on the stated preparation, response, information-access and deployment-stability assumptions. Certification concerns the nominated reader’s decision error; it does not establish complete quantum-instrument equivalence or identify an underlying source. The analysis uses standard quantum probabilities within Shadow Theory’s research programme.
This paper develops phase-sensitive source–readout constructions within Shadow Theory’s research programme. It asks how a relative-phase distinction, invisible in separate mode intensities, can be converted into stable detector records under bounded coupling, finite source lifetime and preparation uncertainty. A complete quantum instrument connects a two-mode source to a coherent reader and terminal detector flags. Every trial uses one original source preparation, with conclusive, null and loss outputs explicitly retained. The construction includes arbitrary inert reference systems and distinguishes coherent quantum outputs from classically registered records. The main results establish: • A sharp attainable limit on error-free conclusive detection under bounded coherent coupling and independent irreversible source loss. • A separate optimum for a bounded jump-hazard model, together with a finite collision realization, showing why the two apparatus models require different resource accounting. • An analytic minimax tradeoff between conditional error and guaranteed conclusive probability under joint amplitude, phase and visibility uncertainty, including uncertain upstream attenuation. • An exact separation between a calibrated entrance filter and uncertain common conversion dynamics, followed by sharp robustness bounds for imperfect matching based on controlled-path overlaps. The analysis keeps source preparation, reader dynamics, retained outputs and permitted measurement access explicit. Retaining a loss output or reference does not automatically make it accessible to the decoder, and agreement of detector counts does not establish equivalence of complete quantum outputs. The accompanying technical companion develops absorbing detector models, complete retained-output comparisons, finite charge-reference measurements, preparation-resource requirements, and calibration and adaptive monitoring methods. Supporting code and verification materials accompany the manuscripts. These are mathematical apparatus constructions within Shadow Theory’s source–readout programme, using standard quantum probabilities and stated preparation and control assumptions. The results do not derive the Born rule or establish a biological or consciousness mechanism.
This is Paper II of the seven-paper Shadow Theory foundational series. A readout can discard genuine source-level distinctions without becoming inadequate for every question. This paper gives an exact criterion for when the lost distinctions matter: a target is solvable from a readout precisely when its correct answer is constant across each readout fiber. If two source states have the same readout but different correct answers, no deterministic construction using that readout alone can answer the target correctly in both cases. When exact solvability fails, the paper identifies the compatible-answer set as the least uniformly sound set-valued answer available without further information. It then proves a lower bound on every successful extension: any extension sufficient for a target must distinguish every pair of source states with different correct answers. The joint readout-and-answer image is the coarsest sufficient extension in this formal, set-theoretic sense. The paper also makes an important boundary explicit. This universal minimal object characterizes the least distinctions that any sufficient repair must retain; because it refers to the correct-answer map, it does not itself provide an operational method for extracting answers from the original readout or establish a physically measurable extension. A concrete repair must independently supply and justify the added structure. The framework is realized for flat U(1) connections on a circle. A curvature-only readout collapses all flat connections, yet the spectrum of the charged covariant Laplacian distinguishes different holonomies. The paper proves that the spectrum determines holonomy only up to inversion, so the minimal completion for this spectral target is strictly coarser than full holonomy. A finite-time projected-dynamics result then gives the exact criterion for when a readout admits an autonomous deterministic propagator. Paper II builds on Paper I’s source–readout non-equivalence and descent framework. It prepares the later papers on canonical minimal completion, geometric realization, observable quotients and projected dynamics, identifiability, and the RS2 bulk-to-brane physical witness.
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.
STATUS (18 October 2026). The physics programme that motivated this work was concluded in October 2026 and its claim of a unified derivation withdrawn. The results in this paper do not depend on that programme and stand as stated. Can an exact account of recorded events also determine what happens next? We examine this question in a finite quantum model with 48 preparations and an apparatus with ten distinguishable outcomes. Two reversible evolution rules reproduce exactly the same first-use specification but predict different results when the apparatus is used again. A separate example fixes one evolution rule: two possible histories then have identical counts of reads, commits and service events, yet different probabilities for the next outcome. Counts alone are therefore insufficient for prediction in this model. What remains visible depends on the observation. At eight preparations, even the complete individual-read distributions agree between the two rules, while correlations between the reads distinguish them. We classify two explicitly specified families of observations and determine exact ranges for the simpler family, showing both how distinctions are lost and how they can survive. The results separate event accounting, the choice of evolution, retained memory and the conversion of records into measured responses. They are conditional finite-model results, not a derivation of a physical dynamics or a measured coupling. The contribution is a set of exact counterexamples and classifications, rather than new principles of quantum theory. Exact computations and explicit proofs identify the additional response, weighting and sampling choices that a predictive physical interpretation must supply. Version 0.2 incorporates corrections following an author-requested preprint review. The deposit supplies the PDF, editable LaTeX with three TikZ figures, bibliography, exact fixture data for 96 two-read processes over 48 preparations, and a portable Python/SymPy verifier. The revised verifier passes 2,926 exact assertions. These are conditional finite-model results; no physical law, bridge, weighting or sampling measure is selected. The unchanged historical audit sources are available in a separately linked companion archive. Frozen audit sources and INT99 result dossier: https://doi.org/10.5281/zenodo.22541080.
Repository for the manuscript "Extending Bell’s Representational Framework: Modeling the Quantum and Classical Regimes" and its supporting verification artifacts. The paper demonstrates that while Bell’s single-stage theorem is mathematically sound within its algebraic scope, a two-stage contextual extension preserves strict locality, setting independence, and operational no-signaling while accounting for Bell-violating quantum correlations up to Tsirelson’s bound. Includes the complete, machine-checked Lean 4 with Mathlib formalization package (zero sorry, standard axioms) and Python linear programming verification scripts.