Constraint-Based Realization, Volume IV | Canonicality, Non-Circularity, and the Born Rule

---

Copyright Page

Constraint-Based Realization, Volume IV: Canonicality, Non-Circularity, and the Born Rule

Copyright © Robert Duran IV. All rights reserved.

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

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

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

First edition.

Printed in the United States of America.

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

---

Abstract

This volume examines whether the Constraint-Based Realization framework can be advanced beyond conditional Born compatibility toward a more independent realization-theoretic account of quantum weighting. The question is not whether Born-consistent statistics can be recovered under favorable assumptions. That question has already been partly addressed. The question here is narrower and more demanding: whether the internal structure of CBR can support a route from admissible realization principles to uniquely justified Born weighting without covert importation of amplitude-squared preference.

The analysis is organized around four linked burdens. The first is the canonicality of the realization functional ℛ, since a merely narrowed family of admissible realization maps remains weaker than a law-level result. The second is the Born-neutrality of the admissibility and invariance principles, because any premise set that already privileges amplitude-squared structure cannot ground an independent derivation. The third is the exclusion of serious non-Born weighting families under shared structural burdens, including composition, coarse-graining, redescription invariance, and repeated-trial discipline. The fourth is the status of Born weighting within admissible realization dynamics, specifically whether it is merely one admissible survivor, the unique admissible weighting law on a defined class, or the unique stable fixed point of an admissible update structure.

The central aim of the volume is therefore not rhetorical closure, but formal status determination. The relevant outcomes are sharply distinguished: Born compatibility, Born adequacy, broad rival exclusion, weighting-law uniqueness, attractor status, restricted-domain exact derivation, or else a principled impossibility boundary. Throughout, proof, dependence, and limitation are treated as coequal. A positive result that remains conditional is stated as conditional. A uniqueness claim that holds only up to operational equivalence is stated in that weaker form. A derivation that fails because of unresolved neutrality is not redescribed as closure.

Accordingly, the volume is constructed as a theorem-driven pressure test of the CBR program. If the framework can support a non-circular route to Born weighting, this volume is the place where that route must become explicit. If it cannot, the volume aims to identify the exact obstruction rather than conceal it behind compatibility language. Its standard is therefore not conceptual suggestiveness, but formal clarity about what the realization architecture does, does not, and cannot yet establish.

---

Preface

This volume is the formal pressure point of the refined Constraint-Based Realization sequence. Its task is not to enlarge the framework, but to subject its most ambitious unresolved claim to disciplined scrutiny.

Volume I established the basic realization architecture and made a foundational distinction that governs the entire series: the distinction between unitary evolution, measurement registration, and outcome realization. In doing so, it recast the measurement problem in terms of a realizational burden rather than a merely interpretive one. It also stated with unusual clarity that the standing of Born weighting remained conditional. The contribution of that volume was therefore architectural rather than final. It aimed to define the problem in a form suitable for theorem-level pressure, not to claim that the problem had already been closed.

Volume II imposed the next necessary restriction. It narrowed the admissible class of realization functionals, developed stronger local and generic uniqueness results, and directly confronted the fact that compatibility with Born weighting is weaker than independent derivation of Born weighting. Its central methodological gain was reduction of arbitrariness. Its central philosophical gain was reduction, though not elimination, of circularity exposure. Yet the volume also made clear that a restricted canonical family is not the same as a uniquely forced law, and that conditional non-circularity reduction is not the same as full Born-neutrality.

Volume III shifted the burden from formal architecture to operational exposure. It asked whether the realization framework could be made scientifically accountable in a way that was not merely conceptual. In doing so, it moved the program closer to empirical seriousness, but it did not settle the formal issue on which the stronger standing of the theory ultimately depends. Operational meaningfulness and conditional testability do not by themselves establish independent weighting.

The present volume therefore takes up the decisive unresolved question left by the prior sequence:

Can CBR support a genuinely non-circular route to uniquely justified Born weighting, or does the framework stop short of that target for principled reasons?

This question is more difficult than asking whether Born-consistent behavior can be reproduced. It is also more important. A framework may be compatible with Born weighting and yet fail to derive it. It may sharply narrow the admissible structure and yet still leave hidden arbitrariness at the level that matters scientifically. It may exclude several rival families and yet fail to show that its own premises are neutral with respect to the very weighting law they later appear to recover. For these reasons, the present volume is organized not around affirmation, but around burden.

Four burdens govern the analysis.

The first is canonicality. If the realization architecture leaves a residual plurality of admissible functionals with distinct weighting consequences, then no law-level result has been achieved. The strongest possible closure would require uniqueness of ℛ up to trivial equivalence. A slightly weaker but still scientifically significant result would be uniqueness of the induced weighting law 𝑊ℛ across the full admissible class relevant to the problem.

The second is non-circularity. Any derivation that relies on admissibility conditions, invariance assumptions, or calibration procedures that already privilege amplitude-squared structure fails as an independent derivation, however elegant its later formal steps may be. Accordingly, this volume treats Born-neutrality not as a rhetorical claim, but as an object of direct analysis.

The third is rival exclusion. A weighting law is not strengthened merely because alternatives have not yet been formalized. Serious non-Born rivals must be defined, burdened by the same structural requirements imposed on Born weighting, and either excluded, collapsed into Born-equivalent form, or confined to sharply identified exceptional regimes.

The fourth is uniqueness or attractor status. Even if Born weighting survives all admissibility burdens, it matters whether it survives as one admissible possibility, as the unique admissible weighting law on a specified domain, or as the unique stable fixed point of an admissible realization dynamics. These are not interchangeable achievements and will not be treated as such.

This volume is therefore not a general introduction, and it does not aim to restate the full CBR architecture for first contact. It is a theorem-driven closure attempt. Its governing standard is severe: every major claim must be classified by strength, every proof must display its premises, and every unresolved dependence must be named rather than obscured. Where exact derivation cannot be established, the text will say so. Where only restricted-domain closure is achieved, the restriction will be explicit. Where a theorem fails globally, the obstruction will be recorded as part of the result rather than hidden in the margins.

The broader aim is not simply to strengthen CBR, but to force a mature accounting of what the framework has actually earned. If Volume IV succeeds, it will do so by reducing ambiguity. It will either establish a stronger, more independent route to Born weighting than the prior volumes could justify, or it will narrow the failure point with enough precision that future work need no longer proceed under diffuse uncertainty.

That is the task of this volume. It is not to sound decisive. It is to determine, with maximum formal discipline, how much decisiveness the framework can bear.

---

Roadmap of Claim Strength

1. Purpose of the classification

The central burden of this volume is not merely to develop results, but to classify them correctly. In foundational work on quantum weighting, one of the most common sources of overstatement is the failure to distinguish among forms of success that differ sharply in epistemic and mathematical force. A framework may reproduce Born-consistent behavior without deriving Born weighting. It may exclude several rival families without establishing uniqueness. It may show attractor behavior without showing that the underlying dynamics are themselves Born-neutral. For this reason, the present volume adopts an explicit hierarchy of claim strength and requires all subsequent theorems to be interpreted within it.

The hierarchy below is not ornamental. It is a control device. Its function is to prevent local formal progress from being redescribed as stronger global closure than the proofs warrant.

2. Hierarchy of Born-related claims

2.1 Born compatibility

A realization architecture has Born compatibility if there exists an admissible realization functional ℛ, or admissible family of realization functionals, such that the induced weighting law is consistent with Born weighting under a specified premise set.

In this minimal sense, the framework permits Born-consistent assignment. Compatibility does not imply uniqueness. It does not imply rival exclusion. It does not imply independence of premises. It is therefore the weakest positive standing considered in this volume.

Formally, one may say that CBR has Born compatibility on a domain 𝒦 if ∃ ℛ ∈ 𝒜 such that 𝑊ℛ = 𝑤ᴮ on 𝒦, where 𝒜 is the admissible realization class and 𝑤ᴮ denotes Born weighting on that domain.

2.2 Born adequacy

A realization architecture has Born adequacy if Born weighting is reproduced across a defined admissible class of contexts rather than merely in isolated or engineered cases.

Adequacy is stronger than compatibility because it requires systematic reproduction over a structured domain. Yet adequacy remains weaker than exclusion, uniqueness, or derivation. A framework may be adequate even while multiple distinct weighting laws remain admissible under nearby or rival premise choices.

Formally, Born adequacy on a domain 𝒦 requires that ∀ contexts C ∈ 𝒦, the induced weighting law 𝑊ℛ(C) coincides with 𝑤ᴮ(C) under the specified admissible premise set. Adequacy may hold for a particular ℛ, for a restricted canonical family, or for all admissible ℛ in a domain. These cases must be distinguished and not conflated.

2.3 Born exclusion

A realization architecture achieves Born exclusion when serious non-Born rival weighting families are ruled out under the same structural burdens imposed on Born weighting.

This is a theorem-level strengthening because it shifts the burden from permissibility to competition. A weighting law that survives only because rivals have not been formalized has weak standing. A weighting law that remains after serious rivals are subjected to shared admissibility, invariance, composition, and repeated-trial constraints has stronger standing.

Formally, let ℂ be a comparison class of serious rival weighting families 𝑤ᵣ. Born exclusion on a domain 𝒦 holds if every 𝑤ᵣ ∈ ℂ either:

• violates at least one physically justified admissibility condition,

• collapses into Born-equivalent form under admissibility completion,

• or survives only in an explicitly characterized exceptional set ℰ ⊂ 𝒦.

Exclusion may be local, generic, or global. It may also be exact or only broad. These distinctions matter and will be stated each time they arise.

2.4 Born uniqueness

A realization architecture has Born uniqueness if Born weighting is the unique admissible weighting law in a specified domain under the given premise class.

This is substantially stronger than exclusion as ordinarily stated, because uniqueness is not merely the elimination of named rivals but the absence of any distinct admissible competitor within the relevant formal space. The relevant notion of uniqueness must itself be specified. Exact uniqueness of ℛ is stronger than uniqueness of the induced weighting law 𝑊ℛ, and global uniqueness is stronger than local or generic uniqueness.

Formally, Born uniqueness on a domain 𝒦 holds if for every admissible realization functional ℛ ∈ 𝒜, the induced weighting law satisfies 𝑊ℛ = 𝑤ᴮ on 𝒦, or, in the stronger form, if ℛ itself is unique up to trivial equivalence and induces 𝑤ᴮ.

The present volume will carefully separate:

• exact functional uniqueness

• uniqueness up to trivial equivalence

• weighting-law uniqueness

• restricted-domain uniqueness

• generic uniqueness outside an exceptional set ℰ

No theorem establishing one of these shall be redescribed as though it established all of them.

2.5 Born attractor status

A realization architecture has Born attractor status if Born weighting is the unique stable fixed point of an admissible realization dynamics on an appropriately defined weighting space Ω.

This claim belongs to a different logical category from static uniqueness. It concerns dynamical stability rather than immediate admissibility. It may strengthen explanatory standing by showing that admissible realization updates drive weighting structure toward Born behavior. Yet attractor status is not identical to exact derivation. A strong attractor theorem still depends on whether the update operator 𝒯 itself has been defined by Born-neutral premises.

Formally, if 𝒯: Ω → Ω is an admissible update operator on weighting space, then Born attractor status requires:

• 𝒯(𝑤ᴮ) = 𝑤ᴮ,

• 𝑤ᴮ is stable under admissible perturbation,

• and no distinct admissible weighting law 𝑤 ≠ 𝑤ᴮ is equally stable on the same basin, or, in stronger form, on all of Ω outside a specified exceptional region.

The strength of an attractor result therefore depends both on the dynamical theorem and on the neutrality of 𝒯.

2.6 Exact derivation

A realization architecture achieves exact derivation if Born weighting follows from Born-neutral premises without covert insertion of amplitude-squared structure.

This is the strongest claim considered in the volume and the one most vulnerable to overstatement. Exact derivation is not established merely because Born weighting is recovered. It is established only if the premises do not already encode the relevant preference by stipulation, calibration convention, hidden equivalence restriction, admissibility bias, or stability criterion.

Accordingly, exact derivation requires all of the following in some sufficiently strong form:

• a premise class 𝒜 whose core admissibility and invariance conditions are Born-neutral,

• a realization architecture whose residual arbitrariness has been reduced to irrelevance or eliminated,

• exclusion or collapse of serious non-Born rivals under shared burdens,

• and uniqueness, or equivalently strong closure, of the induced weighting law on the target domain.

If any of these fail, the work may still establish adequacy, exclusion, uniqueness, or attractor status. But it has not established exact derivation.

3. Categories of premise dependence

The strength of any Born-related result depends not only on the theorem proved, but on the status of the premises from which it is proved. Accordingly, every major theorem in this volume should be read against the following dependence classification.

3.1 Neutral premise

A premise Π is neutral if it does not privilege Born weighting over serious rival weighting families except by theorem-level consequence grounded in physically justified structure.

Neutrality here means more than intuitive harmlessness. A premise is not neutral merely because it appears natural or elegant. It is neutral only if, under appropriate rival substitution and invariance testing, it leaves the relevant comparative space open until the formal argument closes it.

Typical candidates for neutrality include principles motivated by operational indistinguishability, redescription invariance, or composition coherence, but even these must be tested rather than presumed.

3.2 Conditionally neutral premise

A premise Π is conditionally neutral if it does not obviously privilege Born weighting, but its neutrality has been established only relative to a restricted rival class, a limited domain, or a stronger background assumption not yet shown to be fully neutral itself.

Conditionally neutral premises are extremely important because much of serious foundational progress occurs at this intermediate level. Yet they cannot support an unconditional derivation claim. They can support conditional adequacy, conditional exclusion, or restricted-domain uniqueness.

A theorem based on conditionally neutral premises must therefore be described as conditional even if its internal formal structure is sharp.

3.3 Born-loaded premise

A premise Π is Born-loaded if it already privileges amplitude-squared weighting by stipulation, disguised normalization choice, calibration convention, admissibility restriction, equivalence rule, or stability criterion.

A Born-loaded premise may still be useful in proving compatibility or adequacy. It may even help clarify how Born-like behavior is preserved under a chosen realization architecture. But it cannot ground an independent derivation. Any theorem depending essentially on such a premise must be classified accordingly.

The central audit task of Volume IV is therefore to determine, premise by premise, which assumptions belong in each category.

4. Why this hierarchy matters

The hierarchy of claims and the classification of premise dependence together provide the interpretive discipline required by the present volume. Without them, four distortions become almost unavoidable:

• compatibility is mistaken for derivation,

• adequacy is mistaken for uniqueness,

• attractor structure is mistaken for independence,

• and intuitive naturalness is mistaken for Born-neutrality.

This volume is designed to prevent each of these mistakes.

The governing rule is simple: every result must be stated at the highest level it honestly earns, and at no higher level. If a theorem yields compatibility under a conditionally neutral premise set, it will be named that way. If a theorem yields generic uniqueness of 𝑊ℛ outside an exceptional set ℰ, that weaker but still important form will be preserved. If an exact derivation fails because one premise remains Born-loaded or only conditionally neutral, that failure will be treated as part of the formal content rather than as an embarrassment to be softened.

5. Status discipline for the rest of the volume

The chapters that follow should therefore be read as attempts to strengthen CBR along this ordered scale of standing. Some chapters will aim primarily at premise classification. Some will aim at canonicality of ℛ or of 𝑊ℛ. Some will aim at rival exclusion. Some will aim at uniqueness or attractor closure. The final status of the program will depend on how these pieces fit together.

The central question is not whether CBR can be made to resemble Born weighting. The central question is whether the realizational architecture, under sufficiently neutral premises, can force Born weighting strongly enough that the result deserves to be called independent rather than merely compatible.

That question governs the volume. The present roadmap specifies the standard by which every subsequent answer must be judged.

---

Part I — Statement of the Problem

Chapter 1. The Exact Burden After Volumes I–III

1.1 What remains unresolved

The prior volumes established a realization-theoretic framework of increasing formal discipline, but they did not settle the question that ultimately determines whether the CBR program can claim more than structured compatibility with standard quantum weighting. That unresolved question is not whether Born-consistent behavior can be reproduced under a suitable admissible architecture. It is whether the framework can support a route to Born weighting whose force is sufficiently strong, sufficiently non-arbitrary, and sufficiently non-circular that it deserves to be treated as a genuine realization-theoretic derivation rather than a constrained reconstruction.

Three unresolved deficiencies define the present burden.

The first is that conditional compatibility is not enough. A framework may be compatible with Born weighting in the sense that there exists an admissible realization functional ℛ whose induced weighting law 𝑊ℛ coincides with Born weighting on a specified class of contexts. But compatibility leaves open at least four possibilities that are fatal to stronger claims. First, Born weighting may be only one among several admissible survivors. Second, the compatibility result may depend on premises whose neutrality has not been established. Third, the result may hold only because rival weighting families were not subjected to equal structural burden. Fourth, the proof may rely on restrictions whose real effect is to encode the target structure in advance. For these reasons, compatibility, even when nontrivial, remains strictly weaker than adequacy, exclusion, uniqueness, or derivation.

The second unresolved deficiency is that narrowed admissible families are not yet canonicality. Volume II materially improved the standing of the framework by reducing the arbitrariness of the realization-functional class. But a narrowed family remains a family. So long as distinct admissible realization maps survive and produce genuinely distinct weighting consequences on scientifically relevant domains, the framework has not yet reached law-level closure. Even where the surviving family is thin, its residual freedom matters unless it can be shown to be trivial, operationally irrelevant, or confined to an explicitly characterized exceptional set ℰ. Canonicality therefore demands more than restriction. It demands either uniqueness of ℛ up to trivial equivalence, or a theorem of equal scientific force showing that all surviving admissible ℛ induce the same weighting law 𝑊ℛ on the relevant domain 𝒦.

The third unresolved deficiency is that operational exposure does not settle formal independence. Volume III strengthened the framework by asking whether it could be brought into principled contact with empirical burden. That move was necessary. But operational seriousness and partial testability do not resolve the foundational issue of whether the weighting structure itself follows from Born-neutral premises. A theory may be operationally meaningful and yet formally dependent on assumptions that covertly privilege the target result. The formal problem of independence is therefore not dissolved by empirical framing. It remains necessary to determine whether the admissibility axioms, invariance principles, equivalence criteria, and repeated-trial structures presuppose more Born content than the later theorems are entitled to recover.

