Constraint-Based Realization Volume I: Minimal Axioms, Formal Core, and the Law of Outcome Selection

Apr 10

Robert Duran IV's Constraint-Based Realization

Copyright Page

Constraint-Based Realization, Volume I: Minimal Axioms, Formal Core, and the Law of Outcome Selection

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

This volume is a work of theoretical research and formal argument. It advances a proposed framework in quantum foundations and should be read accordingly. Statements labeled as axioms, assumptions, propositions, theorems, conjectures, interpretive claims, or empirical hypotheses carry different evidential and logical status, which is specified within the text. No claim should be read more strongly than the status assigned to it.

The author has attempted to distinguish, throughout, between formal results, conditional arguments, heuristic remarks, and open problems. Readers are encouraged to evaluate the framework on the basis of explicit assumptions, stated definitions, proof status, and empirical consequences rather than on rhetoric, pedigree, or interpretive preference.

First edition.

Printed in the United States of America.

For permissions, inquiries, or scholarly correspondence, contact:
505-520-7554

Dedication

For the discipline of asking, with precision, what has been shown and what has not.

Epigraph

“Exactness is not severity for its own sake. It is the minimum respect owed to a difficult question.”

Abstract

Standard quantum theory supplies dynamical evolution and statistical structure of exceptional empirical success, yet it does not by itself provide a universally accepted single-outcome law for individual measurement events. This volume addresses that specific problem and only that problem. It does not propose a wholesale revision of ordinary quantum dynamics, nor does it attempt to settle all interpretive disputes in quantum foundations. Its narrower task is to formulate, with maximum explicitness, a completion proposal in which one physically realized outcome is selected from among admissible record-forming possibilities in a single trial.

The framework introduced here is Constraint-Based Realization, or CBR. The formal shift is from state-centered collapse language to a channel-theoretic representation of outcome-bearing physical processes. The primitive object is not merely a post-measurement state assignment, but an admissible quantum channel associated with a measurement context including system, apparatus, environment, and physically accessible record structure. For a given context C, the theory posits a nonempty admissible class 𝒜(C) of realization candidates and introduces a realization ordering represented by a functional ℛ꜀ defined on that class. The core selection rule is that the physically realized channel Φ∗ is identified, under stated assumptions, with a minimizer of ℛ꜀ over 𝒜(C).

This volume has six principal aims. First, it isolates the target problem by distinguishing state evolution, decoherence or registration, and single-trial realization. Second, it states a minimal axiomatic framework for a single-outcome completion proposal. Third, it defines an admissibility schema intended to constrain the candidate set of realization channels by record stability, accessibility, compositional consistency, and invariance under physically irrelevant redescription. Fourth, it introduces the realization functional in both abstract form and provisional concrete form, while explicitly distinguishing postulated structure from derived structure. Fifth, it establishes existence, consistency, and invariance results under clearly stated assumptions. Sixth, it clarifies the exact status of Born-related claims and separates mere compatibility from stronger claims of derivation or uniqueness.

The main formal claims of this volume are deliberately limited. Under explicit assumptions on admissible classes and on the regularity of ℛ꜀, the framework yields existence of admissible realization candidates in standard measurement models, existence of minimizers in the relevant variational setting, and consistency of realized public records under specified compositional conditions. Additional results concern invariance under coarse-graining and under physically irrelevant relabelings, again only within explicitly stated domains. Conditional uniqueness results are stated where strict assumptions warrant them, but no universal uniqueness theorem is claimed in this volume beyond those restricted settings.

The status of the Born claim is treated conservatively. This volume does not assert an unconditional derivation of the Born rule from wholly independent premises. Instead, it distinguishes several different senses of “Born recovery,” including compatibility, asymptotic adequacy, fixed-point behavior, and exact derivation, and identifies which of these are addressed here. The present volume claims only conditional Born compatibility under repeated admissible trials and under the structural assumptions stated in the relevant chapters. Whether those assumptions can be weakened, whether the realization functional can be shown to be essentially canonical, and whether non-Born alternatives can be excluded without hidden importation remain open questions rather than completed results.

The work therefore positions itself not as a final settlement, but as a disciplined formal proposal. It aims to make the theory legible to critical inspection by separating axioms, assumptions, definitions, propositions, theorems, conjectures, interpretive remarks, and empirical hypotheses. In particular, it incorporates explicit non-circularity audits at the points where admissibility, uniqueness, and Born compatibility are most vulnerable to overstatement.

Later volumes are intended to pursue three extensions not completed here. The first is theorem strengthening: fuller proofs, weakened assumptions, and more exact analysis of the admissibility class and uniqueness structure. The second is comparative and critical: detailed engagement with rival approaches in quantum foundations, together with line-by-line analysis of possible circularity, redundancy, and underdetermination. The third is empirical: the development of operationally explicit discrimination criteria capable, in principle, of distinguishing a realization law of the present kind from interpretation-only readings of standard quantum theory. Those tasks are necessary for any stronger claim than the ones made here, and their incompleteness is acknowledged throughout.

In summary, this volume offers a channel-theoretic formalization of a single-outcome completion proposal, states its minimal axioms, defines its central objects, and establishes a first tier of existence and consistency results under explicit assumptions. Its principal contribution is clarity of formal architecture, not the assertion of more than the present mathematics supports.

Preface

This book is a reformulation, not merely a continuation.

Earlier versions of the underlying project pursued the same broad problem: whether the realization of a single measurement outcome should be treated as requiring an additional law-like principle beyond standard dynamical evolution and ordinary statistical prediction. With time, however, it became clear that the earlier presentation carried too much cumulative framing, too much variation in emphasis across volumes, and too little separation between motivation, formalization, and proof status. A new Volume I became necessary.

The purpose of this volume is therefore limited and deliberate. It is written to state the framework in its leanest defensible form. It aims for minimal formal clarity, not maximal conceptual reach. Wherever possible, the structure has been recast so that a technically critical reader can identify, without ambiguity, what is being defined, what is assumed, what is argued, what is proved only under conditions, and what remains open.

This reorganization reflects a simple principle: in a proposal of this kind, the burden of proof is unusually high. A theory that adds new structure to the foundations of quantum mechanics does not earn credibility by scale, novelty of language, or interpretive ambition. It earns credibility, if at all, by precision of formulation, transparency of dependence, and vulnerability to criticism. For that reason, this volume repeatedly prefers weaker claims that can be defended to stronger claims that outrun the formal support available.

Several things have been intentionally left out.

First, this volume does not attempt to provide a universal metaphysics of quantum reality. Interpretive implications are discussed only where they bear directly on the formal architecture. Second, it does not attempt to establish the strongest possible Born-rule claim. The exact status of Born compatibility is treated cautiously and subdivided into several non-equivalent senses, only one of which is addressed here in a conditional way. Third, it does not claim decisive empirical discrimination in its present form. The empirical program is deferred because it requires a degree of operational precision that should not be compressed into a first statement of the formal framework. Fourth, it does not treat every rival interpretation or completion theory at full length. Comparative analysis is included only to the extent needed to place the proposal within the existing landscape.

What this volume does attempt is more modest and, in a certain sense, more difficult. It seeks to make the framework inspectable. It introduces the primitive objects, defines the admissibility schema, states the realization rule, records the main theorem targets, marks the status of each major claim, and names the principal failure conditions. A reader should be able to reject the theory, but not on the grounds that its core commitments were hidden.

This book should therefore be read as a formal opening statement. If later volumes succeed, they will do so by strengthening what is stated here: tightening the admissibility conditions, narrowing the range of permissible realization functionals, clarifying the exact standing of Born compatibility, extending the proofs, and operationalizing the empirical stakes. If they fail, the reasons for failure should be visible from the structure given in this volume.

That is the standard the present work sets for itself.

How to Read This Book

Purpose of this Guide

This guide is intended to help different classes of readers enter the book efficiently and without unnecessary frustration. The volume is written so that its formal commitments can be inspected early, but not every reader will need the same path. A physicist may want the theorem spine first. A mathematician may want the precise admissibility and variational setup. A philosopher of physics may want the distinction between evolution, registration, and realization before the formal machinery. An advanced general reader may need a staged route that postpones the more technical chapters.

The volume has therefore been organized with multiple reading paths in mind.

General Reading Logic

The book has four core layers, and they should not be conflated.

Problem layer
What problem is being addressed, and why is it not identical to decoherence or ordinary predictive quantum mechanics?
Formal layer
What are the primitive objects, the admissible realization class, and the realization rule?
Result layer
What is actually established under explicit assumptions?
Interpretive and critical layer
How does the proposal compare with other frameworks, where is it vulnerable, and what remains open?

Readers who keep these layers distinct will find the argument clearer and the scope easier to judge.

Foundational Chapters

The following chapters are foundational and should not be skipped by readers who want to evaluate the theory directly:

Formal Synopsis
Chapter 1
Chapter 4
Chapter 6
Chapter 7
Chapter 8
Chapter 24

These chapters contain the minimum structure needed to understand the proposal.

Chapters Optional on First Reading

The following may be postponed on first pass, depending on the reader’s goals:

Chapter 3, if the mathematical preliminaries are already familiar
Chapter 10, on first exposure, if the abstract realization functional is sufficient
Chapters 18–21, if the reader prefers theorem structure before examples
Chapter 23, if comparison with other frameworks is secondary initially
Appendices, except the notation appendix if symbols become cumbersome

Notation Conventions

This book uses Unicode mathematical notation throughout. Several conventions remain fixed unless explicitly stated otherwise.

𝓗 denotes a Hilbert space. Subscripts indicate subsystem roles, such as 𝓗ₛ for system, 𝓗ₐ for apparatus, and 𝓗ₑ for environment.
𝒟(𝓗) denotes the set of density operators on 𝓗.
𝓑(𝓗) denotes the bounded operators on 𝓗 in the finite-dimensional settings used for most formal statements in this volume.
Φ, Ψ, and related capital Greek letters denote channels or maps.
𝒜(C) denotes the admissible class of realization channels associated with measurement context C.
ℛ꜀ denotes the realization functional associated with context C.
Φ∗ denotes a minimizer of ℛ꜀ over 𝒜(C), where existence and uniqueness are only asserted under stated assumptions.
“Record” refers to a physically stable and intersubjectively accessible outcome-bearing structure, not merely to an abstract basis label.
“Admissible” does not mean arbitrary or merely mathematically possible. It refers to physically constrained candidate realization channels satisfying the conditions stated in the relevant chapters.

All symbols are reintroduced where first used in formal development, but readers are encouraged to consult the notation appendix when needed.

How Claim Status Is Marked

A major structural feature of the volume is explicit claim-status discipline. The following labels are used throughout:

Definition: introduces a term or object
Axiom: a foundational postulate of the framework
Assumption: a local standing condition for a result
Lemma: a supporting formal result
Proposition: a substantive but intermediate formal result
Theorem: a principal formal result
Corollary: a direct consequence of a previous result
Conjecture: a claim not established in this volume
Interpretive Claim: a conceptual reading not identical to a theorem
Empirical Hypothesis: a proposed physical discrimination claim
Heuristic Remark: an explanatory device not carrying proof force
Open Question: a problem intentionally left unresolved

These labels are not decorative. They are part of the argument’s integrity. Readers should treat them as binding.

How to Read the Born-Related Chapters

The chapters addressing the Born rule and associated statistical structure require particular care. The phrase “Born recovery” can mean several different things, and the volume insists on separating them. In this book:

compatibility is not the same as derivation
asymptotic adequacy is not the same as uniqueness
fixed-point attraction is not the same as proof from independent premises

Readers interested mainly in whether the book claims a derivation should read Chapter 15 before reading any stronger-sounding statement elsewhere. The exact status of those claims is intentionally narrowed there.

Final Reading Advice

This volume should not be read as though every chapter were making claims of equal strength. Some chapters set vocabulary. Some state postulates. Some prove conditional results. Some map unresolved vulnerabilities. The book has been designed so that disagreement with the framework need not depend on confusion about what is being claimed. The most productive reading strategy is therefore not to ask first whether one likes the theory, but whether the distinctions it makes are coherent, the assumptions explicit, the mathematical objects well-defined, and the conditional results honestly stated.

Formal Synopsis

Purpose of the Formal Synopsis

The purpose of this synopsis is to state, in compact form, the formal core of the volume before the narrative development begins. It is intended for readers who wish to inspect the entire proposal quickly and critically. Accordingly, this section limits itself to six elements:

primitive objects
admissibility schema
realization rule
main result list
claim-status table
failure conditions

Nothing in this synopsis should be read as stronger than the chapters that support it. Where a claim is only conditional, that status is preserved here.

Position Within the Book

This synopsis precedes Chapter 1 because the framework benefits from front-loaded inspectability. A reader should be able to assess the structure of the proposal without first navigating the full motivational arc of the book. Chapters 1–25 then expand, justify, qualify, or limit the claims stated here.

Local Problem Statement

The local problem addressed by the synopsis is the following:

Standard quantum mechanics provides state evolution and statistical prediction, but it does not supply a universally accepted single-outcome law for individual measurement events. If one seeks such a law, what are the minimal objects, rules, and result targets required to formulate it precisely?

The present framework answers that question by proposing a constrained selection principle over admissible record-forming channels.

Dependencies

This synopsis assumes only ordinary background familiarity with finite-dimensional quantum theory: Hilbert spaces, density operators, quantum channels, measurement instruments, and basic variational language. No prior acceptance of the full framework is assumed.

S.1 Primitive Objects

Purpose

This section identifies the smallest set of formal objects needed to state the proposal.

Definition S.1.1. Measurement Context

A measurement context, denoted C, is a structured specification containing at minimum:

a system Hilbert space 𝓗ₛ
an apparatus Hilbert space 𝓗ₐ
an environment Hilbert space 𝓗ₑ
an initial state assignment on the relevant composite system
a physically defined family of candidate record sectors
an operational accessibility structure specifying which records count as publicly available outcomes
any standing constraints needed to define admissibility in that context

In this volume, the central examples are finite-dimensional or effectively finite-dimensional.

Remark S.1.2

The context is not an observer-relative private description. It is a physical specification of the measurement situation sufficient to define candidate realization channels and public record structure.

Definition S.1.3. Record Sector

A record sector is a physically distinguishable, sufficiently stable, and operationally accessible outcome-bearing structure associated with the apparatus–environment degrees of freedom of a context. A record sector is not merely a basis label. It must satisfy the stability and accessibility conditions stated later in the book.

Definition S.1.4. Admissible Realization Channel

Let C be a measurement context. An admissible realization channel for C is a channel Φ belonging to a class 𝒜(C), where 𝒜(C) is constrained so that each Φ:

is a physically legal channel in the relevant setting
aligns with the candidate record sectors of C
yields a stable public record under the context’s accessibility criteria
respects the compositional constraints imposed by the framework
does not rely on physically irrelevant formal redescription for its identity

The exact definition of 𝒜(C) is deferred to the formal chapters, but its role is fixed from the outset.

Definition S.1.5. Realization Functional

For each context C, the framework associates a realization functional ℛ꜀ defined on 𝒜(C). The functional ℛ꜀ provides an ordering of admissible realization channels.

In abstract form:

ℛ꜀: 𝒜(C) → ℝ ∪ {+∞}

subject to structural requirements stated later, including lower boundedness and compatibility with the physical invariances the framework demands.

Remark S.1.6

The abstract formalism does not by itself fix a unique concrete realization functional. One of the central open tasks of the framework is to determine how narrowly the admissible class of functionals can be constrained by independent principles.

Definition S.1.7. Realized Channel

A realized channel in context C is an admissible channel Φ∗ satisfying the realization rule stated below. Existence and uniqueness are conditional questions, not definitional truths.

S.2 Admissibility Schema

Purpose

This section states the role of admissibility and the minimal structure it must satisfy.

Local Problem Statement

A selection law is empty if it ranges over an unconstrained or physically arbitrary class. The framework therefore requires a physically motivated admissibility schema.

Assumption S.2.1. Nonemptiness of Admissible Class

For every measurement context C in the domain of the theory, the admissible class 𝒜(C) is nonempty.

Assumption S.2.2. Record Alignment

Every Φ ∈ 𝒜(C) must map the context into a physically meaningful record structure compatible with the record sectors specified in C.

Assumption S.2.3. Public Accessibility

Every Φ ∈ 𝒜(C) must produce a record that is accessible in the sense relevant to intersubjective agreement within the context.

Assumption S.2.4. Compositional Consistency

If a context decomposes into admissibly related subsystems, admissibility assignments must not generate contradictory realization structure under composition, restriction, or coarse-graining.

Assumption S.2.5. Redescription Invariance

Admissibility must not depend on purely formal relabeling or basis rewriting that leaves the physically relevant record structure unchanged.

Remark S.2.6

These assumptions are schematic at the synopsis level. Chapters 5 and 6 sharpen them and identify the principal vulnerabilities they introduce, especially the risk that admissibility may remain underdetermined if not constrained tightly enough.

S.3 Realization Rule

Purpose

This section states the central postulate of the framework.

Axiom S.3.1. Variational Realization Rule

For each measurement context C, the physically realized channel Φ∗ is identified with a minimizer of the realization functional over the admissible class:

Φ∗ = arg min{ℛ꜀(Φ) : Φ ∈ 𝒜(C)}

provided that a minimizer exists.

Remark S.3.2

This statement does not yet imply uniqueness. If multiple minimizers exist, the framework must either refine the admissibility structure, strengthen the functional assumptions, or explicitly acknowledge a remaining degeneracy. The treatment of such cases is a substantive part of later chapters.

Interpretation S.3.3

The guiding idea is that ordinary quantum dynamics determines the structured space of candidate physical evolutions, while the realization law selects, from among admissible record-forming channels, the one that becomes physically actual in a single trial. This interpretation is not itself a theorem; it is the conceptual reading of Axiom S.3.1.

S.4 Structural Requirements on the Realization Functional

Purpose

This section records the minimal formal properties the realization functional is expected to satisfy.

Assumption S.4.1. Lower Boundedness

For each context C, ℛ꜀ is bounded below on 𝒜(C).

Assumption S.4.2. Lower Semicontinuity or Analogous Variational Regularity

The functional ℛ꜀ satisfies enough regularity on 𝒜(C) to support existence results via standard variational methods in the domain under consideration.

Assumption S.4.3. Invariance Under Physically Irrelevant Redescription

If two admissible channels differ only by a formal redescription that leaves the physically relevant record structure unchanged, then ℛ꜀ assigns them the same value or treats them as physically equivalent.

Assumption S.4.4. Compositional Compatibility

The behavior of ℛ꜀ under composition, restriction, or admissible coarse-graining must be compatible with the framework’s consistency requirements.

Assumption S.4.5. Sensitivity to Record Degradation

Where physically appropriate, ℛ꜀ must distinguish between channels with stable public record structure and channels whose putative records are unstable, inaccessible, or compositionally defective.

Remark S.4.6

At the synopsis level, these conditions do not determine a unique functional family. Their role is to state the burden the later chapters must meet.

S.5 Main Result Targets of Volume I

Purpose

This section lists, conservatively, the main result targets and their present status.

Theorem Target S.5.1. Existence of Admissible Candidates

In standard measurement models, the admissibility schema yields a nonempty class 𝒜(C).

Status: intended as a proposition or theorem under explicit model assumptions.

Theorem Target S.5.2. Existence of Minimizers

If 𝒜(C) and ℛ꜀ satisfy the stated regularity and compactness-type assumptions, then at least one minimizer Φ∗ exists.

Status: conditional theorem.

Theorem Target S.5.3. Public Record Consistency

Under the framework’s compositional and accessibility assumptions, realized channels produce non-contradictory public records within the context.

Status: conditional proposition or theorem, depending on the formal strength achieved in later chapters.

Theorem Target S.5.4. Invariance Results

Realization assignments remain stable under physically irrelevant relabelings and admissible coarse-graining.

Status: conditional proposition set.

Theorem Target S.5.5. Conditional Uniqueness

Under strengthened assumptions, such as strict convexity or equivalent nondegeneracy structure, the minimizer is unique up to physically irrelevant equivalence.

Status: restricted theorem target only. No general uniqueness claim is made in the synopsis.

Theorem Target S.5.6. Conditional Born Compatibility

Under repeated admissible trials and under the assumptions specified later, the framework recovers Born-compatible statistical structure in a conditional sense.

Status: limited and explicitly non-maximal. This is not stated here as an unconditional derivation.

Remark S.5.7

The role of these result targets is architectural. They indicate what the volume is attempting to establish, but not every target is achieved with equal strength.

S.6 Exact Status of the Born Claim

Purpose

This section prevents overstatement by distinguishing several non-equivalent senses of Born recovery.

Definition S.6.1. Born Compatibility

The framework is Born compatible if, under stated assumptions, its repeated-trial statistics agree with the Born rule in the relevant domain.

Definition S.6.2. Born Derivation

The framework derives the Born rule only if Born weights follow from premises not already structurally equivalent to assuming them.

Definition S.6.3. Born Uniqueness

The framework establishes Born uniqueness only if all admissible alternatives inconsistent with the Born rule are excluded by the theory’s independently justified principles.

Claim-Status Statement S.6.4

This volume claims conditional Born compatibility only.

It does not claim, at the synopsis level, any of the following:

an unconditional derivation of the Born rule from wholly independent premises
a proof that the chosen realization functional is uniquely canonical
a complete exclusion of all non-Born alternatives
a final or universally accepted solution to the measurement problem

Non-Circularity Warning S.6.5

Any proposal of this type risks importing Born-compatible weighting indirectly through its admissibility conditions, its divergence measure, its regularity assumptions, or its treatment of record structure. Later chapters therefore include explicit non-circularity audits. The reader should treat all Born-related claims as conditional until those audits are completed.

S.7 Claim-Status Table

Purpose

The framework makes several claims at different levels of strength. First, it treats the question of single-outcome realization as worth formalizing; this is a motivating claim grounded in the distinction between predictive structure and realized outcomes, though some interpretations deny that any further law is needed. Second, it proposes that channel-level treatment is preferable to state-collapse language for this purpose; this is both a formal and interpretive proposal based on record-centered process analysis, though critics may argue that channels are unnecessary. Third, it advances a partial formal program suggesting that admissible realization classes can be physically defined by appeal to record stability, accessibility, and composition, though the major vulnerability is underdetermination. Fourth, it posits that realization can be represented by minimization of a realization functional over the admissible class; this is an axiom of the framework and depends on accepting variational ordering, but it may be criticized as postulated rather than derived. Fifth, the framework conditionally claims that minimizers exist, depending on compactness-type and regularity assumptions, though such existence may fail in broader settings. Sixth, it offers only a restricted conditional result on uniqueness, depending on strong convexity-like and admissibility assumptions, and therefore remains vulnerable to the criticism that uniqueness may depend too much on the chosen functional family. Seventh, it advances a conditional and limited claim that Born-compatible statistics are recovered, but this depends on repeated-trial assumptions and remains vulnerable to the charge of hidden Born importation. Finally, it defers the claim that the framework is empirically distinct from interpretation-only quantum theory; that remains an empirical hypothesis awaiting later operational analysis and may ultimately prove too weak or too ambiguous.

Remark S.7.1

This table should be read as an honesty ledger, not as a rhetorical summary.

S.8 Failure Conditions

Purpose

This section states what would undermine the framework at a foundational level.

Failure Condition S.8.1. Admissibility Underdetermination

The framework fails in a strong sense if 𝒜(C) cannot be defined non-arbitrarily enough to distinguish physically meaningful candidate realization channels from merely convenient mathematical constructions.

Failure Condition S.8.2. Functional Non-Canonicity

The framework is significantly weakened if many inequivalent realization functionals satisfy the same axioms and structural constraints without any independent principle selecting among them.

Failure Condition S.8.3. Hidden Born Importation

The Born-related program fails if the later compatibility result merely restates assumptions that already encode Born weighting in disguised form.

Failure Condition S.8.4. Uniqueness Fragility

The single-outcome ambition is compromised if uniqueness can be obtained only by assumptions that are mathematically convenient but physically unmotivated.

Failure Condition S.8.5. Empirical Inertness

The framework is limited to interpretive reformulation if it yields no operational difference in principle and no explanatory gain sufficient to justify the added law-like structure.

Failure Condition S.8.6. Collapse Redescription Without Gain

If the framework merely redescribes collapse language at the channel level without adding clarity, control, or testable structure, then its central formal move has little value.

Remark S.8.7

These failure conditions are not peripheral. They are the main standards by which the framework should be judged.

S.9 Minimal Roadmap of the Volume

Purpose

This section tells the reader how the later chapters develop what the synopsis has only stated.

Outline

Chapters 1–2 isolate the problem and state the burden of proof.
Chapters 3–6 define the formal setting, record structure, and admissibility schema.
Chapters 7–10 state the axiomatic core and the realization functional in abstract and concrete forms.
Chapters 11–14 develop existence, consistency, invariance, and restricted uniqueness results.
Chapters 15–17 clarify Born compatibility and the limits of stronger Born claims.
Chapters 18–21 test the framework in canonical examples.
Chapters 22–23 surface the strongest objections and compare the framework with other major approaches.
Chapter 24 states, with final precision, what the volume has and has not established.
Chapter 25 indicates the work required in later volumes.

S.10 End-of-Synopsis Ledger

Established in this synopsis

the primitive formal objects of the framework
the role of admissibility
the variational realization rule
the limited and explicit status of the Born claim
the main result targets of Volume I
the principal failure conditions

Conditionally established

Nothing in the synopsis is itself fully established beyond definitional and axiomatic statement. Conditional results are only announced here; their support belongs to later chapters.

Not established in the synopsis

non-arbitrary uniqueness of admissible classes
canonical uniqueness of the realization functional
general uniqueness of minimizers
unconditional Born derivation
definitive empirical distinction

Strongest unresolved objection

The strongest unresolved objection at the synopsis level is that the framework may rely on a realization functional and admissibility structure whose apparent explanatory power is not yet shown to be independent of the result it seeks to recover.

What later chapters must supply

precise admissibility definitions
exact regularity assumptions for existence theorems
clear treatment of degeneracy and uniqueness
non-circular Born analysis
examples showing how the formalism operates in concrete cases
explicit accounting of where the framework remains conjectural

PART I — PROBLEM STATEMENT AND BURDEN OF PROOF

Chapter 1. The Problem This Volume Addresses

Chapter Summary

This chapter identifies the precise problem addressed by the volume and narrows its scope. It argues that standard quantum theory is extraordinarily successful as a formal framework for the evolution of states and the prediction of measurement statistics, but that this success does not by itself settle the question of how one actual outcome is realized in a single trial. The chapter distinguishes three questions that are often run together: state evolution, emergence of classical-looking records, and single-outcome realization. It then explains why this book isolates the third question, states what the book is not attempting to do, and records the unusually high burden of proof that any proposed realization law must meet.

1.0 Purpose of the Chapter

The purpose of this chapter is to state, as narrowly and explicitly as possible, the target problem of the book. This chapter does not defend the truth of Constraint-Based Realization, does not claim that a realization law is necessary, and does not argue that the proposed framework is unique. Its role is prior to all that. It identifies the problem to be addressed, distinguishes it from neighboring problems, and states the evidential standard required of any proposal that adds new foundational structure to quantum theory.

1.0.1 Position Within the Book

This chapter serves as the entrance to the entire volume. Later chapters will introduce formal objects, admissibility conditions, realization orderings, and conditional results. None of that can be evaluated responsibly unless the reader first knows what question the framework is trying to answer and what would count as answering it. Chapter 1 therefore fixes the problem statement and burden of proof. Chapter 2 then converts these into a disciplined set of desiderata for a viable single-outcome framework.

1.0.2 Dependencies

This chapter assumes only standard background familiarity with nonrelativistic quantum theory at the level of states, observables, measurement statistics, and open-system dynamics. No prior commitment to any interpretation or completion is assumed.

1.1 Standard Quantum Theory as a Theory of Evolving Possibility Structure

1.1.1 Local Problem Statement

Before isolating the question of outcome realization, it is necessary to state what standard quantum theory already does, and does with extraordinary success. The issue addressed by this book cannot be formulated clearly unless one first distinguishes the existing predictive content of quantum mechanics from the additional task the book proposes to analyze.

1.1.2 Formal Background

Let 𝓗 denote a Hilbert space associated with a physical system. In the present volume, unless otherwise stated, the formal discussion is primarily finite-dimensional or effectively finite-dimensional. Let 𝒟(𝓗) denote the density operators on 𝓗. A state ρ ∈ 𝒟(𝓗) represents the kinematic object from which expectation values, probabilities, and reduced descriptions are computed.

Observables are represented, in the usual sharp case, by self-adjoint operators on 𝓗, or more generally by positive operator-valued measures when one wishes to describe generalized measurements. If M is a measurement with outcomes indexed by i and corresponding effects Eᵢ satisfying Eᵢ ≥ 0 and ∑ᵢ Eᵢ = I, then the theory assigns probabilities

p(i) = Tr(ρEᵢ).

This rule is one of the main empirical pillars of quantum theory. It is not a small achievement of the formalism. It is the central bridge between the mathematical structure and observed frequencies.

1.1.3 Unitary Evolution

For isolated systems, time evolution is given by a unitary map. If U is the propagator from time t₀ to t₁, then

ρ ↦ UρU†.

This evolution preserves positivity, trace, and spectral structure in the appropriate way. In Schrödinger-picture language, the state evolves; in Heisenberg-picture language, observables evolve; the empirical content is unchanged.

1.1.4 Open-System Dynamics

Real laboratory systems are rarely isolated. When a system S interacts with an apparatus A or environment E, one often treats the combined system on 𝓗ₛ ⊗ 𝓗ₐ ⊗ 𝓗ₑ while describing a subsystem by reduction. In such settings, the effective dynamics of the subsystem is typically represented by a completely positive trace-preserving map, or CPTP map,

Φ: 𝓑(𝓗) → 𝓑(𝓗),

where 𝓑(𝓗) denotes the bounded operators on 𝓗 in the finite-dimensional setting used throughout most of this volume.

Such maps generalize unitary evolution and measurement update structure. They are the natural formal language when one wants to discuss not merely abstract states but full physical processes involving apparatus and environment. This point becomes important later, because the present framework is channel-centered rather than state-collapse-centered.

1.1.5 Measurement Statistics and Predictive Structure

Standard quantum theory provides a rule for assigning statistical weights to possible outcomes in repeated experimental settings. It also provides a structure for updating states relative to measurement models and for describing entanglement, interference, and decoherence. In this sense, the theory is already complete as a predictive instrument of enormous scope.

The phrase “evolving possibility structure” is therefore not a dismissal of ordinary quantum mechanics. It is a descriptive emphasis. The standard formalism evolves amplitudes, correlates subsystems, generates interference patterns, suppresses coherence between environmentally decohered sectors, and assigns statistical weights to candidate outcomes. All of that belongs to the theory’s ordinary success.

1.1.6 Interpretive Caution

Interpretive Claim 1.1.1.
Standard quantum theory, at minimum, provides a formal structure governing the evolution of physically relevant possibilities and their statistical organization.

This claim is intentionally weak and broad. It does not decide how those possibilities are to be interpreted ontologically. It does not decide whether all decohered sectors are equally real, whether a single outcome is selected by an additional law, or whether the question itself is misguided. It only records the undeniable fact that the formalism organizes possible outcomes and their probabilities with exceptional empirical success.

1.1.7 Why This Matters for the Present Book

The present book must not be misunderstood as claiming that quantum theory lacks predictive content. The opposite is true. The book begins from the strength of ordinary quantum mechanics. Its proposed addition, if justified at all, is meant to address a narrower question left open by that success.

1.1.8 Limits of This Section

This section has reviewed only the standard formal ingredients needed to locate the problem. It has not argued that a predictive theory of possibilities is incomplete. It has not argued that the formalism fails. It has only stated what standard quantum theory already does.

1.2 The Distinction Between Prediction and Realization

1.2.1 Purpose

The second step is to distinguish predictive success from a law of realized single outcomes. This distinction is central to the entire volume.

1.2.2 Local Problem Statement

A theory can assign probabilities to outcomes without thereby specifying, in a universally agreed way, how one actual outcome is realized in an individual trial. The present section clarifies that distinction.

1.2.3 Predictive Amplitudes and Realized Outcomes

Let a measurement context have candidate outcomes indexed by i. Standard quantum theory provides probabilities p(i), usually through a rule of the form p(i) = Tr(ρEᵢ). What this gives directly is a statistical assignment over possible outcomes. It does not, by itself and without interpretive supplementation, settle the following question:

In a single run of the experiment, what makes outcome i rather than outcome j the one that becomes physically actual?

The predictive assignment and the realized event are related, but they are not the same object. A probability distribution is not itself a single realized outcome. A superposed or mixed predictive structure is not itself identical to a public macroscopic record.

1.2.4 Statistical Success and Single-Event Ontology

Proposition 1.2.1.
The empirical success of a statistical rule for repeated measurements does not by itself determine a unique ontology of single measurement events.

Proof Sketch.
Different interpretations or completion proposals can agree on the same statistical predictions while differing sharply on what is said to occur in a single trial. One framework may treat all decohered branches as equally real, another may posit a single realized outcome, another may add hidden variables, and another may remain instrumental about ontology. Agreement on repeated-trial statistics therefore underdetermines single-event ontology. ∎

The point here is modest but decisive. Predictive equivalence does not erase ontological difference. If one cares about single-event realization, the question remains open even when the statistics are fixed.

1.2.5 What This Section Does Not Claim

This section does not claim that a single-event ontology must be added to quantum mechanics. It claims only that statistical success alone does not force one unique answer to that question. That underdetermination is enough to motivate a careful distinction.

1.2.6 Strongest Objection

Objection 1.2.2.
A critic may argue that nothing further is needed. If the statistical formalism works, then demanding a law of single-event realization may reflect a metaphysical preference rather than a scientific necessity.

Response.
That objection is serious and cannot be dismissed in a preliminary chapter. The present section does not answer it conclusively. It only shows that the issue is not logically settled by statistical success alone. Whether an additional law is needed is a later question. At present the claim is narrower: predictive structure and single-event realization are not identical notions.

1.2.7 Limits of the Section

This section does not argue for CBR. It does not argue against Everettian, Bohmian, collapse, or instrumentalist views. It simply establishes the conceptual space in which a realization law would live, if one were proposed.

1.3 Three Separate Questions Often Blurred Together

1.3.1 Purpose

This section separates three questions that are frequently conflated in quantum foundations.

1.3.2 Local Problem Statement

Much confusion arises when one treats the following as though they were one and the same question:

How do quantum states evolve?
How do classical-looking records emerge?
How is one actual outcome realized in a single trial?

The present section argues that these are distinct, though related, problems.

1.3.3 Question One: How States Evolve

This is the dynamical question. It concerns the evolution of ρ under unitary propagation or, more generally, under admissible open-system dynamics. In standard theory, this is expressed through unitary maps for isolated systems and CPTP maps for effective subsystem evolution.

This question asks about lawful transformation of the predictive state structure. It does not by itself ask which outcome is actual.

1.3.4 Question Two: How Classical-Looking Records Emerge

This is the registration or decoherence question. It concerns how stable, robust, approximately classical-looking records arise in apparatus and environment. It involves suppression of interference between certain sectors, robustness of pointer-like states, redundancy of environmental encoding, and practical irreversibility.

This question is not trivial. It explains much of why measurement outcomes appear classical to us. But emergence of stable record sectors is not automatically identical to selection of one actual realized outcome.

1.3.5 Question Three: How One Actual Outcome Is Realized

This is the realization question. It asks, given a context in which several candidate record structures are represented in the formal description, what determines which one is physically actual in a single trial, if indeed only one is.

This question is narrower than a total interpretation of reality and narrower than a full reworking of dynamics. But it is sharper than a merely statistical question. It concerns actualization, not merely weighting.

1.3.6 Conceptual Separation

Definition 1.3.1.
For the purposes of this volume:

Evolution denotes lawful transformation of the predictive quantum state or process structure.
Registration denotes formation of stable and accessible record-like structures in measurement interactions.
Realization denotes the relation between candidate outcome-bearing structures and the single physically actual public outcome of a trial, when such a single outcome is posited.

1.3.7 Why the Distinction Matters

A framework can address one of these questions without addressing the others. Decoherence addresses major aspects of registration. Unitary dynamics addresses evolution. A single-outcome completion proposal is directed at realization. Conflating these questions allows a theory to look stronger than it is or allows a critic to reject a theory for failing to do something it never set out to do.

1.3.8 Heuristic Remark

A useful way to hold the distinction in mind is this:

evolution tells us how amplitudes and correlations change
registration tells us how candidate records become stable and public
realization asks why this record, rather than another, is the actual one in a single event

This is a heuristic summary, not a formal theorem.

1.3.9 Strongest Objection

Objection 1.3.2.
A critic may argue that realization is not genuinely distinct, because once decoherence has produced effectively classical sectors, nothing scientifically meaningful remains to be explained.

Response.
That position is coherent, but it is not forced by decoherence alone. Decoherence explains why interference between sectors becomes negligible in practice and why records behave classically. It does not, without additional interpretive commitment, uniquely determine whether one sector is actual, all are actual, or the notion of actuality should be redescribed. The present book takes that residual question seriously. Whether that is ultimately justified remains an open matter at this stage.

1.3.10 End of Section Scope Note

This section has not yet argued that the realization question must be answered by a new law. It has only argued that it is a separable question.

1.4 Why This Book Isolates the Third Question

1.4.1 Purpose

This section explains why the book is narrowly focused on outcome realization rather than on all of quantum foundations.

1.4.2 Local Problem Statement

Why isolate the third question rather than attempt a universal interpretation or a total reformulation of quantum mechanics?

1.4.3 Narrowness as Discipline

The book isolates the realization question because it is the narrowest target that can still be substantive. A broader project risks mixing too many burdens together: metaphysics, consciousness, ontology of branching, relativistic extension, thermodynamic irreversibility, and more. Such maximal projects often lose formal clarity precisely because their scope is too large.

A narrower target imposes discipline. The present volume asks only whether there can be a principled law-like account of single-outcome realization formulated at the level of admissible record-forming channels.

1.4.4 Why Not Start With a Complete Interpretation

A full interpretation of quantum mechanics often commits itself on many issues at once: the reality of the wavefunction, the status of probabilities, the ontology of measurement, the role of observers, the meaning of emergence, and the existence or nonexistence of branching worlds. The present work intentionally postpones many of these questions because they are not needed to state the core formal proposal.

This is not an evasion. It is a method. One should first state the smallest formal object one wants to defend before attaching broader metaphysical consequences to it.

1.4.5 Formal Motivation

Later chapters will introduce a measurement context C, an admissible class 𝒜(C), and a realization functional ℛ꜀. These objects are intended to answer only one question:

Given a family of candidate record-forming channels, which one is physically realized in a single trial?

That question is specific enough to be formalized and narrow enough to expose its own weaknesses.

1.4.6 Interpretive Claim

Interpretive Claim 1.4.1.
A good foundational proposal should be as narrow as the problem permits and no narrower than the mathematics can sustain.

This claim guides the structure of the book. It is methodological, not theorematic.

1.4.7 Strongest Objection

