This paper is Part II of The Pre-Emergence Origin of Probability trilogy. Part I develops the structural requirements for finite recurrent stability before spacetime. Part II asks when persistent boundary-readable structure can support numerical probability. Part III examines what probability-status remains after boundary loss, before numerical weighting, and under what narrower conditions Born-form weighting may follow. The paper analyzes how probability-measure status may arise within a closed deterministic description rather than being assumed as a primitive numerical rule. A closed description cannot appeal to an external observer, hidden weighting convention, retained label, post-outcome selection, or independently supplied probability measure to explain its own probability assignments. Numerical probability must instead be supported by structures and relations admitted within the described system. The analysis begins with the requirements for persistent structured identity. Persistent identity is treated as recoverable cross-state relational distinction rather than exact sameness, repeated naming, scalar aggregation, or externally preserved memory. Within the tested structural registry, persistent refinable identity requires ordered dependence, a sufficient stabilization architecture, distributed relational structure, recurrence, bounded recoverability, and noncollapse of the distinctions being preserved. Bounded recurrent relational correction is classified as weak oscillatory form in a deliberately structural sense. The classification does not establish a physical wave, sinusoidal motion, exact periodicity, frequency, propagation, dynamics, mechanism operation, or physical carrier. It identifies a recurrent recoverability architecture that a later realization would have to preserve. The paper then develops the transition from persistent structure to boundary observability. Representation-sensitive bulk descriptions may depend on phase origin, refinement history, decomposition, internal labels, subpart identity, or other distinctions that do not survive admissible boundary readout. Under admissible-observable indistinguishability, boundary-readable observables factor through an emergence-boundary quotient that preserves only the distinctions carried by the admitted observable family and surviving the declared transport relation. The boundary quotient does not itself provide probability. It supplies a local architecture of boundary-readable alternatives and permits the admission of candidate nonnegative contribution scalars. Neither the alternative carrier nor a candidate scalar establishes scalar uniqueness, scalar closure, additivity, measure realization, normalization, or probability interpretation. Numerical probability-measure status becomes available only under a narrower cumulative condition package. The package requires an exact finite carrier, a finite positive event measure, a normalized scalar component on the same carrier, exact scalar-measure compatibility, one-scalar factorization of every admitted weight-bearing map, exclusion of independent weight-bearing invariants, pre-outcome assignment, absence of an external weighting source, and a declared scalar-only predictive regime. Additivity, commensurability, regularity, positive scale, finite nonzero total, and normalization remain separately controlled conditions within that route. Under those conditions, normalized scalar weights may receive conditional probability-measure status inside the declared local regime. This is not an unconditional derivation of probability from determinism. The result does not establish unrestricted probability, universal scalar representation, a global probability law, objective chance, stochastic dynamics, collapse, measurement theory, physical realization, or a final physical theory. Within the trilogy, Part II therefore supplies the middle structural layer: persistent recurrent structuretoboundary-readable alternativestocandidate scalar contenttoconditional numerical probability-measure status. Part III begins from a different question. It examines what remains when a boundary-readable description loses the ability to guarantee which admissible alternative obtains, before any numerical scalarization is supplied. Part II provides the scalar, measure, normalization, compatibility, and realization-burden architecture inherited by that later analysis, but it does not pre-establish the boundary-loss results of Part III. ### Revision note This revision is a substantial reconstruction and trilogy integration rather than a minor editorial update. The derivational architecture, definitions, condition packages, failure boundaries, dependency order, and claim-scope controls have been revised throughout. The manuscript has also been rewritten in new prose to present the argument as Part II of The Pre-Emergence Origin of Probability trilogy. Major changes include a clearer separation of persistent identity, ordered dependence, stabilization, distributed relational recurrence, weak oscillatory form, boundary observability, candidate scalar status, scalar closure, measure realization, normalization, and conditional probability-measure status. The emergence-boundary quotient and transport-survival architecture have been clarified, and the numerical-probability result has been narrowed to an expressly declared scalar-only predictive regime satisfying the complete carrier, measure, compatibility, factorization, pre-outcome, and independent-invariant exclusion conditions. The revision also strengthens the distinction between candidate weights, normalized weights, conditional measures, and probability interpretation. It adds more precise failure localization, preserves the distinction between conditioned failure and universal impossibility, and expands the realization-burden architecture separating mechanism satisfaction, physical scalar selection, boundary enforcement, branch generation, refinement implementation, physical realization, theory-specific realization, empirical validation, and final physical-theory status. The paper is now explicitly positioned between Part I, which establishes the structural requirements for finite recurrent stability before spacetime, and Part III, which develops boundary-unresolved and pre-numerical probability-status after recoverability loss. The central research program remains mechanism-neutral. No physical mechanism, collapse process, specific realization theory, unrestricted probability law, or empirical validation is claimed.
This paper is Part II of The Pre-Emergence Origin of Probability trilogy. Part I develops the structural requirements for finite recurrent stability before spacetime. Part II asks when persistent boundary-readable structure can support numerical probability. Part III examines what probability-status remains after boundary loss, before numerical weighting, and under what narrower conditions Born-form weighting may follow. The paper analyzes how probability-measure status may arise within a closed deterministic description rather than being assumed as a primitive numerical rule. A closed description cannot appeal to an external observer, hidden weighting convention, retained label, post-outcome selection, or independently supplied probability measure to explain its own probability assignments. Numerical probability must instead be supported by structures and relations admitted within the described system. The analysis begins with the requirements for persistent structured identity. Persistent identity is treated as recoverable cross-state relational distinction rather than exact sameness, repeated naming, scalar aggregation, or externally preserved memory. Within the tested structural registry, persistent refinable identity requires ordered dependence, a sufficient stabilization architecture, distributed relational structure, recurrence, bounded recoverability, and noncollapse of the distinctions being preserved. Bounded recurrent relational correction is classified as weak oscillatory form in a deliberately structural sense. The classification does not establish a physical wave, sinusoidal motion, exact periodicity, frequency, propagation, dynamics, mechanism operation, or physical carrier. It identifies a recurrent recoverability architecture that a later realization would have to preserve. The paper then develops the transition from persistent structure to boundary observability. Representation-sensitive bulk descriptions may depend on phase origin, refinement history, decomposition, internal labels, subpart identity, or other distinctions that do not survive admissible boundary readout. Under admissible-observable indistinguishability, boundary-readable observables factor through an emergence-boundary quotient that preserves only the distinctions carried by the admitted observable family and surviving the declared transport relation. The boundary quotient does not itself provide probability. It supplies a local architecture of boundary-readable alternatives and permits the admission of candidate nonnegative contribution scalars. Neither the alternative carrier nor a candidate scalar establishes scalar uniqueness, scalar closure, additivity, measure realization, normalization, or probability interpretation. Numerical probability-measure status becomes available only under a narrower cumulative condition package. The package requires an exact finite carrier, a finite positive event measure, a normalized scalar component on the same carrier, exact scalar-measure compatibility, one-scalar factorization of every admitted weight-bearing map, exclusion of independent weight-bearing invariants, pre-outcome assignment, absence of an external weighting source, and a declared scalar-only predictive regime. Additivity, commensurability, regularity, positive scale, finite nonzero total, and normalization remain separately controlled conditions within that route. Under those conditions, normalized scalar weights may receive conditional probability-measure status inside the declared local regime. This is not an unconditional derivation of probability from determinism. The result does not establish unrestricted probability, universal scalar representation, a global probability law, objective chance, stochastic dynamics, collapse, measurement theory, physical realization, or a final physical theory. Within the trilogy, Part II therefore supplies the middle structural layer: persistent recurrent structuretoboundary-readable alternativestocandidate scalar contenttoconditional numerical probability-measure status. Part III begins from a different question. It examines what remains when a boundary-readable description loses the ability to guarantee which admissible alternative obtains, before any numerical scalarization is supplied. Part II provides the scalar, measure, normalization, compatibility, and realization-burden architecture inherited by that later analysis, but it does not pre-establish the boundary-loss results of Part III. ### Revision note This revision is a substantial reconstruction and trilogy integration rather than a minor editorial update. The derivational architecture, definitions, condition packages, failure boundaries, dependency order, and claim-scope controls have been revised throughout. The manuscript has also been rewritten in new prose to present the argument as Part II of The Pre-Emergence Origin of Probability trilogy. Major changes include a clearer separation of persistent identity, ordered dependence, stabilization, distributed relational recurrence, weak oscillatory form, boundary observability, candidate scalar status, scalar closure, measure realization, normalization, and conditional probability-measure status. The emergence-boundary quotient and transport-survival architecture have been clarified, and the numerical-probability result has been narrowed to an expressly declared scalar-only predictive regime satisfying the complete carrier, measure, compatibility, factorization, pre-outcome, and independent-invariant exclusion conditions. The revision also strengthens the distinction between candidate weights, normalized weights, conditional measures, and probability interpretation. It adds more precise failure localization, preserves the distinction between conditioned failure and universal impossibility, and expands the realization-burden architecture separating mechanism satisfaction, physical scalar selection, boundary enforcement, branch generation, refinement implementation, physical realization, theory-specific realization, empirical validation, and final physical-theory status. The paper is now explicitly positioned between Part I, which establishes the structural requirements for finite recurrent stability before spacetime, and Part III, which develops boundary-unresolved and pre-numerical probability-status after recoverability loss. The central research program remains mechanism-neutral. No physical mechanism, collapse process, specific realization theory, unrestricted probability law, or empirical validation is claimed.
The Origin of Probability: A Complete Derivation in Three Parts is the collected edition of a three-part theoretical investigation into the structural origin of probability within a deterministic closed-description framework. The work asks a deliberately narrow but foundational question: under what conditions can a system whose underlying description remains deterministic acquire a lawful probability-bearing description without inserting primitive randomness, probabilistic axioms, or the Born rule at the beginning of the construction? The trilogy develops that question cumulatively. Each part establishes a distinct layer of the argument, and later results depend on structures and limitations established earlier. The collected edition therefore preserves the full dependency order rather than treating the three papers as independent essays. It also includes a narrative overview and terminology guide intended to make the architecture of the complete derivation easier to follow. Part I, Finite Recurrent Stability Before Spacetime: Collapse, Emergence, Horizons, and Recurrence as Recoverability Boundaries, develops the realization-neutral structural foundation. It begins from persistent relational distinction and recoverability rather than assuming spacetime, metric distance, clock time, energy, probability, or quantum measurement. Within a declared finite-stability regime it distinguishes contraction, correction, carry-through, collapse, emergence, recurrence, cycle structure, and horizon-like boundaries by their effects on recoverable relational structure. Collapse and emergence appear as distinct lower- and upper-bound failures of one finite recurrent-stability architecture. Weak oscillatory form is subsequently obtained only at structural scope, without promoting recurrence into a physical wave, temporal oscillation, or cosmological mechanism. Part II, Stability, Boundary Observability, and Emergent Probability in Deterministic Systems, develops the transition from deterministic structural dynamics to probability-bearing description. Its central problem is not whether deterministic evolution can simply be renamed probabilistic, but whether loss of recoverability at an admissible boundary can support a lawful reduced description of unresolved alternatives. The paper therefore separates Boundary Loss from probability itself and distinguishes quotient formation, reduced observability, scalar closure, finite measure, normalization, and predictive interpretation as separate derivational burdens. A normalized set of branch weights is not treated as probability merely because it sums to one. Probability status is admitted only after the additional structural and interpretive conditions required for predictive use have been isolated. Part III, Boundary Loss and the Born Rule: The Origin of Probability, carries the construction into a bounded physical realization framework. Boundary Loss supplies unresolved alternatives but does not itself supply numerical probability. The derivation therefore proceeds through source-grounded scalar residues, finite positive total measure, normalization, local predictive admission, and independent source-state and event bridges into Hilbert-space representation. A minimum compatibility condition is then isolated, explicitly adopted at the appropriate stage, and applied separately. At the resulting local source-linked scope, the construction reaches the exact Born form p_i = ⟨J(Ψ), P_i J(Ψ)⟩ = ||P_i J(Ψ)||². The significance of the trilogy lies as much in the separation of these stages as in the terminal equation. Boundary Loss is not equated with probability. Scalarization is not assumed to be probability. Normalization is not treated as sufficient for probability. Hilbert-space representation is not allowed to retroactively supply the earlier structural derivation. Compatibility required for the final Born-form application is distinguished from structures already derived. The dependency chain is therefore designed so that later mathematical convenience cannot be silently imported backward as an earlier premise. Across the three parts, the argument develops the following bounded sequence: ordered dependence → recoverable distinction → finite recurrent stability → collapse/emergence boundary structure → boundary observability → Boundary Loss → unresolved alternatives → scalar closure → finite measure → normalization → predictive probability → Hilbert-space source and event bridges → minimum compatibility → exact local source-linked Born form. The collected edition is intended to function as the canonical integrated research record for this derivation. It contains the trilogy overview followed by Part I Version 4, Part II Version 3, and Part III Version 2. Internal bookmarks and navigation link the overview directly to the title page of each constituent work, while the individual papers remain separately citable publications with their own persistent identifiers. Constituent works: Part I: Finite Recurrent Stability Before Spacetime: Collapse, Emergence, Horizons, and Recurrence as Recoverability BoundariesDOI: 10.5281/zenodo.19966230 Part II: Stability, Boundary Observability, and Emergent Probability in Deterministic SystemsDOI: 10.5281/zenodo.19966289 Part III: Boundary Loss and the Born Rule: The Origin of ProbabilityDOI: 10.5281/zenodo.20102172 Taken as a whole, the trilogy proposes a disciplined route from recoverability and deterministic boundary structure to probability and, at its final declared scope, to the Born form. Its central methodological requirement is that every transition be earned at the layer where it is used, with unresolved burdens, adopted conditions, nonclaims, and realization boundaries kept explicit rather than compressed into the final result.
Boundary Loss and the Born Rule: Pre-Numerical Probability-Status in Deterministic Systems This paper develops a boundary-loss account of pre-numerical probability-status in deterministic systems. Its central claim is that the Born rule does not need to be the first appearance of probability. Before probabilities can be assigned, a boundary-readable description may first lose guarantee. Let B:S_pre -> S_B be a boundary or readout map from a pre-boundary state space to a boundary-readable residue space. When a residue r = B(x) fails to preserve recoverability-relevant information, the compatibility class B^{-1}(r) may contain admissible alternatives that remain unresolved by r alone. The boundary-readable context then loses guarantee: it cannot determine which admissible alternative obtains, even when the pre-boundary structure is deterministic. The main result is a conditional structural theorem. Under a declared admissibility structure, if a domain D contained in B^{-1}(r) admits a scalar-neutral resolution relation ~_K with at least two admissible alternatives whose distinction is not recoverable from r alone, then the quotient context supports a representative-invariant boundary-unresolved quotient status. This status is called pre-numerical probability-status only in the restricted technical sense used in the paper: admissible alternatives remain live under the same residue, while no numerical probability rule has yet been supplied. The result does not derive numerical probability, Born probabilities, empirical frequencies, stochastic law, measurement outcomes, collapse, determinism, or physical instantiation. Numerical probability enters only through additional local scalarization. A local realization must supply nonnegative scalar residues, finite nonzero total, normalization, and a declared probability regime. The paper also explains why Born-rule numerics cannot be derived from boundary loss alone. Boundary loss is quotient-level and scalar-neutral, while Born weights require local Hilbert-space structure, including a state vector, projectors or effects, amplitudes, orthogonal additivity, and normalization. In quantum contexts, the Born rule is therefore treated as the local Hilbert-space scalarization of boundary-induced probability-status, not as the origin of probability itself. The theorem is compatible with deterministic pre-boundary structure but does not prove determinism. It is realization-neutral until a physical model supplies the relevant boundary map and admissible structures. Companion works: Stability, Boundary Observability, and Emergent Probability in Deterministic Systems - 10.5281/zenodo.19966289 Finite Recurrent Stability and the Pre-Spacetime Structure of Horizons: Collapse, Emergence, and Recurrence as Recoverability Boundaries - 10.5281/zenodo.19966230 Theory of Derived Probability and Entanglement Compression - 10.5281/zenodo.15786696
This manuscript develops a mechanism-neutral structural theory of finite recurrent stability for closed descriptions of a universe. A closed system cannot rely on an external clock, observer, memory, origin label, or cycle counter to explain its own persistence. Beginning, ending, recurrence, and cycle number count as internal structure only when they are recoverable through relations admitted within the system itself. Persistent structured identity is defined as recoverable relational distinction rather than exact sameness, retained naming, or externally recognized continuity. The paper separates contraction, correction, carry-through, recurrence, collapse, and emergence as distinct recoverability conditions. Finite recurrent stability is classified by the structural condition S_min ≤ R_stab(Ξ, Γ, B_cond, P_stress, M_carry) ≤ S_max, together with the declared identity, correction, transformation, boundary, containment, comparison, recurrence, and carry-through conditions. The expression is classificatory, not a physical observable, evolution equation, or dynamical law. Collapse and emergence are treated as distinct exits from the same finite-stability architecture. Collapse requires lower-bound recoverability failure together with failure of the admitted correction and carry-through conditions. Emergence requires upper-bound containment failure together with loss of the prior containment relation and satisfaction of a declared boundary-readability condition. Neither threshold inequality alone establishes a physical collapse, physical emergence, or cosmological event. The paper develops a structural-horizon taxonomy covering collapse, emergence, external access, and cycle distinction. These horizons classify transitions in recoverability, containment, accessibility, readability, or recurrence-index distinction. They are not assumed to be physical surfaces, metric boundaries, event horizons, or cosmological objects. Recurrence need not imply exact repetition. Boundary-equivalent recurrence may preserve a declared boundary relation, π(Ξ(τ_max)) = π(Ξ(τ_0)), while the complete internal states remain unequal. This permits recurrent governing structure without requiring identical histories. Cycle-index indistinguishability arises when no admitted internal relation recovers an absolute cycle index. Beginning-index nonrecoverability arises when no admitted internal relation recovers firstness. Neither result proves that no beginning, ending, absolute ordering, or distinct history exists. The manuscript also defines weak oscillatory form as bounded recurrent correction, declared relational recurrence, and carry-through of recoverable structure without presupposing physical waves, frequency, propagation, energy transport, or temporal periodicity. It concludes with a realization-burden architecture separating structural classification from carrier selection, interface preservation, mechanism specification, mechanism operation, physical realization, theory-specific realization, and empirical validation. The paper therefore does not propose a physical stability operator or cosmological mechanism. It identifies the structural conditions and additional burdens that any later realization theory must satisfy. Version 2 revision note Version 2 is a substantial reconstruction rather than a minor editorial update. The derivational route was rebuilt and rechecked in full, with revised definitions, dependency ordering, governing conditions, failure conditions, and claim-scope boundaries. The manuscript was then rewritten throughout in new prose to reflect the reconstructed argument. Major changes include the formalization of finite recurrent stability through the revised RstabR_{\mathrm{stab}}Rstab framework; sharper separation of contraction, correction, carry-through, collapse, and emergence; a revised structural-horizon taxonomy; clearer treatment of boundary-equivalent recurrence, cycle-index indistinguishability, and beginning-index nonrecoverability; a more precise definition of weak oscillatory form; and an expanded realization-burden architecture separating structural classification from mechanisms, physical realization, theory-specific interpretation, and empirical validation. The revision also adds stronger nonpromotion controls, appendix-based claim and condition ledgers, and clearer limits on what the structural results do and do not establish. The central research program remains mechanism-neutral, but the argument, notation, scope discipline, and presentation have all been substantially revised.
This paper develops a reconstruction of probability that does not begin by assuming a probability space, a probability simplex, or the Born rule. Instead, it asks a prior foundational question: under what physical and mathematical conditions are a set of alternatives entitled to carry positive, additive probabilities at all? The construction begins with lawful histories, future interfaces, and retained records. It distinguishes coherent alternatives from exclusive empirical events, preventing multiple interfering routes from being mistaken for separate probabilistic outcomes. A future-sufficient quotient identifies distinctions that no admitted future test can detect, while a record-qualification step determines when alternatives have become genuine empirical events. Dagger-compatible comparison and positive record factorization then produce a positive comparison kernel, from which normalized event probabilities arise only after the relevant record sectors are certified as exclusive. The framework is extended beyond individual measurements. Compatible finite record refinements generate a global probability measure under explicit realizability conditions; stochastic kernels provide a compositional calculus for carrying probabilistic information through unresolved future structure; and locally classical measurement contexts are assembled into a single positive state on a generally non-Boolean effect structure. This allows globally coherent probability to exist even when no context-independent deterministic assignment of outcomes exists. On a reflection-positive Hilbert-space branch, admissible future contexts are represented by positive effects and positive normalized states by density operators. The Born state-effect law then appears as the finite-dimensional representation of a probability structure that has already been earned through record qualification, positivity, exclusivity, refinement, and contextual consistency rather than introduced as a primitive postulate. The paper also separates two mechanisms that are often conflated: quadratic Born-type weighting arises from dagger self-comparison, whereas equal probabilities for symmetric alternatives arise from symmetry of the outcome structure. A further state-effect bridge analysis classifies residual coordinate freedom and identifies an exceptional rank-two adjugate transformation with Lorentzian signature, which is removed when positive self-dual identification is required. The central interpretation is that probability can function as a lawful form of global completion: it can carry future-relevant law through unresolved structure even when deterministic uniqueness is unavailable. The paper does not derive a mechanism selecting one actual outcome and does not claim that every physical sector satisfies the stated hypotheses. Instead, it provides an explicit dependency-controlled architecture connecting lawful completion, reflection positivity, event qualification, contextuality, stochastic continuation, Hilbert reconstruction, and the Born rule.
This preprint develops a refinement–compatibility–stability (RCS) framework in which finite process occurrences generate rational calibration readouts indexed by a directed refinement system, and studies when such readouts determine a stable continuum value. Throughout, a continuum-valued observable means the completion class determined by an admissible stable refinement thread; no operator-algebraic or quantum-mechanical notion of observable is presupposed. Main results. Every stable rational thread determines a unique value in the Cauchy completion of the internal rational field. Equality of completed values is equivalent to asymptotic thread equivalence; realization preserves the induced algebraic operations; and the value is invariant under cofinal changes of refinement schedule. For bounded occurrence ratios, asymptotically negligible perturbations to the numerator and denominator preserve the completed value. Nested rational enclosures of vanishing width provide a sufficient, independently checkable stability certificate. The mathematical completion is distinguished from the physically realizable spectrum selected by a declared class of admissible protocols. Occurrence-ratio generation and stability alone do not determine a unique physical spectrum; additional assumptions about admissible channel composition can induce corresponding algebraic structure. A Pell-type recursion yields a stable irrational completion value using finite positive-integer counts, while an oscillatory model shows that qualitative refinement assumptions alone do not guarantee quantitative stability. Computability is treated conditionally: if the refinement system and protocol count functions are computable, and the stability thresholds are effectively obtainable, the completion value is a computable real. The paper does not assume that every physically admissible protocol is effective, and does not claim that physical observables must be computable. Scope. Apart from standard algebraic and topological facts cited in Sections 2 and 4, the results depend only on the definitions, axioms, postulates and additional conditions stated in this manuscript. No linear, geometric, temporal, or topological realization developed in the broader Observation–Feedback programme is assumed here. The readout is compared with the partial observables of relational physics, and stability, invariance and physical admissibility are treated as logically distinct requirements. The framework originates in the finite-occurrence and refinement-stability sector of the Observation–Feedback (OF) Closure programme (companion manuscript: Observation–Feedback Closure I, v1.5.0, doi:10.5281/zenodo.21859450), which supplies the broader relational motivation. The paper makes no empirical predictions and does not identify the physically realizable spectrum with the full mathematical completion. Version note. Version v1.1 is a clarificatory revision of v1.0. It states the provenance of the “OF”-labelled arithmetic, separates calibration protocols, readout threads and completion values, and sharpens the distinction between quantitative stability and physical admissibility. The only changes inside numbered equations are notational (κ_T → Read_T and N_eff → N_eff,i*); no theorem statement, proof, or mathematical conclusion has been changed. The PDF lists the full set of changes immediately before the Acknowledgments. Status. Preprint; not peer reviewed. The deposit includes the manuscript PDF, LaTeX source and BibTeX bibliography.
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.