Constraint-Based Realization, Volume II

Admissibility Narrowing, Canonical Structure, and the Law-Candidate Problem

---

Copyright and Status Notice

Copyright © Robert Duran IV. All rights reserved.

No part of this publication may be reproduced, stored in a retrieval system, transmitted, or distributed in any form or by any means, including electronic, mechanical, photocopying, recording, or otherwise, without the prior written permission of the author, except in the case of brief quotations used in scholarly review, criticism, or citation in accordance with applicable law.

This volume is a work of formal theoretical research in quantum foundations. It advances mathematical, conceptual, and architectural claims concerning the Constraint-Based Realization (CBR) framework and the Quantum Assembly Unit (QAU) formalism. It does not present itself as settled orthodoxy, and it must not be read as claiming more than it explicitly establishes.

---

Status Discipline

The reader is asked to observe the following interpretive rule throughout this work:

Every claim is to be read strictly according to its stated logical status, and not one degree more strongly.

To eliminate ambiguity, the following categories are used with deliberate precision.

Axiom. A foundational postulate adopted as part of the formal architecture of the framework.

Assumption. A local or global hypothesis introduced for a specific argument, theorem, construction, or restricted-domain analysis.

Definition. A formally stipulated meaning assigned to an object, class, predicate, map, or structural relation.

Lemma. A supporting result used in the derivation of a later proposition or theorem.

Proposition. A formally stated result of substantive importance, narrower in scope than a principal theorem.

Theorem. A central formal result of the volume, established under explicitly stated assumptions.

Corollary. A consequence derived from a previously established proposition or theorem.

Conditional Corollary. A consequence that holds only under an additional restricted hypothesis, regularity condition, or structural strengthening.

Exclusion Lemma. A formally stated result establishing that a nearby candidate structure, channel class, weighting family, or realization functional fails one or more required conditions and is therefore inadmissible within the framework.

Counterexample. A construction demonstrating the failure of a proposed strengthening, an overly broad conjecture, or an insufficiently constrained formulation.

Conjecture. A claim regarded as plausible within the framework but not established in the present volume.

Remark. A clarification, interpretive observation, or structural note not carrying theorem-level force.

Objection. A serious internal or external challenge stated in its strongest form.

Response. A direct answer to a stated objection, limited to what the formal development actually supports.

Failure Condition. A statement identifying what would materially weaken, undercut, or defeat a given theorem program, argument, or law-candidate claim.

Open Problem. A precisely identified unresolved question whose resolution is necessary for stronger closure.

Interpretive Claim. A statement concerning conceptual meaning, explanatory force, or philosophical significance. Interpretive claims are not to be confused with formal theorems.

Empirical Hypothesis. A claim concerning possible operational consequences, testable distinctions, or experimental signatures. No empirical hypothesis is to be read as already empirically established merely because it is formally motivated.

---

Scope of the Present Volume

This volume does not replace Volume I. It is a work of restriction and theorem strengthening. Its purpose is to determine whether the formal architecture introduced in Volume I can be made materially narrower, less arbitrary, and more plausibly lawlike.

Its governing burden is therefore not breadth of exposition, but reduction of underdetermination. It should be read not as a manifesto for completion, but as an attempt to determine whether the candidate completion survives systematic restriction.

---

Negative Scope Claims

Unless explicitly established in the relevant chapter, this volume does not claim:

• a final universal admissibility theorem,

• a proof that the realization functional is uniquely canonical in all domains,

• an unconditional derivation of the Born rule,

• a final empirical discrimination theorem,

• complete closure of the outcome-selection problem in its strongest possible form.

Any stronger reading is unwarranted.

---

Positive Aim

What this volume does seek to establish, where successful, is narrower and more exacting:

• that admissibility can be materially constrained,

• that nearby illegitimate constructions can be excluded,

• that the range of acceptable realization orderings can be narrowed,

• that uniqueness can be strengthened under weaker assumptions,

• and that the status of Born-related claims can be subjected to a more severe non-circularity audit.

The governing standard of the work is simple:

A law becomes credible not by being declared, but by surviving restriction.

---

Dedication

For the principle that a law becomes credible only by surviving restriction.

---

Epigraph

What cannot withstand exclusion has not yet earned necessity.

---

Abstract

Volume I of this research program introduced the formal architecture of Constraint-Based Realization as a candidate framework for quantum outcome selection. It defined the primitive objects of the proposal, articulated an admissibility schema for realization channels, introduced a context-indexed realization functional, and stated a first tier of existence, consistency, invariance, and conditional compatibility results under explicitly marked assumptions. That opening task was necessary. It was not sufficient. A framework may be legible, internally disciplined, and formally suggestive while still remaining too permissive to count as a genuine law candidate. The purpose of the present volume is therefore not to replace Volume I, but to test whether its formal architecture survives restriction.

The central problem addressed here is the problem of underdetermination. If the admissible class of realization channels remains too broad, or if the realization functional remains too flexible, then the framework risks functioning only as a structured redescription of collapse-like behavior rather than as a materially constrained law of outcome selection. This volume therefore places the architecture under four distinct forms of pressure: admissibility narrowing, canonical narrowing of the realization functional, stronger uniqueness analysis under weaker assumptions, and explicit non-circularity scrutiny of Born-related claims.

The first principal result of the volume is a theorem program of admissibility narrowing. The book reformulates admissibility as a predicate architecture grounded in record stability, record accessibility, compositional compatibility, and invariance under physically irrelevant redescription. From this structure it derives nontrivial necessary conditions for admissibility, proves exclusion lemmas for nearby but illegitimate candidate channels, and establishes restricted characterization results in controlled settings. These results do not, by themselves, amount to a universal admissibility theorem in all domains, but they materially reduce the structural freedom previously left open.

The second principal result is a theorem program of canonical narrowing for the realization functional. Rather than treating a single concrete representative as sufficient, the volume develops structural constraints that any acceptable realization ordering must satisfy, including invariance, coarse-graining discipline, compositional constraints, regularity conditions, and anti-loading requirements intended to block concealed probabilistic importation. Under explicit hypotheses, the book then establishes restricted canonical-family results: not necessarily absolute uniqueness of the functional in every setting, but a substantial reduction in the space of acceptable realization orderings. It further develops adversarial eliminations of nearby rival functionals that fail the same shared constraints.

The third principal result is a strengthened analysis of uniqueness and degeneracy. Volume I deliberately limited uniqueness claims to settings in which the assumptions warranted them. The present volume attempts to weaken those assumptions while retaining formal discipline. It develops local uniqueness results, generic uniqueness results outside exceptional sets, and perturbative robustness results, while also distinguishing benign degeneracy from structurally fatal degeneracy. These results are intended not to overstate closure, but to determine whether the narrowing achieved in the admissible class and realization ordering materially improves the plausibility of lawlike selection.

The fourth principal result is an explicit non-circularity audit of Born-related claims. Volume I already distinguished Born compatibility, asymptotic adequacy, fixed-point behavior, and exact derivation, and it intentionally claimed only a limited and conditional Born standing. The present volume preserves that caution. It identifies possible sites at which Born structure could be covertly imported — through admissibility restrictions, functional design, repeated-trial assumptions, calibration conventions, or symmetry choices — and subjects those sites to direct scrutiny. Where possible, it develops conditional exclusion results against rival weighting families under shared structural constraints. No stronger Born claim is made than the arguments earn.

The book is equally explicit about what it does not establish. It does not claim a final universal admissibility theorem unless such a theorem is actually proved in the relevant domain. It does not claim an unconditional derivation of the Born rule unless that burden is truly met. It does not claim decisive empirical discrimination from standard quantum mechanics or rival completion frameworks, since that task belongs to a later and more explicitly operational phase of the program. The burden of the present work is narrower and harder: to determine whether the framework has crossed from flexible architecture toward serious law-candidate status.

If successful, the central achievement of this volume is therefore not empirical victory, not final closure, and not interpretive triumph. It is more exacting than that. It is the reduction of structural arbitrariness. It is the replacement of a broad completion schema by a narrower and more disciplined candidate-law architecture. It is the demonstration that the framework can survive restriction without pretending that every remaining burden has already been discharged.

In that sense, the governing question of this volume is not whether the program has already prevailed. It is whether the framework has now become narrow enough that stronger future demands — especially operational discrimination — can be imposed upon it without distortion. If that threshold is crossed, then the framework stands in a materially different position than it did at the end of Volume I. If it is not crossed, then the present volume will have clarified, rather than concealed, the limits of the proposal. Either result is preferable to unearned closure.

---

Preface

Why a Volume II Was Necessary

Volume I established the opening architecture of the Constraint-Based Realization program. It isolated the target problem, introduced the distinction between ordinary unitary evolution and outcome realization, defined the primitive formal objects of the framework, stated the admissibility schema, introduced the realization functional, and marked the first tier of results the framework could responsibly claim. That work was necessary. It produced a legible formal starting point. It imposed discipline where earlier or looser presentations could too easily have blurred architecture, interpretation, and proof status. It clarified what the proposal was attempting to be.

But a legible architecture is not yet a law candidate.

A framework may be coherent, inspectable, and formally promising while remaining too permissive to deserve the language of law. It may admit too wide a class of candidate channels. It may tolerate too many neighboring realizations of its own ordering structure. It may appear to narrow possibilities while leaving the decisive arbitrariness untouched. It may state conditional Born-compatible behavior while leaving unresolved the question of whether that behavior has been genuinely earned or merely relocated. It may present uniqueness where only strongly idealized assumptions make uniqueness available. These are not peripheral difficulties. They are the exact point at which a formal architecture either matures or fails.

Volume II exists because Volume I, by design, did not yet settle those questions.

This is therefore not a second introduction, not a broader interpretive survey, and not a rhetorical escalation. It is a restriction volume. Its burden is to determine whether the architecture established in Volume I survives a materially harder test. The question is no longer whether the framework can be stated clearly. The question is whether it can be made substantially less underdetermined.

That shift in burden matters. In foundational work there is a recurring temptation to confuse formal articulation with formal achievement. A scheme that can be expressed elegantly is not, for that reason alone, narrow enough to be taken as lawlike. A variational architecture that appears disciplined may still conceal too much freedom in the admissible class or in the ordering functional. A proposal that speaks in the language of constraint may still fail to show that the relevant constraints remove enough structural latitude. Volume II is written against that temptation. It seeks not to widen the architecture, but to tighten it.

The central challenge of the present volume may therefore be stated precisely. If admissibility narrowing fails, the framework remains too permissive. If canonical narrowing fails, the realization ordering remains too engineered. If stronger uniqueness fails, the selection rule remains too fragile to support lawlike status. If the non-circularity audit fails, any strengthened Born-related claim remains too exposed to hidden importation. These are not merely chapter themes. They are failure conditions for the volume as a whole.

Accordingly, the work proceeds in a stricter sequence than Volume I. It first reformulates admissibility as a predicate architecture rather than a partially descriptive schema. It then seeks necessary conditions for admissibility, exclusion results against nearby but illegitimate channel classes, and restricted characterization results in controlled settings. Only after the admissible class has been materially narrowed does it turn to the realization functional and ask whether acceptable orderings can themselves be constrained enough to avoid appearing chosen rather than discovered. Only after both of those burdens have been confronted does the volume address uniqueness and degeneracy in a sharpened way. Only after those gains are in hand does it return to Born-related questions, now not as an opening headline but as an audit of whether the earlier narrowing results actually reduce circularity risk.

This ordering is deliberate. It reflects a methodological judgment about what must be earned before stronger language becomes credible. A framework should not rush to its most visible conclusion before narrowing the structures on which that conclusion depends. The proper sequence is restriction first, consequence later.

The present volume is therefore both narrower and harsher than its predecessor. It is narrower because it does not attempt to become the empirical-discrimination volume. That phase belongs later. It is harsher because it allows the framework less comfort. Near neighbors must be excluded. Structural freedom must be shown to contract. Status claims must remain exact. If the result is only partial, that partiality must be stated plainly. If a theorem is restricted to finite-dimensional or otherwise controlled settings, that restriction must remain visible. If a circularity risk is reduced but not eliminated, that too must be said without embellishment.

In this respect, Volume II inherits the most important discipline of Volume I and sharpens it: the refusal to claim more than the formal development supports. The difference is that the present book now asks more of the development itself. The task is no longer simply to say what the framework is. The task is to determine whether the framework remains standing after its most important freedoms are challenged.

That, finally, is why this volume was necessary. A formal program reaches a decisive transition point when the question changes from Can it be formulated? to Can it survive narrowing? This book is written at that point.

If it succeeds, the gain is not final closure. It is something more exacting, and in some respects more important: the reduction of arbitrariness and the emergence of a structure that can begin plausibly to claim law-candidate status.

If it fails, the gain is still real. The failure will have been made explicit at the correct structural level, and the proposal will have been clarified rather than protected by vagueness.

In work of this kind, that is not a secondary virtue. It is the beginning of seriousness.

---

Formal Spine of Volume II

Orientation

This section states, in compressed and inspection-ready form, the exact burden of the present volume. It is intended for the technically alert reader who wishes to know, before entering the main body of the work, what question the volume asks, what theorem programs it develops, what failure conditions govern the inquiry, and what status claims it seeks to earn. Its purpose is not to replace the full argument but to expose its load-bearing structure.

Volume I established the formal opening architecture of the Constraint-Based Realization framework. It defined the relevant objects, stated a realization rule over an admissible class of candidate channels, and marked with discipline the limited standing of its principal results. The present volume begins where that one stopped. Its governing question is not whether the architecture can be stated. Its governing question is whether the architecture can be narrowed enough to count as a serious law candidate.

The Exact Question of the Volume

The central question of Volume II is the following:

Can the formal architecture introduced in Volume I be materially restricted in such a way that the framework becomes substantially less underdetermined, substantially less structurally permissive, and substantially more plausibly lawlike, without claiming stronger closure than the resulting arguments warrant?

This question has four components.

First, can the admissible class of realization channels be narrowed in a non-arbitrary way?

Second, can the realization functional be constrained strongly enough that its role appears structurally compelled rather than merely engineered?

Third, if the first two succeed, can uniqueness be strengthened under weaker assumptions and degeneracy be reduced to a less damaging role?

Fourth, do these gains materially improve the standing of Born-related claims by reducing, rather than merely acknowledging, the principal sources of circularity risk?

Everything in the volume is ordered around these four burdens.

Primary Theorem Program

Admissibility Narrowing

The primary theorem program of the volume is admissibility narrowing.

This is the first and most important task because the framework cannot become lawlike if the candidate class over which realization is defined remains too broad. A realization rule may appear precise while still leaving too many candidate channels available. If that occurs, the framework is not yet selecting under necessity. It is selecting within an insufficiently constrained field.

The admissibility program therefore does four things:

• it reformulates admissibility as a predicate architecture,

• it derives necessary structural conditions for admissibility,

• it proves exclusion lemmas against nearby but illegitimate channels,

• it seeks restricted characterization results in controlled settings.

The strongest possible outcome of this program is not rhetorical assurance that admissibility is narrow, but theorem-level reduction in admissible freedom.

Secondary Theorem Program I

Canonical Narrowing of the Realization Functional

Even if the admissible class narrows, the framework remains vulnerable if the realization ordering itself still appears too flexible. A law cannot become credible merely by restricting its domain while leaving its ordering principle underconstrained.

The second theorem program therefore addresses the realization functional.

Its burden is to distinguish sharply between the abstract role of a realization ordering and the concrete family of acceptable realizations of that role. It then imposes structural requirements on any acceptable functional, including invariance, composition behavior, regularity, coarse-graining discipline, and anti-loading constraints. The aim is not necessarily to prove full uniqueness of the functional in every setting. The nearer-term objective is to reduce the space of acceptable realization orderings to a restricted canonical family.

If this program fails, the framework remains too exposed to the charge that its central ordering structure is chosen rather than discovered.

Secondary Theorem Program II

Uniqueness and Degeneracy Under Strengthened Structure

If admissibility narrows and the functional narrows, the next question is what those gains imply for realized selection itself.

Volume I stated uniqueness only where the assumptions warranted it and declined to claim a universal uniqueness theorem. The present volume seeks to strengthen that standing. It develops local uniqueness results, generic uniqueness results outside exceptional sets, and robustness results under perturbation, while simultaneously analyzing the meaning of degeneracy.

The point of this program is not to force uniqueness where it cannot honestly be proved. It is to determine whether the earlier narrowing results materially improve the plausibility of lawlike single-outcome selection. If uniqueness remains available only under trivial idealizations, the framework remains too fragile. If degeneracy remains extensive and structurally central, the law-candidate claim weakens correspondingly.

Secondary Theorem Program III

Non-Circularity Audit of Born-Related Claims

The Born-related analysis is not the opening headline of this volume. It is the audit stage.

Volume I already distinguished compatibility, asymptotic adequacy, fixed-point structure, and exact derivation, and it deliberately claimed only a conditional and limited Born standing. The present volume preserves that discipline. It does not begin by asserting a stronger Born result. It asks instead whether the preceding narrowing programs materially reduce the principal sites at which Born structure might have been covertly imported into the framework.

Those sites include admissibility restrictions, functional design, repeated-trial assumptions, calibration conventions, and symmetry choices.

The burden of this program is therefore exacting and limited. It does not promise a final unconditional derivation unless that burden is truly met. It seeks instead to determine whether circularity has been reduced in a formally significant way, and whether rival weighting families can be excluded under shared structural requirements.

The Failure Ladder

The most direct way to understand the logic of this volume is through its failure ladder.

If admissibility narrowing fails, the framework remains too permissive.

In that case, the candidate field remains too broad for any downstream realization rule plausibly to count as lawlike.

If canonical narrowing fails, the ordering structure remains too engineered.

In that case, even a narrowed admissible class would leave too much freedom in the principle of selection.

If stronger uniqueness fails, the framework remains too fragile to support lawlike selection.

In that case, the framework may retain mathematical coherence while lacking the structural force required of a candidate outcome law.

If the Born audit fails, any strengthened Born claim remains too vulnerable to circularity.

In that case, the framework may still possess a narrowed architecture, but its Born-related consequences remain insufficiently purified of hidden importation.

This ladder is not rhetorical. It states the actual success and failure conditions of the book.

Exact Status Claims the Volume Aims to Earn

The volume aims to earn the following status claims, and no stronger ones.

First, that admissibility can be materially narrowed by theorem-level conditions and exclusions.

Second, that acceptable realization functionals can be reduced to a substantially narrower structural family than was available in Volume I.

Third, that uniqueness can be strengthened beyond its earlier standing, at least in controlled domains and under weaker assumptions than before.

Fourth, that major sites of Born-related circularity can be explicitly identified and, where possible, materially reduced.

Fifth, that the framework may, if the preceding programs succeed, be said to have advanced from flexible formal architecture toward serious law-candidate status.

The volume does not aim to earn, unless actually proved in the text, any of the following stronger claims:

• a final universal admissibility theorem,

• full canonical uniqueness of the realization functional in all domains,

• an unconditional derivation of the Born rule,

• a decisive empirical discrimination theorem.

These remain outside the warranted standing of the present volume unless established explicitly.

Minimal Formal Carry-Forward

The book presupposes the basic Volume I architecture:

• a measurement context C,

• an admissible class 𝒜(C) of candidate realization channels,

• a context-indexed realization functional ℛᶜ,

• and a realized channel selected, where appropriate, through a minimization rule of the schematic form

Φ∗(C) = arg min_{Φ ∈ 𝒜(C)} ℛᶜ(Φ).

The purpose of Volume II is not to replace this architecture but to narrow the freedom residing in each of its nontrivial components.

Why the Ordering of the Book Matters

The structure of the volume is itself an argument.

It begins with admissibility because narrowing must start at the level of the candidate class.

It then turns to the realization functional because a narrow candidate field is not enough if the ordering principle remains flexible.

It then studies uniqueness and degeneracy because those questions cannot be responsibly addressed until the first two forms of narrowing are in place.

It turns to Born-related scrutiny only after those tasks because the status of Born claims depends on the structural integrity of the earlier programs.

This order reflects a methodological commitment:

restriction first, consequence later.

What Counts as Success

The volume succeeds if it demonstrates that the framework is significantly less underdetermined than it was at the end of Volume I, that this reduction is not merely verbal, and that the resulting structure is narrow enough to justify a materially stronger law-candidate claim.

What Counts as Honest Failure

The volume fails honestly if it shows that one or more of the decisive narrowing programs cannot yet be carried far enough to support that stronger claim.

Such failure would not nullify Volume I. It would instead clarify where the architecture remains too permissive, too engineered, or too exposed to circularity. In work of this kind, explicit failure at the correct structural level is preferable to false closure.

Formal Standing Sought at the End of the Volume

By the end of Volume II, the framework should be classifiable into one of three states.

It may remain too underdetermined to count as a serious law candidate.

It may become a serious law candidate, though not yet an empirically distinct theory.

Or it may become sufficiently narrowed that empirical discrimination is no longer optional but the unavoidable next stage of development.

The task of the volume is to make that verdict possible.

Transition

Everything that follows is written under the burden just stated. The aim is not to protect the framework from its strongest objections, but to force it through them. If it survives narrowing, its standing changes. If it does not, the limits will have been made visible at the level that matters most.

That is the point of Volume II.

---

PART I — THE CHALLENGE VOLUME II MUST MEET

Chapter 1

What Volume II Must Prove

1.1 Orientation

This chapter states the burden of the present volume in the hardest form in which it can be stated without distortion. Volume I established the formal opening architecture of the Constraint-Based Realization framework. It identified the target problem, introduced the admissibility schema for realization channels, defined the role of the realization functional, and marked the exact limits of the claims it was prepared to make. That was the correct first task. It was not the final one.

