Constraint-Based Realization | Synthesis Paper | Canonical Closure and Exact Empirical Exposure
Copyright Page
Constraint-Based Realization | Synthesis Paper | Canonical Closure and Exact Empirical Exposure
Copyright © Robert Duran IV. All rights reserved.
No part of this publication may be reproduced, stored in a retrieval system, or transmitted in any form or by any means, including electronic, mechanical, photocopying, recording, or otherwise, without prior written permission of the copyright holder, except for brief quotations used in scholarly review, criticism, or citation consistent with applicable law.
This volume is a work of theoretical research and formal argument. It advances a proposed framework in quantum foundations and should be read accordingly. Statements labeled as axioms, assumptions, propositions, theorems, conjectures, interpretive claims, or empirical hypotheses carry different evidential and logical status, which is specified within the text. No claim should be read more strongly than the status assigned to it.
The author has attempted to distinguish, throughout, between formal results, conditional arguments, heuristic remarks, and open problems. Readers are encouraged to evaluate the framework on the basis of explicit assumptions, stated definitions, proof status, and empirical consequences rather than on rhetoric, pedigree, or interpretive preference.
First edition.
Printed in the United States of America.
For permissions, inquiries, or scholarly correspondence, contact: 505-520-7554
Abstract
Standard quantum theory supplies an exact account of state evolution, correlation structure, and record formation, but does not by itself state a physical law by which one realized outcome channel is selected in an individual measurement context. Constraint-Based Realization addresses that unresolved target by treating realization as a constrained law-selection problem. For each context C, the realized channel is selected by the rule Φ★C ＝ arg min{Φ ∈ 𝒜(C)} ℛ_C(Φ), where 𝒜(C) is a restricted admissible class and ℛ_C(Φ) ＝ αΞ_C(Φ) ＋ βΩ_C(Φ) ＋ γΛ_C(Φ) is the canonical realization functional. Under the stated admissibility and regularity assumptions, the selected channel exists and is unique up to operational equivalence. If accessibility enters this law nontrivially, the induced response cannot remain globally contained in the declared baseline class across the full admissible accessibility domain. The theory is then instantiated on one exact accessibility-tunable delayed-choice quantum eraser platform with platform-level accessibility variable η, exact orthodox comparator V_SQM(η) ＝ 1 − η, and exact instantiated CBR response V_CBR(η) ＝ 1 − η − κ max{0, η − η_c}, with κ > 0 fixed. On this model, the non-equivalence concentrates near the critical accessibility value η_c as a critical-regime derivative break in strong form or a bounded non-baseline deviation class in weak form. Under bounded detector, erasure, environmental, and calibration perturbations, that signature remains resolvable in the detectability-valid regime. If the declared platform exhibits only baseline-class behavior across the physically relevant and experimentally accessible η-domain under those stated conditions, the instantiated canonical law is false. Constraint-Based Realization is therefore presented here not as a broad realization-law architecture alone, but as a canonically closed and exactly exposed theory candidate whose central empirical burden is finite, public, and in principle experimentally decidable.
1. Introduction
1.1 Exact purpose of this synthesis paper
This paper does not broaden the CBR program, replace the earlier volumes, or re-derive every intermediate step at full length. Its purpose is narrower and more exact: to fuse only the closed layers of the program into one theory object that can be read as a single public claim rather than as a strong but distributed body of work. The earlier volumes are not discarded by that compression. They are the burden ladder that made it possible. Volume I established the formal architecture and explicitly described itself as a “formal opening statement,” with clarity of structure rather than final settlement as its principal contribution. Volume II narrowed the framework and placed stronger restriction pressure on admissibility and underdetermination. Volume III made empirical exposure and test burden central rather than optional. Volume IV sharpened the canonicality and non-circularity question, especially in relation to Born structure, while refusing premature closure.
The Core Theorem Paper then discharged the canonical closure burden. It fixed one canonically specified realization law, one restricted admissibility structure, one restricted uniqueness theorem, one accessibility-signature burden, and one finite falsification condition. Volume V discharged the exact empirical closure burden. It fixed one exact delayed-choice accessibility-tunable platform, one exact accessibility construction, one exact orthodox comparator, one exact instantiated CBR response, one exact robustness theorem, and one exact binary invalidation rule. The present paper exists to state those closures in one place. Its function is therefore not developmental but consolidating. It is the document in which the program first appears as one canonically closed and exactly exposed theory candidate.
1.2 What this paper claims
The claims of this paper are deliberately narrow and correspondingly stronger. First, it claims that CBR now possesses one canonically specified realization law rather than only a family of related proposals. Second, it claims that the law acts on one restricted admissibility structure and selects a realization channel uniquely up to operational equivalence within that structure. Third, it claims that the law is no longer only canonically compressed, but exactly instantiated on one delayed-choice accessibility-tunable platform whose physical architecture is fixed in advance. Fourth, it claims that this platform comes with one exact orthodox comparator and one exact instantiated CBR response written on the same model. Fifth, it claims that if accessibility enters realization law nontrivially, the resulting empirical burden is concentrated in a critical regime near η_c and takes a restricted signature form. Sixth, it claims that this signature remains experimentally resolvable under declared ordinary perturbations whenever the exact separation scale exceeds the declared perturbative envelope. Seventh, it claims that a clean null result on the exact platform, under detectability-valid conditions, kills the instantiated canonical form.
These claims are sufficient for the purpose of the present paper. They do not need to establish universal dominance, historical acceptance, or total finality in order to matter. What they establish is that CBR has crossed the relevant threshold from a disciplined developmental program to a finite theory object with a law, an empirical burden, and a public failure condition.
1.3 What this paper does not claim
This paper does not claim universal closure over all realization-law rivals. It does not prove that every conceivable alternative to CBR has been eliminated. It does not claim universal multi-platform empirical generalization, nor does it argue that every delayed-choice architecture, every quantum eraser, or every future accessibility-sensitive implementation must display the same signal in the same exact form. It does not claim final universal Born-neutrality closure, and it does not present the unresolved probabilistic burden as already settled. It does not claim laboratory confirmation. It does not claim historical settlement of the foundations debate.
These non-claims are not disclaimers in the weak sense. They are part of the exact scope of the paper. A synthesis of this kind becomes stronger by refusing to state anything broader than what the updated stack has actually closed. The present paper therefore claims only what has been earned: one canonically specified law, one exact empirical instantiation, one exact signature burden, and one exact invalidation condition.
1.4 Why this synthesis paper is necessary
The updated stack is now strong, but structurally distributed. Volume I is a formal opening statement, not the closure object. Volume II narrows and strengthens the framework, but does not yet canonically close it. Volume III operationalizes empirical burden and discrimination pressure, but not yet on one exact model. Volume IV sharpens canonicality, non-circularity, and Born pressure, but still leaves final closure open. The Core Theorem Paper and Volume V together create the first point at which the theory can be read as one public and vulnerable object, but that closure remains distributed across two distinct documents: one providing canonical law closure, the other providing exact empirical closure.
This synthesis paper is therefore necessary because without it the strongest closed burdens remain spread across several texts. A critical reader can recover the final theory object from those texts, but must still assemble it. The purpose of the present paper is to remove that burden from the reader. It states, in one place, what the theory now is, which burdens have actually been closed, and which burdens remain open. That is the exact role of a top-level closure document, and it is the role this paper is written to serve.
2. Developmental Burden Already Discharged
The final closure of CBR did not appear all at once. It was earned through a staged burden ladder. That fact matters because it distinguishes the present paper from a generic summary. The purpose of this section is not to retell the entire history of the program. It is to show that the canonical and exact empirical closures claimed later in this paper were made possible by earlier burdens that have already been discharged. The significance of Volumes I–IV lies precisely there. They did not yet produce the final closure object, but they did make it possible.
2.1 Volume I — Formal architecture and minimal opening discipline
Volume I established the exact target problem and fixed the first disciplined form of the framework. It distinguished among evolution, registration, and realization, and thereby prevented the program from collapsing the outcome-selection problem into either ordinary state evolution or record formation alone. It introduced the minimal axiomatic framework, the first admissibility schema, and the first realization-functional architecture. Just as importantly, it adopted a formal discipline that remained explicit throughout: it repeatedly marked the difference between what had been defined, what had been assumed, what had been conditionally proved, and what remained open. Its abstract and preface are explicit that its main contribution is formal clarity rather than final closure, and that later volumes would need to tighten admissibility, uniqueness, Born standing, and empirical exposure.
Volume I therefore did not claim final uniqueness, final canonicality, final Born derivation, or decisive empirical discrimination. It should be read exactly as it presents itself: as the formal opening statement of the revised program. That opening discipline was indispensable. Without it, later claims of closure would risk being built on architecture that had never first been made inspectable.
2.2 Volume II — Narrowing, admissibility pressure, and stronger restriction
Volume II took the formal architecture of Volume I and forced it toward stronger restriction. Its role in the program was to reduce latitude. More precisely, it sharpened admissibility, increased pressure against formal underdetermination, and restricted the freedom by which realization maps could appear substantive while still depending on descriptive slack or undeclared arbitrariness. The work of Volume II was therefore not merely additive. It was disciplinary. It pushed the framework away from broad architectural possibility and toward a narrower law-candidate space.
This mattered because a realization-law program becomes serious only when it becomes harder for formally different proposals to survive as equally admissible. Volume II advanced exactly that burden. At the same time, it still stopped short of the final canonical law object. It strengthened the restriction problem and made later uniqueness pressure more credible, but it did not yet compress the framework into the single canonically specified law-and-signature object achieved later in the Core paper.
2.3 Volume III — Empirical and operational exposure
Volume III forced the narrowed framework to answer the empirical question. Its contribution was to move the program out of purely formal self-description and into operational exposure. In effect, it asked whether the framework could bear a real test burden at all, and whether the distinction it wished to make could be stated in a way that was not merely interpretive. This was the stage at which accessibility and discrimination began to function as operational rather than rhetorical categories. Volume III therefore discharged the exposure burden: it showed that the program could, in principle, be made answerable to empirical structure rather than remaining indefinitely protected inside framework language.
What Volume III did not yet do was fix one exact platform and write one exact comparator and one exact instantiated response law on that platform. Its achievement was earlier in the chain and no less necessary for that reason. It made empirical exposure possible. It did not yet complete exact empirical instantiation.
2.4 Volume IV — Canonicality, non-circularity, and Born pressure
Volume IV took up the strongest unresolved formal burden in the program: whether the law could be treated as canonically constrained rather than merely one disciplined proposal among several, and how far Born-related structure could be addressed without hidden insertion or disguised circularity. Its role was therefore not to provide a casual “Born derivation,” but to intensify the exact point at which overstatement would be most damaging. Volume IV sharpened the standard by which the program could later claim canonicality and probabilistic discipline, and in doing so it made clear that not every attractive compatibility claim counts as a derivation.
This burden remains only partly closed. That is not a weakness hidden inside the present synthesis paper; it is one of the exact open burdens the paper will later state. But Volume IV matters because it ensures that the later closure claims are made against a sharpened standard rather than against a permissive one. It therefore discharged the canonicality-and-non-circularity pressure burden even while leaving final universal Born closure unresolved.
2.5 What this developmental ladder accomplishes
Volumes I–IV together did not yet produce the final closure object. They did something more foundational: they discharged the developmental burdens without which final closure would have been structurally premature. Volume I made the framework exact enough to inspect. Volume II narrowed admissibility and reduced formal freedom. Volume III operationalized empirical exposure. Volume IV sharpened canonicality and non-circularity pressure. Only after those stages could the Core Theorem Paper compress the law into one canonically specified object and only after that could Volume V force that object onto one exact delayed-choice empirical model.
That is the developmental burden ladder this synthesis paper presupposes. Its point is not historical ornament. It is to show that the final closure claimed later in this paper was earned stage by stage, and that the present synthesis paper is therefore not announcing a closure that arrived without prior discipline.
3. Canonical Law Closure
3.1 Exact canonical law form
The canonical closure of CBR begins with one exact realization law. For each physically specified measurement context C, the realized channel is selected by the rule
Φ★C ＝ arg min{Φ ∈ 𝒜(C)} ℛ_C(Φ),
with realization functional
ℛ_C(Φ) ＝ αΞ_C(Φ) ＋ βΩ_C(Φ) ＋ γΛ_C(Φ),
where α, β, γ ≥ 0 are fixed at the level of the theory. This law form is no longer treated here as one suggestive member of a large family of possible realization rules. It is the canonically retained law object of the program. Its significance lies in the fact that realization is not left as a residual interpretive gesture or an informal preference over outcomes. It is posed as a constrained law-selection problem over an admissible class of realization-compatible channels.
The point of this formulation is not maximal abstraction. It is controlled exactness. A realization-law proposal cannot remain indefinitely permissive at the level of its central selection rule and still claim canonical standing. The Core Theorem Paper therefore fixes one exact law form and ties the entire canonical closure burden to it. This is the first moment at which the program ceases to be only a structured research architecture and becomes one law-bearing object.
3.2 Meaning of the three irreducible burdens
The realization functional contains three irreducible burdens, each retained because it carries one indispensable part of the law’s explanatory and disciplinary load.
Ξ_C is the representational invariance burden. It measures the extent to which a candidate realization channel depends on merely descriptive reformulation rather than physically meaningful structure. A law that changes its realization verdict under physically irrelevant redescription is not a physical realization law in the intended sense.
Ω_C is the record-structural coherence burden. It measures the extent to which a candidate realization channel fails to align outcome selection with the physically meaningful record-bearing structure of the context. Realization, on this view, must track more than formal multiplicity. It must remain anchored in genuine record structure.
Λ_C is the accessibility-consistency burden. It measures the extent to which a candidate realization channel fails to respond coherently to operational accessibility when accessibility is physically relevant to realization. This is the burden through which accessibility enters the law as a structured physical control rather than as a rhetorical addition.
These three burdens are not retained for symmetry or elegance alone. They are retained because, within the canonical closure of the theory, no one of them can be removed without reopening arbitrariness, record-indifference, or accessibility-indifference at the level of law.
3.3 Restricted admissibility structure
The canonical law does not minimize over an unrestricted space of formally writable channels. It minimizes over a restricted admissible class 𝒜(C), and this admissibility structure is itself part of the closure achieved by the Core paper. A candidate realization channel belongs to 𝒜(C) only if it satisfies the exact admissibility burdens required by the theory.
First, admissibility requires dynamical compatibility. A realization channel may govern outcome selection, but it may not covertly replace or rewrite the ordinary quantum dynamics the theory presupposes outside realization selection.
Second, admissibility requires representational invariance. Physically equivalent descriptions may not induce inequivalent realization verdicts.
Third, admissibility requires record-structural coherence. The channel must respond to physically meaningful record-bearing organization rather than to unsupported formal branch multiplicity.
Fourth, admissibility requires accessibility consistency. Accessibility-equivalent contexts may not be assigned different realization verdicts merely because they differ in superficial implementation detail.
Fifth, admissibility requires restricted probabilistic discipline. The target probabilistic structure may not be inserted directly into the law by stipulation and then redescribed as if it had been derived.
This restricted admissibility structure is essential to canonical closure. Without it, minimization would occur over too broad a space to support any serious uniqueness result. With it, the law acts on a class already filtered against the principal forms of nonphysical selectivity.
3.4 Operational equivalence
The uniqueness claimed by canonical CBR is not strict symbolic uniqueness under every possible formal redescription. It is uniqueness up to operational equivalence.
Two admissible channels are operationally equivalent if and only if they agree on all realization-relevant observables, record-structural verdicts, and accessibility-sensitive consequences of the declared context. This quotient notion is exactly the right one for the canonical theory. A realization law should not distinguish what the physical content of the context does not distinguish. What the theory selects, therefore, is not necessarily one syntactically unique formula, but one unique physical verdict class modulo operationally null reformulation.
This distinction matters because it prevents the theory from making a false show of uniqueness by confusing notational difference with physical difference. The Core paper’s claim is stronger than mere heuristic preference and weaker than empty formal absolutism. It is uniqueness at the level that matters for law.
3.5 Theorem 1 — Restricted Canonical Uniqueness
The first canonical closure result can therefore be stated in compact form.
Theorem 1 (Restricted Canonical Uniqueness).
Under the standing admissibility and regularity assumptions, the selected realization channel
Φ★C ＝ arg min{Φ ∈ 𝒜(C)} ℛ_C(Φ)
exists and is unique up to operational equivalence within the admissible class 𝒜(C).
The significance of this theorem is exact. It does not claim universal uniqueness across all logically conceivable realization-law alternatives. It claims that once the canonical law form and the restricted admissibility structure are fixed, realization is no longer left floating among many physically inequivalent admissible candidates. The law therefore does not merely constrain realization. It selects it.
3.6 Accessibility-signature burden at the canonical level
The canonical closure of the Core paper extends beyond law form and restricted uniqueness. It also establishes the accessibility-signature burden at the canonical level. The significance of that result is that accessibility, if it enters the law nontrivially, cannot remain operationally idle everywhere. More precisely, the Core paper proves that if accessibility is genuinely realization-effective, then in the designated protocol family the resulting response cannot remain globally baseline-equivalent across the full admissible accessibility domain.
That theorem does not yet give one exact platform, one exact comparator, and one exact instantiated response law. It does something earlier and indispensable. It forces the theory to accept that accessibility, if retained as physically relevant, must eventually incur a finite empirical burden. In that sense, the Core paper does not yet instantiate the law. It removes the possibility that the law could remain canonically specified while empirically silent.
3.7 Canonical closure result
The result of the Core paper is therefore exact and limited in the right way. It closes the theory at the law level. It fixes one canonically specified realization law, one restricted admissibility structure, one restricted uniqueness theorem, and one canonical accessibility-signature burden together with a finite falsification condition. What it does not yet provide is an exact model-level instantiation on one frozen experimental architecture. That burden remains open at the end of canonical closure and is precisely what the next stage of the program must answer.
In that sense, the Core paper completes the first true closure of the theory, but not the last. It yields one canonically specified realization-law object. It does not yet yield one exact empirical model. That second closure step is the task of Volume V and the task of the next section.
4. Exact Empirical Instantiation
4.1 Why one exact platform is enough
A realization-law theory does not first become scientifically real by spreading itself across many possible applications. It becomes scientifically real when one exact discriminator is declared strongly enough that the law either produces distinct empirical content there or fails to do so. One fully declared platform is therefore sufficient for exact empirical closure at the level currently earned by the program. The question is not whether every future implementation has already been covered. The question is whether the canonically specified law has now been forced onto one exact stage where it can be compared, challenged, and invalidated.
That is the function of Volume V. It does not widen the law. It does not replace the canonical closure of the Core paper. It performs the second closure step by forcing the canonically specified law into one exact platform-level instantiation.
4.2 Exact platform declaration
The declared platform is an accessibility-tunable delayed-choice quantum eraser. It contains a two-path signal subsystem carrying the primary interference burden, an idler-record subsystem carrying the path-defining record structure, a retrieval branch in which which-path information is made operationally accessible, an erasure branch in which which-path information is neutralized at the retrieval level, and a delayed-choice timing structure in which the retrieval-or-erasure decision occurs after signal detection while remaining part of the full context relevant to realization.
The primary observable is signal visibility. This is not an arbitrary measurement choice. It is the exact observable class through which the baseline and instantiated CBR responses are compared on the declared platform. The platform is therefore not one illustrative example among many. It is the exact architecture on which the theory’s second closure step is carried out.
4.3 Exact accessibility construction
On this platform, accessibility is no longer merely canonically admissible. It is exact. The platform-level accessibility variable is
η ＝ [R · P · T · (1 − D) · S]^(1/5),
where R is retrieval fidelity, P is public accessibility, T is temporal stability, D is destructive burden of readout, and S is redundancy spread. This reduction is not a loose phenomenological convenience within the present synthesis. It is the exact accessibility construction of the instantiated model.
The critical accessibility value η_c is then defined as the exact accessibility value at which the accessibility-sensitive burden becomes order-determining in the minimization structure of the law on the declared platform. That threshold is not merely empirical bookkeeping. It is the point at which accessibility becomes realization-effective in the exact model. The theory’s critical-regime signature burden is therefore tied to a law-internal accessibility threshold rather than to a visually convenient feature of the response curve.
4.4 Exact baseline response
On the declared platform, the exact orthodox comparator is
V_SQM(η) ＝ 1 − η.
This is the exact baseline response of the instantiated model. It is not a vague smooth-response intuition or a broad family of orthodox possibilities invoked after the fact. It is the frozen standard comparator written on the same exact signal–idler architecture, with the same accessibility axis, the same delayed-choice logic, and the same visibility observable as the instantiated CBR response.
This exact comparator matters because it prevents the theory from appearing distinct only by comparison to a weak or underspecified baseline. The law is now facing the strongest ordinary model the declared platform honestly permits.
4.5 Exact instantiated CBR response
On that same platform, the exact instantiated CBR response is
V_CBR(η) ＝ 1 − η − κ max{0, η − η_c},
with κ > 0 fixed.
This expression should be read carefully. The first term is the inherited orthodox baseline on the exact platform. The second term is the realization-sensitive correction induced by accessibility becoming order-determining at η_c. Below η_c, the instantiated response coincides with the baseline. At η_c, the realization-sensitive correction turns on. Above η_c, the slope of the realized response differs from the orthodox comparator by a fixed amount set by κ.
This is the point at which the law ceases to be only canonically specified and becomes an exact model-level response. The theory is no longer merely saying that accessibility matters in principle. It is stating the exact form in which accessibility changes the response on one declared platform.
4.6 Exact separation function
The exact separation between the two theories is therefore
ΔV(η) ＝ V_CBR(η) − V_SQM(η) ＝ −κ max{0, η − η_c}.
This function makes the second closure step visible in one line. Below η_c, the law and the comparator coincide. At η_c, the responses separate. Above η_c, the separation persists and grows according to the exact form fixed by the instantiated model.
At this point, the law is no longer merely canonically specified. It is exactly instantiated. The theory now contains one exact platform, one exact accessibility construction, one exact orthodox comparator, one exact instantiated realization-law response, and one exact separation function between them. The remaining question is no longer whether the theory has empirical content. It is what theorem sequence now follows from that exact instantiation.
5. Closure Theorem Sequence
The present paper fuses two distinct but now completed closure stages of the CBR program. The first is canonical law closure: the point at which the theory becomes one exact realization-law object rather than a family of structured possibilities. The second is exact empirical closure: the point at which that canonically specified law is forced onto one fully declared platform with one exact comparator, one exact response burden, and one exact failure condition. The purpose of this section is to state the theorem sequence by which those two stages are joined. The order of the theorems is not merely convenient. It is logically necessary. A realization-law theory cannot be exposed empirically until it has first been canonically fixed, and an exact empirical model does not matter unless the law it instantiates has already been narrowed enough to count as one public claim. (robertduraniv.com)
5.1 Law-closure layer
The first closure layer is law-level rather than model-level. It is the closure achieved by the Core Theorem Paper, and it is the reason the theory no longer remains a general framework under development.
Theorem 1 (Restricted Canonical Uniqueness).
The canonical law selects a unique realization channel up to operational equivalence within the restricted admissible class.
The significance of Theorem 1 is exact. It does not claim universal uniqueness across every conceivable realization-law alternative. It claims that once the law form and the admissibility structure are fixed, the selected realization verdict is not left floating among many physically inequivalent admissible candidates. The law therefore does not merely constrain realization. It selects it. (robertduraniv.com)
Theorem 2 (Accessibility-Signature Theorem).
If accessibility enters the canonical law nontrivially, the induced response cannot remain globally contained in the declared baseline class across the full admissible accessibility domain.
The significance of Theorem 2 is that the law, once canonically specified, cannot remain empirically idle if accessibility is genuinely realization-effective. The theorem does not yet fix one exact platform, one exact baseline response, or one exact model-level signature. It does something earlier and indispensable. It states that the theory, once it retains accessibility as a nontrivial burden term, must eventually leave the baseline class in some designated domain. The law is therefore no longer permitted to remain both canonically specified and operationally silent. (robertduraniv.com)
Taken together, Theorems 1 and 2 close the theory at the first exact stage. They yield one canonically specified realization law, one restricted admissibility structure, one restricted uniqueness result, and one finite canonical empirical burden. That is enough to make the theory a law-bearing object. It is not yet enough to make it an exact empirical model.
5.2 Instantiation-closure layer
The second closure layer is model-level. It is the closure achieved by Volume V, and it is the reason the theory can now be read not only as canonically specified, but as exactly exposed on one declared experimental architecture.
Theorem 3 (Exact Baseline/CBR Non-Equivalence).
On the declared delayed-choice platform, V_CBR(η) is not globally identical to V_SQM(η) if accessibility is realization-effective.
This theorem is the first exact consequence of instantiation. Once the exact platform, the exact accessibility construction, the exact orthodox comparator, and the exact instantiated CBR response are all frozen, the theory can no longer hide behind broad canonical possibility. It must answer the exact model-level question of whether the instantiated law and the instantiated baseline coincide. Theorem 3 says they do not, provided accessibility actually enters realization selection on the declared platform. (robertduraniv.com)
Theorem 4 (Critical-Regime Signature and Robust Detectability).
The non-equivalence concentrates near η_c, and the resulting strong-form or weak-form signature remains resolvable under bounded ordinary perturbations in the detectability-valid regime.
The significance of Theorem 4 is twofold. First, it states where the departure from the baseline must first become visible: not diffusely across the entire accessibility domain, but in a critical regime near η_c. Second, it states that this departure is not merely formal. Under declared detector, erasure, environmental, and calibration bounds, the exact model retains a resolvable signature burden. This is the theorem that turns exact instantiation into exact empirical exposure. (robertduraniv.com)
Theorem 5 (Binary Invalidation).
If the exact platform exhibits only baseline-class behavior under detectability-valid conditions, the instantiated canonical law is false.
The significance of Theorem 5 is final and severe. Once the exact law, the exact platform, the exact comparator, the exact signature burden, and the exact validity conditions are all fixed, null result is no longer merely disappointing evidence. It is theory death for the instantiated canonical form. The law is therefore not only exposed to possible support. It is exposed to exact public failure. (robertduraniv.com)
Taken together, Theorems 3 through 5 close the theory at the second exact stage. The canonically specified law is no longer only vulnerable in principle. It is now vulnerable on one declared platform, with one exact comparator, one exact signature burden, and one exact invalidation condition.
5.3 Why this theorem sequence is sufficient
This five-theorem sequence closes the theory in two exact stages: first as a canonically specified realization law, and then as an exactly exposed empirical model. The first layer fixes the law and prevents it from remaining underdetermined or empirically idle at the canonical level. The second layer fixes the exact model and prevents the canonically specified law from remaining only theoretically vulnerable rather than experimentally vulnerable. Together, the two layers do exactly what the updated stack now entitles the theory to claim and no more. (robertduraniv.com)
Nothing essential to the present empirical status of the theory lies outside this sequence. The law form, the admissibility structure, the uniqueness burden, the accessibility burden, the exact platform, the exact comparator, the exact signature, the detectability condition, and the invalidation condition are all contained within it. What remains outside this sequence belongs not to the present closure, but to the next exact burdens of the program.
6. What Is Now Closed
The strength of the present synthesis paper lies in the fact that it can now state, with precision, what burdens have actually been closed. Those closures are no longer distributed as aspirations across the program. They are now fixed enough to be named exactly.
First, the canonical law form is closed. The theory no longer proceeds through an indefinite family of possible realization rules. It proceeds through one canonically retained minimization law.
Second, restricted admissibility is closed. The admissible class is no longer left broad enough to shelter arbitrary realization maps under the appearance of structure. It is restricted by dynamical compatibility, representational invariance, record-structural coherence, accessibility consistency, and restricted probabilistic discipline.
Third, restricted uniqueness is closed. The law is no longer merely narrowing a space of possibilities. It selects a realization channel uniquely up to operational equivalence within the admissible class.
Fourth, operational accessibility at the canonical level is closed. Accessibility is no longer merely invoked as a conceptual category. It is built into the canonical law as a structured burden capable of incurring finite empirical consequence.
Fifth, the exact platform declaration is closed. The theory is no longer exposed only through a broad family of possible protocols. It is exposed on one declared delayed-choice accessibility-tunable quantum eraser architecture.
Sixth, the exact platform-level accessibility construction is closed. η is no longer merely canonically admissible; it is exactly constructed and calibrated on the declared platform.
Seventh, the exact orthodox comparator is closed. The baseline is no longer a broad smooth-response idea. It is one exact response law on the declared platform.
Eighth, the exact instantiated CBR responseis closed. The law is no longer only canonically specified. It is written in exact response form on one exact model.
Ninth, the exact critical-regime signature burden is closed. The theory no longer says merely that some departure may exist somewhere. It states where the departure must first concentrate and in what restricted form it may appear.
Tenth, the exact robust detectability condition is closed. The theory has specified the perturbative envelope under which its signature remains experimentally resolvable.
Eleventh, the exact binary invalidation condition is closed. The law is no longer only exposed to possible empirical support. It is exposed to public failure if the declared platform remains baseline-class under detectability-valid conditions.
Taken together, these closures are sufficient to make the theory a real public theory candidate. Not a complete universal theory of all foundations questions, and not an experimentally confirmed result, but a canonically closed and exactly exposed theory object whose law, empirical burden, and death condition are all now fixed strongly enough to be judged in ordinary scientific terms.
7. What Remains Open
The fact that the present theory is now closed enough to be a real public theory candidate does not mean every remaining burden of the broader program has been closed. Several burdens remain open, and they must be stated plainly.
First, universal closure over all realization-law rivals remains open. The present synthesis does not prove that every conceivable rival realization-law architecture is impossible, nor that every non-CBR completion of the outcome problem has been eliminated. What has been closed is the exact CBR object developed here, not the entire logical space of alternatives.
Second, universal multi-platform generalization remains open. The theory has one exact empirical instantiation. It does not yet have a universal theorem proving that every future architecture must admit the same accessibility construction, the same signature morphology, or the same invalidation structure. One exact platform has been closed. Universal transport of the theorem package to all future platforms has not.
Third, full non-circular Born-structure closure remains open. The updated stack has greatly sharpened the theory’s probabilistic discipline, especially through Volume IV and the Core paper, and it has excluded overt insertion at the level relevant to the present law form. But it has not yet delivered final universal non-circular closure of the full probabilistic structure of quantum theory. That burden remains distinct and unresolved.
Fourth, experimental confirmation or rejection remains open. The theory now has one exact public empirical burden and one exact invalidation condition, but nature has not yet answered it through completed laboratory confrontation. The theory is now experimentally exposed. It is not yet experimentally decided.
These are not hidden weaknesses inside the closed results. They are the next exact burdens of the program. That distinction matters. A theory becomes stronger when it states plainly what has been closed and what still remains to be earned. The present synthesis paper therefore does not conceal its open burdens. It isolates them. What is now closed is enough to make CBR a finite, public, and vulnerable theory candidate. What remains open defines the next frontier at which the theory must either deepen or fail.
8. Conclusion
The argument of this paper closes in two exact stages. At the first stage, CBR is fixed as a canonically specified realization law. For each physically specified context C, the realized channel is selected by the rule
Φ★C ＝ arg min{Φ ∈ 𝒜(C)} ℛ_C(Φ),
with
ℛ_C(Φ) ＝ αΞ_C(Φ) ＋ βΩ_C(Φ) ＋ γΛ_C(Φ).
Within the restricted admissibility structure, this law selects a realization channel uniquely up to operational equivalence and therefore no longer leaves realization underdetermined except by physically null reformulation. (robertduraniv.com)
At the second stage, that canonically specified law is forced onto one exact empirical architecture: an accessibility-tunable delayed-choice quantum eraser with a two-path signal subsystem, an idler-record subsystem, retrieval and erasure branches, delayed-choice timing structure, and visibility as the primary observable. On that exact platform, the orthodox comparator is
V_SQM(η) ＝ 1 − η,
while the instantiated canonical response is
V_CBR(η) ＝ 1 − η − κ max{0, η − η_c}.
The theory therefore no longer stands as a broad realization-law proposal alone. It stands as one exact law confronting one exact comparator on one exact model. (robertduraniv.com)
The closure of the theory is carried by a five-theorem sequence. Theorem 1 establishes restricted canonical uniqueness. Theorem 2 establishes the accessibility-signature burden at the canonical level. Theorem 3 establishes exact baseline/CBR non-equivalence on the declared platform. Theorem 4 establishes critical-regime signature and robust detectability under bounded ordinary perturbations. Theorem 5 establishes binary invalidation if the exact platform remains wholly baseline-class under detectability-valid conditions. Together these theorems close the theory first as a canonically specified realization law and then as an exactly exposed empirical model. Nothing essential to its present empirical status lies outside this sequence. (robertduraniv.com)
The exact failure condition is correspondingly severe. If the declared platform, under detectability-valid conditions, exhibits only baseline-class behavior across the physically relevant and experimentally accessible η-domain, then canonical CBR in this instantiated form is false. The law is therefore not protected by vagueness, by unlimited platform drift, by undeclared observables, or by post hoc reinterpretation of null result. Its burden is finite and public. (robertduraniv.com)
The boundary between closed and open burdens is now exact. What is closed is the canonical law form, the restricted admissibility structure, the restricted uniqueness result, the canonical accessibility burden, the exact delayed-choice platform, the exact accessibility construction, the exact comparator, the exact instantiated response, the exact critical-regime signature burden, the exact detectability condition, and the exact binary invalidation condition. What remains open is universal rival closure, universal multi-platform generalization, final non-circular Born-structure closure, and experimental confirmation or rejection. (robertduraniv.com)
Constraint-Based Realization is no longer presented here as a broad realization-law architecture, nor only as a canonically compressed formal proposal, but as a canonically closed and exactly exposed theory candidate whose central empirical burden is finite, public, and in principle experimentally decidable.
Appendix A. Imported Canonical Law Objects
This appendix fixes the minimum set of imported formal objects required for the synthesis paper to stand as one coherent closure document. Its purpose is not to reproduce the full appendix structure of the Core Theorem Paper, but to ensure that the top-level synthesis remains exact at the level of law.
Let ℋ denote the Hilbert space associated with the physical system under consideration, and let 𝒟(ℋ) denote the set of density operators on ℋ. The symbol C denotes a physically specified measurement context. The admissible class of realization-compatible channels associated with C is written 𝒜(C). The canonical realization functional is
ℛ_C : 𝒜(C) → ℝ_≥0,
with exact form
ℛ_C(Φ) ＝ αΞ_C(Φ) ＋ βΩ_C(Φ) ＋ γΛ_C(Φ),
where α, β, γ ≥ 0 are fixed theory-level coefficients. The selected realization channel is
Φ★C ＝ arg min{Φ ∈ 𝒜(C)} ℛ_C(Φ),
under the standing admissibility and regularity assumptions of the canonical theory. The operational accessibility variable is denoted by η, with η ∈ [0,1], and the critical accessibility value at which the accessibility-sensitive burden becomes order-determining is denoted by η_c. These objects are sufficient for the synthesis paper because they are the exact formal core that links the canonical closure of the Core Theorem Paper to the exact empirical closure of Volume V.
Appendix B. Exact Platform Summary
This appendix fixes the minimum model-level vocabulary of the exact delayed-choice platform used in the synthesis paper. Its purpose is not to reproduce the full platform appendix of Volume V, but to keep the synthesis exact at the level of empirical instantiation.
The declared platform contains a signal subsystem with two path alternatives and an idler-record subsystem carrying path-correlated record structure. The signal subsystem is the locus of the visibility measurement; the idler-record subsystem is the locus of record accessibility. The exact model also contains a fixed timing structure: state preparation, signal–idler entanglement, signal detection, and delayed retrieval-or-erasure selection. The platform contains a retrieval branch, in which which-path information is made operationally accessible, and an erasure branch, in which which-path information is neutralized at the retrieval level. The primary observable is signal visibility, reconstructed from the signal detection statistics and used as the exact response variable on which both the orthodox comparator and the instantiated CBR model are written. These elements are sufficient for the synthesis paper because they define the exact empirical stage on which the canonically specified law is exposed.
Appendix C. Exact Response Laws
This appendix fixes the exact response laws compared in the synthesis paper. Its role is to prevent the top-level closure object from becoming vague at the moment it turns from law to empirical exposure.
On the declared platform, the exact orthodox comparator is
V_SQM(η) ＝ 1 − η.
The exact instantiated canonical response is
V_CBR(η) ＝ 1 − η − κ max{0, η − η_c},
with κ > 0 fixed. The exact separation function is therefore
ΔV(η) ＝ V_CBR(η) − V_SQM(η) ＝ −κ max{0, η − η_c}.
These three equations are the minimum exact empirical core of the synthesis paper. They show that below η_c the two responses coincide, at η_c they separate, and above η_c the instantiated CBR response departs from the orthodox comparator in a way fixed by the model rather than by later interpretation.
Appendix D. Perturbation and Invalidation Summary
This appendix fixes the minimum perturbative and decision structure required for the synthesis paper to remain exact at the level of empirical exposure and public failure.
Let V_model(η) denote either the exact baseline response or the exact instantiated CBR response. The observed response is written as
V_obs(η) ＝ V_model(η) ＋ δ_det(η) ＋ δ_erase(η) ＋ δ_env(η) ＋ δ_cal(η),
where detector, erasure, environmental, and calibration perturbations are all bounded on the sampled accessibility domain. A test is detectability-valid only if the declared platform is genuinely realized, η is genuinely calibrated, the critical and postcritical regimes are included in the sampled domain, perturbations remain within the declared tolerance envelope, and the observable reconstruction has sufficient effective resolution to distinguish baseline containment from the strong-form or weak-form signature class.
The observed response belongs to the null-result class if it remains wholly absorbable into the declared perturbed baseline class across the relevant η-domain, exhibits no critical-regime derivative break or bounded non-baseline deviation class, and does not merely agree with the baseline in a truncated subcritical scan. Under detectability-valid conditions, if the observed response remains in that null-result class throughout the physically relevant and experimentally accessible η-domain, then the instantiated canonical law is false. That is the exact invalidation logic inherited by the synthesis paper from Volume V and retained here in compressed form.
