Finite observers can fail to close a declared prediction task for several physically distinct reasons: incomplete records, inaccessible boundary data, permanent record-capacity deficits, delayed measurement context, reflexive response policies, or degradation of the resources needed to maintain a record. Earlier versions of the programme treated these obstructions as manifestations of one persistent uncertainty. Adversarial testing rejects that identification. Local positive residuals can disappear exactly after causal pooling; large finite systems can be represented by sufficient statistics; distributed records can close without a centralized copy; and coherent quantum memory can remove a classicalized delayed-context floor. This paper therefore introduces polymorphic operational nonclosure as a narrower replacement. Its central object is a typed, architecture-indexed obstruction profile rather than a conserved scalar uncertainty. A carrier transition is admissible only when the earlier obstruction is shown to close or become subdominant, the later obstruction is independently derived, the target and observer architecture are declared, a causal physical map connects the stages, and hostile controls exclude artificial withholding of available information. Exact information-theoretic results establish target-indexed residuals, pooling gains governed by conditional mutual information, protocol-specific quantum floors, and capacity-indexed target-family bounds. Mesoscopic and control-level tests show that maintaining closure can create a thermodynamic burden. Across broad feedback ensembles, terminal failure is conditional on renewal failing before the control margin vanishes. An explicit reciprocal quantum collision model supplies a finite CPTP regulator in which correction exports energy into a sink, sink loading reduces future correction capacity, and renewal supports recovery. The resulting framework is conditional rather than universal. It derives no observer-independent uncertainty scalar, unavoidable leakage field, spacetime-emergence theorem, additional gravitational stress tensor, or dark-energy contribution.
Finite observers can fail to close a declared prediction task for several physically distinct reasons: incomplete records, inaccessible boundary data, permanent record-capacity deficits, delayed measurement context, reflexive response policies, or degradation of the resources needed to maintain a record. Earlier versions of the programme treated these obstructions as manifestations of one persistent uncertainty. Adversarial testing rejects that identification. Local positive residuals can disappear exactly after causal pooling; large finite systems can be represented by sufficient statistics; distributed records can close without a centralized copy; and coherent quantum memory can remove a classicalized delayed-context floor. This paper therefore introduces polymorphic operational nonclosure as a narrower replacement. Its central object is a typed, architecture-indexed obstruction profile rather than a conserved scalar uncertainty. A carrier transition is admissible only when the earlier obstruction is shown to close or become subdominant, the later obstruction is independently derived, the target and observer architecture are declared, a causal physical map connects the stages, and hostile controls exclude artificial withholding of available information. Exact information-theoretic results establish target-indexed residuals, pooling gains governed by conditional mutual information, protocol-specific quantum floors, and capacity-indexed target-family bounds. Mesoscopic and control-level tests show that maintaining closure can create a thermodynamic burden. Across broad feedback ensembles, terminal failure is conditional on renewal failing before the control margin vanishes. An explicit reciprocal quantum collision model supplies a finite CPTP regulator in which correction exports energy into a sink, sink loading reduces future correction capacity, and renewal supports recovery. The resulting framework is conditional rather than universal. It derives no observer-independent uncertainty scalar, unavoidable leakage field, spacetime-emergence theorem, additional gravitational stress tensor, or dark-energy contribution.
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 preprint is version v1.4.0 of Observation–Feedback Closure I. It presents a conservative topological and structural extension of the v1.3.0 OF causal-hypergraph reconstruction with dual-order structure, rather than a replacement of the earlier kinematical and reconstruction architecture. Building on the stratified microscopic–mesoscopic–macroscopic ontology, source-generated propagation patterns, sheaf-compatible identity reconstruction, and obstruction-weighted effective action established in v1.3.0, the following contributions are first publicly disclosed in this v1.4.0 preprint as constructions and results formulated within the OF Closure framework: 1. Conditional localized non-Hausdorff reconstruction: under explicit role-distinction, persistent saturated-neighborhood overlap, and ordered-refinement assumptions, a conditional theorem establishes localized non-Hausdorff sectors in the mesoscopic identity reconstruction space. This result concerns reconstruction topology and does not assert that macroscopic spacetime is globally non-Hausdorff. 2. Two-orbit residual-map classification: within the adopted non-empty two-arrow residual-map model, modulo observer/feedbacker role reversal, the minimal irreducible residual maps are classified into a single-arrow process-type orbit (𝔭-type) and a bidirectional identity-dual orbit (𝔬-type). 3. Process–identity complementarity: qualitative process–identity complementarity is explicitly incorporated into the First Principle of Physical Admissibility. The persistent-overlap non-Hausdorff construction provides one conditional topological realization of this principle rather than a quantitative uncertainty theorem or a derivation of quantum measurement relations. 4. Leading-even OF response hierarchy: this version formalizes a leading-even response hierarchy and a weak-deformation dominance lemma. The proposed connection between response order and macroscopic physical externalization remains conjectural. Under additional externalization assumptions, the 𝔭-type and 𝔬-type sectors provide conditional structural precursors for gravitational-type and electromagnetic-type correspondences, respectively. The residual-map classification itself does not derive gravitational or electromagnetic dynamics, field equations, interaction laws, coupling constants, or physical signs. The obstruction-weighted reconstruction architecture of v1.3.0 is retained. In the clean binary, zero-obstruction, unit-weight regime, the framework continues to recover the explicitly identified v1.2.0 event-counting kinematical constructions. These statements record the established retention and limiting-recovery relations; they do not assert an unrestricted equivalence among all versions. The framework constructs relational and algebraic representations of physically admissible objects and processes, together with kinematical and continuous-parameter interfaces intended for possible future dynamical formulations; it does not itself supply a dynamics. This work does not challenge, invalidate, or replace established physical theories in their empirical domains, nor does it claim empirical superiority over them. No field equations, quantum dynamics, gauge dynamics, gravitational dynamics, interaction dynamics, quantitative cosmological models, or new empirical predictions are derived. Dynamical, categorical, generator-level, and quantitative physical extensions are deferred to subsequent work in the OF Closure series.
We develop a finite operational response theory for controlled quantum systems in which observer closure, hidden microscopic structure, and higher-order response are treated within a single algebraic framework. The central distinction is between generic higher-order observability and Closure–Residue (CR)-constrained generative response. Standard finite-dimensional quantum theory does not, by itself, impose the specific CR accessibility condition introduced here; physically realizable controls are ordinarily determined by the microscopic Hamiltonian, hardware connectivity, conservation laws, and environmental couplings of the system under study. We therefore formulate First-Residue Accessibility as an additional finite selection principle for the coherent-control sector studied here: the infinitesimal deformation of the observer closure algebra generated by any admissible tangent in the declared target control manifold must lie in the first-residue derivation space inherited from an underlying microscopic CR sector. The algebraic consequences are rigid. Within this coherent-control sector, the maximal abelianness of the population algebra implies that the infinitesimal action of a control on the closure algebra determines its anti-Hermitian generator uniquely modulo a diagonal population gauge. First-Residue Accessibility therefore forces the declared coherent control class, up to this gauge, to lie in a canonical graph-internal subtype extracted from the microscopic CR sector. For diagonal prepared states, the visible first-order population response is silent, while the second variation factorizes through a graph-divergence map of a microscopic bilinear edge flow. A three-site single-excitation benchmark realizes the factorization exactly and yields an even response law of the form Sigma(epsilon X) = epsilon^2 Q_CR(X,X) + O(epsilon^4). We also separate exact discrete support transport from continuous-time quasilocality. A hard one-step support cone has a singular continuous-time limit whenever the limiting generator genuinely spreads local observables; finite propagation in the continuous limit must therefore be formulated by soft tails rather than exact support. We introduce a normalized-trace visible-leakage profile and derive a soft causal readout bound. In the coherent single-excitation sector this profile is uniformly equivalent, up to fixed observer-volume constants, to intrinsic operator-norm quasilocality. For finite-range exchange with simultaneous site dephasing we prove an N-uniform normalized-trace quasilocality estimate without using rank preservation. This genuinely nonunitary extension establishes a common finite-time exponential locality class with standard open-system quasilocality, while the stronger two-sided intrinsic equivalence is claimed only for the coherent unitary subclass. We further show that divergence-image membership is non-discriminating for connected full-population readout, construct an explicit standard CPTP control family that is first-order silent but violates the CR component constraint on a disconnected graph, and isolate experimentally measurable null tests. We distinguish a declared target-control manifold from the larger independently calibrated manifold of physically available coherent controls, thereby separating a conditional declared-manifold accessibility hypothesis from the stronger Physical First-Residue Accessibility statement. Under star-compatible oriented provenance we also derive an observable cross-prediction bound that links independently fixed static CR data to a measurable quadratic response coefficient. A framework-discriminating test requires both that the CR structure be fixed without using the target Hessian data and that the resulting constraint be stronger than what follows from the same calibrated microscopic information in a standard quantum model. We further exhibit a connected three-site collective-mode candidate in which CR Accessibility predicts an exact left–right quadratic null, while a same-support standard comparator constrained only by independently fixed aggregate tangent norms permits a nonzero response envelope. This yields a strict prediction-set separation under an explicit Dataset-A information condition, while also making clear that the separation disappears if standard microscopic calibration independently fixes the same collective tangent relation. We map this strict comparator onto a single-electron linear triple quantum dot, construct a four-point mixed-Hessian estimator, and propagate swap-odd instrumental asymmetry, finite-difference bias, and shot noise into a preregistered experimental envelope. The deeper derivation of the accessibility principle from the full Generative Map is left to the subsequent axiomatic stage of the program.
Abstract The original Iron Laws proposed three constraints on physically meaningful observation: irreversible record formation, finite operational locality, and the impossibility of sustained observer function in complete equilibrium. Subsequent adversarial testing showed that these principles survived only after several broad claims were removed or sharply restricted. This paper presents their reconstructed form for finite operational observers. Law I requires complete physical accounting whenever a transient correlation becomes a retained and task-usable record, including commitment, maintenance, replacement, revision, export, erasure, and loss. It does not claim that every interaction or premeasurement is irreversible, and it permits record identity to persist through authenticated replacement of every original physical carrier. Law II requires finite causal support and provenance for comparison, communication, coordinated control, and collective record formation. It remains compatible with quantum nonfactorization and does not derive spacetime geometry or instantaneous global agreement. Law III permits equilibrium correlations, passive memories, stationary distributions, and stationary collective macrostates, but excludes sustained directional register–compare–act–reset cycles, or turnover-maintained collective function, at full operational equilibrium once all drives, clocks, reservoirs, prepared memories, renewal mechanisms, and interventions are included. The three laws are joined through a conjunctive admissibility protocol requiring registration, retention, causal support, finite resolution, authenticated provenance, and later use. The reconstruction also replaces the former observer-independent persistent-uncertainty claim with target-, group-, and architecture-indexed operational residual floors. The result is not a derivation of geometry, gravity, cosmology, consciousness, or inevitable observer emergence, but a falsifiable framework specifying the physical conditions under which finite systems can produce, preserve, authenticate, compare, and use evidence.
This paper develops a mesoscopic theory of emergent metastable record-support domains on networks of overlapping finite subsystems. The original formulation compressed perturbative stability, correlation strength, record persistence, observer function, and classical spacetime into one scalar coherence variable. Stress testing showed that these roles must be separated, while preserving a narrower emergence result. The revised framework distinguishes fragile and distributed support modes, finite renewal resources, physical record integrity, explicit content and epoch labels, and separate mechanisms for activation, latching, consensus, invalidation, and revision. Local exchange, resource, threshold, and latch dynamics generate connected support domains, collapse-corridor-rescue regimes, hysteretic branches, and revisable distributed records that are not imposed as primitive node labels and that change under matched ablations. Version 3.2 adds a driven turnover audit. A record-support domain preserved late occupancy of 0.6797 and fidelity of 0.9854 after every original record instance had disappeared and approximately 22.7 record generations had passed. Random-provenance and coherent false-renewal controls show the boundary: high support and internal agreement can preserve a stable but wrong identity. Domain persistence is therefore process-level continuity under a declared provenance rule, not material-token immortality and not semantic truth. Overlap remains double-edged. It can pool weak evidence, improve local reliability, and support revision, but it can also double-count redundant support, preserve obsolete copies, sustain incompatible local domains, or stabilize common-mode errors. The framework establishes model-level emergence of collective metastable record-support domains. It does not derive observerhood, a universal preferred basis, classical spacetime, or gravity. A published downstream companion reconstructs Jacobson’s equilibrium equation of state in a finite regulator using additional horizon, tensor, conservation, and provenance assumptions.
The quantum-to-classical transition is often operationally identified through one preferred indicator, such as coherence loss, classical record formation or measurement stability. This paper develops a different reconstruction test: classicality is treated as a witness-indexed, observer-explicit and recoverability-sensitive cross-scale transition rather than as a single hard boundary inserted by assumption. Starting from a fine description X, a candidate effective state Γ and a future observable family Y, we define a predictive-retention ratio η_pred=I(Γ;Y)/I(X;Y) and residual ε_cl=I(X;Y|Γ). We distinguish raw relation count from record-forming capacity K_rec^(δ), introduce relation-to-record efficiency κ_R, define a transition spectrum T_C={t_W} across a declared witness family and its width ΔT_C=max_W t_W−min_W t_W, and require observer counterfactuals so that conditioning or readout cannot manufacture a physical transition. An observer-conditioned recoverability diagnostic separates information destroyed, information dispersed into wider system–environment relations and information inaccessible to a restricted observer. The resulting classicality vector is deliberately non-compensatory unless a physical model proves otherwise. The construction is a falsifiable physical-regression architecture, not a derivation of quantum mechanics from Ω₀/A2, and it makes explicit the calculations and counterexamples required before any stronger claim is admissible.