A recurring assumption in emergent-physics programmes is that once a fundamental description is given, the decomposition of the world into independently preparable subsystems comes for free. We show that on a substrate not supplied with a subsystem factorisation this assumption splits into two separate, checkable layers. In the finite case we characterise the possibilistic layer completely, and we resolve the preparation layer for two reference classes: the full simplex of preparations, and the strictly positive cylindrical-conditioning families; the general preparation layer remains open. The arena is a finite configuration set ${\Omega}$ carrying a reference admissible subset, two effective projections ${\Pi_A} \colon {\Omega} \to {O_A}$ and ${\Pi_B} \colon {\Omega} \to {O_B}$ that are not assumed injective, and cylindrical admissibility conditions combined by intersection; no factorisation ${\Omega} \simeq {\Omega}_A \times {\Omega}_B$ is assumed at any point. At the possibilistic layer, we prove that the pairs of local outcome sets on which joint interrogation is margin-stable and jointly rectangular — the independence blocks — are exactly the nonempty rectangles (bicliques) contained in the projected support relation. At the preparation layer, we prove a benchmark and a criterion. The benchmark: on any block, if all probability measures on the underlying support are admissible preparations, every joint outcome law, in particular every product law, lifts to the substrate; the absence of a supplied substrate factorisation alone therefore obstructs nothing. The criterion: for the family of normalised cylindrical conditionings of a strictly positive reference weight matrix $W$, closure under products of independently locally conditioned states holds if and only if $W$ has rank one. A minimal countermodel exhibits a complete rectangular support whose induced preparations are nevertheless correlated: support rectangularity does not imply preparation independence. A type discipline runs through both layers: states of one side obtained by conditioning on the other are steered conditional states, not local preparations, and admitting them manufactures spurious witnesses. The individual mathematical ingredients are elementary or standard; the contribution is their typed assembly into a proposed finite prerequisite contract of support and preparation criteria for emergent effective subsystems over an admissibility structure without a supplied subsystem factorisation. The hypotheses abstract the composition problem motivated by the non-injective foundations programme, but their realisation from the programme's axioms is not derived here, and the physical necessity of the contract itself is not derived from an operational theory. Interpretive reading (structural, not a result): the absence of a supplied subsystem factorisation does not forbid independent effective subsystems; it relocates their independence from an inherited property of the substrate to an emergent property of the projected support and of the preparation weights.
A recurring assumption in emergent-physics programmes is that once a fundamental description is given, the decomposition of the world into independently preparable subsystems comes for free. We show that on a substrate not supplied with a subsystem factorisation this assumption splits into two separate, checkable layers. In the finite case we characterise the possibilistic layer completely, and we resolve the preparation layer for two reference classes: the full simplex of preparations, and the strictly positive cylindrical-conditioning families; the general preparation layer remains open. The arena is a finite configuration set Ω carrying a reference admissible subset, two effective projections ΠA:Ω→OA and ΠB:Ω→OB that are not assumed injective, and cylindrical admissibility conditions combined by intersection; no factorisation Ω≃ΩA×ΩB is assumed at any point. At the possibilistic layer, we prove that the pairs of local outcome sets on which joint interrogation is margin-stable and jointly rectangular — the independence blocks — are exactly the nonempty rectangles (bicliques) contained in the projected support relation. At the preparation layer, we prove a benchmark and a criterion. The benchmark: on any block, if all probability measures on the underlying support are admissible preparations, every joint outcome law, in particular every product law, lifts to the substrate; the absence of a supplied substrate factorisation alone therefore obstructs nothing. The criterion: for the family of normalised cylindrical conditionings of a strictly positive reference weight matrix W, closure under products of independently locally conditioned states holds if and only if W has rank one. A minimal countermodel exhibits a complete rectangular support whose induced preparations are nevertheless correlated: support rectangularity does not imply preparation independence. A type discipline runs through both layers: states of one side obtained by conditioning on the other are steered conditional states, not local preparations, and admitting them manufactures spurious witnesses. The individual mathematical ingredients are elementary or standard; the contribution is their typed assembly into a proposed finite prerequisite contract of support and preparation criteria for emergent effective subsystems over an admissibility structure without a supplied subsystem factorisation. The hypotheses abstract the composition problem motivated by the non-injective foundations programme, but their realisation from the programme's axioms is not derived here, and the physical necessity of the contract itself is not derived from an operational theory. Interpretive reading (structural, not a result): the absence of a supplied subsystem factorisation does not forbid independent effective subsystems; it relocates their independence from an inherited property of the substrate to an emergent property of the projected support and of the preparation weights.
The companion paper on effective composition characterises, for a finite substrate without a supplied subsystem factorisation, the possibilistic support layer completely and the preparation layer for two reference classes, and explicitly leaves open the states-and-effects layer of the resulting composition contract. We resolve that layer's finite, mono-system, and bipartite-composition questions, keeping the general preparation layer and the tensor product exactly as open as the companion paper left them. The primitive family arising from cylindrical conditioning of a strictly positive, rank-one reference measure is not itself convex: it is finite while its own convex hull is a continuum, unconditionally, for any local outcome set of size at least two. An explicit classical-randomisation postulate closes it onto the full classical probability simplex, independently of the reference measure's rank; rank governs composition of the primitive family, not the shape of its closure once randomisation is added. Simplicial geometry fixes the mathematical representation of affine effects as vectors in a cube, but not their physical availability as measurements; a weak coarse-graining axiom already yields the entire Boolean skeleton of sharp effects for free, while the full continuum of effects requires a further, dual randomisation postulate on the measurement side. Under two further, distinct, and logically independent axioms — one for a common classical control resource, one for the physical existence of a composed bipartite effect — the pointwise product of two local effects is proved unique, not postulated, and local tomography holds exactly when the local effect families linearly span their ambient functional spaces, equivalently when they separate their local states and contain the unit effect in their linear span. All results are finite, exact, and reproduced by committed scripts using rational arithmetic. Interpretive reading (structural, not a result): the finite hypotheses examined here force, successively and for free, a classical, simplicial operational skeleton — convex states once mixing is supplied, a Boolean effect algebra once coarse-graining is supplied, and exact local tomography once spanning local families are supplied — under precisely identified imports, and produce neither a quantum state geometry nor the Born rule. Locating exactly how much operational structure a finite admissibility contract yields for free, and where every further richness must instead be imported, is the intended service of this result to the non-injective foundations programme: it marks the boundary this classical skeleton cannot cross on its own, and hands that boundary, precisely typed, to whatever module or phase law is proposed next.
The Admissibility of Natural Physics, Part I begins where an admissibility-first reconstruction of single-system quantum mechanics ends. Its central question is not whether the familiar tensor-product formalism can be assumed, but whether any physical composition law can be derived without importing composite systems, global state spaces, entanglement, locality, or signalling as primitives. The book develops a disciplined reconstruction of binary quantum composition from operational and structural requirements. It first records the exact content and limitations of the inherited single-system closure, establishes dependency and non-circularity statutes, and introduces the possible object of natural physics only as a provisional target ledger rather than as an assumed ontology. It then examines joint preparation, product states and effects, marginal consistency, operational no-signalling, minimal and maximal probabilistic composites, local tomography, and the classification of admissible tensor-product representations. Particular attention is given to the distinction between a mathematical representation theorem and the uniqueness of a physical composition rule. Real, complex, quaternionic, Jordan-algebraic, minimal, maximal, restricted, and non-tomographic alternatives are compared under explicitly declared admissibility conditions. The complex Hilbert-space tensor product is recovered only on branches satisfying the required factorization, coherence, scalar, and operational closure conditions. Where several inequivalent composites survive, the result is a classified family rather than a falsely asserted uniqueness theorem. Entanglement is introduced only after composition has been commissioned. It is defined as the failure of an admitted joint state to belong to the convex closure of admitted product preparations. The analysis proves, within the resulting predictive grammar, that entanglement is a property of composite-state geometry, not an additional force, substance, interaction mechanism, or signalling channel. Throughout, the argument enforces quotient primacy, refinement stability, finite diagnostic closure, regeneration stability, explicit dependency receipts, local termination, and the possibility of Undefined as a legitimate scientific outcome. Part I therefore supplies neither a speculative ontology nor a presupposed many-world formalism. It provides a conditional classification theorem for binary physical composition and identifies precisely what remains to be established before interaction, repeated composition, particle identity, locality, fields, symmetries, and particle content may be addressed.
Quantum mechanics is the effective theory of physically real unresolved admissible structures and their resolution. This paper establishes the minimal axiomatic foundation from which this claim follows: physical structure is derived from a single primitive, the local structure of admissible transitions between observable states. Four axioms govern this structure: local projective admissibility (A1), structural non-injectivity (A2), admissibility as non-premature selection (A3), and projection locking (A4). Along the transitions A2 asserts to be generically non-injective, A1 and A2 give immediate-image information loss and structural fluctuations; neither permanent non-recovery nor the arrow of time follows, since non-invertible steps admit cycles. From A3, we derive the proto-state as a physically real unresolved configuration shared between two successive states, and show that admissibility forces the retention of phase coherence. Under an explicit representation-theoretic reading of the admissible fibre, A3 forbids invariant factorisation and hence imposes irreducibility. For a carrier of dimension greater than one generated by a conjugate pair, irreducibility implies non-commutation. It does not, however, make the commutator central or select a finite Heisenberg group: an explicit S3 countermodel satisfies the extracted carrier contract and violates that conclusion. The Heisenberg carrier used by the spectral programme therefore remains a supplied realisation, and must be distinguished from its associated Weil representation. From A4, we derive the discrete character of quantum transitions as a consequence of the interaction between continuous Born–Infeld saturation and the discrete shell structure of the observable space. The foundation is stated with the point at which it stops short of carrier selection.
A finite joint-query interface admits a single shared classical record if and only if its tested continuation-word algebra embeds faithfully into a commutative algebra of records — if and only if it admits a finite Boolean-record defender — if and only if a finite system of unit, product, recovery, positivity, and state–effect equations is solvable. The failure of every commuting completion is the precise definition of irreducible joint constraint. This is the Sep/IJC Representation Theorem, and it is the centerpiece of The Enforceability of Distinction. What this paper is A standalone formal-foundation paper for finite-interface physics. Self-contained: no prior exposure to the Admissibility Physics Framework is required. The mathematical core is a single biconditional theorem about finite joint-query interfaces, stated and proved in §11 using only finite linear-algebraic content over ℝ. The paper is built on a deliberately small primitive spine of three commitments: Physical identity is finite admissible continuation identity. A physical state is what it can still do. A physical distinction is a finite enforceable separator of continuation profiles. Distinctions are operational, not abstract. Physical distinctions carry positive enforcement cost. The positive cost floor is the only foundational scalar input. Everything else — the physical quotient, descent of distinctions and filters, the enforcement ledger, convex mixtures from finite classical control, and the continuation-word quotient algebra — is a forced construction. The finite-interface ingredients (finite query family Q, finite tested word set 𝒯, operational resolution, positive resolved floor) are not postulates: they are consequences of a finite act of interrogation plus the positive-cost spine. The Sep/IJC Representation Theorem Let (Γ, Q, 𝒯) be a finite joint-query interface with finite query family Q, finite tested word set 𝒯, finite operational resolution, and positive resolved floor. Let 𝒜Q,𝒯 be the tested continuation-word quotient algebra. Then the following are equivalent: (Γ, Q, 𝒯) admits a commuting-extension defender; 𝒜Q,𝒯 embeds faithfully into ℝΛ as a commutative record representation, for some finite labelling Λ; The associated finite Boolean-feasibility system over unit, product, recovery, positivity, and state–effect equations is solvable. The Sep branch is exactly the case where the queried interface fits inside one shared classical record. The IJC branch is the precise failure of every faithful commuting continuation completion. IJC is not a synonym for “quantum.” It is an interface-relative algebraic verdict on whether a single Boolean-record completion exists for the tested word behavior. Quantum interfaces are an empirical instance of the IJC branch — but the IJC classification is independent of any specific physical realization, and there is no postulated identification of IJC with quantum mechanics anywhere in the paper. Surrounding results Refinement stability. Sep is monotone under coarsening of 𝒯; IJC can be revealed by refinement but cannot be erased by it. Branch verdicts are stated relative to both 𝒯 and the chosen operational resolution. Directed finite-test limits. A coherent projective family of finite-stage defenders is required for a global Sep limit; Sep at every finite stage alone is not sufficient. Compactness and bounded-atom hypotheses recover a projective-limit defender. ε-faithful defenders and finite-margin robustness. An approximate-defender theory with explicit operational-norm tolerances; the IJC margin m is preserved under finite-table perturbations of size below m/2. Continuation-word quotient algebra. Typed partial-product structure, incompatible-concatenation rule, contextual congruence, and the two-sided ideal property proved before the quotient is invoked. No-added-resource criterion. Operational sufficient tests and an explicit checklist precede the cost-monotonicity theorem; passive post-processing is the canonical witness. Worked models. A fully worked Sep defender (two classical bits); a Sep with positive interface cost (shared bus); a sequential IJC example (the explicit two-query table); a coupled-but-classical example (shared classical bath). A numerical ledger/floor case study and an explicit κΓ-calibration sensitivity table accompany the foundational sections. Process-category axiom block. A finite APF process-category axiom block; the word algebra realised as a typed path algebra equivalent to a free word algebra modulo contextual-equivalence relations; the defender restated as a partial Boolean-record functor. Trigger-condition discipline Every load-bearing structural theorem is paired with the explicit conditions under which it holds, named at point of use: Cost monotonicity — no-added-resource coarse-graining; Ledger additivity — factorized support; Independent counting — ledger-independent resolution; Robust-floor extension beyond explicitly finite protocols — compact robust-interface conditions R1–R4 (continuity, lower-semicontinuity, bounded atoms, projective coherence); ε-faithful defenders — explicit operational-norm tolerances and finite-margin half-perturbation regime. Each theorem-local condition is stated alongside an explicit failure-mode description and conservative-counting examples (shared coarse record, independent records, coupled discriminator). Reviewers see what the conclusion depends on without searching the paper. Bridges to standard frameworks Section 14 supplies a full finite-static bridge from APF to the published landscape of foundations programmes: a generalized-probabilistic-theory translation (effect algebras, ordered ∗-algebras, accessible GPT fragments, cone equivalence) and finite-static equivalence propositions for Spekkens-style noncontextuality, Fine-style joint distributions, joint-measurability and commuting-dilation criteria, sheaf-theoretic contextuality, sequential instruments and order algebras, the resource-theoretic hierarchy, epBA minimal Boolean embeddings, and the NPA hierarchy with finite-level commuting certificates. In the static finite case: Sep ⇔ commuting dilation ⇔ noncontextual model ⇔ faithful Fine joint distribution ⇔ global Bochner section. The Sep/IJC verdict is a single algebraic invariant that all of these standard frameworks witness from different sides. The novelty boundary is explicit: this paper’s contribution is the four-fold combination — continuation identity + positive cost + ledger bookkeeping + word quotienting — not the standard equivalence between finite Boolean models and commutative algebras. What this paper does not claim This paper does not derive Hilbert space, complex amplitudes, the Born rule, tensor products, density matrices, or the Standard Model. Promoting the commutative record representation to a complex-Hilbert-space construction requires record-positivity and composite-tomography assumptions that are isolated and named in §15. Those assumptions are deferred to a companion paper on quantum structure. This paper does not assert that quantum systems are the only IJC instance, or that classical systems are the only Sep instance. The classification is interface-relative. This paper does not commit to a substance-level reading of admissibility. The Admissible Possibility Space is set-theoretic; the framework’s commitment is structural, not metaphysical. Code and reproducibility The companion repository contains the v8.8 manuscript, the bundled apf/ codebase (every theorem traces to a named check function, including the Phase 21 inseparable-IJC bridge check check_T_inseparable_IJC), an interactive D3.js dependency DAG for the full Admissibility Physics Framework, and a one-click Colab walkthrough notebook. The repository and Colab notebook are being refreshed alongside this v8.8 deposit and will carry the updated v8.8 vocabulary plus the Phase 22 codebase rev (Sep/IJC representation theorem and continuation-word algebra checks) as those land. The links below are stable across the refresh; their content updates in place. GitHub repository — full codebase, manuscript .tex/.pdf, AI-onboarding bundle, audit-native context pack, theorem-by-theorem traceability. One-click Colab walkthrough — reproduces every Paper 1 result from first principles, no setup required, runs end-to-end in your browser. Interactive dependency DAG — explore the bank-registered theorem graph; click any node to surface its check function and dependency chain. Why this paper matters for the series Paper 1 is the bedrock of the Admissibility Physics Framework. v8.8 fixes that bedrock as a finite-interface algebraic theorem with an explicit primitive boundary — positive enforcement cost — and explicit theorem-local triggers, in language an external reviewer can audit without prior APF exposure. The Sep/IJC dichotomy, stated entirely within finite linear algebra over ℝ, is the regime classifier that downstream APF papers (Paper 2 on Standard Model gauge structure, Paper 5 on quantum reconstruction, Paper 6 on dynamics and gravity, Paper 8 on the Admissibility-Capacity Ledger) inherit and refine. The companion quantum-structure paper promotes the commutative record representation to a complex-Hilbert-space construction by adding record-positivity and composite-tomography hypotheses. The argument-first companion volume to this paper — the Paper 1 main body, currently v4.8 at 10.5281/zenodo.18604678 — is being brought up to v4.9 alignment with the v8.8 spec on a parallel track. About the APF series. The Admissibility Physics Framework is a ten-paper derivation chain plus core infrastructure, building physics from finite enforcement of distinction taken seriously as a constitutive commitment. Paper 1 (this paper) is the formal bedrock; downstream papers extend the chain through the Standard Model gauge group, fermion content, quantum formalism, Loren
The quantum structure sub-programme comprises three companion papers on the binary icosahedral group 2I, plus one independently published result. Q1 proves an exact, unconditional Fourier-support rigidity theorem in the finite Weil representation of the Heisenberg group, with a precise no-go corollary for support-, rank-, and Gram-based diagnostics; it establishes no phase coherence, singlet correlator, Tsirelson bound, or Born rule. Q2 proves an exact finite-group fact: the spin-21 and spin-23 representations of 2I induce the same Cayley-graph Laplacian eigenvalue; it establishes no Casimir/isotropy normalisation, Born rule, Tsirelson-type bound, or SU(2) fixed-point/sector-selection argument. Q3 proves a theorem conditional on an explicit, undemonstrated hypothesis: given that a bipartite state on a supplied composition is invariant under the diagonal action of 2I — not derived from admissibility or from Born–Infeld indiscernibility — the state is uniquely the SU(2) singlet, with an explicit Casimir correlator, for all five admissible sectors of 2I; it does not derive that invariance hypothesis, phase coherence, or the Born rule. No chain currently connects these three results to each other or to the structures of quantum mechanics. The Bell paper, published independently in Quantum Reports, establishes the structural non-applicability of Bell-type factorizability in non-injective effective descriptions; the proof of that central theorem uses only non-injectivity and informational completeness. This note records the current, narrow scope of each constituent and the open problems that remain.
Paper 7 of 11 — A General Theory of Answerability The eleven-paper TUS OS mathematical research programme Abstract This paper develops a structural theory for classifying how representation-resource requirements change when the operational obligation imposed on an independently fixed native system is lawfully strengthened. Building on the contract-relative resource law of Paper 6, it asks which source-level features of a strengthening determine or constrain the resulting resource transition. The theory fixes the native system, weak and strong contracts, realisation category, tolerance and charged resource before optimisation. A finite-baseline gate requires the weak contract to possess a finite-resource realisation, preventing pre-existing category nonrealisability from being misclassified as a strengthening-induced transition. The source-level object is a Contract Distinction System (CDS), which records the native configurations challenged by the stronger obligation, required distinctions or recovery targets, success rules, inspection boundaries and interface/commonality structure. Semantic challenge refinement and CRC cofinal/refinement equivalence control dependence on alternative finite challenge presentations. A Certified Observability Transport Theory (COTT) then maps licensed source-level facts into necessary resource lower bounds inside a fixed representation category and tolerance regime. The resulting directed finitary demand profile supports two distinct mechanisms. Internal divergence occurs when a single strengthened contract contains finite restrictions of arbitrarily large certified demand and can therefore exclude every finite-resource strong realisation in the declared category. Family divergence occurs when every member of a parametrised family remains finitely realisable while the additional resource induced by strengthening grows without bound across the family. Lower recognition is kept logically separate from upper-side existence: bounded certified demand is not treated as an existence theorem, and finite regimes require independent construction, compactness/gluing or another valid upper certificate. Conditional on finite baseline feasibility, the resulting pointwise classifier distinguishes resource-neutral, strict finite, finite-resource breakdown and UNRESOLVED transitions, with incrementally unbounded finite separation carried separately as a family-scaling modifier. Several exact witnesses separate these regimes. With three native labels, the same coarse distinction graph K3, representation category, Hilbert-dimension resource and discrimination threshold fixed, changing only interface commonality produces an exact minimum-dimension transition from 2 to 3 throughout 2/3 < τ ≤ 1/2 + √3/4. Thus interface structure can itself be representation-resource-bearing. For the canonical TUS OS target, the complete static Atlas has exact minimum Hilbert dimension 4, whereas recovery-complete selected-line instrument access has exact minimum 64, giving an exact strict-finite transition 4→64. The weaker state-only common-CPTP problem remains unresolved within 32≤d≤64, demonstrating that the stronger interface theorem cannot be transferred backward through a forgetful map. For periodically modulated decay processes, every finite member remains finitely realisable while the contract-induced capacity gap diverges with family size. For the fixed dual-Poisson process, every positive worst-case transparency strengthening eliminates all finite-resource strong realisations in the declared autonomous one-copy classical–quantum category. A synthetic Countable Pairwise Identity Ladder supplies a cross-interface internal-divergence test, while the Fanizza–Lumbreras–Winter result marks the separate outer boundary of baseline category nonrealisability. Together, the results establish that operational observability is a resource-bearing input to quantum realisability without being invariably resource-increasing. Resource transition depends on the typed structure of the operational obligation—not merely native-state count, predictive-state cardinality, distinction count or coarse distinction graph. Supporting General Theory Programme This paper is Paper 7 in the TUS OS quantum-operational and Answerability research programme. Building on Paper 6’s contract-relative resource theory, it develops operational observability and a structural classification of contract-induced resource transitions, distinguishing resource-neutral, strict finite, finite-resource breakdown and unresolved pointwise outcomes, with family divergence carried separately as a family-scaling modifier while separating lower-bound certification from constructive realisability. Papers 8–9 then move to Answerability as a generic mathematical object, developing the resource geometry of answerable inference and the Answerability 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 BreakdownExtends the programme 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 the structural classification theory for contract-induced representation-resource transitions. It introduces the Contract Distinction System (CDS) as a representation-independent source description of the additional distinctions, recovery targets, challenge structure and interface/commonality obligations introduced by lawful contract strengthening; semantic challenge refinement and CRC cofinal/refinement equivalence to control presentation dependence; and a Certified Observability Transport Theory (COTT) that maps licensed source-level structure into necessary category- and tolerance-specific resource lower bounds. The resulting directed finitary-demand theory separates internal divergence within one fixed strengthened contract from family divergence across finitely realisable members, while keeping lower recognition logically independent from upper-side construction or compactness/gluing. Conditional on finite baseline feasibility, the pointwise classifier distinguishes resource-neutral, strict finite, finite-resource breakdown and UNRESOLVED transitions, with incrementally unbounde