The exact burden of the present volume is therefore defined by the gap between these three partial achievements and the stronger claim they do not yet justify. The task is not to repeat that the framework is compatible with Born weighting, or that its admissible class has been narrowed, or that it has some operational exposure. The task is to determine whether these prior achievements can be integrated into a formally stronger result, or whether one of the remaining structural burdens blocks further advance.

The methodological consequence is immediate. Volume IV cannot be written as a continuation of the prior sequence in the ordinary sense. It must be written as a pressure test. Its purpose is to decide whether the framework can move from organized promise to theorem-level closure, or whether its strongest honest contribution is instead the precise identification of the obstruction that prevents such closure.

1.2 The four unresolved burdens

The unresolved question left by Volumes I–III decomposes into four linked burdens. These burdens are related, but not reducible to one another. Progress on one does not automatically settle the rest.

1.2.1 Canonical ℛ

The first burden is the status of the realization functional ℛ itself. If ℛ remains underdetermined beyond trivial equivalence, then no exact realization law has been isolated. This burden can be relaxed slightly if the induced weighting law 𝑊ℛ is invariant across the full admissible class relevant to the problem, but even then the distinction between exact functional canonicality and weighting-law canonicality must be preserved. The scientific issue is not merely whether some admissible ℛ produces Born weighting, but whether the framework forces a unique realizational structure, or at least a unique weighting consequence, across the relevant domain.

1.2.2 Born-neutral admissibility

The second burden is the neutrality of the premises. A derivation is independent only if the admissibility principles and invariance assumptions do not already privilege the weighting law they later appear to recover. This burden is deeper than the question of whether the premises look natural. Many premises that appear natural can nonetheless be Born-loaded by calibration convention, redescription restriction, repeated-trial structure, or hidden stability choice. The exact problem is therefore not merely physical plausibility, but whether the premise set 𝒜 remains neutral relative to a serious comparison class ℂ of rival weighting families.

1.2.3 Exclusion of non-Born rivals

The third burden is comparative. Even if Born weighting is reproduced under the admissible realization architecture, its standing remains weak unless serious non-Born alternatives are subjected to the same burdens and shown either to fail, to collapse to Born-equivalent form, or to survive only in sharply bounded exceptional regimes. This means that rival families cannot be treated rhetorically. They must be formally defined and evaluated under shared standards of admissibility, composition, coarse-graining coherence, redescription invariance, and repeated-trial discipline.

1.2.4 Uniqueness or attractor closure

The fourth burden concerns the structural status of Born weighting after the rival space has been burdened. It matters whether Born weighting is merely admissible, uniquely admissible, generically unique outside an exceptional set ℰ, or dynamically distinguished as the unique stable fixed point of an admissible update operator 𝒯 on a weighting space Ω. These are distinct achievements. Static uniqueness and dynamical attractor status have different logical content, and neither should be conflated with exact derivation unless the premises on which they rest have themselves passed neutrality scrutiny.

These four burdens jointly define the formal target of the volume. The strongest possible result would integrate all four: a Born-neutral premise class 𝒜, a canonical ℛ or canonical 𝑊ℛ, broad exclusion of serious rivals, and uniqueness or equivalent closure sufficient to support exact derivation. A weaker but still important result would establish only some of these under restricted-domain assumptions. An equally important negative result would show that one of these burdens cannot be crossed under the present architecture.

1.3 Strong and weak versions of each burden

A central discipline of this volume is that each burden must be graded. Without this grading, foundational work tends to overstate its own achievements by sliding from weak accomplishment to strong accomplishment without argument. The present section therefore fixes the internal scale.

1.3.1 Canonicality

For canonicality, three levels must be distinguished.

A weak accomplishment consists in a materially narrowed admissible family 𝔄ℛ. This is already significant because it reduces arbitrariness and restricts the space of admissible realization maps. But it does not yet isolate a law.

A strong accomplishment consists in uniqueness up to operational equivalence or, equivalently, in a theorem that all admissible survivors induce the same weighting law 𝑊ℛ on the scientifically relevant domain 𝒦. This is weaker than exact functional uniqueness, but it may still be sufficient for the weighting problem.

An exact accomplishment consists in the statement that ℛ is uniquely forced up to trivial equivalence. Here “trivial equivalence” must be explicitly defined and shown not to conceal physically relevant freedom.

1.3.2 Born-neutrality

For Born-neutrality, the levels are even more delicate.

A weak accomplishment consists in a reduction of circularity exposure. This means that some premises previously suspected of Born loading are shown either to be less dangerous than they appeared or to matter only in limited contexts.

A strong accomplishment consists in showing that all core premises are neutral relative to a serious rival class ℂ on a defined domain 𝒦. This does not yet imply global neutrality, but it materially strengthens the independence standing of the framework.

An exact accomplishment consists in proving that the premise set does not privilege Born structure under any admissible redescription, calibration convention, or rival substitution within the full targeted comparison class. This is the hardest form of the burden and likely the least easily achieved.

1.3.3 Rival exclusion

For rival exclusion, the scale is as follows.

A weak accomplishment consists in ruling out ad hoc or obviously pathological rivals that fail immediately under minimal admissibility. Such results are useful but not decisive.

A strong accomplishment consists in excluding all serious rival weighting families in a defined comparison class ℂ under shared structural burdens, or showing that any survivors are confined to an explicitly bounded exceptional set ℰ that is physically unstable, scientifically irrelevant, or structurally pathological.

An exact accomplishment consists in proving that no distinct non-Born weighting law remains admissible on the domain 𝒦 once the full physically justified premise set is imposed. This borders on uniqueness and should not be claimed unless the comparison space has been defined with great care.

1.3.4 Uniqueness or attractor closure

For uniqueness and attractor structure, the levels again differ.

A weak accomplishment consists in local uniqueness, or in showing that Born weighting is a fixed point of an admissible update operator 𝒯.

A strong accomplishment consists in generic uniqueness outside an exceptional set ℰ, or in showing that Born weighting is the unique stable attractor on a broad basin within Ω.

An exact accomplishment consists either in global uniqueness of the weighting law on the full admissible domain or in a global attractor theorem under a premise class already shown to be Born-neutral. Without neutrality of the dynamics themselves, even a strong attractor theorem does not rise to exact derivation.

This grading is not merely classificatory. It determines how later theorems must be described. Every major result in this volume should therefore state not only what it proves, but where on this scale it belongs.

1.4 Success conditions for Volume IV

The success condition for the present volume must be stated with unusual care because the wrong statement of success would already weaken the book.

Volume IV does not succeed merely by extending the formal architecture, multiplying theorem statements, or making the route to Born weighting sound more sophisticated. It succeeds only if it does one of two things.

First, it succeeds if it proves a substantially stronger Born standing than prior volumes. This need not mean full global exact derivation. A restricted-domain exact derivation, a genuine theorem of weighting-law canonicality, a broad rival-exclusion result under shared burdens, or a strong neutrality result that materially alters the evidential standing of the framework may each count as substantive success, provided their strength is stated honestly.

Second, it succeeds if it identifies a mathematically precise obstruction that prevents further strengthening under the present architecture. This negative outcome would still be a major contribution, because it would replace diffuse uncertainty with a sharply bounded frontier. A theorem-level obstruction is stronger than a merely incomplete ambition.

Accordingly, the governing success principle of the volume is the following:

Volume IV succeeds if it either raises the formal standing of CBR in a clearly classifiable way, or precisely identifies the theorem-level obstruction that prevents such elevation under the present premise class.

This criterion is stronger than promising victory. It refuses the usual foundational temptation to treat every sharpened restatement as progress. It also makes room for an outcome that is scientifically mature even if it is not triumphant: the discovery that exact derivation remains blocked, but blocked for named and formally analyzable reasons.

The chapters that follow should be read under this standard. The point is not to guarantee closure. The point is to force the framework into a position where closure, partial closure, or principled non-closure can be determined with precision.

Chapter 2. Taxonomy of Born Claims

2.1 Why “derivation” is often overstated in foundational work

The term “derivation” is one of the most overloaded terms in quantum foundations. It is frequently used to cover results that differ sharply in logical force, dependence structure, and explanatory value. A framework may be said to “derive” Born weighting because it recovers amplitude-squared behavior under a favored symmetry, under a repeated-trial limit, under a rationality constraint, under an equivalence principle, or under a selected dynamics. Yet these achievements are not equivalent. In many cases, the allegedly derived structure is already encoded in the premise set at a depth that has not been adequately audited.

The overstatement typically enters through one of four pathways.

First, a result of compatibility is redescribed as a result of derivation. If a framework permits Born weighting under a chosen admissible architecture, this already counts as progress in a weak sense. But it does not follow that Born weighting is forced.

Second, a result of adequacy is redescribed as uniqueness. If the framework reproduces Born weighting across a domain 𝒦, this may establish systematic fit. But multiple weighting laws may still survive under nearby admissible choices.

Third, a result of stability is redescribed as independence. A fixed-point or attractor theorem may show that Born weighting is dynamically distinguished, but such a result still depends on whether the update operator 𝒯 itself was defined by Born-neutral principles.

Fourth, a result of formal elegance is mistaken for non-circularity. A clean theorem may still rely on premises that covertly privilege amplitude-squared structure through calibration, equivalence criteria, coarse-graining rules, or admissibility restrictions.

For these reasons, the present volume refuses to use the word “derive” without a prior classification of claim strength. The guiding principle is simple: derivation is not whatever yields the target result. Derivation is a high-level achievement whose legitimacy depends on what remained live when the proof began.

2.2 Formal hierarchy of claims

The relevant hierarchy for this volume is:

compatibility < adequacy < exclusion < uniqueness < fixed-point status < exact derivation

Each term requires separate definition.

A framework has compatibility with Born weighting on a domain 𝒦 if ∃ ℛ ∈ 𝔄ℛ such that 𝑊ℛ = 𝑤ᴮ on 𝒦.

A framework has adequacy if ∀ C ∈ 𝒦, the induced weighting law reproduces Born weighting across the specified class of contexts under the designated premise set.

A framework has exclusion if a defined comparison class ℂ of serious rival weighting laws is shown to fail under the same admissibility burdens imposed on Born weighting, or survives only in an explicitly bounded exceptional set ℰ.

A framework has uniqueness if no distinct admissible weighting law remains on the domain 𝒦 once the stated premise class has been imposed. This may concern exact ℛ-uniqueness, uniqueness up to trivial equivalence, or uniqueness of 𝑊ℛ only.

A framework has fixed-point status if Born weighting is dynamically distinguished under an admissible update operator 𝒯: Ω → Ω, for example by satisfying 𝒯(𝑤ᴮ) = 𝑤ᴮ and possessing stability properties not shared by serious alternatives.

A framework has exact derivation only if Born weighting follows from a premise class whose core admissibility, invariance, equivalence, and calibration structures are themselves Born-neutral, such that the target result is not covertly preloaded.

The hierarchy is strict. Each level presupposes, strengthens, or conditions the previous ones, but none can be substituted for a higher one by rhetoric alone.

2.3 Covert importation

The central adversarial concern of the volume is covert importation of Born structure. This occurs when the target weighting law is effectively inserted into the premises through a route not acknowledged at the level of claim.

A premise set 𝒜 is Born-neutral only if Born weighting is not privileged within 𝒜 by any of the following:

• stipulation, where amplitude-squared behavior is effectively assumed in the admissibility definition;

• calibration convention, where the measurement or repeated-trial structure is fixed in a way that preselects the target weighting;

• equivalence restriction, where only those descriptions or rival families compatible with Born weighting are allowed to count as physically admissible;

• hidden stability choice, where the update rule or equilibrium criterion has already selected the target law.

More formally, let ℂ be a serious rival class. Then 𝒜 is Born-neutral relative to ℂ only if, before theorem-level argument begins, the premises do not eliminate all 𝑤ᵣ ∈ ℂ except by physically justified structural consequence. If the rival class is excluded in advance by premise design, the later theorem may still be mathematically clean, but it does not establish independent weighting.

The importance of this definition is methodological. The burden of non-circularity is not discharged by asserting that the premises are natural. It is discharged only by showing that their naturalness does not function as disguised preference.

2.4 The standard of independence

A derivation counts as independent only if four conditions hold simultaneously.

First, the admissible rival class remains live at the start. That is, serious non-Born weighting families must survive into the theorem space rather than being dismissed by prior convention.

Second, the admissibility principles do not already encode amplitude-squared preference. This requires audit not only of explicit axioms but of equivalence rules, composition laws, coarse-graining constraints, and repeated-trial structures.

Third, the proof does not rely on Born-specific repeated-trial calibration. Repeated-trial frameworks are especially vulnerable to covert importation because limit procedures, calibration rules, and law-of-large-number structures can silently encode the target weighting.

Fourth, the conclusion is not merely a restatement of imposed invariance. If the chosen invariance principle already isolates Born weighting and no serious rival can satisfy it for reasons that have not themselves been justified independently, the result may still be useful, but it is not fully independent.

These four conditions define the standard of independence for the volume. They are deliberately severe. A weaker standard might produce a smoother narrative, but it would not produce a more credible theorem.

2.5 Burden ordering

The ordering

compatibility < adequacy < exclusion < uniqueness < derivation

holds because each stage answers a stronger question than the stage before it.

Compatibility answers: Can the framework permit Born weighting?

Adequacy answers: Can the framework reproduce Born weighting systematically across a domain?

Exclusion answers: Do serious alternatives fail under the same structural burdens?

Uniqueness answers: Does any distinct admissible weighting law remain?

Derivation answers: Does the uniquely surviving weighting law follow from Born-neutral premises rather than from covertly selective ones?

Fixed-point or attractor status fits between uniqueness and derivation only conditionally. A strong attractor theorem may give explanatory reinforcement, but its rank depends on whether the dynamics are neutral. If not, attractor status may remain below true derivation even when it exceeds mere static adequacy.

This burden ordering is not semantic. It governs the interpretive discipline of the entire volume. Each later chapter must therefore state exactly which question it answers and which stronger question it leaves open.

---

Part II — Formal Framework

Chapter 3. Realization-Theoretic Setting

3.1 Basic structures

The purpose of the present chapter is not to restate all prior formal machinery, but to fix the minimal setting required for the theorem program of Volume IV. Only those structures needed for the canonicality, neutrality, rival-exclusion, and uniqueness burdens are retained.

Let ℋ denote a complex separable Hilbert space representing the kinematic state space of the physical system under consideration. Let 𝒟(ℋ) denote the convex set of density operators on ℋ. A measurement context is represented not merely by an observable label, but by a full registration structure specifying the admissible record architecture through which outcomes are made available for realization analysis.

This distinction is central. The framework separates:

• pre-measurement evolution, governed by ordinary quantum dynamics prior to outcome registration;

• registration, by which a measurement context induces a physically meaningful partition of the admissible outcome space;

• realization, by which one member of the admissible registered structure becomes the realized outcome in the sense relevant to the measurement problem.

The distinction between registration and realization prevents the weighting problem from collapsing into purely instrumental description. Registration concerns what outcome structure is physically available. Realization concerns how one admissible member of that structure acquires realized status.

Let an instrument ℐ determine the registered outcome architecture. Let 𝒫 = {Eᵢ} denote the associated admissible outcome partition, where the Eᵢ represent the registered outcome classes relevant to the context. The exact representation of 𝒫 may vary with the measurement model, but the role of 𝒫 in this volume is fixed: it defines the admissible target space over which realization weighting is to be assessed.

3.2 Admissible realization maps

A realization channel is a map

ℛ: 𝒟(ℋ) → 𝒟(ℋ)

intended to represent the realizational layer of the framework. The present volume does not assume that every mathematically definable ℛ is physically admissible. Instead, admissibility is burdened by a family of constraints developed in Chapter 4.

Let 𝔄ℛ denote the class of admissible realization channels under the current premise set. Membership in 𝔄ℛ will depend on registration consistency, normalization, coherence under coarse-graining and composition, and other admissibility principles still to be stated and audited.

Associated with each ℛ ∈ 𝔄ℛ is an induced weighting map

𝑊ℛ: (ρ, 𝒫, C) ↦ 𝑤ℛ(· ∣ ρ, 𝒫, C)

where C denotes the relevant context data and 𝑤ℛ assigns realization weights over the admissible outcome classes of 𝒫. The precise codomain of 𝑊ℛ depends on the granularity of the outcome structure, but in all cases the weighting map must assign normalized weights over the admissible registered partition.

This distinction between ℛ and 𝑊ℛ is essential. Canonicality of ℛ is stronger than canonicality of 𝑊ℛ. Yet for the purposes of the weighting problem, uniqueness of 𝑊ℛ may suffice even where ℛ remains underdetermined up to physically irrelevant structure. One of the main tasks of Volume IV is to determine whether the framework can at least secure the latter.

3.3 Domain structure

Because the strength of later theorems depends on domain, the framework must specify the classes of contexts over which claims are made.

A single-shot context is a realization setting involving one registered outcome structure 𝒫 and one application of the realization map relative to a state ρ ∈ 𝒟(ℋ).

A repeated-trial context is a structured family of single-shot contexts indexed by trial number, together with whatever admissibility assumptions are required to make inter-trial comparison, aggregation, or asymptotic statements meaningful. Such contexts are especially delicate because they are frequent sites of covert calibration.

A composite-system context is a context defined on ℋ₁ ⊗ ℋ₂, where admissibility must be compatible with tensor composition, subsystem restriction, and admissible joint registration structure.

A coarse-grained context is one in which the registered outcome partition 𝒫 is replaced by an admissible coarser partition 𝒫′ obtained by merging outcome classes.

A fine-grained context is one in which the registered outcome architecture resolves distinctions suppressed at a coarser level.

An ancilla-extended embedding is an admissible extension of the original system into a larger Hilbert space ℋ ⊗ ℋₐ such that physically irrelevant extension by ancillary structure does not alter weighting consequences except where the added structure is itself physically operative.