A framework may be formally legible and still remain too permissive. It may exhibit internal discipline while leaving too much structural freedom in the admissible class. It may offer a realization rule while preserving so much latitude in the candidate space or in the ordering principle that its apparent lawfulness dissolves under scrutiny. It may even present conditional Born-compatible behavior while leaving unresolved whether the relevant structure has been genuinely earned or merely redistributed across assumptions, admissibility conditions, or functional design. The burden of Volume II is therefore not to enlarge the architecture, but to test whether the architecture survives restriction.

The central question is narrower than the one addressed in Volume I and, for that reason, harder. Volume I asked whether the framework could be stated with sufficient formal discipline to count as a serious opening architecture. Volume II asks whether that architecture can be made substantially less underdetermined without overclaiming. This is the transition point at which a framework either begins to acquire law-candidate status or reveals the extent to which its apparent necessity remains only schematic.

The chapter proceeds by identifying what Volume I established, what it explicitly left open, why underdetermination is now the central issue, why admissibility constitutes the first bottleneck, why canonicality constitutes the second, why uniqueness and Born-related standing depend on both, and why empirical discrimination, though increasingly unavoidable, remains deferred to a later stage.

1.2 What Volume I Established

Volume I established the formal architecture within which the present volume operates. That architecture can be stated in minimal form as follows.

There is a measurement context C comprising, at minimum, a system, a measurement arrangement, an environmental structure sufficient to support record formation, and an accessible record structure through which realized outcomes can be publicly stabilized and tracked. Within such a context, one defines an admissible class 𝒜(C) of candidate realization channels Φ. One then introduces a context-indexed realization functional ℛᶜ defined over that class, and, under explicitly stated assumptions, one identifies a realized channel by a rule of the schematic form

Φ∗(C) = argmin_{Φ ∈ 𝒜(C)} ℛᶜ(Φ).

The significance of Volume I did not lie in claiming that this rule had already been fully justified in its strongest possible form. Its significance lay in establishing a disciplined architecture in which the relevant questions could be asked with greater exactness than before. In particular, Volume I separated the problem of ordinary unitary evolution from the problem of realized single-outcome selection. It distinguished formal architecture from interpretive elaboration. It marked the difference between what was postulated, what was defined, what was argued, what was established under assumptions, and what remained open. That claim-status discipline was one of its strongest contributions.

More specifically, Volume I established the following first-tier accomplishments.

First, it identified admissibility as a structurally meaningful notion rather than as an arbitrary placeholder. Admissibility was not treated merely as “whatever channels one happens to like,” but as a candidate structural filter tied to record stability, record accessibility, compositional coherence, and invariance under physically irrelevant redescription.

Second, it introduced the realization functional in a way that distinguished its abstract role from provisional concrete representatives. This was crucial. A framework that conflates the role of an ordering principle with one favored instantiation of that principle risks hiding engineering choices under the appearance of inevitability.

Third, it established a first tier of existence, consistency, and invariance results under explicitly stated assumptions. These results did not amount to final closure, but they showed that the framework was not empty, not purely rhetorical, and not obviously incoherent.

Fourth, it marked the standing of its Born-related claims with discipline. Rather than claiming an unconditional derivation, Volume I restricted itself to a much narrower and more cautious position. It distinguished compatibility from derivation, asymptotic adequacy from exact recovery, and conditional fixed-point behavior from final probabilistic closure.

Fifth, it refused the temptation to substitute ambition for proof. It did not claim a universal uniqueness theorem. It did not claim decisive empirical discrimination. It did not present its opening architecture as though the later theorem burdens had already been discharged.

These achievements matter because they define the inherited baseline of the present volume. Volume II is not written against Volume I. It is written from within the formal space Volume I made available.

1.3 What Volume I Explicitly Left Open

The burden of Volume II becomes intelligible only if one sees with precision what Volume I did not claim to settle.

The first major open issue is admissibility narrowing. Volume I introduced admissibility as a structurally motivated filter, but it did not yet prove that the admissible class is narrow enough to count as substantially constrained rather than selectively curated. It did not yet show, in sufficiently strong generality, that the candidate class collapses to a sharply restricted family under principled structural demands. This was not an oversight. It was a deferred burden.

The second major open issue is canonicality. Volume I introduced a realization functional and distinguished its abstract role from provisional concrete representatives, but it did not yet prove that the range of acceptable realization orderings is narrow enough to support a claim of essential canonicality. A proposal may possess a realization functional and still leave too many neighboring functionals viable. If that occurs, the ordering structure remains too engineered.

The third major open issue is uniqueness under weakened assumptions. Volume I allowed itself only those uniqueness claims warranted by the local strength of its assumptions. It did not pretend to possess a universal uniqueness theorem. It did not show that uniqueness survives beyond carefully controlled settings. It did not yet demonstrate that degeneracy is sufficiently exceptional to preserve lawlike status.

The fourth major open issue is the non-circular standing of Born-related claims. Volume I exercised caution in this domain, but caution alone does not remove circularity. The central question was not merely whether a Born-compatible pattern could be exhibited under explicit assumptions. The deeper question was whether hidden importation might be occurring through admissibility conditions, functional design, trial assumptions, calibration conventions, or symmetry choices. Volume I identified this vulnerability. It did not yet fully audit it.

The fifth major open issue is empirical discrimination. Volume I did not claim decisive operational separation from standard quantum mechanics or from rival completion strategies. This was appropriate. A framework ought not to rush to empirical claims before clarifying whether it has earned enough structural narrowing to deserve them. But the deferral of empirical discrimination leaves open a downstream burden: if the framework survives restriction, it must eventually face operational testing.

These open issues are not peripheral. They are exactly the point at which a formal architecture either matures into a serious law-candidate proposal or remains an internally interesting but structurally underdetermined schema.

1.4 Why Underdetermination Is Now the Central Issue

Once a formal architecture exists, the central problem ceases to be articulation and becomes underdetermination. This shift is decisive.

A framework is underdetermined when too many distinct realizations of its central structure remain compatible with its stated principles. In the present context, underdetermination arises when the admissible class remains too broad, when the realization functional remains too flexible, when uniqueness is available only under special idealizations, or when claimed consequences can be reproduced by multiple structurally distinct constructions without any principled basis for choosing among them.

Why is this now the central issue? Because the law-candidate question is no longer whether one can write down a realization rule. It is whether the rule, together with its domain and its ordering structure, is sufficiently constrained to deserve the language of law rather than framework.

A law-like proposal must do more than describe a formal mechanism by which realized outcomes could be selected. It must narrow possibilities under principled structural pressure. It must show that nearby alternatives are not merely unfavored but excluded. It must make its own freedom visible and then reduce it. Where it cannot reduce it, it must say so.

Underdetermination is therefore not a secondary technical annoyance. It is the exact measure of whether the framework has advanced beyond articulate incompletion.

In the present program, four forms of underdetermination are especially important.

The first is candidate underdetermination: too many realization channels remain admissible.

The second is ordering underdetermination: too many realization functionals remain structurally available.

The third is selection underdetermination: even after admissibility and ordering are fixed, too many minimizers remain available, or uniqueness depends on assumptions too narrow to support general lawlike standing.

The fourth is consequence underdetermination: claims about Born-related behavior or downstream explanatory power remain reproducible by multiple structurally distinct constructions, leaving it unclear whether the framework has earned those consequences or merely parameterized them.

Volume II is organized to attack these forms of underdetermination in the order in which they must be attacked. That order matters. Admissibility must narrow before canonicality can be judged. Canonicality must narrow before uniqueness claims become meaningful at the correct level. Only after these forms of restriction have been attempted can Born-related claims be audited with seriousness.

1.5 Why Admissibility Is the First Bottleneck

Admissibility is the first bottleneck because no realization law can become credible if the class over which it operates remains too permissive.

Suppose one has a realization rule of variational form. If the candidate field over which the minimization occurs is too broad, then the resulting selected channel may appear precise while inheriting its apparent exactness from a background of unchecked freedom. The lawlike status of the selection rule would then be illusory. One has not derived necessity. One has only selected against an overly generous background.

The issue is not whether some admissibility filter can be written down. The issue is whether admissibility can be made to look discovered rather than merely stipulated. For that to occur, admissibility must be grounded in structural predicates that do actual work. Record stability, record accessibility, compositional compatibility, and invariance under physically irrelevant redescription are not important because they sound principled. They are important only if they narrow the candidate space in a way that excludes nearby but illegitimate alternatives.

Admissibility is therefore prior to the rest of the theorem program. If admissibility cannot be narrowed, then everything downstream inherits that looseness. A canonical functional defined over an excessively permissive class is still hostage to permissiveness. A uniqueness theorem over an excessively permissive class is still uniqueness within the wrong domain. A Born audit performed over an excessively permissive class remains exposed to hidden loading through the candidate field itself.

The first burden of Volume II is therefore severe but simple to state: demonstrate that admissibility can be materially constrained. Not merely described. Not merely motivated. Constrained.

If this burden fails, the framework remains too permissive.

1.6 Why Canonicality Is the Second Bottleneck

Even if admissibility narrows, the framework remains underdetermined if the realization functional remains too flexible.

A law candidate requires not only a narrow candidate field but also a sufficiently constrained principle of selection. If multiple structurally distinct orderings remain equally available, and if no principled reason is given for privileging one narrow family over others, then the appearance of necessity remains weak. One may have narrowed the field and still left the central ordering principle engineered.

The problem of canonicality is therefore not cosmetic. It concerns whether the realization functional is structurally compelled, or at least structurally narrowed enough to avoid appearing arbitrarily chosen. This does not mean that Volume II must prove absolute uniqueness of the functional in all domains. Such a burden may be too strong at the present stage. But it must show substantial contraction of the acceptable family.

Canonicality becomes the second bottleneck because admissibility narrowing alone cannot answer the question: why this ordering rather than a neighboring one? That question grows sharper, not weaker, once admissibility has been narrowed. The more the candidate field is restricted, the more visible the freedom in the ordering principle becomes. A framework that survives the first bottleneck only to fail at the second has not yet earned lawlike status.

Moreover, the canonicality problem is entangled with hidden importation risks. A functional may appear mathematically elegant while covertly encoding probabilistic structure or outcome preferences that the framework later advertises as derived. A credible canonicality analysis must therefore include anti-loading conditions, invariance conditions, compositional conditions, and regularity constraints stringent enough to make concealed encoding difficult.

If canonical narrowing fails, the ordering structure remains too engineered.

1.7 Why Uniqueness and Born Claims Depend on the First Two

Uniqueness and Born-related standing are not independent theorem programs floating above admissibility and canonicality. They depend on both.

Consider uniqueness first. A uniqueness theorem can have genuine law-candidate significance only if it is a theorem about the right candidate class under the right ordering principle. If admissibility is too broad, uniqueness may merely identify a preferred point within an overly unconstrained field. If the ordering principle is too flexible, uniqueness under one favored functional says little about whether the framework itself, rather than one chosen realization of it, has become lawlike. Thus uniqueness must be understood as downstream of the first two bottlenecks.

The same holds, with greater force, for Born-related claims. If the admissible class covertly excludes non-Born-like structures by construction, or if the realization functional covertly privileges Born-compatible weighting behavior, then downstream success in recovering or approximating Born structure has little evidential value. Such success would not show that the framework earns its probabilistic standing. It would show only that the standing was hidden in the structural premises.

This is why Volume II treats Born scrutiny as an audit rather than as an opening headline. The right question is not, at the outset, whether one can produce stronger Born-related statements. The right question is whether earlier narrowing results have materially reduced the pathways through which hidden importation can occur. Only then does a Born audit become meaningful.

Uniqueness and Born standing therefore depend on the first two bottlenecks in both a logical and a methodological sense. Logical, because the relevant theorems presuppose a candidate domain and an ordering principle. Methodological, because the interpretive significance of those theorems depends on whether that domain and that principle have themselves been narrowed.

1.8 Why Empirical Discrimination Is Still Deferred

At this stage, empirical discrimination remains deferred, not because it is unimportant, but because it is downstream of a prior question: whether there is a sufficiently narrowed structure to discriminate in the first place.

A framework that has not yet survived restriction is not yet ready to treat empirical distinctness as its main burden. If admissibility remains permissive, if the ordering structure remains engineered, if uniqueness remains fragile, and if Born-related standing remains exposed to circularity, then empirical proposals risk becoming premature or even misleading. They may attach operational language to a structure that has not yet earned the right to be tested as a serious law candidate.

This does not mean empirical discrimination is optional forever. On the contrary, the more successful Volume II becomes, the less optional the empirical phase will be. A framework that survives narrowing enters a different epistemic position. It no longer asks merely to be understood; it asks to be confronted operationally. But that confrontation must come at the proper stage.

The methodological sequence is therefore strict: restriction first, operational consequence later.

Volume II must thus resist a familiar temptation. It must not attempt to compensate for unresolved structural underdetermination by gesturing prematurely toward empirical significance. The correct burden here is to determine whether the framework becomes narrow enough that a later empirical volume is not merely possible but obligatory.

1.9 Formal Standing of the Chapter

This chapter has not yet proved any narrowing theorem. Its role has been preparatory but exacting. It has identified the inherited baseline from Volume I, clarified the principal open burdens, and stated the logic by which those burdens must now be confronted. In particular, it has established that underdetermination is the central problem of the present volume, that admissibility and canonicality are the first two bottlenecks, that uniqueness and Born standing are downstream of those bottlenecks, and that empirical discrimination remains deferred for principled rather than evasive reasons.

The next chapter now states the strongest objection under which the entire volume must operate.

Formal gain

This chapter has fixed the governing burden of Volume II at the correct structural level. It has shown that the central question is not whether the framework can be articulated, but whether it can be materially narrowed without overclaiming. It has also established the hierarchy of burdens that must govern the rest of the volume: admissibility first, canonicality second, uniqueness and Born scrutiny downstream, empirical discrimination later.

Residual vulnerability

Nothing in this chapter by itself reduces underdetermination. It only states where underdetermination resides and why it matters. If the subsequent chapters fail to materially narrow admissibility or the realization functional, the present chapter will stand merely as a lucid diagnosis of insufficiency rather than as the opening of a successful strengthening program.

Why this matters for Volume II

Without this clarification of burden, the remainder of the volume would risk diffuseness. The chapter forces the book to be judged by its true difficulty: whether the framework survives restriction.

Next necessity

The next chapter must formulate the underdetermination objection in its strongest form and make explicit what would count as genuine success against it.

Chapter 2

The Underdetermination Objection

2.1 Orientation

Every serious formal framework should be confronted by the strongest objection internal to its own ambitions. In the present case that objection can be stated without ornament:

A proposed law of outcome selection that leaves the admissible class too broad, or the realization functional too flexible, may do no more than redescribe collapse-like behavior in elevated language.

This objection is not a misunderstanding of the framework. It is the framework’s sharpest internal pressure point. It asks whether the architecture introduced in Volume I genuinely narrows the structure of realized selection, or whether it merely relocates the discretionary elements into the admissible class, the ordering principle, or the background assumptions under which the variational rule is allowed to operate.

This chapter formulates that objection in its cleanest and strongest form. It distinguishes architecture from law, explains how permissiveness undermines lawlike standing, shows how flexibility in admissibility and functional choice can hide arbitrariness, clarifies why Born compatibility without narrowing is evidentially weak, and then states the standard of success for the present volume.

The chapter is intentionally severe. It is not designed to comfort the framework. It is designed to force it into exact self-judgment.

2.2 The Difference Between an Architecture and a Law

A formal architecture is not yet a law. The distinction is not rhetorical but structural.

An architecture identifies a space within which lawlike claims might eventually be formulated. It defines objects, relations, candidate mechanisms, admissible domains, and organizing principles. It may be elegant, coherent, and insightful. But it remains an architecture so long as the decisive freedoms have not been reduced sufficiently to support the claim that nature is being constrained, rather than merely parameterized.

A law, by contrast, is not merely a rule stated within a formal framework. A law is a narrowed structure. It excludes nearby alternatives not because they are aesthetically inferior, but because they violate conditions that have themselves earned necessity or near-necessity within the theory’s own domain.

The present framework, at the end of Volume I, clearly possessed architecture. It did not yet fully possess law-candidate standing. This is not a criticism of Volume I. It is an index of where the program stood. Volume I successfully provided the formal opening. But once the opening exists, the distinction between architecture and law becomes unavoidable. The question is no longer whether one can write

Φ∗(C) = argmin_{Φ ∈ 𝒜(C)} ℛᶜ(Φ),

but whether 𝒜(C) and ℛᶜ are sufficiently constrained that this rule begins to carry lawlike force.

The underdetermination objection enters exactly here. If the class 𝒜(C) remains too broad, or the family of acceptable ℛᶜ remains too wide, then one has not yet crossed from architecture to law. One has only written an architecture within which many nearby laws, or quasi-laws, could still be entertained.

2.3 How Permissiveness Undermines Lawlike Status

Permissiveness is not merely a lack of elegance. It is a structural weakness.

A framework is permissive when its formal conditions leave too much room for materially different candidate realizations of its central mechanism. In the present context, permissiveness appears at least twice: in the admissible class of realization channels and in the range of acceptable realization functionals.

Why does this matter so much? Because the more permissive the framework is, the easier it becomes for downstream success to be explained away as a consequence of prior freedom. A selected channel may appear uniquely privileged only because the candidate field was never adequately constrained. A preferred functional may appear structurally natural only because too few nearby alternatives were tested or excluded. A purported consequence may appear informative only because the premises were permissive enough to accommodate it.

Permissiveness therefore undermines lawlike status in three connected ways.

First, it weakens exclusion. If many nearby structures remain viable, then the framework has not yet shown that it is selecting under necessity.

Second, it weakens explanation. A law explains not merely by producing an outcome but by reducing the space of alternatives under principled conditions.

Third, it weakens evidential value. If multiple structurally distinct constructions yield similar downstream consequences, then the appearance of success attaches to the flexibility of the architecture rather than to the force of the law candidate.

In foundational work, permissiveness is especially dangerous because it can masquerade as depth. A broad architecture can generate a wide range of interesting-looking structures. But richness of architecture is not the same thing as narrowness of law.

2.4 How Flexibility in Admissibility and Functional Choice Can Hide Arbitrariness

The most serious form of arbitrariness is not explicit arbitrariness. It is concealed arbitrariness that appears principled because it has been embedded one layer deeper than the stated claim.

In the present framework, there are two primary hiding places.

The first is admissibility. Suppose the admissible class is defined using criteria that appear structural but are in fact too elastic. Then the framework can quietly exclude undesirable channels while preserving the appearance that admissibility is discovered rather than curated. In such a case, the selection rule inherits a false aura of necessity from a candidate field whose boundaries were never sufficiently earned.

The second hiding place is the realization functional. Suppose the functional is presented as though its form follows naturally from the architecture, while in reality nearby functionals with materially different consequences remain equally plausible. Then the framework has not yet identified a lawlike ordering principle. It has merely chosen one representative within a still-wide family.

These two hiding places can reinforce one another. A permissive admissible class may make a favored functional look indispensable. A permissive functional family may make a chosen admissibility schema look more selective than it really is. The result is a double illusion of necessity.

This is why Volume II treats admissibility and canonicality as separate but linked bottlenecks. Each is a potential site of concealed arbitrariness. The framework can survive only if both are forced through sharper restriction.

2.5 Why Born Compatibility Without Narrowing Is Not Enough

One of the most important consequences of the underdetermination objection is that Born-related success, by itself, is weak evidence unless the earlier layers of the framework have already been narrowed.

Suppose a framework exhibits Born-compatible behavior under certain admissibility conditions, certain trial assumptions, or a certain family of realization functionals. What does that show? At minimum, it shows that the framework can reproduce or sustain Born-like structure in the stated domain. That is not trivial. But it is also not yet strong evidence that the framework has earned that structure.

For such evidence to be strong, one must know that Born-like behavior was not hidden in the premises. If the admissible class excludes non-Born-like constructions by design, or if the realization functional privileges Born-compatible weighting patterns by structural choice, then downstream success carries less force than it first appears to carry. It may still be of interest, but it is no longer evidence of non-circular derivation or robust explanatory gain.

Born compatibility without prior narrowing is therefore insufficient. It may indicate internal coherence. It does not by itself indicate law-candidate strength.

This is not a counsel of pessimism. It is a rule of evidential hygiene. A framework must earn the right to treat its own consequences as evidentially load-bearing. That right is earned through restriction.

2.6 The Standard of Success for This Volume

The objection stated above cannot be answered by rhetoric, and it cannot be answered by merely restating the architecture more elegantly. It can be answered only by a specific form of structural achievement.

The standard of success for Volume II is therefore the following.

First, admissibility must narrow in a way that is nontrivial and exclusion-capable. The relevant predicates must do real work. Nearby illegitimate channels must be ruled out under conditions that are themselves structurally intelligible.

Second, the realization functional must narrow enough that the space of acceptable orderings contracts materially. It is not necessary that this contraction produce absolute uniqueness in all domains. It is necessary that the contraction be strong enough to undercut the charge of free engineering.

Third, uniqueness must improve in significance as a consequence of the first two gains. If uniqueness remains wholly hostage to narrow idealization, then the law-candidate burden remains unmet.

Fourth, the Born audit must show a material reduction in circularity exposure. It need not achieve final unconditional derivation to count as progress. But it must do more than repeat caution. It must reduce vulnerability.

If these gains occur, then the framework may plausibly claim to have crossed from articulate architecture toward law-candidate status.

If they do not occur, then the objection stands.

2.7 Formal Standing of the Objection