Objection 1.4.2.
Isolating realization may be artificial. Perhaps state evolution, decoherence, and ontology are too entangled to separate cleanly.

Response.
That concern is legitimate. The separation is analytic rather than absolute. The questions interact. But analytic separation is still useful if it permits sharper formulation and better control of burden of proof. The present volume proceeds on that basis.

1.5 What This Book Is Not Attempting

1.5.1 Purpose

The fastest way to weaken an unconventional framework is to let it appear responsible for every unresolved problem in quantum foundations. This section prevents that drift.

1.5.2 Negative Scope Statement

This book is not attempting to provide:

a universal philosophy of reality
a theory of consciousness
a complete revision of all quantum dynamics
a solution to every foundational dispute in quantum theory

1.5.3 Not a Universal Philosophy of Reality

The framework is not offered as a total metaphysical system. It does not, in this volume, claim to settle what ultimately exists, whether the wavefunction is ontic in the strongest sense, or what the final structure of reality must be.

1.5.4 Not a Theory of Consciousness

No appeal to consciousness is used as a primitive explanatory mechanism in this volume. The framework is formulated in terms of physical channels, records, admissibility, and realization orderings. Questions about consciousness, observer experience, or phenomenology are intentionally excluded from the formal core.

1.5.5 Not a Full Revision of Quantum Dynamics

The framework does not begin by replacing ordinary unitary or open-system dynamics wholesale. It takes standard quantum dynamics as the predictive backbone and asks whether an additional law is needed at the level of outcome realization. If later chapters justify such a law, it is not introduced as a general substitute for all existing dynamics.

1.5.6 Not a Solution to Every Foundations Dispute

The book does not claim to resolve at once the preferred basis problem, the probability problem in every interpretation, relativistic quantum measurement in full generality, all nonlocality debates, or every issue surrounding quantum cosmology. Some of these questions may interact with the present framework, but they are not all part of its first burden.

1.5.7 Methodological Benefit of Negative Scope

Remark 1.5.1.
A theory becomes easier to assess when it names the burdens it refuses to assume.

This remark is methodological. By recording what the book is not trying to do, the volume reduces the risk of false expectations and illegitimate criticism.

1.5.8 Strongest Objection

Objection 1.5.2.
By refusing larger questions, the framework may be too narrow to matter.

Response.
That possibility cannot be excluded at this stage. But narrowness is preferable to premature inflation. If the framework cannot survive scrutiny even within a narrow domain, then extension would be premature. A minimal formal target is therefore the correct starting point.

1.6 Burden of Proof for a New Realization Law

1.6.1 Purpose

Any proposal that adds law-like structure to quantum foundations incurs a high evidential burden. This section states that burden openly.

1.6.2 Local Problem Statement

What must be shown before a proposed realization law should be taken seriously?

1.6.3 Why the Burden Is High

A realization law adds something. It is therefore not enough for it to be suggestive, elegant, or verbally satisfying. It must justify the added structure against rival positions that either add different structure or refuse to add any. The burden is unusually high for at least five reasons.

First, standard quantum theory is already empirically successful. Any supplement must explain why additional structure is warranted.

Second, the space of possible supplements is large. A new proposal must therefore avoid arbitrariness.

Third, foundational language is vulnerable to hidden circularity. What looks like a derivation may amount to a restatement of assumptions.

Fourth, rival frameworks already exist. A new proposal must survive comparison, not merely internal coherence.

Fifth, the deeper the claim, the stronger the required transparency. Hidden assumptions are especially costly in foundational work.

1.6.4 Formal Burden-of-Proof Statement

Assumption 1.6.1. Methodological Burden Principle.
A proposed realization law is scientifically serious only if it can be stated with explicit primitive objects, explicit assumptions, explicit inferential steps, and explicit limits of validity.

This is a methodological assumption governing the book’s internal standards.

1.6.5 Consequences of the Burden Principle

From this principle, the following demands follow:

the candidate set over which realization is defined must be physically constrained
the realization rule must be stated formally, not only metaphorically
uniqueness claims must state the exact assumptions doing the work
Born-related claims must distinguish compatibility from derivation
empirical distinctness, if claimed, must be operationally meaningful
failure conditions must be named explicitly

1.6.6 Strongest Objection

Objection 1.6.2.
The burden may be so high that no nonstandard proposal could ever satisfy it.

Response.
That is possible. But a high burden is not a flaw. It is appropriate to the terrain. The point is not to guarantee acceptance. It is to prevent weak foundational claims from gaining force through vagueness or rhetoric.

1.6.7 Scope Note

This section has not yet shown that the present framework meets the burden. It has only stated that the burden exists.

1.7 Standards for Success

1.7.1 Purpose

This section records the criteria by which the proposal must be judged.

1.7.2 Standard One: Formal Clarity

The framework must be stated in terms of explicit primitive objects, explicit admissibility conditions, explicit realization rules, and explicit result status. A reader should be able to identify exactly what the theory asserts before evaluating whether it is true.

1.7.3 Standard Two: No Smuggling of the Result

If the framework claims Born compatibility, uniqueness, or empirical distinctness, it must not obtain those results by assumptions that already encode them in disguised form. This is especially important for admissibility definitions, choice of realization functional, and invariance principles.

1.7.4 Standard Three: Recovery of Known Statistics Under Stated Conditions

The framework must recover standard observed statistical structure at least within its stated domain, or clearly say where and why it does not. A realization law that cannot reproduce ordinary measurement statistics under appropriate conditions fails immediately.

1.7.5 Standard Four: Exposure of Empirical Stakes

The framework must either offer possible empirical differences in principle or provide explanatory gain clear enough to justify its extra structure. A law that adds structure while remaining empirically inert and conceptually redundant faces a steep justificatory problem.

1.7.6 Standard Five: Rival Comparison

The framework must survive fair comparison with rival approaches. It must not rely on caricatures of decoherence-only views, Everettian views, Bohmian theories, collapse models, or instrumentalist accounts.

1.7.7 Consolidated Success Statement

Definition 1.7.1. Success Standard for a Realization Framework.
A single-outcome realization framework counts as minimally successful only if it is formally explicit, non-circular in its essential claims, statistically adequate in its stated domain, exposed to possible empirical appraisal or structural justification, and robust under comparison with rival foundational approaches.

1.7.8 Strongest Objection

Objection 1.7.2.
These standards may privilege formalist rigor over physical insight.

Response.
The standards do privilege rigor, intentionally. In a foundational domain where rhetoric can easily outrun proof, that priority is appropriate. Insight is valuable, but it does not substitute for formal discipline.

1.8 Chapter-End Ledger

Established in this chapter

standard quantum theory has been identified as a theory that successfully organizes evolving predictive structure and measurement statistics
prediction has been distinguished from realized single outcome
three separable questions have been defined: evolution, registration, realization
this book’s target has been narrowed to the third question
the volume’s negative scope has been stated
the burden of proof for a new realization law has been made explicit
standards for success have been recorded

Conditionally established

Nothing substantive about the truth of CBR has been established. Only problem structure and evaluation criteria have been set.

Not established

that a new realization law is necessary
that CBR is the correct law
that any realization law is unique
that the Born rule is derived by the proposed framework
that the framework yields empirical distinction

Strongest unresolved objection

The strongest unresolved objection is that the residual question of realization may not require an additional law at all, but may instead reflect an interpretive preference beyond the demands of science.

What later chapters must supply

a formal admissibility schema
an explicit realization rule
evidence that the proposal is not circular
conditional existence and consistency results
a careful statement of Born compatibility and its limits
comparative analysis against rival frameworks

Chapter 2. Desiderata for a Viable Single-Outcome Framework

Chapter Summary

This chapter converts the problem statement of Chapter 1 into a disciplined set of desiderata for any viable single-outcome framework. These desiderata are not yet the axioms of Constraint-Based Realization. They are broader evaluative conditions that any serious proposal of this type should satisfy. The chapter distinguishes between desiderata that motivate later axioms and those that remain merely methodological standards. It also records where each desideratum is likely to face technical difficulty.

2.0 Purpose of the Chapter

The purpose of this chapter is to state what a single-outcome framework would need to achieve in order to count as viable. The chapter is deliberately prior to the specific formal apparatus of later chapters. It identifies constraints that arise not from the internal taste of the present framework, but from the nature of the measurement problem as framed in Chapter 1.

2.0.1 Position Within the Book

Chapter 1 identified the target problem and burden of proof. Chapter 2 converts that burden into a set of success conditions. Later chapters will then decide which of these conditions can be formalized as axioms, which function as standing assumptions, and which remain methodological criteria rather than parts of the theory proper.

2.0.2 Dependencies

This chapter depends on the distinctions introduced in Chapter 1, especially the distinction between evolution, registration, and realization.

2.1 Single Realized Outcome

2.1.1 Local Problem Statement

A single-outcome framework must say what it means to have one realized outcome in a single trial.

2.1.2 Core Requirement

Desideratum 2.1.1. Single Realized Macroscopic Record.
For each measurement trial in the domain of the theory, exactly one macroscopic public record is realized.

This desideratum is central. Without it, the framework ceases to be a single-outcome proposal in the sense intended here.

2.1.3 Clarification

The requirement is not that the formalism erase all alternative possibilities from its predictive state description. Rather, it is that among the candidate record-bearing structures relevant to a trial, one and only one counts as physically realized in the public macroscopic sense.

2.1.4 Vulnerability

The immediate difficulty is defining “one” and “macroscopic record” non-arbitrarily. Later chapters must handle degeneracy, coarse-graining, and physically equivalent descriptions carefully to avoid trivializing the requirement.

2.1.5 Strongest Objection

A critic may object that “exactly one” is already a metaphysical stipulation rather than a formal consequence. That is correct at the desideratum stage. This chapter is not pretending otherwise. It records the target condition for a single-outcome framework.

2.2 Intersubjective Record Agreement

2.2.1 Local Problem Statement

If one outcome is realized, different observers with ordinary access to the resulting record should not disagree about what that record is.

2.2.2 Core Requirement

Desideratum 2.2.1. Intersubjective Agreement.
The framework must yield public record structure such that observers appropriately coupled to the measurement outcome converge on the same realized record.

2.2.3 Why This Matters

A single-outcome theory that permits observer-dependent public contradictions has failed at the most basic level of ordinary measurement description. Public measurement records are not private hidden episodes. They are meant to support shared empirical practice.

2.2.4 Formal Importance

Later, this desideratum motivates admissibility constraints tied to record accessibility and compositional consistency. It is one of the reasons the present framework treats outcome realization at the channel level rather than at the level of a bare abstract state.

2.2.5 Vulnerability

The main difficulty lies in specifying what counts as “appropriate coupling” and “public record” without circular dependence on the very realization structure one wants to define.

2.3 Compatibility with Standard Microdynamics

2.3.1 Local Problem Statement

A completion proposal should not discard standard quantum dynamics without necessity.

2.3.2 Core Requirement

Desideratum 2.3.1. Dynamical Compatibility.
Ordinary unitary and open-system quantum evolution should remain intact except where an explicit and justified supplement is introduced.

2.3.3 Rationale

Standard quantum dynamics is empirically successful. A new framework should therefore begin conservatively. The burden lies on the supplement, not on the predictive backbone already supported by experiment.

2.3.4 Implication for Later Chapters

This desideratum motivates the later distinction between predictive dynamics and realization law. If the proposed framework adds a selection principle, it should not do so by casually replacing all familiar dynamics.

2.3.5 Strongest Objection

One might argue that any genuine solution to the measurement problem must modify the dynamics more radically. That possibility is not ruled out in principle, but the present framework begins from a minimal-supplement stance because that is the least inflationary route.

2.4 Compositional Closure

2.4.1 Local Problem Statement

A realization assignment that works for isolated toy models but breaks under composition is not viable.

2.4.2 Core Requirement

Desideratum 2.4.1. Compositional Closure.
The framework must not generate contradictions between subsystem descriptions and whole-system descriptions under admissible composition, restriction, or coarse-graining.

2.4.3 Why This Matters

Quantum theory is inherently compositional. Systems combine, observers interact, apparatuses become subsystems of larger systems, and descriptions shift across scales. A realization law that assigns incompatible outcomes depending on descriptive level would not be physically coherent.

2.4.4 Formal Implications

Later chapters must address how admissible classes behave under tensor product structure, reduction to subsystems, and physically appropriate coarse-graining.

2.4.5 Vulnerability

This desideratum is technically demanding. Many seemingly plausible outcome-selection rules become fragile once nested observers, entanglement, or enlarged apparatus descriptions are considered.

2.5 Stability of Records

2.5.1 Local Problem Statement

A realized outcome must be more than a transient microscopic fluctuation.

2.5.2 Core Requirement

Desideratum 2.5.1. Record Stability.
A realized outcome must correspond to a record that is sufficiently robust, retrievable, and physically public in the context at hand.

2.5.3 Clarification

“Stable” need not mean eternal. It means stable enough to ground ordinary measurement practice: persistence over the relevant time window, distinguishability from competing records, and accessibility to the relevant observer community or apparatus chain.

2.5.4 Why This Matters

Without record stability, the phrase “realized outcome” becomes physically thin. The framework is not interested in bare abstract actualization divorced from record-bearing structure.

2.5.5 Vulnerability

The criterion must avoid becoming too weak, in which case nearly any transient structure counts, or too strong, in which case ordinary laboratory measurements become excluded.

2.6 Basis Non-Arbitrariness

2.6.1 Local Problem Statement

A realization rule must not depend on arbitrary formal decompositions lacking physical significance.

2.6.2 Core Requirement

Desideratum 2.6.1. Basis Non-Arbitrariness.
Outcome selection must track physically meaningful record structure rather than arbitrary basis decomposition of the formal state space.

2.6.3 Rationale

The measurement problem is not solved by declaring one basis “actual” unless there is a physical reason why that basis corresponds to record-bearing sectors. The relevant structure should arise from the dynamics and record architecture of the context, not from arbitrary mathematical rewriting.

2.6.4 Link to Later Formalism

This desideratum directly motivates later emphasis on records, admissibility, and invariance under physically irrelevant redescription.

2.6.5 Strongest Objection

A critic may say that any account appealing to “physically meaningful record structure” risks importing a preferred basis indirectly. That is a genuine risk. Later chapters must show that the appeal is grounded in public record formation, not in unexplained basis privilege.

2.7 Frequency Adequacy

2.7.1 Local Problem Statement

A single-outcome framework that fails to recover observed long-run statistical structure is immediately disqualified.

2.7.2 Core Requirement

Desideratum 2.7.1. Frequency Adequacy.
Under repeated trials in its stated domain, the framework must recover empirically correct outcome frequencies.

2.7.3 Clarification

This desideratum is deliberately weaker than “derive the Born rule from wholly independent axioms.” A framework may first need to establish compatibility before it can aspire to derivation. Those are not the same achievement.

2.7.4 Later Role

This desideratum motivates the Born-analysis chapters and the insistence on distinguishing compatibility, derivation, and uniqueness.

2.7.5 Vulnerability

The most serious risk is hidden importation: a framework may appear to recover ordinary statistics only because its admissibility conditions or functional choice already build those statistics in.

2.8 Admissibility Discipline

2.8.1 Local Problem Statement

A selection law cannot be meaningful if the set of candidates is freely adjustable to fit the desired result.

2.8.2 Core Requirement

Desideratum 2.8.1. Admissibility Discipline.
The class of candidate realization channels must be physically definable and not freely chosen ad hoc from case to case.

2.8.3 Why This Matters

This desideratum may be the deepest structural requirement in the whole framework. If the candidate set is unconstrained, then the realization rule becomes empty or tautological. Much of the later formal burden falls here.

2.8.4 Consequence

Any later admissibility schema must be tested for nonemptiness, physical meaning, compositional behavior, and resistance to post hoc tailoring.

2.8.5 Strongest Objection

A hostile referee would likely ask whether “admissibility” is just a concealed place to insert the answer one wants. That objection is among the most serious facing the project and must remain explicit throughout.

2.9 Falsifiability or Explanatory Gain

2.9.1 Local Problem Statement

Why tolerate extra law-like structure unless it earns its place?

2.9.2 Core Requirement

Desideratum 2.9.1. Falsifiability or Structural Gain.
A realization framework should either yield empirical differentiation in principle or offer enough structural and explanatory gain to justify the added formal burden.

2.9.3 Two Routes to Justification

A framework can justify itself in either of two ways.

First, it may yield empirical differences, however subtle, that could in principle distinguish it from interpretation-only readings of standard quantum theory.

Second, even if empirically equivalent in current practice, it may offer genuine structural gain: elimination of ambiguity, better compositional control, sharper account of public records, or more disciplined treatment of realization.

2.9.4 Caution

Structural gain must be real, not merely terminological. Renaming the problem in more formal language is not enough.

2.9.5 Vulnerability

If the framework produces no operational difference and no real explanatory compression, it risks being a redundant reformulation rather than a scientific advance.

2.10 Which Are Axioms and Which Are Desiderata

2.10.1 Purpose

This section separates motivating conditions from actual axioms of the theory. This distinction is necessary for rigor.

2.10.2 Local Problem Statement

Not every desirable property belongs inside the formal core as an axiom. Which conditions will later be assumed as axioms, and which remain external standards?

2.10.3 Distinction

Definition 2.10.1. Desideratum.
A desideratum is a condition used to evaluate whether a candidate framework is viable, well-motivated, or scientifically worth pursuing.

Definition 2.10.2. Axiom.
An axiom is a foundational statement internal to the theory, used as a formal premise from which later definitions, propositions, or theorems proceed.

2.10.4 Why the Distinction Matters

If one blurs desiderata and axioms, the theory becomes difficult to evaluate. A reader may think the framework has proved what it has only stipulated, or may attack a methodological criterion as though it were an internal theorem.

2.10.5 Preliminary Classification

The following desiderata are likely to motivate later axioms directly:

single realized outcome
intersubjective record agreement
compatibility with standard microdynamics
compositional closure
admissibility discipline

The following desiderata may remain partly methodological or partly theorem-targets rather than axioms as such:

record stability in its full operational detail
basis non-arbitrariness
frequency adequacy
falsifiability or explanatory gain

This classification is provisional. Later chapters will sharpen it.

2.10.6 Formal Caution

Remark 2.10.3.
A desideratum does not become an axiom merely because it is important. It becomes an axiom only when the theory takes it as an internal starting premise.

2.10.7 Strongest Objection

A critic may argue that the line between desideratum and axiom remains fuzzy. That is fair at this stage. Chapter 7 will be responsible for formalizing the eventual axiomatic core. The present chapter is preparatory.

2.11 Chapter-End Ledger

Established in this chapter

a disciplined set of desiderata for any viable single-outcome framework has been stated
each desideratum has been motivated and its vulnerability identified
the distinction between desiderata and axioms has been introduced
a provisional classification of likely axioms versus broader standards has been recorded

Conditionally established

Nothing in this chapter is yet a theorem of CBR. These are framework-evaluation conditions and future axiom-motivators.

Not established

that the desiderata are jointly satisfiable
that CBR satisfies them
that the desiderata uniquely pick out one framework
that later axioms derived from them are sufficient

Strongest unresolved objection

The strongest unresolved objection is that some of these desiderata, especially admissibility discipline and basis non-arbitrariness, may be difficult to satisfy simultaneously without covertly importing the desired result.

What later chapters must supply

precise definitions of record structure and admissibility
a formal axiomatic core
explicit realization rule
conditional existence and consistency results
careful Born-analysis with non-circularity audit

Chapter-End Box for Part I

Established here: only the target problem and burden of proof, together with the desiderata any viable single-outcome framework should satisfy.

Not yet established: the need for Constraint-Based Realization, the uniqueness of its formal structure, or the truth of the framework itself.

Referee-Risk Memo

Most likely expert criticisms

1. The chapter may seem to presuppose that “realization” is a scientifically legitimate leftover problem.
Current response: the text is careful not to assert necessity, only separability.
What still needs strengthening: later chapters must show why treating realization as a formal target yields more than a relabeling of interpretive preference.

2. The desiderata may appear mutually tension-laden, especially admissibility discipline versus basis non-arbitrariness and frequency adequacy.
Current response: the chapter acknowledges this rather than hiding it.
What still needs strengthening: later formal chapters must show that these can coexist without covert circularity.

3. The framework may still look under-motivated relative to decoherence-only or Everettian accounts.
Current response: the chapter avoids premature polemic and states burden of proof openly.
What still needs strengthening: comparative chapters must engage rival views more directly and technically.

PART II — FORMAL FRAMEWORK

Chapter 3. Mathematical Preliminaries

Chapter Summary

This chapter fixes the mathematical language used throughout the remainder of the volume. Its purpose is not to develop the full technical theory of operator algebras, measurement theory, or variational analysis, but to state the minimum formal background needed for the later construction of admissible realization channels and realization functionals. The emphasis is therefore selective. Only those concepts required by Chapters 4–10 are introduced here.

The chapter proceeds from basic state-space objects to channel structure, outcome-resolved processes, Choi representations, and the small amount of convex and variational machinery needed for later existence and consistency results. Relative entropy and related divergence measures are introduced only to the extent necessary for later candidate realizations of the realization functional. A notation summary closes the chapter.

3.0 Purpose of the Chapter

The purpose of this chapter is to establish the shared mathematical vocabulary of the book. Later chapters will define measurement contexts, admissible classes, and realization functionals at the level of channels and record structure. Those constructions require a common language for:

Hilbert spaces and density operators
composite systems and reduced states
CPTP maps and instruments
Choi-state representations of channels
basic convex and variational properties
divergence-based comparison functionals

This chapter does not attempt to prove the main results of the framework. It only prepares the formal ground on which they can be stated precisely.

3.0.1 Position Within the Book

Chapter 1 stated the target problem and Chapter 2 stated the desiderata. Chapter 3 now provides the formal preliminaries needed to state the framework without ambiguity. Chapter 4 will then use this language to distinguish evolution, registration, and realization. Chapters 5 and 6 will build measurement contexts and admissible classes out of the structures fixed here.

3.0.2 Dependencies

This chapter assumes standard background familiarity with finite-dimensional quantum theory. Unless explicitly stated otherwise, the formal development in this volume is carried out in finite-dimensional Hilbert spaces or in effectively finite-dimensional models. This restriction is methodological: it keeps the formal core sharp and avoids importing analytic difficulties not essential to the first statement of the framework.

3.1 Hilbert Spaces and Density Operators

3.1.1 Local Problem Statement

The framework requires a state-space language that is standard, compact, and sufficient for later channel-based constructions.

Definition 3.1.1. Hilbert Space

A Hilbert space 𝓗 is a complex inner-product space that is complete with respect to the norm induced by its inner product. In this volume, unless otherwise stated, 𝓗 is finite-dimensional.

Definition 3.1.2. State Space

The state space on 𝓗 is denoted 𝒟(𝓗) and consists of all positive semidefinite trace-one operators on 𝓗:

𝒟(𝓗) = {ρ ∈ 𝓑(𝓗) : ρ ≥ 0 and Tr(ρ) = 1}.

A member ρ ∈ 𝒟(𝓗) is called a density operator or density state.

Remark 3.1.3

Pure states correspond to rank-one projectors of the form |ψ⟩⟨ψ|. Mixed states are convex combinations of pure states. The present framework does not take purity as primitive. It works uniformly at the level of density operators and channels.

Definition 3.1.4. Support

For ρ ∈ 𝒟(𝓗), the support of ρ, denoted supp(ρ), is the subspace spanned by eigenvectors of ρ with nonzero eigenvalue.

Remark 3.1.5

The support of a state becomes important later when divergence measures are introduced, since some such measures depend on inclusion relations between supports.

Definition 3.1.6. Observable and Effects

A sharp observable is represented by a self-adjoint operator on 𝓗. More generally, a measurement with discrete outcome set I is represented by a family of effects {Eᵢ}ᵢ∈I satisfying:

Eᵢ ≥ 0 for all i
∑ᵢ Eᵢ = I

The probability of outcome i in state ρ is

p(i) = Tr(ρEᵢ).

Scope Note

This section only fixes notation. It does not settle any interpretive question concerning the meaning of ρ, probability, or measurement.

3.2 Composite Systems and Partial Trace

3.2.1 Local Problem Statement

The framework concerns systems, apparatuses, environments, and records. It therefore requires explicit treatment of composite systems and reduced descriptions.

Definition 3.2.1. Composite Hilbert Space

If S and A are subsystems with Hilbert spaces 𝓗ₛ and 𝓗ₐ, then the composite system has Hilbert space

𝓗ₛₐ = 𝓗ₛ ⊗ 𝓗ₐ.

Similarly, if E is an environment, the total space is

𝓗ₛₐₑ = 𝓗ₛ ⊗ 𝓗ₐ ⊗ 𝓗ₑ.

Definition 3.2.2. Partial Trace

Let ρₛₐ ∈ 𝒟(𝓗ₛ ⊗ 𝓗ₐ). The reduced state on S is

ρₛ = Trₐ(ρₛₐ),