Later claims of adequacy, exclusion, uniqueness, or derivation will always be indexed to a domain 𝒦 built from one or more of these context classes. No theorem should be interpreted more broadly than its stated domain warrants.

3.4 Equivalence relations

Several equivalence relations are needed to avoid false inflation of non-uniqueness.

Two contexts are operationally equivalent if no admissible observational procedure available within the framework distinguishes them with respect to the realized outcome statistics relevant to the volume’s theorem class.

Two realization channels ℛ₁ and ℛ₂ are realization-equivalent on a domain 𝒦 if, for every admissible context in 𝒦, they induce the same realization consequences up to the physically irrelevant distinctions fixed by the framework.

They are weighting-law equivalent on 𝒦 if

𝑊ℛ₁ = 𝑊ℛ₂ on 𝒦

even if ℛ₁ and ℛ₂ differ at a deeper formal level.

A transformation between realizational descriptions is a trivial reparameterization if it changes only descriptive surplus and has no effect on admissibility, weighting law, or any physically relevant theorem consequence.

These distinctions are indispensable. Without them, every residual formal difference risks being misdescribed as physical non-uniqueness, while every physically relevant divergence risks being dismissed as harmless reparameterization. The later canonicality program depends on drawing these boundaries sharply.

3.5 Imported assumptions from prior volumes

The present volume imports only the following broad assumptions from the prior sequence, and imports them provisionally rather than dogmatically.

First, the distinction between evolution, registration, and realization is retained as a structural feature of the framework.

Second, realization is represented by a constrained map ℛ rather than by unconstrained interpretive language.

Third, admissibility is treated as physically burdened rather than purely formal.

Fourth, prior narrowing of the admissible realization family is taken as a starting point, but not yet as final canonicality.

Fifth, prior local and generic uniqueness results are treated as provisional scaffolding whose scope must be re-evaluated under the stronger burdens of Volume IV.

No other substantive assumption is imported without explicit restatement. This restriction is necessary to prevent conceptual drift. Volume IV is not licensed to borrow hidden strength from prior rhetoric. Every premise that matters must appear in audited form inside the present theorem program.

Chapter 4. Admissibility and Invariance Axioms

4.1 Minimal admissibility axioms

The admissibility axioms of this volume are not introduced as conveniences. They are introduced as burdens that any candidate realization architecture must satisfy if it is to count as physically serious. Their role is therefore twofold: they constrain the admissible class 𝔄ℛ, and they supply the first major site at which circularity must be audited.

Let ℛ ∈ 𝔄ℛ be a candidate realization channel with induced weighting map 𝑊ℛ.

A₁. Registration consistency

ℛ must not assign positive realization weight to outcomes excluded by the registered measurement structure. If an outcome class E ∈ 𝒫 is excluded by the operative registration architecture, then

𝑊ℛ(E ∣ ρ, 𝒫, C) = 0.

This axiom is indispensable because a realization law that assigns weight outside the registered outcome space is not solving the realization problem at all. It is ignoring it.

A₂. Normalization

For every admissible context,

∑_{E ∈ 𝒫} 𝑊ℛ(E ∣ ρ, 𝒫, C) = 1.

Without normalization, the weighting map does not define a realizational allocation over the admissible outcome space and cannot serve the purpose of the framework.

A₃. Coarse-graining coherence

If 𝒫′ is an admissible coarse-graining of 𝒫, then the weight assigned to a coarse-grained class must agree with the sum of the weights of the admissibly merged fine-grained classes. Realization weighting must therefore respect admissible partition structure rather than depend arbitrarily on descriptive granularity.

A₄. Composition coherence

Realization structure must remain compatible under tensor composition and admissible subsystem restriction. If a context is extended from ℋ to ℋ₁ ⊗ ℋ₂, or restricted from a composite context to an admissible subsystem description, the weighting law must remain coherent with that structural change.

A₅. Redescription invariance

Purely descriptive reformulations that preserve physical content must not alter admissible weighting. If two presentations of a context differ only by physically irrelevant redescription, then 𝑊ℛ must remain invariant under that transformation.

A₆. Anti-loading constraint

No irrelevant bookkeeping structure, coding artifact, labeling surplus, or non-physical representational choice may influence realization weighting. This axiom is stronger than redescription invariance in one respect: it is directed specifically against covert dependence on surplus descriptive scaffolding.

These six axioms define the minimal admissibility burden of the volume. None should be assumed innocent merely because it is plausible. Each must be justified, and each must be audited for hidden Born preference.

4.2 Invariance class hierarchy

Not all invariance principles stand on equal footing. A major weakness in many foundational programs is the tendency to treat all symmetries invoked in a proof as equally innocent. The present volume rejects that practice.

The invariance principles relevant to admissibility must be divided into three classes.

Indispensable invariances are those without which the framework would fail to respect physically irrelevant description change. Redescription invariance and basic coarse-graining coherence are natural candidates for this class.

Plausible but nontrivial invariances are those that appear physically motivated but whose neutrality cannot be presumed. Ancilla-neutrality, repeated-trial exchangeability assumptions, or certain composition symmetries may fall here.

Dangerous invariances are those that may be mathematically elegant yet potentially Born-loaded. These include any invariance principle whose real effect is to eliminate rival weighting families by definitional design rather than by independent physical necessity.

This hierarchy matters because later theorems may rely on invariance assumptions of very different epistemic quality. A proof based on indispensable invariance stands differently from a proof based on dangerous invariance, even if both are internally valid.

4.3 Necessity arguments

Each admissibility axiom requires a necessity argument. It is not enough that the axiom be useful.

A₁ is necessary because realization without registration consistency ceases to be realization of the operative measurement context.

A₂ is necessary because a weighting law that does not exhaust the admissible outcome space cannot represent a complete realizational assignment.

A₃ is necessary because physically admissible aggregation of outcomes should not alter the total weight assigned to the aggregated class merely by changing descriptive granularity.

A₄ is necessary because the weighting law must survive system composition and admissible subsystem restriction without contradiction. Otherwise the framework is not stable under one of the most basic constructions in quantum theory.

A₅ is necessary because physical content cannot depend on merely representational change if the framework is to avoid descriptive arbitrariness.

A₆ is necessary because any realizational law sensitive to irrelevant bookkeeping would be structurally engineered rather than physically grounded.

These necessity arguments do not yet establish neutrality. They establish only why the axioms are candidates for admissibility. The neutrality question remains separate and harder.

4.4 Vulnerability map

The admissibility axioms must now be read as an audit surface. For each axiom, three questions must be asked:

• Where could circularity hide?

• Which rival family does the axiom disfavour?

• Is that disfavour physically justified or suspicious?

For A₁, circularity risk is low, but not zero. A registration structure itself may be chosen in a way that preloads later weighting. Thus the axiom is only as neutral as the registration architecture it presupposes.

For A₂, the danger lies not in normalization as such, but in the space over which normalization is imposed. If the admissible outcome space has already been filtered in a Born-favoring way, normalization inherits that bias.

For A₃, coarse-graining coherence may disfavour rival families that are unstable under partition change. That disfavour is often physically justified, but only if the chosen coarse-graining rules are themselves not selectively tuned to preserve Born behavior.

For A₄, composition coherence can strongly burden branch-counting, affine-deformed, and context-sensitive rival families. This may be a virtue. But if the exact composition rule is selected because it already favors amplitude-squared structure, then the burden becomes suspect.

For A₅, redescription invariance disfavors representation-sensitive rivals. In many cases this is physically justified. Yet the line between physical irrelevance and weighting-relevant structure must itself be defended, not asserted.

For A₆, the anti-loading constraint is one of the most powerful and one of the most dangerous axioms. It rightly excludes descriptive surplus from influencing realization weight. But because “surplus” is partly theory-defined, this axiom can become a covert device for excluding rivals whose dependence has been declared irrelevant rather than shown to be irrelevant.

Accordingly, this chapter must be read not as a declaration of acceptable premises, but as a first-pass audit of the premises on which the rest of the volume will rely. The point is not to reassure the reader that the axioms are harmless. The point is to identify exactly how each axiom strengthens the framework, how each burdens rivals, and where each remains vulnerable to the charge of covert Born loading.

That is why admissibility in Volume IV is not merely a proposal. It is already part of the burden of proof.

---

Part III — Non-Circularity and Born-Neutrality

Chapter 5. Formal Audit of Circularity

5.1 Definition of Born-neutrality

The central burden of the present chapter is to determine whether the premise structure of the CBR framework leaves the Born rule genuinely to be established, or whether it has already been privileged at the level of admissibility, invariance, or comparison design. This question cannot be answered by appeal to intuition, elegance, or physical plausibility alone. It requires a formal criterion.

Let 𝒜 denote a premise class consisting of admissibility axioms, invariance principles, equivalence criteria, composition laws, repeated-trial structures, and any auxiliary restrictions used to define the admissible realization class 𝔄ℛ. Let ℂ denote a comparison class of serious rival weighting families 𝑤ᵣ, where seriousness means at minimum that the rival family is normalized, registration-consistent, nontrivially non-Born, and sufficiently structured to satisfy prima facie comparison under the same theorem burdens imposed on Born weighting.

Then 𝒜 is Born-neutral relative to ℂ on a domain 𝒦 iff for every 𝑤ᵣ ∈ ℂ, the premise class 𝒜 does not eliminate 𝑤ᵣ except by theorem-level consequence grounded in physically justified structure operative on 𝒦.

Equivalently stated, 𝒜 fails Born-neutrality if the admissible rival space has already been narrowed in a Born-favoring way before the major theorem burden begins. Such narrowing may occur explicitly, through direct exclusion of non-Born forms, or implicitly, through selection of admissibility, symmetry, calibration, or equivalence principles whose effect is to pre-encode amplitude-squared privilege.

This definition must be read strictly. It does not require that every rival family remain equally plausible throughout the proof. It requires only that rivals be eliminated by theorems whose premises are themselves physically justified and not selectively engineered. A premise set may therefore be restrictive without being circular, provided its restrictions are independently motivated and do not function merely as disguised target loading.

To sharpen the point, three levels of neutrality should be distinguished.

A premise class 𝒜 is exactly Born-neutral on 𝒦 if no serious rival in ℂ is precluded except by theorem-level consequence, and this remains true under admissible redescription, embedding, coarse-graining, and repeated-trial extension.

A premise class 𝒜 is conditionally Born-neutral on 𝒦 if neutrality holds only relative to a restricted rival class ℂ′ ⊂ ℂ, or only under a further assumption Π whose own neutrality has not yet been fully established.

A premise class 𝒜 is Born-loaded on 𝒦 if it privileges Born weighting by stipulation, calibration convention, equivalence restriction, stability choice, or rival-selection design.

These categories govern the rest of the chapter. The point is not to declare CBR neutral. The point is to determine whether, where, and under what burdens it is neutral.

5.2 Circularity loci

A serious audit cannot proceed by general warning alone. It must identify the precise loci at which covert Born importation may occur. In the present framework, the major loci are eight.

5.2.1 Admissibility restrictions

The first circularity locus is the admissibility class itself. If 𝔄ℛ is defined in a way that precludes rival weighting laws before theorem-level argument begins, then later uniqueness or adequacy results are weakened. The risk is especially high when admissibility conditions are stated in language such as “physically coherent,” “non-arbitrary,” or “well-behaved” without a rival-symmetric criterion for what those phrases mean.

5.2.2 Invariance demands

Invariance principles can either discipline a theory or quietly preselect its conclusions. A symmetry or invariance demand may appear natural while functioning as a filter that only Born-compatible weighting laws can satisfy. The question is therefore not whether invariance is desirable, but whether the particular invariance imposed is independently justified and not merely result-selective.

5.2.3 Composition laws

Tensor-product coherence, subsystem restriction, and joint-context consistency are all physically important. Yet composition rules can also function as covert selectors. A rival weighting family may fail a composition law not because it is physically incoherent, but because the chosen composition law has already encoded the structural feature that Born weighting uniquely enjoys. Composition is therefore an especially subtle locus of hidden preference.

5.2.4 Repeated-trial assumptions

Repeated-trial settings are among the most dangerous sources of circularity in foundational work. Exchangeability assumptions, trial-independence requirements, calibration conventions, asymptotic stability rules, or law-of-large-number style structures may already smuggle in the very weighting behavior later described as derived. Any result relying on repeated-trial structure must therefore undergo special scrutiny.

5.2.5 Stability requirements

A weighting law may be selected because it is the only stable fixed point of an update operator 𝒯. But if stability itself is defined in a way that privileges Born weighting, then the attractor result does not establish independent closure. Stability is therefore a legitimate source of theorem strength only if the notion of admissible stability is itself neutral.

5.2.6 Equivalence criteria

Operational equivalence, realization equivalence, and weighting-law equivalence are all necessary distinctions. Yet they also create opportunity for covert filtering. A rival family can be trivialized too quickly by declaring a distinction “physically irrelevant,” or conversely protected too generously by defining equivalence too weakly. Equivalence criteria are therefore not neutral by default.

5.2.7 Coarse-graining procedures

Partition refinement and aggregation are physically meaningful operations, but the exact rule by which weights transform under coarse-graining can favor some weighting laws over others. A coarse-graining rule that appears natural may still embed Born-like additivity at the wrong level of the proof.

5.2.8 Rival-family selection rules

The final locus is the design of the comparison class ℂ itself. If ℂ is too weak, too stylized, or too selectively chosen, then exclusion theorems become rhetorically impressive but scientifically thin. A neutrality audit must therefore assess not only what premises do to rivals, but which rivals were allowed into the comparison space in the first place.

These eight loci define the audit surface of the chapter. Any claim of independence that does not examine them explicitly remains incomplete.

5.3 Neutrality diagnostics

A formal audit requires diagnostics capable of distinguishing neutral structure from covert target loading. The following tests are adopted as the minimum diagnostic suite for the volume.

5.3.1 Rival substitution test

Let Π be a candidate premise or premise cluster and let ℂ be the comparison class. The rival substitution test asks whether Π remains intelligible and physically justified when Born weighting 𝑤ᴮ is replaced by a serious rival family 𝑤ᵣ. If Π ceases to be definable, physically meaningful, or admissibly satisfiable only because the substitution was made, then Π is at least suspect and possibly Born-loaded.

A premise Π passes the rival substitution test on 𝒦 iff for every serious 𝑤ᵣ ∈ ℂ, Π can be stated and burdened without presupposing failure of 𝑤ᵣ.

5.3.2 Embedding neutrality test

The embedding neutrality test asks whether a premise remains neutral under admissible ancilla extension or enlargements of Hilbert space representation. If a weighting law changes merely because the system has been embedded into ℋ ⊗ ℋₐ in a physically irrelevant way, then either the weighting law or the premise governing it is not neutral.

A premise cluster Π passes embedding neutrality on 𝒦 iff admissible extension by inert ancillary structure does not selectively collapse the rival space in a Born-favoring manner.

5.3.3 Calibration independence test

This test asks whether the admissibility burden depends on calibration conventions that already assume amplitude-squared weighting at the level of record interpretation, measurement normalization, or repeated-trial aggregation. A premise fails calibration independence if changing a convention while preserving physical content alters which weighting families count as admissible.

5.3.4 Repeated-trial neutrality test

The repeated-trial neutrality test examines whether the inter-trial structure assumed by the theory can be formulated without covert Born preference. A premise cluster Π passes this test only if its repeated-trial assumptions do not eliminate rivals merely by requiring a Born-specific frequency architecture from the start.

5.3.5 Coarse-graining neutrality test

This test asks whether the coarse-graining rule imposed by Π privileges Born weighting independently of theorem-level consequence. If rival families are excluded simply because the coarse-graining rule was defined to match Born-style aggregation, then neutrality fails.

5.3.6 Exceptional-set neutrality test

A premise may appear neutral because only a small exceptional set ℰ breaks neutrality. This test asks whether ℰ is genuinely negligible. If neutrality fails on a set that is structurally generic, physically accessible, or scientifically central, then the claim of neutrality is overstated. Thus a premise passes the exceptional-set test only if the failure set is provably negligible in the sense relevant to the theorem class.

These diagnostics will govern both the positive and negative results of the chapter. A premise is not neutral because it sounds reasonable. It is neutral only if it survives these tests.

5.4 Conditional neutrality theorem

The present volume cannot assume full neutrality without proof. It must instead ask what is provable under restricted but explicit premise classes. The following result defines the strongest honest starting point.

Definition 5.4.1 — Restricted neutrality premise class

Let 𝒜₀ be the premise class consisting only of:

• registration consistency,

• normalization,

• coarse-graining coherence stated without Born-specific aggregation rule,

• redescription invariance limited to operationally indistinguishable reformulations,

• anti-loading restricted to elimination of purely label-theoretic surplus,

• and a rival class ℂ₀ consisting of amplitude-power families 𝑤ₚ with p > 0 and p ≠ 2, affine-deformed families, and representation-sensitive families that satisfy minimal registration consistency and normalization.

Theorem 5.4.2 — Conditional neutrality of minimal admissibility

On any domain 𝒦 consisting of single-shot, non-composite contexts with fixed registered outcome partition 𝒫 and without repeated-trial calibration structure, the restricted premise class 𝒜₀ is conditionally Born-neutral relative to ℂ₀.

Proof architecture

The theorem is not global and must not be read as such. Its force is local to the restricted domain 𝒦. The argument proceeds by checking the diagnostics one by one.

First, under 𝒜₀, the rival substitution test is passed because none of the premises in 𝒜₀ explicitly encodes amplitude-squared weighting. Registration consistency and normalization constrain the rival family, but do not single out p = 2.

Second, embedding neutrality is vacuous in the present theorem because ancilla extension is not yet part of the domain. This is not a strength, but a limitation deliberately built into the result.

Third, calibration independence is preserved because no repeated-trial or measurement-calibration structure enters.

Fourth, coarse-graining neutrality holds in restricted form because coherence is stated only as admissible partition compatibility and not as a Born-specific additive law beyond the minimal requirement that merged admissible classes receive the total weight of their constituents.