The underdetermination objection is not a theorem. It is a challenge condition under which the rest of the volume must be read. Its force lies in the fact that it names the exact mechanism by which a formal completion schema can fail while still appearing sophisticated.

It would be a mistake to try to neutralize the objection too early. The correct approach is to preserve its full force and allow the subsequent chapters to earn whatever answer is available.

Formal gain

This chapter has formulated the strongest internal objection to the framework in its cleanest form. It has distinguished architecture from law, shown how permissiveness and flexibility can conceal arbitrariness, and explained why downstream Born compatibility has limited evidential force unless earlier narrowing has already occurred.

Residual vulnerability

The objection remains entirely alive. No reduction of underdetermination has yet been achieved. If later chapters fail to materially narrow admissibility and the realization functional, this objection will not merely survive; it will effectively diagnose the framework’s limiting condition.

Why this matters for Volume II

This chapter sets the standard by which the rest of the volume must be judged. It prevents the framework from mistaking formal elegance for structural necessity.

Next necessity

The next chapter must restate only the minimal Volume I machinery needed to carry out the narrowing arguments, without reintroducing unnecessary bulk or conceptual looseness.

Chapter 3

Minimal Restatement of the Volume I Core

3.1 Orientation

The present volume is not a second introduction. It therefore requires a compressed restatement of the Volume I core that is minimal in extent but exact in form. The purpose of this chapter is not to re-argue the opening architecture, but to isolate the formal machinery without which the narrowing programs of Volume II cannot proceed.

Three principles govern the restatement.

First, it must be sufficient for theorem use. The objects carried forward must be defined with enough exactness to support later restriction results.

Second, it must be minimal. Anything not needed for admissibility narrowing, canonicality analysis, uniqueness strengthening, or Born auditing should be omitted from this carry-forward chapter.

Third, it must preserve the status discipline of Volume I. Definitions remain definitions, inherited first-tier results remain inherited first-tier results, and items not yet strengthened remain hypotheses rather than unearned conclusions.

The chapter therefore restates the formal role of measurement contexts and accessible record structure, defines admissible channels as realization candidates, recalls the realization functional and minimization rule, records the first-tier existence and consistency results inherited from Volume I, and identifies which inherited components are now treated as hypotheses for strengthening.

3.2 Measurement Contexts and Accessible Record Structure

The basic unit of analysis is a measurement context C. For present purposes, C is not a bare Hilbert-space label. It is a structured context containing at least the elements required for realized-outcome analysis: a system sector, a measurement arrangement, an environmental sector sufficient for record stabilization, and an accessible record structure through which outcome realization can become publicly meaningful rather than merely internally registered.

The importance of this context notion is methodological as well as formal. The present framework does not treat realized outcome selection as a purely abstract map on an isolated system state detached from record structure. The admissibility of a candidate realization channel depends on what kind of record structure the context sustains, whether records remain stable, whether they are accessible, and whether their sequential and public behavior can be coherently tracked.

Let 𝓗 denote the relevant state space associated with the context. The precise factorization may vary with the domain under study, but the essential point is that the candidate realization channels act not on an abstract measurement symbol, but on structures adequate to outcome-bearing context. States are represented by density operators ρ on 𝓗, and candidate realization maps are taken to be completely positive trace-preserving maps Φ on the appropriate state domain, subject to admissibility conditions to be strengthened later.

The phrase “accessible record structure” requires emphasis. Not every formally definable registration counts as a realized record in the sense required by the framework. Record structure matters because the problem of realized single-outcome selection is inseparable from the problem of publicly stabilized outcome structure. This is one reason admissibility cannot be defined independently of context.

3.3 Admissible Channels as Realization Candidates

Given a measurement context C, one considers a class 𝒜(C) of admissible realization channels. At the level inherited from Volume I, 𝒜(C) is not simply the set of all CPTP maps available on the relevant state space. It is already intended as a filtered class. The filter is motivated by structural considerations tied to record stability, record accessibility, compositional compatibility, and invariance under physically irrelevant redescription.

At the Volume I level, these constraints were articulated as the basis for a nontrivial admissibility schema. At the Volume II level, they will be reformulated as a sharper predicate architecture. For present purposes, the important point is simply this: admissibility is not a neutral container. It is the candidate domain over which realization selection occurs, and its exact boundaries are among the main burdens of the present volume.

A candidate channel Φ is therefore not merely a map that can be written down mathematically. It is a realization candidate only relative to a context C and only to the extent that it survives the relevant admissibility filter. This context-indexed character of admissibility is crucial. It prevents the framework from pretending that realization selection takes place in a vacuum independent of record-bearing structure.

3.4 The Realization Functional and the Minimization Rule

The second principal object inherited from Volume I is the realization functional ℛᶜ. Its role is to order admissible realization candidates relative to the context C. The framework does not begin by assuming that any arbitrary ordering principle is acceptable. Rather, it introduces ℛᶜ as the structure by which admissible candidates may, under explicit conditions, be ranked for realized selection.

The schematic selection rule takes the form

Φ∗(C) = argmin_{Φ ∈ 𝒜(C)} ℛᶜ(Φ).

This equation should be read with care.

First, it is schematic. It expresses the structural role of realized selection under admissibility and ordering, not yet the final form of every admissibility or canonicality theorem.

Second, the rule is conditional. It presupposes that the admissible class is well-defined, that ℛᶜ satisfies whatever structural and regularity conditions are required for meaningful minimization, and that a minimizer exists in the relevant domain.

Third, the equation does not by itself settle whether the relevant functional is uniquely canonical. Volume I distinguished between the abstract role of the realization functional and provisional concrete representatives of that role. Volume II inherits that distinction and treats the canonicality problem as one of its central burdens.

The point of recalling the minimization rule here is not to repeat Volume I’s broader discussion. It is to identify the exact locus of downstream narrowing. Volume II will ask whether 𝒜(C) can be narrowed, whether ℛᶜ can be canonically narrowed, and what follows if both contractions succeed.

3.5 First-Tier Existence and Consistency Results Inherited from Volume I

The present volume inherits a first tier of results from Volume I. These are not yet the final theorems sought here, but they matter because they establish that the framework begins from a nonempty and structurally coherent baseline.

Among the inherited achievements are existence-type results showing, in controlled settings and under explicit assumptions, that the admissible class is not vacuous and that minimization over admissible candidates is not merely symbolic. Also inherited are first-tier consistency results indicating that realized record structure can be treated coherently under the framework’s basic conditions, together with invariance-type results under limited redescription or coarse-graining conditions.

These inherited results do not resolve the present volume’s main burdens. They do, however, justify taking those burdens seriously. A program should not move to narrowing if its core objects have not yet been shown to possess basic nonemptiness or coherence. Volume I supplied that baseline. Volume II now asks whether the baseline can be strengthened.

3.6 Which Items Are Now Treated as Hypotheses for Strengthening

The purpose of this chapter is not only to carry formal objects forward, but also to identify which inherited elements now function as hypotheses or targets of strengthening rather than as settled results.

The admissibility schema is one such item. Volume I gave it principled motivation and partial formal articulation. Volume II now treats the schema as the object of narrowing. In other words, the inherited admissibility conditions are no longer treated merely as background structure; they are subjected to theorem pressure.

The realization functional is another such item. Volume I established its role and separated abstract function from provisional concrete form. Volume II now treats the acceptable family of realization orderings as a target of canonical narrowing.

Inherited uniqueness statements are also subject to strengthening. Wherever Volume I relied on assumptions too strong to support broader law-candidate standing, Volume II will attempt to weaken those assumptions or classify the domain in which weakening remains impossible.

Finally, inherited Born-related standing is treated as explicitly limited. The present volume does not erase that limitation. It uses it as the baseline for a stricter audit. Any stronger Born-related claim must now be earned under reduced circularity exposure.

Thus the logic of the present volume is clear. It does not discard the inherited architecture. It converts key inherited structures into objects of restriction, testing, and possible strengthening.

3.7 Formal Standing of the Restatement

The restatement of this chapter has been intentionally spare. It has not repeated Volume I’s broader motivations, interpretive discussions, or extended architectural development. It has carried forward only what the present restriction program requires: the context object C, the admissible class 𝒜(C), the realization functional ℛᶜ, the schematic minimization rule, a first tier of inherited existence and consistency results, and a clear identification of which inherited items are now subjected to stronger theorem burdens.

This is sufficient for the work that follows. More would risk redundancy. Less would risk formal insufficiency.

Formal gain

This chapter has fixed the minimal formal core inherited from Volume I in a way that is sufficient for the narrowing arguments of Volume II. It has identified the exact objects that later chapters must restrict and clarified which inherited results remain baseline achievements rather than final closures.

Residual vulnerability

Nothing in this chapter narrows admissibility, canonicality, or uniqueness. It merely identifies the objects over which those later reductions must occur. If those reductions fail, the present restatement will stand only as the formal stage-setting for an ultimately insufficient strengthening attempt.

Why this matters for Volume II

Without a minimal and exact carry-forward of the Volume I core, the narrowing arguments of the present volume would either float free of their formal base or become entangled in unnecessary repetition. This chapter secures the correct middle ground.

Next necessity

The next part of the volume must begin the actual work of restriction by reformulating admissibility as a predicate architecture and forcing the admissible class through nontrivial narrowing conditions.

PART II — ADMISSIBILITY NARROWING, THE PRIMARY ENGINE

Chapter 4

Admissibility as a Predicate Architecture

4.1 Orientation

If the framework of Volume I is to advance from articulate architecture toward law-candidate status, the first indispensable task is to convert admissibility from a motivated schema into a predicate architecture. A law cannot be said to select under necessity if the field over which selection occurs remains only verbally constrained. The present chapter therefore undertakes the first strict formalization of admissibility as an intersection of named structural predicates.

The governing idea is simple. A candidate realization channel Φ is not admissible merely because it is mathematically definable, completely positive, trace-preserving, or even superficially compatible with a measurement narrative. It is admissible only if, relative to a measurement context C, it satisfies conditions adequate to realized record structure. These conditions are not optional decorations. They are the first line of defense against concealed arbitrariness.

Four predicates form the core of the architecture:

• StableRecord(Φ, C)

• AccessibleRecord(Φ, C)

• CompositionCompatible(Φ, C)

• RedescriptionInvariant(Φ, C)

These are not intended as heuristic slogans. They are intended to function as structural tests. Their job is to constrain the candidate field in a way that later theorems can actually use. If they fail to do so, admissibility remains curation in elevated language. If they succeed, admissibility begins to look less like a discretionary filter and more like a structurally motivated restriction.

The central claim of this chapter is therefore modest but decisive: admissibility can be reformulated as a predicate architecture whose components are independently intelligible, formally expressible, and suitable for subsequent narrowing results.

4.2 Preliminary Setup

Let C denote a measurement context. For present purposes, C contains at least:

• a system sector,

• a registration or measurement arrangement,

• an environmental structure capable of supporting outcome-bearing stabilization,

• and a record structure through which outcomes become publicly accessible rather than merely internally encoded.

Let 𝓗ᶜ denote the Hilbert space associated with C, and let 𝒟(𝓗ᶜ) denote the density operators on 𝓗ᶜ. Let CPTP(𝓗ᶜ) denote the completely positive trace-preserving maps on 𝒟(𝓗ᶜ). Candidate realization channels are drawn from CPTP(𝓗ᶜ), but admissibility is not coextensive with that space.

Let ℛᶜ denote the context-indexed realization functional, whose admissible domain is to be narrowed later. For the present chapter, ℛᶜ is background structure. The current task is prior: determine the domain over which any such functional may legitimately operate.

To formalize record-bearing structure, let 𝓡ᶜ denote the record substructure associated with context C. This may be represented abstractly as a distinguished subsystem, a preferred family of record observables, or a coarse-grained public state partition, depending on domain. No single representation is imposed at this stage. What matters is that the framework has a way to distinguish record-bearing degrees of freedom from arbitrary internal encodings.

Let Recᶜ be the set of context-appropriate record states or record classes. Again, the present chapter does not require one universal representation. It requires only that record structure be formally trackable.

The goal is now to specify predicates on Φ relative to C such that admissibility becomes:

𝒜(C) = { Φ ∈ CPTP(𝓗ᶜ) : StableRecord(Φ, C) ∧ AccessibleRecord(Φ, C) ∧ CompositionCompatible(Φ, C) ∧ RedescriptionInvariant(Φ, C) ∧ … }

where the ellipsis indicates optional strengthening predicates introduced later.

4.3 StableRecord(Φ, C)

4.3.1 Informal burden

StableRecord(Φ, C) is the requirement that, once a realized record structure is produced by Φ in context C, that structure is not merely ephemeral, self-erasing, or dynamically fragile in a way incompatible with outcome-bearing status. This does not demand absolute permanence. It demands sufficient persistence relative to the contextual scale of public outcome attribution.

A framework that permits realization channels to generate instantly unstable or dynamically incoherent records has not yet described realized outcome structure. It has described transient encoding.

4.3.2 Formal definition

Let Πᶜ = {Π₁, …, Πₙ} denote a context-appropriate coarse-grained family of record projectors or record classes on 𝓡ᶜ. Let ρ be an admissible pre-realization state for context C. Write ρ′ = Φ(ρ). Let red_{𝓡ᶜ}(ρ′) denote the reduced record state.

Then StableRecord(Φ, C) holds if there exists a stability scale τ(C) > 0 and a record tolerance ε_stab(C) ≥ 0 such that for every context-appropriate initial state ρ and every time parameter t in the relevant post-registration interval [0, τ(C)], the evolved record state remains within ε_stab(C) of a single record class selected by Φ, in the sense that there exists i = i(ρ, Φ, C) such that

dist(red_{𝓡ᶜ}(U_t ρ′ U_t†), Πᵢ) ≤ ε_stab(C)

for all t ∈ [0, τ(C)], where U_t denotes the relevant post-realization dynamical evolution and dist is a context-fixed record distance or coarse-grained divergence.

The exact metric may vary with the representation. What matters is the existence of a nontrivial persistence interval and a stable association with one record class.

4.3.3 Interpretation

The predicate does not require eternal immutability. It requires outcome-bearing persistence. The record produced by Φ must remain stable enough to count as realized in the context at hand. This is a contextual and structural notion, not a metaphysical demand for timeless fixation.

4.3.4 Why this predicate is necessary

Without stable record structure, realized selection collapses into event-like fluctuation. A channel that produces immediately self-dissolving records cannot support public outcome attribution. Such a map may be dynamically admissible in a broad mathematical sense, but not admissible as a realization channel in the present framework.

4.3.5 Failure modes

StableRecord fails when:

• record assignments oscillate across classes on the relevant post-registration scale,

• no persistence interval can be defined,

• stability occurs only by collapsing the tolerance ε_stab(C) into triviality,

• or the record remains too delocalized over record classes to count as realized.

4.4 AccessibleRecord(Φ, C)

4.4.1 Informal burden

A record may be stable and still fail to count as a realized public record if it is not accessible. Accessibility means that the record structure produced by Φ is not merely hidden in inaccessible internal correlations or private fine-grained encodings. It must be available, at the appropriate coarse level, to contextual retrieval, public registration, or intersubjective coherence.

This predicate blocks the cheap move of calling any internal state correlation a “record.”

4.4.2 Formal definition

AccessibleRecord(Φ, C) holds if there exists a context-appropriate retrieval map Ξᶜ from the record-bearing sector to a public or coarse-grained outcome space Ω(C), together with a tolerance ε_acc(C), such that for every eligible input state ρ and realized post-channel state ρ′ = Φ(ρ), the retrieved output Ξᶜ(red_{𝓡ᶜ}(ρ′)) is ε_acc(C)-close to a unique public outcome label ωᵢ ∈ Ω(C).

Equivalently, there must exist a context-level decoding or accessibility structure such that realized record content is not merely latent but retrievable as a stable public outcome assignment.

In symbolic shorthand:

AccessibleRecord(Φ, C) ⇔ ∀ρ ∈ Dom(C), ∃! ωᵢ ∈ Ω(C) such that
dist(Ξᶜ(red_{𝓡ᶜ}(Φ(ρ))), ωᵢ) ≤ ε_acc(C).

The uniqueness here is contextual and coarse-grained; it does not presuppose later global uniqueness theorems for the realization channel itself.

4.4.3 Interpretation

The predicate says that a realized record must be available as record. A hidden micro-correlation that no context-appropriate retrieval structure can stably decode is not enough.

4.4.4 Why this predicate is necessary

If admissibility allows inaccessible records, the framework risks confusing internal encoding with realized outcome. That would trivialize realization. Any sufficiently complicated correlation structure could then be redescribed as an “outcome,” and admissibility would become nearly vacuous.

4.4.5 Failure modes

AccessibleRecord fails when:

• the record is stable but not retrievable,

• retrieval depends on unphysical fine control not licensed by context C,

• multiple public outcomes remain indistinguishable within required tolerance,

• or the record exists only in hidden correlations with no admissible public map.

4.5 CompositionCompatible(Φ, C)

4.5.1 Informal burden

A realization channel admissible in a context C must behave coherently under the kinds of sequential, nested, or compositional structures that the context actually supports. If a map appears admissible in isolation but destroys record coherence when embedded into longer measurement sequences or composed contexts, it is not a plausible candidate law component.

This predicate ensures that admissibility is not a single-shot artifact.

4.5.2 Formal definition

Let C₁, C₂ be composable subcontexts of a larger context C₁ ∘ C₂. Let Φ₁, Φ₂ be candidate realization channels associated with these subcontexts, and let Φ₂ ∘ Φ₁ denote their sequential action where defined. CompositionCompatible(Φ, C) holds if, whenever C participates in a context-appropriate composition or sequential extension, the realized record structure induced by Φ remains consistent with the admissibility predicates of the composed context up to specified tolerances.

At a minimum, this requires:

1. Stability preservation under admissible continuation,

2. Accessibility preservation under admissible continuation,

3. No contradiction between local realized record structure and later public record structure,

4. No pathological dependence on composition ordering except where the physical context itself warrants such dependence.

A schematic condition is:

If Φ ∈ 𝒜(C₁) and Ψ ∈ 𝒜(C₂ | C₁), then for the composed context C₂ ∘ C₁,
the induced record structure under Ψ ∘ Φ must remain jointly stable and publicly coherent within the tolerances of the composed context.

4.5.3 Interpretation

A realization channel should not cease to count as realization-producing the moment one embeds it in a larger admissible process. Lawlike status requires more than isolated adequacy.

4.5.4 Why this predicate is necessary

Without composition compatibility, admissibility becomes brittle. One could have channels that look legitimate only because they are examined in artificially frozen isolation. Such channels cannot support a serious outcome law.

4.5.5 Failure modes

CompositionCompatible fails when:

• a stable local record becomes unstable under ordinary admissible continuation,

• public outcome assignments conflict across sequential extensions,

• admissibility depends on arbitrary segmentation of one process into many,

• or order-of-composition sensitivity appears where no physical asymmetry licenses it.

4.6 RedescriptionInvariant(Φ, C)

4.6.1 Informal burden

A realization channel should not gain or lose admissibility merely because the same physical structure is redescribed in formally different but physically irrelevant ways. This predicate is the main protection against basis-loading, label-loading, or coordinate-level arbitrariness masquerading as structural content.

4.6.2 Formal definition

Let ≃_C denote an equivalence relation on descriptions of context C generated by physically irrelevant redescription operations: relabelings, record-class permutations preserving physical content, equivalent coarse-graining choices, or representation changes that do not alter the contextual outcome-bearing structure.

RedescriptionInvariant(Φ, C) holds if for every context C′ such that C′ ≃_C C, and for every induced representation Φ′ corresponding to Φ under this redescription, admissibility status is preserved:

RedescriptionInvariant(Φ, C) ⇔
[C′ ≃_C C and Φ′ ≃ Φ under the induced representation] ⇒
[Φ ∈ Adm(C) if and only if Φ′ ∈ Adm(C′)].

Equivalently, admissibility must descend to equivalence classes of physically meaningful contexts rather than cling to arbitrary representational choices.

4.6.3 Interpretation

This predicate does not deny that some contextual structures are physically meaningful. It denies that merely formal re-expression of the same meaningful structure should affect admissibility.

4.6.4 Why this predicate is necessary

Without redescription invariance, admissibility can be made to look selective by exploiting formal artifacts. One could privilege a representation and then declare the framework constrained when in fact it is merely coordinate-sensitive.

4.6.5 Failure modes

RedescriptionInvariant fails when:

• admissibility changes under mere relabeling,

• basis sensitivity appears without contextual physical justification,

• equivalent record partitions yield different admissibility outcomes,

• or the predicate architecture is attached to description rather than structure.

4.7 Optional Strengthening Predicates and Why They Are Optional

The four predicates above form the core architecture. They are necessary to begin narrowing, but they need not exhaust every structural refinement a later theorem program may require. There may be additional predicates useful in specific domains, for example:

• SeparationRobust(Φ, C): admissibility persists under small admissible perturbations of contextual structure,

• NonLoading(Φ, C): Φ does not encode probabilistic weighting behavior through disguised context restriction,

• MinimalityRespecting(Φ, C): Φ avoids overstructured realization behavior beyond what the context requires,

• ScaleCoherent(Φ, C): admissibility survives across context-appropriate coarse-graining levels.

These predicates are optional for two reasons.

First, the core admissibility architecture should not be overloaded at the outset. The purpose of the present chapter is to define the minimal structural predicates without which admissibility loses meaning. Optional strengthenings belong where a later theorem genuinely requires them.

Second, not every optional condition is universally structural. Some are domain-strengtheners rather than universal admissibility requirements. Treating them as core conditions too early would risk the very vice the chapter is trying to avoid: hand-tuned admissibility.