where Trₐ denotes the partial trace over 𝓗ₐ. Likewise, the reduced state on A is ρₐ = Trₛ(ρₛₐ.

Remark 3.2.3

The partial trace is the standard mathematical operation used to pass from a composite description to an effective subsystem description. Later, it will also be used in describing accessible record structure and effective public outcomes.

Proposition 3.2.4. Reduced State Positivity and Normalization

If ρₛₐ ∈ 𝒟(𝓗ₛ ⊗ 𝓗ₐ), then Trₐ(ρₛₐ) ∈ 𝒟(𝓗ₛ).

Proof.
Positivity is preserved by the partial trace, and Tr(Trₐ(ρₛₐ)) = Tr(ρₛₐ) = 1. ∎

Remark 3.2.5

This proposition is elementary, but it records the fact that reduced descriptions remain valid density states.

Scope Note

Later chapters will rely heavily on the distinction between global and reduced descriptions. This chapter only records the formal mechanism.

3.3 CPTP Maps

3.3.1 Local Problem Statement

The framework will be formulated at the level of processes rather than solely at the level of state vectors or post-measurement states. The appropriate mathematical objects are quantum channels.

Definition 3.3.1. CPTP Map

A completely positive trace-preserving map, or CPTP map, is a linear map

Φ: 𝓑(𝓗ᵢₙ) → 𝓑(𝓗ₒᵤₜ)

such that:

Φ is completely positive, meaning that for every auxiliary Hilbert space 𝓚, the map Φ ⊗ id𝓚 is positive.
Φ is trace-preserving, meaning that Tr(Φ(X)) = Tr(X) for all trace-class X in the present finite-dimensional setting.

Remark 3.3.2

CPTP maps generalize unitary evolution, open-system dynamics, noise channels, and measurement-induced transformations when outcomes are ignored. They are therefore the natural process-level objects for the present framework.

Definition 3.3.3. Quantum Channel

In this volume, the terms quantum channel and CPTP map are used interchangeably unless explicitly distinguished.

Example 3.3.4. Unitary Channel

If U: 𝓗 → 𝓗 is unitary, then

Φᵁ(X) = UXU†

defines a CPTP map.

Example 3.3.5. Erasure-Type Channel

Fix σ ∈ 𝒟(𝓗ₒᵤₜ). Then the map

Φσ(X) = Tr(X)σ

is CPTP. It forgets the input and outputs the same state σ for every input.

Remark 3.3.6

The existence of channels like Φσ shows that legality as a CPTP map is too weak for the present framework. Later admissibility conditions will need to exclude formally legal but physically unsuitable realization channels.

Proposition 3.3.7. Convexity of Channel Space

The set of CPTP maps from 𝓑(𝓗ᵢₙ) to 𝓑(𝓗ₒᵤₜ) is convex.

Proof.
If Φ₁ and Φ₂ are CPTP and 0 ≤ λ ≤ 1, then λΦ₁ + (1 − λ)Φ₂ is linear, completely positive, and trace-preserving. ∎

Remark 3.3.8

Convexity will matter later when discussing admissible classes and variational minimization.

3.4 Instruments and Outcome-Resolved Processes

3.4.1 Local Problem Statement

The framework concerns candidate realized outcomes, not merely outcome-averaged channels. This requires an outcome-resolved notion of quantum process.

Definition 3.4.1. Instrument

A quantum instrument with outcome set I is a family {𝓘ᵢ}ᵢ∈I of completely positive trace-nonincreasing maps

𝓘ᵢ: 𝓑(𝓗ᵢₙ) → 𝓑(𝓗ₒᵤₜ)

such that the total map

Φ = ∑ᵢ 𝓘ᵢ

is CPTP.

Definition 3.4.2. Outcome Probability and Conditional Output

Given input state ρ and instrument {𝓘ᵢ}, the probability of outcome i is

p(i) = Tr(𝓘ᵢ(ρ)).

If p(i) > 0, the corresponding conditional post-instrument state is

ρᵢ = 𝓘ᵢ(ρ) / p(i).

Remark 3.4.3

An instrument separates the outcome structure from the total process. This is important because later chapters will treat record-forming channels as richer objects than bare effect operators, and the instrument formalism provides a standard way to organize such outcome-resolved processes.

Definition 3.4.4. Outcome-Ignored Channel

The outcome-ignored channel associated with an instrument {𝓘ᵢ} is

Φ = ∑ᵢ 𝓘ᵢ.

Scope Note

The present framework will not identify realization with a single instrument component by definition. Rather, it will use instruments and related process structure as part of the formal vocabulary needed to describe candidate record-bearing channels.

3.5 Choi Representation

3.5.1 Local Problem Statement

Later chapters require a representation of channels as positive operators so that channel comparison and divergence-based functionals can be formulated with standard matrix tools.

Definition 3.5.1. Choi Operator

Let Φ: 𝓑(𝓗ᵢₙ) → 𝓑(𝓗ₒᵤₜ) be linear. Fix an orthonormal basis {|k⟩} of 𝓗ᵢₙ and define the maximally entangled operator

Ω = ∑ⱼ,ₖ |j⟩⟨k| ⊗ |j⟩⟨k|.

The Choi operator of Φ is

J(Φ) = (id ⊗ Φ)(Ω).

Proposition 3.5.2. Choi Positivity Criterion

Φ is completely positive if and only if J(Φ) ≥ 0.

Proposition 3.5.3. Trace-Preservation Criterion

Φ is trace-preserving if and only if

Trₒᵤₜ(J(Φ)) = Iᵢₙ.

Remark 3.5.4

These standard facts allow the space of channels to be studied through positive operators satisfying linear constraints. This will be useful later when discussing admissible classes, compactness properties, and candidate realization functionals.

Definition 3.5.5. Choi State

When normalized appropriately, one may pass from J(Φ) to a density-operator-like object representing the channel. In this volume, the term Choi state will be used informally for such normalized representations when no ambiguity arises.

Non-Overstatement Note

The Choi representation is a mathematical representation of channels. It does not imply that a channel literally is a state of a larger system in the ontological sense. It is a formal identification useful for analysis.

3.6 Convexity, Continuity, Compactness, and Variational Preliminaries

3.6.1 Local Problem Statement

The framework later introduces a realization functional over an admissible class of channels. Basic existence results therefore require a minimal variational vocabulary.

Definition 3.6.1. Convex Set

A set 𝒞 in a vector space is convex if for any x, y ∈ 𝒞 and any λ with 0 ≤ λ ≤ 1,

λx + (1 − λ)y ∈ 𝒞.

Definition 3.6.2. Lower Semicontinuity

A function f on a topological space is lower semicontinuous if for every convergent sequence xₙ → x,

f(x) ≤ lim infₙ→∞ f(xₙ).

Remark 3.6.3

Lower semicontinuity is one of the standard hypotheses used to prove existence of minimizers.

Definition 3.6.4. Compactness

A set is compact if every open cover has a finite subcover. In the finite-dimensional settings of this volume, compactness is equivalent to closedness plus boundedness.

Proposition 3.6.5. Existence of Minimizers in Finite Dimensions

Let 𝒞 be a nonempty compact set in a finite-dimensional space and let f: 𝒞 → ℝ ∪ {+∞} be lower semicontinuous. Then f attains its minimum on 𝒞.

Proof.
This is a standard consequence of compactness and lower semicontinuity in finite dimensions. ∎

Remark 3.6.6

This proposition will later support existence results for realization channels, provided the admissible class and realization functional satisfy the necessary hypotheses.

Definition 3.6.7. Strict Convexity

A function f on a convex set is strictly convex if for distinct x and y and 0 < λ < 1,

f(λx + (1 − λ)y) < λf(x) + (1 − λ)f(y).

Proposition 3.6.8. Uniqueness from Strict Convexity

If 𝒞 is convex and f is strictly convex on 𝒞, then f has at most one minimizer on 𝒞.

Proof.
If x ≠ y were both minimizers, then strict convexity would imply that λx + (1 − λ)y has strictly smaller value, contradicting minimality. ∎

Scope Note

Later uniqueness claims will require more than a bare citation of strict convexity. They will also depend on the structure of admissibility, physical equivalence classes, and possible symmetry degeneracies.

3.7 Relative Entropy and Divergence Measures

3.7.1 Local Problem Statement

Later chapters consider candidate realization functionals based on information-theoretic comparison between channels or their Choi representations. Only the minimum necessary formal background is introduced here.

Definition 3.7.1. Quantum Relative Entropy

For density operators ρ and σ with supp(ρ) ⊆ supp(σ), the quantum relative entropy is

D(ρ ∥ σ) = Tr(ρ(log ρ − log σ)).

If supp(ρ) is not contained in supp(σ), one sets D(ρ ∥ σ) = +∞.

Remark 3.7.2

Relative entropy is not a metric. It is generally asymmetric and does not satisfy the triangle inequality. Its value lies elsewhere: it quantifies a form of distinguishability or divergence and behaves well under CPTP maps.

Proposition 3.7.3. Nonnegativity

D(ρ ∥ σ) ≥ 0, with equality if and only if ρ = σ.

Proposition 3.7.4. Data Processing Inequality

If Φ is CPTP, then

D(Φ(ρ) ∥ Φ(σ)) ≤ D(ρ ∥ σ).

Remark 3.7.5

The data processing inequality is one reason divergence-based functionals are attractive in channel selection problems. However, attractiveness is not the same as necessity. Later chapters will have to justify why any particular divergence family is relevant to realization.

Definition 3.7.6. Divergence Measure

A divergence measure is any functional Δ(ρ, σ) intended to compare two states or channels and satisfying at least some subset of the properties usually desirable in comparison theory, such as nonnegativity, lower semicontinuity, or monotonicity under a chosen class of maps.

Caution 3.7.7

This volume does not assume that relative entropy is uniquely mandated for the realization functional. It is introduced as a candidate structural tool, not yet as a final answer.

3.8 Notation Summary

Purpose

This section records the principal symbols used in the formal framework.

Formal Symbol Table

The notation of the work is as follows. The symbol 𝓗 denotes a Hilbert space in general. The symbols 𝓗ₛ, 𝓗ₐ, and 𝓗ₑ denote the Hilbert spaces of the system, apparatus, and environment, respectively. The symbol 𝒟(𝓗) denotes the set of density operators on 𝓗, while 𝓑(𝓗) denotes the bounded operators on 𝓗 in the finite-dimensional setting used throughout most of the volume. Symbols such as ρ and σ denote density operators. Symbols such as Φ and Ψ denote channels or process maps. The notation 𝓘ᵢ denotes an instrument component associated with outcome i. The symbol J(Φ) denotes the Choi operator of the channel Φ. The notation Trₓ denotes partial trace over subsystem x. The expression D(ρ ∥ σ) denotes quantum relative entropy. The symbol C denotes a measurement context. The notation 𝒜(C) denotes the admissible class of realization channels associated with context C. The symbol ℛ꜀ denotes the realization functional associated with context C. Finally, Φ∗ denotes the realized channel when the relevant existence and selection conditions are satisfied.

Appendix Pointer

Readers needing fuller background on operator theory, channel representations, or variational arguments may consult Appendix A. Readers seeking only symbol lookup should consult Appendix B.

3.9 End-of-Chapter Ledger

Established in this chapter

the state-space language of Hilbert spaces and density operators
composite-system structure and partial trace
CPTP maps as the process-level language of the framework
instruments as outcome-resolved process decompositions
Choi representation of channels
minimal convex and variational tools
relative entropy as a candidate divergence framework
the formal notation used in later chapters

Conditionally established

Only elementary mathematical propositions have been established here. No framework-specific theorem has yet been proved.

Not established

any admissibility condition
any realization rule
any canonical choice of realization functional
any Born-related claim
any empirical distinction

Strongest unresolved objection

The strongest unresolved objection at this stage is that the mathematical language, while standard, does not yet justify why channels rather than states should carry the realization structure. That burden falls chiefly on Chapter 4.

What later chapters must supply

a formal distinction between evolution, registration, and realization
physical definitions of record sectors and measurement contexts
admissibility conditions on candidate realization channels
a realization rule and its support

Chapter 4. Primitive Physical Distinctions: Evolution, Registration, Realization

Chapter Summary

This chapter introduces the foundational conceptual distinction on which the rest of the book depends. It separates three levels of analysis that are often conflated in quantum foundations: evolution of the predictive structure, registration of candidate public records, and realization of one actual public outcome in a single trial. The chapter argues that the first two are not identical to the third, and that the third is best formulated at the level of channels rather than states alone. It then defines record sectors and record-bearing subsystems, states the realization problem formally, and clarifies what the shift to channel-level realization does not imply.

4.0 Purpose of the Chapter

The purpose of this chapter is to supply the conceptual architecture of the formal framework. Without a careful distinction between evolution, registration, and realization, later definitions of admissible classes and realization functionals would risk either redundancy or confusion. This chapter therefore does two things at once:

it defines the three primitive distinctions precisely enough for later formal use
it motivates the decision to formulate realization at the channel level

4.0.1 Position Within the Book

Chapter 3 established the mathematical vocabulary. Chapter 4 now uses that vocabulary to identify the specific physical relation the proposed framework aims to formalize. Chapters 5 and 6 will then define measurement contexts and admissible realization channels in direct continuity with the distinctions drawn here.

4.1 Evolution

4.1.1 Local Problem Statement

The first primitive distinction concerns the lawful change of the predictive structure of the theory.

Definition 4.1.1. Evolution

Evolution is the lawful transformation of the predictive quantum structure of a system, whether represented by:

unitary propagation on an isolated composite
open-system CPTP dynamics
outcome-ignored process maps induced by larger interactions

In formal terms, if ρ₀ is an initial state and Φ is the relevant dynamical map, then evolution is represented by

ρ₁ = Φ(ρ₀).

Remark 4.1.2

Evolution concerns how the state or process structure changes. It does not, by itself, specify which candidate record becomes actual in a single trial.

Interpretive Claim 4.1.3

Evolution organizes possibility structure. It specifies which transformations are dynamically available and how probabilities or amplitudes are propagated, but it does not automatically settle the public actualization question that this book isolates.

Scope Note

This chapter does not deny that some interpretations take evolution alone to be sufficient. It only states that, within the present framework, evolution is analytically distinguished from realization.

4.2 Registration

4.2.1 Local Problem Statement

Measurement interactions do not merely evolve states. They generate record-bearing structures in apparatus and environment.

Definition 4.2.1. Registration

Registration is the formation, through physical interaction, of candidate record-bearing structures correlated with different outcome sectors of a measurement context.

Remark 4.2.2

Registration includes familiar processes such as:

pointer displacement
amplification in an apparatus
environmental decoherence
redundancy of record encoding
practical stabilization of classical-looking alternatives

Definition 4.2.3. Candidate Record Formation

A process exhibits candidate record formation if it yields a family of physically distinguishable sectors in apparatus–environment degrees of freedom that can function as outcome markers under the operational standards of the context.

Heuristic Remark 4.2.4

One may think of registration as the stage at which the measurement interaction has written multiple candidate “records” into the larger physical process structure, whether or not the framework ultimately treats all of them as actual.

Caution 4.2.5

Registration is not identical to realization. The presence of decohered or stable candidate records does not, by itself, determine whether one, many, or none of them should count as the unique actual public outcome.

4.3 Realization

4.3.1 Local Problem Statement

If one posits a single public outcome per trial, a distinct formal notion is required.

Definition 4.3.1. Realization

Realization is the relation between a family of candidate record-bearing structures and the one physically actual public record of a single trial, when the framework posits that exactly one such public record is actualized.

Remark 4.3.2

Realization is narrower than a total ontology. It does not by itself specify the metaphysical status of the state vector, all unobserved alternatives, or the global structure of reality. It specifies only the relation between the measurement context and the public actual outcome structure.

Proposition 4.3.3. Analytic Distinctness of Realization

Within the conceptual framework of this volume, realization is analytically distinct from both evolution and registration.

Proof Sketch.
Evolution concerns lawful state or process transformation. Registration concerns formation of stable candidate record sectors. Realization concerns which such sector is the public actual outcome in a single trial. Since these questions may receive different answers across interpretations while the same state evolution and registration structure are retained, they are analytically distinct.

Scope Note

This proposition is classificatory rather than empirical. It does not prove that realization requires a new law. It only records that the relevant relation is not identical by definition to either evolution or registration.

4.4 Why Realization Is Treated at the Channel Level

4.4.1 Local Problem Statement

Why formulate realization in terms of channels rather than bare states?

Argument 4.4.2

A bare state on the system alone is typically too impoverished to represent the physically relevant structure of a measurement event. A realized measurement outcome is not merely an eigenstate assignment on a microscopic subsystem. It is a structured process involving:

system–apparatus interaction
amplification
coupling to environment
persistence of accessible records
possible observer access and intersubjective agreement

These are naturally process-level features. Channels represent input-output structure, environment coupling, record transfer, and coarse-grained persistence in a way that subsystem states alone do not.

Definition 4.4.3. Channel-Level Realization Target

A channel-level realization target is a process object Φ that encodes not only transformed subsystem state structure but also the outcome-bearing record architecture relevant to the measurement context.

Proposition 4.4.4. Motivational Suitability of Channel Representation

For a framework concerned with public record formation and single-outcome actualization, channels are formally more suitable primitive candidates than subsystem states alone.

Proof Sketch.
A subsystem state may fail to encode which apparatus structures were formed, whether records are stable, whether records are accessible, and how the process composes with larger apparatus–environment dynamics. By contrast, channels and related outcome-resolved process objects can encode these structural relations. Hence, if realization is to track public records rather than mere microscopic post-measurement labels, the channel level is better suited to the framework’s task.

Non-Overstatement Note

This proposition does not prove that channels are uniquely correct in every possible foundation program. It only argues that, given the goals of this framework, they are the more appropriate primitive objects.

Strongest Objection

A critic may argue that the channel formalism simply redescribes ordinary measurement updates without adding explanatory substance.

Response.
That is a serious challenge. The later admissibility and realization chapters must show that the channel-level shift supports genuinely sharper statements about public record structure and realization than state-only language would permit. At this stage, only motivational superiority is claimed.

4.5 Record Sectors and Record-Bearing Subsystems

4.5.1 Local Problem Statement

The framework needs a disciplined vocabulary for talking about records.

Definition 4.5.1. Pointer Sector

A pointer sector is a physically distinguishable sector of apparatus degrees of freedom that functions as an outcome-indicating state under the operational standards of the measurement context.

Definition 4.5.2. Environmental Redundancy

Environmental redundancy is the repeated encoding of outcome-relevant information across multiple environmental degrees of freedom, so that access to parts of the environment suffices to recover the same effective record.

Definition 4.5.3. Accessibility

A record is accessible if the measurement context permits physically ordinary retrieval of the outcome information by the relevant observer or apparatus chain without requiring recovery of global coherence between candidate sectors.

Definition 4.5.4. Persistence

A record exhibits persistence if it remains stably available over the operationally relevant time window associated with the measurement context.

Definition 4.5.5. Record-Bearing Subsystem

A record-bearing subsystem is any subsystem whose states or coarse-grained sectors encode the public outcome information relevant to the context.

Remark 4.5.6

A record-bearing subsystem need not be the apparatus alone. In many contexts, outcome information is distributed across apparatus and environment. The framework therefore uses the broader term deliberately.

4.6 Formal Statement of the Realization Problem

4.6.1 Local Problem Statement

The conceptual distinction is now expressed in the basic formal terms used later.

Dependencies

This section relies on the notions of context, admissible class, and realization functional as previewed in the front matter and to be sharpened in Chapters 5–8.

Formal Problem Statement 4.6.1

Given:

a measurement context C
an admissible class 𝒜(C) of candidate record-forming channels
a realization functional ℛ꜀ defined on 𝒜(C)

which Φ ∈ 𝒜(C) is physically realized?

Remark 4.6.2

This is the central formal question of the volume. It is not yet answered here. This chapter prepares the conceptual grounds on which the later answer will be proposed.

Non-Circularity Warning 4.6.3

The question is only nontrivial if:

𝒜(C) is not chosen ad hoc to force the answer
ℛ꜀ is not covertly equivalent to assuming the desired outcome law
the candidate channels genuinely differ in record-bearing structure rather than in mere notation

These risks remain active and must be addressed later.

4.7 What This Shift Does and Does Not Imply

4.7.1 Purpose

A change in formal focus can easily be mistaken for a broader metaphysical commitment than the text intends. This section limits the interpretation.

Clarification 4.7.2

Treating realization at the channel level does not automatically imply:

new dynamics everywhere
observer-created reality
metaphysical branching
hidden variables

Remark 4.7.3

The framework remains neutral at this stage on many deeper ontological questions. It proposes a formal locus for the realization problem, not an entire metaphysical doctrine.

Proposition 4.7.4. Scope Limitation

The adoption of channel-level realization as a formal strategy is logically compatible, in principle, with more than one broader metaphysical stance.

Proof Sketch.
The choice of formal object does not by itself determine the global ontology of quantum theory. One could, in principle, embed channel-level analysis inside distinct broader frameworks. Hence the present formal move does not by itself force a unique metaphysical reading.

4.8 Chapter-End Ledger

Established in this chapter

the distinction between evolution, registration, and realization
the motivation for treating realization at the channel level
the definitions of pointer sectors, redundancy, accessibility, persistence, and record-bearing subsystems
the formal shape of the realization problem
the scope limits of the channel-level shift

Conditionally established

Only motivational and classificatory propositions have been established. No realization law has yet been introduced.

Not established

that realization requires an additional law
that channels are uniquely necessary in every framework
any admissibility condition
any realization functional
any uniqueness or Born-related claim

Strongest unresolved objection

The strongest unresolved objection is that the channel-level reformulation may still amount to a refined description of registration rather than a genuine account of realization. Later chapters must prove otherwise, if they can.

What later chapters must supply

a precise definition of measurement context
candidate record sectors in concrete form
admissibility conditions on channels
a realization rule
arguments that the framework is not circular

Chapter-End Box

Core distinction: decoherence or registration is not identical to realization.

Chapter 5. Measurement Contexts and Record Structure

Chapter Summary

This chapter defines the formal notion of a measurement context and sharpens the notion of record structure used throughout the remainder of the book. The chapter specifies the elements required for a context, defines candidate record sectors and their stability conditions, explains how publicity and redundancy enter the theory, and clarifies how coarse-graining yields effectively classical record objects. A canonical running example is then introduced: a two-outcome qubit coupled to a pointer apparatus and decohering environment.

5.0 Purpose of the Chapter

The purpose of this chapter is to provide the formal scaffolding needed before admissibility can be defined. A realization law must range over some physically meaningful family of candidate processes. That family cannot be specified until the relevant context and its record architecture are explicit.

5.1 What Counts as a Measurement Context

5.1.1 Local Problem Statement

A realization framework requires more than a system state and an observable. It requires enough structure to identify candidate public records.

Definition 5.1.1. Measurement Context

A measurement context C is an ordered specification

C = (𝓗ₛ, 𝓗ₐ, 𝓗ₑ, ρ₀, Πᴿ, 𝒪, Σ)

where:

𝓗ₛ is the system Hilbert space
𝓗ₐ is the apparatus Hilbert space
𝓗ₑ is the environment Hilbert space
ρ₀ ∈ 𝒟(𝓗ₛ ⊗ 𝓗ₐ ⊗ 𝓗ₑ) is the initial state
Πᴿ is a record partition on the relevant apparatus–environment degrees of freedom
𝒪 specifies the accessible outputs or readout structure
Σ specifies the operational setting, including relevant time window, coupling assumptions, and coarse-graining conventions

Remark 5.1.2

The symbol Πᴿ is used abstractly here for a partition of record-bearing structure into candidate sectors. The later formalism does not require this partition to be sharp in the idealized projection-valued sense, but it does require enough physical distinction to define mutually exclusive public record classes.

Strongest Objection

A critic may argue that the inclusion of Πᴿ and 𝒪 already encodes the answer by deciding what counts as a record in advance.

Response.
That risk is real. However, a realization law cannot even be stated unless the record architecture of the context is explicit. The burden is therefore not to avoid specifying records, but to specify them in a way constrained by physical structure rather than by desired outcomes.

5.2 Candidate Record Sectors

5.2.1 Local Problem Statement

The context requires a family of mutually exclusive candidate public records.

Definition 5.2.1. Candidate Record Sector

A candidate record sector in context C is a coarse-grained class Rᵢ of apparatus–environment states or process histories such that:

Rᵢ is physically distinguishable from Rⱼ for i ≠ j within the operational setting Σ
Rᵢ is associated with one outcome label in the readout structure 𝒪
membership in Rᵢ corresponds to an outcome-bearing public record state in the sense relevant to C

Definition 5.2.2. Mutually Exclusive Record Family

A family {Rᵢ}ᵢ∈I is mutually exclusive if no realized public record can belong to more than one sector in the family under the context’s coarse-graining conventions.

Remark 5.2.3

Mutual exclusivity is a context-level feature. It does not require ontological claims beyond the operational and formal standards of the present theory.

5.3 Stability Conditions

5.3.1 Local Problem Statement

Not every distinguishable sector counts as a viable record. Stability conditions are needed.

Definition 5.3.1. Persistence Through Time Window

A record sector Rᵢ satisfies persistence if its outcome-bearing character remains intact over the contextually relevant time interval specified in Σ.

Definition 5.3.2. Retrievability

A record sector Rᵢ is retrievable if the operational setting permits recovery of its outcome content by ordinary access procedures available within the context.

Definition 5.3.3. Distinguishability

A family {Rᵢ} is distinguishable if the sectors can be reliably discriminated under the context’s readout conventions.

Definition 5.3.4. Resilience Under Admissible Perturbation

A record sector is resilient under admissible perturbation if sufficiently small perturbations consistent with the context do not destroy its identity as a public outcome-bearing record.

Remark 5.3.5

These four conditions—persistence, retrievability, distinguishability, and resilience—are not yet the admissibility conditions on channels. They are structural conditions on record sectors that later admissibility conditions must respect.

5.4 Publicity and Redundancy

5.4.1 Local Problem Statement

The framework is not about private microscopic labels; it is about public records.

Definition 5.4.1. Public Record

A public record is a record whose outcome content is accessible, in the relevant operational sense, to more than one observational pathway or retrieval channel within the context.

Definition 5.4.2. Redundant Encoding

A record is redundantly encoded if its outcome content is present across multiple subsystems or environmental fragments such that recovery of the same outcome information does not depend on a unique microscopic access route.

Remark 5.4.3

Redundancy matters because it supports intersubjective agreement and practical classicality. A record that exists only in one inaccessible microscopic degree of freedom is not the sort of object the framework is built to treat as a realized public outcome.

5.5 Coarse-Graining and Effective Classicality

5.5.1 Local Problem Statement

Public records are not ordinarily tracked at the finest microscopic scale. The theory therefore requires a coarse-grained notion of effective classicality.

Definition 5.5.1. Record Coarse-Graining

A record coarse-graining is a partition of microscopic apparatus–environment configurations into macroscopic classes that are operationally treated as the same outcome-bearing record.

Definition 5.5.2. Effective Classicality

A record family is effectively classical if, under the relevant coarse-graining, the sectors behave as mutually exclusive stable alternatives for purposes of public retrieval and downstream use.

Remark 5.5.3

Effective classicality is not fundamental classicality. It is a context-relative operational property sufficient for public outcome structure.

Strongest Objection

A critic may worry that coarse-graining reintroduces subjectivity.

Response.
The coarse-graining used here is context-dependent but not arbitrary. It is fixed by physical readout practice, record stability, and operational equivalence, not by the whims of an individual observer.

5.6 Context Dependence Without Observer Relativism

5.6.1 Local Problem Statement

The framework uses context heavily. This raises a predictable worry: does context dependence make realization observer-relative?

Proposition 5.6.1. Context Dependence Does Not Entail Observer Relativism

Within the framework of this volume, the dependence of admissibility and record structure on measurement context does not by itself imply that realization is subjective or observer-created.

Proof Sketch.
A measurement context is a physically specified situation consisting of system, apparatus, environment, record partition, and operational setting. These features are not private mental states. Dependence on such objective physical arrangements therefore differs from dependence on arbitrary observer belief or private perspective. ∎

Remark 5.6.2

This proposition does not deny that interpretive disputes remain possible. It only blocks an immediate inference from contextual dependence to subjectivism.

5.7 Canonical Running Example

5.7.1 Purpose

A canonical example will recur throughout the later chapters.

Definition 5.7.1. Canonical Qubit–Pointer–Environment Context

Let:

𝓗ₛ = ℂ² for a qubit system
𝓗ₐ be a finite-dimensional pointer Hilbert space containing two macroscopically distinguishable sectors
𝓗ₑ be a finite-dimensional environment
the record partition Πᴿ = {R₀, R₁}
the accessible outputs 𝒪 = {“0”, “1”}

Suppose the measurement interaction correlates |0⟩ₛ with pointer sector R₀ and |1⟩ₛ with pointer sector R₁, while environmental coupling suppresses interference between the two record sectors over the relevant time window.

Remark 5.7.2

This model is schematic. It does not yet define admissibility or realization. It simply provides a stable running example against which later definitions can be tested.

5.8 End-of-Chapter Ledger

Established in this chapter

the formal notion of measurement context
candidate record sectors and their mutual exclusivity
record stability conditions
publicity and redundancy
coarse-graining and effective classicality
context dependence without observer relativism
the canonical running example

Conditionally established

Only preparatory structural claims have been established here.

Not established

the admissible class of realization channels
the realization rule
uniqueness or Born compatibility
whether the record partition is uniquely determined in all cases

Strongest unresolved objection

The strongest unresolved objection is that the choice of record partition and operational coarse-graining may still be too flexible, threatening later admissibility claims.

What later chapters must supply

a physically constrained admissibility schema
exclusion criteria for pathological channels
formal treatment of composition and coarse-graining
a realization functional acting on the admissible class

Chapter 6. The Admissible Class of Realization Channels

Chapter Summary

This chapter introduces the admissible class 𝒜(C), one of the most vulnerable and important pieces of the entire framework. A realization law over an unconstrained candidate set is empty; a realization law over a hand-tailored candidate set is circular. The chapter therefore defines an initial admissibility schema, states structural admissibility conditions, introduces exclusion conditions for pathological channels, considers composition and coarse-graining, addresses locality and composite-system issues at a preliminary level, and openly records the risk of underdetermination. A small proposition set then states the limited formal results that can be claimed at this stage.

6.0 Purpose of the Chapter

The purpose of this chapter is to define, as explicitly as possible, the class over which the later realization functional is to operate. This chapter is central because the meaning of the realization rule depends entirely on whether admissibility is physically constrained and nontrivial.

6.1 Why Admissibility Cannot Remain Informal

6.1.1 Local Problem Statement

A selection principle is vacuous if the selection domain is undefined.

Argument 6.1.1

Suppose one writes “the realized outcome is the minimizer of some functional over the possible channels.” If the phrase “possible channels” is left informal, then almost any desired result can be engineered either by restricting the set opportunistically or by choosing a functional that compensates for the lack of constraint. The selection law then loses explanatory force.

Therefore, admissibility is not a secondary matter. It is part of the core content of the theory.

Proposition 6.1.2. Necessity of Admissibility Discipline

A realization rule over an unconstrained or post hoc candidate set lacks determinate explanatory content.

Proof Sketch.
If the candidate set is unconstrained, then many incompatible realization rules can be made consistent with the same data by reselecting the domain of minimization. The rule therefore ceases to identify a physically meaningful law. ∎

6.2 Initial Admissibility Schema

6.2.1 Definition

Let C be a measurement context. The admissible class of realization channels for C, denoted 𝒜(C), is the set of all channels Φ satisfying the structural admissibility conditions listed below relative to C.

6.2.2 Domain and Codomain Convention

Unless otherwise stated, an admissible channel in context C has the form

Φ: 𝓑(𝓗ₛ ⊗ 𝓗ₐ ⊗ 𝓗ₑ) → 𝓑(𝓗ₛ ⊗ 𝓗ₐ ⊗ 𝓗ₑ)

or, in a suitably reduced formulation, a contextually appropriate equivalent codomain reflecting the same record-bearing physical process.

Remark 6.2.3

The framework does not insist that every admissible channel act on the full microscopic space in every presentation. What matters is that the chosen representation preserve the record-bearing and compositional structure relevant to the context.

6.3 Structural Admissibility Conditions

6.3.1 Purpose

The admissible class is now constrained by a first-pass list of formal conditions.

Assumption 6.3.1. CPTP Legality

If Φ ∈ 𝒜(C), then Φ is a CPTP map in the contextually relevant domain.

Assumption 6.3.2. Record-Sector Alignment

If Φ ∈ 𝒜(C), then Φ must induce output structure aligned with the candidate record sectors of C in a way that preserves the operational meaning of the record partition Πᴿ.

Assumption 6.3.3. Observer-Consistent Accessibility

If Φ ∈ 𝒜(C), then the record structure induced by Φ must be accessible in a manner consistent with the public readout structure 𝒪 of the context.

Assumption 6.3.4. Compositional Compatibility

If Φ ∈ 𝒜(C), then Φ must behave compatibly with admissible subsystem and composite descriptions under the composition rules relevant to C.

Assumption 6.3.5. Nonpathological Persistence

If Φ ∈ 𝒜(C), then the induced record must satisfy the persistence requirements of the context over the operationally relevant time window.

Remark 6.3.6

These conditions are necessary but may not be sufficient. Later chapters will revisit whether they constrain 𝒜(C) tightly enough.

6.4 Exclusion Conditions

6.4.1 Local Problem Statement

Some channels are formally legal yet physically unsuitable as candidate realized processes.

Exclusion Rule 6.4.1. Immediate Record Erasure

A channel is excluded from 𝒜(C) if it produces a putative record only to erase it immediately within the operational time window relevant to public measurement.

Exclusion Rule 6.4.2. Private Realization Structure

A channel is excluded if it induces mutually inaccessible “private realizations” incompatible with the public record requirement of the context.

Exclusion Rule 6.4.3. Subsystem Inconsistency

A channel is excluded if it yields realization assignments that conflict across admissibly related subsystem and whole-system descriptions.

Exclusion Rule 6.4.4. Basis-Rewriting Dependence

A channel is excluded if its candidacy depends only on arbitrary formal basis rewriting rather than on physically meaningful record structure.

Exclusion Rule 6.4.5. Inconsistent Downstream Records

A channel is excluded if it induces downstream record evolution incompatible with stable public outcome use in the context.

Remark 6.4.6

These exclusion rules are deliberately strong in spirit and weak in finality. They express the kinds of pathology the framework must forbid, but later chapters may need to sharpen them further.

6.5 Admissibility Under Composition

6.5.1 Local Problem Statement

Contexts compose. The admissible class must therefore interact coherently with composition.

Definition 6.5.1. Admissible Composition Principle

Let C₁ and C₂ be measurement contexts whose composition is physically meaningful. Then admissibility under composition requires that the composite context C₁₂ admit a class 𝒜(C₁₂) whose members are compatible with the record and accessibility structure inherited from C₁ and C₂.

Proposition 6.5.2. Minimal Composition Requirement

If Φ₁ ∈ 𝒜(C₁) and Φ₂ ∈ 𝒜(C₂) represent independent record-preserving processes with compatible operational settings, then the composite process Φ₁ ⊗ Φ₂ is a candidate for inclusion in 𝒜(C₁₂), subject to the composite context’s record and accessibility constraints.

Proof Sketch.
Tensor-product composition preserves CPTP legality and carries record structure forward in the independent case. Additional admissibility checks are still needed at the composite level.

Non-Overstatement Note

This is not a full closure theorem. It is only a minimal composition principle under independence and compatibility assumptions.

6.6 Admissibility Under Coarse-Graining

6.6.1 Local Problem Statement

A theory of public records must behave coherently under reduced description.

Definition 6.6.1. Coarse-Grained Admissibility

A channel Φ is coarse-grained admissible relative to context C if its induced record structure remains admissible when viewed under the context’s operational coarse-graining conventions.

Proposition 6.6.2. Stability Under Admissible Coarse-Graining

If Φ ∈ 𝒜(C) and the coarse-graining preserves the distinguishing public record content of the context, then the induced coarse-grained description remains admissible in the reduced context.

Proof Sketch.
If the coarse-graining preserves the operationally relevant record distinctions and does not collapse distinct public outcomes into ambiguity, then the core admissibility properties persist in the reduced description.

Vulnerability Note

This proposition depends on what counts as preserving “the operationally relevant record distinctions.” That notion is context-sensitive and may become a site of later technical pressure.

6.7 Locality, Nonlocality, and Composite Systems

6.7.1 Local Problem Statement

The framework must say something, however modest, about composite entangled systems and potential nonlocal structure.

Clarification 6.7.1

This volume does not claim a full relativistic treatment of realization. It also does not assume from the outset that admissibility can always be reduced to purely local channel constraints.

Assumption 6.7.2. Composite-System Legitimacy

Admissibility in entangled composite systems may depend on global record structure, provided that such dependence is explicitly represented at the level of the composite context rather than smuggled in informally.

Remark 6.7.3

This is a cautious middle position. It neither asserts naïve locality as sufficient nor embraces unconstrained nonlocality. It records the fact that entangled measurement contexts may require globally specified admissibility conditions.

Scope Note

Further analysis of this issue is deferred to later chapters and examples.

6.8 Formal Remarks on Underdetermination Risk

6.8.1 Purpose

The central danger of this chapter must be stated directly.

Remark 6.8.1. Underdetermination Risk

The admissibility schema may be too flexible if:

record alignment is not formalized sharply enough
accessibility is defined too loosely
persistence conditions are too permissive
composition rules do not exclude enough pathological channels
coarse-graining dependence leaves too much room for case-by-case adjustment

Remark 6.8.2

If this risk is not reduced later, the entire framework weakens substantially. Admissibility is therefore a pressure point rather than a settled success.

6.9 Proposition Set

6.9.1 Proposition: Nonemptiness in Standard Toy Models

Proposition 6.9.1.
In standard finite-dimensional toy measurement models with stable pointer sectors and decohering environment, the admissible class 𝒜(C) is nonempty.

Proof Sketch.
Take the canonical qubit–pointer–environment context of Chapter 5. The physically implemented measurement channel that correlates qubit basis states with stable pointer sectors and preserves public readout over the operational time window satisfies CPTP legality, record alignment, accessibility, compositional compatibility in the toy-model sense, and nonpathological persistence. Hence at least one admissible channel exists.

6.9.2 Proposition: Closure Under Convex Mixture in Restricted Cases

Proposition 6.9.2.
If Φ₁, Φ₂ ∈ 𝒜(C) and if convex mixing preserves the same record partition, accessibility structure, and persistence conditions of C, then λΦ₁ + (1 − λ)Φ₂ ∈ 𝒜(C) for 0 ≤ λ ≤ 1.

Proof Sketch.
CPTP legality is preserved by convex combination. The remaining admissibility conditions are preserved by assumption in the restricted case described.

Caution 6.9.3

This is not a general convexity theorem for 𝒜(C). Record-preserving convex closure may fail if mixing destroys distinguishability or persistence.

6.9.4 Proposition: Compatibility with Instrument Structure

Proposition 6.9.4.
If an admissible channel arises as the outcome-ignored channel of an instrument whose individual branches align with the context’s candidate record sectors and preserve public accessibility, then the instrument structure is compatible with the admissibility schema.

Proof Sketch.
The instrument decomposition provides an outcome-resolved structure consistent with the record partition, while the total CPTP map preserves the process-level legality required for admissibility.

Scope Note

This proposition shows compatibility, not equivalence. Not every admissible channel need be identified uniquely with one instrument representation.

6.10 End-of-Chapter Ledger

Established in this chapter

why admissibility is indispensable
an initial definition of 𝒜(C)
structural admissibility conditions
exclusion conditions for pathological channels
minimal composition and coarse-graining principles
limited propositions on nonemptiness, restricted closure, and instrument compatibility
a direct statement of the underdetermination risk

Conditionally established

nonemptiness in standard toy models
restricted closure statements
limited compatibility with instrument structure

Not established

that 𝒜(C) is uniquely determined by the stated principles
that admissibility is sharp enough to eliminate all pathological alternatives
any realization functional
any uniqueness of realized channel
any Born-related claim

Strongest unresolved objection

The strongest unresolved objection is that admissibility may still be insufficiently unique, leaving too much room for later selection results to inherit hidden arbitrariness.

What later chapters must supply

the abstract realization functional on 𝒜(C)
criteria for non-arbitrary functional choice
existence and uniqueness results for minimizers
non-circular Born analysis

Chapter-End Section

Strongest objection here: admissibility may still be insufficiently unique.

Referee-Risk Memo

Three most likely expert criticisms

1. Chapter 4 may still rely on a conceptual distinction between registration and realization that some interpretations reject as artificial.
Current response: the chapter treats the distinction analytically, not dogmatically, and avoids claiming necessity.
Still needing strength: later formal chapters must show that the distinction yields nontrivial formal work rather than restatement.

2. Chapter 5 may appear to leave too much freedom in record partition and operational coarse-graining.
Current response: the text acknowledges that risk and ties context to physical structure rather than private perspective.
Still needing strength: later admissibility and example chapters must make these notions sharper in practice.

3. Chapter 6 may still underdetermine the admissible class.
Current response: the chapter openly states this as the central danger and provides only limited propositions.
Still needing strength: later realization-functional chapters must avoid exploiting that flexibility, or the framework will remain vulnerable to the charge of engineered results.

PART III — THE THEORY ITSELF

Chapter 7. Axiomatic Core of Constraint-Based Realization

Chapter Summary

This chapter states the axiomatic core of Constraint-Based Realization, or CBR. It is the formal heart of the volume. The earlier chapters identified the target problem, distinguished evolution from registration and realization, and defined measurement contexts together with an initial admissibility schema. The present chapter converts that preparatory work into an explicit axiom system.

The aim here is not to prove the framework from deeper premises. It is to state the minimal internal commitments of the theory with maximum clarity. Each axiom is therefore presented as an internal postulate of the framework, not as a derivation. The chapter also discusses partial dependence relations among the axioms and records the chief vulnerability of each.

7.0 Purpose of the Chapter

The purpose of this chapter is to state, explicitly and without rhetorical inflation, the formal axioms of the theory. A framework of this kind cannot be evaluated responsibly unless the reader can identify exactly which claims are assumed rather than derived. This chapter therefore functions as the internal constitution of CBR.

7.0.1 Position Within the Book

Chapters 1–6 prepared the conceptual and structural background. Chapter 7 now states the axioms. Chapters 8–10 will build the realization functional on top of them. Chapters 11–17 will test whether these axioms support existence, consistency, uniqueness, and conditional Born compatibility.

7.0.2 Dependencies

This chapter depends on:

the distinction between evolution, registration, and realization from Chapter 4
the definition of measurement context from Chapter 5
the initial admissibility schema from Chapter 6

No later theorem is assumed here.

7.0.3 Local Problem Statement

Given a measurement context C and an admissible class 𝒜(C) of candidate record-forming channels, what minimal internal commitments must a single-outcome realization framework adopt in order to define a realization law?

7.1 Axiom A: Realization Domain

7.1.1 Motivation

A realization law cannot operate on an empty set. The framework therefore requires that each admissible context actually admit at least one candidate realization channel.

Axiom 7.1.1. Realization Domain

For every admissible measurement context C in the domain of the theory, there exists a nonempty admissible class 𝒜(C) of candidate realization channels.

Equivalently:

∀C admissible, 𝒜(C) ≠ ∅.

Remark 7.1.2

This axiom does not state that 𝒜(C) is unique, canonical, convex, compact, or algorithmically constructible in every case. It states only nonemptiness.

Formal Role

Axiom A ensures that the later realization functional has a nonempty domain on which selection may be attempted.

Scope Limitation

This axiom does not prove that admissibility is well defined. It only states that the framework presupposes such a domain for each context it treats as admissible.

7.2 Axiom B: Single Realized Channel

7.2.1 Motivation

The framework is a single-outcome proposal. That commitment must therefore appear as an explicit internal axiom.

Axiom 7.2.1. Single Realized Channel

For each individual trial in an admissible measurement context C, exactly one admissible channel Φ∗ ∈ 𝒜(C) is physically realized.

Equivalently, for each trial τ in context C, there exists a unique Φ∗ = Φ∗(τ, C) such that Φ∗ ∈ 𝒜(C) and Φ∗ is the realized channel of that trial.

Remark 7.2.2

This axiom is the framework’s core single-outcome commitment. It is not inferred from the statistics or from decoherence. It is stated as a constitutive postulate.

Clarification

The uniqueness asserted here is uniqueness of realized channel per trial, not yet uniqueness of minimizer from the abstract functional structure. Later chapters must show whether the proposed realization law supports this axiom consistently.

Strongest Objection

A critic may argue that this axiom merely restates the desired conclusion. That is partly correct. The present chapter is axiomatic. The burden of later chapters is to show whether the additional structure can support this postulate nontrivially.

7.3 Axiom C: Record Consistency

7.3.1 Motivation

A realized channel must not merely be mathematically distinguished. It must induce a stable public record.

Axiom 7.3.1. Record Consistency

If Φ∗ is the realized channel in context C, then Φ∗ induces a stable public record consistent with the record structure of C.

More precisely, the realized channel must satisfy:

alignment with one candidate record sector of C
persistence over the operational time window of C
accessibility compatible with the public readout structure of C
no contradiction among ordinary observer access routes licensed by C

Remark 7.3.2

This axiom connects the channel-level realization postulate to the physically public character of measurement outcomes. Without it, the theory could collapse into a merely private or transient actualization claim.

Scope Limitation

Axiom C does not yet specify how “alignment,” “persistence,” or “accessibility” are quantified. Those notions remain context-defined and are sharpened in later chapters.

7.4 Axiom D: Compositional Closure

7.4.1 Motivation

A realization law must behave coherently under composition, reduction, and coarse-graining. Otherwise it would assign inconsistent public outcomes across descriptive levels.

Axiom 7.4.1. Compositional Closure

Realization assignments respect physically meaningful composition and reduction. If contexts compose into a larger admissible context, or if a context is reduced under admissible coarse-graining, the realization structure must remain compatible across those related descriptions.

Informal Expansion

This axiom requires that:

subsystem and whole-system realizations do not conflict in public record content
composition of admissible contexts does not produce realization contradictions
coarse-grained public records remain compatible with finer-grained admissible descriptions, provided the coarse-graining preserves the context’s public outcome distinctions

Remark 7.4.2

This is one of the most demanding axioms in the framework. It is also one of the least negotiable. A theory that works only at one descriptive level is not robust enough for measurement theory.

Non-Overstatement Note

This axiom states a requirement. Later theorems may only verify restricted forms of it under explicit assumptions.

7.5 Axiom E: Dynamical Compatibility

7.5.1 Motivation

The framework is not introduced as a wholesale replacement for ordinary quantum dynamics.

Axiom 7.5.1. Dynamical Compatibility

The realization law supplements standard quantum evolution rather than generically replacing it. Ordinary unitary and open-system dynamics remain the predictive backbone of the theory except where the realization law is explicitly invoked at the level of admissible outcome selection.

Remark 7.5.2

This axiom is methodological and structural at once. It prevents the theory from silently importing a far more radical dynamical revision than the one it explicitly claims.

Clarification

Axiom E does not rule out that the realization law may have consequences for how measurement processes are ultimately described. It rules out treating CBR, at the level of this volume, as a general substitute for ordinary microdynamics.

7.6 Axiom F: Statistical Adequacy

7.6.1 Motivation

Any single-outcome theory that fails to recover observed frequencies in its intended domain fails immediately.

Axiom 7.6.1. Statistical Adequacy

Under repeated admissible trials in a fixed or appropriately controlled family of contexts, the realization law recovers the empirically correct statistical structure, under the conditions specified in later chapters.

Remark 7.6.2

This axiom is intentionally cautious. It does not say that the framework has already derived the Born rule. It says that statistical adequacy is an internal requirement of the theory.

Clarification

The expression “empirically correct statistical structure” is left deliberately general here because Chapter 15 distinguishes several non-equivalent senses of statistical recovery. At the axiomatic level, the theory requires adequacy; it does not yet claim maximal derivational strength.

7.7 Axiom G: Variational Ordering

7.7.1 Motivation

A single realized channel cannot be selected from a class 𝒜(C) without some internal ordering principle.

Axiom 7.7.1. Variational Ordering

For every admissible context C, there exists a realization functional ℛ꜀ defined on 𝒜(C) such that the admissible channels are ordered by ℛ꜀ for purposes of realization selection.

Remark 7.7.2

This axiom does not yet specify the exact form of ℛ꜀. It states only that the theory posits such a functional.

Formal Consequence

Axiom G is what makes the framework variational rather than merely classificatory.

Strongest Objection

A critic may say that the functional is simply a mathematical convenience, and perhaps a dangerous one. That objection is central, and Chapters 8–10 are devoted largely to addressing it.

7.8 Axiom H: Invariance Under Physically Irrelevant Relabelings

7.8.1 Motivation

A realization law should not change merely because of redescription that leaves the physical record structure unchanged.

Axiom 7.8.1. Invariance Under Physically Irrelevant Relabelings

The realization law is invariant under formal relabelings, basis rewritings, or equivalent redescriptions that do not alter the physically relevant record architecture of the measurement context.

Clarification

This axiom does not forbid all basis dependence. It forbids dependence on basis choice when that choice is not physically tied to the record structure of the context.

Remark 7.8.2

This axiom is required to prevent the realization law from being a disguised notation-dependent rule.

7.9 Discussion of Axiom Independence

7.9.1 Purpose

An axiom system is stronger if its dependencies are understood. Full independence proofs are not provided here, but some relations can be clarified.

7.9.2 Preliminary Dependence Analysis

Axiom A is foundational and not reducible to the others. If 𝒜(C) were empty, the rest of the framework would be inert.

Axiom B is not reducible to Axiom G alone. A variational ordering may exist without guaranteeing exactly one realized channel unless existence and uniqueness conditions are added. Thus the single-outcome commitment remains independently substantive.

Axiom C is not reducible to Axiom B. One could imagine a unique realized channel per trial that nevertheless fails to produce a stable public record. Record consistency therefore adds nontrivial physical content.

Axiom D is not reducible to Axiom C. Stable public records in isolated contexts do not automatically ensure coherent behavior under composition and reduction.

Axiom E may be partly methodological, but it is not redundant. It restricts the interpretive and formal reach of the theory by tying realization to supplementation rather than wholesale replacement of dynamics.

Axiom F is not implied by Axioms A–E or G–H. Statistical adequacy is an empirical constraint and must therefore be stated separately.

Axiom G is not implied by the others. The framework could have postulated a non-variational realization rule; that it chooses a variational one is a distinct commitment.

Axiom H is partly a regularity and coherence principle, but it is not trivial. It constrains both admissibility and the realization functional.

Remark 7.9.3

Some reduction relations may emerge later. For example, restricted forms of record consistency might follow from stronger admissibility and composition assumptions. But no such reduction is assumed here.

Open Question 7.9.4. Full Axiom Independence

Can the present axiom family be reduced further without loss of formal clarity or physical content?

This question is left open in this volume.

7.10 Axiom Vulnerability Matrix

Purpose

Each axiom of the framework has a motivation, a formal role, and a corresponding vulnerability. Axiom A, the realization domain axiom, is motivated by the need for a nonempty selection domain and formally provides the theory with a domain of application, but it is vulnerable to the objection that the admissible class may be underdefined. Axiom B, the single realized channel axiom, is motivated by the single-outcome commitment of the framework and formally states uniqueness of the realized channel per trial, but may be criticized as a stipulation rather than a result. Axiom C, record consistency, is motivated by the idea that public outcomes require stable records and formally connects realization to ordinary measurement practice, but the notion of a public record may be thought too dependent on context. Axiom D, compositional closure, is motivated by the need to prevent contradictions across scales and formally enforces coherence between subsystem and whole-system descriptions, but it may be difficult to satisfy in entangled or nested contexts. Axiom E, dynamical compatibility, is motivated by the desire to preserve the standard predictive backbone of quantum theory and formally limits the scope of the supplement, though it may be criticized as too conservative or merely methodological. Axiom F, statistical adequacy, is motivated by the need to recover observed frequencies and formally enforces empirical viability, but later developments may still be vulnerable to hidden Born importation. Axiom G, variational ordering, is motivated by the need for an ordering principle among admissible channels and formally introduces the realization functional, though that functional may be criticized as ad hoc. Axiom H, invariance under physically irrelevant relabelings, is motivated by the need to prevent notation-dependent laws and formally constrains both admissibility and the realization rule, though the distinction between physical and irrelevant relabeling may itself be disputed.

7.11 What Has Been Established and What Has Not

Established in this chapter

the full axiom set of CBR
the distinct role of each axiom
preliminary discussion of axiom independence
the main vulnerability associated with each axiom

Conditionally established

Nothing theorem-level about the truth of the axioms has been established. This chapter is explicitly axiomatic.

Not established

that the axioms are jointly satisfiable in all intended contexts
that the axioms uniquely determine one realization framework
that the realization functional is canonical
that the statistical adequacy axiom can be met without circularity

Strongest unresolved objection

The strongest unresolved objection is that Axiom G may introduce a realization functional that appears to encode the answer more than explain it.

What later chapters must supply

the abstract realization functional
its minimal structural requirements
a non-circularity audit
candidate concrete forms
evidence that the axioms support nontrivial theorems

Chapter-End Box

Important: axioms are not derivations.

Chapter 8. The Realization Functional in Abstract Form

Chapter Summary

This chapter introduces the realization functional ℛ꜀ in abstract form. The purpose is to state the minimal backbone of the variational law without prematurely committing to any concrete formula. The chapter explains why such a functional is introduced, defines its domain, states its minimal structural requirements, presents the abstract selection law, and discusses degeneracy, tie cases, and the distinction between abstract and concrete forms. It ends by stating plainly what is postulated here and what is deferred.

8.0 Purpose of the Chapter

The purpose of this chapter is to state the realization functional at the highest level of abstraction that still allows later theorem development. This chapter is deliberately minimalist. It does not yet claim a canonical formula. It claims only that if the theory is variational, then it must posit a functional with certain structural properties.

8.0.1 Position Within the Book

Chapter 7 stated Axiom G, which posits a realization ordering. Chapter 8 now gives that ordering abstract form. Chapter 9 will present provisional concrete candidates. Chapter 10 will seek a more information-theoretic and potentially more canonical reformulation.

8.1 Why a Realization Functional Is Introduced

8.1.1 Local Problem Statement

Why does the theory need a functional at all?

Argument 8.1.2

If one accepts Axiom B, then exactly one admissible channel is realized per trial. If one also accepts that 𝒜(C) may contain multiple candidate channels, then some internal principle must distinguish among them. One option would be a direct rule with no ordering structure. The present framework instead introduces a variational ordering because such an approach:

allows explicit comparison among candidates
supports existence and uniqueness analysis
makes invariance and composition constraints easier to formulate
offers a path toward possible canonical reformulation

Remark 8.1.3

The choice of variational language is a substantive theoretical decision. It is not forced by logic alone.

8.2 Abstract Definition

Definition 8.2.1. Realization Functional

For each admissible measurement context C, a realization functional is a map

ℛ꜀: 𝒜(C) → ℝ ∪ {+∞}

that assigns to each admissible realization channel Φ ∈ 𝒜(C) a value used to order candidates for realization.

Remark 8.2.2

The codomain includes +∞ to allow the framework to treat certain channels as effectively disfavored even after admissibility has already been restricted, provided this is done in a non-redundant and non-arbitrary way.

Definition 8.2.3. Physical Equivalence Class

Two admissible channels Φ and Ψ are physically equivalent in context C if they differ only by redescription that leaves all physically relevant public record structure of C unchanged.

Remark 8.2.4

The realization functional should either assign equal value to physically equivalent channels or treat them as members of one equivalence class for purposes of minimization.

8.3 Minimal Structural Requirements on ℛ

Purpose

The theory must say more than “some functional exists.” It must state what kind of functional could plausibly serve the role.

Assumption 8.3.1. Bounded Below

For each admissible context C, ℛ꜀ is bounded below on 𝒜(C).

Assumption 8.3.2. Lower Semicontinuity

ℛ꜀ is lower semicontinuous on 𝒜(C) with respect to the topology used in the later variational arguments.

Assumption 8.3.3. Invariance Under Irrelevant Relabeling

If Φ and Ψ are physically equivalent in context C, then ℛ꜀(Φ) = ℛ꜀(Ψ), or equivalently the functional descends to equivalence classes.

Assumption 8.3.4. Compatibility with Composition

The behavior of ℛ꜀ under composition of independent or compatibly related contexts must be consistent with the compositional demands of Axiom D.

Assumption 8.3.5. Monotonic Sensitivity to Record Degradation

If one admissible channel is identical to another except that its public record structure is less stable, less accessible, or more compositionally defective in the physically relevant sense of the context, then ℛ꜀ should not assign it a more favorable realization value.

Assumption 8.3.6. Context Dependence Only Through Physical Structure

The dependence of ℛ꜀ on context C must enter only through the physically relevant structure of the context, not through arbitrary redescriptive choices.

Remark 8.3.7

These conditions still leave substantial freedom. That is both a strength and a danger: a strength because the framework is not prematurely overfitted, and a danger because too much freedom may make the theory underdetermined.

8.4 Selection Law

Axiom-Compatible Selection Rule 8.4.1

Given context C and realization functional ℛ꜀, the realized channel Φ∗ is selected by

Φ∗ = arg min {ℛ꜀(Φ) : Φ ∈ 𝒜(C)}

provided the minimizer exists.

Remark 8.4.2

This is the central variational law of the framework. It is not yet a theorem. It is the operational form taken by Axiom G together with Axiom B.

Clarification

The notation “arg min” is used here in the ordinary mathematical sense: the set, or in the unique case the element, of admissible channels at which ℛ꜀ attains its minimum.

Non-Circularity Audit

The selection law is nontrivial only if all three of the following are true:

𝒜(C) is not chosen to make the minimizer obvious by construction.
ℛ꜀ is not built in such a way that the desired outcome law has already been inserted into its architecture.
the minimization is not vacuous because every admissible channel receives essentially the same value.

If these conditions fail, the theory loses explanatory force.

8.5 Degeneracy and Tie Cases

Local Problem Statement

What happens if there are multiple minimizers?

Possibility 8.5.1. Degeneracy Forbidden by Stronger Assumptions

One route is to impose stronger assumptions, such as strict convexity or appropriate nondegeneracy, so that minimizers are unique up to physical equivalence.

Possibility 8.5.2. Degeneracy Broken by Refinement

A second route is to refine either the admissibility class or the physical equivalence relation until the tie disappears.

Possibility 8.5.3. Degeneracy Left Open

A third route is to leave certain degeneracies explicit and treat them as unresolved in the present framework.

Remark 8.5.4

This volume does not assume that all tie cases are already eliminated. Later uniqueness results will therefore be conditional.

Strongest Objection

A critic may argue that a single-outcome theory cannot tolerate unresolved degeneracy.

Response.
That objection has force. The framework can survive only if later chapters show either that physically relevant degeneracy is absent under plausible conditions or that the remaining degeneracy is merely representational.

8.6 Abstract Versus Concrete Forms

Definition 8.6.1. Abstract Realization Functional

An abstract realization functional is the minimal structural object specified only by domain, codomain, and formal properties such as boundedness, lower semicontinuity, invariance, and compositional compatibility.

Definition 8.6.2. Concrete Realization Functional

A concrete realization functional is a specific formula or parametrized family of formulas proposed to implement the abstract role of ℛ꜀.

Remark 8.6.3

The abstract form is the theory’s minimal backbone. Concrete forms are implementations. They do not become canonical merely by being written down.

Clarification

Later concrete candidates must earn their place by satisfying the abstract conditions while reducing arbitrariness rather than increasing it.

8.7 What Is Postulated and What Is Deferred

Blunt Status Statement 8.7.1

Postulated in this chapter:

that each admissible context carries a realization functional
that the realized channel is selected by minimization over 𝒜(C)
that the functional satisfies the abstract regularity and invariance conditions stated here

Deferred from this chapter:

any proof that the realization functional is unique or canonical
any proof that one concrete family is forced
any proof that minimizers always exist
any proof that minimizers are unique
any proof of Born compatibility

Remark 8.7.2

The framework is strongest when it is explicit about what remains postulated.

8.8 What Has Been Established and What Has Not

Established in this chapter

the abstract definition of the realization functional
its minimal structural requirements
the abstract selection law
the formal treatment of tie cases
the distinction between abstract and concrete implementations
a blunt separation of postulate and deferral

Conditionally established

Nothing theorem-level about existence or uniqueness has yet been proved here.

Not established

that the functional is non-arbitrary
that the abstract conditions determine a unique family
that degeneracy is absent
that the variational law yields empirical adequacy

Strongest unresolved objection

The strongest unresolved objection is that the theory may remain empty if many inequivalent functionals satisfy the same abstract constraints.

What later chapters must supply

concrete candidates
criteria of non-arbitrariness
stronger reformulation in more canonical terms
later existence and uniqueness theorems

Chapter-End Section

What would make this empty?
If many inequivalent realization functionals satisfy the same constraints without further discrimination, the abstract theory would remain underdetermined.

Chapter 9. Concrete Candidate Forms for the Realization Functional

Chapter Summary

This chapter introduces provisional concrete forms for the realization functional. It does so cautiously. The point is not to declare a final formula, but to show what a concrete realization functional would need to look like if it is to encode public record quality, accessibility, and compositional coherence in operational terms. The chapter also explains why hand-built functionals are dangerous and states the criteria any more canonical replacement must meet.

9.0 Purpose of the Chapter

The purpose of this chapter is to move from the abstract realization functional of Chapter 8 to provisional concrete implementations. Without some concrete form, the theory has too little operational substance to be tested formally. But without caution, a concrete form becomes the easiest place to hide arbitrariness. This chapter therefore proceeds under explicit warning.

9.1 Why a Concrete Form Is Needed

Local Problem Statement

An abstract variational principle is not yet enough to support actual theorem development or model evaluation.

Argument 9.1.1

A concrete functional is needed because the framework eventually must answer questions such as:

how candidate channels are compared in practice
how record stability enters the ordering
how accessibility and intersubjective consistency are encoded
how composition affects comparative favorability
what mathematical regularity the functional possesses

Remark 9.1.2

Concrete substance is necessary, but concreteness alone is not a virtue. An arbitrary formula can weaken the theory rather than strengthen it.

9.2 Multi-Term Provisional Construction

Purpose

The following construction is presented as provisional only.

Definition 9.2.1. Provisional Multi-Term Functional

Let C be a context and Φ ∈ 𝒜(C). A provisional concrete realization functional may be written schematically as

ℛ꜀(Φ) = αS꜀(Φ) + βA꜀(Φ) + γK꜀(Φ) + δM꜀(Φ),

where:

S꜀(Φ) is a record-stability cost term
A꜀(Φ) is an accessibility or intersubjectivity term
K꜀(Φ) is a coherence-penalty or incompatibility term
M꜀(Φ) is a compositional mismatch term
α, β, γ, δ are nonnegative weighting constants or context-dependent coefficients, if later justified

Definition 9.2.2. Record-Stability Cost

S꜀(Φ) is intended to measure the degree to which the public record induced by Φ fails to exhibit the persistence, distinguishability, and resilience required by C.

Definition 9.2.3. Accessibility Term

A꜀(Φ) is intended to measure the degree to which the record induced by Φ fails to support intersubjectively accessible public output structure.

Definition 9.2.4. Coherence Penalty or Incompatibility Term

K꜀(Φ) is intended to penalize channels whose record structure remains insufficiently classically stabilized, or whose candidate outcome architecture remains incompatible with the public record standards of C.

Definition 9.2.5. Compositional Mismatch Term

M꜀(Φ) is intended to measure incompatibility between the realization structure induced by Φ and the compositional constraints of the context.

Non-Overstatement Note

These definitions are schematic. They do not yet specify exact formulas. Their role is to identify the kinds of physical burdens a concrete functional must bear.

9.3 Mathematical Constraints on Acceptable Terms

Purpose

Each provisional term must meet formal standards.

Requirement 9.3.1. Operational Interpretability

Each term must correspond to a physically interpretable feature of the context and its records. A mathematically elegant term with no operational meaning is not sufficient.

Requirement 9.3.2. Compositional Behavior

Each term must behave coherently under admissible composition and coarse-graining.

Requirement 9.3.3. Invariance Requirements

Each term must be invariant under physically irrelevant relabeling and should depend only on context-relevant physical structure.

Requirement 9.3.4. Non-Arbitrariness

Each term must be justifiable independently of the outcome law the framework later hopes to recover.

Remark 9.3.5

Requirement 9.3.4 is especially severe. It is very easy to write a term that “looks right” and very hard to show that it is not merely engineered.

9.4 Relative Weighting Problem

Local Problem Statement

If ℛ꜀ is multi-term, what determines the weights?

Possibility 9.4.1. Weights Fixed by Principle

The strongest possibility is that α, β, γ, δ are fixed by deeper invariance, scaling, or canonicality conditions.

Possibility 9.4.2. Weights as Free Parameters

A weaker possibility is that the weights are free or partially free parameters. This increases flexibility but also increases the risk of underdetermination.

Possibility 9.4.3. Weights Eliminable in Later Reformulation

A third possibility is that the multi-term form is only a temporary scaffold and that later reformulation, for example through a divergence-based canonical family, eliminates explicit weighting.

Remark 9.4.4

At the level of the present chapter, no claim is made that the weights are already fixed by principle.

Strongest Objection

A critic may say that any weighted sum of physically appealing terms is just a sophisticated fit function.

Response.
That objection is entirely legitimate. The present chapter accepts it as a real danger rather than denying it.

9.5 Why Hand-Built Functionals Are a Danger

Purpose

The central criticism of the chapter is stated before critics can state it.

Caution 9.5.1

A hand-built functional is dangerous for at least four reasons:

it may encode the intended result in disguised form
it may contain weights that are not independently justified
it may privilege one class of examples while failing in others
it may create an illusion of derivation where only design has occurred

Proposition 9.5.2. Risk of Engineered Adequacy

If a concrete realization functional is assembled from context-sensitive terms without strong independent constraints, then apparent explanatory success may be indistinguishable from engineered adequacy.

Proof Sketch.
A flexible enough functional family can often be tuned to reproduce desired outcomes or desired structural regularities. Without independent restrictions, success under selected examples fails to distinguish law from construction.

Remark 9.5.3

This proposition is methodological, but its force is real. It is one of the reasons the next chapter seeks a more canonical reformulation.

9.6 Criteria for Replacing Provisional Forms

Purpose

If the present chapter’s constructions are provisional, the theory must say what a better replacement would need to achieve.

Criterion 9.6.1. Reduced Parameter Arbitrariness

A more canonical form should reduce or eliminate adjustable weights not fixed by principle.

Criterion 9.6.2. Standard Mathematical Pedigree

A more canonical form should connect to a recognized mathematical comparison framework rather than relying on bespoke terms wherever possible.

Criterion 9.6.3. Better Variational Behavior

A replacement should improve analytic properties relevant to existence, lower semicontinuity, convexity, or uniqueness.

Criterion 9.6.4. Cleaner Non-Circularity Profile

A replacement should make it easier to identify whether the desired statistical structure is being imported or genuinely constrained.

Criterion 9.6.5. Operational Interpretability

A replacement must still preserve a clear connection to record structure, accessibility, and compositional demands.

9.7 What Has Been Established and What Has Not

Established in this chapter

why a concrete functional is needed
a provisional multi-term schema
formal constraints on acceptable terms
the weighting problem
the dangers of hand-built functionals
criteria for replacement by more canonical forms

Conditionally established

Only methodological and structural propositions have been established here.

Not established

any final concrete formula
any principled weight assignment
any proof that the multi-term family is canonical
any uniqueness or Born-related result

Strongest unresolved objection

The strongest unresolved objection is that the provisional family may still be too engineered to count as explanatory.

What later chapters must supply

a more canonical reformulation
stronger connection to standard information-theoretic quantities
a sharper non-circularity audit

Chapter-End Box

Status: this chapter presents candidate concrete realizations, not yet their final derivation.

Chapter 10. Relative-Entropy and Information-Theoretic Reformulation

Chapter Summary

This chapter attempts to strengthen the theory by reformulating the realization functional in information-theoretic terms. The central idea is to move from ad hoc multi-term constructions toward a restricted family of divergence-based functionals on Choi representations of admissible channels. The chapter explains why such a move is attractive, introduces the basic formal candidate family, discusses alternative divergences, and states a candidate theorem describing when the realization measure may be forced into a restricted divergence class. The chapter also includes a direct circularity warning and ends by distinguishing what has genuinely been established from what remains only motivated.

10.0 Purpose of the Chapter

The purpose of this chapter is to reduce arbitrariness. If the theory is to become more than a carefully designed variational scheme, it needs a narrower mathematical family for the realization functional. Relative-entropy-type constructions are attractive because they combine standard mathematical pedigree with favorable variational behavior. But attraction is not proof of necessity, and the chapter is written accordingly.

10.1 Why Seek a Canonical Form

Local Problem Statement

Why move beyond the provisional multi-term form?

Argument 10.1.1

Ad hoc functionals are weak because:

they often contain unjustified weights
they may not behave uniformly under composition
they can hide the intended answer in the term structure
they rarely support strong uniqueness claims

A more canonical form is therefore desirable if the framework is to become mathematically serious.

Remark 10.1.2

“Canonical” here means more tightly constrained by standard principles, not metaphysically final.

10.2 Choi-State Encoding of Candidate Channels

Purpose

To compare channels using divergence-style quantities, a channel representation as positive operators is convenient.

Definition 10.2.1. Normalized Choi Encoding

Let Φ ∈ 𝒜(C) be a channel from 𝓑(𝓗ᵢₙ) to 𝓑(𝓗ₒᵤₜ). Let J(Φ) denote its Choi operator. Define a normalized Choi representation

Ĉ(Φ) = J(Φ) / dᵢₙ,

where dᵢₙ = dim(𝓗ᵢₙ).

Then Ĉ(Φ) is a density-operator-like object on 𝓗ᵢₙ ⊗ 𝓗ₒᵤₜ satisfying linear trace constraints inherited from channel structure.

Remark 10.2.2

The normalization is chosen so that Ĉ(Φ) can be compared using familiar state-divergence machinery. The representation remains formal and does not by itself settle physical ontology.

10.3 Relative-Entropy-Type Candidates

Purpose

A divergence-based realization measure is now introduced.

Definition 10.3.1. Reference Family

Let ℛef(C) denote a context-dependent reference family of admissible channel representations encoding the structural constraints of C at the level of Choi objects.

Definition 10.3.2. Divergence-Based Realization Functional

A divergence-based realization functional may take the form

ℛ꜀(Φ) = inf {Δ(Ĉ(Φ), X) : X ∈ ℛef(C)}

where Δ is a divergence measure, such as quantum relative entropy or another admissible member of a restricted divergence family.

Example 10.3.3. Relative-Entropy-Type Candidate

One candidate is

ℛ꜀(Φ) = inf {D(Ĉ(Φ) ∥ X) : X ∈ ℛef(C)}

provided the support conditions for D are satisfied.

Remark 10.3.4

The reference family ℛef(C) is not arbitrary decoration. It is where contextual structural constraints are represented at the comparison level. The meaning of the theory therefore depends crucially on how this family is defined.

10.4 Why This Family Is Attractive

Property 10.4.1. Convexity-Friendly Structure

Relative-entropy-type quantities often interact well with convex analysis and support lower semicontinuity or related regularity properties useful in minimization arguments.

Property 10.4.2. Monotonicity

Many divergence measures satisfy monotonicity under CPTP maps, making them attractive where coarse-graining and information loss should not increase distinguishability in the relevant sense.

Property 10.4.3. Operational Meaning

Relative entropy and related divergences have established interpretations in state discrimination, information loss, or distinguishability. This gives them more mathematical credibility than bespoke cost terms.

Property 10.4.4. Information-Theoretic Pedigree

A standard information-theoretic pedigree is not a proof of relevance, but it makes the candidate family more disciplined and more comparable to established quantum-information structures.

Remark 10.4.5

These are reasons for interest, not reasons for final acceptance.

10.5 Candidate Theorem: Admissible Canonical Form Under Stated Conditions

Purpose

A fully general canonical theorem is not proved here, but a candidate restricted theorem can be stated.

Theorem 10.5.1. Candidate Restricted Divergence Theorem

Suppose a realization functional ℛ꜀ on 𝒜(C) satisfies the following conditions in a finite-dimensional setting:

ℛ꜀ depends on Φ only through a normalized Choi representation Ĉ(Φ) and the context’s physically admissible reference structure.
ℛ꜀ is lower semicontinuous.
ℛ꜀ is invariant under physically irrelevant channel relabelings.
ℛ꜀ is monotone under admissible coarse-graining in the sense required by the context.
ℛ꜀ is convex in the channel argument, up to physically irrelevant equivalence.
ℛ꜀ vanishes precisely on a designated family of structurally ideal admissible realizers.

Then ℛ꜀ belongs, under these restrictions, to a narrowed divergence-type comparison class between Ĉ(Φ) and the reference family ℛef(C).

Proof Status

This theorem is stated as a candidate structural theorem and not as a fully general proved result in this volume.

Proof Sketch

The conditions exclude large classes of arbitrary bespoke functionals by forcing ℛ꜀ to behave like a comparison measure between a candidate channel representation and a structurally ideal reference family. Lower semicontinuity and convexity restrict the analytic form; invariance removes notation-dependent freedom; monotonicity under admissible coarse-graining aligns the functional with information-loss structure. These collectively narrow the admissible family toward divergence-type measures. A full uniqueness theorem is not claimed here.

Non-Overstatement Note

The theorem does not prove that relative entropy itself is uniquely forced. It only motivates a restricted divergence family under stated assumptions.

10.6 Alternative Divergences and Competing Families

Purpose

A serious treatment must acknowledge nearby alternatives.

Alternative 10.6.1. Rényi-Type Divergences

Rényi-type divergences may offer tunable families with different analytic properties. Their strength is flexibility; their weakness is that additional parameters can reintroduce arbitrariness.

Alternative 10.6.2. f-Divergences

Quantum f-divergence families provide broader comparison classes and may preserve certain monotonicity or convexity properties. They are mathematically natural competitors.

Alternative 10.6.3. Bregman-Type or Other Convex-Analytic Measures

Depending on the exact optimization structure, other convex-analytic discrepancy measures may be relevant.

Remark 10.6.4

The existence of these alternatives is precisely why the chapter does not overclaim canonical uniqueness.

10.7 Circularity Warning

Purpose

This section is essential.

Warning 10.7.1

A divergence-based realization functional may still import the desired answer if:

the reference family ℛef(C) is chosen in a Born-compatible way from the outset
the admissibility conditions already privilege the channels later declared optimal
the divergence family is selected because it reproduces the desired statistics rather than because it is independently forced
the normalization and comparison structure quietly encode the outcome law they later appear to justify

Non-Circularity Audit 10.7.2

What this chapter claims:

that divergence-based reformulation is more disciplined than a freely weighted multi-term functional
that relative-entropy-type families are attractive candidates
that a restricted theorem may narrow the family under strong assumptions

Where circularity could enter:

in the definition of the reference family
in the admissibility constraints
in the choice of divergence family
in the interpretation of vanishing or minimality conditions

What has been ruled out:

only the crudest forms of unstructured arbitrariness

What remains vulnerable:

hidden Born importation
hidden preferred-structure importation
overstatement of “canonicality”

Remark 10.7.3

This audit is not a weakness of the chapter. It is a necessary part of its honesty.

10.8 What This Chapter Genuinely Establishes

Established in this chapter

why the theory seeks a more canonical reformulation
how channels can be encoded through normalized Choi objects
a divergence-based candidate family for ℛ꜀
reasons this family is mathematically attractive
a candidate restricted theorem narrowing the admissible family
acknowledgment of competing divergence families
an explicit circularity warning

Conditionally established

only a restricted and not fully proved narrowing toward divergence-type families
no uniqueness of relative entropy itself

Not established

that relative entropy is uniquely canonical
that the reference family can be defined without hidden importation
that the reformulation fully removes arbitrariness
any Born-related theorem beyond preparatory structure

Strongest unresolved objection

The strongest unresolved objection is that even a divergence-based functional may still hide the desired outcome law in the choice of reference structure.

What later chapters must supply

existence results for minimizers under this family
uniqueness conditions
direct Born-analysis under explicit assumptions
sharper comparison between divergence choices

Chapter-End Table

There are several candidate forms for the realization functional, each with distinct motivations, strengths, and weaknesses. A weighted multi-term functional is motivated by the desire to encode record stability, accessibility, and composition burdens directly into the functional. Its strength is intuitive transparency, since one can see what each term is supposed to represent, but its weakness is high arbitrariness because the choice of terms and weights may be engineered. A relative-entropy-to-reference-family construction is motivated by the use of a standard information-theoretic comparison between a candidate channel and a structured reference family. Its strengths are favorable regularity properties, monotonicity, and established mathematical pedigree, but its weakness is that the reference family may already hide the desired answer. A Rényi-type divergence family is motivated as a flexible generalization of relative entropy. Its strength is adjustable analytic behavior, but that same flexibility is also its weakness because the extra parameter can undermine claims of canonicality. An f-divergence family is motivated by broader comparison theory. Its strength is mathematical generality, but its weakness is that it may be too broad to constrain the theory usefully without further restriction. Other convex discrepancy measures may be motivated by analytic convenience or tailored variational control, and while they may offer technical advantages, they are especially vulnerable to the criticism that they are bespoke redesigns rather than principled necessities.

Referee-Risk Memo

Three most likely expert criticisms

1. The axioms may still look like a restatement of the framework’s desired outcome rather than a justified foundation.
Current response: Chapter 7 is explicit that axioms are postulates, not derivations.
What still needs strengthening: later chapters must show that the axioms support nontrivial formal consequences and do not merely redescribe the target.

2. The abstract realization functional may be too unconstrained, leaving the theory empty.
Current response: Chapter 8 states this risk directly and makes it the chapter’s central warning.
What still needs strengthening: the later theorem chapters must demonstrate that admissibility plus functional structure significantly narrow the space.

3. The information-theoretic reformulation may still smuggle in Born-compatible structure through the reference family or divergence choice.
Current response: Chapter 10 includes an explicit non-circularity audit and avoids claiming canonical uniqueness.
What still needs strengthening: the Born-analysis chapters must confront this risk directly and in detail.

PART IV — CORE MATHEMATICAL RESULTS

Chapter 11. Existence of Admissible Realization Channels

Chapter Summary

This chapter addresses the first mathematical question any variational realization theory must answer: does the admissible class 𝒜(C) exist in nontrivial contexts at all? If the admissible class is empty, then the entire framework collapses before the realization functional is ever applied. The chapter therefore begins by stating the existence problem precisely, then proves existence in standard finite-dimensional toy models, states a more general conditional proposition under explicit assumptions, and records the limits of what these results establish. The chapter concludes by relating the admissibility existence question to standard measurement models already familiar from textbook quantum theory.

The scope is deliberately conservative. The chapter establishes nonemptiness under controlled assumptions; it does not establish uniqueness of admissible channels, canonicality of the admissible class, or correctness of any particular selected channel.

11.0 Purpose of the Chapter

The purpose of this chapter is to show that the framework is not vacuous at the level of its admissible domain. Earlier chapters defined a measurement context C, introduced record sectors, and proposed the admissible class 𝒜(C) as the domain on which the realization functional acts. The present chapter asks whether that class is nonempty in mathematically and physically recognizable situations.

This is the first minimal consistency check on the theory.

11.0.1 Position Within the Book

Chapters 7–10 stated the axioms, introduced the abstract realization functional, and discussed provisional and divergence-based candidate forms. Chapter 11 now begins the actual theorem-bearing part of the theory by addressing nonemptiness of the admissible domain. Chapter 12 will then ask whether the realization functional attains a minimum on that domain. Chapters 13 and 14 will study consistency, invariance, and conditional uniqueness.

11.0.2 Dependencies

This chapter depends on:

the definition of measurement context from Chapter 5
the admissibility schema from Chapter 6
the axioms stated in Chapter 7
the process-level formalism from Chapter 3

Unless stated otherwise, all results are finite-dimensional.

11.1 Statement of Existence Problem

11.1.1 Local Problem Statement

Given a measurement context C, does the admissible class 𝒜(C) contain at least one channel satisfying the structural and exclusion conditions imposed by the framework?

Definition 11.1.1. Existence Problem for Admissible Channels

For a measurement context C, the existence problem asks whether there exists at least one channel Φ such that Φ ∈ 𝒜(C).

Equivalently, the question is whether

𝒜(C) ≠ ∅.

Remark 11.1.2

This is not a trivial question. The admissibility conditions combine several demands:

CPTP legality
record-sector alignment
public accessibility
compositional compatibility
nonpathological persistence
exclusion of immediate erasure, private realization structures, and basis-rewriting pathologies

It is therefore not automatic that a physically familiar measurement process will satisfy all of them simultaneously.

Why This Matters

If 𝒜(C) is empty even in standard examples, then the framework is too restrictive to function. If 𝒜(C) is nonempty only in contrived examples, then the theory lacks contact with ordinary measurement. The present chapter therefore aims first at standard measurement models and only then at a more general conditional proposition.

11.2 Toy-Model Existence

11.2.1 Purpose

The first step is to show nonemptiness in canonical finite-dimensional examples.

Definition 11.2.1. Canonical Two-Outcome Measurement Model

Let C₀ be the context defined by:

𝓗ₛ = ℂ²
𝓗ₐ containing two macroscopically distinguishable pointer sectors P₀ and P₁
𝓗ₑ finite-dimensional
initial state ρ₀ = ρₛ ⊗ ρₐ ⊗ ρₑ
record partition Πᴿ = {R₀, R₁}, where Rᵢ corresponds to pointer–environment structures associated with outcome i
readout structure 𝒪 = {0, 1}
operational setting Σ specifying a persistence window [t₀, t₁] and ordinary retrieval procedures

Assume there exists a unitary U on 𝓗ₛ ⊗ 𝓗ₐ ⊗ 𝓗ₑ such that:

basis state |0⟩ₛ is correlated with record sector R₀
basis state |1⟩ₛ is correlated with record sector R₁
environmental coupling suppresses interference between the two sectors over [t₀, t₁]
the pointer sectors remain operationally distinguishable throughout [t₀, t₁]

Define the channel Φᵤ by

Φᵤ(X) = UXU†.

Proposition 11.2.2. Toy-Model Nonemptiness

Under the assumptions of Definition 11.2.1, Φᵤ ∈ 𝒜(C₀). In particular, 𝒜(C₀) ≠ ∅.

Proof

We verify the admissibility conditions one by one.

First, Φᵤ is CPTP because it is unitary conjugation.

Second, by construction, U correlates the system basis states with the designated record sectors R₀ and R₁. Hence the resulting process is aligned with the record partition Πᴿ.

Third, the operational setting stipulates that the record sectors remain accessible through the readout structure 𝒪 over the interval [t₀, t₁]. Hence observer-consistent accessibility holds in the sense required by the context.

Fourth, persistence over [t₀, t₁] is assumed. Therefore the induced record is nonpathological with respect to immediate erasure.

Fifth, in this toy model, no subsystem inconsistency is introduced: the same public record structure is recovered from the pointer apparatus and from the coarse-grained pointer–environment record sector.

Sixth, the construction depends on the physically specified pointer sectors and not on arbitrary basis rewriting. Hence the basis-rewriting exclusion does not apply.

Therefore Φᵤ satisfies the structural admissibility conditions and avoids the listed exclusion conditions. Hence Φᵤ ∈ 𝒜(C₀), and therefore 𝒜(C₀) ≠ ∅.

Remark 11.2.3

This proposition is intentionally modest. It shows only that the admissibility schema does not immediately exclude standard finite-dimensional measurement models.

11.2.2 Standard Instrument Example

Definition 11.2.4. Outcome-Resolved Instrument Model

Let {𝓘₀, 𝓘₁} be an instrument on 𝓑(𝓗ₛ) such that:

each 𝓘ᵢ is completely positive and trace-nonincreasing
Φ = 𝓘₀ + 𝓘₁ is CPTP
each branch 𝓘ᵢ is physically implemented by coupling to a pointer apparatus sector associated with record class Rᵢ
those sectors are persistent and publicly accessible over the context’s operational interval

Proposition 11.2.5. Instrument-Based Nonemptiness

Under the assumptions of Definition 11.2.4, the outcome-ignored channel Φ belongs to 𝒜(C) for the corresponding instrument-induced context C.

Proof Sketch

CPTP legality holds by construction. Record alignment holds because each branch is tied to a designated record sector. Public accessibility and persistence are assumed in the physical implementation of the instrument. If the instrument branches respect the coarse-grained public record structure of the context, then the exclusion conditions are avoided. Hence Φ ∈ 𝒜(C).

Remark 11.2.6

This proposition relates admissibility to familiar instrument models used in quantum measurement theory. It is important because it shows that 𝒜(C) is not detached from standard practice.

11.3 General Existence Under Stated Assumptions

11.3.1 Purpose

Toy models show that the framework is not empty in simple examples. A more general statement is now needed.

Assumption 11.3.1. Context Realizability Assumptions

Let C = (𝓗ₛ, 𝓗ₐ, 𝓗ₑ, ρ₀, Πᴿ, 𝒪, Σ) be a finite-dimensional measurement context. Assume:

Physical implementability: there exists at least one CPTP process Φ₀ compatible with the physical interaction structure of C.
Record realizability: Πᴿ corresponds to a family of physically distinguishable, persistent, retrievable record sectors under Φ₀.
Accessibility coherence: the readout structure 𝒪 is consistent with the induced record sectors under Φ₀.
Compositional coherence: no contradiction arises between the record structure of C and the reduced or coarse-grained descriptions licensed by Σ.
Nonpathology: Φ₀ does not immediately erase the record, create incompatible private realizations, or depend on arbitrary basis rewriting for its identity.

Proposition 11.3.2. General Nonemptiness Under Realizability Assumptions

If C satisfies Assumption 11.3.1, then 𝒜(C) ≠ ∅.

Proof

By Assumption 11.3.1(1), there exists a CPTP process Φ₀ compatible with the physical interaction structure of C.

By Assumption 11.3.1(2), the record partition Πᴿ is realized under Φ₀ by physically distinguishable and persistent record sectors.

By Assumption 11.3.1(3), these record sectors support the public readout structure 𝒪 required by the context.

By Assumption 11.3.1(4), the process is consistent with the compositional and coarse-graining requirements imposed by the framework.

By Assumption 11.3.1(5), the exclusion conditions listed in Chapter 6 do not eliminate Φ₀.

Therefore Φ₀ satisfies the structural admissibility conditions and avoids the exclusion rules. Hence Φ₀ ∈ 𝒜(C), so 𝒜(C) ≠ ∅.

Remark 11.3.3

The theorem is conditional because it pushes the real burden into Assumption 11.3.1. This is appropriate. The theorem does not create admissibility out of thin air. It says that if a context already supports a physically coherent record-bearing process of the required type, then the framework recognizes that process as admissible.

Interpretation

The proposition is best read as a consistency theorem for the admissibility schema, not as a deep constructive theorem. It shows that the framework is compatible with a broad class of physically ordinary finite-dimensional measurement contexts.

11.4 Limits of Existence Results

11.4.1 Purpose

Existence claims in foundational work become misleading if their limits are not stated.

Limit 11.4.1. Dependence on Context Realizability

The general proposition does not establish that every formally specifiable context is admissible. It applies only to contexts that satisfy the realizability assumptions.

Limit 11.4.2. No Infinite-Dimensional Generality

This chapter does not prove nonemptiness for arbitrary infinite-dimensional settings, field-theoretic measurement models, or relativistic measurement contexts.

Limit 11.4.3. No Canonicality of Record Partition

The existence result assumes that the record partition Πᴿ is already physically coherent. It does not prove that Πᴿ is uniquely selected by deeper principles.

Limit 11.4.4. No Uniqueness of Admissible Channels

Even when 𝒜(C) is nonempty, there may be many admissible channels.

Limit 11.4.5. No Realization Selection Yet

Existence of admissible channels does not yet imply that the realization functional has a minimizer, nor that a unique realized channel can be extracted.

Strongest Objection

A critic may say that Assumption 11.3.1 is too strong and effectively bakes admissibility into the theorem.

Response.
That criticism is fair if the theorem is overstated. It is not fair if the theorem is read as intended: a controlled nonemptiness result showing that the admissibility schema is compatible with physically ordinary measurement contexts once their record structure is coherent.

11.5 Relation to Standard Measurement Models

Purpose

The existence results should be tied explicitly to familiar quantum measurement theory.

Discussion 11.5.1

Standard textbook measurement models typically begin with:

a system observable or POVM
an apparatus with distinguishable pointer states
an interaction coupling system and apparatus
often an environment producing decoherence or effective irreversibility

Such models already contain much of the raw material needed by the present framework. What CBR adds is not the basic measurement structure but a formal selection domain over process-level channels aligned with public record formation.

Remark 11.5.2

The significance of the present chapter is therefore not that it creates new measurement models, but that it shows how standard models can populate the admissible domain.

Chapter-End Ledger

Established in this chapter

the admissibility existence problem has been stated precisely
nonemptiness has been proved in canonical finite-dimensional toy models
a general conditional nonemptiness proposition has been proved under explicit realizability assumptions
the limits of these results have been stated
the relation to standard measurement models has been clarified

Conditionally established

nonemptiness of 𝒜(C) in finite-dimensional contexts satisfying Assumption 11.3.1

Not established

that the selected channel is unique
that the selected channel is correct
that admissibility is canonical
that every physically interesting context is admissible

Strongest unresolved objection

the realizability assumptions may still be too close to what the theorem seeks to secure

What later chapters must supply

existence of minimizers
consistency and invariance of realization assignments
conditional uniqueness results

Chapter-End Section

What this does not establish: that the selected channel is unique or correct.

Chapter 12. Existence of Minimizers

Chapter Summary

This chapter addresses the next step in the variational program. Even if the admissible class 𝒜(C) is nonempty, the realization law remains empty unless the realization functional ℛ꜀ attains a minimum on that class. The chapter states the variational setting carefully, proves a main existence theorem under standard compactness-type and lower-semicontinuity assumptions, gives a readable proof sketch, interprets the result, and then analyzes how fragile the theorem is with respect to its assumptions.

The chapter is intentionally conservative. Existence of a minimizer is not uniqueness, not canonicity, and not yet empirical adequacy. It is only the first theorem showing that the proposed realization rule is mathematically implementable under stated conditions.

12.0 Purpose of the Chapter

The purpose of this chapter is to establish that, under explicit variational assumptions, the realization functional selects at least one admissible candidate channel. This is the first theorem in the book that directly supports the formal viability of the selection law.

12.0.1 Position Within the Book

Chapter 11 established nonemptiness of the admissible class in standard settings. Chapter 12 now asks whether the realization functional attains a minimum on that class. Chapter 13 will study whether such minimizers preserve public record consistency and invariance properties. Chapter 14 will then ask when the minimizer is unique.

12.1 Variational Setting

12.1.1 Local Problem Statement

To prove existence of minimizers, one must state the analytic assumptions on both the admissible class and the realization functional.

Assumption 12.1.1. Topological Setting

For a fixed admissible context C, the class 𝒜(C) is regarded as a subset of a finite-dimensional affine space of channel representations, for example through Choi operators satisfying the relevant linear constraints.

Assumption 12.1.2. Compactness or Precompactness

The admissible class 𝒜(C) is compact, or at minimum precompact with closure contained in a physically admissible enlargement on which ℛ꜀ extends appropriately.

Assumption 12.1.3. Lower Semicontinuity

The realization functional ℛ꜀: 𝒜(C) → ℝ ∪ {+∞} is lower semicontinuous.

Assumption 12.1.4. Coercivity or Equivalent Control

If 𝒜(C) is not assumed compact directly, then ℛ꜀ satisfies a coercivity-type condition or equivalent control sufficient to prevent minimizing sequences from escaping the effective admissible region.

Assumption 12.1.5. Nontrivial Finite Infimum

inf {ℛ꜀(Φ) : Φ ∈ 𝒜(C)} < +∞.

Remark 12.1.6

Assumption 12.1.4 is included because in broader settings compactness may fail. In the finite-dimensional framework of this volume, direct compactness is often the cleaner route.

12.2 Main Existence Theorem

Theorem 12.2.1. Existence of Minimizer

Let C be a fixed admissible measurement context. Suppose:

𝒜(C) ≠ ∅
𝒜(C) is compact, or more generally satisfies the precompactness-plus-closure condition of Assumption 12.1.2
ℛ꜀ is lower semicontinuous on 𝒜(C)
inf {ℛ꜀(Φ) : Φ ∈ 𝒜(C)} < +∞

Then there exists at least one channel Φ∗ ∈ 𝒜(C) such that

ℛ꜀(Φ∗) = min {ℛ꜀(Φ) : Φ ∈ 𝒜(C)}.

Proof Status

Fully proved in the compact finite-dimensional setting. In the broader precompact or extended-setting formulation, only a proof sketch is given here.

Proof

In the compact finite-dimensional setting, 𝒜(C) is nonempty and compact by assumption. The realization functional ℛ꜀ is lower semicontinuous. By the standard finite-dimensional direct method of the calculus of variations, a lower-semicontinuous function on a nonempty compact set attains its minimum. Therefore there exists Φ∗ ∈ 𝒜(C) such that

ℛ꜀(Φ∗) = min {ℛ꜀(Φ) : Φ ∈ 𝒜(C)}.

Corollary 12.2.2. Existence of Realization Candidate

Under the assumptions of Theorem 12.2.1, the variational law of CBR is mathematically nonempty: there exists at least one admissible channel eligible for realization as a minimizer of ℛ꜀.

Remark 12.2.3

The corollary should be read carefully. The theorem yields a realization candidate in the variational sense, not yet a unique realized channel in the single-outcome sense of Axiom B.

12.3 Proof Sketch for the Extended Setting

Purpose

The finite-dimensional proof is straightforward. A sketch for the more general setting helps identify where the real mathematical burden lies.

Proof Sketch 12.3.1

Suppose 𝒜(C) is not compact but is precompact in a larger ambient space of channel representations, and ℛ꜀ extends lower semicontinuously to the closure of 𝒜(C). Let {Φₙ} be a minimizing sequence, so that

ℛ꜀(Φₙ) → inf {ℛ꜀(Φ) : Φ ∈ 𝒜(C)}.

Precompactness yields a convergent subsequence Φₙₖ → Φ̄ in the closure of 𝒜(C). Lower semicontinuity implies

ℛ꜀(Φ̄) ≤ lim infₖ→∞ ℛ꜀(Φₙₖ),

so Φ̄ attains the infimum. If the closure remains admissible, or if the extension preserves admissibility in the required sense, then Φ̄ ∈ 𝒜(C) or in its admissible extension, and hence a minimizer exists.

Remark 12.3.2

The delicate point in general settings is not the lower-semicontinuity argument itself, but whether closure preserves admissibility and whether the ambient topology is physically appropriate.

12.4 Interpretation

Interpretation 12.4.1

The existence theorem shows that the realization law is mathematically selectable under stated assumptions. That is, the framework does more than name a preferred channel abstractly; it identifies conditions under which at least one admissible minimizer exists.

Clarification

This result should not be inflated. It does not show:

that the minimizer is unique
that the minimizer is physically correct
that the realization functional is canonical
that the resulting selection law matches observed statistics
that the same argument works in all non-finite-dimensional settings

Remark 12.4.2

Still, the theorem matters. It is the first step from framework declaration to mathematically controlled selection.

12.5 Fragility Analysis

Purpose

A theorem of existence is only as strong as the robustness of its assumptions.

Fragility 12.5.1. Compactness Dependence

If 𝒜(C) is not compact and no coercivity-type replacement is available, minimizing sequences may fail to converge.

Fragility 12.5.2. Lower-Semicontinuity Dependence

If ℛ꜀ is not lower semicontinuous, the infimum may fail to be attained even when bounded below.

Fragility 12.5.3. Admissibility Closure Dependence

In extended settings, the closure of 𝒜(C) may contain channels that violate the physical admissibility constraints. In such cases, compactness in the wrong ambient space is insufficient.

Fragility 12.5.4. Representation Dependence

The existence theorem may appear easier in a Choi-operator representation than in a direct process-level formulation. Care is therefore needed not to mistake representational convenience for physical inevitability.

Strongest Objection

A critic may say that the theorem is mathematically routine and therefore not very informative.

Response.
It is mathematically routine in its core analytic mechanism. That is a strength, not a weakness. The hard work lies not in inventing a new existence theorem, but in showing that the physically motivated admissible class and realization functional satisfy the theorem’s hypotheses without circularity.

12.6 Chapter-End Ledger

Established in this chapter

the variational setting has been stated clearly
a main existence theorem for minimizers has been proved in the compact finite-dimensional setting
a proof sketch has been given for a broader precompact setting
the interpretation and fragility of the existence theorem have been clarified

Conditionally established

existence of a minimizer under the compactness, lower-semicontinuity, and finite-infimum assumptions

Not established

uniqueness of minimizer
canonicity of the realization functional
physical correctness of the minimizer
general existence in all infinite-dimensional or relativistic settings

Strongest unresolved objection

the physically serious content lies in whether the admissible class and realization functional actually satisfy the theorem’s hypotheses without hidden design

What later chapters must supply

consistency of minimizers with public record structure
invariance results
conditional uniqueness theorems

Chapter-End Box

Status: existence of minimizer is not yet uniqueness.

Chapter 13. Consistency and Invariance Results

Chapter Summary

This chapter studies what properties a minimizing channel inherits once it exists. It proves that, under the framework’s assumptions, a realized minimizer induces a coherent public record, behaves consistently under stated forms of composition, remains stable under admissible coarse-graining, and is invariant under purely formal redescription. A final proposition addresses observer-access invariance in contexts where the access structures are physically equivalent.

The scope remains conditional. These results depend on how admissibility and physical equivalence are defined. They do not prove absolute invariance in every conceivable representation, nor do they eliminate all context sensitivity.

13.0 Purpose of the Chapter

The purpose of this chapter is to show that a minimizer, once it exists, is not merely a mathematically distinguished channel but a physically coherent one in the terms relevant to the framework.

13.0.1 Position Within the Book

Chapter 12 established existence of minimizers. Chapter 13 now studies their physical coherence. Chapter 14 will examine when those minimizers are unique.

13.1 Record Consistency Proposition

Local Problem Statement

Does a minimizing channel induce a coherent public record?

Assumption 13.1.1. Record-Compatible Admissibility

Assume that every channel in 𝒜(C) satisfies the record-sector alignment, persistence, and public accessibility conditions of Chapter 6.

Proposition 13.1.2. Record Consistency of Minimizers

Let C be an admissible context and let Φ∗ ∈ 𝒜(C) be a minimizer of ℛ꜀. Under Assumption 13.1.1, Φ∗ induces a coherent public record in context C.

Proof

Since Φ∗ ∈ 𝒜(C), it satisfies the structural admissibility conditions by definition. In particular, it aligns with the candidate record sectors of C, preserves public accessibility of the induced record, and satisfies the persistence and nonpathology conditions. Therefore the record induced by Φ∗ is coherent in the public, operational sense fixed by the context.

Remark 13.1.3

The force of this proposition is modest but important: it shows that minimization does not take the theory outside the physically acceptable record-bearing domain.

13.2 Composition Consistency

Local Problem Statement

Do minimizers conflict across subsystem and whole-system descriptions?

Assumption 13.2.1. Composition-Compatible Admissibility

Suppose C₁ and C₂ compose into a larger context C₁₂, and suppose the admissibility schema is composition-compatible in the sense of Chapter 6.

Proposition 13.2.2. Composition Consistency

Let Φ∗₁₂ be a minimizer in the composite context C₁₂. If the reduction of Φ∗₁₂ to the subsystem descriptions preserves the public record content of C₁ and C₂, then the realization assignments induced by Φ∗₁₂ do not conflict with the subsystem realization structure.

Proof Sketch

By composition-compatible admissibility, the composite channel respects the record architecture inherited from C₁ and C₂. If the reduction preserves the subsystem public record content, then the reduced structures remain within the admissible realization descriptions of the subsystems. Hence no contradiction arises between subsystem and composite public outcome assignments.

Non-Overstatement Note

This proposition is conditional and limited. It does not prove that every subsystem minimizer is the reduction of a composite minimizer or vice versa.

13.3 Coarse-Graining Invariance

Local Problem Statement

Is the public record assignment stable under admissible coarse-graining?

Assumption 13.3.1. Record-Preserving Coarse-Graining

Suppose the coarse-graining map preserves the public outcome distinctions of the context.

Proposition 13.3.2. Coarse-Graining Invariance

If Φ∗ is a minimizer of ℛ꜀ in context C and the coarse-graining preserves the context’s public record distinctions, then the macroscopic record assignment induced by Φ∗ is stable under that coarse-graining.

Proof Sketch

Because the coarse-graining preserves the public record distinctions, it does not merge distinct realized outcome sectors into ambiguity. Since Φ∗ already induces a coherent public record, the same macroscopic assignment remains valid in the reduced description.

Remark 13.3.3

This proposition says that effective classical record structure is stable under admissible reduction. It does not imply invariance under arbitrary coarse-graining.

13.4 Relabeling Invariance

Local Problem Statement

Does purely formal redescription alter realization satus?

Assumption 13.4.1. Physical Equivalence Under Relabeling

Suppose Φ and Ψ are related by a redescription that leaves all physically relevant record-bearing structure of C unchanged.

Proposition 13.4.2. Relabeling Invariance

If Φ and Ψ are physically equivalent under Assumption 13.4.1, then

ℛ꜀(Φ) = ℛ꜀(Ψ),

and therefore Φ is a minimizer if and only if Ψ is a minimizer.

Proof

The equality of realization values follows from Axiom H together with the abstract invariance requirement on ℛ꜀. The minimizer equivalence then follows immediately.

Remark 13.4.3

This proposition prevents the realization law from depending on mere notation.

13.5 Observer-Access Invariance

Local Problem Statement

If two observer-access structures are physically equivalent, should they induce the same realization ordering?

Assumption 13.5.1. Equivalent Access Structures

Let 𝒪₁ and 𝒪₂ be two observer-access structures for the same measurement context C such that they recover the same public outcome information, differ only by physically irrelevant implementation details, and preserve the same record accessibility relations.

Proposition 13.5.2. Observer-Access Invariance

Under Assumption 13.5.1, the realization ordering induced by ℛ꜀ is the same for 𝒪₁ and 𝒪₂.

Proof Sketch

If the two access structures preserve the same physically relevant public record content and differ only implementation-wise, then they define the same admissible public record structure of the context. By context dependence only through physically relevant structure, ℛ꜀ assigns the same ordering.

Remark 13.5.3

This proposition is appropriately qualified. It applies only where the access structures are genuinely physically equivalent.

13.6 Limits

Purpose

A good invariance chapter must say where invariance may fail.

Limit 13.6.1. Failure Under Record-Destroying Coarse-Graining

If coarse-graining merges distinct public record sectors or destroys accessibility, coarse-graining invariance need not hold.

Limit 13.6.2. Failure Under Non-Equivalent Relabeling

If a purported relabeling changes record architecture rather than merely description, relabeling invariance does not apply.

Limit 13.6.3. Failure Under Access-Structure Inequivalence

If two observer-access structures encode genuinely different public information flows, observer-access invariance is not warranted.

Limit 13.6.4. Composition Dependence

Composition consistency depends strongly on how admissibility behaves under subsystem reduction and composite formation. The present results do not remove all dependence on those definitions.

13.7 Chapter-End Ledger

Established in this chapter

record consistency of minimizers
conditional composition consistency
coarse-graining invariance under preserving reductions
relabeling invariance
observer-access invariance for physically equivalent access structures
explicit limits of the invariance claims

Conditionally established

all results in this chapter depend on the physical-equivalence and admissibility assumptions stated

Not established

absolute invariance across all descriptions
full subsystem/composite equivalence of minimizers
invariance under record-destroying reductions
uniqueness of minimizer

Strongest unresolved objection

the content of these propositions depends heavily on the precision of the admissibility and equivalence notions, which may still remain contestable

What later chapters must supply

conditional uniqueness
treatment of symmetry-related degeneracy
stronger comparison across functional families

Chapter 14. Uniqueness: Conditional Results and Open Dependence

Chapter Summary

This chapter asks when a minimizer is unique. This is a decisive question for any single-outcome theory. Existence of a minimizer is not enough if ties proliferate in physically significant ways. The chapter therefore begins by explaining why uniqueness matters, then identifies the main sources of nonuniqueness, states a conservative conditional uniqueness theorem under strong assumptions, provides a short proof, discusses symmetry-related apparent degeneracies, and records the main open questions that remain.

The chapter is intentionally restrained. It does not claim a general uniqueness theorem. It claims uniqueness only where the assumptions are strong enough to support it.

14.0 Purpose of the Chapter

The purpose of this chapter is to identify conditions under which the variational realization law selects exactly one minimizer, up to physically irrelevant equivalence.

14.1 Why Uniqueness Matters

Local Problem Statement

A single-outcome framework is incomplete if its realization law often returns many inequivalent minimizers.

Discussion 14.1.1

Axiom B states that exactly one admissible channel is physically realized per trial. If the theory’s own variational law systematically leaves multiple inequivalent minimizers unresolved, then either:

the theory is incomplete
the admissibility class is too broad
the realization functional is too weak
the apparent multiplicity is only representational

Uniqueness therefore matters because it connects the variational machinery to the single-outcome postulate.

Remark 14.1.2

The right goal is not “uniqueness at all costs.” It is uniqueness under physically motivated assumptions, with all remaining dependence stated openly.

14.2 Sources of Nonuniqueness

Purpose

Before stating a uniqueness theorem, one must identify where ties come from.

Source 14.2.1. Admissibility Ambiguity

If 𝒜(C) contains too many structurally similar but physically distinct candidates, multiple minimizers may appear simply because admissibility is not sharp enough.

Source 14.2.2. Non-Strict Convexity

If ℛ꜀ is merely convex rather than strictly convex, a whole face of minimizers may exist.

Source 14.2.3. Degenerate Record Structure

If the record sectors themselves are degenerate or operationally indistinguishable, minimizers may fail to separate them.

Source 14.2.4. Symmetry-Related Minimizers

Two minimizers may differ formally yet represent the same physical record structure due to a symmetry of the context.

Remark 14.2.5

The last source is especially important. Not every multiplicity is a failure of uniqueness in the physically relevant sense.

14.3 Conditional Uniqueness Theorem

Assumption 14.3.1. Strict Admissibility Closure

𝒜(C) is convex after passage to physically relevant equivalence classes and contains no spurious multiplicity introduced purely by redescription.

Assumption 14.3.2. Strict Convexity of ℛ꜀

The realization functional ℛ꜀ is strictly convex on 𝒜(C) modulo physical equivalence.

Assumption 14.3.3. Lower Semicontinuity and Existence

The conditions of Theorem 12.2.1 hold, so that at least one minimizer exists.

Assumption 14.3.4. Record Distinguishability

Distinct physical equivalence classes in 𝒜(C) correspond to genuinely distinct record-bearing structures in the context.

Assumption 14.3.5. Symmetry Reduction

Any remaining symmetry-related minimizers are identified within the same physical equivalence class.

Theorem 14.3.6. Conditional Uniqueness

Under Assumptions 14.3.1–14.3.5, the minimizer of ℛ꜀ on 𝒜(C) is unique up to physical equivalence.

Proof

By Theorem 12.2.1, a minimizer exists. Assume there are two distinct minimizers Φ₁ and Φ₂ not physically equivalent. By Assumption 14.3.1, the admissible set is convex modulo equivalence, so the convex combination

Φλ = λΦ₁ + (1 − λ)Φ₂

remains in the admissible class for 0 < λ < 1. By Assumption 14.3.2, strict convexity yields

ℛ꜀(Φλ) < λℛ꜀(Φ₁) + (1 − λ)ℛ꜀(Φ₂).

Since Φ₁ and Φ₂ are both minimizers, the right-hand side equals the minimal value, contradicting minimality. Therefore no two inequivalent minimizers can exist. By Assumption 14.3.5, symmetry-related duplicates are identified as physically equivalent. Hence the minimizer is unique up to physical equivalence.

Non-Overstatement Note

This is a strong-assumption theorem. It does not prove generic uniqueness across all contexts or all functional families.

14.4 Proof Sketch Interpretation

Remark 14.4.1

The proof is mathematically simple once the right assumptions are in place. The real issue is whether those assumptions are physically justified.

Strongest Objection

A critic may argue that strict convexity and strict admissibility closure are exactly the sort of assumptions that make uniqueness easy but may not hold in the physically relevant cases.

Response.
That objection is correct and important. The theorem is therefore explicitly conditional rather than universal.

14.5 Interpretation of Symmetry Cases

Purpose

Not all multiplicity is a substantive failure.

Discussion 14.5.1

Suppose two formal minimizers are related by a symmetry that preserves all physically relevant public record structure of the context. Then treating them as distinct minimizers may exaggerate nonuniqueness. In such cases, what appears mathematically as degeneracy may be physically only representational redundancy.

Definition 14.5.2. Symmetry-Equivalent Minimizers

Two minimizers Φ₁ and Φ₂ are symmetry-equivalent if there exists a symmetry transformation of the context preserving:

record partition
accessibility structure
persistence structure
public outcome content

and mapping Φ₁ to Φ₂.

Remark 14.5.3

The theorem above identifies such symmetry-equivalent minimizers within one physical equivalence class. This move is justified only when the symmetry preserves all contextually relevant public structure.

14.6 What Remains Open

Open Question 14.6.1. Uniqueness Under Weaker Assumptions

Can uniqueness be proved without full strict convexity, perhaps through weaker nondegeneracy or stability assumptions?

Open Question 14.6.2. Uniqueness Across Alternative Functional Families

If one replaces relative-entropy-type functionals with other divergence families, does uniqueness survive?

Open Question 14.6.3. Uniqueness in Large Composite Systems

Do the uniqueness assumptions remain plausible in highly composite, strongly entangled, or effectively infinite-dimensional settings?

Open Question 14.6.4. Admissibility-Driven Nonuniqueness

How much apparent nonuniqueness is due to the realization functional, and how much is due to remaining ambiguity in the admissible class?

Remark 14.6.5

These open questions are not peripheral. They determine whether the framework can ultimately satisfy its own single-outcome ambition without excessive idealization.

14.7 Chapter-End Ledger

Established in this chapter

why uniqueness matters
the main sources of nonuniqueness
a conditional uniqueness theorem under strong assumptions
the role of symmetry-equivalent minimizers
the main open questions concerning uniqueness

Conditionally established

uniqueness of the minimizer up to physical equivalence under Assumptions 14.3.1–14.3.5

Not established

general uniqueness across all admissible contexts
uniqueness under weak assumptions
uniqueness across all functional families
uniqueness in large composite or non-finite-dimensional settings

Strongest unresolved objection

the uniqueness theorem may depend too heavily on strict convexity-style assumptions that are mathematically convenient but not yet physically secured

What later chapters must supply

a Born-analysis that does not assume what uniqueness is meant to support
more exact treatment of alternative divergence families
stronger analysis of admissibility ambiguity

Chapter-End Table

Different uniqueness claims in the framework stand at different levels of support. The existence of at least one minimizer has already been conditionally established, depending on compactness or equivalent control together with lower semicontinuity, but this says nothing about uniqueness. Uniqueness up to physical equivalence has been conditionally established under stronger assumptions, including strict convexity, convexity of the admissible class, and symmetry reduction; the main risk is that these assumptions may be too strong or too convenient. Full uniqueness in all contexts has not been established and would require a much stronger general theory; indeed, it is likely unattainable without further restriction. Uniqueness across all functional families has also not been established, since that would require a canonicality theorem for the realization-functional class, and alternative families may reintroduce ties. Likewise, uniqueness in large composite systems remains open because it would require much stronger compositional control, and degeneracy may proliferate in those settings.

Referee-Risk Memo

Three most likely expert criticisms

1. Chapter 11 may still prove too little because the general existence proposition assumes the physical realizability of the very sort of record structure the framework later uses.
Current answer: the chapter presents the theorem as a conditional nonemptiness result, not as a deep constructive derivation.
What still needs strengthening: later chapters must show that the realizability assumptions arise naturally from standard measurement structure rather than from framework-specific tuning.

2. Chapter 12 may look mathematically routine and therefore physically uninformative.
Current answer: the text openly acknowledges that the analytic mechanism is standard and argues that the real work lies in showing the hypotheses are physically warranted.
What still needs strengthening: later applications should demonstrate that the functional and admissible class satisfy the theorem’s assumptions in nontrivial examples.

3. Chapter 14 may appear to obtain uniqueness only by strong assumptions, especially strict convexity and symmetry reduction.
Current answer: the theorem is explicitly labeled conditional and conservative.
What still needs strengthening: later analysis should either weaken the assumptions or explain why they are physically natural rather than merely mathematically convenient.

PART V — BORN ANALYSIS

Chapter 15. What “Recovering the Born Rule” Could Mean

Chapter Summary

This chapter clarifies one of the most abused phrases in foundational physics: “the Born rule is derived.” In practice, that phrase can refer to several logically distinct achievements, ranging from exact derivation from independent axioms to much weaker forms of compatibility or asymptotic adequacy. A central aim of this volume is to avoid overstating what has been shown. The present chapter therefore separates five distinct senses of Born recovery, explains why conflating them is a major source of confusion, states exactly which sense the present volume aims to establish, and sets evidential standards for each.

The chapter is methodological, but not merely rhetorical. Without these distinctions, later claims in Chapters 16 and 17 would be too easy to misread.

15.0 Purpose of the Chapter

The purpose of this chapter is to define the precise meanings of “Born recovery” relevant to the present framework and to fix the evidential standards attached to each. This chapter does not establish Born compatibility or derivation itself. Its role is classificatory and disciplinary. It prevents later chapters from making stronger claims than the formal support warrants.

15.0.1 Position Within the Book

Part IV established existence, consistency, invariance, and conditional uniqueness results for the realization framework under stated assumptions. The next question is statistical: does the theory recover the observed quantum frequency structure, and in what sense? Chapter 15 answers this by separating the relevant senses of “recovery.” Chapter 16 then argues for conditional Born compatibility under repeated admissible trials. Chapter 17 asks how far non-Born alternatives can be excluded.

15.0.2 Dependencies

This chapter depends on:

the statistical adequacy axiom from Chapter 7
the realization-functional framework from Chapters 8–10
the existence results from Chapters 11–12
the uniqueness discussion of Chapter 14

No new technical theorem from those chapters is assumed beyond this background.

15.1 Five Distinct Senses of Born Recovery

15.1.1 Local Problem Statement

What does it mean for a framework to “recover the Born rule”? There is no single answer. At least five distinct senses must be separated.

Definition 15.1.1. Exact Derivation from Independent Axioms

A framework achieves exact derivation from independent axioms if it proves, from premises that are not already structurally equivalent to assuming Born weighting, that outcome probabilities in the relevant measurement contexts are exactly given by the Born rule.

In finite-dimensional discrete form, this means that for a state ρ and effects {Eᵢ},

p(i) = Tr(ρEᵢ)

is obtained as a theorem from premises not covertly encoding that same assignment.

Remark 15.1.2

This is the strongest and most demanding sense of Born recovery.

Definition 15.1.3. Compatibility with Born Statistics

A framework is compatible with Born statistics if, under its own admissible conditions, the outcome frequencies or statistical weights it predicts agree with the Born rule in the relevant domain.

This is weaker than exact derivation. The framework may require assumptions whose independence from Born weighting has not been fully secured.

Definition 15.1.4. Asymptotic Emergence

A framework exhibits asymptotic emergence of Born structure if, in repeated-trial or large-system limits, its statistical predictions converge to Born-type weights, even if exact finite-trial equality is not derived from first principles.

Symbolically, one may have

limₙ→∞ fₙ(i) = Tr(ρEᵢ)

for an appropriate empirical-frequency or effective-weight sequence fₙ.

Remark 15.1.5

Asymptotic emergence may be scientifically valuable, but it is not the same achievement as exact derivation.

Definition 15.1.6. Fixed-Point Attraction

A framework exhibits fixed-point attraction toward the Born rule if Born-consistent weighting is shown to be a stable attractor under some update, repetition, or selection dynamics, while nearby non-Born assignments are unstable or flow toward the Born structure.

This is a dynamical-stability claim, not a derivation from independent axioms.

Definition 15.1.7. Uniqueness of Born-Consistent Minimizer

A framework establishes uniqueness of Born-consistent minimizer if the realization law selects, among candidate admissible statistical structures, a unique minimizer whose outcome weights are Born-compatible.

This is a selection-theoretic uniqueness claim. It still need not amount to a derivation from independent premises, because the minimization structure itself may already presuppose crucial Born-compatible features.

15.2 Why These Must Not Be Conflated

15.2.1 Purpose

This section explains why these distinctions are not pedantic but essential.

Argument 15.2.2

Conflating these five senses leads to at least four recurring errors in foundations writing.

First, it allows a framework that merely matches Born statistics under chosen assumptions to be described as though it had derived them from independent principles.

Second, it allows asymptotic or effective results to be misrepresented as exact finite-trial theorems.

Third, it allows stability arguments to be mistaken for uniqueness theorems.

Fourth, it allows uniqueness of a minimizer to be mistaken for independence of the premises from the target result.

Proposition 15.2.3. Non-Equivalence of Born-Recovery Senses

The five senses defined in Section 15.1 are logically non-equivalent.

Proof Sketch

A framework may be compatible with Born statistics without deriving them from independent axioms. A framework may yield asymptotic Born behavior without proving exact finite-trial equality. A framework may make Born weighting a fixed-point attractor without showing it is uniquely derivable from deeper premises. A framework may select a unique Born-consistent minimizer without proving that the functional and admissibility conditions were independent of Born-compatible structure. Therefore the five senses are not logically equivalent.

Why the Stakes Are High

The stakes are methodological and substantive.

Methodologically, overstatement damages trust. A theory that says “derived” when it has shown only “compatible” weakens itself even before critics respond.

Substantively, the differences matter because each sense carries a different burden of proof. If those burdens are not kept separate, then no reader can tell what has actually been achieved.

Strongest Objection

A critic may say that these distinctions are too fine-grained and that scientific practice often tolerates looser usage.

Response.
That may be true in informal discussion, but it is not acceptable here. The present volume concerns a foundational proposal whose credibility depends heavily on claim discipline. Precision is therefore mandatory, not optional.

15.3 Which Sense This Volume Aims to Establish

Purpose

The framework must state exactly what it claims and what it does not.

Claim-Status Statement 15.3.1

This volume aims to establish only conditional compatibility with Born statistics under repeated admissible trials and under explicit assumptions on:

admissible measurement contexts
stability and accessibility of records
realization-functional structure
repeated-trial admissibility
composition and invariance behavior

Clarification 15.3.2

This volume does not claim:

exact derivation of the Born rule from wholly independent axioms
a general theorem of asymptotic emergence in all settings
a complete fixed-point theorem for all non-Born alternatives
a uniquely canonical Born-consistent minimizer across all admissible functional families

Remark 15.3.3

The strongest legitimate reading of the Born program in this volume is therefore:

conditional Born compatibility, together with some partial arguments suggesting why nearby non-Born alternatives may be structurally disfavored.

That is the most the present text is entitled to claim.

15.4 Evidential Standards for Each Sense

Purpose

A framework should not only define the senses of Born recovery; it should also state what evidence would be needed to justify each.

Evidential Standards Table

The five senses of Born recovery each carry a different evidential burden. Exact derivation from independent axioms would require a theorem proving Born weights from premises not structurally equivalent to assuming them; mere statistical fit, heuristic plausibility, or minimizer uniqueness under tuned assumptions would not suffice, so the burden here is very high. Compatibility with Born statistics requires proof or at least a controlled argument that the framework yields Born-consistent frequencies in its stated domain; it is not enough merely to say the framework allows Born behavior, so the burden is moderate to high. Asymptotic emergence requires a limit theorem or controlled convergence result; finite examples or suggestive intuition do not suffice, and the burden is high. Fixed-point attraction requires a dynamical or iterative proof that Born structure is both stable and attractive; simply showing that one fixed point exists without stability analysis is not enough, and again the burden is high. Uniqueness of a Born-consistent minimizer requires a theorem showing that only one admissible minimizer survives and that it is Born-compatible; merely showing that a Born-compatible minimizer exists is insufficient, so this too carries a high burden.

Remark 15.4.1

This table should be treated as binding for the rest of Part V.

15.5 End-of-Chapter Ledger

Established in this chapter

five distinct senses of Born recovery
the non-equivalence of those senses
the exact sense aimed at in this volume
evidential standards for each sense

Conditionally established

Only classificatory and methodological results have been established here.

Not established

Born compatibility itself
exact Born derivation
asymptotic emergence
fixed-point attraction
uniqueness of Born-consistent minimizer

Strongest unresolved objection

The strongest unresolved objection is that even the weaker goal of conditional compatibility may later rely on assumptions too close to the desired result.

What later chapters must supply

the repeated-trial setup
the conditional Born-compatibility theorem or proposition
an explicit non-circularity audit
analysis of non-Born alternatives

Chapter 16. Born Compatibility Under Repeated Admissible Trials

Chapter Summary

This chapter states and analyzes the strongest Born-related claim made in the present volume: conditional compatibility with Born statistics under repeated admissible trials. The chapter introduces the repeated-trial setting, formulates a statistical adequacy condition, states a candidate theorem of Born compatibility under explicit assumptions, explains the mechanism of compatibility in restrained terms, identifies where circularity may enter, compares the result with simply assuming the Born measure, and ends with a blunt status statement.

The chapter is careful not to overclaim. It does not present a full derivation from uniquely independent premises. It presents a conditional compatibility result whose force depends on the independence and plausibility of the structural assumptions used.

16.0 Purpose of the Chapter

The purpose of this chapter is to determine whether the realization framework can recover Born-compatible frequencies under repeated admissible trials, and to state precisely in what sense that recovery is established.

16.0.1 Position Within the Book

Chapter 15 defined the relevant senses of Born recovery. Chapter 16 now argues for the weakest and most defensible one relevant to this volume: conditional Born compatibility. Chapter 17 then asks how far non-Born alternatives can be excluded.

16.1 Setup for Repeated Admissible Trials

16.1.1 Local Problem Statement

A statistical claim requires an explicit repeated-trial setting.

Definition 16.1.1. Repeated Admissible Trial Family

Let C be a fixed measurement context with outcome set I. A repeated admissible trial family is a sequence of trials {τ₁, …, τₙ} such that:

each τₖ is governed by the same admissible context C, or by a controlled family of contexts equivalent for statistical purposes
each trial admits a realized channel Φ∗ₖ ∈ 𝒜(C)
the record structure of each trial satisfies the stability, accessibility, and compositional conditions required by the framework
the repetition protocol does not alter the relevant statistical structure except through ordinary admissible preparation variation already encoded in C

Definition 16.1.2. Empirical Frequency

For outcome i ∈ I, define the empirical frequency after n trials by

fₙ(i) = Nₙ(i) / n,

where Nₙ(i) is the number of trials among τ₁, …, τₙ whose realized public record corresponds to outcome i.

Remark 16.1.3

The object of interest is whether fₙ(i), or the corresponding expectation structure over repeated admissible trials, is Born-compatible.

16.2 Statistical Adequacy Condition

Purpose

The framework’s statistical adequacy axiom must now be sharpened for the repeated-trial setting.

Assumption 16.2.1. Repeated-Trial Statistical Regularity

Suppose the repeated admissible trial family satisfies:

trial comparability: the relevant realization-functional structure is stable across trials
record comparability: outcome sectors are identified consistently across the repeated trials
admissible repetition: no new pathological admissibility failure is introduced by repetition itself
exchangeability or effective repeatability: the trial family is symmetric enough, or operationally stable enough, for empirical frequency analysis to be meaningful
Born-compatible calibration condition: the realization ordering preserves the standard quantum weighting structure at the level of admissible repeated-trial statistics

Non-Overstatement Note

Assumption 16.2.1(5) is the most delicate. It is where the chapter becomes vulnerable to the charge that Born compatibility has been inserted rather than derived.

16.3 Candidate Proposition or Theorem

Theorem 16.3.1. Conditional Born Compatibility Under Repeated Admissible Trials

Let C be a finite-dimensional admissible measurement context with outcome effects {Eᵢ}ᵢ∈I and preparation state ρ. Suppose:

the repeated-trial family satisfies Assumption 16.2.1
a minimizer exists for each trial, as ensured by Chapter 12 in the relevant domain
the realization-functional ordering is statistically stable across trials
the admissible repeated-trial structure preserves the standard effect weighting determined by Tr(ρEᵢ) at the public-record level

Then the repeated-trial realization frequencies are Born-compatible in the following sense:

fₙ(i) is governed, in expectation and in the admissible repeated-trial limit, by the weight

pᴮ(i) = Tr(ρEᵢ).

In particular, the framework is compatible with Born statistics in the domain defined by these assumptions.

Proof Status

Conditional theorem in finite-dimensional repeated-trial settings with the structural assumptions above. Not an exact derivation from independent axioms.

Proof Sketch

The proof has three steps.

Step 1: trial-level admissibility and realization.
By the earlier chapters, each trial admits at least one admissible minimizer, and the realized public record is selected from a record-consistent admissible structure.

Step 2: stability of repeated-trial record identification.
By repeated-trial comparability and record comparability, the outcome labels i may be tracked across trials without ambiguity.

Step 3: preservation of standard quantum weighting at the admissible statistical level.
By Assumption 16.2.1(5) and item 4 of the theorem hypotheses, the admissible repeated-trial realization ordering preserves the ordinary quantum effect weighting Tr(ρEᵢ). Therefore the resulting repeated-trial frequencies are Born-compatible in expectation and in the admissible repeated-trial limit.

Thus the framework recovers Born-compatible frequencies under the stated assumptions.

Remark 16.3.2

The proof is intentionally modest. The real content lies in the structural assumptions, especially the preservation of standard quantum weighting in repeated admissible contexts.

16.4 Mechanism of Compatibility

Purpose

A compatibility theorem is more informative when the mechanism is stated plainly and without inflated rhetoric.

Mechanism 16.4.1

The present framework does not modify ordinary predictive quantum structure at the level relevant to standard measurement statistics. Instead, it supplements that predictive structure with a realization ordering over admissible channels. If the admissible repeated-trial structure respects the same public-record weighting encoded by the standard quantum effects, then the realization layer does not disrupt the Born frequencies already carried by the predictive layer.

Restated More Simply

The mechanism is therefore not that the realization functional independently creates the Born rule from nothing. It is that the realization law, under the stated admissibility and stability assumptions, is compatible with the ordinary quantum weighting already present in the predictive structure.

Remark 16.4.2

This is why the present result is a compatibility theorem rather than a derivation theorem.

16.5 Where the Argument May Be Accused of Circularity

Purpose

This section is mandatory.

Non-Circularity Audit 16.5.1

What the chapter claims:
The chapter claims only conditional compatibility with Born statistics under repeated admissible trials.

Where circularity may enter:
Circularity may enter if any of the following occur:

the admissible repeated-trial structure is defined so that only Born-compatible public records count as admissible
the realization functional is chosen precisely because it preserves Tr(ρEᵢ) weighting
the “Born-compatible calibration condition” in Assumption 16.2.1(5) is merely a disguised statement of the conclusion
the repeated-trial stability assumptions are already strong enough to eliminate all non-Born alternatives by fiat

What has been ruled out:
The chapter rules out only the claim that it has given an exact derivation from independent axioms.

What remains vulnerable:
The compatibility result may still depend too heavily on assumptions structurally aligned with the Born rule.

Strongest Objection

A critic may say that the theorem proves only that a Born-preserving realization layer preserves Born behavior.

Response.
That criticism is substantially correct if the theorem is overstated. It is not a refutation of the theorem as stated, because the theorem is explicitly a conditional compatibility result. It does, however, show why this chapter cannot be marketed as a full derivation.

16.6 Comparison with Simple Assumption of Born Measure

Local Problem Statement

What has been gained beyond simply assuming the Born measure at the outset?

Comparison 16.6.1

If one simply assumes the Born measure as primitive, then one has a direct statistical rule but no additional account of how realized public outcomes are selected from admissible process-level possibilities.

The present framework adds, at minimum:

a formal domain of admissible realization channels
a process-level account of public record structure
a variational selection law for realized channels
a compositional and invariance architecture for realization
a framework in which Born compatibility becomes a property of the interaction between predictive structure and admissible realization, rather than merely an isolated postulate

Limitation 16.6.2

What has not yet been gained is an exact derivation of the Born rule from premises wholly independent of Born-like structure.

Remark 16.6.3

The framework therefore adds formal structure and explanatory architecture, but not yet an independent derivation in the strongest sense.

16.7 Status Statement

Blunt Status Statement 16.7.1

This chapter establishes conditional Born compatibility, not yet a full derivation from uniquely independent premises.

Chapter-End Ledger

Established in this chapter

the repeated-trial setting
a statistical adequacy condition
a conditional Born-compatibility theorem
a restrained account of the mechanism of compatibility
a direct circularity audit
a comparison with simply assuming the Born measure

Conditionally established

compatibility of repeated admissible realization with Born statistics in the finite-dimensional repeated-trial setting under the stated assumptions

Not established

exact derivation from independent axioms
full asymptotic emergence theorem in general settings
fixed-point attraction theorem
uniqueness of Born-consistent minimizer across all admissible families

Strongest unresolved objection

the compatibility theorem may still rely too heavily on Born-compatible structural assumptions

What later chapters must supply

stronger exclusion of non-Born alternatives, if possible
sharper analysis of whether the realization-functional family narrows the statistical possibilities nontrivially

Chapter 17. Non-Born Alternatives and Their Claimed Failure

Chapter Summary

This chapter examines non-Born alternatives and asks how far they can be excluded by the framework. Because CBR claims explanatory force partly by favoring Born-compatible statistical structure, it must say something about rival weighting assignments. The chapter identifies several structural defects often attributed to non-Born alternatives, distinguishes what is genuinely proved from what is only argued, considers counterexamples and stress tests, and ends with an intentionally honest conclusion: Volume I supports only partial exclusion of non-Born alternatives.

The chapter is conservative. It does not claim that all non-Born assignments have been ruled out in full generality.

17.0 Purpose of the Chapter

The purpose of this chapter is to determine whether the framework can do more than merely accommodate Born-compatible statistics. It asks whether alternative statistical assignments are structurally disfavored, and if so, in what sense and with what strength.

17.0.1 Position Within the Book

Chapter 16 established conditional Born compatibility. Chapter 17 now addresses the comparative side of that result by testing non-Born alternatives against the framework’s structural demands.

17.1 Why Address Alternatives

Local Problem Statement

Why must the theory discuss non-Born alternatives at all?

Argument 17.1.1

A framework that claims explanatory force by recovering Born behavior should say whether rival statistical assignments remain equally admissible. If they do, then the framework may have explained less than it appears to explain.

Addressing alternatives matters for at least three reasons:

it tests whether Born compatibility is selective or generic
it identifies which structural assumptions do real work
it prevents the framework from taking explanatory credit for what it has not excluded

Remark 17.1.2

This chapter is therefore not optional. It is part of the honesty discipline of the theory.

17.2 Structural Defects Attributed to Non-Born Assignments

Purpose

Several forms of structural defect are often attributed to non-Born assignments in the context of a framework like CBR.

Defect 17.2.1. Instability

A non-Born weighting may fail to remain stable under repeated admissible trial composition or under perturbation of the realization-functional structure.

Defect 17.2.2. Inconsistency Under Composition

A non-Born assignment may behave incoherently when subsystem contexts are combined into composite contexts.

Defect 17.2.3. Lack of Invariance

A non-Born assignment may fail to remain invariant under physically irrelevant redescription, or may depend too heavily on arbitrary representational choices.

Defect 17.2.4. Failure of Repeatability

A non-Born assignment may fail to preserve the stable repeatability structure expected of ordinary public measurement records.

Proposition 17.2.5. Conditional Structural Disfavoring of Non-Born Assignments

Suppose a candidate statistical assignment deviates from Born-compatible weighting while the framework’s admissibility, invariance, and repeated-trial comparability conditions are held fixed. Then any such candidate must either:

violate at least one of the framework’s structural conditions, or
enter as an alternative admissible realization family not yet excluded by the current volume.

Proof Sketch

By Chapter 16, Born-compatible weighting is preserved under the stated repeated-trial conditions. Therefore a non-Born assignment that still claims to arise within the same structural regime must either alter one of those structural assumptions or remain as an unexcluded rival family not ruled out by the present text.

Remark 17.2.6

This proposition is weaker than a no-go theorem. It shows structural pressure, not complete exclusion.

17.3 How Much Is Proved Versus Argued

Purpose

This section separates what is actually established from what is only suggested.

Proven or Conditionally Established

The present volume conditionally establishes:

that Born-compatible weighting is preserved under the repeated-trial assumptions of Chapter 16
that certain non-Born alternatives would have to modify at least part of that structure
that some forms of non-Born behavior are in tension with invariance, composition, or repeatability requirements

Argued but Not Fully Proved

The present volume does not fully prove:

that all non-Born assignments are unstable
that all non-Born assignments violate compositional closure
that all non-Born assignments fail invariance
that all non-Born assignments are dynamically or variationally excluded by the realization functional

Remark 17.3.1

This distinction is crucial. The framework is strongest when it admits that only partial exclusion has been achieved so far.

17.4 Counterexamples and Stress Tests

Purpose

A serious chapter must ask what kinds of non-Born alternatives may evade quick dismissal.

Stress Test 17.4.1. Smooth Reweightings

Suppose one replaces pᴮ(i) = Tr(ρEᵢ) with a smooth reweighting rule

p̃(i) = g(Tr(ρEᵢ)) / ∑ⱼ g(Tr(ρEⱼ)),

where g is a positive nonlinear function.

Such assignments may preserve normalization and even some coarse empirical plausibility in restricted examples. The present volume does not fully exclude all such families.

Stress Test 17.4.2. Context-Sensitive Reweightings

A non-Born assignment may depend on global context features not captured by ordinary local effect weights. Such alternatives are especially relevant because the present framework itself treats realization as context-sensitive.

The framework therefore must be careful not to reject such rivals merely for being contextual, since contextuality alone is not the distinguishing line.

Stress Test 17.4.3. Symmetry-Preserving Non-Born Rules

Some non-Born assignments may preserve obvious symmetry and normalization constraints while still differing from Born weighting. Those cannot be dismissed by symmetry language alone.

Stress Test 17.4.4. Alternative Divergence Families

If the realization functional is changed from relative entropy to another divergence family, nearby non-Born structures may reappear. This is one reason canonicality of the functional family matters so much.

Remark 17.4.5

These stress tests show that Volume I does not yet possess a universal exclusion theorem for non-Born alternatives.

Strongest Objection

A critic may say that once these alternatives are admitted as still open, the framework loses much of its explanatory power.

Response.
That objection is partially justified. The right reply is not to deny it, but to state more precisely what has been gained: partial structural pressure in favor of Born-compatible weighting, not final exclusion of all rivals.

17.5 Honest Conclusion

Conclusion 17.5.1

The present volume supports the following restrained conclusion:

Born-compatible weighting is conditionally recovered under the repeated admissible trial assumptions of Chapter 16.
Several classes of non-Born alternatives appear structurally disfavored if one holds fixed the framework’s invariance, composition, repeatability, and record-consistency requirements.
However, a full exclusion of all non-Born alternatives has not been established in this volume.
In particular, alternative weighting families may survive if they alter the admissibility schema, the realization-functional family, or the repeated-trial assumptions in ways not yet ruled out by the present text.

Remark 17.5.2

This conclusion is deliberately conservative. It is preferable to a stronger conclusion that the current arguments do not justify.

17.6 Chapter-End Ledger

Established in this chapter

why non-Born alternatives must be addressed
the main structural defects often attributed to them
a conditional proposition showing structural pressure against non-Born assignments
a distinction between what is proved and what is merely argued
a set of counterexamples and stress tests
an honest conclusion of partial, not total, exclusion

Conditionally established

non-Born assignments are structurally disfavored relative to the Chapter 16 framework, but only conditionally and not universally

Not established

a universal no-go theorem for non-Born alternatives
instability of all non-Born families
complete uniqueness of Born-compatible weighting across all admissible realization-function families

Strongest unresolved objection

Born compatibility may still depend too heavily on the chosen admissibility and realization-functional structure

What later volumes must supply

stronger exclusion theorems, if available
deeper non-circularity analysis
empirical discrimination where non-Born alternatives yield distinct operational predictions

Chapter-End Box

Strongest unresolved concern: Born compatibility may still depend too heavily on the chosen structure.

Referee-Risk Memo

Three most likely expert criticisms

1. Chapter 16 may still build Born compatibility into its repeated-trial assumptions, especially through the “Born-compatible calibration condition.”
Current answer: the chapter explicitly flags this as the central circularity risk and refuses to call the result a derivation.
What still needs strengthening: later work must either replace that condition with a more independent principle or show why it is not structurally equivalent to assuming the conclusion.

2. Chapter 17 may prove too little against non-Born alternatives, leaving explanatory force weaker than the framework may want.
Current answer: the chapter is honest that only partial exclusion is established.
What still needs strengthening: future work must develop stronger no-go results or accept that Born compatibility remains one admissible option among several.

3. The distinction between five senses of Born recovery may seem methodologically correct but mathematically nonproductive.
Current answer: the chapter uses the distinction to constrain every later statistical claim and prevent theorem/prose mismatch.
What still needs strengthening: later volumes should leverage the distinction to produce more refined theorem targets rather than leaving it purely classificatory.

PART VI — WORKED EXAMPLES

Chapter 18. Canonical Two-Outcome Qubit Measurement

Chapter Summary

This chapter develops the canonical running example of the volume: a two-outcome measurement on a qubit coupled to a pointer apparatus and decohering environment. The example is intentionally simple, but it is not trivial. It allows the theory to display, in one controlled setting, the relation between standard quantum dynamics, candidate record sectors, admissible realization channels, and the variational selection logic of Constraint-Based Realization.

The chapter has a narrow purpose. It is not meant to prove the general theory from a toy model. It is meant to show, in a concrete and mathematically transparent setting, how the framework is supposed to operate when all of its parts are present at once.

18.0 Purpose of the Chapter

The purpose of this chapter is to instantiate the framework in the smallest nontrivial measurement model that still contains the essential ingredients of CBR:

a system carrying superposed predictive structure
an apparatus with distinguishable pointer sectors
an environment supporting decoherence and record stability
an admissible class of record-forming channels
a realization functional ordering those channels
a selected single public outcome

This is the model against which much of the later and earlier formalism should be checked.

18.0.1 Position Within the Book

Part V clarified the exact status of Born-related claims. Part VI now shifts from general theory to worked examples. Chapter 18 begins with the canonical two-outcome qubit model because it is the clearest place to see how admissibility, record structure, and minimization fit together. Chapters 19–21 then increase the structural difficulty by moving to Stern–Gerlach measurement, entangled correlations, and observer chains.

18.0.2 Dependencies

This chapter depends on:

the measurement context formalism of Chapter 5
the admissibility schema of Chapter 6
the axioms of Chapter 7
the abstract realization functional of Chapter 8
the conditional existence and uniqueness results of Chapters 11–14

No new theorem from Part V is assumed beyond the limited Born-compatibility discipline already stated there.

18.1 Standard Setup

18.1.1 Local Problem Statement

The goal is to specify the smallest context in which a single-outcome realization problem arises in a process-rich form.

Definition 18.1.1. Canonical Qubit–Pointer–Environment Context

Let the system Hilbert space be

𝓗ₛ = ℂ²,

with orthonormal basis {|0⟩, |1⟩}.

Let 𝓗ₐ denote the apparatus Hilbert space, assumed finite-dimensional and containing two operationally distinguishable pointer sectors, denoted P₀ and P₁.

Let 𝓗ₑ denote a finite-dimensional environment Hilbert space.

The total Hilbert space is

𝓗 = 𝓗ₛ ⊗ 𝓗ₐ ⊗ 𝓗ₑ.

Assume the initial state is

ρ₀ = ρₛ ⊗ ρₐ ⊗ ρₑ,

where:

ρₛ ∈ 𝒟(𝓗ₛ)
ρₐ ∈ 𝒟(𝓗ₐ)
ρₑ ∈ 𝒟(𝓗ₑ)

Let the system preparation be the pure state

|ψ⟩ = α|0⟩ + β|1⟩,

with |α|² + |β|² = 1, so that

ρₛ = |ψ⟩⟨ψ|.

Assume a measurement interaction U on 𝓗 such that, for a designated initial apparatus state |Aᵣ⟩ and environment reference state |Eᵣ⟩,

U(|0⟩ ⊗ |Aᵣ⟩ ⊗ |Eᵣ⟩) = |0⟩ ⊗ |A₀⟩ ⊗ |E₀⟩,

U(|1⟩ ⊗ |Aᵣ⟩ ⊗ |Eᵣ⟩) = |1⟩ ⊗ |A₁⟩ ⊗ |E₁⟩,

where |A₀⟩ and |A₁⟩ belong to distinct pointer sectors and |E₀⟩, |E₁⟩ encode environment-supported record differentiation.

Definition 18.1.2. Record Partition

Define the candidate public record sectors by

Πᴿ = {R₀, R₁},

where R₀ is the coarse-grained class associated with pointer–environment structures centered on |A₀⟩ ⊗ |E₀⟩, and R₁ is the corresponding class centered on |A₁⟩ ⊗ |E₁⟩.

Definition 18.1.3. Readout Structure

Let the public readout structure be

𝒪 = {“0”, “1”},

with “0” associated with R₀ and “1” associated with R₁.

Remark 18.1.4

The environment is included because the example is not intended to represent idealized projection alone. It is meant to include the minimal physical architecture of stable public record formation.

18.2 Standard QM Account

18.2.1 Purpose

Before applying CBR, the standard quantum account should be stated explicitly.

Standard Evolution

By linearity of U,

U(|ψ⟩ ⊗ |Aᵣ⟩ ⊗ |Eᵣ⟩)
= α|0⟩ ⊗ |A₀⟩ ⊗ |E₀⟩ + β|1⟩ ⊗ |A₁⟩ ⊗ |E₁⟩.

The corresponding post-interaction pure state of the total system is

|Ψ⟩ = α|0⟩|A₀⟩|E₀⟩ + β|1⟩|A₁⟩|E₁⟩.

The total density operator is

ρₜₒₜ = |Ψ⟩⟨Ψ|.

Reduced Apparatus–System Description

If environmental decoherence suppresses the overlap between |E₀⟩ and |E₁⟩ in the operational time window, then the reduced system–apparatus state is approximately diagonal in the pointer basis:

ρₛₐ ≈ |α|² |0⟩⟨0| ⊗ |A₀⟩⟨A₀| + |β|² |1⟩⟨1| ⊗ |A₁⟩⟨A₁|.

Standard Measurement Statistics

If the measurement corresponds to the effects

E₀ = |0⟩⟨0|, E₁ = |1⟩⟨1|,

then standard quantum theory assigns

p(0) = Tr(ρₛE₀) = |α|²,
p(1) = Tr(ρₛE₁) = |β|².

Remark 18.2.1

The standard account gives the predictive structure, the branch-correlated record structure, and the Born weights. What it does not by itself specify, in the terms isolated by this volume, is which admissible record-forming channel becomes the physically realized public outcome in a single trial, if exactly one does.

18.3 Admissible Realization Class

18.3.1 Local Problem Statement

The next step is to specify the admissible class 𝒜(C) for this context.

Definition 18.3.1. Context C₍q₎

Let C₍q₎ denote the canonical qubit–pointer–environment context defined in Section 18.1.

Definition 18.3.2. Admissible Channel Family for C₍q₎

A channel Φ belongs to 𝒜(C₍q₎) if it satisfies all of the following:

CPTP legality: Φ is CPTP on 𝓑(𝓗).
Record-sector alignment: Φ induces output structure aligned with Πᴿ = {R₀, R₁}.
Public accessibility: the induced output supports the public readout 𝒪 = {“0”, “1”}.
Persistence: the output record remains stable over the operational interval of the context.
Nonpathology: Φ does not erase the record immediately, does not generate incompatible private realization structures, and does not depend for its admissibility on arbitrary basis rewriting.
Contextual coherence: the induced record-bearing structure is consistent with the coarse-graining conventions of C₍q₎.

Example 18.3.3. Three Candidate Channels

To make the example concrete, consider three schematic candidate channels:

Φₘ: the measurement-correlating channel implementing the intended qubit-to-pointer record transfer with decoherence-supported stability
Φₑ: an erasing channel that produces momentary pointer correlation but rapidly returns the apparatus to a neutral state
Φₚ: a pathologically private channel that leaves the outcome encoded only in inaccessible microscopic apparatus–environment correlations and fails public readout

Proposition 18.3.4. Admissibility of Φₘ and Exclusion of Φₑ, Φₚ

In context C₍q₎, Φₘ ∈ 𝒜(C₍q₎), while Φₑ ∉ 𝒜(C₍q₎) and Φₚ ∉ 𝒜(C₍q₎).

Proof Sketch

Φₘ is CPTP, record-aligned, publicly accessible, persistent in the relevant time window, and nonpathological. Hence Φₘ ∈ 𝒜(C₍q₎).

Φₑ violates persistence and immediate non-erasure. Hence Φₑ is excluded.

Φₚ violates public accessibility by confining the outcome to inaccessible or observer-inconsistent microstructure. Hence Φₚ is excluded.

Remark 18.3.5

This proposition is only illustrative. The goal is not to prove a global classification of all channels on 𝓗, but to show what admissibility looks like in a concrete case.

18.4 Realization Functional Evaluation

18.4.1 Local Problem Statement

The admissible class is now ordered by the realization functional.

Abstract Functional Use

Let ℛ꜀ denote the realization functional for C₍q₎. In a schematic multi-term provisional form, one may write

ℛ꜀(Φ) = αS꜀(Φ) + βA꜀(Φ) + γK꜀(Φ) + δM꜀(Φ),

where:

S꜀ measures record-stability cost
A꜀ measures accessibility failure
K꜀ measures residual incompatibility with stable public record structure
M꜀ measures compositional mismatch

Qualitative Evaluation

For the three candidate channels above, the intended ordering is:

ℛ꜀(Φₘ) < ℛ꜀(Φₑ), ℛ꜀(Φₘ) < ℛ꜀(Φₚ),

because:

Φₘ preserves stable public record structure
Φₑ is penalized heavily by persistence failure
Φₚ is penalized heavily by accessibility failure

Remark 18.4.1

At this stage, the evaluation is schematic rather than numerically explicit. That is appropriate. The example is intended to illustrate the functional logic, not to pretend that the final canonical formula has already been secured.

Non-Circularity Note

This example is persuasive only if the penalties attached to Φₑ and Φₚ arise from independently justified record-structure principles rather than from a retrofitted preference for the intended result. In this toy case, that justification rests on the already-stated admissibility and public-record conditions.

18.5 Selected Channel Structure

18.5.1 Selection Statement

Assume the admissible class contains Φₘ and any physically equivalent variants, and that ℛ꜀ has a unique minimizer up to physical equivalence in this context. Then the selected realized channel satisfies

Φ∗ = arg min {ℛ꜀(Φ) : Φ ∈ 𝒜(C₍q₎)} = Φₘ mod physical equivalence.

Interpretation

The theory does not say that the post-measurement predictive state ceases to contain branch-correlated structure at the descriptive level. It says that, among the admissible record-forming channels, one channel is selected as the physically realized public outcome channel in the trial.

Definition 18.5.1. Realized Outcome Record

If Φ∗ aligns with record sector Rᵢ, then the realized public outcome of the trial is the readout label associated with Rᵢ.

Remark 18.5.2

In the present example, the selected channel structure should be understood as a process-level actualization of one public record sector, not as a claim that the total predictive quantum state ceases to exist in any descriptive sense required by every interpretation. The example remains agnostic about broader ontology.

18.6 What This Example Demonstrates

18.6.1 Record Structure

The example demonstrates how a standard measurement setup naturally yields candidate public record sectors R₀ and R₁ supported by apparatus and environment.

18.6.2 Minimization Logic

It demonstrates how the realization functional is supposed to work: channels that preserve stable, accessible, nonpathological public records are favored over channels that erase, privatize, or destabilize outcome structure.

18.6.3 Single-Outcome Result in Context

It demonstrates, under the example’s assumptions, how a single realized public outcome can be associated with a unique minimizing admissible channel.

Remark 18.6.4

The example also shows why the theory is channel-level rather than state-level. The relevant distinctions are about process structure, record access, and persistence, not only about subsystem state labels.

18.7 What This Example Does Not Demonstrate

18.7.1 No General Uniqueness Theorem

The example does not prove uniqueness in all admissible contexts. It only illustrates how uniqueness can arise in a simple finite-dimensional setting under favorable assumptions.

18.7.2 No Field-Theoretic Generalization

The example does not extend automatically to quantum field theoretic or infinite-dimensional measurement models.

18.7.3 No Empirical Distinctness

The example does not show that CBR differs experimentally from standard interpretation-only treatments. It only shows internal functioning of the framework in one context.

18.7.4 No Independent Born Derivation

The example uses a setting whose predictive statistics are already standard. It therefore does not by itself derive the Born rule independently.

18.8 End-of-Chapter Ledger

Established in this chapter

the standard qubit–pointer–environment setup
the standard quantum description of candidate records and Born weights
a concrete admissible class for the example
a schematic realization-functional ordering
the selected-channel logic in a simple context
the precise limits of what the example shows

Conditionally established

a single realized channel in the example under admissibility and uniqueness assumptions

Not established

general uniqueness
field-theoretic extension
empirical discrimination
independent Born derivation

Strongest unresolved objection

The strongest unresolved objection is that the example’s success may depend on a context in which the intended record structure is already unusually clean.

What later examples must supply

a more realistic spatial measurement model
a composite entangled case
a pressure test for observer consistency

Chapter 19. Stern–Gerlach Measurement

Chapter Summary

This chapter applies the framework to the Stern–Gerlach measurement of a spin-1/2 particle. The Stern–Gerlach case is more physically concrete than the abstract qubit-pointer toy model because it includes spatial separation, macroscopic registration, and a familiar measurement narrative grounded in actual laboratory structure. The chapter identifies the candidate record sectors, defines admissible channels, describes the minimization structure, states the limited sense in which Born-compatible frequencies arise, and records the lessons and limits of the example.

This chapter remains careful not to overstate what the example proves.

19.0 Purpose of the Chapter

The purpose of this chapter is to test the framework against a canonical laboratory measurement model in which microscopic spin information is amplified into spatially separated, macroscopically recordable outcomes.

19.1 Physical Model

19.1.1 Setup

Consider a spin-1/2 particle moving through an inhomogeneous magnetic field aligned with the z-axis. The relevant system Hilbert space is

𝓗ₛ = 𝓗ₛₚᵢₙ ⊗ 𝓗ₚₒₛ,

where:

𝓗ₛₚᵢₙ ≅ ℂ²
𝓗ₚₒₛ describes the particle’s spatial degree of freedom in an effective finite-dimensional approximation for the present treatment

Let the initial spin state be

|χ⟩ = α|↑⟩ + β|↓⟩,

with |α|² + |β|² = 1.

Let the apparatus include:

the magnetic-field interaction region
a detector screen or position-sensitive detector
associated electronic amplification and environment coupling

For the purposes of the framework, these are grouped into apparatus and environment Hilbert spaces 𝓗ₐ and 𝓗ₑ.

Standard Interaction Structure

The Stern–Gerlach interaction correlates spin with spatial trajectory, yielding effectively separated wavepackets associated with “up” and “down” channels. Detection then amplifies this separation into macroscopically distinct records.

Remark 19.1.1

Unlike the abstract qubit model, the Stern–Gerlach example includes a more physically interpretable path from microscopic degree of freedom to public record.

19.2 Candidate Record Sectors

Definition 19.2.1. Stern–Gerlach Record Sectors

Let Πᴿ = {R↑, R↓}, where:

R↑ is the record sector associated with a stable “upper path” detection record
R↓ is the record sector associated with a stable “lower path” detection record

These record sectors are not merely spin labels. They are coarse-grained detector–environment classes corresponding to macroscopically distinct and retrievable outcomes.

Structural Requirements

The sectors must satisfy:

persistence over the detector readout interval
retrievability by ordinary laboratory observation
distinguishability in detector position and downstream amplification
resilience under admissible perturbation of the measurement chain

Remark 19.2.2

The public record in this case is spatially mediated. This is useful because it makes the record structure less abstract than in the qubit-only toy model.

19.3 Admissible Channels

Definition 19.3.1. Admissible Stern–Gerlach Channel

A channel Φ belongs to 𝒜(Cₛg) if it satisfies:

CPTP legality on the system–apparatus–environment space
alignment with R↑ and R↓ as detector-supported record sectors
public accessibility through detector and apparatus readout
persistence of the registered detection record
compositional compatibility with detector-level and coarse-grained apparatus descriptions
exclusion of channels that erase detection records, encode only inaccessible micro-correlations, or depend on arbitrary reexpression of spin basis unsupported by the field–detector structure

Example 19.3.2. Physically Intended Measurement Channel

Let Φₛg denote the physically intended process mapping superposed spin preparation into path-separated detector-supported records with stable amplification. Then Φₛg is the canonical candidate for inclusion in 𝒜(Cₛg).

Proposition 19.3.3. Nonemptiness in the Stern–Gerlach Context

Under the ordinary operational assumptions of a well-functioning Stern–Gerlach detector, 𝒜(Cₛg) ≠ ∅.

Proof Sketch

The actual Stern–Gerlach measurement process provides a CPTP implementation with spatially separated and publicly accessible detector records. These records persist and support ordinary laboratory readout. Hence the corresponding channel satisfies the admissibility schema in the context of successful measurement operation. ∎

19.4 Minimization Structure

Purpose

The example now asks how the realization functional orders admissible Stern–Gerlach channels.

Schematic Ordering

Let ℛₛg denote the realization functional for the Stern–Gerlach context. Then the intended ordering is such that channels that:

preserve detector-level public records
support stable path-separated outcome registration
maintain consistency between local detector readout and larger apparatus description

receive lower realization cost than channels that:

recombine or blur the detector record before public stabilization
leave the outcome hidden only in inaccessible microscopic detector correlations
fail compositional consistency between spin, path, and detector record levels

Qualitative Selection Statement

If the admissible class is sufficiently sharp and the minimizer unique up to physical equivalence, then the selected channel corresponds to one stable detector-supported outcome record, either R↑ or R↓, in the particular trial.

Remark 19.4.1

The minimization logic in this example is more physically intuitive than in the canonical qubit model because the record sectors are spatially and macroscopically separated.

19.5 Born-Compatible Frequencies

Standard Predictive Weights

For the spin-z measurement, standard quantum theory yields

pᴮ(↑) = |α|²,
pᴮ(↓) = |β|².

CBR Status Statement in This Example

In the sense defined in Chapter 16, the Stern–Gerlach example is conditionally Born-compatible provided:

repeated Stern–Gerlach trials form an admissible repeated-trial family
detector records are stably identified across trials
the realization-functional structure preserves the standard effect weighting at the public-record level

Clarification

This example does not independently derive the Born weights. It shows how CBR can accommodate them in a familiar spatial measurement model under its stated assumptions.

Remark 19.5.1

That restriction should be read strictly. The chapter provides a physically concrete compatibility illustration, not an independent theorem stronger than Chapter 16 already justified.

19.6 Lessons and Limitations

Lessons

This example shows:

how spin information becomes public record structure through spatial separation and amplification
how admissibility can be grounded in familiar laboratory architecture
how CBR treats realized outcome selection at the level of detector-supported channels rather than bare spin labels

Limitations

This example does not show:

that the realization functional is uniquely determined in realistic laboratory detail
that the framework extends without modification to all spin measurement arrangements
that the theory yields experimental predictions beyond standard interpretation-neutral quantum statistics
that relativistic or field-theoretic issues are resolved

End-of-Chapter Ledger

Established in this chapter

a physically concrete Stern–Gerlach measurement context
candidate record sectors grounded in detector structure
an admissibility schema for that context
the minimization logic in a familiar measurement model
conditional Born compatibility in the same limited sense as Chapter 16

Conditionally established

existence of admissible realization channels in successful Stern–Gerlach operation
single-outcome selection logic under uniqueness assumptions

Not established

independent Born derivation
empirical distinctness
full generality across all spatial measurement models

Strongest unresolved objection

The strongest unresolved objection is that the example’s realism increases physical intuition but not necessarily the independence of the realization-functional assumptions.

Chapter 20. Entangled Pair Measurement and Correlated Records

Chapter Summary

This chapter studies a bipartite entangled measurement context. Its role is to test the framework under correlated records across separated subsystems and observers. The chapter introduces the bipartite setup, identifies the correlated record structure, analyzes admissibility for composite contexts, addresses consistency under separated observers, discusses what the example suggests about nonlocal structure in a careful and restrained way, and records the main open issues left unresolved.

This chapter is especially important because it pressures the compositional and public-record commitments of the theory.

20.0 Purpose of the Chapter

The purpose of this chapter is to determine whether CBR can represent correlated public outcomes in entangled systems without collapsing into inconsistency across subsystem and composite descriptions.

20.1 Bipartite Entanglement Setup

20.1.1 Setup

Let two spin-1/2 systems A and B be prepared in the singlet state

|Ψ⁻⟩ = (|↑⟩ₐ|↓⟩ᵦ − |↓⟩ₐ|↑⟩ᵦ) / √2.

Let:

𝓗ₐ and 𝓗ᵦ denote the local system Hilbert spaces
𝓗ₐpp,ₐ and 𝓗ₐpp,ᵦ denote the local apparatus spaces
𝓗ₑₐ and 𝓗ₑᵦ denote local environments

The total context includes both local measurement chains and their combined record structure.

Assume each side performs a measurement in a chosen basis, with public detector-supported outcomes.

Context Structure

The relevant measurement context is composite:

Cₐᵦ = (Cₐ, Cᵦ, correlation structure, composite readout conventions).

Remark 20.1.1

The crucial new feature is that local public records are not independent. Their admissible structure is constrained by entanglement and the joint measurement context.

20.2 Record Correlation Structure

Definition 20.2.1. Correlated Record Family

A correlated record family is a set of composite record sectors of the form

{Rᵢⱼ},

where Rᵢⱼ denotes the joint public record class in which observer A records outcome i and observer B records outcome j.

Example 20.2.2. Anticorrelated z-Basis Record Structure

If both sides measure along z, then the ideal correlated record sectors are:

R↑↓
R↓↑

while R↑↑ and R↓↓ are suppressed in the singlet context.

Remark 20.2.3

The framework treats these as public record classes, not merely abstract tensor-product labels.

20.3 Admissibility in Composite Systems

Local Problem Statement

What counts as an admissible realization channel when the context is composite and entangled?

Definition 20.3.1. Composite Admissibility

A channel Φ belongs to 𝒜(Cₐᵦ) if it satisfies:

CPTP legality on the composite system–apparatus–environment space
alignment with the correlated record sectors of the composite context
public accessibility of the joint record structure through the local and global readout conventions
compositional consistency between local and joint descriptions
exclusion of channels that generate incompatible local public records relative to the composite record structure

Proposition 20.3.2. Composite Record Compatibility Requirement

If Φ ∈ 𝒜(Cₐᵦ), then the local public records induced by Φ must be restrictions of one coherent composite public record structure.

Proof Sketch

This follows directly from compositional admissibility. A channel that produces locally readable records which fail to extend to one coherent composite record class violates the compositional closure demanded by the framework and is therefore excluded.

Remark 20.3.3

This proposition is one of the clearest points at which the framework’s channel-level structure shows its intended value.

20.4 Consistency Under Separated Observers

Local Problem Statement

Can observers at different wings of the experiment obtain publicly consistent records?

Proposition 20.4.1. Separated-Observer Record Consistency

Under the composite admissibility conditions above, if Φ∗ is a minimizer in the composite context, then the local public records available to the separated observers are mutually consistent as restrictions of the same composite realized record structure.

Proof Sketch

By Proposition 20.3.2, any admissible composite channel already enforces compatibility between local and joint records. Since Φ∗ is selected from 𝒜(Cₐᵦ), its local record outputs are restrictions of one coherent composite public record class. Hence no public contradiction arises between the observers.

Remark 20.4.2

This proposition does not by itself resolve all interpretive issues around spacelike separation. It states only that the framework’s admissibility structure blocks incompatible public records across the two wings.

20.5 What This Example Says About Nonlocal Structure

Careful Statement 20.5.1

This example suggests that admissibility and realization in entangled contexts may depend on globally specified record structure, not merely on independent local channel properties.

What It Does Not Say

It does not by itself establish:

superluminal signaling
a full relativistic nonlocal dynamics
a collapse mechanism propagating through spacetime in any particular foliation
a definitive metaphysical account of nonlocality

Interpretive Remark 20.5.2

The example supports a restrained conclusion: in entangled contexts, the realization framework may need globally coherent admissibility conditions. That is weaker than a full theory of nonlocal dynamics.

20.6 Open Issues

Open Question 20.6.1. Relativistic Compatibility

Can the composite admissibility and realization structure be extended to a relativistically satisfactory formulation?

Open Question 20.6.2. Spacelike Separation Treatment

How should the framework represent realization in contexts where the local measurements are spacelike separated and no preferred temporal ordering is physically available?

Open Question 20.6.3. Bell-Type Implications

What constraints, if any, does the framework place on Bell-type correlations beyond those already present in standard quantum theory?

Remark 20.6.4

These questions are postponed because they cannot be answered responsibly within the finite-dimensional and largely nonrelativistic architecture of the present volume.

20.7 End-of-Chapter Ledger

Established in this chapter

a bipartite entangled measurement context
correlated record sectors
a composite admissibility requirement
consistency of local public records under a composite minimizer
a restrained interpretation of the example’s nonlocal significance

Conditionally established

consistency under separated observers in the admissible composite setting

Not established

a relativistic realization law
a spacelike-separated selection theorem
new Bell-type empirical consequences
a full nonlocal ontology

Strongest unresolved objection

The strongest unresolved objection is that the framework’s need for globally coherent admissibility in entangled settings may eventually require more explicit spacetime structure than this volume provides.

Chapter 21. Observer Chains and Nested Registration

Chapter Summary

This chapter examines observer chains and nested registration structures. Its role is to pressure-test one of the framework’s most important claims: that public outcome realization and intersubjective consistency can be represented coherently even when one observer’s record becomes part of a larger observer’s measurement context. The chapter introduces the multi-level registration structure, recasts it in channel terms, distinguishes public record selection from private experience narratives, and states what the example does and does not clarify.

The chapter does not attempt to solve every version of the Wigner-type paradox family. It aims only to show how CBR treats nested public record formation.

21.0 Purpose of the Chapter

The purpose of this chapter is to test whether the framework’s public-record and compositional principles remain coherent when one measurement chain becomes embedded inside another.

21.1 Why This Example Matters

Local Problem Statement

Observer-chain scenarios pressure-test whether a theory can maintain one public outcome structure across nested descriptions.

Argument 21.1.1

Suppose:

observer F records an outcome in a laboratory
a later observer W treats the entire laboratory as part of a larger measurement context

Then a realization framework must address whether:

F’s public record is coherent
W’s later record is coherent
the two records can belong to one compositional structure without contradiction

These are exactly the issues CBR claims to handle through channel-level realization and compositional closure.

Remark 21.1.2

This is why observer-chain cases are not exotic distractions. They are a strong test of whether the theory’s public-record concept is stable under nesting.

21.2 Multi-Level Record Formation

Setup 21.2.1

Let the first-level context C₁ consist of:

system S
observer-apparatus F
environment E₁

Suppose F registers one of two outcomes, yielding candidate public record sectors

Πᴿ₁ = {R₀ᶠ, R₁ᶠ}.

Now let a second-level context C₂ embed the entire first-level laboratory into a larger system measured by observer-apparatus W with environment E₂. This larger context carries candidate record sectors

Πᴿ₂ = {R₀ʷ, R₁ʷ, …},

depending on the measurement design.

Definition 21.2.2. Nested Registration

Nested registration occurs when a record-bearing subsystem from one context becomes part of the measured structure of a larger context.

Remark 21.2.3

The crucial question is not whether one can mathematically write such nesting, but whether the public record assignments remain compositionally coherent.

21.3 Channel-Based Treatment

Purpose

The example now states why channel language is especially useful here.

Argument 21.3.1

If one tried to describe the observer-chain problem only in terms of subsystem state labels, one would quickly lose track of:

the persistence of F’s public record
the accessibility conditions of that record
the way W’s later interaction treats the laboratory as a larger process object
the compositional relation between first-level and second-level public outcomes

A channel-based description keeps these features explicit by treating each level as a process with record-bearing input-output structure.

Definition 21.3.2. Nested Realization Channel

A nested realization channel is a channel on the larger context that includes, as part of its record-bearing structure, the prior record architecture of a smaller embedded context.

Remark 21.3.3

This does not yet solve the observer-chain problem. It does, however, specify the level at which the framework intends to solve it.

21.4 Public Record Selection Versus Private Experience Narratives

Purpose

The theory must say clearly what it is and is not adjudicating in observer-chain examples.

Clarification 21.4.1

CBR is a theory of public record realization in admissible physical contexts. It is not, in this volume, a theory of private conscious experience or subjective phenomenal timelines.

Consequence

In an observer-chain case, the framework asks:

what public record is realized at the first level
what public record is realized at the second level
whether these can be part of one compositionally coherent public record architecture

It does not attempt here to model every possible narrative about what an observer “privately experiences” before or outside the public record structure.

Remark 21.4.2

This restriction is deliberate. It keeps the theory within the physical scope declared in Chapter 1.

21.5 What Is Clarified

Proposition 21.5.1. Intersubjective Consistency in Nested Contexts

Suppose the first-level and second-level contexts are both admissible, and suppose the larger context preserves the public record structure of the embedded context in the sense required by compositional closure. Then the realized public records at the two levels can be represented without contradiction as parts of one nested realization structure.

Proof Sketch

By admissibility and compositional closure, the larger context cannot treat the embedded public record architecture in a way that generates incompatible public records across levels. Therefore, if the second-level measurement preserves the relevant public structure of the first-level record, the two realized public records belong to one nested coherent realization pattern.

Clarification

What this proposition clarifies is intersubjective consistency, not every philosophical issue surrounding nested observation.

Remark 21.5.2

That is already significant. One of the theory’s strongest claims is that public records, not merely private subsystems, are the correct locus of measurement reality in the domain addressed by the volume.

21.6 What Remains Open

Open Question 21.6.1. More Exotic Observer-Chain Paradoxes

The chapter does not fully analyze more extreme variants of Wigner-style scenarios in which measurement contexts are deliberately engineered to challenge classical record permanence.

Open Question 21.6.2. Observer-Dependent Descriptions Versus Public Record Closure

The full relation between mathematically available observer-dependent descriptions and physically realized public record structure remains to be systematized more fully.

Open Question 21.6.3. Reversible Macroscopic Registration

If a laboratory-scale record could be reversed in principle, how should the framework distinguish transient registration from public realization in that case?

Remark 21.6.4

These questions are deferred because they require a more exact treatment of reversibility, nested admissibility, and perhaps eventually relativistic constraints.

21.7 End-of-Chapter Ledger

Established in this chapter

why observer chains matter
the structure of nested registration
the motivation for channel-level treatment
the distinction between public record selection and private experience narrative
a conditional proposition of intersubjective consistency in nested contexts

Conditionally established

consistency of public records across nested observer levels under admissibility and compositional preservation assumptions

Not established

a full treatment of all Wigner-style paradoxes
a theory of private subjective experience
complete treatment of reversible macroscopic registration
ultimate resolution of every observer-dependent descriptive tension

Strongest unresolved objection

The strongest unresolved objection is that some exotic observer-chain scenarios may pressure the framework’s notion of stable public record more severely than the present chapter addresses.

Part VI Concluding Note

Across Chapters 18–21, the examples have been chosen to increase the burden step by step:

Chapter 18 shows the framework in its cleanest minimal toy model
Chapter 19 grounds it in a concrete laboratory measurement
Chapter 20 pressures composite and correlated public records
Chapter 21 pressures nested observer consistency

Taken together, these examples do not prove the general theory. They do, however, show that the theory is not empty, not purely rhetorical, and not confined to one artificially simple setup.

Referee-Risk Memo

Three most likely expert criticisms

1. The examples may seem too schematic to establish real physical credibility.
Current answer: the chapters explicitly present them as worked illustrations, not as decisive empirical tests or universal derivations.
What still needs strengthening: later volumes should add operationally sharper models and, ideally, quantitative discrimination protocols.

2. The realization-functional evaluations remain qualitative rather than numerically exact.
Current answer: this is acknowledged repeatedly, and the examples are used to display structure rather than pretend final canonical formulas already exist.
What still needs strengthening: a later technical volume should specify one or more exact candidate functionals with full proofs of regularity properties.

3. The entangled and observer-chain chapters may still rely too heavily on compositional admissibility assumptions rather than proving them from deeper principles.
Current answer: the text labels those results conditional and treats the compositional assumptions as doing real work.
What still needs strengthening: later theory should either derive stronger compositional closure results or narrow the admissibility class enough that these examples become less assumption-heavy.

PART VII — CRITIQUE BUILT INTO THE BOOK

Chapter 22. Strongest Internal Objections

Chapter Summary

This chapter states the strongest internal objections to Constraint-Based Realization, or CBR, in their strongest fair form. It does not weaken them for convenience. The purpose is not rhetorical self-defense, but structural stress testing. A framework in quantum foundations earns credibility not by avoiding its most vulnerable points, but by naming them precisely, answering them where it can, and recording where the answer remains incomplete.

The objections treated here are those most likely to arise from mathematically serious and philosophically alert readers: that CBR merely renames collapse, that its realization functional is engineered, that the Born rule is hidden in the setup, that admissibility is too flexible, that the theory lacks empirical content, that channels are the wrong formal level, that uniqueness is secured only by mathematically convenient assumptions, and that the entire framework may be an interpretation in formal dress rather than a substantive completion theory.

The chapter ends by naming the objection that is, at the present stage of the work, strongest.

22.0 Purpose of the Chapter

The purpose of this chapter is to subject the framework to adversarial internal scrutiny. The chapter is part of the theory, not external commentary on it, because the credibility of the theory depends on whether it can accurately identify its own likely failure modes.

22.0.1 Position Within the Book

Part VI showed how the framework behaves in worked examples. Chapter 22 now asks whether those examples and prior theorems survive the most serious internal objections. Chapter 23 will then locate CBR among major quantum frameworks. Part VIII will use the results of both chapters to produce a formal status ledger and forward program.

22.0.2 Dependencies

This chapter depends on the full structure of Volume I:

the problem statement of Chapters 1–2
the formal framework of Chapters 3–10
the core mathematical results of Chapters 11–14
the Born analysis of Chapters 15–17
the worked examples of Chapters 18–21

No new theorem is proved here in the ordinary sense. This is an objection-and-response chapter with claim-status discipline.

22.1 Objection: This Simply Renames Collapse

22.1.1 Strongest Version of the Objection

A critic may argue as follows:

CBR does not solve the measurement problem. It redescribes collapse in more elaborate process language. Standard collapse theories say one outcome becomes actual. CBR says one admissible channel becomes realized. That is not a new explanatory structure; it is merely a more ornate vocabulary for the same postulate.

This is a serious objection because if correct, it would substantially reduce the theory’s novelty and explanatory gain.

22.1.2 Why the Objection Matters

If CBR merely renames collapse, then:

its variational apparatus may be decorative rather than explanatory
its appeal to channels may add formal complexity without conceptual gain
its claims of structural advancement over simple collapse language would be overstated

22.1.3 Best Available Response

The strongest response is not that CBR eliminates all resemblance to collapse. It does not. Both CBR and collapse-style views share a single-outcome commitment. The difference claimed by CBR lies elsewhere.

CBR differs from simple collapse language in at least four intended ways:

Level of formal object
Collapse is often described at the level of states or wavefunctions. CBR treats the object of realization as a channel-level process including system, apparatus, environment, and public record structure.
Selection structure
Collapse is often presented as a primitive event or rule. CBR introduces an admissible domain and a variational ordering over that domain.
Record-centered architecture
CBR makes public record structure, accessibility, and compositional coherence explicit formal burdens rather than leaving them implicit in post-measurement language.
Internal theorem targets
CBR seeks existence, consistency, invariance, and conditional uniqueness results for its realization law rather than stopping at the statement that one outcome occurs.

22.1.4 Limits of the Response

The response has limits. CBR does not escape the fact that it posits single-outcome actualization. In that sense, it remains closer to collapse-type families than to many-worlds or purely instrumental approaches.

22.1.5 Honest Status

Interpretive Claim 22.1.1.
CBR is not collapse-free. It is better described as a channel-level, record-structured, variational completion proposal with collapse-adjacent features.

22.1.6 Provisional Assessment

The objection is not fatal, but it is partly right. CBR is not valuable because it abolishes the single-outcome move. Its value, if any, lies in whether the added structure yields genuine formal control beyond ordinary collapse language.

22.2 Objection: The Realization Functional Is Engineered

22.2.1 Strongest Version of the Objection

A critic may argue:

The realization functional is not derived. It is built. Terms like stability, accessibility, and compositional coherence are physically appealing, but appeal is not derivation. If the functional is assembled by hand, then any apparent success may simply reflect design choices rather than discovery of a law.

This is one of the strongest objections in the entire book.

22.2.2 Why the Objection Matters

The realization functional is central to the theory. If it is purely engineered, then:

minimization loses explanatory force
uniqueness results may reflect the chosen formula rather than physical necessity
Born compatibility may be a consequence of design rather than derivation

22.2.3 Best Available Response

The best response is differentiated, not absolute.

Where derivation exists:
At the abstract level, some structure is motivated by independent formal requirements:

the need for an ordering principle if one adopts a variational law
lower-boundedness for well-posed minimization
lower semicontinuity or related regularity for existence arguments
invariance under physically irrelevant relabeling
compositional compatibility if public records are to remain coherent across scales

These do not fully derive the functional, but they narrow the admissible form.

Where derivation does not yet exist:
The concrete provisional multi-term functional of Chapter 9 is not derived from uniquely independent principles. It is a scaffold. Even the relative-entropy-type reformulation of Chapter 10 is only a restricted narrowing, not a full canonical uniqueness result.

22.2.4 Honest Status

Claim-Status Statement 22.2.1.
The realization functional is partially constrained, not fully derived, in Volume I.

22.2.5 What Would Improve the Situation

A stronger theory would need to show one of the following:

a uniqueness theorem for a restricted functional family under strong and independent principles
a no-go theorem eliminating nearby alternatives
an empirical program showing that only one functional family survives contact with data

At present, none of these is fully achieved.

22.2.6 Provisional Assessment

This objection is very strong. The current volume mitigates it by honesty and partial narrowing, not by complete resolution.

22.3 Objection: The Born Rule Is Hidden in the Setup

22.3.1 Strongest Version of the Objection

A critic may argue:

The framework claims Born compatibility, but the Born rule may already be encoded in the admissibility conditions, in the choice of realization functional, in the repeated-trial assumptions, or in the divergence-based reference structure. If so, the result is not recovery but smuggling.

22.3.2 Why the Objection Matters

This is the central Born-related vulnerability. If true, it would undercut the framework’s strongest statistical aspiration.

22.3.3 What Would Count as Smuggling

To answer this objection, one must be precise. The following would count as hidden Born importation:

Admissibility smuggling
If 𝒜(C) is defined so that only Born-compatible outcome structures survive.
Functional smuggling
If ℛ꜀ is chosen because its minimizers are already known to reproduce Born weighting, without independent justification.
Reference-family smuggling
If the divergence-based reference family in Chapter 10 is constructed from Born-compatible weighting assumptions.
Repeated-trial smuggling
If the statistical regularity conditions of Chapter 16 already encode standard quantum outcome weights at the public-record level in a way equivalent to assuming the conclusion.

22.3.4 Best Available Response

The best available response is not that all smuggling has been ruled out. It has not. The response is instead:

the volume explicitly identifies these possible sites of importation
it narrows the Born claim to conditional compatibility
it refuses to call the result an exact derivation
it separates compatibility from stronger notions like exact derivation, asymptotic emergence, and fixed-point attraction

22.3.5 Honest Status

Claim-Status Statement 22.3.1.
Volume I does not eliminate the possibility that Born-compatible structure enters through assumptions too close to the result. It only prevents that dependence from being hidden rhetorically.

22.3.6 Provisional Assessment

This objection is extremely serious. It has been managed by narrowing claims, not defeated.

22.4 Objection: Admissibility Is Too Flexible

22.4.1 Strongest Version of the Objection

A critic may argue:

The admissible class 𝒜(C) is the theory’s largest discretionary zone. If it remains flexible, then the realization law can be made to succeed by adjusting admissibility rather than by discovering a real law. The framework then becomes underdetermined.

22.4.2 Why the Objection Matters

If admissibility is too flexible:

the domain of minimization becomes unstable
uniqueness can be manufactured
non-Born alternatives can be excluded by filtering rather than by theorem
examples become less evidentially meaningful

22.4.3 Current Formal Controls

The framework currently constrains admissibility through:

CPTP legality
record-sector alignment
public accessibility
persistence
compositional compatibility
exclusion of immediate erasure
exclusion of private realization structures
exclusion of arbitrary basis-rewriting dependence

These are real controls, not pure decoration.

22.4.4 Remaining Vulnerability

However, these controls may still not determine a sufficiently narrow class. The main unresolved worries are:

whether record partitions are uniquely or naturally enough fixed
whether coarse-graining conventions leave too much freedom
whether composite-system admissibility introduces hidden flexibility
whether different reasonable admissibility schemas would support different realization outcomes

22.4.5 Honest Status

Claim-Status Statement 22.4.1.
Admissibility is constrained but not yet shown to be sufficiently unique.

22.4.6 Provisional Assessment

This objection remains one of the strongest in the framework. It is not answered by denying flexibility; it is answered only partially by showing that some structure is already ruled out.

22.5 Objection: The Theory Has No Clear Empirical Content

22.5.1 Strongest Version of the Objection

A critic may argue:

Even if the framework is formally coherent, it has no clear empirical stakes in Volume I. If it reproduces standard quantum statistics and offers no quantitative deviation, then it may be an interpretation with extra machinery rather than a testable completion.

22.5.2 Why the Objection Matters

Scientific seriousness depends not only on formal coherence but also on whether the theory either:

yields empirical discrimination in principle, or
offers explanatory gain substantial enough to justify the added structure

22.5.3 Best Available Response

The volume’s response is again limited but explicit.

What is deferred:
A full empirical discrimination program is not developed in Volume I. In particular, the following are deferred:

explicit observables
protocol design
deviation magnitude
scale estimates
null-result interpretation
comparison against standard QM and rival completion theories in operational terms

What must later be shown:
A later volume must show either:

a measurable deviation associated with constraint-sensitive realization structure, or
a principled reason why the added law is worth retaining even if empirically underdetermined

22.5.4 Honest Status

Empirical Hypothesis 22.5.1.
CBR aspires to possible empirical distinctness, but Volume I does not yet establish a sharp operational discrimination theorem.

22.5.5 Provisional Assessment

The objection is strong. Volume I survives it only by candor and by framing itself as a formal foundation volume rather than a completed empirical theory.

22.6 Objection: Channels Are the Wrong Level of Ontology

22.6.1 Strongest Version of the Objection

A critic may argue:

Channels are useful mathematical tools, but they are not the right ontological level for fundamental reality. A realization law should concern states, events, trajectories, or beables, not process maps. Treating channels as the primitive locus of realization may confuse formal convenience with physical ontology.

22.6.2 Why the Objection Matters

If channels are the wrong level, then the theory may be built on the wrong kind of object from the start.

22.6.3 Best Available Response

The response must be careful. The framework does not claim that channels are the ultimate ontology of the universe. It claims something narrower:

For the specific problem of public outcome realization, channels are the right formal locus because they encode:

system–apparatus interaction
environmental coupling
record transfer
accessibility conditions
compositional relations across process stages

A subsystem state alone is often too thin to carry all of that structure.

22.6.4 Clarification

CBR is therefore not committed to the thesis that “reality is fundamentally a channel.” Its claim is that outcome realization, if formalized in the way this theory proposes, is more naturally represented at the channel level than at the subsystem-state level.

22.6.5 Honest Status

Interpretive Claim 22.6.1.
Channels are treated as the proper formal locus of record-bearing realization structure, not necessarily as the ultimate ontological primitives of all physics.

22.6.6 Provisional Assessment

The objection is not fatal unless one mistakes formal locus for total ontology. The current text explicitly avoids that stronger claim.

22.7 Objection: Uniqueness Depends on Mathematical Convenience

22.7.1 Strongest Version of the Objection

A critic may argue:

The uniqueness theorem depends on strict convexity, compactness, symmetry reduction, and perhaps the choice of divergence family. Those are exactly the kinds of mathematically convenient assumptions that make uniqueness easy. The theorem may therefore say more about the chosen analytic setting than about physical reality.

22.7.2 Why the Objection Matters

If uniqueness depends mainly on convenience assumptions, then the single-outcome aspiration of the framework is weakened.

22.7.3 Best Available Response

The best response is not to deny dependence. The framework openly depends on:

compactness or equivalent control for existence
lower semicontinuity for well-posed minimization
strict convexity or analogous conditions for uniqueness
symmetry reduction to distinguish physical multiplicity from representational duplication

The value of the theorem is not that it avoids such assumptions, but that it states them clearly.

22.7.4 Remaining Weakness

What remains weak is whether these assumptions are physically natural enough. In particular:

strict convexity may not hold for all candidate functional families
admissibility may not be convex in all physically relevant settings
symmetry reduction may hide genuine physical degeneracy if handled too aggressively

22.7.5 Honest Status

Claim-Status Statement 22.7.1.
The current uniqueness result is real but strongly assumption-dependent.

22.7.6 Provisional Assessment

This objection remains substantial. It is mitigated only by the theorem’s conservatism and explicit conditional status.

22.8 Objection: This Is an Interpretation in Formal Dress

22.8.1 Strongest Version of the Objection

A critic may argue:

CBR adds formalism, but at bottom it remains an interpretation. It tells a story about what happens in measurement, introduces preferred structures, and redescribes single outcomes. The added mathematics may create the appearance of a new law without moving beyond interpretation.

22.8.2 Why the Objection Matters

This objection targets the framework’s identity. Is CBR:

interpretive,
nomological,
or completion-theoretic?

The answer matters because each category carries a different burden of proof.

22.8.3 Best Available Response

The most accurate answer is mixed.

CBR is not purely interpretive in the loose sense, because it introduces:

an admissible class of realization channels
a realization functional
a variational selection law
theorem targets for existence, consistency, invariance, and uniqueness

These are more than reinterpretive glosses on standard predictive quantum mechanics.

At the same time, CBR is not yet a completed dynamical theory in the sense of a new Schrödinger equation or a fully explicit empirical law with validated parameters.

The most accurate classification is therefore:

completion-theoretic with nomological ambition and interpretive consequences.

22.8.4 Honest Status

Interpretive Claim 22.8.1.
CBR is best understood, at the stage of Volume I, as a proposed completion law for single-outcome realization rather than as a mere interpretation or a fully mature replacement dynamics.

22.8.5 Provisional Assessment

The objection is partly right if “interpretation” is used broadly enough to include all underdetermined foundational proposals. But within the stricter categories relevant here, CBR aims to be more than that.

22.9 Which Objection Is Currently Strongest

Statement 22.9.1

The strongest current objection is:

the realization functional and the Born-compatible structure may still be too heavily shaped by the chosen admissibility and functional architecture.

This combines the objections of Sections 22.2, 22.3, and 22.4 into the framework’s central vulnerability.

Why This One Is Strongest

It is strongest because it targets the point where all of the framework’s main ambitions meet:

if the admissible class is too flexible, selection loses force
if the realization functional is engineered, minimization loses force
if the Born result is structurally imported, statistical success loses force

A theory can survive being collapse-adjacent, empirically deferred, or ontologically cautious. It is much harder for it to survive if its core law appears designed rather than constrained.

22.10 End-of-Chapter Ledger

Established in this chapter

the strongest internal objections to the framework
the strongest available responses
the limits of those responses
the identification of the framework’s central unresolved vulnerability

Conditionally established

Only objection-handling structure has been established here. No new positive theorem is proved.

Not established

complete resolution of the realization-functional critique
complete elimination of Born-smuggling risk
decisive empirical content
definitive status beyond the mixed completion-theoretic classification

Strongest unresolved objection

the admissibility-plus-functional architecture may still be too close to the outcome structure it later favors

What later work must supply

stronger canonicality results
sharper admissibility narrowing
deeper non-circularity defense
operational discrimination, if available

Chapter 23. Comparative Placement Among Major Quantum Frameworks

Chapter Summary

This chapter places CBR among major approaches to quantum measurement and interpretation. The purpose is not to refute rival frameworks, still less to caricature them, but to identify where CBR overlaps with them, where it differs, and what kind of problem it is trying to solve relative to each. The chapter treats Copenhagen-style approaches, decoherence-only approaches, Everettian approaches, Bohmian mechanics, objective collapse models, QBist and relational families, and then summarizes the comparison in a matrix.

This chapter is one of the most useful for orientation. A theory becomes easier to judge when readers can see its nearest neighbors and its points of divergence.

23.0 Purpose of the Chapter

The purpose of this chapter is to locate CBR fairly and explicitly within the contemporary landscape of quantum foundations.

23.0.1 Position Within the Book

Chapter 22 examined the framework from the inside through its own strongest objections. Chapter 23 now examines it from the outside by comparing it with neighboring quantum frameworks. Chapter 24 will then turn both internal and external assessments into an honesty ledger.

23.0.2 Dependencies

This chapter depends on the entire framework already stated. It also assumes general background familiarity with major interpretive families. The discussion remains high-level and comparative rather than exhaustive.

23.1 Copenhagen-Style Approaches

23.1.1 Core Features of the Family

Copenhagen-style approaches typically emphasize:

the practical use of the formalism
the role of classical description in measurement
the centrality of measurement outcomes and empirical reporting
limited commitment to a unified underlying ontology

Different “Copenhagen” views vary widely, so the label is used here cautiously.

23.1.2 What CBR Shares

CBR shares with Copenhagen-style approaches:

respect for public measurement records
a strong role for outcome structure
the view that measurement contexts matter
a reluctance to reduce everything to one undifferentiated microscopic description without context

23.1.3 What CBR Rejects or Moves Beyond

CBR departs from Copenhagen-style approaches by attempting to formalize a law of realization rather than leaving outcome selection at the level of measurement postulate, classical cut, or pragmatic rule.

23.1.4 Comparative Assessment

CBR is more formalist and completion-oriented than most Copenhagen-style positions. It is less operationally minimalist.

23.2 Decoherence-Only Approaches

23.2.1 Core Features of the Family

Decoherence-only approaches emphasize:

environment-induced suppression of interference
emergence of effectively classical sectors
explanation of stable record formation without adding collapse

23.2.2 What CBR Shares

CBR shares with decoherence-only approaches:

serious attention to record formation
environmental stabilization of effective classicality
the view that measurement must be analyzed at the level of system–apparatus–environment interaction

23.2.3 What CBR Rejects or Moves Beyond

CBR departs from decoherence-only views by treating decoherence or registration as insufficient to answer the single-outcome realization question. It therefore adds a realization law where decoherence-only accounts typically stop.

23.2.4 Comparative Assessment

CBR may be read as accepting decoherence as necessary for record structure but not sufficient for actualization.

23.3 Everettian Approaches

23.3.1 Core Features of the Family

Everettian or many-worlds approaches typically emphasize:

universal unitary evolution
no fundamental collapse
branching or branch-like structure as the account of measurement outcomes
the challenge of understanding probability and self-location within branching

23.3.2 What CBR Shares

CBR shares with Everettian frameworks:

a process-rich treatment of measurement
interest in branch-like record structures prior to realization
respect for decoherence as part of measurement analysis

23.3.3 What CBR Rejects or Moves Beyond

CBR rejects the idea that all decohered branches should be treated as equally actual realized outcomes. It instead posits a single realized channel per trial.

23.3.4 Comparative Assessment

CBR is sharply non-Everettian on actualization, though some of its pre-realization structural language overlaps with branch-sensitive measurement analysis.

23.4 Bohmian Mechanics

23.4.1 Core Features of the Family

Bohmian mechanics typically includes:

a wavefunction evolving unitarily
additional beables, especially particle positions
deterministic dynamics at the hidden-variable level
a statistical account often tied to quantum equilibrium

23.4.2 What CBR Shares

CBR shares with Bohmian mechanics:

dissatisfaction with leaving the outcome question purely interpretive
willingness to add structure beyond bare predictive quantum formalism
a single-outcome orientation

23.4.3 What CBR Rejects or Moves Beyond

CBR does not posit particle trajectories or a hidden-variable ontology of the Bohmian kind. Its primitive formal object for realization is the admissible channel, not the trajectory of additional beables.

23.4.4 Comparative Assessment

CBR is less ontologically specific than Bohmian mechanics and more explicitly record-centered.

23.5 Objective Collapse Models

23.5.1 Core Features of the Family

Objective collapse models typically propose:

modified dynamics
stochastic collapse events or fields
a physical process selecting one outcome

23.5.2 What CBR Shares

CBR shares with objective collapse models:

a commitment to one actual outcome
willingness to supplement standard formal structure
dissatisfaction with purely interpretive dissolutions of the measurement problem

23.5.3 What CBR Rejects or Moves Beyond

CBR does not, at least in Volume I, propose a universal modified dynamical equation of the collapse-model type. It supplements the theory at the level of admissible realization selection rather than by writing down a stochastic collapse law acting everywhere.

23.5.4 Comparative Assessment

CBR is collapse-adjacent in outcome commitment, but not yet collapse-model-like in dynamical explicitness.

23.6 QBist and Relational Approaches

23.6.1 Core Features of the Family

QBist and relational families often emphasize:

the role of agents, perspectives, or observer-system relations
probability as personal or perspectival in some significant sense
resistance to one observer-independent global account of outcomes

23.6.2 What CBR Shares

CBR shares with these approaches:

serious attention to context
skepticism that purely basis-free, context-free language is enough for measurement
interest in how records become meaningful within concrete physical setups

23.6.3 What CBR Rejects or Moves Beyond

CBR rejects the idea that public outcome realization should remain fundamentally observer-relative or agent-relative. Its core notion is a stable public record, not a merely perspectival update.

23.6.4 Comparative Assessment

CBR is contextual but not subjectivist, relationally aware but not fundamentally observer-relative.

23.7 What CBR Shares with Each

Fair-Minded Summary

CBR shares different structural commitments with different families:

with Copenhagen-style views: emphasis on public outcomes and measurement context
with decoherence-only views: centrality of environmental record stabilization
with Everettian views: process-rich measurement analysis before actualization
with Bohmian mechanics: refusal to leave single outcomes unexplained
with objective collapse models: willingness to add law-like structure for actualization
with QBist and relational views: context sensitivity and caution about context-free abstraction

Remark 23.7.1

This is a strength if handled honestly. A framework in foundations often lives at the intersection of several traditions rather than belonging purely to one.

23.8 What CBR Rejects in Each

Clarified Summary

CBR rejects or moves beyond:

in Copenhagen-style views: leaving outcome selection largely unformalized
in decoherence-only views: treating registration as sufficient for realization
in Everettian views: many actual branches rather than one realized public outcome
in Bohmian mechanics: trajectory-based hidden-variable ontology
in objective collapse models: immediate reliance on modified global dynamics
in QBist and relational families: reducing public realization to perspectival update or observer-relative relation

Non-Overstatement Note

These are differences in emphasis and structure, not wholesale dismissals. In several cases, further hybridization or reinterpretation could remain possible.

23.9 Comparison Matrix

Comparative Matrix of Major Quantum Frameworks

The major quantum frameworks can be compared across several dimensions. Copenhagen-style approaches usually treat single outcomes as given at the practical level, often without a deeper added law; their ontological load is moderate to low depending on the version, observers play an important role in measurement description, and the formal focus is on measurement outcomes and the classical–quantum divide. The Born rule is usually assumed operationally, empirical distinctness is often weak or interpretation-dependent, public record structure is strong in practice, and compositional discipline tends to be pragmatic rather than formal.

Decoherence-only approaches do not by themselves deliver a single outcome and do not add a realization law; their ontological load is moderate and varies by version, observers are secondary to environment-induced structure, and the formal emphasis is on reduced states and environment correlations. They are compatible with Born statistics but do not by themselves yield a single-outcome derivation. Their empirical distinctness is usually weak, their treatment of registration is strong, and their compositional discipline is strong for registration though weaker for realization.

Everettian approaches deny a single global outcome, add no collapse law, and typically carry a high branching ontology. Observers matter through branching and self-location, the formal object emphasized is the universal state and branch structure, and the Born rule remains a major internal problem handled in different ways across the literature. They usually have no empirical distinctness beyond standard quantum mechanics, public records are branch-relative, and compositional discipline is strong but branch-based.

Bohmian mechanics affirms a single outcome, adds hidden-variable dynamics, and carries a high ontological load through explicit beables. Observers play only a limited fundamental role, the formal emphasis is on wavefunction plus trajectories, and the Born rule is typically secured through quantum-equilibrium structure. It is in principle empirically distinct in some settings, treats public records strongly, and has strong compositional discipline if its ontology is accepted.

Objective collapse models also affirm a single outcome and add modified dynamics. Their ontological load is moderate to high, observers are usually not fundamental, and their formal focus is on modified state dynamics or collapse fields. Born behavior is typically built into the collapse probabilities or dynamics. These models are in principle empirically distinct, strongly support public records, and their compositional discipline depends on the specific model.

QBist and relational approaches are often perspectival rather than globally single-outcome. They do not add a single global realization law, their ontological load is low to moderate and perspective-sensitive, and observers or agents play a central role. The formal emphasis is on agent-updated states or relations. The Born rule is central but interpreted differently, empirical distinctness is usually weak, public record structure may be secondary to perspective, and compositional discipline varies.

CBR, by contrast, affirms a single outcome, adds a realization law over admissible channels, and carries a moderate ontological load at the process level rather than the beable level. It is context-sensitive but not observer-constitutive. Its formal object is the admissible channel together with public record structure. Its Born status in Volume I is only conditional compatibility. Empirical distinctness is deferred and not yet sharp. Public record structure is central, and compositional discipline is not optional but explicitly required.

Remark 23.9.1

This matrix is schematic. Its purpose is orientation, not exhaustive taxonomic finality.

23.10 End-of-Chapter Ledger

Established in this chapter

fair comparative placement of CBR among major frameworks
shared commitments and differences
a comparative matrix across key dimensions

Conditionally established

Only comparative judgments have been established here; they depend on the broad descriptions given.

Not established

decisive superiority of CBR over any rival framework
exhaustive treatment of every internal variant of those frameworks
empirical dominance of CBR

Strongest unresolved objection

CBR may still appear too hybrid to some readers: more formal than an interpretation, less explicit than a full alternative dynamics, and still seeking its clearest comparative advantage.

What later work must supply

sharper empirical comparison where possible
stronger technical comparison at the theorem level
clearer demonstration of where CBR outperforms rivals, if it does

PART VIII — STATUS LEDGER AND FORWARD PROGRAM

Chapter 24. Formal Status of the Proposal

Chapter Summary

This chapter functions as the honesty ledger of the entire volume. It states what has genuinely been established, what is only conditional, what remains conjectural, which public claims would currently overstate the work, and what kinds of mathematical or physical developments would count against the framework. It then summarizes the status of the central claims in a matrix.

This chapter is not decorative. It is where the book converts its internal discipline into explicit final accounting.

24.0 Purpose of the Chapter

The purpose of this chapter is to state the exact epistemic and formal status of the proposal at the end of Volume I. Every major claim should be legible here in one of four categories:

established
conditional
conjectural
not yet justified as a public claim

24.0.1 Position Within the Book

Part VII subjected the theory to its strongest internal objections and located it among rival frameworks. Chapter 24 now converts that analysis into a formal ledger. Chapter 25 will then state the forward program required for the proposal to improve its status.

24.1 What Has Been Established in Volume I

24.1.1 Established Formal Architecture

Volume I has established the following structural elements of the theory:

Problem isolation
The book has clearly isolated the realization question from both state evolution and record registration.
Measurement-context formalism
It has defined a measurement context including system, apparatus, environment, record partition, public readout structure, and operational setting.
Admissibility schema
It has stated a constrained admissibility framework for candidate realization channels.
Axiomatic core
It has stated the internal axioms of CBR explicitly.
Abstract realization functional
It has defined the realization functional ℛ꜀ at the abstract level and stated its minimal structural requirements.
Existence results under assumptions
It has proved nonemptiness of admissible classes in controlled finite-dimensional contexts and existence of minimizers under standard variational assumptions.
Consistency and invariance results
It has proved record consistency and several conditional invariance propositions.
Conditional uniqueness theorem
It has proved uniqueness up to physical equivalence under strong assumptions.
Claim-status discipline for the Born program
It has sharply distinguished different senses of Born recovery and narrowed its own claim to conditional compatibility.
Worked-example viability
It has shown how the framework operates in several representative contexts.

Clarification

These are real achievements of clarity and structure. They are not trivial. But they are not yet equivalent to establishing truth, uniqueness, or finality.

24.2 What Is Conditional

24.2.1 Condition-Dependent Results

The following results are conditional and should always be presented as such:

nonemptiness of admissible classes outside controlled finite-dimensional or standardly realizable contexts
existence of minimizers outside the compact or precompact lower-semicontinuous setting
consistency and invariance where the relevant physical equivalence and admissibility notions remain contestable
uniqueness of minimizers, which depends on strict convexity-type assumptions and symmetry reduction
Born compatibility, which depends on repeated-trial assumptions and a structure preserving standard quantum weighting at the public-record level
exclusion of non-Born alternatives, which is only partial

Remark 24.2.2

A result can be mathematically respectable and still heavily conditional. These are not mutually exclusive categories.

24.3 What Remains Conjectural

24.3.1 Conjectural Claims

The following claims remain conjectural or incompletely secured:

Fully canonical functional uniqueness
That one narrow functional family, or one unique functional, is forced by independent principles.
Complete exclusion of non-Born alternatives
That all sufficiently serious non-Born assignments are ruled out by the framework’s structural conditions.
Robust uniqueness beyond strict assumptions
That uniqueness survives when strict convexity-like assumptions are weakened.
Clean empirical parameterization
That the theory yields a sharply defined experimental signature with controlled scale and interpretation.
Large composite-system and relativistic extension
That the framework scales to highly composite, spacelike-separated, or relativistic contexts without substantial revision.

Remark 24.3.2

These are not small gaps. They are among the most important tasks still facing the theory.

24.4 Which Claims Should Not Yet Be Made Publicly

Purpose

This section is intentionally severe. Some claims should not yet be made, because the volume has not earned them.

Prohibited Public Claim 24.4.1

“Complete derivation of the Born rule.”

This should not be said. The volume establishes conditional Born compatibility only.

Prohibited Public Claim 24.4.2

“Final completion of quantum mechanics.”

This should not be said. The framework remains conditional, partially conjectural, and empirically incomplete.

Prohibited Public Claim 24.4.3

“Unique unavoidable theory.”

This should not be said. The no-alternative structure is not fully proved, and nearby formal families remain possible.

Prohibited Public Claim 24.4.4

“Experimentally confirmed realization law.”

This should not be said. The empirical program is not complete in Volume I.

Prohibited Public Claim 24.4.5

“General proof that all rival interpretations fail.”

This should not be said. The comparative chapter is fair-minded and explicitly non-totalizing.

Remark 24.4.6

A theory gains more by refusing premature triumphal language than by using it.

24.5 What Would Disconfirm the Framework Mathematically

Purpose

A serious theory must state what would count against it on formal grounds.

Mathematical Disconfirmation Condition 24.5.1. Irreducible Admissibility Underdetermination

If admissibility cannot be narrowed enough to avoid substantial arbitrariness, the framework weakens severely.

Mathematical Disconfirmation Condition 24.5.2. Survival of Multiple Inequivalent Functional Families

If many inequivalent realization-functional families survive all the stated axioms and regularity conditions without further discrimination, the theory’s explanatory core remains underdetermined.

Mathematical Disconfirmation Condition 24.5.3. Born Result Collapses into Disguised Assumption

If careful analysis shows that the Born-compatibility result is nothing more than a reformulated assumption built into admissibility or the reference structure, then the Born program fails in its current ambition.

Mathematical Disconfirmation Condition 24.5.4. Uniqueness Depends Only on Artificial Assumptions

If uniqueness cannot survive beyond assumptions that have no convincing physical interpretation, then the single-outcome ambition of the variational law is weakened.

Mathematical Disconfirmation Condition 24.5.5. Composite-System Incoherence

If the framework cannot maintain compositional closure in entangled and nested contexts without contradiction, it fails one of its own core axioms.

24.6 What Would Disconfirm It Physically

Purpose

The theory must also state what later empirical work could count against it.

Physical Disconfirmation Condition 24.6.1. No Room for Constraint-Dependent Effects

If a future empirical program shows that all candidate constraint-sensitive realization effects are excluded to the precision relevant to the framework’s claimed deviations, then any aspiration to operational distinctness would weaken sharply.

Physical Disconfirmation Condition 24.6.2. Proposed Deviations Are Unidentifiable in Principle

If all claimed deviations turn out to be operationally indistinguishable from standard interpretation-neutral quantum statistics, then the empirical ambition of the theory would fail, even if the framework remained a formal completion proposal.

Physical Disconfirmation Condition 24.6.3. Reference-Structure Dependence Prevents Testability

If any proposed empirical signature depends so strongly on underdetermined admissibility or functional choices that no unambiguous test can be stated, then the theory’s empirical status remains too weak.

Remark 24.6.4

A framework can survive some degree of empirical underdetermination as a formal proposal, but not indefinite empirical vagueness if it claims more than interpretive value.

24.7 Chapter-End Status Matrix

The current status of the framework is uneven and should be stated plainly. The formal statement of the realization problem has been established and needs no upgrade at the level of Volume I. The measurement-context formalism has also been established, though it would benefit from broader physical range in later work. The admissibility schema exists in structured form, but not yet at the level of canonicality, so it would need sharper narrowing and eventual uniqueness work to be upgraded. Nonemptiness of admissible classes has been established only conditionally and would require stronger constructive theorems for a higher status. Existence of minimizers has also been established only conditionally and would need extension to broader analytic settings. Record consistency and invariance results are likewise conditional and would require firmer control over physical-equivalence structure to become stronger. Uniqueness of the minimizer has been established only conditionally under strong assumptions and would need a weaker-assumption theorem for upgrade. Conditional Born compatibility has been established in the limited sense argued in Volume I, but a stronger status would require more independent premises. Exact Born derivation has not been established at all and would require a major new theorem-level breakthrough. Complete exclusion of non-Born alternatives has likewise not been established and would require sharper no-go results. The realization functional is not yet canonical and would need a restricted-family uniqueness theorem or comparable narrowing argument. Empirical distinctness remains deferred and would require explicit observables, protocols, predicted deviation forms, and null-result interpretation. Finally, comparative advantage over rival frameworks has been argued only partially and qualitatively and would need both technical and empirical sharpening to rise further.

24.8 End-of-Chapter Ledger

Established in this chapter

a complete honesty ledger for the theory
a separation between established, conditional, conjectural, and prohibited claims
mathematical and physical disconfirmation conditions
a final status matrix

Conditionally established

Nothing new positively about the theory’s truth; only its status has been clarified.

Not established

any upgrade beyond the status already earned in prior chapters

Strongest unresolved objection

The strongest unresolved objection remains that the framework’s core variational architecture may still be too underdetermined to count as a uniquely constrained law.

Chapter 25. Forward Program for Later Volumes

Chapter Summary

This chapter sets the forward program required for CBR to improve its status beyond Volume I. The chapter is divided into two main developments: Volume II, which should contain full proofs and theorem-strengthening, and Volume III, which should contain the empirical discrimination program. It then explains why these tasks have not been fully included in Volume I and closes with criteria for judging whether the overall program succeeds.

The point of this chapter is not ambition for its own sake. It is disciplined sequencing. A theory improves not by broadening its rhetoric, but by strengthening what is weakest.

25.0 Purpose of the Chapter

The purpose of this chapter is to state what later volumes must accomplish if the proposal is to move from a structurally clear formal program to a more robust and testable theory.

25.0.1 Position Within the Book

Chapter 24 recorded the present status of the framework. Chapter 25 now states the work required to change that status.

25.1 Volume II: Full Proofs and Theorem-Strengthening

25.1.1 Purpose of Volume II

Volume II should strengthen the formal standing of the theory. Its central task is not new vision, but harder proof.

Required Components

A. Full derivations

All theorem-level results currently given only in partial or finite-dimensional form should be expanded into complete proofs where possible.

B. Weakened assumption analysis

The theory should determine which assumptions are genuinely essential and which are artifacts of convenience. This is especially important for:

compactness assumptions
strict convexity assumptions
admissibility closure assumptions
symmetry-reduction assumptions

C. Non-circularity defense

A dedicated theorem-level and argument-level analysis should address where Born-compatible or realization-compatible structure may have been hidden in the setup.

D. Admissibility uniqueness work

Volume II should try to narrow the admissible class more sharply, perhaps by proving that only a restricted family of admissibility conditions can satisfy the theory’s other axioms.

E. Technical comparison with alternatives

The comparison with Everettian, Bohmian, objective collapse, decoherence-only, and other frameworks should be deepened at the theorem level rather than remaining largely architectural.

Why This Matters

If Volume II succeeds, the theory becomes much harder to dismiss as merely suggestive formalism.

25.2 Volume III: Empirical Discrimination

25.2.1 Purpose of Volume III

Volume III should answer the most practical challenge facing the framework: what, if anything, could distinguish it empirically?

Required Components

A. Explicit observables

The theory must specify which observables or operational signatures are relevant.

B. Protocol design

It must design concrete experimental protocols rather than merely gesture toward possible discrimination.

C. Predicted deviation form

It must state the form of any predicted deviation from interpretation-neutral standard quantum statistics, if such deviations are claimed.

D. Scale estimates

It must estimate the size, regime, or scaling behavior of the proposed effect.

E. Null-result interpretation

It must explain what a null result would mean: which versions of the framework it would constrain, weaken, or falsify.

F. Comparison against standard QM and rival completion models

It must compare the experimental signature not only against textbook quantum theory but also against rival single-outcome or completion frameworks where relevant.

Why This Matters

Without Volume III or its equivalent, the theory risks remaining formally interesting but operationally underdeveloped.

25.3 Why Those Are Not Fully Included Here

Local Problem Statement

Why not include the full proof program and empirical program in Volume I?

Answer 25.3.1

Because Volume I is about formal clarity, not overloaded ambition.

There are three reasons for this division.

First, sequence matters.
A theory should first state its primitive objects, axioms, and theorem targets clearly before loading them with every possible proof refinement and experimental ambition.

Second, compression can damage rigor.
If Volume I attempted to include the full proof-strengthening program and the entire empirical program, the result would likely be bloated and less disciplined.

Third, honesty of scope matters.
Volume I has enough to do already: isolate the problem, define the framework, prove first-tier results, and state exactly what has and has not been achieved.

Remark 25.3.2

This is not an excuse for omission. It is a sequencing decision that becomes legitimate only if later volumes actually perform the deferred work.

25.4 Criteria for Success of the Overall Program

Purpose

The theory should close by stating how its own future success should be judged.

Criterion 25.4.1. Formal Precision

The theory must remain explicit about assumptions, definitions, and claim status at every stage.

Criterion 25.4.2. Proof Robustness

The main existence, consistency, uniqueness, and Born-related claims must survive weakening of convenience assumptions where possible.

Criterion 25.4.3. Clean Born Status

The theory must eventually be able to state, with confidence and without rhetoric, whether it has achieved compatibility, asymptotic emergence, fixed-point attraction, exact derivation, or only some subset.

Criterion 25.4.4. Operational Distinctness

If the theory claims empirical significance beyond interpretation, it must produce operationally meaningful discrimination criteria.

Criterion 25.4.5. Independent Expert Critique

The theory must survive technically competent criticism from outside its own framing. Internal consistency is not enough.

Final Program Statement 25.4.6

The overall program succeeds only if it becomes simultaneously:

more precise formally
stronger mathematically
cleaner about Born-status claims
sharper operationally
more resilient under external scrutiny

25.5 End-of-Chapter Ledger

Established in this chapter

the required proof-strengthening program for Volume II
the required empirical-discrimination program for Volume III
the reason these programs are deferred from Volume I
criteria by which the full project should be judged

Conditionally established

Only a forward program has been established, not its success.

Not established

that later volumes will actually achieve the stated upgrades
that the empirical program will produce a usable discriminator
that the theory will survive independent expert review

Strongest unresolved objection

The strongest unresolved objection is that the later strengthening steps may prove harder than the current architecture assumes, especially at the points of admissibility uniqueness, non-circular Born analysis, and empirical sharpness.

Concluding Note for Parts VII–VIII

Together, Chapters 22–25 perform four functions that many unconventional theories neglect:

they state the strongest internal objections
they compare the framework fairly with major alternatives
they give an honesty ledger rather than a triumphal summary
they define what later work must actually accomplish

If the theory improves, it will improve by surviving the burdens recorded here. If it fails, the reasons for failure will not be obscure.

Referee-Risk Memo

Three most likely expert criticisms

1. Chapter 22 may still not answer the strongest objections, especially the engineered-functional and hidden-Born objections.
Current answer: the chapter does not pretend to answer them fully and instead makes them central to the framework’s current status.
What still needs strengthening: later volumes must produce actual narrowing theorems or stronger non-circularity defenses.

2. Chapter 23 may be criticized as too schematic, especially in its treatment of highly diverse families like Copenhagen and relational approaches.
Current answer: the chapter is explicitly orienting rather than exhaustive.
What still needs strengthening: later work should include more fine-grained theorem-level comparison where specific rival theories are relevant.

3. Chapter 24 may be seen as admirably honest but damaging to rhetorical momentum.
Current answer: that is a feature, not a defect, in a foundational proposal seeking seriousness.
What still needs strengthening: the later volumes must justify the honesty by actually upgrading the weak points rather than leaving them as permanently open disclaimers.

APPENDICES

The appendices are part of the formal structure of the volume. They are not supplementary in the weak sense, and they are not included merely for convenience. Their role is to preserve the rigor and readability of the main text by relocating background material, symbol conventions, extended examples, omitted proof skeletons, dependency structure, terminology continuity, and open research questions into a separate but formally disciplined section.

The appendices serve five distinct functions.

First, they make the volume more self-contained for technically trained readers who require explicit mathematical reference points but do not need the main narrative interrupted by standard background.

Second, they increase the transparency of the argument by exposing the dependency structure of the theory, the limits of its current proof status, and the precise points at which conjecture, assumption, and theorem diverge.

Third, they support the reader in reconstructing the logic of the framework from multiple angles: operational, formal, variational, comparative, and methodological.

Fourth, they preserve continuity between the earlier series and the new series without allowing older rhetoric to silently determine the current proof status of claims.

Fifth, they identify the real future burden of the program. A serious foundational theory should not only state what it claims; it should state what remains to be done if those claims are to become stronger.

These appendices are organized as follows:

Appendix A. Mathematical Background
Appendix B. Notation and Symbol Index
Appendix C. Extended Running Example
Appendix D. Additional Proof Skeletons and Technical Remarks
Appendix E. Logical Dependency Architecture
Appendix F. Terminology Crosswalk and Editorial Discipline
Appendix G. Open Problems and Research Agenda

The governing rule throughout is the same as in the main text:

nothing stated in the appendices may exceed the formal support of the volume itself.

Appendix A. Mathematical Background

A.0 Purpose

The purpose of this appendix is to collect the minimum mathematical background required for the main text in a form suitable for expert-facing reading. This appendix is not intended as a beginner’s introduction to quantum mechanics, operator theory, or variational analysis. It is intended as a sharply bounded reference for the specific formal objects and mathematical properties that the volume actually uses.

The appendix has three goals.

First, it fixes the mathematical setting in which the book’s claims are made, especially the finite-dimensional assumptions that support several existence and regularity statements.

Second, it defines the standard objects on which the theory depends: density operators, channels, instruments, Choi representations, convexity properties, and divergence measures.

Third, it identifies where the framework’s central formal moves rely on standard mathematics and where they go beyond standard mathematics into framework-specific postulation.

The appendix therefore gives the reader enough mathematical structure to evaluate the main text without confusing standard formal tools with theory-specific commitments.

A.1 Finite-Dimensional Setting and Scope Discipline

Unless stated otherwise, the central results of Volume I are formulated in finite-dimensional Hilbert spaces or effectively finite-dimensional approximations of ordinary measurement contexts. This restriction is not incidental. It does real work.

It simplifies compactness and lower-semicontinuity arguments.

It makes Choi representations straightforward.

It avoids measure-theoretic and domain-theoretic complications that would otherwise obscure the first statement of the theory.

It ensures that several existence results can be proven using standard finite-dimensional direct methods rather than sophisticated infinite-dimensional functional analysis.

This finite-dimensional restriction should not be mistaken for a claim that the theory is fundamentally finite-dimensional in nature. It is instead a statement about the mathematical domain within which Volume I earns its theorem status.

A later extension to infinite-dimensional or field-theoretic settings would require additional work on at least the following:

admissibility closure in noncompact settings
topological control of channel classes
lower-semicontinuity of candidate realization functionals in weaker operator topologies
treatment of unbounded operators and domain issues
physically meaningful generalization of public record sectors

None of those extensions is assumed here.

A.2 Hilbert Spaces and Operator Structure

Let 𝓗 denote a complex Hilbert space. In the core of Volume I, 𝓗 is finite-dimensional.

The inner product on 𝓗 is written in the usual Dirac-compatible form, though the main text avoids excessive dependence on basis-specific notation.

Let 𝓑(𝓗) denote the bounded operators on 𝓗. In finite dimensions, 𝓑(𝓗) is simply the full matrix algebra on 𝓗.

For X ∈ 𝓑(𝓗):

X† denotes the adjoint of X
X ≥ 0 means X is positive semidefinite
Tr(X) denotes the trace
I denotes the identity operator on the relevant space

The state space on 𝓗 is

𝒟(𝓗) = {ρ ∈ 𝓑(𝓗) : ρ ≥ 0 and Tr(ρ) = 1}.

An element ρ ∈ 𝒟(𝓗) is called a density operator.

A state is pure if and only if it has rank one, equivalently if ρ² = ρ and Tr(ρ²) = 1.

A state is mixed if it is not pure.

Every density operator ρ admits a spectral decomposition

ρ = ∑ᵢ λᵢ |eᵢ⟩⟨eᵢ|,

where λᵢ ≥ 0, ∑ᵢ λᵢ = 1, and {|eᵢ⟩} is an orthonormal eigenbasis.

The support of ρ, denoted supp(ρ), is the span of those eigenvectors with positive eigenvalue. The support plays an important role in divergence theory, since quantities such as relative entropy are sensitive to support inclusion.

The main text remains operationally neutral about the metaphysical status of density operators. They function as predictive and structural objects. Volume I does not require a full ontological commitment about whether ρ is epistemic, ontic, or mixed in status.

A.3 Composite Systems and Reduced Descriptions

Measurement contexts in the book always involve more than an isolated system. They require system, apparatus, and environment, often with nested or composite structure. The tensor product is therefore fundamental.

If S and A are systems with Hilbert spaces 𝓗ₛ and 𝓗ₐ, then the composite system is represented on

𝓗ₛₐ = 𝓗ₛ ⊗ 𝓗ₐ.

If an environment E is included, then the total space becomes

𝓗ₛₐₑ = 𝓗ₛ ⊗ 𝓗ₐ ⊗ 𝓗ₑ.

Given a composite density operator ρₛₐ ∈ 𝒟(𝓗ₛ ⊗ 𝓗ₐ), the reduced state on S is

ρₛ = Trₐ(ρₛₐ),

and the reduced state on A is

ρₐ = Trₛ(ρₛₐ).

The partial trace preserves positivity and normalization, so reduced states remain legitimate density operators.

The framework uses reduced descriptions in several distinct ways.

First, reduced descriptions allow one to ask what public record content is accessible from a subsystem such as an apparatus or observer channel.

Second, they support the formal analysis of coarse-graining.

Third, they are required for compositional consistency statements, especially in entangled or nested contexts.

A reduced state, however, does not by itself encode all of the process-level structure relevant to realization. That limitation is one of the reasons the framework ultimately moves to channels rather than remaining purely state-centered.

A.4 Observables, Effects, and Measurement Statistics

A sharp observable is represented by a self-adjoint operator on 𝓗. In more general measurement theory, a discrete measurement is represented by a family of effects {Eᵢ} satisfying:

Eᵢ ≥ 0 for all i
∑ᵢ Eᵢ = I

The family {Eᵢ} is then a POVM.

For state ρ, the standard probability assigned to outcome i is

p(i) = Tr(ρEᵢ).

This is the standard Born weighting used throughout the volume as the baseline statistical structure with which the framework must eventually be compared.

The main text uses effect-valued measurement structure in two different ways.

First, it uses it descriptively as part of ordinary standard quantum theory.

Second, it uses it comparatively in the Born-analysis chapters, where the question is not whether standard theory assigns such probabilities, but whether CBR independently derives them, merely preserves them, or only remains compatible with them under selected assumptions.

That distinction is crucial. The existence of p(i) = Tr(ρEᵢ) in ordinary quantum theory is not in dispute. The issue is what CBR adds to that structure and how strongly it can claim to recover it.

A.5 Channels and Process Structure

The main text is channel-centered. This appendix therefore makes channel structure explicit.

A linear map

Φ: 𝓑(𝓗ᵢₙ) → 𝓑(𝓗ₒᵤₜ)

is positive if X ≥ 0 implies Φ(X) ≥ 0.

It is completely positive if, for every auxiliary Hilbert space 𝓚, the extended map

Φ ⊗ id𝓚

is positive.

It is trace-preserving if

Tr(Φ(X)) = Tr(X)

for all X in the relevant domain.

A completely positive trace-preserving map is called a CPTP map or quantum channel.

Channels are central to the framework because they can encode:

measurement interaction
environmental coupling
amplification structure
persistence of output records
transitions between physically distinct record-bearing process classes

A subsystem state often does not carry enough information to represent all of that.

In finite dimensions, every CPTP map has a Kraus decomposition

Φ(X) = ∑ₖ Kₖ X Kₖ†,

with

∑ₖ Kₖ†Kₖ = I.

This representation is not unique, and its nonuniqueness is one reason the framework places importance on physical equivalence classes rather than merely symbolic decompositions.

The set of CPTP maps between fixed finite-dimensional operator spaces is convex. This is significant because convexity later interacts with existence and uniqueness arguments.

Still, convexity alone does not imply physical admissibility. Many legal channels are excluded by the framework’s public-record and compositional conditions.

A.6 Instruments and Outcome-Resolved Process Structure

A quantum instrument with outcome set I is a family {𝓘ᵢ} of completely positive trace-nonincreasing maps such that

Φ = ∑ᵢ 𝓘ᵢ

is CPTP.

For input state ρ, the probability of outcome i is

p(i) = Tr(𝓘ᵢ(ρ)).

If p(i) > 0, the associated conditional output state is

ρᵢ = 𝓘ᵢ(ρ) / p(i).

Instruments matter because they formalize outcome-resolved processes, which are structurally close to what CBR needs to talk about. However, CBR does not simply identify “the realized outcome” with one instrument branch by definition. It instead speaks at the level of admissible record-forming channels and their public outcome architecture.

This distinction matters because the theory is concerned not merely with formal branch indexing but with stable public record structure, accessibility, and compositional consistency.

A.7 Choi Representation

One of the most useful standard tools for the framework is the Choi representation of channels.

Let Φ: 𝓑(𝓗ᵢₙ) → 𝓑(𝓗ₒᵤₜ) be linear. Fix an orthonormal basis {|j⟩} of 𝓗ᵢₙ and define

Ω = ∑ⱼ,ₖ |j⟩⟨k| ⊗ |j⟩⟨k|.

Then the Choi operator of Φ is

J(Φ) = (id ⊗ Φ)(Ω).

In finite dimensions, Φ is completely positive if and only if J(Φ) ≥ 0, and Φ is trace-preserving if and only if

Trₒᵤₜ(J(Φ)) = Iᵢₙ.

A normalized Choi representation may then be defined by

Ĉ(Φ) = J(Φ) / dᵢₙ,

where dᵢₙ = dim(𝓗ᵢₙ).

This normalized form behaves like a density-operator-like representative of the channel, subject to linear trace constraints inherited from channel structure.

The framework uses Choi language because it allows channel families to be studied using standard operator-theoretic and variational tools. It also makes divergence-based candidate functionals more natural to formulate.

Still, the use of Choi operators should not be confused with an ontological claim that channels literally are states of larger systems. This is a representation tool, not a metaphysical identity.

A.8 Convexity, Compactness, and Variational Structure

The realization-functional program of the main text requires a small but precise amount of variational analysis.

A set 𝒞 is convex if, whenever x and y belong to 𝒞 and 0 ≤ λ ≤ 1, the convex combination

λx + (1 − λ)y

also belongs to 𝒞.

A function f is lower semicontinuous if xₙ → x implies

f(x) ≤ lim infₙ→∞ f(xₙ).

In finite-dimensional spaces, compactness is equivalent to closedness plus boundedness.

The direct method of the calculus of variations in the finite-dimensional form used by this volume is straightforward:

if 𝒞 is nonempty and compact, and f is lower semicontinuous on 𝒞, then f attains a minimum on 𝒞.

This fact supports the existence-of-minimizer theorem in the main text.

Strict convexity is defined by the property that for distinct x and y, and 0 < λ < 1,

f(λx + (1 − λ)y) < λf(x) + (1 − λ)f(y).

Strict convexity implies uniqueness of minimizer on a convex domain, assuming one exists.

The volume uses these ideas conservatively. It does not claim they are physically inevitable. It uses them as theorem-supporting conditions and openly acknowledges that their physical interpretation remains a pressure point.

A.9 Relative Entropy and Divergence Measures

The relative-entropy and divergence material in the main text is intentionally limited. This appendix records only what is needed.

For density operators ρ and σ with supp(ρ) ⊆ supp(σ), define the quantum relative entropy by

D(ρ ∥ σ) = Tr(ρ(log ρ − log σ)).

If the support condition fails, define D(ρ ∥ σ) = +∞.

Relative entropy is not a metric. It is generally asymmetric and does not satisfy the triangle inequality. Its importance lies elsewhere:

it is nonnegative
it vanishes exactly when ρ = σ
it is monotone under CPTP maps

The monotonicity or data-processing property is especially important, because it makes divergence-based quantities natural candidates when one wants coarse-graining or admissible reduction not to increase distinction in an uncontrolled way.

The main text also refers more generally to divergence measures. A divergence measure is any functional intended to compare two states or two channel representations and satisfying some subset of desirable structural properties such as:

nonnegativity
lower semicontinuity
monotonicity under specified maps
convexity or joint convexity in some argument
well-defined support behavior

The key point for the theory is this:

relative entropy is mathematically attractive, but attraction is not derivation. A later canonicality theorem would have to show much more than that relative entropy is convenient or familiar.

A.10 Appendix A Final Status

This appendix establishes only mathematical background. It does not establish any uniquely CBR-specific theorem. Its function is to make clear which parts of the main text rely on standard mathematics and which parts rely on framework-specific postulation or interpretation.

Appendix B. Notation and Symbol Index

B.0 Purpose

The purpose of this appendix is to centralize the notation of the volume. The notation index is not merely a convenience. In a theory built around several nested spaces, channel classes, context objects, and claim-status distinctions, notation drift is a real risk. This appendix is therefore part of the book’s precision discipline.

B.1 Hilbert-Space and Operator Symbols

𝓗 denotes a Hilbert space.

𝓗ₛ denotes the system Hilbert space.

𝓗ₐ denotes the apparatus Hilbert space.

𝓗ₑ denotes the environment Hilbert space.

𝓗ᵢₙ and 𝓗ₒᵤₜ denote input and output Hilbert spaces for channels.

𝓑(𝓗) denotes the bounded operators on 𝓗, in the finite-dimensional setting used throughout the volume.

𝒟(𝓗) denotes the density operators on 𝓗.

ρ, σ denote density operators.

X, Y denote general operators.

I denotes the identity operator on the relevant space.

Tr denotes the trace.

Trₓ denotes the partial trace over subsystem x.

supp(ρ) denotes the support of ρ.

B.2 Channel and Instrument Symbols

Φ, Ψ denote channels or process maps.

𝓘ᵢ denotes the i-th branch of an instrument.

J(Φ) denotes the Choi operator of Φ.

Ĉ(Φ) denotes a normalized Choi representation of Φ.

𝒜(C) denotes the admissible class of realization channels associated with context C.

Φ∗ denotes a selected minimizer or realized channel, depending on context and claim status.

B.3 Context and Record Symbols

C denotes a measurement context.

Πᴿ denotes the record partition of a context.

Rᵢ denotes the i-th candidate record sector.

𝒪 denotes the public readout structure.

Σ denotes the operational setting of the context.

ℛef(C) denotes the reference family used in divergence-based candidate realization functionals.

B.4 Functional and Statistical Symbols

ℛ꜀ denotes the realization functional associated with context C.

D(ρ ∥ σ) denotes quantum relative entropy.

p(i) denotes an outcome probability.

pᴮ(i) denotes the Born weight of outcome i when that distinction is useful.

fₙ(i) denotes empirical frequency after n repeated admissible trials.

B.5 Claim-Status Labels

The book uses the following labels in a binding way:

Definition
Axiom
Assumption
Lemma
Proposition
Theorem
Corollary
Conjecture
Interpretive Claim
Empirical Hypothesis
Heuristic Remark
Open Question

These are not stylistic tags. They indicate logical and evidential status.

B.6 Appendix B Final Status

This appendix makes no new claims. It functions as a formal indexing tool for the rest of the book.

Appendix C. Extended Running Example

C.0 Purpose

The purpose of this appendix is to develop the canonical running example of Volume I more explicitly than the main text permits. The example is not intended as a realistic detector model in all laboratory detail. Its role is more specific:

to make the system–apparatus–environment structure explicit
to show how candidate record sectors are constructed
to illustrate admissibility in a simple but nontrivial case
to anchor later abstract claims in one stable model

The running example should be read as a schematic measurement architecture, not as a final empirical theory.

C.1 Full Setup

Let the system Hilbert space be

𝓗ₛ = ℂ²

with orthonormal basis {|0⟩, |1⟩}.

Let the apparatus Hilbert space 𝓗ₐ contain a ready state |Aᵣ⟩ and two macroscopically distinguishable pointer states |A₀⟩ and |A₁⟩.

Let the environment Hilbert space 𝓗ₑ contain a ready state |Eᵣ⟩ and environment states |E₀⟩ and |E₁⟩ correlated with the apparatus records.

Take the total Hilbert space

𝓗 = 𝓗ₛ ⊗ 𝓗ₐ ⊗ 𝓗ₑ.

Take initial state

|ψ₀⟩ = (α|0⟩ + β|1⟩) ⊗ |Aᵣ⟩ ⊗ |Eᵣ⟩,

with |α|² + |β|² = 1.

Assume an interaction U such that

U(|0⟩|Aᵣ⟩|Eᵣ⟩) = |0⟩|A₀⟩|E₀⟩,

U(|1⟩|Aᵣ⟩|Eᵣ⟩) = |1⟩|A₁⟩|E₁⟩.

By linearity,

|Ψ⟩ = U|ψ₀⟩ = α|0⟩|A₀⟩|E₀⟩ + β|1⟩|A₁⟩|E₁⟩.

This is the standard post-interaction predictive structure.

C.2 Effective Registration Structure

If the environmental states satisfy effective decoherence conditions over the operational time interval, so that ⟨E₀|E₁⟩ is negligible in the relevant sense, then the reduced system–apparatus state is approximately

ρₛₐ ≈ |α|² |0⟩⟨0| ⊗ |A₀⟩⟨A₀| + |β|² |1⟩⟨1| ⊗ |A₁⟩⟨A₁|.

This approximation is not itself realization. It is the registration structure on which realization is later posed.

The candidate record sectors are then defined by coarse-graining apparatus–environment configurations around the macroscopically stable structures centered on |A₀⟩|E₀⟩ and |A₁⟩|E₁⟩.

Define:

R₀ = record sector associated with apparatus–environment structures publicly read as outcome 0
R₁ = record sector associated with apparatus–environment structures publicly read as outcome 1

The public readout structure is then

𝒪 = {0, 1}.

C.3 Illustrative Admissible and Inadmissible Channels

To clarify admissibility, define three schematic channels.

The intended measurement channel Φₘ is the physically stable channel induced by U and the context’s operational persistence and accessibility conditions.

An erasing channel Φₑ first correlates the system with pointer sectors and then erases the pointer distinction before public stabilization. This channel is formally legal but violates persistence.

A private-encoding channel Φₚ allows the apparatus-level distinction to disappear while preserving only inaccessible environment microstructure. This violates public accessibility.

The purpose of these schematic alternatives is not to classify all channels on 𝓗, but to show why admissibility is not equivalent to CPTP legality.

C.4 Functional Ordering in the Example

In the provisional multi-term language of the main text, one expects

ℛ꜀(Φₘ) < ℛ꜀(Φₑ),
ℛ꜀(Φₘ) < ℛ꜀(Φₚ),

because:

Φₘ supports stable public record structure
Φₑ fails persistence
Φₚ fails accessibility

This is a schematic ordering only. It is not a fully canonical numerical evaluation.

What matters is not the exact numerical value but the structural logic:

the realization functional is supposed to favor stable, public, compositionally coherent record-bearing processes over unstable or inaccessible ones.

C.5 Why This Example Matters

The running example matters for five reasons.

First, it makes clear why the theory is not only about a system state. The key structures live at the level of process and record architecture.

Second, it shows why decoherence or registration is not identical to realization. The branch-correlated predictive structure is present before one asks which public record is realized.

Third, it gives a clean finite-dimensional context in which admissibility is nonempty.

Fourth, it provides a model against which existence and uniqueness claims can be tested.

Fifth, it prevents the framework from remaining entirely abstract.

C.6 Limits of the Example

The example does not establish:

general uniqueness of the admissible minimizer
canonicality of the realization functional
a field-theoretic or relativistic generalization
empirical distinctness from interpretation-neutral standard quantum theory
independent derivation of Born weights

It should therefore be treated as a structural anchor, not a general proof device.

C.7 Appendix C Final Status

This appendix supplies a fuller worked model for the main text. It strengthens transparency but does not upgrade any claim beyond the status already earned in the body.

Appendix D. Additional Proof Skeletons and Technical Remarks

D.0 Purpose

The purpose of this appendix is to expose the logic of several central results without overloading the main text. These are proof skeletons, not always full publication-level proofs. Their role is to show where the real work of each argument lies and what assumptions are carrying it.

The appendix is especially important because many objections to the framework concern not whether some conclusion is imaginable, but whether the route to that conclusion is explicit.

D.1 Skeleton of Nonemptiness of Admissible Class

Suppose a finite-dimensional context C satisfies:

there exists at least one physically implementable CPTP process
that process aligns with the designated record partition
the induced record structure is publicly accessible and persistent
no exclusion condition removes the process

Then that process belongs to 𝒜(C), so 𝒜(C) is nonempty.

The critical burden is therefore not the formal set-membership conclusion. It is the physical coherence of the context and its record architecture.

D.2 Skeleton of Existence of Minimizer

Suppose:

𝒜(C) is nonempty and compact
ℛ꜀ is lower semicontinuous

Take a minimizing sequence {Φₙ}.

Compactness yields a convergent subsequence Φₙₖ → Φ̄.

Lower semicontinuity yields

ℛ꜀(Φ̄) ≤ lim infₖ→∞ ℛ꜀(Φₙₖ),

so Φ̄ attains the minimum.

The subtle issue in more general settings is not the direct method itself. It is whether admissibility is preserved under closure and whether the chosen topology is physically appropriate.

D.3 Skeleton of Record Consistency of Minimizers

Suppose Φ∗ is a minimizer and every member of 𝒜(C) already satisfies record alignment, public accessibility, and persistence.

Then Φ∗ inherits those properties directly from admissibility.

This is a simple but important point: record consistency is not created by minimization; it is preserved by minimization over a suitably constrained domain.

D.4 Skeleton of Relabeling Invariance

Suppose Φ and Ψ differ only by physically irrelevant redescription preserving all public-record content.

Then Axiom H and the structural requirements on ℛ꜀ imply

ℛ꜀(Φ) = ℛ꜀(Ψ).

Therefore minimizer status is invariant under such redescription.

The difficult part is never the equality statement itself. It is the definition of “physically irrelevant” in a way that does not hide substantive structure.

D.5 Skeleton of Conditional Uniqueness

Suppose:

a minimizer exists
𝒜(C) is convex modulo physical equivalence
ℛ꜀ is strictly convex modulo physical equivalence
symmetry-related duplicates are identified as equivalent

Then if two inequivalent minimizers existed, their convex combination would have strictly smaller value, contradiction.

The result is mathematically straightforward but physically demanding. It depends strongly on admissibility and convexity assumptions.

D.6 Skeleton of Conditional Born Compatibility

Suppose repeated admissible trials preserve:

stable identification of record sectors across trials
public-readout comparability
standard effect weighting at the admissible repeated-trial level

Then the repeated-trial realization frequencies are compatible with the weighting encoded by Tr(ρEᵢ).

This is why the Born result in Volume I is compatibility rather than exact derivation. The repeated-trial assumptions do real work.

D.7 Technical Warning

A proof skeleton can be useful or dangerous.

It is useful when it reveals the core inferential structure.

It is dangerous when it creates the illusion that omitted steps are trivial.

The present appendix should therefore be read as exposing proof architecture, not as pretending that every omitted detail is routine.

D.8 Appendix D Final Status

This appendix clarifies proof logic but does not upgrade proof strength. Any result left conditional in the main text remains conditional here.

Appendix E. Logical Dependency Architecture

E.0 Purpose

The purpose of this appendix is to display the dependency structure of the volume in conceptual and formal terms. A framework becomes much easier to assess when the reader can see which results depend on which definitions, axioms, and assumptions.

This appendix has an additional function: it helps prevent theorem-prose mismatch by making it harder to speak as though a late-stage conclusion were independent of the assumptions that actually generate it.

E.1 Foundational Dependency Structure

The book has seven major layers of dependence.

E.1.1 Problem Layer

The first layer isolates the target problem. The core distinction is between:

evolution
registration
realization

Without this distinction, the later theory has no clear domain.

E.1.2 Context and Record Layer

The second layer defines:

measurement context
candidate record sectors
public record structure
accessibility
persistence
coarse-graining

This layer supports all admissibility language.

E.1.3 Admissibility Layer

The third layer defines the admissible class 𝒜(C) and the exclusion conditions. This layer is structurally central because the realization law operates only on this domain.

E.1.4 Axiomatic Layer

The fourth layer states the internal axioms:

realization domain
single realized channel
record consistency
compositional closure
dynamical compatibility
statistical adequacy
variational ordering
invariance under irrelevant relabeling

E.1.5 Functional Layer

The fifth layer defines:

the abstract realization functional
its structural requirements
provisional concrete forms
divergence-based candidate reformulations

E.1.6 Result Layer

The sixth layer contains:

nonemptiness
minimizer existence
consistency and invariance
conditional uniqueness
conditional Born compatibility
partial structural pressure against non-Born alternatives

E.1.7 Critical and Comparative Layer

The seventh layer contains:

internal objections
comparative placement
formal status ledger
forward program

E.2 Specific Dependency Statements

The definition of measurement context depends on the earlier conceptual distinction between registration and realization.

The admissible class 𝒜(C) depends on the context and record architecture.

The realization functional ℛ꜀ depends on the admissible class and the variational-ordering axiom.

Nonemptiness of 𝒜(C) depends on admissibility and on physical realizability assumptions.

Existence of minimizers depends on nonemptiness, compactness or equivalent control, and lower semicontinuity.

Record consistency of minimizers depends on minimizer existence and on the fact that admissibility already constrains the domain to record-compatible channels.

Relabeling invariance depends on Axiom H and on a physically meaningful equivalence relation.

Conditional uniqueness depends on minimizer existence plus strong assumptions such as convex admissible structure and strict convexity.

Conditional Born compatibility depends not only on the realization framework but also on repeated-trial assumptions preserving the standard weighting structure at the public-record level.

Partial exclusion of non-Born alternatives depends on the conditional Born result together with invariance, repeatability, and compositional demands.

E.3 Why This Matters

This dependency structure matters because many criticisms of the framework amount to saying that one layer is doing more work than the theory admits. For example:

if admissibility does too much work, then the realization law may be underdetermined
if the repeated-trial assumptions do too much work, then the Born result may be circular
if symmetry reduction does too much work, then uniqueness may be weaker than it appears

The dependency architecture therefore helps identify not only how the theory is built, but where it is most vulnerable.

E.4 Appendix E Final Status

This appendix introduces no new results. It is a transparency device for the entire volume.

Appendix F. Terminology Crosswalk and Editorial Discipline

F.0 Purpose

The purpose of this appendix is twofold.

First, it maps the language of the earlier series into the language of the rebuilt series.

Second, it records the editorial discipline governing the new series so that old rhetoric does not silently re-enter under new headings.

This appendix is especially important because the rebuilt Volume I is deliberately more restrained than the earlier work. That restraint must be preserved consistently.

F.1 Terminology Crosswalk

The earlier phrase “completion of quantum mechanics” is replaced in the rebuilt series by more disciplined expressions such as “completion proposal,” “single-outcome completion framework,” or “realization-law proposal,” unless a stronger statement is actually earned later.

The earlier phrase “principled derivation of the Born rule” is replaced by a sharp distinction among exact derivation, compatibility, asymptotic emergence, fixed-point attraction, and uniqueness of Born-consistent minimizer. Volume I claims only conditional compatibility.

The earlier phrase “physical selection law” is retained in spirit, but it is now tied explicitly to the admissible domain plus realization-functional architecture rather than appearing as a freestanding claim of completed necessity.

The earlier emphasis on “mathematical closure” is retained only as a research target. In the rebuilt series it refers to the possibility of narrowing admissibility and functional families enough that the realization law becomes sharply constrained.

The earlier emphasis on “necessity” or “no alternative” is suspended unless theorem-level support is achieved. Such language should not be used prospectively.

The earlier appeal to “empirical discrimination” is retained as a legitimate future ambition, but it is deferred until explicit observables, protocols, scales, and null-result interpretations are available.

F.2 Editorial Discipline for the New Series

The rebuilt series should obey the following editorial rules.

Never call something derived if it is only compatible.

Never call something unique if nearby alternatives remain unexcluded.

Never call something necessary if the theorem proving necessity has not been established under physically defensible assumptions.

Never let the interpretive prose outrun the theorem statements.

Never use the empirical ambition of the framework as though it had already become a tested discriminator.

Never present a restricted finite-dimensional theorem as though it already settled the infinite-dimensional or relativistic case.

These rules are not merely stylistic. They are part of the theory’s credibility strategy.

F.3 Why This Appendix Matters

A rebuilt series can fail if it silently inherits the strongest language of the earlier series without earning it. This appendix prevents that by giving the series a formal memory of its own rhetorical discipline.

F.4 Appendix F Final Status

This appendix introduces no new theorem-level content. Its role is continuity control and editorial rigor.

Appendix G. Open Problems and Research Agenda

G.0 Purpose

The purpose of this appendix is to state the real research agenda of the framework after Volume I. A theory becomes stronger when it identifies the open problems that would decide its future status. This appendix therefore does not list minor extensions or decorative possibilities. It lists the problems whose resolution would most directly determine whether CBR matures into a constrained law proposal or remains an elegant formal program.

G.1 Admissibility Narrowing

The first and strongest open problem is whether the admissibility class can be narrowed enough to count as genuinely constrained rather than merely filtered.

This problem is central because admissibility sits at the junction of nearly every major concern:

realization-functional non-arbitrariness
uniqueness of minimizer
compositional coherence
Born non-circularity
empirical sharpness

A strong future result would show either:

that only a restricted admissibility schema can satisfy the framework’s axioms and consistency conditions, or
that alternative admissibility schemas lead to contradiction, instability, or empirical failure.

Without such narrowing, the theory remains vulnerable to the charge of engineered success.

G.2 Functional Canonicality

The second major open problem is whether the realization functional can be shown to belong to a sharply constrained family under independent principles.

This problem includes several subquestions:

Can the abstract structural requirements force a restricted divergence family?
Can alternative divergence families be ruled out by invariance, monotonicity, or compositional conditions?
Can the reference-family dependence in the relative-entropy reformulation be made non-arbitrary?

A successful result here would be one of the biggest upgrades the theory could achieve.

G.3 Born Non-Circularity

The third major open problem is whether the Born-related program can move beyond compatibility without hidden importation.

This requires analysis of every potential smuggling site:

admissibility
realization functional
reference family
repeated-trial assumptions
calibration structure
public-record matching conditions

A genuinely stronger future volume would need to show either:

a derivation from premises less structurally aligned with Born weighting, or
a proof that no stronger derivation is available and that compatibility is the correct final claim

Either result would be valuable. Ambiguity is the weakest option.

G.4 Uniqueness Beyond Strong Assumptions

The uniqueness theorem of Volume I depends on strong assumptions such as strict convexity and symmetry reduction. A major open problem is whether uniqueness can survive under weaker and more physically natural assumptions.

This is not only a mathematical issue. It directly bears on whether the single-outcome axiom can be supported by the theory’s own variational architecture rather than merely asserted.

G.5 Composite-System and Relativistic Extension

A serious future version of the theory must address larger composite systems, spacelike-separated contexts, and eventually relativistic settings.

The most important issues here are:

admissibility in entangled composite contexts
compositional closure across nested observers and global record structures
spacetime organization of realization in separated measurements
compatibility with relativistic constraints on signaling and description

Volume I does not solve these. It only identifies them.

G.6 Empirical Discrimination

If CBR is to become more than a formal completion proposal, it must produce a sharp empirical program.

The required ingredients are:

explicit observables
clean protocol design
predicted deviation form
scale estimates
null-result interpretation
comparison with both standard quantum theory and rival completion frameworks

An empirical program that remains only qualitative would not be enough.

G.7 Rival Comparison at Theorem Level

The comparative chapter of Volume I is architectural. A later research agenda must elevate that into theorem-level comparison.

For example:

What exactly does decoherence explain that CBR still postulates?
What explicit ontological work does Bohmian mechanics do that CBR avoids or leaves unresolved?
What empirically sharp structures do objective collapse models provide that CBR still defers?
What explanatory tasks do Everettian frameworks handle differently at the level of branch structure and probability?

The future of CBR depends partly on being able to answer those questions precisely.

G.8 Strongest Open Problem

The strongest open problem after Volume I can be stated in one sentence:

Can the admissibility-plus-functional architecture be narrowed enough that the realization law appears constrained rather than designed?

This is the problem on which the entire rebuilt series most strongly depends.

G.9 Research Priority Ordering

If later work is sequenced correctly, the priority order should be:

first, admissibility narrowing
second, functional canonicality
third, Born non-circularity
fourth, uniqueness under weaker assumptions
fifth, empirical discrimination
sixth, broad comparative theorem-level refinement
seventh, larger composite and relativistic extension

This order matters because later tasks depend heavily on earlier ones.

G.10 Appendix G Final Status

This appendix states the real research agenda of the theory. It introduces no solution to those problems, but it identifies the problems that matter most.

Final Appendix Ledger

The appendix section as a whole establishes the following.

It gives the mathematical background needed to distinguish standard formal tools from CBR-specific commitments.

It centralizes notation and claim-status language so the volume can be read without ambiguity.

It expands the canonical running example into a more explicit structural model.

It exposes the logical skeleton of the core proofs.

It maps the dependency architecture of the framework.

It preserves continuity with earlier terminology while preventing older rhetorical excess from silently governing the rebuilt series.

It identifies the open problems most likely to decide whether the theory matures or stalls.

What the appendices do not do is equally important.

They do not strengthen any theorem beyond the formal status earned in the main text.

They do not convert conditional results into established ones.

They do not resolve the framework’s central vulnerabilities.

The strongest unresolved concern remains unchanged across both main text and appendices:

the core variational architecture may still be too underdetermined to count as a uniquely constrained realization law.

Robert Duran IV

Constraint-Based Realization Volume I: Minimal Axioms, Formal Core, and the Law of Outcome Selection

Copyright Page

Dedication

Epigraph

Abstract

Preface

How to Read This Book

Purpose of this Guide

General Reading Logic

Recommended Reading Path for Physicists

Recommended Reading Path for Mathematicians

Recommended Reading Path for Philosophers of Physics

Recommended Reading Path for Advanced General Readers

Foundational Chapters

Chapters Optional on First Reading

Notation Conventions

How Claim Status Is Marked

How to Read the Born-Related Chapters

Suggested Second Reading

Final Reading Advice

Formal Synopsis

Purpose of the Formal Synopsis

Position Within the Book

Local Problem Statement

Dependencies

S.1 Primitive Objects

Purpose

Definition S.1.1. Measurement Context

Remark S.1.2

Definition S.1.3. Record Sector

Definition S.1.4. Admissible Realization Channel

Definition S.1.5. Realization Functional

Remark S.1.6

Definition S.1.7. Realized Channel

S.2 Admissibility Schema

Purpose

Local Problem Statement

Assumption S.2.1. Nonemptiness of Admissible Class

Assumption S.2.2. Record Alignment

Assumption S.2.3. Public Accessibility

Assumption S.2.4. Compositional Consistency

Assumption S.2.5. Redescription Invariance

Remark S.2.6

S.3 Realization Rule

Purpose

Axiom S.3.1. Variational Realization Rule

Remark S.3.2

Interpretation S.3.3

S.4 Structural Requirements on the Realization Functional

Purpose

Assumption S.4.1. Lower Boundedness

Assumption S.4.2. Lower Semicontinuity or Analogous Variational Regularity

Assumption S.4.3. Invariance Under Physically Irrelevant Redescription

Assumption S.4.4. Compositional Compatibility

Assumption S.4.5. Sensitivity to Record Degradation

Remark S.4.6

S.5 Main Result Targets of Volume I

Purpose

Theorem Target S.5.1. Existence of Admissible Candidates

Theorem Target S.5.2. Existence of Minimizers

Theorem Target S.5.3. Public Record Consistency

Theorem Target S.5.4. Invariance Results

Theorem Target S.5.5. Conditional Uniqueness

Theorem Target S.5.6. Conditional Born Compatibility

Remark S.5.7

S.6 Exact Status of the Born Claim

Purpose

Definition S.6.1. Born Compatibility

Definition S.6.2. Born Derivation

Definition S.6.3. Born Uniqueness

Claim-Status Statement S.6.4

Non-Circularity Warning S.6.5

S.7 Claim-Status Table

Purpose

Remark S.7.1

S.8 Failure Conditions

Purpose

Failure Condition S.8.1. Admissibility Underdetermination

Failure Condition S.8.2. Functional Non-Canonicity

Failure Condition S.8.3. Hidden Born Importation