Finally, the exceptional-set issue does not arise on the stated domain because the theorem is local to fixed partition structure and avoids degeneracy claims.

It follows that on 𝒦, elimination of 𝑤ᵣ ∈ ℂ₀ cannot occur except by later theorem-level consequence. Hence 𝒜₀ is conditionally Born-neutral relative to ℂ₀ on 𝒦.

Interpretation

This theorem is important precisely because it is limited. It does not establish exact neutrality. It does not address composition, repeated trials, or attractor structure. It establishes only that the most minimal admissibility architecture of the framework is not obviously Born-loaded on a narrow domain. That is enough to justify moving forward, but not enough to claim independence.

5.5 Residual non-neutrality theorem or lemma

A serious audit must be willing to show where neutrality breaks. The following negative result is therefore at least as important as the previous theorem.

Lemma 5.5.1 — Repeated-trial dependence as a residual circularity locus

Let 𝒜₁ extend 𝒜₀ by adding any repeated-trial premise Πᵣ that imposes asymptotic calibration, stability under trial aggregation, or frequency alignment without first proving that Πᵣ is rival-neutral. Then 𝒜₁ is not established as Born-neutral relative to any comparison class ℂ that contains non-Born families with non-Born asymptotic frequency structure.

Reason

The repeated-trial neutrality test fails unless the inter-trial structure can be stated without already biasing the long-run weighting behavior in favor of Born-compatible frequency aggregation. A premise Πᵣ may be physically attractive and still remain conditionally neutral at best. Until its neutrality is independently shown, exact derivation claims that depend on Πᵣ are blocked.

Lemma 5.5.2 — Composition dependence as a second residual locus

Let 𝒜₂ extend 𝒜₀ by imposing a composition law Π⊗ on ℋ₁ ⊗ ℋ₂. If Π⊗ is defined in a way that assumes factorization, additivity, or subsystem-weight coherence uniquely satisfied by Born weighting without independent physical justification, then Π⊗ is Born-loaded relative to any rival family whose failure is due solely to that imposed compositional structure.

Interpretation

This lemma does not claim that every composition law is loaded. It claims that composition is a live circularity site and that no argument using it may bypass audit. This is crucial for later canonicality and uniqueness results.

Lemma 5.5.3 — Equivalence inflation as a third residual locus

If a premise class 𝒜 declares rival-sensitive distinctions to be physically irrelevant without theorem-level argument, then the equivalence criteria embedded in 𝒜 are not neutral. In that case, apparent uniqueness of 𝑊ℛ may be an artifact of equivalence inflation rather than a genuine theorem of closure.

These results together establish that the neutrality burden has not been fully discharged. The chapter must therefore end with precision, not comfort.

5.6 Verdict on independence burden

The strongest honest conclusion of this chapter is not that Born-neutrality has been established in full. It has not.

What has been established is narrower and more useful than either complacency or defeatism would suggest.

Under a restricted premise class 𝒜₀ and a limited comparison class ℂ₀ on a single-shot non-composite domain 𝒦, the minimal admissibility structure of CBR is conditionally Born-neutral. This means that the framework’s foundational burden has been reduced: the weakest layer of its premise architecture is not obviously circular.

But neutrality is not yet established globally. It remains blocked by at least three named assumptions or premise clusters:

• unresolved repeated-trial structure,

• unresolved composition laws,

• unresolved equivalence criteria when applied beyond clearly operationally indistinguishable redescription.

Accordingly, the exact verdict of this chapter is:

Neutrality reduced but not established.

More precisely:

The CBR framework admits a restricted domain on which its minimal admissibility class is conditionally Born-neutral relative to a significant rival family class, but exact neutrality remains blocked by unresolved trial-aggregation, composition, and equivalence burdens.

This is the correct starting point for the rest of the volume. Anything stronger would overstate the result. Anything weaker would fail to register real progress.

Chapter 6. Physical Naturalness Without Born Loading

6.1 What makes an axiom physically natural

The present chapter addresses a mistake that is common in foundational work and especially dangerous in derivation programs: the mistake of treating physical naturalness and Born-neutrality as equivalent. They are not equivalent. A premise may be natural and still be loaded. Conversely, a premise may be neutral and still lack sufficient physical force to matter. The burden of this chapter is therefore classificatory rather than merely justificatory.

An axiom is physically natural not because it is elegant, familiar, or mathematically convenient, but because its violation would undermine theory use in a way that is independent of any desire to recover Born weighting. Physical naturalness is therefore a counterfactual standard: an axiom counts as natural only if abandoning it would damage the interpretability, compositional stability, or operational coherence of the theory in a way that can be described without reference to the Born rule.

This immediately excludes several weak justifications. An axiom is not natural merely because it simplifies proof structure. It is not natural merely because it resembles a symmetry principle used elsewhere. It is not natural merely because it yields the target result. It is natural only if it appears unavoidable under ordinary physical use of the theory.

That standard is deliberately severe. Its purpose is to prevent success from being mistaken for justification.

6.2 Operational indistinguishability as justification

One of the strongest sources of physical naturalness is operational indistinguishability. If two descriptions of a context are operationally identical, then a realizational law that assigns different weights to them inherits descriptive arbitrariness. Such arbitrariness is not merely aesthetically undesirable. It undermines the theory’s claim to track physical structure rather than representational artifact.

Let C₁ and C₂ be contexts that are operationally indistinguishable on a domain 𝒦. Then a premise Π requiring

𝑊ℛ(C₁) = 𝑊ℛ(C₂)

has a strong claim to physical naturalness. It is not introduced to recover Born weighting. It is introduced to prevent the theory from depending on a difference that the theory itself cannot interpret as physically real.

This justification supports restricted forms of redescription invariance and certain forms of equivalence preservation. But even here caution is required. Operational indistinguishability can justify invariance only where indistinguishability has itself been defined without covert bias. If the operational criterion already filters rivals in a Born-favoring way, then the resulting invariance loses neutrality.

Thus operational indistinguishability is a strong source of naturalness, but only a conditional source of neutrality.

6.3 Composition and subsystem discipline

A second source of physical naturalness arises from compositional discipline. A realizational law that behaves incoherently under tensor extension or admissible subsystem restriction is difficult to regard as physically serious. The ability to pass from ℋ to ℋ₁ ⊗ ℋ₂, and to recover admissible subsystem structure without contradiction, is not optional in quantum theory. It is part of the ordinary grammar of physical description.

Accordingly, premises requiring composition coherence have real naturalness. If a candidate realization law cannot survive composition, that failure is not merely inconvenient. It signals a structural defect in the law’s capacity to function in multi-system settings.

But once again, naturalness does not imply neutrality. The exact form of the composition rule matters. A weak requirement of compositional consistency may be natural and relatively neutral. A stronger factorization or aggregation law may be natural-looking while still encoding amplitude-squared privilege. The distinction is therefore not between composition and non-composition, but between compositional discipline as such and a particular compositional formula whose neutrality has not yet been shown.

This chapter therefore adopts the following principle:

Composition coherence is physically natural in broad form, but any specific compositional law must be separately audited for Born loading.

That distinction will matter centrally in Chapters 7 and 8.

6.4 Anti-arbitrariness principle

A third source of physical naturalness is the anti-arbitrariness principle. No realizational law should depend on descriptive surplus structure that lacks physical significance within the theory’s own interpretive domain. If weighting changes merely because labels have been permuted, inert ancillary bookkeeping has been added, or representation format has changed while physical content remains fixed, then the law is structurally arbitrary.

This principle strongly motivates anti-loading constraints and certain forms of redescription invariance. It is one of the deepest constructive impulses in the CBR program. A realizational law should answer to physical structure, not bookkeeping residue.

Yet anti-arbitrariness is also one of the most dangerous principles in the entire framework. Because the boundary between physical structure and descriptive surplus is partly theory-defined, an anti-arbitrariness premise can become a covert exclusion device. A rival may be said to depend on “surplus” when what it really depends on is a structure the author has declared irrelevant rather than proven irrelevant.

For this reason, the anti-arbitrariness principle is physically natural at the level of motive, but neutrality depends on the precision with which the notion of surplus is defined. If “surplus” is allowed to expand until all non-Born sensitivity is excluded by fiat, the principle becomes Born-loaded.

This is a recurring pattern of the chapter: what is strongest in physical motivation is often also most dangerous in independence analysis.

6.5 Where naturalness fails to imply neutrality

This section is necessary because many derivation programs fail precisely here. They identify premises that are reasonable, elegant, or even indispensable, and then infer too quickly that those premises are neutral. The inference is invalid.

A premise may be physically natural and still non-neutral in at least four ways.

First, it may encode the target structure through a hidden choice of comparison class. This occurs when rival families are allowed into the proof space only if they already behave in ways close to Born weighting.

Second, it may encode the target through calibration convention. A repeated-trial or aggregation rule may appear ordinary while still locking the proof into Born-compatible behavior.

Third, it may encode the target through a strong notion of equivalence. If distinctions unfavorable to Born weighting are declared physically irrelevant without theorem-level argument, then the later uniqueness result has been partly pre-built.

Fourth, it may encode the target through a stability criterion. If the update operator 𝒯 or admissible fixed-point structure is defined so that only Born-like laws count as stable, then the resulting attractor theorem is not independent.

Thus the correct relation between naturalness and neutrality is asymmetric:

• lack of naturalness weakens a premise immediately;

• possession of naturalness does not guarantee neutrality.

This asymmetry is a strength of the present volume because it prevents physical plausibility from doing argumentative work it cannot bear.

6.6 Final classification of premises

The chapter must end with classification rather than mood. The following verdict is the strongest honest classification available at this stage of the volume.

Physically natural and neutral on a restricted domain

The following premise types appear physically natural and conditionally or restrictedly neutral when confined to the single-shot, non-composite domain audited in Chapter 5:

• registration consistency,

• normalization,

• restricted redescription invariance tied only to operational indistinguishability,

• coarse-graining coherence stated without Born-specific aggregation law.

These premises are not thereby elevated to global neutrality. But within the restricted domain they are the strongest available candidates for physically natural and neutral structure.

Physically natural but conditionally neutral

The following premise types appear physically natural but remain only conditionally neutral:

• broad anti-loading constraints,

• composition coherence in general form,

• ancilla-neutrality,

• limited subsystem consistency.

Their physical motivation is strong, but their neutrality depends on exactly how they are formulated.

Useful but likely loaded unless further justified

The following premise types are useful and may even be indispensable later, but at present remain likely loaded unless stronger audit is supplied:

• repeated-trial calibration principles,

• asymptotic frequency-alignment assumptions,

• strong stability requirements on 𝒯,

• any equivalence criterion broader than operational indistinguishability,

• composition laws with specific factorization or aggregation formulas.

These premises should not be used to support exact derivation claims until their neutrality has been separately demonstrated.

Unacceptable for exact derivation claims without further theorem work

Any premise that excludes serious rival families by definition, any calibration rule that presupposes Born-compatible aggregation, or any invariance principle whose only identified justification is that it yields Born weighting is unacceptable as a basis for an exact derivation claim.

The chapter’s final verdict is therefore:

Several core premises of CBR possess genuine physical naturalness, but naturalness and Born-neutrality are not coextensive. At this stage, only a restricted subset of the premise architecture can be classified as physically natural and neutral, while several premises central to stronger derivation claims remain physically motivated but only conditionally neutral, and some remain too likely loaded to support exact independence.

This verdict strengthens the volume because it refuses a false equivalence while preserving what can legitimately be claimed.

---

Part IV — Canonicality of ℛ

Chapter 7. The Canonicality Problem Proper

7.1 Why a narrowed family is not enough

Volume II improved the standing of the CBR framework by narrowing the admissible realization-functional class. That result mattered because arbitrariness is the natural enemy of law-level standing. But narrowing is not closure. A theory whose admissible family has been reduced may still fail to isolate the structure that matters scientifically.

The problem is simple. Suppose the surviving admissible class 𝔄ℛ is no longer broad, yet still contains distinct realization functionals ℛ₁ and ℛ₂ such that

𝑊ℛ₁ ≠ 𝑊ℛ₂

on a physically relevant domain 𝒦. Then no matter how elegant the narrowing argument, the framework has not yet reached canonicality at the level required for the weighting problem. Even if the residual plurality is small, it remains scientifically consequential if it changes the induced weighting law.

A narrowed class is therefore only a weak accomplishment. It improves the burden structure but does not resolve it. Canonicality begins only when the residual freedom has become irrelevant, either because ℛ is unique up to trivial equivalence or because all admissible survivors induce the same weighting law on the target domain.

This distinction is not merely technical. It determines the claim strength available to the whole volume. If canonicality fails, then uniqueness theorems for Born weighting remain hostage to premise selection. If canonicality succeeds only at the level of 𝑊ℛ, then that success is still highly significant, but the framework must be explicit that weighting-law closure has been established without exact functional uniqueness.

Thus the purpose of the present part is not to celebrate narrowing. It is to determine whether narrowing can be converted into canonicality of the kind that matters scientifically.

7.2 Levels of canonicality

Canonicality is not a single notion. Four levels must be separated.

7.2.1 Exact functional uniqueness

This is the strongest form. The realization functional ℛ is uniquely determined by the admissible premise class up to no freedom beyond identity or a precisely trivial equivalence. If achieved, this would amount to law-level closure at the functional layer itself.

7.2.2 Uniqueness up to trivial transformation

A weaker but still strong form occurs when multiple formal realizations survive, but they differ only by transformations proven to have no physically relevant consequence. Here the surviving plurality is interpretively shallow.

7.2.3 Uniqueness up to weighting-law equivalence

This form is weaker still, but may be the most scientifically relevant. Distinct admissible ℛ may survive, yet all induce the same weighting law 𝑊ℛ on the relevant domain 𝒦. In that case the realization-functional layer remains underdetermined, but the weighting problem itself is closed.

7.2.4 Restricted-domain canonicality

Any of the preceding forms may hold only on a domain 𝒦 rather than globally. This limitation matters. A theorem of canonicality on single-shot non-composite contexts is valuable, but weaker than a theorem extending to repeated trials, composite systems, and admissible embedding classes.

The rest of the part will preserve these distinctions rigorously. No result of one level will be redescribed as a stronger level.

7.3 The target of this volume

The strongest realistic target of Volume IV should not be stated too aggressively. Given the state of the framework after Chapters 5 and 6, exact global uniqueness of ℛ across the full admissible architecture would be an ambitious and uncertain target. A stronger and more defensible strategy is to aim at one of two endpoints.

The first endpoint is:

ℛ is unique up to trivial equivalence on a defined admissible domain 𝒦.

The second endpoint, slightly weaker but possibly more important scientifically, is:

All admissible ℛ in the surviving class induce the same weighting law 𝑊ℛ on 𝒦.

The second endpoint may indeed be the deeper victory for the present volume. If weighting-law canonicality can be achieved on a sufficiently rich domain, then the main burden of the Born program may be substantially advanced even if the underlying realization-functional architecture retains some formally distinct but physically irrelevant residual plurality.

This chapter therefore adopts a disciplined target structure:

• primary target: weighting-law canonicality on the broadest defensible domain;

• secondary target: exact or near-exact ℛ-canonicality where theorem burden permits.

That ordering is methodologically stronger because it aligns the proof program with what matters most for the weighting problem rather than with the most rhetorically maximal statement.

7.4 Failure criteria

A canonicality program is only credible if it specifies in advance what would count as failure. Three failure conditions are decisive.

First, canonicality fails if there exists residual functional freedom with distinct weighting consequences on a scientifically relevant domain. That is, if ∃ ℛ₁, ℛ₂ ∈ 𝔄ℛ such that 𝑊ℛ₁ ≠ 𝑊ℛ₂ on 𝒦, then weighting-law canonicality fails on 𝒦.

Second, canonicality fails if the surviving realization structure depends on arbitrary parameter choice not fixed by physically justified theorem-level argument. If a parameter λ remains free and different admissible values of λ yield distinct weighting consequences, then the law has not been canonically fixed.

Third, canonicality fails if the exceptional set ℰ on which uniqueness breaks is too large to ignore. A theorem that claims generic canonicality while leaving failure on a set that is physically central, structurally stable, or experimentally relevant is weaker than it sounds.

These failure criteria will govern Chapter 8. The point is not merely to produce a theorem named “canonicality,” but to ensure that the theorem actually removes the arbitrariness that matters.

Chapter 8. Canonicality Theorem Program

8.1 Local canonicality theorem

The first target should be a local theorem on a controlled domain where the neutrality burdens of Chapters 5 and 6 are least unstable.

Definition 8.1.1 — Local admissible domain

Let 𝒦₀ denote the class of single-shot, non-composite, fixed-partition contexts governed by the restricted premise class 𝒜₀ identified in Chapter 5.

Theorem 8.1.2 — Local canonicality up to trivial equivalence

On 𝒦₀, suppose ℛ₁, ℛ₂ ∈ 𝔄ℛ both satisfy the restricted admissibility class 𝒜₀ together with the local coherence conditions inherited from Volume II. If ℛ₁ and ℛ₂ agree on registration consistency, normalization, and admissible coarse-graining, then ℛ₁ and ℛ₂ are identical up to trivial equivalence on 𝒦₀.

Interpretation

This theorem is intentionally local. Its purpose is not to settle global functional uniqueness, but to show that once the admissible domain is tightly controlled, residual plurality at the level of ℛ may already collapse more strongly than Volume II was able to show. If proven, it establishes the first meaningful canonicality foothold of the volume.

8.2 Weighting-law canonicality theorem

This may be the central theorem of the entire part.

Theorem 8.2.1 — Weighting-law canonicality on the controlled domain

Let 𝒦₀ and 𝒜₀ be as above. Then for every admissible ℛ ∈ 𝔄ℛ satisfying the canonicality-compatible restrictions of the present part, the induced weighting law 𝑊ℛ is identical on 𝒦₀. Hence there exists a unique admissible weighting law 𝑊∗ on 𝒦₀ such that

∀ ℛ ∈ 𝔄ℛ, 𝑊ℛ = 𝑊∗ on 𝒦₀.