The discipline here is important. One strengthens admissibility only where theorem pressure justifies the strengthening.

4.8 Definition of the Revised Admissible Class 𝒜(C)

We may now define the revised admissible class.

Definition 4.1 — Revised Admissible Class

For a measurement context C, the revised admissible class 𝒜(C) is the set of all candidate realization channels Φ ∈ CPTP(𝓗ᶜ) such that:

𝒜(C) = { Φ ∈ CPTP(𝓗ᶜ) : StableRecord(Φ, C) ∧ AccessibleRecord(Φ, C) ∧ CompositionCompatible(Φ, C) ∧ RedescriptionInvariant(Φ, C) }.

Where later theorem programs require additional strengthening predicates, one may define a strengthened admissible subclass 𝒜⁺(C) ⊆ 𝒜(C) by adjoining the relevant optional predicates explicitly.

This definition is the first major tightening move of Volume II. It converts admissibility from a partly descriptive notion into a formal intersection of structural conditions.

4.9 Why These Predicates Are Structural Rather Than Hand-Tuned

A natural objection arises immediately: why should these predicates be regarded as structural rather than selectively chosen to favor the framework?

The answer is not that the predicates are obviously unique. The answer is that each addresses a distinct and independently necessary threat to realized outcome status.

StableRecord blocks transient pseudo-realization.
AccessibleRecord blocks hidden private encoding.
CompositionCompatible blocks single-shot fragility.
RedescriptionInvariant blocks representational arbitrariness.

These are not refinements invented to beautify the framework. They are pressure points any serious realization law must face. A candidate channel that fails stability is not a realized-outcome channel. A candidate channel that fails accessibility is not publicly outcome-bearing. A candidate channel that fails composition compatibility is not lawlike under ordinary process extension. A candidate channel that fails redescription invariance is not structurally grounded.

The predicates are therefore structural in the following sense: each corresponds to a condition that must be satisfied by any framework seeking to connect realized selection with public outcome structure in a non-arbitrary way.

This does not prove that the predicates are uniquely exhaustive. It does show that they are not arbitrary ornaments. Their necessity is independent of the later success or failure of the full program.

4.10 Formal Standing of the Chapter

This chapter has not yet proved that the admissible class is narrow. It has done something prior and necessary: it has defined the exact architecture on which narrowing theorems can rest. Admissibility is no longer a motivated label. It is now a predicate intersection with explicit failure modes.

That is the first decisive gain of Part II.

Formal gain

This chapter has converted admissibility into a predicate architecture with four core structural tests: stability, accessibility, composition compatibility, and redescription invariance. It has also defined the revised admissible class 𝒜(C) as the intersection of those tests and clarified the controlled role of optional strengthening predicates.

Residual vulnerability

The predicates have been defined, but not yet shown to materially narrow the candidate field. If later chapters fail to derive substantive necessary conditions or exclusion results from them, admissibility will remain formally cleaner but not materially stronger.

Why this matters for Volume II

This chapter supplies the exact formal architecture required for real narrowing. Without it, Part II would remain descriptive. With it, admissibility becomes theorem-capable.

Next necessity

The next chapter must show that these predicates impose nontrivial necessary conditions on every admissible realization channel. Admissibility must now cease merely to be defined and begin to constrain.

Chapter 5

Necessary Conditions for Admissibility

5.1 Orientation

The previous chapter defined admissibility. The present chapter begins narrowing it.

The change in burden is important. A predicate architecture, no matter how well motivated, remains insufficient if it cannot be shown to exclude anything. The question is therefore no longer what admissibility means, but what admissibility forces. The answer cannot remain intuitive. It must take the form of necessary conditions.

The central theorem target of this chapter is:

Theorem A — Necessary Admissibility Conditions

Every admissible realization channel must satisfy a nontrivial set of necessary structural conditions.

The significance of this theorem is not that it yields a final characterization of admissibility. It does not. Its significance is that it transforms admissibility from a labeled domain into a restriction-bearing structure.

5.2 Necessary Stability Constraints

We begin with stability.

If Φ ∈ 𝒜(C), then StableRecord(Φ, C) holds by definition. But the predicate itself implies more than a verbal requirement. It entails necessary structural constraints on the image of Φ.

Proposition 5.1 — Stability Concentration Requirement

If Φ ∈ 𝒜(C), then for every admissible input state ρ in Dom(C), the post-channel state ρ′ = Φ(ρ) must admit a record reduction whose support is concentrated, up to tolerance ε_stab(C), within a single context-appropriate record class over the stability interval [0, τ(C)].

This means that admissible channels cannot scatter record content across multiple incompatible record classes on the relevant persistence scale.

Proposition 5.2 — Non-Oscillation Requirement

If Φ ∈ 𝒜(C), then the induced record assignment cannot undergo uncontrolled oscillatory migration among distinct public record classes within the contextual stability interval unless the context itself explicitly licenses such structure.

These conditions are necessary because a stable record is not merely a snapshot. It is a persistence structure. Channels that produce rapid class-switching, diffuse record drift, or vanishing post-registration coherence fail admissibility.

5.3 Necessary Accessibility Constraints

Accessibility yields its own necessary conditions.

Proposition 5.3 — Public Decodability Requirement

If Φ ∈ 𝒜(C), then there exists a context-appropriate retrieval map Ξᶜ such that the induced record content of Φ(ρ) is decodable, up to tolerance ε_acc(C), into a unique coarse public outcome label for every admissible pre-realization input state ρ.

This excludes channels whose record content is hidden in inaccessible internal structure.

Proposition 5.4 — Non-Private Encoding Requirement

If Φ ∈ 𝒜(C), then admissibility cannot depend on a record encoding available only through fine-grained micro-access unavailable to the context C as specified.

The framework does not permit a channel to count as admissible merely because some mathematically ideal observer could decode its output in principle. Accessibility must be contextual, not absolute.

5.4 Necessary Composition Constraints

The composition predicate also yields hard requirements.

Proposition 5.5 — Sequential Coherence Requirement

If Φ ∈ 𝒜(C), then for every admissible sequential extension of C by a context C′, the record structure produced by Φ must remain compatible with admissible continuation in the extended context, up to the relevant tolerances of the composed structure.

Proposition 5.6 — Segmentation Independence Requirement

If two context decompositions represent the same physically meaningful process up to admissible contextual equivalence, then admissibility cannot depend arbitrarily on which decomposition is used.

This prevents a candidate channel from appearing admissible only under one artificial process segmentation.

5.5 Necessary Invariance Constraints

Redescription invariance yields the following necessary conditions.

Proposition 5.7 — Label Invariance Requirement

If Φ ∈ 𝒜(C), then admissibility is preserved under admissible relabelings of record classes that do not alter physical content.

Proposition 5.8 — Representation Neutrality Requirement

If C and C′ are physically equivalent up to contextual redescription, and Φ′ is the induced representation of Φ under that redescription, then Φ ∈ 𝒜(C) implies Φ′ ∈ 𝒜(C′).

This rules out admissibility criteria attached to notation, basis choice, or coordinate convention rather than to physically meaningful record structure.

5.6 Closure, Compactness, and Regularity Conditions Needed for Later Results

The predicates above narrow structure, but later minimization theorems and characterization results require additional regularity conditions. These are not yet full admissibility predicates in the strongest sense, but they are necessary for downstream theorem architecture.

Proposition 5.9 — Sequential Closure Requirement

If a sequence {Φₙ} in 𝒜(C) converges in the relevant admissibility-compatible topology to Φ, then Φ must preserve the core predicate structure, or else the class 𝒜(C) is too unstable for later minimization analysis.

Proposition 5.10 — Nontriviality Requirement

The admissible class must remain neither empty nor dense in the full unconstrained candidate space in a way that renders the predicates formally vacuous.

Remark

These conditions do not yet amount to a complete topological theory of admissibility. They identify the level of regularity required if admissibility is to serve as a law-bearing domain rather than an unstable formal sieve.

5.7 Structural Implications of the Necessary Conditions

The propositions above jointly imply something important: admissibility already excludes more than mere obvious pathology.

To be admissible, a channel must:

• produce stable record concentration,

• support contextual public decodability,

• survive admissible continuation,

• remain invariant under irrelevant redescription,

• and reside in a domain regular enough for later selection theory.

This means that admissibility is no longer just a label for “suitable” channels. It imposes a pattern of structural necessity.

5.8 Theorem A — Necessary Admissibility Conditions

We may now state the main result.

Theorem A — Necessary Admissibility Conditions

Let C be a measurement context with record structure 𝓡ᶜ and admissible domain 𝒜(C) defined as in Chapter 4. If Φ ∈ 𝒜(C), then Φ must satisfy:

1. stability concentration and non-oscillation constraints on induced record structure,

2. public decodability and non-private-encoding constraints,

3. sequential coherence and segmentation-independence constraints,

4. label-invariance and representation-neutrality constraints,

5. and the regularity requirements necessary for admissibility-compatible closure and downstream minimization analysis.

In particular, every admissible realization channel belongs to a strictly narrower structural class than the unconstrained space CPTP(𝓗ᶜ).

Proof sketch

Each clause follows from one of the predicate definitions in Chapter 4 together with the requirement that admissibility be a property of realized public record structure rather than of arbitrary mathematical maps. Stability yields concentration and persistence; accessibility yields contextual decodability; composition compatibility yields extension coherence; redescription invariance yields representation neutrality. The regularity conditions follow from the requirement that admissibility support nontrivial later theorem use rather than collapse into instability or vacuity.

The theorem is not yet a characterization theorem. It is a theorem of necessary narrowing.

5.9 Formal Standing of the Chapter

This is the first genuine escalation of Part II. Admissibility has ceased to be merely defined and has begun to constrain.

Formal gain

This chapter has established that admissibility imposes nontrivial necessary structural conditions on every admissible realization channel. The admissible class is therefore narrower than the full unconstrained candidate space for reasons tied directly to record structure rather than to preference.

Residual vulnerability

Necessary conditions are not yet enough. A framework can possess nontrivial necessary conditions and still remain too broad. The next burden is therefore exclusion: show that many nearby and superficially plausible alternatives fail these conditions.

Why this matters for Volume II

This chapter marks the transition from formal architecture to actual restriction. It is the first point at which the framework begins to reduce underdetermination rather than merely describe its intended domain.

Next necessity

The next chapter must construct a bank of exclusion lemmas showing that many nearby channel classes fail admissibility even when they initially appear plausible.

Chapter 6

Exclusion Lemmas for Nearby but Illegitimate Channels

6.1 Orientation

Necessary conditions narrow admissibility from above. Exclusion lemmas narrow it from nearby alternatives.

A framework begins to look discovered rather than chosen when it can say not only what admissible channels must satisfy, but why neighboring structures fail. The present chapter therefore develops a bank of exclusion lemmas targeting superficially plausible but ultimately inadmissible channel families.

The logic is adversarial. We do not ask which channels fit the framework most charitably. We ask which nearby candidates would undermine the claim that admissibility is structural rather than curated.

6.2 Record-Unstable Channels

Exclusion Lemma 6.1 — Record-Unstable Channels Are Inadmissible

Let Φ be a candidate realization channel such that, for some admissible input state ρ and some contextual stability interval, the induced record assignment fails concentration or undergoes uncontrolled migration among incompatible record classes. Then Φ ∉ 𝒜(C).

Justification

Such a channel violates StableRecord(Φ, C). It may generate transient encodings, but not realized record structure in the sense required by the framework.

Remark

This lemma excludes not only catastrophic instability but also channels whose apparent record formation depends on stability tolerances too weak to support public outcome status.

6.3 Channels with Inaccessible or Nonpublic Records

Exclusion Lemma 6.2 — Inaccessible-Record Channels Are Inadmissible

Let Φ be a candidate realization channel such that its induced record content is not retrievable by any context-appropriate public or coarse-grained map Ξᶜ within tolerance ε_acc(C). Then Φ ∉ 𝒜(C).

Justification

Such a channel fails AccessibleRecord(Φ, C). It encodes without realizing.

Remark

This lemma blocks a large family of constructions that preserve information in principle while offering no admissible public record structure in practice.

6.4 Composition-Defective Channels

Exclusion Lemma 6.3 — Composition-Defective Channels Are Inadmissible

Let Φ be a candidate realization channel whose induced record structure becomes unstable, inaccessible, or mutually inconsistent under admissible continuation or sequential embedding. Then Φ ∉ 𝒜(C).

Justification

Such a channel fails CompositionCompatible(Φ, C). It may mimic realization in isolation while collapsing under lawful extension.

6.5 Redescription-Sensitive Channels

Exclusion Lemma 6.4 — Redescription-Sensitive Channels Are Inadmissible

Let Φ be a candidate realization channel such that its admissibility depends on labels, basis conventions, or other physically irrelevant re-expressions of the same context. Then Φ ∉ 𝒜(C).

Justification

Such a channel fails RedescriptionInvariant(Φ, C). The framework does not permit admissibility to be representation-bound when the physical structure is unchanged.

6.6 Frequency-Loaded Channels That Smuggle Probabilistic Structure

A more subtle family of illegitimate candidates consists of channels whose admissibility or apparent naturalness depends on hidden probabilistic loading.

Exclusion Lemma 6.5 — Frequency-Loaded Channels Are Inadmissible Relative to Core Admissibility

Let Φ be a candidate realization channel whose admissibility relies on context restrictions, retrieval structure, or record definitions designed so that a favored weighting behavior is covertly built into the candidate class. Then Φ is inadmissible under the core predicate architecture, unless the relevant loading is made explicit as an external strengthening assumption.

Justification

Such channels violate the spirit and, under suitable explicit anti-loading refinements, the letter of admissibility. They do not preserve the distinction between realized structure and imported weighting assumptions.

Remark

This lemma is especially important for later Born auditing. If hidden loading is admissible at the channel level, downstream probabilistic success loses much of its evidential force.

6.7 Why Mathematical Availability Does Not Imply Physical Admissibility

The exclusion lemmas above together justify a general principle.

Proposition 6.6 — Mathematical Availability Is Not Admissibility

The fact that Φ ∈ CPTP(𝓗ᶜ), or that Φ preserves trace and positivity, or even that Φ generates interpretable-looking outputs, is insufficient for Φ to belong to 𝒜(C).

Interpretation

Admissibility is a structural notion tied to realized public record behavior. Mathematical legitimacy is necessary, but far from sufficient.

This proposition matters because many nearby rivals can survive purely mathematical scrutiny while failing outcome-law scrutiny. Admissibility is meant precisely to mark that distinction.

6.8 Formal Standing of the Chapter

This chapter has performed the first adversarial work of Part II. It has shown that nearby, initially plausible channel families fail admissibility for identifiable structural reasons.

Formal gain

This chapter has established a bank of exclusion lemmas covering record-unstable channels, inaccessible-record channels, composition-defective channels, redescription-sensitive channels, and frequency-loaded channels. Admissibility now looks less like a discretionary label and more like an exclusion-capable structure.

Residual vulnerability

Exclusion lemmas, though powerful, do not yet amount to a full positive characterization. The next burden is to combine necessary conditions and exclusions into a restricted characterization theorem in controlled domains.

Why this matters for Volume II

This chapter is where admissibility begins to look discovered rather than chosen. A serious law-candidate framework must exclude nearby illegitimate structures, not merely prefer against them.

Next necessity

The next chapter must unify the necessary conditions and exclusion lemmas into a restricted characterization of the admissible class.

Chapter 7

Restricted Characterization of the Admissible Class

7.1 Orientation

The previous two chapters established two complementary forms of narrowing. Chapter 5 derived necessary conditions that every admissible channel must satisfy. Chapter 6 showed that many nearby candidate families fail those conditions. The present chapter combines these gains into the central positive payoff of Part II: a restricted characterization of the admissible class.

The result sought here is not a final universal admissibility theorem in all possible domains. That would exceed the warranted burden at this stage. The more honest and stronger target is a restricted characterization under explicit hypotheses in controlled settings.

The main theorem target is:

Theorem B — Restricted Characterization of Admissible Channels

Under explicit hypotheses, all admissible realization channels belong to a sharply restricted family, and channels outside that family violate at least one structural admissibility predicate.

This is the first headline theorem candidate of the volume.

7.2 Restricted Characterization in Finite-Dimensional Settings

We begin where the structure is tightest: finite-dimensional contexts with explicitly trackable record substructure.

Let C be a finite-dimensional measurement context with record partition Πᶜ and admissibility predicates as defined in Chapter 4. Let 𝔉(C) denote the family of realization channels satisfying:

• stability concentration relative to Πᶜ,

• contextual public decodability,

• admissible sequential coherence,

• and invariance under the equivalence relation of physically irrelevant redescription.

Proposition 7.1

Every Φ ∈ 𝒜(C) belongs to 𝔉(C).

This proposition follows directly from Theorem A together with the exclusion lemmas, but it is not yet the full theorem. It identifies the target family.

7.3 Two-Outcome Contexts as the First Complete Bench

The cleanest complete bench is the two-outcome case.

In a two-outcome context, the record structure is simplified enough that the combined force of stability, accessibility, composition compatibility, and redescription invariance becomes especially visible. There is less room for hidden partition complexity, less ambiguity in outcome-class assignment, and a more direct relation between record concentration and public decodability.

Theorem B.1 — Two-Outcome Restricted Characterization

Let C be a finite-dimensional two-outcome measurement context satisfying the regularity assumptions of Chapters 4 and 5. Then every admissible realization channel Φ ∈ 𝒜(C) belongs to a sharply restricted family 𝔉₂(C) characterized by:

1. stable concentration into one of the two context-record classes,

2. unique public decodability at the coarse record level,

3. coherent admissible extension under context-preserving continuation,

4. invariance under physically irrelevant relabeling of the two outcomes.

Conversely, any channel outside 𝔉₂(C) fails at least one core admissibility predicate.

Significance

This is not a universal theorem. It is a full controlled-bench characterization. That matters because a law-candidate program strengthens by surviving clean domains first.

7.4 Extension to Multi-Outcome but Still Controlled Settings

The two-outcome setting is not enough. The framework must also show that the characterization scales, at least partially, into more complex but still controlled domains.

Proposition 7.2 — Multi-Outcome Restricted Extension

Let C be a finite-dimensional context with a finite record partition Πᶜ of cardinality n > 2 satisfying regularity, stability, and decodability assumptions strong enough to prevent record-class overlap pathologies. Then every admissible realization channel lies in a restricted family 𝔉ₙ(C) defined by the same core predicate architecture, though the characterization may be partial where record-class boundary structure is insufficiently separated.

This extension matters because it shows that the admissibility architecture is not a two-outcome artifact. But it remains honest about where full closure has not yet been earned.

7.5 Where the Theorem Remains Partial

A credible characterization theorem must state its own limits.

The present theorem remains partial in at least four ways.

First, the strongest results currently belong to finite-dimensional settings with well-controlled record partitions.

Second, highly degenerate or weakly separated record structures may prevent a full clean characterization.

Third, context classes with unstable or only implicitly defined public record architecture may resist the current predicate machinery.

Fourth, the theorem does not yet establish one universal admissibility family valid across all measurement contexts without qualification.

These are not embarrassments. They are the exact places where the present theorem honestly stops.

7.6 What Still Blocks a Universal Admissibility Theorem

A universal admissibility theorem would require more than the present volume has yet earned. At least three additional burdens remain.

First, one would need a more complete theory of context equivalence and record-structure universality across widely varying domains.

Second, one would need stronger compactness and closure results to guarantee admissibility behaves uniformly under broader context classes.

Third, one would need a more complete treatment of borderline cases in which record accessibility and redescription invariance interact nontrivially with contextual coarse-graining.

Until those burdens are met, the present theorem should be read as a genuine but restricted characterization result.

7.7 Theorem B — Restricted Characterization of Admissible Channels

We may now state the main theorem.

Theorem B — Restricted Characterization of Admissible Channels

Let C be a measurement context satisfying the regularity, record-structure, and contextual coherence assumptions of Chapters 4–5. Then every admissible realization channel Φ ∈ 𝒜(C) belongs to a sharply restricted family 𝔉(C) determined by:

1. stable record concentration,

2. contextual public decodability,

3. admissible compositional coherence,

4. invariance under physically irrelevant redescription.

Moreover, any channel outside 𝔉(C) violates at least one structural admissibility predicate. In finite-dimensional two-outcome settings this characterization is complete; in broader controlled multi-outcome settings it is partial but nontrivial.

Proof sketch

Membership in 𝔉(C) follows from the necessary admissibility conditions of Theorem A. Exclusion of channels outside 𝔉(C) follows from the lemmas of Chapter 6. Completeness in the two-outcome setting follows from the reduced complexity of the record partition and the collapse of admissibility ambiguity under the core predicates. Partial extension to broader settings follows where contextual separation and decodability assumptions remain strong enough.

7.8 Formal Standing of the Chapter

This is the first headline narrowing result of the volume. Admissibility is no longer merely a predicate architecture and no longer merely a domain with necessary conditions and exclusions. It now supports a restricted characterization theorem.

Formal gain

This chapter has established that, under explicit hypotheses, admissible realization channels belong to a sharply restricted family and that channels outside that family violate one or more structural predicates. In two-outcome finite-dimensional settings, the characterization is complete.

Residual vulnerability

The characterization remains restricted. It is not yet universal. If later parts of the book rely on stronger admissibility closure than this theorem supports, they must say so explicitly.

Why this matters for Volume II

This chapter materially reduces candidate underdetermination. It is the first point at which the admissible class begins to look genuinely narrowed rather than merely carefully described.

Next necessity