Interpretation

This theorem is stronger than a mere narrowing result and weaker than global exact derivation. Its force is that the weighting problem becomes closed on the controlled domain even if deeper formal variation in ℛ survives. If extended, this theorem would give CBR its most defensible route toward law-level Born standing.

8.3 Perturbative robustness theorem

Canonicality that disappears under arbitrarily small admissible perturbation is fragile and likely not law-like.

Theorem 8.3.1 — Perturbative robustness of canonicality

Let ℛ ∈ 𝔄ℛ induce the canonical weighting law 𝑊∗ on 𝒦₀. Let δℛ be an admissible perturbation preserving the restricted premise class 𝒜₀ and all local coherence constraints. Then there exists an ε > 0 such that if ‖δℛ‖ < ε in the admissible perturbation norm, the perturbed realization map ℛ + δℛ remains weighting-law equivalent to ℛ on 𝒦₀.

Interpretation

This theorem upgrades canonicality from a knife-edge statement to a stable one. The point is not that all perturbations are harmless. It is that admissible small perturbations do not reopen the weighting problem on the controlled domain.

8.4 Extension theorem

The crucial question is whether the local result can be broadened.

Theorem 8.4.1 — Extension or obstruction theorem

One of the following must be shown.

Either:

There exists a broader admissible domain 𝒦₁ ⊃ 𝒦₀ such that local weighting-law canonicality extends from 𝒦₀ to 𝒦₁ under a strengthened but still conditionally neutral premise class 𝒜₁.

Or:

No such extension can be established without adding at least one premise Π whose neutrality is unresolved, in which case extension is formally blocked by Π.

Interpretation

This is a strong theorem form because it allows the chapter to succeed by extension or by exact obstruction. Either outcome narrows the frontier.

8.5 Exceptional-set theorem

A canonicality theorem must classify its failure set.

Definition 8.5.1 — Exceptional set

Let ℰ be the set of contexts in the maximal admissible target domain 𝒦 on which weighting-law canonicality fails.

Theorem 8.5.2 — Classification of ℰ

If ℰ is nonempty, then exactly one of the following must be shown:

• ℰ is measure-zero in the relevant context topology,

• ℰ is structurally unstable under admissible perturbation,

• ℰ is physically pathological in the sense that it depends on non-generic degeneracy or forbidden calibration structure,

• or ℰ is scientifically relevant, in which case canonicality remains materially incomplete.

Interpretation

This theorem prevents vague use of phrases such as “almost everywhere” or “generic.” If canonicality fails somewhere, the scientific meaning of that failure must be stated precisely.

8.6 Canonicality verdict

The chapter must end in the style of a hard theorem verdict rather than a summary mood. The strongest credible verdict available after the present theorem program is likely one of the following:

• exact canonicality, if ℛ is unique up to trivial equivalence on the target domain;

• operational canonicality, if all admissible ℛ induce the same 𝑊ℛ on the target domain;

• restricted canonicality, if such closure holds only on 𝒦₀ or a modest extension thereof;

• unresolved non-canonical remainder, if residual functional freedom with distinct weighting consequences persists on a scientifically relevant set.

At this stage of the volume, the most realistic strong outcome is:

restricted canonicality, with weighting-law canonicality achieved on a controlled domain and extension to broader domains dependent on unresolved neutrality of composition, repeated-trial, or equivalence premises.

That result would already be substantial. It would mean that the CBR framework has progressed beyond narrowed admissible families to genuine closure of the weighting law on the most defensible part of its domain. It would not yet amount to exact global canonicality. But it would make the remaining gap both narrower and harder to misdescribe.

That is exactly the kind of result Volume IV should seek.

---

Part V — Rival Weightings and Exclusion

Chapter 9. Formal Space of Rival Weightings

9.1 Rival families must be serious, not decorative

A framework cannot claim to exclude alternatives if the alternatives were never formulated with enough structure to count as genuine competitors. The first task of the present chapter is therefore methodological: to define the comparison class ℂ in a way that is neither rhetorically inflated nor strategically weakened.

A serious rival weighting family is not just any map assigning non-Born numbers to outcomes. It is a family 𝑤ᵣ that satisfies, at minimum, four entry conditions on a specified domain 𝒦.

First, it must satisfy normalization. For every admissible context with registered outcome partition 𝒫,

∑_{E ∈ 𝒫} 𝑤ᵣ(E ∣ ρ, 𝒫, C) = 1.

Second, it must satisfy registration consistency. If an outcome class E is excluded by the registered measurement structure, then

𝑤ᵣ(E ∣ ρ, 𝒫, C) = 0.

Third, it must possess at least prima facie compositional viability. That is, it must admit some coherent extension, however tentative, to composite contexts, subsystem restriction, or admissible embedding. This condition does not require the rival already to solve every composition problem. It requires only that the rival not fail before the game begins.

Fourth, it must exhibit nontrivial deviation from Born weighting. A merely notational variant of Born weighting, or a family that reduces to Born weighting by trivial reparameterization on the domain of interest, does not count as a rival.

These entry conditions are important because they prevent two equal and opposite errors. They prevent the comparison class from being padded with obviously incoherent constructions whose exclusion proves nothing. And they prevent the theory from silently restricting attention to a comparison class so weak that later exclusion becomes easy but scientifically empty.

Accordingly, let ℂ denote the class of all weighting families that satisfy these entry conditions on the target domain 𝒦, together with any additional conditions later shown to be physically mandatory and rival-symmetric. The phrase “rival class” in what follows always means this burdened and explicitly structured class, not an informal gallery of alternatives.

This chapter proceeds from the principle that a rival must be allowed to be strong enough to matter before it can be meaningfully excluded.

9.2 Rival classes

The comparison class ℂ is not monolithic. It contains several structurally distinct rival families, each of which stresses a different potential weakness in the CBR route to Born weighting. The point of distinguishing these families is not taxonomic completeness for its own sake. It is to ensure that exclusion theorems later in the volume target genuine structural alternatives rather than an undifferentiated mass of “non-Born possibilities.”

9.2.1 Amplitude-power families

The most immediate rival class is the family of amplitude-power weightings 𝑤ₚ with p ≠ 2. On a fine-grained outcome structure with amplitudes {αᵢ}, this class assigns weights proportional to |αᵢ|ᵖ rather than |αᵢ|².

The importance of this class is obvious. It preserves a recognizably amplitude-based structure while varying the exponent. It therefore tests whether the CBR framework genuinely singles out the Born exponent or merely prefers an amplitude-derived family in general.

9.2.2 Affine-deformed families

A second class consists of affine-deformed weightings, where Born-like assignments are shifted or distorted by admissible-looking affine transformations followed by renormalization. These families are important because they can appear close to Born weighting on some domains while still breaking key structural properties elsewhere. They test whether the framework’s closure claims are robust to nontrivial deformations of the target law.

9.2.3 Branch-counting-style families

A third class consists of branch-counting-style or branch-multiplicity-sensitive weightings. These families assign realization weight in ways that depend on outcome multiplicity, structural duplication, or effective branch numerosity rather than solely on amplitude-based features. Even where such families are difficult to formulate cleanly, they matter because they represent a fundamentally different intuition about what weighting should track.

9.2.4 Context-sensitive families

A fourth class consists of context-sensitive weightings, in which the assigned weight depends not only on the local registered outcome architecture but also on broader features of the measurement setting, decomposition, or contextual embedding. These rivals test whether redescription invariance and context-independence are genuinely theorem-level consequences or merely prior filtering devices.

9.2.5 Calibration-dependent families

A fifth class consists of calibration-dependent weightings, in which outcome weights depend on repeated-trial conventions, long-run calibration procedures, or choice of aggregation architecture. These are especially important for later chapters because they test whether repeated-trial coherence or attractor results are genuinely neutral.

9.2.6 Coarse-graining unstable families

A sixth class consists of coarse-graining unstable families. These weightings may behave coherently on one partition but fail under admissible refinement or aggregation. They matter because some rival families survive at a fine-grained level only by sacrificing partition coherence. Their status tests whether coarse-graining constraints genuinely discriminate physically or merely serve as selective filters.

9.2.7 Representation-sensitive families

A seventh class consists of representation-sensitive weightings, whose values vary under formally distinct but allegedly equivalent descriptions of the same physical context. These rivals stress-test the line between operational invariance and covert exclusion by equivalence convention.

These seven classes are not claimed to exhaust all possible rivals. But they do span the principal ways in which a non-Born weighting law can remain structurally serious: by modifying amplitude dependence, by deforming the target law, by tracking multiplicity, by invoking contextual structure, by exploiting calibration, by violating partition coherence, or by resisting strong equivalence. A framework that can burden and evaluate all of these is already operating at a serious comparative level.

9.3 Shared burden principle

No rival may be excluded by standards not also imposed on Born weighting. This is the shared burden principle, and it is one of the central methodological controls of the volume.

Formally, let Π be a premise, admissibility rule, invariance demand, or structural burden used in evaluating rival families. Then Π is admissible as an exclusion burden only if Born weighting itself is equally answerable to Π on the same domain 𝒦. A rival cannot be dismissed for failing a condition that Born weighting is permitted to evade, reinterpret, or satisfy only because the condition was tailored to its structure.

The shared burden principle performs three functions.

First, it blocks asymmetric filtering. A rival family cannot be ruled out simply because it was forced into a stronger admissibility regime than the target law.

Second, it blocks rhetorical exclusion. General phrases such as “physically unnatural,” “arbitrary,” or “incoherent” count for nothing unless their content is formalized in a way that binds Born weighting as well.

Third, it sharpens the meaning of later theorems. If a rival fails under a shared burden, the exclusion is substantive. If it fails only under a selectively designed burden, the exclusion has little evidential value.

The point of the present part is therefore not merely to show that rivals fail. It is to show that when they fail, they fail under the same structural demands the framework itself claims are physically mandatory.

9.4 Rival admissibility map

Before theorem-level exclusion begins, each rival class should be given a prima facie admissibility map. This map records where the rival appears viable before full burdening. Without such a map, later exclusion results risk proving too little because the starting point was never made strong enough to matter.

Amplitude-power families

These appear prima facie viable on narrow single-shot domains where only normalization and registration consistency are imposed. They become stressed under coarse-graining, repeated-trial coherence, and strong compositional discipline.

Affine-deformed families

These may appear viable on restricted domains where weighting assignments are compared only pointwise or under weak adequacy criteria. They become stressed under invariance demands, perturbative robustness, and exact normalization-preserving transformation analysis.

Branch-counting-style families

These appear prima facie viable where multiplicity structure is left underdefined or where branch individuation is allowed to enter the realizational burden without tight control. They become stressed under embedding neutrality, representation invariance, and subsystem coherence.

Context-sensitive families

These appear viable wherever context dependence has not yet been ruled out by redescription invariance or operational indistinguishability. They become stressed when context is burdened by equivalence discipline and anti-loading constraints.

Calibration-dependent families

These appear viable only once repeated-trial or long-run aggregation structure is admitted. They are therefore weak on single-shot domains but potentially significant on iterated domains. They become stressed when calibration independence is demanded.

Coarse-graining unstable families

These may appear viable on fixed partitions and fine-grained descriptions. They become stressed immediately when admissible partition refinement and aggregation coherence are imposed.

Representation-sensitive families

These appear viable whenever formal presentation is allowed to influence weighting. They become stressed under redescription invariance and embedding neutrality.

This admissibility map matters because it shows that the rival space is not fictitious. Different rivals survive different early burdens and fail under different later ones. Later exclusion theorems will therefore have real content only if they track this map rather than treating all non-Born rivals as uniformly weak from the start.

Chapter 10. Exclusion Theorems

10.1 Invariance exclusion theorem

The first exclusion burden concerns invariance. Many rival families survive normalization and registration consistency but fail once physically justified invariances are imposed symmetrically.

Theorem 10.1.1 — Invariance exclusion

Let ℂᵢ ⊂ ℂ be the subclass of representation-sensitive, context-sensitive, and branch-multiplicity-sensitive rival families. Suppose the premise class includes only those invariance demands already classified as indispensable or conditionally neutral on the target domain 𝒦, including redescription invariance on operationally indistinguishable contexts and embedding neutrality under inert ancilla extension. Then any rival family 𝑤ᵣ ∈ ℂᵢ that varies under such redescription or inert embedding is inadmissible on 𝒦.

Interpretation

This theorem excludes rivals that derive their non-Born character from sensitivity to purely representational or inertly embedded surplus. Its force depends critically on the neutrality status of the invariances used. Because the theorem relies only on invariances already burdened in Part III, the exclusion is substantial rather than decorative.

What this theorem does not do is exclude amplitude-power or affine-deformed rivals that remain representation-invariant. It therefore narrows, but does not complete, the rival space.

10.2 Composition exclusion theorem

The second exclusion burden concerns tensor-product discipline and subsystem coherence.

Theorem 10.2.1 — Composition exclusion

Let ℂ⊗ ⊂ ℂ denote the subclass of rival weighting families that fail to admit a compositional extension consistent with admissible subsystem restriction, or whose joint-context assignments violate the composition principles classified as physically natural and at least conditionally neutral in Chapter 6. Then every 𝑤ᵣ ∈ ℂ⊗ is inadmissible on the compositional domain 𝒦⊗.

Interpretation

This theorem has real force because branch-counting-style families, certain affine-deformed laws, and several context-sensitive rivals often appear reasonable on isolated contexts while collapsing under composition. The theorem therefore converts what might otherwise remain a conceptual objection into a formal burden.

Its limitation must also be stated. The exclusion is only as strong as the neutrality of the composition principles used. If those principles remain only conditionally neutral, then the theorem supports broad exclusion but not yet exact derivation.

10.3 Coarse-graining exclusion theorem

The third exclusion burden concerns partition structure.

Theorem 10.3.1 — Coarse-graining exclusion

Let ℂ𝒫 ⊂ ℂ denote the subclass of rival families that fail partition refinement or aggregation coherence. Suppose the admissibility class requires coarse-graining coherence under physically justified partition merging and refinement. Then every 𝑤ᵣ ∈ ℂ𝒫 is inadmissible on any domain 𝒦𝒫 closed under admissible partition change.

Interpretation

This theorem excludes coarse-graining unstable families and burdens some amplitude-power and affine-deformed families whose apparent viability depends on holding partition structure fixed. Its strength lies in the fact that the same coarse-graining burden is imposed on Born weighting. Hence the exclusion is genuinely comparative.

The theorem also helps clarify why a rival that works only on a fixed partition is weaker than it first appears. A realizational law that cannot survive admissible changes of granularity is not merely incomplete; it is structurally fragile.

10.4 Repeated-trial exclusion theorem

The fourth exclusion burden concerns iterated structure. This theorem must be stated with special care because repeated-trial assumptions are a live site of circularity.

Theorem 10.4.1 — Repeated-trial exclusion under neutral aggregation

Let ℂᴿ ⊂ ℂ denote the subclass of calibration-dependent and asymptotically unstable rival families. Suppose there exists a repeated-trial premise class Πᴿ whose neutrality has been established on an iterated domain 𝒦ᴿ. Then any rival family 𝑤ᵣ ∈ ℂᴿ that fails trial-aggregation coherence, calibration independence, or admissible asymptotic stability under Πᴿ is inadmissible on 𝒦ᴿ.

Interpretation

This theorem is intentionally conditional. It excludes rivals only if the repeated-trial premise class has already passed neutrality audit. That conditional form is a strength, not a weakness. It prevents the theorem from claiming more than the volume has earned.

Where Πᴿ remains only conditionally neutral, the exclusion theorem supports strong comparative burdening but not unconditional exclusion. This distinction must be preserved.

10.5 Collapse-to-Born theorem

Some rival families are not excluded because they are impossible, but because once full admissibility completion is enforced they cease to remain distinct.

Theorem 10.5.1 — Collapse to Born-equivalent weighting

Let 𝑤ᵣ ∈ ℂ be a rival family satisfying normalization, registration consistency, indispensable invariances, coarse-graining coherence, and all composition principles admitted on the target domain 𝒦. If every non-Born degree of freedom in 𝑤ᵣ is eliminated by these shared burdens or reduced to trivial reparameterization, then 𝑤ᵣ is Born-equivalent on 𝒦.

Interpretation

This theorem is particularly important for amplitude-power and affine-deformed classes. It shows that some rivals are not excluded by contradiction, but by losing their distinctness under full admissibility completion. Such a result is stronger than rhetorical dismissal because it explains where the rival’s apparent freedom went.

The theorem should be read carefully. Born-equivalent does not mean formally identical. It means that, on the domain 𝒦 and under the admissibility burdens genuinely in play, the rival no longer yields a distinct weighting law.

10.6 Survivor classification theorem

The strongest version of the chapter is not that every rival is eliminated. It is that every survivor has been forced into an explicit cost category.

Theorem 10.6.1 — Survivor classification

For every rival family 𝑤ᵣ ∈ ℂ not excluded by Theorems 10.1–10.5, exactly one of the following classifications must hold on the target domain 𝒦:

• pathological, if survival depends on violating a physically mandatory burden;

• exceptional, if survival occurs only on a sharply bounded exceptional set ℰ;

• domain-restricted, if the rival survives only on a narrow subdomain not stable under the full theorem burdens of the volume;

• unresolved but sharply bounded, if the rival remains live only because one named premise Π has not yet had its neutrality or necessity fully established.

Interpretation

This theorem gives the chapter its real force. The aim is not total annihilation of the rival space. The aim is to show that no non-Born alternative survives without explicit structural cost. Once that is established, the remaining burden shifts from merely saying “other possibilities exist” to specifying exactly what those possibilities purchase and what they sacrifice.

The verdict of Part V should therefore be stated in the following form:

The rival space remains nonempty only where neutrality burdens remain unresolved, where survival is confined to exceptional or domain-restricted regions, or where the rival pays a clear structural price. No serious non-Born family survives for free.

That is the right level of strength for the book.

---

Part VI — Uniqueness and Attractor Structure

Chapter 11. Uniqueness of Born Weighting

11.1 Local uniqueness theorem

The first uniqueness target should be local, where the premise structure is strongest and most transparent.

Theorem 11.1.1 — Local uniqueness of Born weighting

Let 𝒦₀ denote the controlled domain of single-shot, non-composite contexts under the restricted premise class 𝒜₀. Suppose all serious rival families on 𝒦₀ have been burdened by the shared admissibility constraints of Parts III–V. Then Born weighting 𝑤ᴮ is the unique admissible weighting law on 𝒦₀ up to the equivalence relation fixed for that domain.

Interpretation

This theorem strengthens prior local uniqueness by making the comparison explicitly rival-burdened rather than merely architectural. Its importance is not that it proves global closure, but that it upgrades local uniqueness from an internal property of the realization family to a comparative result about the whole admissible weighting space.

11.2 Generic uniqueness theorem

A local result is valuable, but the real question is whether uniqueness extends beyond carefully controlled special cases.

Theorem 11.2.1 — Generic uniqueness outside an exceptional class

Let 𝒦 be the maximal domain on which the admissibility, invariance, and rival-exclusion burdens already established in the volume remain valid. Then there exists an exceptional class ℰ ⊂ 𝒦 such that for every admissible context C ∈ 𝒦 ∖ ℰ, Born weighting 𝑤ᴮ is the unique admissible weighting law up to the relevant equivalence relation.

Interpretation

The meaning of this theorem depends entirely on the status of ℰ. Later sections must therefore classify ℰ rather than hide behind the word “generic.” If ℰ is measure-zero, structurally unstable, or physically pathological, then the uniqueness result is strong. If ℰ is broad or scientifically central, the result is much weaker.

11.3 Global extension theorem or obstruction theorem

This chapter becomes substantially stronger if it does not pretend global uniqueness is inevitable.

Theorem 11.3.1 — Global extension or obstruction

Exactly one of the following must be shown.

Either:

There exists a premise extension 𝒜⁺, all of whose additional premises are physically justified and at least conditionally neutral, such that local or generic uniqueness extends to global uniqueness on the target domain 𝒦⁺.

Or:

Global uniqueness fails to follow from the present architecture because of a named obstruction Π∗, where Π∗ is either a neutrality failure, an unresolved equivalence criterion, a repeated-trial burden, or a compositional gap.

Interpretation

This is one of the strongest theorem forms available to the volume because it does not force a false binary between success and incompleteness. If extension works, the volume advances. If extension fails for a named reason, the frontier narrows. Either result improves the standing of the program.

11.4 Uniqueness up to equivalence

The word “unique” is often too coarse for serious work. This section must therefore distinguish three levels.

Exact functional uniqueness means that the realization functional ℛ itself is unique up to trivial equivalence.

Exact weighting-law uniqueness means that even if multiple ℛ survive, all induce the same weighting law 𝑊ℛ.

Operational uniqueness only means that multiple weighting structures survive formally, but none can be distinguished on the operational domain under consideration.

These distinctions matter because they correspond to different scientific achievements. A result that yields operational uniqueness is weaker than one that yields exact weighting-law uniqueness, but stronger than mere adequacy. A result that yields exact weighting-law uniqueness may be sufficient for the Born problem even if exact ℛ-uniqueness remains unresolved.

The book should therefore state all uniqueness theorems in one of these three forms and never use “uniqueness” without modifier.

11.5 Scientific meaning of uniqueness

Uniqueness can be merely formal or genuinely explanatory. This distinction must be made explicit.

A uniqueness theorem has weak explanatory force if it follows only because the admissible space was narrowly defined from the start. It has stronger explanatory force if it survives a broad rival class, shared burdens, and neutrality audit. The difference is not semantic. It concerns whether uniqueness was discovered or designed.

Accordingly, the scientific significance of any uniqueness result in CBR depends on three questions:

• Was the rival space serious before theorem work began?

• Were the burdens used to exclude rivals shared and physically justified?

• Was the premise class sufficiently neutral that uniqueness is not just a restatement of prior filtering?

A theorem answering these questions favorably does more than show that Born weighting survives. It shows that Born weighting survives under pressure. That is the kind of uniqueness that materially raises the standing of the framework.

Chapter 12. Attractor and Fixed-Point Structure

This chapter should be included only if the dynamic formulation is sharp enough to carry real theorem burden. If the update structure remains too schematic, the chapter should be reduced or omitted rather than allowed to weaken the book.

12.1 Realization dynamics on weighting space

Let Ω denote the admissible space of weighting laws on the target domain 𝒦. To study attractor structure, introduce an admissible update operator

𝒯: Ω → Ω

where 𝒯 represents one step of realizational refinement, admissibility completion, or dynamic stabilization under the premise class appropriate to the chapter.

This definition must be handled with care. The operator 𝒯 is not interesting merely because it exists. Its scientific significance depends on whether it is defined by premises already shown to be neutral or at least conditionally neutral. Otherwise attractor claims risk becoming disguised preference claims.

12.2 Fixed points of 𝒯

A weighting law 𝑤 ∈ Ω is a fixed point of 𝒯 iff

𝒯(𝑤) = 𝑤.

Fixed points should then be classified as:

• admissible fixed points,

• isolated fixed points,

• degenerate fixed points,

• and fixed points surviving only on an exceptional region of Ω.

The chapter should not assume in advance that Born weighting is the only fixed point. That must be proved if true.

12.3 Stability structure

A fixed point theorem has little explanatory value without stability analysis. The relevant notions are:

• local stability, where small admissible perturbations remain near 𝑤 under iteration of 𝒯;

• perturbative stability, where the structural role of 𝑤 survives admissible perturbation of 𝒯 itself;

• basin structure, identifying the subset of Ω from which iterates converge to 𝑤;

• exceptional instability regions, where convergence fails or multiple attractors compete.

These concepts are essential because a fixed point that is not stable, or stable only on a vanishingly narrow basin, does not meaningfully strengthen the explanatory standing of the weighting law.

12.4 Born attractor theorem

The strong target of the chapter is clear.

Theorem 12.4.1 — Born attractor theorem

Suppose 𝒯 is defined on Ω by an admissible realization dynamics whose generating premises are Born-neutral on a domain 𝒦. Then Born weighting 𝑤ᴮ is the unique stable attractor of 𝒯 on Ω ∖ ℰ, where ℰ is an explicitly characterized exceptional instability region.

Interpretation

This is a very strong theorem if it can be earned. But its force depends on the neutrality of 𝒯. Without that neutrality, the theorem may still show dynamic reinforcement of Born weighting, but not independent derivation.

For this reason, the theorem should be attempted only if the dynamic premises have already passed sufficient audit. Otherwise the chapter risks overstating what attractor structure means.

12.5 Weak attractor alternatives

If the strong theorem fails, the chapter should not collapse into vagueness. It should classify the weaker result exactly.

Born weighting may be:

• locally attracting, if convergence occurs only near 𝑤ᴮ;

• generically attracting, if convergence occurs outside a bounded exceptional set;

• asymptotically dominant, if Born weighting eventually dominates competitors without being the only stable point;

• merely fixed but not uniquely stable, if 𝑤ᴮ satisfies 𝒯(𝑤ᴮ) = 𝑤ᴮ but shares stability with other admissible fixed points.

This classification is not a consolation device. It is a way of preserving the exact strength of the result.

12.6 Relation to derivation

This section must be explicit and severe.

Attractor status, even strong attractor status, does not by itself yield independent derivation unless 𝒯 is neutral. A dynamics that selects Born weighting because Born weighting was already coded into admissible stability, update architecture, or calibration procedure does not derive Born weighting. It restates a prior choice in dynamic language.

Accordingly, the chapter’s closing principle should be:

Attractor structure can strengthen explanatory standing by showing that Born weighting is dynamically privileged within an admissible realization architecture. But attractor structure becomes a route to independent derivation only if the dynamics generating that privilege are themselves Born-neutral.

That sentence should govern the whole chapter.

If the chapter can prove only that Born weighting is a stable or generic attractor under conditionally neutral dynamics, then that is still valuable. It strengthens the theory’s explanatory profile. It just does not yet close the independence problem.

---

Part VII — Derivation or Boundary

Chapter 13. Derivation Architecture

13.1 Necessary ingredients

The central purpose of this chapter is to determine whether the CBR framework is in a position to support a genuine derivation of Born weighting, and if so, in what exact sense. The chapter must therefore begin by refusing a common foundational error: the treatment of derivation as a generic label for any route that recovers Born-consistent structure. In the present volume, derivation is a term of burden, not of convenience.

To claim exact derivation, the framework must establish four ingredients in sufficiently strong form.

The first ingredient is a class of neutral premises. Exact derivation is impossible if the premise set already privileges Born weighting by admissibility design, calibration convention, equivalence restriction, or stability selection. This requirement is stronger than physical plausibility. A premise may be natural and still fail neutrality. Thus the derivation burden begins not with formal recovery but with audited independence of the premise class 𝒜.

The second ingredient is canonical realizational structure. This need not always mean exact uniqueness of ℛ, though that would be the strongest form. It may instead mean canonicality of the induced weighting law 𝑊ℛ on the target domain 𝒦. But one of these must hold. If the framework leaves residual admissible freedom that changes weighting consequences on the relevant domain, then no derivation has been achieved. At best the framework would have established compatibility or adequacy under one admissible branch of its own architecture.

The third ingredient is exclusion of serious rivals. A weighting law is not derived simply because it has been recovered under favorable premises. It must survive comparison with serious non-Born alternatives that satisfy the same entry conditions and are burdened by the same structural constraints. If rivals remain live without explicit structural cost, derivation is blocked.

The fourth ingredient is closure by uniqueness or attractor structure. Exclusion of named rivals is not enough if the admissible weighting space still contains unidentified alternatives. Accordingly, the framework must establish either uniqueness of Born weighting on the target domain, or an equivalently strong closure result such as admissible attractor structure under a dynamic 𝒯 already shown to be neutral. Where this closure is absent, exact derivation is absent.

These ingredients are jointly necessary. None is by itself sufficient. Neutral premises without canonicality leave arbitrariness. Canonicality without rival exclusion leaves comparison underdeveloped. Exclusion without uniqueness leaves open unidentified survivors. Attractor closure without neutrality reduces to dynamic preference rather than derivation.

The burden of the present chapter is therefore synthetic. The previous parts of the volume developed these four pressures separately. This chapter asks whether they can now be assembled into a derivation theorem of any properly classified strength.

13.2 Master derivation theorem

The chapter should state, as early as possible, the strongest theorem that the volume can honestly support. That theorem must be presented in ranked form, because the exact strength of the result depends on the standing already achieved in Parts III–VI.

Definition 13.2.1 — Exact derivation on a domain

Let 𝒦 be an admissible domain of contexts and let 𝒜 be the governing premise class. CBR yields an exact derivation of Born weighting on 𝒦 under 𝒜 iff:

1. 𝒜 is Born-neutral on 𝒦 relative to the serious rival class ℂ,

2. the admissible realizational architecture yields canonical ℛ or canonical 𝑊ℛ on 𝒦,

3. every serious rival in ℂ is either excluded, collapsed to Born-equivalent form, or confined to a negligible exceptional set ℰ,

4. and Born weighting is uniquely admissible on 𝒦, or equivalently closed under a Born-neutral admissible attractor structure.

Only when all four conditions hold may the phrase “exact derivation” be used without qualification.

Theorem 13.2.2 — Master derivation theorem, ranked form

Exactly one of the following claims may be supported by the CBR framework on a given domain 𝒦 under a given premise class 𝒜.

Case I — Exact restricted-domain derivation
If 𝒜 is Born-neutral on 𝒦, 𝑊ℛ is canonical on 𝒦, serious rivals are excluded or collapsed on 𝒦, and Born weighting is uniquely admissible on 𝒦, then CBR yields exact derivation of Born weighting on 𝒦.

Case II — Conditional derivation
If all the above hold except that one premise Π ∈ 𝒜 remains only conditionally neutral, then CBR yields conditional derivation of Born weighting on 𝒦 relative to Π.

Case III — Weighting-law derivation without full ℛ-uniqueness
If ℛ is not unique, but all admissible ℛ induce the same 𝑊ℛ on 𝒦, and the neutrality, exclusion, and uniqueness burdens otherwise hold, then CBR yields exact weighting-law derivation on 𝒦 but not exact functional derivation of ℛ.

Case IV — Impossibility under current premise class
If one or more of the above burdens fails by theorem rather than by incomplete proof technique, then exact derivation is impossible under the current premise class 𝒜 on the relevant domain.

Interpretation

This theorem is powerful because it gives the chapter a disciplined outcome structure. It does not force premature maximalism. It allows the framework to succeed at the highest level it has earned and no higher. It also ensures that impossibility is treated as a formal result rather than as an embarrassment.

13.3 Proof decomposition

The strength of the master theorem depends on proof architecture. The chapter should therefore decompose the derivation burden into theorem clusters rather than presenting it as one opaque leap.

13.3.1 Neutrality lemmas

The first cluster consists of neutrality lemmas. These establish whether the premise class 𝒜, or some restricted sub-class 𝒜₀, is Born-neutral on the target domain 𝒦. Their purpose is not to prove Born weighting directly, but to establish that the theorem space remains open enough for a derivation to count as independent.

Typical neutrality lemmas should address:

• admissibility neutrality,

• equivalence neutrality,

• composition neutrality,

• repeated-trial neutrality,

• and attractor-dynamics neutrality if Chapter 12 is retained.

13.3.2 Canonicality lemmas

The second cluster consists of canonicality lemmas. These determine whether the realizational architecture has been sufficiently collapsed. Their outputs may be:

• exact ℛ-canonicality on a restricted domain,

• uniqueness up to trivial equivalence,

• or weighting-law canonicality where exact ℛ-uniqueness is unavailable.

These lemmas determine whether the framework yields one admissible weighting consequence or several.

13.3.3 Exclusion lemmas

The third cluster consists of exclusion lemmas. These burden the rival class ℂ under shared standards and determine which rivals are:

• excluded by theorem,

• collapsed into Born-equivalent form,

• confined to an exceptional set ℰ,

• or left unresolved only because a named premise remains unsettled.

These lemmas prevent the derivation theorem from being merely intra-framework.

13.3.4 Uniqueness lemmas

The fourth cluster consists of uniqueness lemmas. These establish whether Born weighting is the unique admissible weighting law on 𝒦, or whether only local, generic, or operational uniqueness has been obtained. If Chapter 12 is retained, some of these may be replaced or supplemented by attractor-closure lemmas.

13.3.5 Assembly principle

The master theorem should then be presented as the consequence of assembling these four clusters under a dependency structure made explicit in the next section. This is stronger than presenting a single theorem statement because it makes the derivation architecture inspectable. It allows the reader to see which burden carries the argument and where any unresolved dependence remains.

13.4 Dependency graph

A central strength of this chapter should be a precise dependency graph. This may be displayed visually in the book, but it should also be stated formally in prose so the theorem structure is preserved even without a diagram.

The dependency chain should be stated as follows:

Neutrality of 𝒜 relative to ℂ on 𝒦
→ permits independent assessment of admissible realizational structure
→ supports canonicality theorem for ℛ or 𝑊ℛ on 𝒦
→ licenses shared-burden exclusion of rivals in ℂ
→ yields uniqueness or admissible attractor closure of Born weighting on 𝒦
→ supports exact or conditional derivation verdict.

In theorem-language, the chain can be written more explicitly:

1. If 𝒜 is Born-neutral on 𝒦, then the admissible realization class 𝔄ℛ may be evaluated without prior target loading.

2. If 𝔄ℛ is canonical or weighting-law canonical on 𝒦, then residual arbitrariness in realizational consequence is removed.

3. If the rival class ℂ is burdened under the same premises and excluded or collapsed on 𝒦, then Born weighting remains live in a structurally nontrivial comparison space.

4. If no distinct admissible survivor remains, or if Born weighting is uniquely closed under a neutral attractor structure, then derivation standing is fixed by the neutrality status of 𝒜.

This dependency chain does two things at once. It shows why the four burdens are jointly necessary, and it prevents the framework from treating any one successful part as though it by itself settled the whole problem.

Appendix F should contain a theorem-by-theorem dependency catalogue so that every major result in the chapter can be traced to its exact premise set.

13.5 Failure-point analysis

This section may be the most important in the chapter. A derivation architecture becomes stronger, not weaker, when it identifies the exact point at which exact derivation fails if it fails.

The failure-point analysis should classify four kinds of breakdown.

The first is neutrality failure. Exact derivation fails if a premise Π remains Born-loaded or only conditionally neutral in a way that materially affects the theorem space. This is the deepest failure because it blocks independence at the root.

The second is canonicality failure. Exact derivation fails if multiple admissible realizational structures remain with distinct weighting consequences on the target domain. In that case the theory has not forced the weighting law.

The third is comparative failure. Exact derivation fails if a serious rival family remains admissible without explicit structural cost. In that case the framework has not uniquely earned its target law.

The fourth is closure failure. Exact derivation fails if Born weighting remains merely one admissible survivor, or merely a fixed point among others, without uniqueness or uniquely stable attractor status under neutral premises.

These failure types should not be collapsed. A framework blocked by neutrality failure is in a different state from one blocked only by unresolved extension from local to global canonicality. The chapter should therefore end its failure analysis with an exact sentence of the following form:

Exact derivation fails on domain 𝒦 not because Born weighting cannot be recovered, but because theorem cluster X remains blocked by premise Π or by unresolved extension from result R to result R⁺.

A sentence like that is a mark of maturity. It tells the reader precisely what remains open.

Chapter 14. Limitation and No-Go Results

14.1 Why no-go results strengthen the framework

No-go results strengthen a framework when they prevent it from claiming more than its theorems warrant. In foundational physics, this function is especially important because ambiguous success language often allows a program to appear stronger than it is. A framework that identifies its own limits with theorem-level precision is more credible than one that treats every unproved extension as pending triumph.

The present chapter therefore treats limitations as part of the volume’s positive contribution. A no-go theorem does not weaken the research program unless the program depended on pretending that the theorem was false. Where a no-go result is valid, it clarifies the frontier. Where the frontier is clear, future work can be aimed precisely rather than diffusely.