The next chapter must stop and ask whether these gains are enough to change the status of the framework itself. Admissibility has narrowed. The question now is whether it has narrowed far enough.

Chapter 8

Has Admissibility Crossed the Law-Candidate Threshold?

8.1 Orientation

Theorem proving alone is not enough. A restriction volume must periodically stop and evaluate what its theorems have actually bought.

The previous chapters have:

• defined admissibility as a predicate architecture,

• derived necessary structural conditions,

• proved exclusion lemmas against nearby illegitimate channels,

• and established a restricted characterization theorem in controlled settings.

These are serious gains. The present chapter asks the unavoidable question: are they enough to materially change the standing of the framework?

This is not a rhetorical chapter. It is a status chapter. Its purpose is to determine whether admissibility, after narrowing, now looks constrained rather than curated, structural rather than discretionary, and law-bearing rather than merely schematic.

8.2 How Much Arbitrariness Has Been Removed

A precise answer is now possible.

Several forms of arbitrariness have been materially reduced.

First, arbitrary expansion of the candidate field has been curtailed. Channels cannot count as admissible merely by existing mathematically.

Second, hidden private-record constructions have been curtailed. Accessibility now matters structurally.

Third, brittle single-shot adequacy has been curtailed. Composition compatibility forces admissibility to survive lawful continuation.

Fourth, representational opportunism has been curtailed. Redescription invariance prevents admissibility from being tied to formal artifacts.

Fifth, some candidate channels that would have looked plausible under a looser schema are now explicitly excluded.

These are not trivial gains. They move admissibility from aesthetic preference toward structural discipline.

8.3 Which Forms of Permissiveness Remain

But not all arbitrariness has been removed.

First, the restricted characterization theorem remains domain-limited. The strongest results occur in finite-dimensional controlled settings, especially the two-outcome bench.

Second, optional strengthening predicates remain available, which means the outer boundary of admissibility is not yet fully closed.

Third, the interaction between admissibility and later canonicality remains unresolved. A narrowed candidate class is not yet enough if the ordering principle over that class remains too flexible.

Fourth, a universal admissibility theorem has not yet been earned.

Thus permissiveness has been reduced, but not eliminated.

8.4 Whether Admissibility Now Looks Constrained Rather Than Curated

This is the sharpest evaluative question of the chapter.

The answer, at this stage, is qualified but favorable: admissibility now looks substantially more constrained than curated.

Why? Because the core predicates correspond to independent structural burdens any realization law must plausibly meet, and because those predicates now support necessary conditions, exclusion lemmas, and restricted characterization results. The framework is no longer merely describing the kind of channels it prefers. It is beginning to show why nearby channels fail.

This does not yet prove that admissibility has become uniquely discovered in the strongest sense. But it does materially weaken the charge that admissibility is only a hand-built sieve.

8.5 Whether the Framework Has Become More Than a Realization Schema

At the end of Volume I, the framework was clearly more than a slogan but still best described as a formal realization architecture. After the results of Part II, that standing has improved.

The framework is now more than a merely general schema in at least one decisive respect: it possesses a narrowed candidate domain whose structural constraints are explicit, theorem-bearing, and exclusion-capable.

That does not yet make it a full law candidate. The reason is clear. Admissibility is only the first bottleneck. A framework may narrow its candidate domain and still remain underdetermined at the level of the realization functional. It may also remain fragile at the level of uniqueness or vulnerable at the level of Born-related standing.

Thus Part II has moved the framework forward, but not all the way.

8.6 What Still Prevents Full Law-Candidate Status

Four obstacles remain.

First, the realization functional has not yet been canonically narrowed.

Second, uniqueness has not yet been strengthened under the full range of conditions needed for mature lawlike status.

Third, the Born audit has not yet shown whether probabilistic standing is materially less circular.

Fourth, admissibility itself, while narrowed, has not yet been universally characterized.

For these reasons, the framework has not yet fully crossed the law-candidate threshold. But it may now be said to have approached it seriously.

8.7 Interim Verdict on Admissibility

The correct interim verdict is:

Admissibility has not yet achieved universal closure, but it has crossed the threshold from motivated schema to structurally narrowed candidate domain.

That is a meaningful change in standing. It does not settle the whole program. It does make the next stages worth attempting under higher pressure.

Formal gain

This chapter has shown that the results of Part II materially reduce arbitrariness in the admissible class and move admissibility from a descriptive schema toward a structurally constrained domain. The framework is now better positioned than it was at the end of Volume I to claim that realized selection occurs over a narrowed candidate field.

Residual vulnerability

Admissibility alone does not confer law-candidate status. Without canonical narrowing of the realization functional, stronger uniqueness, and a more exact Born audit, the framework remains incomplete as a law candidate.

Why this matters for Volume II

This chapter prevents the book from overstating what Part II has achieved while also making clear that real progress has been made. It preserves honesty without surrendering force.

Next necessity

The next part of the volume must turn to the second bottleneck: the realization functional itself. A narrowed admissible class is not enough if the principle of selection over that class remains too flexible to count as structurally compelled.

PART III — CANONICAL NARROWING OF THE REALIZATION FUNCTIONAL

Chapter 9

The Structural Role of the Realization Functional

9.1 Orientation

Part II narrowed the candidate field. That narrowing was necessary, but it was not sufficient. A framework does not become lawlike merely because it has restricted the class of admissible realization channels. It must also justify the principle by which those admissible candidates are ordered. If the admissible class is narrow but the realization ordering remains too flexible, the framework remains underdetermined at its center. One has constrained the domain without yet constraining the lawlike preference over that domain.

The present chapter therefore asks a prior question to any concrete proposal for ℛᶜ: what must a realization ordering do in order to count as structurally acceptable at all? The burden here is not yet to identify the unique functional, or even the final restricted canonical family. The burden is to make explicit the structural role of a realization functional before any particular representative is entertained.

This distinction matters. Volume I already separated the abstract role of the realization functional from provisional concrete representatives. That separation now becomes a narrowing program. The present chapter defines the admissible role of a realization ordering by specifying the conditions any acceptable ℛᶜ must satisfy if it is to serve as part of a serious law candidate rather than as an engineered preference device.

A realization functional is not just a scoring rule. It is the ordering structure by which admissible realization channels become comparable in a context C. Its legitimacy depends on whether it is compatible with admissibility, invariant under irrelevant redescription, well behaved under coarse-graining and composition, regular enough to support minimization, and sufficiently free from hidden probabilistic loading that later success cannot be dismissed as disguised importation.

The chapter therefore proceeds from role to constraint. It does not yet seek final canonicality. It seeks the structural obligations a realization functional must satisfy before canonicality can even be meaningfully discussed.

9.2 Why an Ordering Functional Is Needed

A narrowed admissible class does not yet determine a realized channel. Admissibility filters out channels that fail basic structural requirements, but it need not collapse the class to a singleton. Even after admissibility narrowing, multiple channels may remain compatible with stable record structure, public accessibility, compositional coherence, and redescription invariance. The framework therefore still requires an internal principle of selection.

This is the role of the realization functional. It provides an ordering over admissible candidates relative to a context C. Its schematic role is expressed by the rule

Φ∗(C) = argmin_{Φ ∈ 𝒜(C)} ℛᶜ(Φ).

But that rule should not be read too quickly. It does not mean that any function from 𝒜(C) to ℝ is acceptable. It means that if the framework is to identify a realized channel by minimization, then the ordering structure embodied in ℛᶜ must itself satisfy conditions severe enough to avoid arbitrariness.

Why is an ordering needed at all? Because admissibility alone is a permissibility notion, not yet a selection principle. A law candidate must do more than say which channels are allowed. It must also say how, within the allowed domain, realized selection is structured. Without such an ordering principle, the framework would remain an admissibility-filtered architecture, not a candidate law of realization.

At the same time, the need for an ordering functional introduces a new danger. It creates a second site at which arbitrariness may hide. One can narrow admissibility and then quietly reintroduce freedom at the level of the functional. The problem of the present part is therefore not whether an ordering is necessary. It is whether an ordering can be justified under conditions strong enough that it no longer appears freely engineered.

9.3 Compatibility with Admissibility

The first obligation of any acceptable realization functional is compatibility with admissibility. A realization ordering that does not respect the structure of admissibility cannot serve as part of the same law candidate.

This requirement has several layers.

First, ℛᶜ must be defined on the admissible class 𝒜(C), or on a domain containing it, in such a way that its evaluation is sensitive only to structurally relevant differences among admissible candidates. A functional that privileges distinctions irrelevant to admissibility is misaligned with the framework.

Second, ℛᶜ must not trivialize admissibility by rewarding or penalizing features the admissibility predicates already declare irrelevant. If admissibility was constructed to block representation-sensitive or privately encoded channels, then the ordering must not reintroduce preference over precisely those dimensions.

Third, the functional must be stable under the same notion of contextual legitimacy that defines the admissible class. The ordering cannot float above admissibility as an externally imposed score detached from record structure.

These observations motivate the following definition.

Definition 9.1 — Admissibility Compatibility

A realization functional ℛᶜ is admissibility-compatible if, for every context C:

1. ℛᶜ is defined on 𝒜(C) or on a superdomain whose restriction to 𝒜(C) is well defined,

2. ℛᶜ distinguishes admissible channels only by features that remain structurally meaningful under the admissibility predicates,

3. and ℛᶜ does not privilege distinctions excluded by the admissibility architecture as physically irrelevant.

This definition does not yet determine the form of ℛᶜ. It does establish that the functional cannot be structurally orthogonal to admissibility. The ordering principle must live within the same conceptual space as the candidate domain it orders.

9.4 Invariance Under Irrelevant Redescription

If admissibility is required to be invariant under physically irrelevant redescription, the same must hold for the realization ordering. Otherwise, the functional would smuggle arbitrariness back into the framework at the level of ranking rather than membership.

Let C and C′ be contexts equivalent up to a physically irrelevant redescription, and let Φ ↦ Φ′ denote the corresponding induced representation on admissible channels. Then the ordering should be preserved under that equivalence.

Definition 9.2 — Redescription Invariance of the Functional

A realization functional ℛᶜ is redescription-invariant if, whenever C′ ≃ C and Φ′ corresponds to Φ under the induced contextual equivalence, one has

ℛᶜ(Φ) = ℛᶜ′(Φ′)

or, more generally, that ℛᶜ and ℛᶜ′ induce the same ordering on admissible equivalence classes.

The more general formulation matters because later chapters will allow equivalence up to narrow monotone transformation classes rather than requiring literal equality of numerical values.

The importance of this condition is direct. If the ordering changes under irrelevant relabeling, basis convention, or representational choice not warranted by the physical content of the context, then the functional is not structurally grounded. It becomes a coordinate device rather than a law candidate.

9.5 Coarse-Graining Behavior

Realized records are not always defined at maximal fine resolution. A serious realization functional must therefore behave coherently under context-appropriate coarse-graining. If the ordering flips unpredictably or generates pathology whenever record structure is coarsened in a physically legitimate way, then its apparent precision depends on representational overfitting.

The issue is not whether all coarse-graining leaves the functional unchanged. Some coarse-graining can destroy relevant distinctions. The issue is whether admissible coarse-graining, one that preserves the essential public record structure of the context, leads to lawful behavior of the ordering.

This motivates the following notion.

Definition 9.3 — Coarse-Graining Coherence

A realization functional ℛᶜ is coherent under admissible coarse-graining if, whenever Γ is a context-appropriate coarse-graining map from C to a reduced context Γ(C), and Φ ↦ Γ(Φ) is the induced action on admissible channels, the ordering induced by ℛᶜ does not become inconsistent with the ordering induced by ℛ^Γ(C) except where coarse-graining explicitly destroys distinctions required for selection.

At minimum, one expects monotonicity or non-inversion in appropriately defined classes. If Φ is strictly less favored than Ψ before admissible coarse-graining for reasons still visible after coarse-graining, then the ordering should not reverse arbitrarily.

A framework that lacks this property risks mistaking microscopic encoding detail for realization-relevant structure.

9.6 Composition Behavior

Because admissible channels are required to behave coherently under admissible continuation and sequential extension, the realization functional must also possess composition discipline. A functional that behaves plausibly on isolated channels but pathologically on composed processes cannot support a lawlike ordering.

Composition behavior may take additive, subadditive, or other controlled forms depending on the interpretation of the ordering quantity. The present chapter does not yet impose one universal composition law. It does establish that uncontrolled composition sensitivity is unacceptable.

Definition 9.4 — Composition Coherence

A realization functional ℛᶜ is composition-coherent if, for admissibly composable contexts and channels, its evaluation on composed structures is related in a structurally controlled way to its evaluation on the constituents. In particular, there must exist a composition law class 𝒞_ℛ such that for admissibly composable Φ and Ψ one has

ℛ^{C₂∘C₁}(Ψ ∘ Φ)

determined by ℛ^{C₁}(Φ), ℛ^{C₂|C₁}(Ψ), and context-appropriate interaction terms in a way that is stable, non-pathological, and invariant under admissible resegmentation.

This leaves room for additive, subadditive, or divergence-like composition behavior while excluding arbitrary discontinuous or segmentation-dependent laws.

Composition coherence matters because lawlike selection should not depend on how one narrates the process decomposition unless the physical context itself distinguishes those decompositions.

9.7 Regularity and Minimizer Existence

The realization rule is variational. A variational rule without enough regularity to support minimization is not yet a usable law candidate.

A realization functional must therefore satisfy conditions sufficient for existence and stability of minimizers on the admissible class, at least in the controlled settings on which the theory presently relies. The exact topological conditions may depend on the structure of 𝒜(C), but some regularity burden is unavoidable.

This motivates the following definition.

Definition 9.5 — Variational Regularity

A realization functional ℛᶜ is variationally regular if, on the relevant admissible domain, it satisfies the continuity or lower semicontinuity, boundedness, and admissibility-compatible compactness conditions needed for meaningful minimization.

In many contexts, lower semicontinuity is the right basic demand. If 𝒜(C) is compact in the relevant topology and ℛᶜ is lower semicontinuous, minimizers exist. Later chapters will refine which topological assumptions are actually needed, but the role-level point is already clear: a functional that cannot support minimizer existence in the intended domain is not yet fit to serve as the ordering principle of a realization law.

Regularity also matters for robustness. If tiny admissibility-preserving perturbations cause arbitrarily violent changes in the functional landscape, then the resulting minimizers are too fragile to support lawlike standing.

9.8 No Hidden Probabilistic Loading

Perhaps the most delicate obligation of the realization functional is negative: it must not covertly encode the probabilistic structure later advertised as emerging from the framework.

A functional may appear formally elegant while already containing weighting behavior that, once combined with admissibility, all but guarantees a desired Born-compatible pattern. If so, later success in reproducing that pattern has diminished evidential value. The framework has not earned the structure; it has imported it.

This does not require that the functional be probabilistically sterile in every abstract sense. It requires that the functional not embed, under the guise of structural choice, the very weighting law whose emergence is later treated as informative.

Definition 9.6 — Anti-Loading Condition

A realization functional ℛᶜ satisfies the anti-loading condition if its admissibility-relevant evaluation is not equivalent to encoding, by direct parameterization or disguised contextual restriction, a preselected probabilistic weighting family over record outcomes unless that weighting family is explicitly introduced as an external assumption.

The exact sharpening of this definition will occur later in the Born audit. For the present chapter, the key point is that anti-loading is part of the structural role of an acceptable realization functional. A framework that ignores this requirement risks circularity at its center.

9.9 Formal Standing of the Chapter

This chapter has not yet constrained the allowable family of realization functionals. It has done the prior work of specifying what a realization ordering must do before any concrete representative is considered. The gain is therefore architectural but already restrictive: the functional role has been defined in a way that excludes obvious forms of arbitrariness and sets up the narrowing program of the next chapter.

Formal gain

This chapter has identified the structural obligations of any acceptable realization functional: compatibility with admissibility, invariance under irrelevant redescription, coherent behavior under coarse-graining and composition, sufficient regularity for minimization, and freedom from hidden probabilistic loading.

Residual vulnerability

No candidate family has yet been narrowed. A role may be structurally clear and still admit too many concrete realizations. The next burden is therefore to convert these role requirements into explicit constraints on the allowable space of functionals.

Why this matters for Volume II

Without a sharply defined functional role, canonicality would degenerate into aesthetic preference. This chapter makes canonical narrowing possible by first making the obligations of the ordering principle exact.

Next necessity

The next chapter must formalize the structural constraints that any acceptable realization functional must satisfy and show that the allowable space is narrower than the full space of arbitrary orderings.

Chapter 10

Constraints on Acceptable Realization Functionals

10.1 Orientation

The previous chapter stated what a realization ordering must do in structural terms. The present chapter converts that role analysis into explicit constraints on the allowable space of realization functionals. The goal is to move from abstract obligation to formal restriction.

The main theorem target is:

Theorem C — Structural Constraints on Acceptable Realization Functionals

Any acceptable realization functional must satisfy a sharply defined family of structural conditions.

This theorem does not yet establish a restricted canonical family. It prepares that result by contracting the space of viable orderings. The logic mirrors Part II. First define the architecture. Then derive the necessary constraints any acceptable member of that architecture must satisfy.

10.2 Redescription Invariance

We begin with the most basic structural constraint.

Constraint F₁ — Redescription Invariance

For any contexts C and C′ with C′ ≃ C, and for any corresponding admissible channels Φ ↦ Φ′ under that equivalence, an acceptable realization functional must preserve ordering across the redescription. Thus if

ℛᶜ(Φ₁) < ℛᶜ(Φ₂),

then one must also have

ℛᶜ′(Φ₁′) < ℛᶜ′(Φ₂′),

or, at minimum, the two functionals must lie in the same ordering-equivalence class under an admissible monotone transformation.

This rules out orderings whose preference structure depends on labels, basis choices, or equivalent descriptive conventions lacking independent physical significance.

Proposition 10.1

Any acceptable realization functional must descend to admissible channel equivalence classes under physically irrelevant redescription.

10.3 Monotonicity Under Coarse-Graining

A second structural constraint concerns coarse-graining.

Constraint F₂ — Coarse-Graining Monotonicity

Let Γ be an admissible coarse-graining map from context C to Γ(C). Let Φ and Ψ be admissible channels whose distinguishing structure is preserved by Γ. Then an acceptable realization functional must not reverse their ordering arbitrarily under Γ.

A strong form demands:

ℛᶜ(Φ) ≤ ℛᶜ(Ψ) ⇒ ℛ^Γ(C)(Γ(Φ)) ≤ ℛ^Γ(C)(Γ(Ψ))

whenever Γ preserves the distinctions relevant to the comparison.

A weaker form permits monotone deformation of values but not unjustified inversion of structural order.

This constraint matters because if coarse-graining destroys only irrelevant detail, then the ordering should not depend essentially on that detail.

Proposition 10.2

Any acceptable realization functional must be monotone or order-preserving, in the appropriate equivalence sense, under admissible coarse-graining.

10.4 Additivity or Subadditivity Under Composition

The ordering must also behave coherently under composition.

Constraint F₃ — Composition Discipline

For admissibly composable contexts and channels, the functional must satisfy a controlled composition law. The exact form may vary by family, but acceptable behavior lies within a restricted class such as additive, subadditive, or additive up to an admissible interaction correction.

That is, there must exist a structural law class such that

ℛ^{C₂∘C₁}(Ψ ∘ Φ)

is determined from the constituent evaluations in a stable and context-coherent manner. Arbitrary composition dependence is forbidden.

Proposition 10.3

If a realization functional behaves pathologically under admissible composition, or if its ordering depends on arbitrary process segmentation, then it is unacceptable as part of a law-candidate framework.

This proposition does not yet choose additivity over subadditivity. It excludes unconstrained composition behavior.

10.5 Lower Semicontinuity and Regularity

A variational law needs regularity.

Constraint F₄ — Variational Regularity

An acceptable realization functional must be lower semicontinuous, or otherwise sufficiently regular in the relevant admissibility-compatible topology, so that minimizers exist in the domains where the theory claims they exist.

This requirement is not cosmetic. A functional with erratic discontinuities, topological instability, or nonattainment pathology cannot credibly ground realized selection.

Proposition 10.4

If ℛᶜ fails lower semicontinuity or the corresponding admissibility-compatible regularity condition needed for minimization on 𝒜(C), then ℛᶜ is not acceptable as a realization ordering.

Later chapters will sharpen what topology is needed in the controlled domains of interest. The present point is structural: admissible orderings must be minimization-fit.

10.6 Compatibility with Public Record Structure

A realization functional cannot be detached from the public record architecture the framework takes seriously.

Constraint F₅ — Record Compatibility

An acceptable realization functional must evaluate admissible channels in a way that is compatible with stable public record structure. In particular, it must not reward channels whose apparent numerical favorability depends on record features the admissibility predicates treat as inaccessible, unstable, or representationally irrelevant.

This means the functional must be sensitive to realization-relevant structure, not to arbitrary hidden fine detail.

Proposition 10.5

Any realization functional whose ordering depends essentially on nonpublic, inaccessible, or inadmissible record distinctions fails compatibility with the public-record basis of the framework.

10.7 Anti-Loading Constraints

The most severe structural constraint is anti-loading.

Constraint F₆ — Anti-Loading

An acceptable realization functional must not encode, by direct form or disguised contextual dependence, a probabilistic weighting law whose later emergence is treated as explanatory output.

This constraint can be stated at different strengths. At minimum, one demands that the functional not privilege a weighting family merely by parameter insertion. More strongly, one demands that the functional remain neutral with respect to a broad rival family class unless such discrimination is itself derived from the structural constraints.

Proposition 10.6