The chapter should proceed from the following principle:

A framework is stronger when it knows exactly what it has not established and why.

This principle is especially important for CBR because the framework’s credibility depends not only on the originality of its architecture, but on its willingness to distinguish compatibility, derivation, and impossibility without rhetorical slippage.

14.2 No-go theorem for overstrong derivation claims

The first no-go result should target the most common overstatement directly.

Theorem 14.2.1 — No-go theorem for global exact derivation under unresolved neutrality

Let 𝒜 be a premise class on a domain 𝒦 such that at least one premise Π ∈ 𝒜 remains not established as Born-neutral relative to the serious rival class ℂ. Then global exact derivation of Born weighting on 𝒦 cannot be claimed under 𝒜.

Reason

Exact derivation requires that Born weighting follow from premises that do not already privilege it. If Π remains unresolved in neutrality status, then any theorem using Π may still encode covert Born loading. Hence the most that can be claimed is conditional derivation, restricted-domain derivation under a smaller premise class, or strengthened compatibility.

Interpretation

This theorem is extremely important because it places a hard ceiling on the language of the framework. It does not say the derivation program has failed. It says that until neutrality is established at the right level, certain stronger forms of success are unavailable by theorem.

14.3 No-go theorem for unrestricted canonicality

If the canonicality program has not closed globally, the chapter should state that fact sharply.

Theorem 14.3.1 — No-go theorem for unrestricted canonicality under residual admissible freedom

Suppose there exists a nonempty admissible parameter family Λ such that for λ₁, λ₂ ∈ Λ one has admissible realization maps ℛ_{λ₁}, ℛ_{λ₂} with distinct induced weighting consequences on a scientifically relevant subset of the target domain 𝒦. Then unrestricted canonicality fails on 𝒦.

Interpretation

This theorem is simple but necessary. It prevents phrases such as “essentially canonical” from doing work they have not earned. If residual admissible freedom remains and it matters scientifically, exact canonicality is unavailable.

If the theorem is not triggered because all residual freedom collapses at the level of 𝑊ℛ, then the framework may still claim weighting-law canonicality. But that weaker result must be named exactly as such.

14.4 Boundary theorem

This section should define the actual frontier of the volume.

Definition 14.4.1 — Boundary classes

Let:

• 𝒦ᵣ denote the domain of restricted-domain closure,

• 𝒦ᵍ denote the target domain of global closure,

• and 𝒦ⁱ denote the hypothetical domain on which exact global derivation would be structurally impossible under the present axioms.

These domains need not all coincide.

Theorem 14.4.2 — Boundary theorem

Under the present premise class 𝒜, exactly one of the following holds:

1. Restricted-domain closure: exact or conditional derivation is established on 𝒦ᵣ but not on 𝒦ᵍ.

2. Global closure: all burdens are met on 𝒦ᵍ, yielding exact derivation on the full target domain.

3. Structural impossibility under current axioms: no extension from 𝒦ᵣ to 𝒦ᵍ is possible without changing or strengthening the premise class 𝒜.

Interpretation

This theorem is the true backbone of the chapter. It tells the reader whether the framework currently lives in a local success regime, a global success regime, or a structurally blocked regime. That classification is far more valuable than a generic statement that “more work remains.”

14.5 What must change to cross the boundary

This section should be concrete, not aspirational. It should identify what exact theorem burden must be satisfied to move from restricted-domain closure to a stronger result.

Possible routes across the boundary include:

• proving neutrality of a currently unresolved premise Π,

• extending weighting-law canonicality from 𝒦ᵣ to a larger compositional or repeated-trial domain,

• shrinking the exceptional set ℰ by theorem rather than by assumption,

• strengthening rival exclusion from broad exclusion to full uniqueness-level exclusion,

• or proving that the attractor dynamics 𝒯 are themselves neutral.

The section should avoid any tone of deferred promise. Instead it should say explicitly:

To cross the present boundary, the framework must do X. Without X, the stronger claim is not available.

That sentence turns future work from aspiration into obligation.

---

Part VIII — Comparative and Final Assessment

Chapter 15. Comparison with Other Routes to Quantum Weighting

15.1 Why comparison matters

Comparison matters here not for prestige, lineage, or rhetorical positioning, but for burden structure. The real question is not whether CBR sounds more ambitious or more original than competing approaches. The question is which burdens each approach assumes, which burdens it formalizes, which burdens it shifts elsewhere, and which burdens it leaves unresolved.

A comparative chapter written in this way strengthens the volume because it prevents false uniqueness claims while also clarifying what CBR is actually attempting that some other programs do not attempt. The point is not to win a contest of labels. It is to locate the research program in the landscape of weighting strategies.

15.2 Comparison classes

The chapter should compare CBR with at least the following five route types.

15.2.1 Everettian decision-theoretic routes

These routes attempt to justify Born weighting through rationality constraints, preference coherence, or decision-theoretic structure within an Everettian ontology. Their strength is often that they yield a sharp normative architecture. Their weakness, from the present volume’s perspective, is that they relocate the burden to rationality and equivalence assumptions rather than to realizational law. The question becomes whether those assumptions are neutral or whether they privilege the target weighting in another language.

15.2.2 Envariance-style symmetry routes

These routes seek Born weighting through symmetry arguments tied to entanglement-assisted invariance. Their strength is conceptual elegance and narrow theorem design. Their weakness is that the burden often falls on which symmetries are allowed to count as physically decisive and whether rival weightings are genuinely live before the symmetry argument begins.

15.2.3 Decoherence-based adequacy programs

These approaches often do not aim at derivation in the strongest sense. Instead, they aim to show that Born-like behavior is adequate, stable, or operationally inevitable once decoherence and environment-induced structure are taken seriously. Their strength is physical integration with standard theory. Their weakness, relative to exact derivation, is that adequacy is not uniqueness and operational stability is not neutral derivation.

15.2.4 Collapse-based probability assignments

These approaches introduce stochastic or collapse dynamics directly into the theory. Their strength is that probability enters at the level of law rather than needing to be reconstructed indirectly. Their weakness, from the perspective of the present volume, is that they do not derive the weighting law from neutral realizational structure. They posit or encode it as part of the collapse mechanism.

15.2.5 Epistemic and reconstruction-based approaches

These routes derive or motivate Born weighting from information-theoretic, epistemic, or axiomatic reconstruction principles. Their strength is often formal economy and broad conceptual clarity. Their weakness is that the burden of physical realization is frequently bracketed rather than addressed directly. From the CBR perspective, these approaches often solve a different problem.

15.3 What CBR contributes that differs

The comparative strength of CBR lies not merely in proposing another route, but in the specific burdens it chooses to make explicit.

First, it offers a realization-law architecture rather than a merely interpretive or epistemic explanation. The framework insists that the measurement problem involves an unresolved realizational layer and that weighting questions must be addressed at that layer.

Second, it imposes an explicit admissibility burden. Rather than assuming that any formal realization map is acceptable, it requires admissibility to be physically justified.

Third, it imposes an explicit canonicality burden. It does not treat recovery of Born-consistent structure from one admissible map as sufficient. It asks whether the realizational structure or at least its induced weighting law is forced.

Fourth, it treats non-circularity as central rather than incidental. This is one of the most distinctive features of the program. The neutrality of premises is not left as background reassurance. It becomes a first-class theorem burden.

Fifth, it is willing to formalize failure conditions. This matters greatly. Many weighting programs become rhetorically stronger by refusing to say exactly what would count against them. CBR is strongest where it does the opposite.

These differences do not automatically make CBR superior to other routes. They show what problem CBR is trying to solve and why its burden structure is unusually explicit.

15.4 Comparative weakness

This section is essential for credibility.

Other programs may still be cleaner than CBR in specific respects. A narrow envariance argument may be cleaner as a symmetry theorem than a broad realization-theoretic architecture with multiple burden layers.

Other programs may be more mature in specific respects. Decision-theoretic and decoherence-centered approaches often have deeper literature, more refined objections, and more developed technical ecosystems.

Other programs may be less burdened by architectural ambition. CBR attempts to integrate realization, admissibility, canonicality, rival exclusion, and derivation in one framework. That breadth is a strength if successful, but it also creates more failure points.

Finally, other programs may be clearer about what they are not trying to do. Some approaches do not seek exact derivation and are therefore less exposed to the no-go results developed in this volume.

This comparative honesty strengthens the book because it prevents CBR from appearing to claim uniqueness simply by expanding its scope. The right conclusion is not that CBR dominates the field. The right conclusion is that it places unusually strong emphasis on burdens that many other routes either bracket, shift, or leave implicit.

Chapter 16. Final Status Verdict

This chapter should read like a theorem verdict, not a conclusion chapter in the ordinary sense. Its function is to state, with exact modifiers, what the volume has earned.

16.1 Status of canonicality

The status of canonicality must be given in one of four forms:

• exact, if ℛ is unique up to trivial equivalence on the target domain,

• equivalence-class exact, if distinct ℛ survive formally but induce identical 𝑊ℛ,

• operational only, if the residual distinctions are invisible only on the operational domain considered,

• unresolved, if distinct admissible weighting consequences remain.

The chapter should state explicitly which of these the volume supports and on what domain 𝒦.

16.2 Status of neutrality

The status of neutrality must be given in one of four forms:

• established in domain 𝒦, if the premise class has passed the neutrality audit on that domain,

• conditionally established, if neutrality holds only relative to a smaller rival class or under an unresolved auxiliary premise Π,

• reduced but unresolved, if circularity exposure has been narrowed but not closed,

• blocked by premise Π, if one named premise prevents a stronger neutrality result.

This classification should be severe. A framework should not receive neutrality credit it has not earned.

16.3 Status of rival exclusion

The status of rival exclusion must be given in one of four forms:

• broad exclusion, if all serious rivals on the target domain are excluded, collapsed, or confined to negligible exceptional structure,

• restricted exclusion, if exclusion holds only on a smaller domain,

• partial exclusion only, if several serious rival classes remain live,

• unresolved, if the rival space has not yet been burdened strongly enough.

The chapter should state not only which category applies, but whether survivor classes remain and what cost they pay.

16.4 Status of uniqueness or attractor closure

The status of uniqueness or attractor closure must be given in one of four forms:

• exact, if Born weighting is uniquely admissible or uniquely stable under neutral dynamics on the target domain,

• generic, if uniqueness or unique stability holds outside a sharply bounded exceptional class ℰ,

• local only, if the result is confined to a controlled domain,

• absent, if no such closure has been established.

This section should preserve the distinction between static uniqueness and dynamic attractor structure. If the volume supports one but not the other, that should be stated plainly.

16.5 Status of derivation

The status of derivation must be given in one of four forms:

• exact restricted-domain derivation, if all burdens are met on a defined domain 𝒦 but not globally,

• conditional derivation, if one or more unresolved premises remain only conditionally neutral,

• strengthened compatibility only, if the volume materially strengthens Born standing without reaching derivation,

• impossibility boundary established, if exact derivation is blocked by theorem under the present premise class.

This is the most important classification in the chapter. It should be stated in one sentence of maximum precision.

16.6 Final conclusion

The book should end with a formal verdict, not a flourish. The conclusion should take the form of a theorem-level status sentence, such as:

Under premise class 𝒜, CBR yields weighting-law canonicality on domain 𝒦, broad rival exclusion relative to comparison class ℂ, and generic uniqueness outside exceptional set ℰ, but exact global derivation remains blocked by unresolved neutrality of premise Π.

That form is ideal because it compresses the entire volume into a structured status result:

• it states the premise class,

• the domain,

• the achieved strengths,

• and the blocking condition.

A conclusion of that kind would make the volume feel disciplined, mature, and difficult to misread.

---

Appendices

Appendix A — Notation, Equivalence, and Claim-Strength Conventions

A.1 Purpose

This appendix fixes the formal notation, equivalence structure, and claim-strength vocabulary governing Volume IV. Its role is not merely editorial. It is adjudicative. Several of the central burdens of the volume — canonicality, uniqueness, neutrality, exclusion, and derivation — can be overstated if the underlying notation or equivalence conventions are allowed to drift. This appendix therefore performs a control function: it specifies what the principal symbols mean, what forms of identity and equivalence are admissible, and what levels of claim-strength are recognized throughout the volume.

The appendix should be read as part of the proof discipline of the book. A theorem is only as strong as the exact sense in which its objects and conclusions are defined.

A.2 State-theoretic notation

Let ℋ denote the Hilbert space associated with the system under consideration. Unless explicitly stated otherwise, ℋ is a complex separable Hilbert space.

Let 𝒟(ℋ) denote the set of density operators on ℋ. Elements of 𝒟(ℋ) are denoted by ρ, σ, and related symbols. Pure states may be denoted by ψ where appropriate, but the volume is formulated primarily at the density-operator level.

For composite systems, joint spaces are written as ℋ₁ ⊗ ℋ₂, and more generally as finite tensor products. Reduced-state structure, where needed, is taken relative to admissible subsystem restriction rather than assumed abstractly without context.

A.3 Measurement and registration notation

The volume distinguishes sharply among pre-measurement evolution, registration, and realization.

A measurement context is represented not only by an observable or instrument, but by a registered outcome architecture.

Let ℐ denote the instrument or context-generating structure sufficient to induce an admissible registered outcome partition.

Let 𝒫 = {Eᵢ} denote the registered outcome partition. The Eᵢ are admissible outcome classes, not merely labels.

If 𝒫′ is a coarse-graining of 𝒫, then 𝒫′ is obtained by admissible merging of elements of 𝒫. If 𝒫″ is a refinement, it is an admissible finer partition of the same registered structure.

The phrase registered outcome structure refers to the physically available outcome architecture defined by the measurement context. The phrase realized outcome refers to the outcome class whose actualization is at issue in the realization-theoretic problem.

A.4 Realization notation

The central realizational object is the realization channel ℛ.

ℛ: 𝒟(ℋ) → 𝒟(ℋ)

Where needed, context dependence may be written explicitly as ℛ_{𝒫,C} or ℛ_C.

Let 𝔄ℛ denote the admissible class of realization channels relative to a governing premise class 𝒜. No realization map belongs to 𝔄ℛ merely because it is mathematically definable. Membership is always burdened by admissibility conditions.

Associated with each ℛ is an induced weighting law 𝑊ℛ, written as

𝑊ℛ: (ρ, 𝒫, C) ↦ 𝑤ℛ(· ∣ ρ, 𝒫, C).

This distinction is indispensable. ℛ-canonicality is stronger than 𝑊ℛ-canonicality. Several theorems in Volume IV rely precisely on not collapsing this distinction.

A.5 Rival and comparison notation

Let ℂ denote the class of serious rival weighting families.

A member of ℂ is denoted by 𝑤ᵣ.

Subclasses may be denoted as follows:

• ℂₚ for amplitude-power families

• ℂₐ for affine-deformed families

• ℂᵦ for branch-counting-style families

• ℂ𝒸 for context-sensitive families

• ℂᴿ for calibration-dependent or repeated-trial rivals

• ℂ𝒫 for coarse-graining unstable rivals

• ℂₛ for representation-sensitive rivals

The exact labels may vary chapter to chapter, but any theorem referring to a rival subclass must state the subclass explicitly.

A.6 Premise and domain notation

Let 𝒜 denote a premise class. A premise class may include admissibility axioms, invariance demands, equivalence criteria, composition laws, repeated-trial assumptions, stability requirements, and auxiliary constraints.

A single premise or premise cluster is denoted by Π.

Restricted or extended premise classes may be denoted by 𝒜₀, 𝒜₁, 𝒜⁺, and so forth.

Let 𝒦 denote an admissible domain of contexts. Domain subscripts indicate special structure:

• 𝒦₀ for a local controlled domain

• 𝒦⊗ for a compositional domain

• 𝒦𝒫 for a partition-closed domain

• 𝒦ᴿ for a repeated-trial domain

• 𝒦ᵣ for a restricted closure domain

• 𝒦ᵍ for a target global domain

No theorem should be read outside its stated domain.

A.7 Exceptional sets and dynamics

Let ℰ denote an exceptional set, that is, the subset of a domain 𝒦 on which a generic theorem fails.

Any theorem using ℰ must classify it as one of the following:

• empty

• measure-zero

• structurally unstable

• physically pathological

• scientifically relevant

If Part VI is retained, let Ω denote the admissible space of weighting laws, and let 𝒯: Ω → Ω denote an admissible update operator.

A weighting law 𝑤 is a fixed point of 𝒯 iff

𝒯(𝑤) = 𝑤.

Born weighting is written as 𝑤ᴮ.

A.8 Equivalence conventions

The volume distinguishes several forms of equivalence.

Two contexts are operationally equivalent if they cannot be distinguished by the admissible observational procedures relevant to the theorem class.

Two realization channels ℛ₁ and ℛ₂ are realization-equivalent on 𝒦 if they agree in all realizationally relevant respects on 𝒦.

They are weighting-law equivalent on 𝒦 iff

𝑊ℛ₁ = 𝑊ℛ₂ on 𝒦.

A transformation is a trivial reparameterization if it changes descriptive form without changing admissibility, weighting consequences, or physical inferential role.

These distinctions must be preserved exactly. Several central conclusions of Volume IV depend on whether a result establishes exact canonicality, equivalence-class canonicality, or operational indistinguishability only.

A.9 Claim-strength conventions

All major results in the volume must be read through the following hierarchy.

Born compatibility: there exists an admissible ℛ such that 𝑊ℛ agrees with Born weighting on a stated domain.

Born adequacy: Born weighting is reproduced systematically across a stated domain.

Born exclusion: serious rival families are excluded, collapsed, or confined to sharply bounded exceptional structure under shared burdens.

Born uniqueness: no distinct admissible weighting law remains on the stated domain.

Born attractor status: Born weighting is the unique stable fixed point or attractor of an admissible and appropriately neutral dynamics.

Exact derivation: Born weighting follows from Born-neutral premises without covert insertion of amplitude-squared preference.

A.10 Verdict