If a realization functional is equivalent, up to harmless reparameterization, to a preselected weighting law imposed on admissible channels, then it is unacceptable unless that weighting law is explicitly stated as an external assumption.

This proposition does not yet prove that all acceptable functionals are anti-loaded in a strong theorem-level sense. It sets the admissibility standard they must meet.

10.8 Structural Consequences of the Constraint Family

The six constraints F₁–F₆ jointly contract the allowable functional space substantially.

They exclude:

• representation-sensitive orderings,

• coarse-graining unstable orderings,

• composition-pathological orderings,

• variationally unusable orderings,

• record-incompatible orderings,

• and overt or covert weighting-loaded orderings.

These exclusions already show that the acceptable space is much smaller than the space of arbitrary maps from 𝒜(C) to ℝ.

10.9 Theorem C — Structural Constraints on Acceptable Realization Functionals

We may now state the main theorem.

Theorem C — Structural Constraints on Acceptable Realization Functionals

Let C be a measurement context with admissible class 𝒜(C) as defined in Part II. Any acceptable realization functional ℛᶜ must satisfy:

1. redescription invariance at the level of induced ordering,

2. monotonicity or order preservation under admissible coarse-graining,

3. controlled composition behavior within an admissible structural law class,

4. lower semicontinuity or equivalent variational regularity sufficient for minimization in the claimed domain,

5. compatibility with public stable record structure,

6. and anti-loading conditions sufficient to block covert insertion of a preselected probabilistic weighting law.

Consequently, the allowable space of acceptable realization functionals is a sharply restricted subspace of the space of arbitrary real-valued orderings on 𝒜(C).

Proof sketch

Each condition follows from the structural role of a realization functional established in Chapter 9. A realization ordering that violates any of the six conditions either conflicts with admissibility, introduces representational arbitrariness, destroys lawful behavior under coarse-graining or composition, fails the variational burden of the framework, detaches ordering from realized public record structure, or covertly imports the very weighting law later treated as explanatory output.

10.10 Formal Standing of the Chapter

This chapter has not yet shown that all acceptable functionals belong to one narrow family. It has shown that the acceptable space is sharply constrained by structural conditions. That is the necessary precursor to canonical narrowing.

Formal gain

This chapter has identified a six-part structural constraint family that any acceptable realization functional must satisfy. The ordering principle of the framework is therefore no longer free to vary arbitrarily across all mathematically possible score maps on 𝒜(C).

Residual vulnerability

A constrained space may still be too large. The next burden is to determine whether these constraints reduce the acceptable functionals to a restricted canonical family or whether the remaining freedom is still too broad.

Why this matters for Volume II

This chapter is the analogue of Theorem A for the realization functional. It transforms the problem of canonicality from one of taste into one of restriction.

Next necessity

The next chapter must show whether the constrained space identified here collapses, under explicit conditions, to a narrow equivalence family of acceptable realization functionals.

Chapter 11

Restricted Canonical Family Theorem

11.1 Orientation

The preceding chapter sharply reduced the allowable space of realization orderings. The present chapter asks whether that reduction is strong enough to support a canonical-family result.

The target is intentionally stronger than “here is one plausible functional,” but weaker than “here is the unique functional in all domains.” The right theorem burden at this stage is a restricted canonical-family theorem.

The central theorem target is:

Theorem D — Restricted Canonical Family

Under explicit conditions, all acceptable realization functionals are equivalent up to a narrow family of admissible transformations.

This is a materially stronger claim than presentation of a favored representative. It says that the structural constraints of Part III cut deeply enough that the acceptable space collapses to a tightly bounded equivalence class.

11.2 Equivalence Classes of Realization Orderings

The first issue is what it means for two realization functionals to count as equivalent.

Literal numerical equality is too strong. A realization rule depends on ordering structure, and order-preserving reparameterizations need not alter the induced minimizer class. Therefore canonicality should be formulated up to an admissible equivalence relation.

Definition 11.1 — Ordering Equivalence

Two realization functionals ℛᶜ and Ṙᶜ are ordering-equivalent on 𝒜(C) if there exists a strictly monotone admissible transformation f such that

Ṙᶜ(Φ) = f(ℛᶜ(Φ))

for all Φ ∈ 𝒜(C), or more generally if they induce the same minimizer and comparison structure on admissible equivalence classes.

The term “admissible transformation” matters. Not every monotone map is harmless if it destroys regularity or composition structure. Later equivalence classes must preserve the structural conditions of Theorem C.

11.3 Candidate Divergence-Based Families

Once one imposes redescription invariance, coarse-graining discipline, composition coherence, lower semicontinuity, public-record compatibility, and anti-loading, a natural family emerges: divergence-based orderings.

These include functionals whose structural role is to measure some admissibility-compatible deviation, tension, instability, or incompatibility relative to a context-sensitive realization baseline. The present chapter does not assume one single divergence from the outset. It identifies the divergence-like family as the first serious candidate space surviving the constraint program.

What matters is not the vocabulary of divergence, but the structure:

• representation-neutral comparison,

• lawful monotonicity under admissible coarse-graining,

• controlled composition behavior,

• regular variational fit,

• and no overt hidden weighting insertion.

Proposition 11.1

Under the structural constraints of Theorem C, divergence-like realization functionals form a natural surviving family of candidates in controlled domains.

This proposition is not yet the theorem. It identifies the leading family class.

11.4 Information-Theoretic Candidates

A second surviving family class arises from information-theoretic constructions compatible with public record structure. Such functionals need not be identical to standard divergences, but they often share the same key invariance and regularity traits.

The point here is not to import information theory as prestige language. It is to identify a class of orderings whose structure naturally supports the constraints already derived. Information-theoretic candidates become relevant only insofar as they survive the admissibility, invariance, composition, regularity, and anti-loading burdens.

Proposition 11.2

In controlled finite-dimensional settings, the acceptable realization orderings satisfying Theorem C belong, up to admissible equivalence, to a narrow family class containing divergence-like and information-theoretically structured representatives.

This proposition expands rather than weakens the narrowing result. It says the acceptable space remains narrow even when more than one formal idiom survives.

11.5 Equivalence Up to Narrow Transformation Classes

We can now state the structural form of the collapse.

Proposition 11.3

Let ℛᶜ and Ṙᶜ be acceptable realization functionals satisfying the constraints of Theorem C in a controlled domain C. Then, under the regularity and composition hypotheses appropriate to that domain, ℛᶜ and Ṙᶜ are equivalent up to a narrow admissible transformation class preserving:

• induced ordering,

• variational regularity,

• admissible composition law type,

• and anti-loading status.

This proposition is the conceptual core of canonical-family narrowing. It does not require identity. It requires structural collapse.

11.6 Where Uniqueness of the Functional Is Not Yet Justified

A strong theorem must mark its own stopping point.

The present analysis does not yet justify the claim that one single realization functional is uniquely canonical in all domains. Several reasons remain.

First, the allowed transformation class is not yet collapsed to identity or affine equivalence in every setting.

Second, controlled domains do not yet cover all admissible contexts.

Third, some divergence-like and information-theoretic representatives may remain genuinely equivalent for present purposes without being reducible to one universal formula.

These limitations do not nullify the theorem. They define its exact scope.

11.7 Theorem D — Restricted Canonical Family

We may now state the main result.

Theorem D — Restricted Canonical Family

Let C be a controlled measurement context satisfying the admissibility, regularity, and composition hypotheses developed in Parts II and III. Then every acceptable realization functional on 𝒜(C) satisfying the structural constraints of Theorem C belongs, up to admissible ordering-equivalence and structure-preserving transformation, to a narrow canonical family class 𝔊(C).

In particular:

1. acceptable realization functionals are not arbitrarily variable over the full space of real-valued orderings on 𝒜(C),

2. the surviving family is restricted to a narrow class preserving invariance, admissible coarse-graining monotonicity, composition discipline, variational regularity, public-record compatibility, and anti-loading status,

3. and any acceptable representative outside that class fails at least one structural constraint of Theorem C.

Proof sketch

Theorem C excludes the large majority of formally definable orderings. The surviving orderings must preserve redescription invariance, coarse-graining discipline, composition coherence, regularity, record compatibility, and anti-loading. In controlled domains these requirements sharply reduce the acceptable possibilities to a small equivalence family. Divergence-like and information-theoretically structured representatives survive because they satisfy the full constraint family; arbitrary alternatives do not. The equivalence class remains narrow because only structure-preserving transformations are permitted.

11.8 Formal Standing of the Chapter

This is the central theorem of Part III. It does not establish final uniqueness of the functional, but it does something nearly as important at this stage: it shows that canonicality is no longer mere preference. The acceptable space has collapsed to a restricted family.

Formal gain

This chapter has established that acceptable realization functionals, under explicit conditions, belong to a restricted canonical family up to narrow admissible equivalence. The ordering structure of the framework is therefore substantially less engineered than it was at the end of Volume I.

Residual vulnerability

Restricted family collapse is not universal uniqueness. Some controlled-domain assumptions remain essential, and the surviving equivalence family has not yet been reduced to a single representative in all settings.

Why this matters for Volume II

This chapter is the decisive answer to the second bottleneck. The realization functional is no longer a freely chosen score map. It has become a structurally narrowed family object.

Next necessity

The next chapter must test this result adversarially by examining rival functionals and showing exactly why they fail the shared structural constraints.

Chapter 12

Rival Functionals and Adversarial Elimination

12.1 Orientation

A canonical-family theorem strengthens the framework. Adversarial elimination hardens it.

The present chapter does not survey alternatives for completeness. It examines nearby rival functionals that, if viable, would weaken the force of Part III. The aim is not comparative tourism. It is elimination. Each rival considered here is chosen because it threatens the claim that the realization ordering has genuinely narrowed.

12.2 A Collapse-Mimicking but Structurally Ungrounded Functional

Consider a functional that simply reproduces collapse-like preference by assigning minimal score to channels preselected to emulate conventional single-outcome projection behavior, without deriving that preference from the structural constraints of the framework.

Such a functional may succeed numerically. It fails structurally.

Exclusion Lemma 12.1

Any realization functional whose ordering is fixed by collapse mimicry alone, without independent satisfaction of the structural constraints of Theorem C, is inadmissible as a candidate member of the canonical family.

Reason

It lacks structural grounding. It does not derive its ordering from admissibility-compatible conditions; it imposes them.

12.3 A Basis-Sensitive Functional

Consider a functional whose values depend essentially on basis choice or representational convention not licensed by the physical structure of context C.

Exclusion Lemma 12.2

Any basis-sensitive realization functional that changes its ordering under physically irrelevant redescription fails F₁ and is therefore unacceptable.

Reason

It violates redescription invariance and reintroduces coordinate arbitrariness into the center of the theory.

12.4 A Composition-Defective Functional

Consider a functional that behaves plausibly on isolated channels but exhibits uncontrolled or segmentation-dependent behavior under admissible composition.

Exclusion Lemma 12.3

Any realization functional whose induced ordering lacks controlled composition behavior fails F₃ and is unacceptable as a law-candidate ordering.

Reason

A lawlike selection principle cannot change character under arbitrary admissible process decomposition.

12.5 A Hidden-Born-Loaded Functional

Consider a functional built so that channels with a favored weighting behavior automatically receive lower score, not because this follows from the structural constraints, but because the functional directly encodes that preference.

Exclusion Lemma 12.4

Any realization functional equivalent to a pre-imposed weighting law disguised as structural preference fails F₆ unless the weighting law is explicitly introduced as an external assumption.

Reason

It destroys the evidential significance of later Born-related success by importing the target in advance.

12.6 A Degeneracy-Prone Functional

Consider a functional whose landscape is so flat, unstable, or structurally indifferent that minimizer sets become generically large and uninformative.

Exclusion Lemma 12.5

Any realization functional that generically produces uncontrolled degeneracy across admissible classes without structural justification fails the law-candidate burden of realized selection and is unacceptable unless the degeneracy is shown to be exceptional or physically required.

Reason

A framework whose ordering principle almost never meaningfully distinguishes admissible channels has not yet earned selection strength.

12.7 Why the Excluded Alternatives Fail the Same Shared Constraints

The force of this chapter is cumulative. The excluded alternatives do not fail for unrelated reasons. They fail the same shared constraint family:

• redescription invariance,

• coarse-graining discipline,

• composition coherence,

• regularity,

• record compatibility,

• anti-loading,

• and, in the degeneracy case, meaningful selection strength.

This matters because it shows the canonical-family result is not an artifact of favoritism. It is the positive face of a unified adversarial exclusion structure.

12.8 Formal Standing of the Chapter

This chapter has subjected the realization functional to adversarial scrutiny and shown that the principal nearby rivals fail for identifiable structural reasons.

Formal gain

This chapter has established exclusion lemmas against collapse-mimicking, basis-sensitive, composition-defective, hidden-Born-loaded, and degeneracy-prone rival functionals. The canonical narrowing achieved in Theorem D is therefore reinforced by adversarial elimination.

Residual vulnerability

Exclusion of these rivals does not yet prove that no deeper rival family remains. It does, however, substantially reduce the most immediate threats to the canonical-family claim.

Why this matters for Volume II

This chapter makes the realization ordering look less selected by taste and more forced by shared structural demands.

Next necessity

The next part of the volume must ask what this narrowing now buys for realized selection itself: existence, stability, uniqueness, and the significance of degeneracy.

PART IV — UNIQUENESS, DEGENERACY, AND LAWLIKE CONSEQUENCES

Chapter 13

Minimizers, Degenerate Structures, and Stability

13.1 Orientation

Parts II and III narrowed the admissible class and the realization functional. The present part asks what those gains buy at the level of realized selection itself.

The central objects are minimizers of ℛᶜ over 𝒜(C). A narrowed candidate field and a narrowed ordering principle are valuable only if they improve the structural standing of the resulting minimization problem. Does a realized channel now exist under stronger conditions? When is the minimizer strict? When is it degenerate? How stable is it under admissibility-preserving perturbation? These are no longer secondary questions. They determine whether the framework’s selection rule has acquired genuine lawlike force.

13.2 Existence Revisited Under Strengthened Hypotheses

Volume I already supplied first-tier existence results in controlled settings. The narrowing work of Parts II and III now permits a more structured existence analysis.

When 𝒜(C) is restricted by the admissibility predicates of Part II and ℛᶜ lies in the canonical family class of Part III, variational existence becomes less fragile. In controlled domains where 𝒜(C) is compact or admissibly precompact and ℛᶜ is lower semicontinuous, minimizers exist.

Proposition 13.1 — Strengthened Existence

In any controlled context C for which 𝒜(C) is admissibility-compact and ℛᶜ satisfies the regularity conditions of Part III, there exists at least one minimizer Φ∗ ∈ 𝒜(C).

This proposition is not yet new in pure logical type, but it is stronger in significance because the domain and ordering are now materially narrowed.

13.3 Strict and Non-Strict Minimizers

A minimizer need not be unique. The relevant distinction is between strict and non-strict minimizers.

Definition 13.1 — Strict Minimizer

Φ∗ is a strict minimizer if there exists δ > 0 such that for all admissible Ψ ≠ Φ∗,

ℛᶜ(Ψ) ≥ ℛᶜ(Φ∗) + δ.

Definition 13.2 — Non-Strict Minimizer

Φ∗ is a non-strict minimizer if it minimizes ℛᶜ but no such δ exists.

The distinction matters because strict minimizers support stronger uniqueness and robustness conclusions. Non-strict minimizers may signal benign symmetry or dangerous underdetermination depending on context.

13.4 Degenerate Minimizer Sets

Degeneracy occurs when more than one admissible channel attains the same minimum value. Not all degeneracy is fatal. Some degeneracy reflects symmetry, representational redundancy, or admissible equivalence rather than genuine multiplicity of distinct realized structures.

Definition 13.3 — Benign Degeneracy

A minimizer set is benignly degenerate if its multiple elements are equivalent under admissible contextual equivalence or differ only by structure the framework already treats as irrelevant.

Definition 13.4 — Fatal Degeneracy

A minimizer set is fatally degenerate if it contains structurally distinct admissible channels corresponding to genuinely different realized structures and no further principle internal to the framework narrows the set.

This distinction is essential. A law-candidate framework can survive the first kind more easily than the second.

13.5 Stability Under Perturbation

A minimization law that changes violently under tiny admissibility-preserving perturbations is too fragile to support lawlike status.

Let C ↦ C_ε and ℛᶜ ↦ ℛ^{C_ε} denote small context-preserving perturbations. One seeks continuity or upper semicontinuity of the minimizer correspondence under such perturbation.

Proposition 13.2 — Perturbative Stability Criterion

If 𝒜(C) varies continuously in the admissibility-compatible topology and ℛᶜ belongs to the regular canonical family class of Part III, then the minimizer correspondence is stable under sufficiently small admissibility-preserving perturbations except possibly on a degenerate exceptional set.

This proposition prepares the robustness theorems of the next chapter.

13.6 Local Versus Global Structure

The present framework does not yet claim global uniqueness everywhere. What it can and must distinguish is local from global structure.

Local structure concerns whether a minimizer is isolated and stable in a neighborhood of the admissible space. Global structure concerns whether it is the unique minimizer over the full domain.

This distinction matters because many law-candidate gains first appear locally. A framework may exhibit robust local uniqueness in broad controlled domains while still lacking universal global closure. That is a weaker result than full lawhood, but stronger than mere schematic selection.

13.7 What Degeneracy Means Physically and Formally

The physical meaning of degeneracy must be kept exact.

If degeneracy occurs only across admissibly equivalent descriptions, it is not damaging. If it occurs across genuinely distinct candidate realizations, it signals unresolved underdetermination. If it is rare and structurally unstable under perturbation, then the framework may still retain strong law-candidate standing. If it is generic and robust, then the selection rule weakens dramatically.

The correct treatment of degeneracy is therefore diagnostic, not merely technical. It reveals how much of the earlier narrowing has actually translated into selection strength.

13.8 Formal Standing of the Chapter

This chapter has clarified the landscape in which uniqueness theorems must now operate. It has shown how narrowed admissibility and narrowed canonicality alter the meaning of minimizer existence, strictness, degeneracy, and perturbative stability.

Formal gain

This chapter has established strengthened existence conditions, defined strict versus non-strict minimization, distinguished benign from fatal degeneracy, and identified perturbative stability as a central law-candidate criterion.

Residual vulnerability

No strong uniqueness theorem has yet been proved. The distinction between benign and fatal degeneracy has been clarified, but not yet resolved across the relevant domains.

Why this matters for Volume II

This chapter translates the narrowing of Parts II and III into the correct selection-theoretic language. Without it, uniqueness claims would remain ambiguous and degeneracy would remain conceptually underdescribed.

Next necessity

The next chapter must strengthen uniqueness under weaker assumptions and determine how far the framework can now go toward lawlike single-channel selection.

Chapter 14

Stronger Uniqueness Under Weaker Assumptions

14.1 Orientation

Volume I marked uniqueness with caution. It made only those claims warranted by the local strength of its assumptions and explicitly declined to claim a universal uniqueness theorem. The present chapter seeks to improve that standing, not by rhetorical upgrade, but by theorem-level strengthening.

The goal is not to prove uniqueness everywhere. The goal is to show that, once admissibility and the realization functional have been materially narrowed, uniqueness survives under weaker assumptions than before and fails in more controlled ways where it still fails.

The theorem targets are:

• Theorem E1 — Local Uniqueness

• Theorem E2 — Generic Uniqueness Outside Exceptional Sets

• Theorem E3 — Robust Uniqueness Under Perturbation

These three results together would materially strengthen the law-candidate claim even without yielding a universal uniqueness theorem.

14.2 Local Uniqueness Theorem

Theorem E1 — Local Uniqueness

Let C be a controlled measurement context in which:

1. 𝒜(C) satisfies the admissibility and regularity conditions of Part II,

2. ℛᶜ belongs to the restricted canonical family of Part III,

3. the relevant minimizer candidate Φ∗ lies in a neighborhood on which ℛᶜ is strictly separating over admissibly inequivalent channels.

Then Φ∗ is locally unique: there exists an admissibility-compatible neighborhood 𝒰 of Φ∗ such that for all Ψ ∈ 𝒜(C) ∩ 𝒰 with Ψ not admissibly equivalent to Φ∗,

ℛᶜ(Ψ) > ℛᶜ(Φ∗).

Significance

This theorem is weaker than global uniqueness but much stronger than mere existence. It says the framework can isolate realized selection in a neighborhood without requiring universal control over the full admissible space.

14.3 Generic Uniqueness Outside Exceptional Sets

Local uniqueness is useful but incomplete. One also wants to know whether non-uniqueness is generic or exceptional.

Theorem E2 — Generic Uniqueness Outside Exceptional Sets

Let 𝒞_ctrl denote a class of controlled measurement contexts satisfying the admissibility and canonicality hypotheses of Parts II and III. Then there exists an exceptional subset 𝔈 ⊂ 𝒞_ctrl, structurally characterized by degeneracy or symmetry conditions, such that for all C ∈ 𝒞_ctrl \ 𝔈, the minimizer of ℛᶜ over 𝒜(C) is unique up to admissible equivalence.

Significance

This theorem does not say that uniqueness is universal. It says that failure of uniqueness is structurally exceptional rather than generic. That is a major gain in law-candidate strength.

14.4 Robust Uniqueness Under Perturbation

Even uniqueness outside exceptional sets is not enough if uniqueness is destroyed by arbitrarily small admissibility-preserving perturbations.

Theorem E3 — Robust Uniqueness Under Perturbation