This appendix fixes the formal grammar of Volume IV. Its contribution is not merely terminological. It eliminates the ambiguities under which canonicality, uniqueness, and derivation are most often overstated. From this point forward, every theorem in the volume is constrained by these notational, equivalence, and claim-strength conventions.

Appendix A verdict: the inferential vocabulary of the volume is now rigid enough that later claims cannot be inflated by ambiguity of object, equivalence class, or success criterion.

Appendix B — Deferred Proofs and Technical Extensions

B.1 Purpose

This appendix contains proofs too long or branching to remain in the main text without damaging the monograph’s flow. It is not a repository for informal discussion. It is part of the theorem burden of the book. A proof deferred is not a burden relaxed.

Each proof in this appendix must begin with:

• the exact theorem or lemma supported

• the governing premise class 𝒜

• the relevant domain 𝒦

• the rival class ℂ, if any

• the strength classification of the result: local, generic, restricted-domain, or global

B.2 Proof discipline

Every proof in this appendix must conform to the following structure:

1. Exact theorem statement

2. Minimal restatement of governing premises

3. Domain and comparison class specification

4. Proof strategy

5. Stepwise argument with premise dependence explicit

6. Final result stated at the exact level earned

This structure prevents the appendix from quietly importing unstated strength from nearby discussion.

B.3 Perturbative robustness proofs

This section houses proofs showing that canonicality, uniqueness, or admissibility closure survives admissible small perturbation.

A perturbative robustness proof must specify:

• the perturbation norm or topology

• what counts as an admissible perturbation

• what structure the perturbation must preserve

• whether robustness is exact, local, generic, or only weighting-law level

These proofs are especially important for Part IV and Part VI, since knife-edge results do not count as strong law-candidates.

B.4 Extension-or-obstruction proofs

This section contains proofs of the form:

• a local result extends to a broader domain under stated additional burdens
  or

• no such extension is possible without premise Π

This proof family is essential because Volume IV becomes much stronger when extension failure is theorem-level rather than merely incomplete.

These proofs are especially relevant to:

• extension of conditional neutrality

• extension of weighting-law canonicality

• extension of uniqueness from 𝒦₀ to broader domains

• extension of attractor structure beyond tightly controlled regimes

B.5 Repeated-trial and asymptotic proofs

This section contains all longer proofs involving:

• repeated-trial coherence

• calibration independence

• iterated admissibility

• asymptotic stability

• trial-aggregation structure

Because repeated-trial premises are among the deepest circularity loci in the volume, every such proof must explicitly state the neutrality status of the assumptions it uses.

B.6 Exceptional-set proofs

Any theorem invoking genericity or a failure set ℰ should be accompanied here by a full classification proof unless the proof is short enough to remain in the chapter.

Such proofs must determine whether ℰ is:

• empty

• measure-zero

• structurally unstable

• physically pathological

• scientifically relevant

The appendix forbids genericity language unsupported by such classification.

B.7 Collapse-to-Born proofs

This section contains proofs showing that an apparent rival family does not survive as a genuinely distinct weighting law once admissibility completion is enforced.

A collapse proof must identify exactly where the rival loses distinctness:

• forced weighting-law equivalence

• failure of coarse-graining coherence

• failure of composition

• reduction to trivial reparameterization

• confinement to an exceptional class

B.8 Technical-extension notes

Some results may require auxiliary constructions not central enough for the main text but important enough not to omit. These should be included here only if they are theorem-supporting and dependency-explicit.

The appendix must not become a parking lot for material whose status is unclear.

B.9 Verdict

This appendix secures the technical completeness of the volume while preserving the severity of the main text. Its role is to ensure that no central theorem rests on inaccessible proof burden.

Appendix B verdict: every major technical claim in Volume IV remains fully dischargeable at the proof level, and deferred placement does not reduce theorem accountability.

Appendix C — Formal Rival Space and Admissibility Burdens

C.1 Purpose

This appendix defines the rival space of Volume IV formally enough that later exclusion theorems are nontrivial. Its purpose is not to multiply alternatives for appearance’s sake. Its purpose is to make sure that the program’s comparative claims are earned against serious competitors rather than against decorative strawmen.

C.2 Serious-rival admissibility schema

A weighting family 𝑤ᵣ enters the comparison class ℂ only if it satisfies the following entry schema on a domain 𝒦:

1. Normalization
   ∑_{E ∈ 𝒫} 𝑤ᵣ(E ∣ ρ, 𝒫, C) = 1

2. Registration consistency
   If E is excluded by the registered structure, then
   𝑤ᵣ(E ∣ ρ, 𝒫, C) = 0

3. Prima facie compositional viability
   The rival admits at least a preliminary extension to composite or embedded contexts without immediate contradiction

4. Nontrivial non-Born deviation
   The rival is not merely a notational variant or trivial reparameterization of Born weighting on the domain of interest

These are minimum entry conditions, not victory conditions. A rival satisfying them is not thereby admissible under the full theorem burden. It is only serious enough to be compared.

C.3 Rival-family comparison protocol

Every rival family in this appendix must be evaluated under the same protocol:

1. define the weighting law

2. specify its prima facie viable domain

3. identify the first major theorem burden under which it becomes vulnerable

4. determine whether it fails by contradiction, collapse, exceptional confinement, or unresolved bounded survival

5. state whether its failure is exact, generic, or domain-restricted

This protocol prevents rival treatment from becoming uneven or rhetorical.

C.4 Amplitude-power families 𝑤ₚ

These families assign weights proportional to |αᵢ|ᵖ with p > 0 and p ≠ 2, followed by normalization.

Prima facie viability: single-shot fixed-partition domains with only weak admissibility burdens.

Typical vulnerabilities: coarse-graining coherence, repeated-trial consistency, and some forms of composition.

Why this class matters: it tests whether the CBR program can actually explain why p = 2 is selected rather than merely why amplitude-based weighting in general is natural.

C.5 Affine-deformed families

These families introduce nontrivial affine distortion of antecedent amplitude-based assignments, with renormalization where needed.

Prima facie viability: narrow adequacy domains where only pointwise fit matters.

Typical vulnerabilities: invariance discipline, perturbative robustness, extension beyond controlled contexts.

Why this class matters: it tests whether the target law is stable against nearby deformations or merely compatible with one favored normalization architecture.

C.6 Branch-counting-style families

These families track multiplicity, branch number, or branch-sensitive structure rather than amplitude-squared weighting alone.

Prima facie viability: settings where branch individuation remains weakly constrained.

Typical vulnerabilities: representation invariance, embedding neutrality, subsystem coherence.

Why this class matters: it stresses whether the framework’s compositional and equivalence structure is doing real theorem work or quietly precluding multiplicity-sensitive rivals.

C.7 Context-sensitive families

These families allow weighting to depend on broader contextual structure beyond the local registered partition.

Prima facie viability: domains where redescription invariance and anti-loading principles have not yet been sharply imposed.

Typical vulnerabilities: operational indistinguishability, context-insensitive admissibility, equivalence discipline.

Why this class matters: it probes the exact point at which context dependence becomes physical versus merely surplus-sensitive.

C.8 Calibration-dependent families

These families derive weighting in part from calibration rules, repeated-trial conventions, aggregation choices, or long-run stabilizing structure.

Prima facie viability: repeated-trial domains only.

Typical vulnerabilities: calibration independence, repeated-trial neutrality, asymptotic consistency.

Why this class matters: these rivals remain live exactly where repeated-trial neutrality remains unresolved. They are essential for honest derivation analysis.

C.9 Coarse-graining-unstable families

These families behave coherently only on fixed partitions and fail under admissible refinement or aggregation.

Prima facie viability: fine-grained fixed-partition domains.

Typical vulnerabilities: coarse-graining coherence, partition-closed admissibility.

Why this class matters: they expose whether a rival’s apparent viability depends on artificial fixation of granularity.

C.10 Representation-sensitive families

These families vary under formally distinct but physically equivalent descriptions.

Prima facie viability: domains where equivalence criteria remain weak or underdefined.

Typical vulnerabilities: redescription invariance, embedding neutrality, anti-loading constraints.

Why this class matters: they test whether later exclusion theorems rest on genuinely physical invariance or on an overbroad notion of irrelevance.

C.11 Decorative rivals excluded from ℂ

Not every non-Born map belongs in the comparison class. Rivals are excluded from ℂ if they fail at the entry level by:

• lack of normalization

• violation of registration consistency

• no prima facie compositional extension

• trivial restatement of Born weighting

• purely ad hoc context-switching with no structural rationale

This exclusion is not a convenience filter. It is necessary to prevent later exclusion theorems from wasting force on entities too weak to matter.

C.12 Rival failure taxonomy

Every rival in Volume IV must fail, if it fails, in one of the following ways:

• contradiction: it violates a shared admissibility burden

• collapse: it becomes Born-equivalent or trivial under admissibility completion

• exceptional confinement: it survives only on a sharply bounded exceptional set ℰ

• bounded unresolved survival: it remains live only because one named burden Π is not yet settled

This taxonomy should govern all exclusion results in Part V.

C.13 Verdict

The rival space defined here is broad enough that later exclusion claims are nontrivial, but disciplined enough that the comparison burden remains scientifically meaningful.

Appendix C verdict: the exclusion program of Volume IV is now anchored to a formally serious rival class, so any later exclusion theorem that succeeds does real comparative work.

Appendix D — Neutrality Audit Framework

D.1 Purpose

This appendix turns non-circularity from a general concern into a formal audit framework. Its aim is to make neutrality claims reproducible, challengeable, and classifiable.

D.2 Four levels of neutrality

This appendix distinguishes four forms of neutrality burden:

• premise neutrality: whether a premise Π privileges Born weighting

• procedure neutrality: whether an inference rule, update rule, or aggregation procedure does so

• comparison-class neutrality: whether the rival class ℂ has been selected in a Born-favoring way

• extension neutrality: whether neutrality survives extension from one domain to another

A result that is neutral at one level need not be neutral at the others.

D.3 General neutrality audit algorithm

Any neutrality claim in the main text should follow this audit sequence:

1. Identify the premise or procedure under review

2. State the rival class ℂ relative to which neutrality is being assessed

3. Specify the domain 𝒦

4. Apply the diagnostic suite

5. Determine pass, fail, or conditional pass

6. State the strongest admissible neutrality verdict

This algorithm should be followed explicitly whenever the claim of independence is load-bearing.

D.4 Rival substitution test

Π passes this test on 𝒦 relative to ℂ iff Π remains physically meaningful and theorem-usable when Born weighting is replaced by any serious rival 𝑤ᵣ ∈ ℂ.

A fail indicates target-loaded structure.

D.5 Embedding neutrality test

Π passes embedding neutrality iff admissible inert extension from ℋ to ℋ ⊗ ℋₐ does not selectively collapse rivals in a Born-favoring way.

This test is especially important for multiplicity-sensitive and representation-sensitive rivals.

D.6 Calibration independence test

A premise or procedure passes calibration independence iff its burdening effect does not depend on a convention for normalization, measurement alignment, or long-run calibration not itself physically forced.

A fail here is especially serious for repeated-trial theorems.

D.7 Repeated-trial neutrality test

A repeated-trial premise class Πᴿ passes this test iff its trial-aggregation structure can be formulated without already selecting Born-compatible asymptotic behavior over the serious rival class.

This is a decisive test for exact derivation claims.

D.8 Coarse-graining neutrality test

A premise governing aggregation or refinement passes this test iff it does not preselect Born weighting through the exact form of the partition transition rule.

This test is necessary because partition additivity can secretly do target-selective work.

D.9 Exceptional-set neutrality test

A premise passes this test iff the set ℰ on which neutrality fails is shown to be negligible in the exact scientific sense relevant to the theorem in question.

This prevents “almost everywhere” language from hiding substantive non-neutrality.

D.10 False positives in neutrality claims

A neutrality claim is a false positive if it arises from any of the following:

• too narrow a rival class

• hidden calibration convention

• overbroad equivalence criterion

• selective domain choice

• stability criterion that already privileges Born weighting

• extension from local neutrality to global neutrality without proof

This section is crucial because many derivation programs appear neutral only because one of these distortions has entered unnoticed.

D.11 Neutrality verdict schema

Every neutrality verdict in the volume must take one of the following forms:

• neutrality established on domain 𝒦

• neutrality conditionally established relative to ℂ′ or premise Π

• neutrality reduced but unresolved

• neutrality blocked by premise Π

No other conclusion language should be used in load-bearing contexts.

D.12 Verdict

This appendix makes the neutrality program of Volume IV formal, inspectable, and resistant to reassurance-based overstatement.

Appendix D verdict: neutrality in Volume IV is now an auditable theorem burden rather than a stylistic claim of philosophical cleanliness.

Appendix E — Exceptional Sets, Counterexamples, and Obstruction Cases

E.1 Purpose

This appendix is the anti-overstatement appendix of the volume. Its function is to gather every place where a stronger claim fails, narrows, or becomes conditional. That makes the framework stronger, not weaker, because it prevents ambiguity about where the genuine frontier lies.

E.2 Counterexamples to overclaimed neutrality

This section should provide explicit constructions showing why some premises remain only conditionally neutral.

Examples include:

• a repeated-trial aggregation rule that appears natural but privileges Born-compatible asymptotics

• a composition law that excludes amplitude-power rivals only because of a specific factorization choice

• an equivalence criterion that collapses a representation-sensitive rival too early

Each example should identify:

• the premise Π involved

• the rival class ℂ affected

• the domain 𝒦

• the exact reason neutrality fails or remains unresolved

E.3 Counterexamples to overclaimed canonicality

This section should contain cases showing where canonicality does not globalize.

Examples include:

• parameterized admissible realization families ℛ_λ with distinct weighting consequences

• compositional contexts where weighting-law canonicality proven on 𝒦₀ does not yet extend

• repeated-trial settings where canonicality depends on unresolved calibration premises

The point of this section is to show exactly why unrestricted canonicality cannot be claimed too early.

E.4 Counterexamples to overclaimed derivation

This section should show where the recovery of Born-like behavior is weaker than exact derivation.

Examples include:

• domains with compatibility but not rival exclusion

• domains with weighting-law canonicality but unresolved neutrality

• domains with attractor structure under only conditionally neutral dynamics

Each counterexample should specify what stronger claim is blocked and why.

E.5 Rival survivors

Every rival family not fully excluded in the main text should appear here with exact classification:

• pathological

• exceptional

• domain-restricted

• unresolved but sharply bounded

This section should explain not just that the rival survives, but what price it pays to survive.

E.6 Obstruction cases

This section should present explicit cases where local results fail to globalize, or where extension requires an unresolved premise Π.

This is especially important for:

• local-to-global uniqueness

• local-to-global neutrality

• weighting-law canonicality beyond tightly controlled domains

• attractor results beyond neutral dynamics

These obstruction cases should be written theorem-style wherever possible.

E.7 Exceptional-set register

This section should list every major exceptional set ℰ appearing in the volume and classify it as:

• empty

• measure-zero

• structurally unstable

• physically pathological

• scientifically relevant

This register prevents genericity language from becoming evasive.

E.8 Verdict

This appendix bounds the failure space of the framework. It prevents stronger claims from being made at the cost of hiding their failure regions.

Appendix E verdict: every major limitation, survivor class, and obstruction in Volume IV is now explicit enough that the frontier of the framework is sharply bounded rather than impressionistically deferred.

Appendix F — Theorem Dependency and Claim Audit Catalogue

F.1 Purpose

This appendix is the audit spine of the volume. It maps every major theorem to its exact premises, burden class, neutrality status, domain, and limitation profile. It is designed so that any reader can inspect not only what is claimed, but how much of that claim is actually supported.

F.2 Catalogue fields

Every major theorem or lemma in the volume should be catalogued under the following fields:

• result label

• exact result type

• claim strength

• premise class 𝒜

• key premises Π

• neutrality status of each key premise

• rival class ℂ burdened

• domain 𝒦

• exceptional set ℰ, if any

• earlier lemmas required

• stronger result not justified

• failure mode

• classification as local, generic, restricted-domain, or global

This uniform format is one of the strongest credibility devices available to the book.

F.3 Claim-strength audit categories

Each theorem must be tagged as one of the following:

• compatibility result

• adequacy result

• exclusion result

• uniqueness result

• attractor result

• exact derivation result

• limitation result

• obstruction result

• no-go result

This prevents theorem types from drifting upward rhetorically.

F.4 Failure-mode categories

Each theorem must also list its main failure mode, if stronger extension fails. Examples include:

• neutrality failure

• canonicality failure

• rival-survival failure

• extension failure

• exceptional-set relevance

• unresolved dynamic neutrality

• unresolved equivalence burden

This makes the whole book much more inspectable.

F.5 Example entry schema

A model entry should read in prose like this:

Theorem X
Type: weighting-law canonicality
Claim strength: restricted-domain uniqueness result
Premise class: 𝒜₀
Key premises: registration consistency, normalization, restricted redescription invariance, coarse-graining coherence
Neutrality status: conditionally neutral relative to ℂ₀
Rival class burdened: ℂ₀
Domain: 𝒦₀
Exceptional set: none on stated domain
Depends on: Lemmas A, B, C
Stronger result not justified: global exact ℛ-canonicality
Failure mode: extension failure under unresolved composition premise Π⊗
Classification: restricted-domain

Every major theorem in the volume should have an entry of this kind.

F.6 Why this appendix matters

This appendix does three things:

1. it prevents local results from being misread as global

2. it keeps neutrality dependence visible even when theorem statements are elegant

3. it allows the entire argument structure of the volume to be externally audited

That makes the book feel far more like a serious mathematical-physics monograph than a persuasive long-form essay.

F.7 Verdict

This appendix turns the entire volume into a premise-traceable argument structure.

Appendix F verdict: every major result in Volume IV is now claim-auditable, premise-auditable, and limitation-auditable, making rhetorical inflation structurally harder throughout the book.

Closing Appendix Conclusion

These appendices are not secondary. They are an extension of the book’s adjudicative logic. The main chapters argue, burden, and classify. The appendices make those burdens explicit enough to inspect, challenge, and refine.

The strongest possible function of this rewritten appendix set is not simply to support the book, but to help judge it.

That is the right role for Volume IV.