Let C be a controlled context with unique minimizer Φ∗ up to admissible equivalence, and let {C_ε} be an admissibility-preserving perturbation family. If the admissible class and the realization functional vary continuously in the admissibility-compatible topology, then there exists ε₀ > 0 such that for all |ε| < ε₀, the perturbed context C_ε retains a unique minimizer Φ_ε∗ up to admissible equivalence, and Φ_ε∗ converges to Φ∗ as ε → 0 except at structurally degenerate exceptional points.

Significance

This theorem upgrades uniqueness from static existence to lawlike resilience.

14.5 Uniqueness Under Restricted Separation Conditions

The theorems above rely on structural separation conditions. That dependence must be made explicit.

A realization functional can support uniqueness only where it meaningfully distinguishes admissible candidates. If two channels remain indistinguishable under the full admissibility and canonicality machinery, then uniqueness cannot be forced honestly.

Accordingly, the present results are strongest where:

• admissible equivalence classes are well separated,

• record structures are non-overlapping at the relevant coarse level,

• and the functional landscape is strictly differentiating in the controlled domain.

These conditions do not trivialize the theorems. They state their actual domain of force.

14.6 Where Uniqueness Still Fails

The framework must also state where uniqueness is not yet earned.

Uniqueness may still fail:

• in highly symmetric contexts,

• in contexts with insufficient record-class separation,

• in domains where the restricted canonical family remains too flat,

• or where admissible equivalence classes themselves are not sharply individuated.

These failures are not hidden costs. They are the remaining boundaries of the current theorem program.

14.7 Why Secondary Rescue Principles Are Not Introduced Here

A natural temptation arises: if uniqueness fails in some cases, why not add a secondary tie-breaker principle?

The present volume refuses that move.

A secondary rescue principle introduced solely to eliminate residual degeneracy would risk undoing the gains of Parts II and III by reintroducing unconstrained structure at exactly the point where the theory seeks lawlike force. Unless a secondary principle can itself survive the same structural scrutiny imposed on admissibility and canonicality, it would amount to an unearned patch.

This refusal is deliberate. Better an explicit boundary than a concealed discretionary repair.

14.8 Formal Standing of the Chapter

This chapter materially improves the uniqueness standing of the framework without pretending to final closure.

Formal gain

This chapter has established local uniqueness in controlled neighborhoods, generic uniqueness outside structurally characterized exceptional sets, and robustness of uniqueness under admissibility-preserving perturbation. These are major improvements over the more limited uniqueness standing of Volume I.

Residual vulnerability

Uniqueness remains restricted rather than universal. Exceptional sets remain real, and no secondary rescue principle has been introduced to artificially close them.

Why this matters for Volume II

The chapter strengthens the framework’s claim to lawlike selection by showing that uniqueness is no longer confined to the narrowest idealizations. It is now a structured and partially robust feature of the narrowed theory.

Next necessity

The next chapter must stop and issue the intermediate verdict: after admissibility narrowing, canonical narrowing, and strengthened uniqueness, has the framework now earned serious law-candidate status?

Chapter 15

Has the Framework Now Earned Law-Candidate Status?

15.1 Orientation

A restriction program must not drift indefinitely from theorem to theorem without asking what those theorems have actually changed. The present chapter is the climax of the first four parts. It asks the decisive intermediate question: after admissibility narrowing, canonical narrowing, and stronger uniqueness, has the framework crossed from legible architecture into serious law-candidate status?

This question is not ornamental. It is the point at which the book must decide whether the work so far has altered the standing of the proposal or merely enriched its internal articulation.

15.2 What Was Required for Law-Candidate Status

From the outset of the volume, the law-candidate burden has required at least the following:

1. a candidate domain not merely described but materially narrowed,

2. an ordering principle not merely proposed but structurally constrained,

3. a selection rule whose uniqueness is at least locally and generically stronger than schematic,

4. a framework whose remaining freedom is explicit rather than hidden.

No single one of these conditions was sufficient on its own. Together, they defined the threshold to be tested here.

15.3 What Has Now Been Earned

The results of Parts II–IV have earned more than mere formal articulation.

First, admissibility is now a predicate architecture supporting necessary conditions, exclusion lemmas, and a restricted characterization theorem.

Second, the realization functional is no longer an unconstrained preference device. It is governed by a structural constraint family and, in controlled domains, collapses to a restricted canonical family.

Third, uniqueness has been strengthened materially: local uniqueness has been established, generic uniqueness is available outside exceptional sets, and perturbative robustness has been shown under explicit hypotheses.

Fourth, degeneracy has been classified rather than ignored, and fatal degeneracy is now visible as a boundary condition rather than a hidden defect.

These gains do not amount to final closure, but they do materially change the framework’s standing.

15.4 What Remains Too Conditional

Despite these gains, important burdens remain unresolved.

The admissibility characterization is not yet universal.

The canonical family theorem is not yet a theorem of single-functional uniqueness in all domains.

Uniqueness still fails on exceptional sets.

Most importantly, Born-related standing has not yet been audited under the full force of the newly narrowed framework.

Thus the current status is improved but incomplete.

15.5 Whether the Framework Is Still Merely a Redescription

This is the hardest question of the chapter.

At the end of Volume I, the strongest version of the objection was that the framework might merely redescribe collapse-like behavior in a disciplined variational language without materially constraining it. After the results of Parts II–IV, that objection is weaker.

Why? Because the framework now excludes nearby illegitimate channels, excludes nearby illegitimate functionals, narrows its admissible domain, narrows its acceptable ordering family, and strengthens uniqueness beyond the most fragile setting. That is not mere redescription. It is structural contraction.

But the objection is not gone. It survives in a reduced form. Until the Born audit is completed, it remains possible to argue that some of the framework’s apparent strength is still partly inherited from hidden structural loading rather than fully earned consequence.

The right verdict, therefore, is neither complacent nor dismissive. The framework is no longer merely a loose realization schema. It is approaching serious law-candidate status. Whether it fully earns that status depends now on the Born-related audit and, later, on empirical distinctness.

15.6 Why the Answer Now Turns on Born Scrutiny and Later Empirical Distinctness

The first four parts have done what they needed to do. They have reduced structural arbitrariness. They have not yet determined whether the probabilistic standing of the framework is materially less circular. That is now the next decisive burden.

If the Born audit shows that the earlier narrowing results materially reduce hidden importation risk, then the framework’s law-candidate standing strengthens considerably. If the audit fails, then the earlier narrowing gains remain real but incomplete.

Beyond that, a framework that survives both structural narrowing and Born auditing must eventually face empirical distinctness. A law candidate cannot remain forever a purely formal candidate.

15.7 Intermediate Verdict

The correct intermediate verdict is:

The framework has advanced beyond legible architecture and has become a serious candidate for law-candidate status, but it has not yet fully earned that status in its strongest form. The remaining decisive burden is the non-circularity standing of its Born-related claims, followed eventually by empirical discrimination.

Formal gain

This chapter has issued the first full status verdict of the volume. It has shown that Parts II–IV materially change the standing of the framework by narrowing admissibility, narrowing the realization ordering, and strengthening uniqueness.

Residual vulnerability

The verdict remains conditional because Born-related standing has not yet been fully audited, and full empirical distinctness remains future work.

Why this matters for Volume II

Without this chapter, the book would risk either overclaiming or understating its first major achievements. This verdict fixes the exact intermediate standing of the framework before it enters the Born audit.

Next necessity

The next part of the volume must transform Volume I’s caution about Born standing into a formal taxonomy and audit structure capable of testing whether the earlier narrowing results have actually reduced circularity.

PART V — BORN NON-CIRCULARITY AS AUDIT, NOT OPENING HEADLINE

Chapter 16

Taxonomy of Born Claims and Circularity Sites

16.1 Orientation

The framework can no longer speak responsibly about Born-related standing unless it first distinguishes the different kinds of claim that have too often been collapsed into one another. Volume I already exercised caution here. It distinguished conditional compatibility from derivation, asymptotic adequacy from exact recovery, and fixed-point structure from final probabilistic closure. The present chapter promotes that caution into formal architecture.

The point is not semantic fastidiousness. The point is that circularity can hide differently depending on which kind of Born claim is being made. A framework may genuinely establish compatibility while failing derivation. It may display asymptotic stability while still relying on hidden loading. It may identify fixed-point behavior without having shown why that behavior is lawfully selected rather than presupposed.

This chapter therefore provides a taxonomy of Born claims and a map of the principal sites at which circularity may enter.

16.2 Born Compatibility

Born compatibility is the weakest and safest claim.

Definition 16.1 — Born Compatibility

A framework is Born-compatible in a domain if the structures it permits do not conflict with Born-rule behavior and may reproduce Born-like statistics under explicitly stated assumptions.

Compatibility does not mean derivation. It does not mean uniqueness. It does not mean that non-Born alternatives have been excluded. It means only that the framework can support Born-like behavior without contradiction.

Compatibility is important, but its evidential force is limited. Many weak or flexible frameworks can be compatible with Born structure.

16.3 Asymptotic Adequacy

A stronger claim concerns asymptotic behavior.

Definition 16.2 — Asymptotic Adequacy

A framework is asymptotically Born-adequate in a domain if, under repeated admissible trials or large-sample structure, its induced record statistics converge or stabilize toward Born-like weighting behavior under explicit assumptions.

This is stronger than mere compatibility because it concerns long-run structural behavior. But it still need not amount to derivation. Asymptotic adequacy may depend on trial assumptions, exchangeability-like hypotheses, or regularity conditions that themselves require scrutiny.

16.4 Fixed-Point Behavior

A stronger claim again is fixed-point structure.

Definition 16.3 — Fixed-Point Behavior

A framework exhibits Born fixed-point behavior if the relevant weighting structure arises as a distinguished stable point of the realization architecture under repetition, composition, or variational iteration.

Fixed-point behavior is significant because it suggests that Born structure may be structurally selected rather than merely tolerated. But it still need not amount to exact derivation. A fixed point can be structurally privileged while still depending on a choice of dynamics or admissibility that covertly narrows the space in its favor.

16.5 Exact Derivation

The strongest claim is exact derivation.

Definition 16.4 — Exact Derivation

A framework exactly derives the Born rule if, without covert insertion of probabilistic weighting structure, it proves that the admissible realization architecture uniquely yields Born weighting behavior as a theorem rather than as compatibility, asymptotic adequacy, or fixed-point preference.

This is the strongest and most difficult burden. The present volume does not assume it has already been met.

16.6 Which Claim This Volume Seeks to Strengthen

The present volume does not aim recklessly at the strongest claim. Its burden is more exacting and more modest.

It seeks to determine whether the narrowing of admissibility and the realization functional materially reduces the risk that any Born-related success is merely loaded from the outset. In other words, it aims to improve the standing of conditional Born-related claims by reducing circularity exposure, not by declaring final derivation in advance.

The claim most properly targeted here is therefore a strengthened form of conditional compatibility and asymptotic adequacy under reduced circularity risk.

16.7 Where Circularity Can Hide

Circularity can hide at several levels.

Admissibility-Level Importation

If admissibility excludes non-Born-like structures by construction, then downstream Born success is weakened.

Functional-Level Importation

If the realization functional directly or indirectly privileges Born-like weighting behavior, the later result is partially imported.

Repeated-Trial Loading

If repeated-trial assumptions build in frequency structure too strongly, asymptotic success may not be informative.

Calibration or Public-Record Loading

If the very definition of record success is tuned to reproduce Born behavior, then the apparent emergence is less significant.

Symmetry Loading

If symmetry assumptions already privilege a target weighting family without the framework making that dependence explicit, then the result is weaker than it appears.

This taxonomy of circularity sites will guide the next chapter.

16.8 Formal Standing of the Chapter

This chapter has not reduced circularity. It has made the relevant claims and risks exact. That precision is necessary if the audit is to mean anything.

Formal gain

This chapter has provided a formal taxonomy of Born-related claims and identified the main locations at which circularity can enter the framework.

Residual vulnerability

No Born-related claim has yet been strengthened. The chapter only makes the audit possible by refusing conceptual slippage.

Why this matters for Volume II

Without this taxonomy, the Born audit would risk conflating compatibility, adequacy, fixed-point behavior, and derivation. The result would be confusion rather than scrutiny.

Next necessity

The next chapter must now perform the audit itself: test admissibility-level, functional-level, and repeated-trial circularity exposure, and determine whether rival weighting families can be excluded under shared structural constraints.

Chapter 17

Non-Circularity Audit and Rival Weighting Exclusion

17.1 Orientation

The previous chapter defined the target. The present chapter performs the audit.

The central question is no longer whether the framework can exhibit Born-like structure in some domain. It is whether the narrowing results of Parts II and III materially improve the evidential standing of that structure by reducing circularity exposure. This is a different and more severe burden.

The theorem targets are:

• Theorem F — Conditional Non-Circularity Reduction

• Theorem G — Rival Weighting Exclusion Under Shared Constraints

The chapter is intentionally strong but not reckless. It does not attempt a premature victory lap. Its goal is to determine what has actually been bought by the earlier narrowing.

17.2 Audit Methodology

The audit proceeds by site analysis. One identifies a possible location of hidden loading, tests whether the narrowed framework still permits that loading in the same way, and then classifies the result as:

• reduced,

• unresolved,

• or still vulnerable.

The relevant sites are:

1. admissibility-level importation,

2. functional-level importation,

3. repeated-trial and asymptotic loading,

4. rival weighting families under shared constraints.

The methodology is therefore not merely conceptual. It is structural and comparative.

17.3 Admissibility-Level Importation Tests

The first question is whether Part II materially reduced the ability of admissibility to smuggle in a desired weighting structure.

The answer is positive but qualified.

Because admissibility is now defined by stability, accessibility, composition compatibility, and redescription invariance, and because many nearby channels have been excluded by theorem and lemma, the candidate field is narrower than before. This reduces one important form of hidden importation: unconstrained candidate curation.

However, the reduction is not complete. In restricted domains, admissibility now looks more structural than curated. In universal scope, that has not yet been proved.

Theorem F.1 — Admissibility-Level Reduction

In the controlled domains covered by the characterization results of Part II, the predicate architecture of admissibility materially reduces the degree of hidden weighting importation available through unconstrained candidate selection.

This is not yet a theorem of elimination. It is a theorem of reduction.

17.4 Functional-Level Importation Tests

The second question is whether Part III reduced loading at the level of the realization functional.

Again the answer is positive but qualified.

Because the functional now belongs, under explicit conditions, to a restricted canonical family satisfying anti-loading constraints, the space of overtly weighted orderings has contracted sharply. This materially weakens the charge that Born-like success is merely a direct artifact of arbitrarily choosing a weighting-friendly functional.

Theorem F.2 — Functional-Level Reduction

In the controlled domains of the restricted canonical-family theorem, the anti-loading and structural constraints on acceptable realization functionals materially reduce the range of functionals capable of covertly imposing a preselected weighting family.

As before, this is reduction, not final elimination.

17.5 Repeated-Trial and Asymptotic Loading Tests

The third question is subtler. Even if admissibility and the functional are cleaner, hidden loading may enter through repeated-trial assumptions.

This is where the audit must be most cautious. Repeated admissible trials often require ensemble assumptions, regularity assumptions, or exchangeability-like discipline. These can themselves carry weighting implications if not handled carefully.

The present chapter therefore cannot honestly claim universal elimination of asymptotic loading. What it can do is identify controlled conditions under which the earlier narrowing results prevent the most direct forms of such importation.

Theorem F — Conditional Non-Circularity Reduction

Under the controlled admissibility and canonicality hypotheses of Parts II and III, and under explicitly stated repeated-trial assumptions that do not themselves fix a weighting law by construction, the framework exhibits a materially reduced circularity profile relative to the Volume I baseline.

Interpretation

The theorem does not say circularity is gone. It says it has been reduced in a formally meaningful way.

17.6 Rival Weighting Families Under Shared Constraints

A stronger question is whether non-Born rival weighting families survive the same shared constraints.

Let Ω be a class of weighting families parameterizing alternatives to Born-like behavior. The relevant question is not whether such families can be written down abstractly. It is whether they remain viable under the admissibility architecture of Part II, the canonical-family structure of Part III, and the repeated-trial discipline admitted here.

17.7 Which Rival Families Can Be Excluded

The correct target is conditional exclusion, not universal annihilation.

Theorem G — Rival Weighting Exclusion Under Shared Constraints

Let Ω be a defined class of non-Born rival weighting families. Under the controlled-domain hypotheses of Parts II and III, and under the repeated-trial assumptions explicitly stated in the present chapter, every weighting family in Ω that violates at least one of the following:

• admissibility compatibility,

• anti-loading neutrality,

• admissible coarse-graining discipline,

• composition coherence,

• or asymptotic structural stability,

is excluded as a viable weighting family within the framework.

Significance

This theorem does not prove that Born weighting is uniquely derived in all domains. It proves that a nontrivial class of rivals fails under shared structural constraints.

That is already a major strengthening of the framework’s Born-related standing.

17.8 Which Loopholes Remain Open

A serious audit must conclude with what remains unresolved.

Three loopholes remain especially important.

First, the controlled-domain restrictions are real. A universal non-circularity theorem has not yet been earned.

Second, repeated-trial assumptions remain a delicate site and are not yet reduced to necessity.

Third, some rival weighting families may survive outside the presently defined class Ω or under broader context classes than the present chapter controls.

These loopholes do not undo the audit. They define its exact reach.

17.9 Final Standing of the Audit

The audit supports the following judgment.

The framework is now materially less vulnerable to the charge that its Born-related standing is simply imported through arbitrary admissibility or arbitrary functional design. This is a meaningful gain. It does not yet amount to universal exact derivation. It does amount to a serious reduction in one of the program’s deepest vulnerabilities.

Formal gain

This chapter has established that the narrowing results of Parts II and III materially reduce specified circularity risks and that a nontrivial class of rival weighting families fails under shared structural constraints. The framework’s Born-related standing is therefore stronger than it was at the end of Volume I.

Residual vulnerability

The reduction remains conditional and controlled-domain dependent. Repeated-trial assumptions remain delicate, and universal exclusion of all rivals has not been achieved.

Why this matters for Volume II

This chapter answers the central question left open at the end of Chapter 15. It shows that the earlier narrowing results do not merely beautify the framework. They buy a real reduction in circularity exposure.

Next necessity

The next stage of the program must gather the results of Parts I–V into a final formal verdict and then determine whether the framework now stands merely as a narrowed architecture, as a serious law candidate, or as a program whose next unavoidable burden is empirical discrimination.

PART VI — WORKED BENCHES, INTERNAL CRITIQUE, AND FINAL VERDICT

Chapter 18

Running Theorem Bench and Final Formal Standing

18.1 Orientation

A restriction program that never returns to a worked domain risks becoming formally impressive while remaining operationally untested even at the level of internal architecture. The present chapter therefore performs three functions at once.

First, it gathers the central machinery of the volume into a running theorem bench so that the reader can see, in one place, what the framework now does when forced through a controlled domain.

Second, it formulates the strongest internal objections that remain after the theorem programs of Parts II–V. These objections are not appended as ritual concessions. They are part of the credibility structure of the book. A framework that cannot survive its strongest internal objections has not become stronger merely by becoming more elaborate.

Third, it issues the final formal verdict of Volume II. This verdict does not merely summarize. It classifies the standing of the framework after admissibility narrowing, canonical narrowing, uniqueness strengthening, and the Born-related audit. It states what has been materially improved, what remains conditional, and what burden must now govern the next volume.

The chapter is therefore not ornamental closure. It is the point at which the entire volume is forced to classify itself.

Function One

The Running Theorem Bench

18.2 Two-Outcome Finite-Dimensional Benchmark

The cleanest bench for integrated display remains the finite-dimensional two-outcome context. This is not because the framework aspires only to such domains, but because in them the interaction between admissibility, canonicality, uniqueness, and Born-related scrutiny is sharpest and least obscured by uncontrolled complexity.

Let C₂ be a controlled finite-dimensional measurement context with:

• Hilbert space 𝓗²,

• a two-class record partition Π² = {Π₁, Π₂},

• admissible record structure sufficient for stable public outcome retrieval,

• and a context family in which physically irrelevant redescriptions are explicitly characterizable.

The admissible class 𝒜(C₂) is defined by the predicate intersection established in Part II:

𝒜(C₂) = { Φ ∈ CPTP(𝓗²) : StableRecord(Φ, C₂) ∧ AccessibleRecord(Φ, C₂) ∧ CompositionCompatible(Φ, C₂) ∧ RedescriptionInvariant(Φ, C₂) }.

In this domain, Theorem A yields necessary admissibility conditions. Chapter 6 then excludes the most immediate illegitimate channel families. Theorem B gives the first complete controlled characterization result: every admissible channel in the two-outcome finite-dimensional bench belongs to a sharply restricted family determined by record stability, public decodability, compositional coherence, and redescription invariance.

This already marks a significant contraction of the candidate field. The bench shows that admissibility is no longer merely an articulate ideal. It becomes a functioning filter whose exclusions are theorem-supported.

The bench then carries that contraction into Part III. The realization functional ℛ^C₂ is no longer an arbitrary score map on 𝒜(C₂). By Theorem C, it must satisfy a family of structural constraints: invariance, admissible coarse-graining discipline, composition coherence, variational regularity, compatibility with public record structure, and anti-loading discipline. Theorem D then narrows the surviving orderings to a restricted canonical family up to admissible structure-preserving equivalence.

In the two-outcome bench, this matters for a very concrete reason. Because the record partition is minimal and the coarse public structure is tightly controlled, many of the usual hiding places for arbitrariness are already weakened. A basis-sensitive functional becomes immediately visible. A hidden record-access failure becomes easier to detect. Composition pathologies are easier to isolate. As a result, the bench provides the cleanest demonstration that narrowing does not rely on rhetorical vagueness.

The bench then reaches Part IV. Existence under the strengthened hypotheses becomes easier to establish. Strict versus non-strict minimization becomes transparent. Benign versus fatal degeneracy can be distinguished with less ambiguity. Theorem E1 gives local uniqueness. Theorem E2 yields generic uniqueness outside structurally characterized exceptional sets. Theorem E3 yields perturbative robustness, again except at explicitly marked exceptional points.

Finally, the bench enters the audit regime of Part V. The two-outcome setting does not itself deliver universal exact derivation of Born structure, but it does provide the cleanest controlled setting in which one can test whether earlier narrowing actually reduces circularity exposure. Because admissibility has narrowed and the realization functional has contracted, the charge that Born-compatible structure is merely flowing from unchecked domain freedom becomes materially weaker in this bench than it was at the end of Volume I.

The two-outcome bench therefore plays a special role. It is not the whole theory. It is the first domain in which the whole theory can be seen acting on itself with maximal clarity.

18.3 Multi-Outcome Extension

A framework restricted to the simplest bench remains vulnerable to the charge that its apparent strength is an artifact of minimality. The next question is therefore whether the machinery extends beyond the two-outcome domain without immediate collapse.

Let Cₙ be a controlled multi-outcome context with finite record partition Πⁿ = {Π₁, …, Πₙ}, n > 2, together with sufficient record-separation assumptions to preserve contextual public accessibility and admissible coarse-graining coherence.

The extension to Cₙ is structurally significant for three reasons.

First, admissibility becomes more demanding. StableRecord must now preserve concentration into one of more than two record classes without uncontrolled overlap. AccessibleRecord must support unique public decodability in a broader outcome space. CompositionCompatible must manage more complex continuation behavior. RedescriptionInvariant must operate across richer relabeling and equivalent partition structure.

Second, canonical narrowing becomes harder. A realization functional that survives the two-outcome bench may become basis-loaded, coarse-graining unstable, or composition-defective once the outcome structure is richer. The multi-outcome extension is therefore a sharper stress test for Theorem C and Theorem D.

Third, uniqueness becomes more delicate. Multi-outcome settings introduce more possible degeneracy patterns, more symmetry classes, and more ways in which admissible equivalence can mask genuine multiplicity. The distinction between benign and fatal degeneracy becomes more consequential here than in the minimal bench.

What the extension shows is not full closure. It shows transportability of the theorem architecture. The admissibility predicates continue to do work. The structural constraints on the realization functional continue to exclude rival classes. Local and generic uniqueness remain meaningful, though not always as strong as in the two-outcome domain. The Born audit remains conditional, but the sites of possible loading remain mappable and partially reducible.

This is precisely the kind of extension a serious restriction program should seek: not immediate universality, but controlled enlargement under preserved theorem discipline.

18.4 Sequential and Composed Context Check

A realization framework that behaves only in isolated one-shot contexts remains formally interesting but not yet lawlike. Lawlike standing requires at least some resilience under sequential extension and admissible composition.

Let C₁ and C₂ be admissibly composable contexts, with induced sequential context C₂ ∘ C₁. The composition check asks three questions.

First, does admissibility survive composition? That is, if Φ₁ ∈ 𝒜(C₁) and Φ₂ ∈ 𝒜(C₂|C₁), does their admissible continuation preserve record stability, public accessibility, and contextual coherence when viewed as a composed structure?

Second, does the realization functional behave lawfully under composition? This does not require one fixed universal composition law in all domains, but it does require that the functional remain within the constrained composition class identified in Part III rather than becoming segmentation-sensitive or structurally unstable.

Third, how does uniqueness behave under sequential extension? Does local uniqueness persist? Do exceptional sets proliferate? Does degeneracy merely relocate from single contexts to sequences, or does it remain controlled?

The running theorem bench shows that the answer is again conditional but favorable. In controlled sequential settings:

• admissibility survives composition more often than not under the predicates already established,

• the realization functional remains composition-coherent within the law class admitted by Theorem C,

• and uniqueness, though not universally preserved, remains robust outside structurally identifiable exceptional regimes.

This matters because it weakens a serious objection. A framework that works only in frozen contexts has not yet earned the title of law candidate. A framework that survives admissible sequential extension in controlled domains begins to approach that status.

18.5 What the Benchmark Really Shows

The benchmark does not prove universality. It proves something more modest and, at this stage, more important: that the volume’s theorem architecture is not empty.

It shows that:

• admissibility narrowing is operational within controlled domains,

• canonical narrowing is not merely abstract but actually contracts the acceptable functional space,

• uniqueness becomes stronger and more stable after the first two contractions,

• and the Born-related audit gains real force once those contractions are in place.

The benchmark therefore establishes that the framework can survive a nontrivial worked display in which the parts of the volume are not merely sequentially stated but actually integrated.

This is a substantial gain because many formal architectures fail precisely at this integrative point. They can define. They can motivate. They can even prove isolated lemmas. But once they are forced into a coherent running domain, their structures begin to slip against one another. The present benchmark indicates that this has not occurred at the level tested here.

18.6 Where the Benchmark Stops

The benchmark is strong. It is not unlimited.

It does not establish a universal admissibility theorem across all measurement contexts.

It does not reduce the restricted canonical family to a single universally canonical functional in every domain.

It does not eliminate all exceptional sets in uniqueness theorems.

It does not deliver an unconditional derivation of the Born rule.

It does not yet provide decisive empirical discrimination.

These limitations matter. The benchmark is not a substitute for the final verdict. It is evidence for that verdict.

Function Two

Strongest Internal Objections

18.7 Objection: Admissibility Is Still Chosen, Not Discovered

The strongest admissibility objection remaining after Part II is this: the predicate architecture may be more rigorous than before, but it may still be a disciplined choice rather than a discovered necessity. Stability, accessibility, composition compatibility, and redescription invariance may indeed be serious predicates, but why exactly these and not a neighboring family? Why should their conjunction count as the right admissibility architecture rather than an elegant selective filter built to support the rest of the framework?

This objection has genuine force. The present volume has reduced arbitrariness. It has not fully eliminated the possibility that admissibility remains, at least in part, architecturally chosen. The best answer available is that the predicates are not arbitrary ornaments: each responds to an independently necessary pressure point for realized public outcome structure. Moreover, they now support necessary conditions, exclusion lemmas, and restricted characterization theorems, which is a major improvement over unstructured curation.

But the objection is not fully dead. A truly universal admissibility theorem would answer it more strongly than the present volume can.

18.8 Objection: The Canonical-Family Result Is Too Weak to Count as Canonical

The second serious objection targets Part III. A restricted canonical family is a strong result, but is it strong enough? If several families survive up to admissible equivalence, has the volume really constrained the ordering principle enough to call it canonical? Or has it merely replaced one favored functional with a small elite club of favored functionals?

This objection also has force. The present volume has not proved single-functional uniqueness in all domains. It has shown that the acceptable space is sharply restricted and that the surviving family is narrow. That is a major contraction of freedom, and much stronger than simple presentation of one favored representative. But it is not yet absolute canonicality in the strongest sense.

The framework survives the objection in a strengthened but still conditional form. The objection remains a pressure point for future work.

18.9 Objection: Born Structure Is Still Indirectly Imported

The third objection is perhaps the most important. Even after the audit of Part V, one may argue that Born-like structure is still entering indirectly through the admissibility architecture, the restricted canonical family, repeated-trial assumptions, or background symmetry constraints.

The answer given in Part V was intentionally limited. The volume claimed reduction of circularity exposure, not universal elimination. It showed that earlier narrowing materially weakens several direct pathways of importation and excludes a nontrivial class of rival weighting families under shared structural conditions. But it did not prove that all remaining Born-related vulnerability has vanished.

This objection therefore survives in weakened form. The correct judgment is not that the objection is defeated, but that the framework now carries it under materially better conditions than before.

18.10 Objection: Uniqueness Remains Too Conditional

The uniqueness theorems of Part IV are strong, but they remain controlled and conditional. Local uniqueness, generic uniqueness outside exceptional sets, and robust uniqueness under perturbation are all substantial gains. Yet a critic may reasonably say: if a law candidate cannot yet produce universal uniqueness, is it really a law candidate, or only an improving framework?

This objection should not be minimized. The volume’s answer is not that uniqueness is fully secured. The answer is that the standing of uniqueness has improved enough to matter. Exceptional sets are no longer hidden defects. They are structurally classified. Degeneracy is no longer ignored. It is taxonomized. Uniqueness is no longer trapped entirely within the narrowest assumptions. It has become local, generic, and robust in controlled domains.

That may not be full lawhood. It is more than mere possibility.

18.11 Objection: The Framework Still Redescribes Collapse

The most global objection is the one that shadowed the book from the beginning: perhaps the entire framework, even after restriction, still redescribes collapse-like behavior in more sophisticated formal language rather than uncovering a genuinely new lawlike structure.

This objection has less force now than it had at the end of Volume I. The reason is structural. A mere redescription would not need:

• a narrowed admissible class supported by necessary conditions and exclusions,

• a constrained canonical family of acceptable realization functionals,

• uniqueness strengthening under weaker assumptions,

• or a built-in audit of circularity risk.

These are real constraints, not stylistic flourishes. They mark genuine contraction of freedom.

Still, the objection is not annihilated. It can be fully weakened only if the framework eventually acquires both stronger Born standing and operational distinctness. The present volume therefore reduces the objection but does not yet erase it.

Function Three

Final Verdict

18.12 What Volume II Has Materially Strengthened

The central achievements of Volume II can now be stated with precision.

First, admissibility has been transformed from a motivated schema into a predicate architecture capable of theorem use. The framework now possesses:

• named core predicates,

• necessary admissibility conditions,

• a bank of exclusion lemmas,

• and a restricted characterization theorem in controlled domains.

Second, the realization functional has been materially narrowed. It is no longer an arbitrary score map over admissible channels. The volume has:

• defined the structural role of an acceptable realization ordering,

• derived a six-part family of constraints,

• established a restricted canonical-family theorem,

• and eliminated several nearby rival functionals by adversarial argument.

Third, uniqueness has been strengthened. The volume has moved beyond simple existence and narrow-case uniqueness to:

• local uniqueness,

• generic uniqueness outside exceptional sets,

• and robust uniqueness under perturbation.

Fourth, the framework now has an explicit taxonomy of degeneracy, distinguishing benign from fatal forms. This matters because it prevents false strength at the point where a realization law is most easily overstated.

Fifth, the Born-related standing of the framework has been improved. Not through unearned declaration, but through a structured audit showing that earlier narrowing materially reduces several important forms of circularity exposure and excludes a nontrivial rival family class under shared constraints.

These are not cosmetic gains. They change the standing of the program.

18.13 What Remains Conditional

The volume has also preserved its own discipline by marking what remains conditional.

The admissibility characterization is not yet universal across all contexts.

The canonical-family theorem does not yet establish absolute uniqueness of the realization functional in all domains.

The uniqueness theorems remain subject to exceptional sets and domain restrictions.

The Born audit establishes reduction of circularity risk, not final unconditional derivation.

No decisive empirical discrimination theorem is given here.

These limits matter because they preserve the distinction between serious strengthening and false closure.

18.14 Three Possible Final Standings

The final question is classificatory. After the results of Parts I–V, where exactly does the framework stand?

There are three possible outcomes the volume itself identified in advance.

First possibility: Still too underdetermined

This verdict would be appropriate if admissibility remained too broad, the canonical-family result too weak, uniqueness too fragile, and the Born audit too inconclusive. On that verdict, the volume would amount to a more rigorous map of insufficiency rather than a successful strengthening.

That is not the best reading of the present state of the work. Too much structural freedom has in fact been reduced for this verdict to be the most accurate one.

Second possibility: Now a serious law candidate but not yet empirically distinct

This verdict would be appropriate if the volume materially reduced underdetermination, narrowed both domain and ordering, strengthened uniqueness enough to support serious lawlike aspiration, and reduced circularity risk enough that the framework now stands in a categorically stronger formal position, while still lacking operational distinctness.

This, in the judgment of the present chapter, is the most accurate final classification of Volume II.

Third possibility: Narrowed enough that empirical discrimination has become mandatory

This verdict is not incompatible with the second. In fact, the second may now imply the third. If the framework has indeed become a serious law candidate, then it can no longer remain indefinitely at the level of formal architecture and internal theorem strengthening. It must eventually face operational burden.

Thus the strongest final classification is dual:

The framework has become a serious law candidate in formal standing, and precisely because of that improvement, empirical discrimination has now become the unavoidable next step.

18.15 Why Volume III Must Now Be Empirical or Operational, Not Another Architecture Volume

The structural logic of the research program now changes.

Volume I was rightly architectural. Volume II was rightly restrictive. A further volume that remained only architectural would begin to weaken the credibility gained here. Once a framework has narrowed its admissible class, narrowed its realization ordering, strengthened uniqueness, and reduced circularity exposure, its next burden is no longer to redescribe itself. It is to expose itself.

That means Volume III must be empirical or at least operational in structure. It must specify:

• observable consequences,

• protocol classes,

• deviation forms,

• parameter regimes,

• and null-result interpretation.

This does not require immediate laboratory execution within the book itself. It requires that the framework now state what would count, in principle, for or against it in operational terms. A law candidate that remains forever a formal candidate ceases to strengthen by additional self-description.

The success of Volume II therefore changes the nature of the next demand. The appropriate sequel is not another architecture volume. It is a volume of exposure to possible empirical defeat or support.

18.16 Final Formal Standing

The final formal standing of the framework after Volume II can therefore be stated as follows.

The Constraint-Based Realization program no longer stands merely as a legible formal architecture. It now stands as a materially narrowed and structurally strengthened candidate law framework for realized outcome selection. Its admissible domain is more constrained, its acceptable realization orderings are more sharply limited, its uniqueness standing is stronger, and its Born-related claims are less vulnerable to several direct forms of circularity than they were at the end of Volume I.

At the same time, the framework has not yet earned full final closure. Its strongest theorems remain controlled. Its universal form remains incomplete. Its probabilistic standing remains partially conditional. Its empirical burden remains outstanding.

Accordingly, the framework should now be classified as:

a serious law candidate in formal standing, not yet an empirically distinct completed theory.

That classification is stronger than the status the framework possessed at the end of Volume I. It is also strict enough to preserve the work still required.

Formal gain

This chapter has integrated the theorem machinery of the volume into a worked benchmark, formulated the strongest remaining internal objections, and issued a final classification of the framework’s standing. It has shown that Volume II materially strengthens the program and changes the burden of what must come next.

Residual vulnerability

The framework still lacks universal closure, full probabilistic derivation, and operationally decisive distinctness. These are not defects concealed by the final verdict. They are the exact next burdens the verdict makes unavoidable.

Why this matters for Volume II

Without this chapter, the volume would risk ending in accumulation rather than classification. The present chapter forces the book to say exactly what it has achieved and exactly what it has not.

Next necessity

The next stage of the program must no longer ask primarily how the framework can be further architecturally refined. It must ask how the framework exposes itself to operational judgment.

APPENDICES

Appendix A

Predicate Catalogue

This appendix provides the technical reference list for all admissibility predicates and optional strengthening predicates used throughout the volume.

Its purpose is not merely convenience. In a work of this kind, definitional drift is a major source of hidden weakness. The predicate catalogue prevents such drift by collecting in one place the exact formal content of:

• StableRecord(Φ, C),

• AccessibleRecord(Φ, C),

• CompositionCompatible(Φ, C),

• RedescriptionInvariant(Φ, C),

• and any optional strengthening predicates introduced in restricted chapters or theorem variants.

Each predicate entry should include:

• formal statement,

• contextual interpretation,

• failure condition,

• and chapter dependency reference.

The appendix functions as the definitional backbone of Part II.

Appendix B

Proof Dependency Map

This appendix states exactly which results depend on which definitions, lemmas, propositions, and assumptions.

Its function is methodological honesty. A framework becomes more credible when the reader can see, without ambiguity, how the theorem structure is built.

The dependency map should show:

• which predicates support Theorem A,

• which exclusions support Theorem B,

• which structural constraints support Theorem C,

• which narrowing and regularity assumptions support Theorem D,

• which existence and stability results support Theorems E1–E3,

• and which earlier results support Theorems F and G.

The appendix should be written in explicit hierarchical prose or formally nested structure rather than graphic schema if typesetting simplicity is preferred.

Appendix C

Counterexample Bank

This appendix gathers all excluded channel types in one place.

Its function is to make the adversarial structure of Part II fully inspectable. A law candidate is more credible when its excluded near-neighbors are visible rather than buried in the flow of the text.

The counterexample bank should include:

• record-unstable channels,

• inaccessible-record channels,

• composition-defective channels,

• redescription-sensitive channels,

• frequency-loaded channel classes,

• and any other context-specific excluded candidates introduced in proofs.

Each entry should state:

• the construction idea,

• the violated predicate or predicates,

• the reason the violation matters,

• and whether the construction is ruled out universally, conditionally, or only in controlled domains.

Appendix D

Rival Functional Catalogue

This appendix is the fuller technical companion to Chapter 12.

Its purpose is to show, in one consolidated place, the rival realization functionals that fail the shared structural constraints of Part III. Unlike the main chapter, which is rhetorically forceful and selective, the appendix can be more exhaustive and technically explicit.

The catalogue should include:

• collapse-mimicking functionals,

• basis-sensitive functionals,

• composition-defective functionals,

• hidden-Born-loaded functionals,

• degeneracy-prone functionals,

• and any hybrid functionals that initially appear to survive but fail under closer structural inspection.

Each entry should state:

• formal form or schematic structure,

• which constraint family member it violates,

• why the violation is fatal or at least disqualifying,

• and whether the failure is generic or domain-restricted.

Appendix E

Degeneracy Taxonomy

This appendix classifies the different forms of minimizer degeneracy studied in Part IV.

Its role is essential because degeneracy is one of the most common places where a framework can appear stronger than it is. A fine-grained taxonomy prevents all non-uniqueness from being lumped together.

The taxonomy should distinguish at least:

• admissible-equivalence degeneracy,

• symmetry-induced degeneracy,

• accidental degeneracy,

• perturbatively unstable degeneracy,

• robust fatal degeneracy,

• and flat-landscape degeneracy associated with weak canonicality.

Each class should be accompanied by:

• formal criterion,

• diagnostic significance,

• law-candidate consequence,

• and whether it is treated as benign, tolerable, or fatal.

Appendix F

Non-Circularity Checklist

This appendix provides a line-by-line audit list of every plausible site at which Born structure might be covertly imported.

Its purpose is not rhetorical repetition. It is audit discipline.

The checklist should include:

• admissibility-level loading,

• functional-level loading,

• repeated-trial loading,

• calibration or retrieval loading,

• symmetry-based loading,

• coarse-graining-based loading,

• and any context restriction that effectively pre-imposes a favored weighting family.

For each item, the appendix should record:

• what the possible loading mechanism is,

• whether Part V reduces it, eliminates it, or leaves it unresolved,

• and what theorem, proposition, or caveat governs that judgment.

This appendix becomes the clearest compressed statement of the framework’s Born-related epistemic hygiene.

Appendix G

Bridge to Volume III

This appendix states, as precisely as possible, what the next volume must operationalize.

It is not yet the full empirical program. It is the formal bridge to that program.

The appendix should specify that Volume III must address:

• observables sensitive to the framework’s distinguishing structure,

• protocol families in which those observables can be meaningfully assessed,

• predicted deviation forms relative to standard expectations,

• relevant parameter regimes,

• and interpretation of null results.

It should also explain why Volume III must not become another architecture volume. Once a framework has been narrowed to the extent achieved here, its next burden is exposure to possible empirical defeat or support.

Theorem Spine of the Whole Book

The structure of Volume II can be stated in its shortest rigorous form as follows.

Theorem Program I — Admissibility Narrowing

This program established the predicate architecture of admissibility, derived necessary admissibility conditions, proved exclusion lemmas against nearby illegitimate channel classes, and delivered a restricted characterization theorem together with an explicit test of whether admissibility had crossed the law-candidate threshold.

Theorem Program II — Canonical Narrowing

This program defined the structural role of an acceptable realization functional, derived a family of structural constraints on any such ordering, established a restricted canonical-family theorem, and reinforced that result through adversarial elimination of rival functionals.

Theorem Program III — Uniqueness Strengthening

This program revisited existence under strengthened hypotheses, classified minimizer structure and degeneracy, proved local uniqueness, generic uniqueness outside exceptional sets, and robust uniqueness under perturbation, while refusing unearned rescue principles where uniqueness still failed.

Theorem Program IV — Born Audit

This program formalized the taxonomy of Born-related claims, mapped the principal circularity sites, and established a controlled-domain reduction in circularity exposure together with exclusion of a nontrivial class of rival weighting families under shared structural constraints.

Theorem Program V — Final Status Verdict

This program integrated the whole volume into a worked benchmark, subjected the framework to its strongest internal objections, and issued a final classification of the framework as a serious law candidate in formal standing, though not yet a fully empirically distinct completed theory.

Final Closing Statement

The significance of Volume II does not lie in claiming final closure where final closure has not yet been earned. Its significance lies in something more exacting: it has taken a framework that, at the end of Volume I, stood as a disciplined formal architecture and forced it through a genuine narrowing program.

What survives that narrowing is no longer merely a suggestive schema. It is a materially stronger candidate law architecture whose remaining burdens are now more visible precisely because its earlier freedoms have been reduced.

That is the proper outcome of a restriction volume. It either reveals that the framework was too permissive to survive, or it leaves the framework standing under a higher standard.

The present volume has aimed at the second result. Whether that standing endures beyond formal strength will depend on what comes next.