Anchor Registry

Appendix F

9 min read

Anchor Registry

The anchors constitute the book's mathematical spine. Each is a load-bearing definition that later chapters depend on. The dependency graph is acyclic by construction. For the full formal statement of each anchor, see the chapter where it is introduced.

Status key: formal — fully specified with standard mathematical content. preformal — specification only; formal machinery deferred. engineering — practical surrogate for a stronger theoretical claim.

Summary Table

IDNameChapterStatusDependenciesCore Claim
A1Commitment SetCh. 1formalAssertions extend a commitment set monotonically while preserving consistency
A2Provenance JudgementCh. 2formalA1Claims carry typed evidence: (p,π)(p, \pi) not bare pp
A2bWitnessed AssertionCh. 2formalA2Assertions carry their own verification instructions
A2cWitness ClassesCh. 2formalA2bWitnesses typed by verification regime: decidable, probabilistic, attested
A3Schema as SignatureCh. 3formalA schema is a signature Σ=(T,P,I)\Sigma = (T, P, I); adding a predicate is a language change
A3bModel & SatisfactionCh. 3formalA3Conservative extension = safe evolution; model-theoretic semantics for "safe"
A4Epistemic StatusCh. 4formalA3bTruth relative to view and logic; CWA/OWA are inference rules within LUL_U
A5Coherence RequirementCh. 5preformalA1–A4Local extensions must agree on overlaps and preserve invariants
A6Sense BoundaryInterlude IpreformalA5Context-indexed equivalence U\sim_U; boundaries create equivalence classes
A7Group Action & InvariantCh. 6formalA1, A3Invariants—not coordinates—are the stable units of knowledge
A8Isomorphism & WitnessCh. 7formalA7Identity is behavior under admissible probes, not a label
A9AdjunctionCh. 8formalA8Translation between representations formalized as optimal compression/decompression
A10Witnessed SamenessCh. 9formalA2b, A2c, A6, A8, A9Three levels (equality, isomorphism, equivalence); all scoped, all witnessed
A11Vocabulary OperatorInterlude IIformalA3, A3b, A10Vocabulary changes what distinctions you can state; the loop stabilized by invariants
A12Cover & RestrictionCh. 10formalA4, A5, A10Context is a restriction structure; truth is indexed by view
A12bContext Site StructureCh. 10formalA12Contexts form a site (C,J)(\mathcal{C}, J) with Grothendieck topology; formalizes A5
A13Sheaf ConditionCh. 11formalA12, A12bCoherence IS the sheaf condition: agreement on overlaps → unique global section
A14FibrationCh. 12formalA12, A13Dependent types as fibrations; validity varies with context
A15Logic SelectionCh. 13formalA4, A12Different views may operate under different logics; merging requires reconciliation
A16Transport DisciplineCh. 14engineeringA10, A13Equivalence can license substitution with transport; engineering proxy for full univalence
A17Predicate InventionCh. 15formalA3, A5, A11, A13, A16Signature extension ΣΣ\Sigma \to \Sigma' introducing predicate qq under sheaf obligations
A17bConservative ExtensionCh. 16formalA1, A3b, A15, A17Conservative extension = safe evolution; breaking change requires migration
A18Invariant SetCh. 16formalA1, A16, A17bI=IhardIsoftI = I_{\text{hard}} \cup I_{\text{soft}}; hard invariants reject, soft constraints penalize
A19Proposal OperatorCh. 17formalA17, A18Statistical pattern matching produces hypotheses, not certified truths
A19bCertification ContractCh. 17formalA2c, A19Typed success or typed failure; the architect-grade interface
A20Predicate Search SpaceCh. 18formalA11, A13, A17–A19Inventing predicates is searching a constrained hypothesis space
A21Coherence Cost ModelCh. 19formalA13, A20Global coherence is expensive; honest systems declare a coherence budget
A22Context-Graph SubstrateCh. 20formalA2c, A13, A17b, A21Substrate stores locality, witnesses, constraints, and restriction maps
A23Identity MaintenanceCh. 21formalA10, A22Identity emerges from witness networks, not brittle keys
A24Predicate PackageCh. 22formalA17, A17b, A21, A22A predicate ships with signature, tests, invariants, provenance, scope
A25Query SemanticsCh. 23formalA19b, A24Queries are contracts over locality, invariants, and acceptable witnesses
A26Versioning RulesCh. 24formalA17b, A21, A24, A25The Third Mode survives time via versioned predicates and explicit compatibility
A27Refusal ObligationCh. 25formalA1, A18, A25If constraints entail emptiness: produce unsat core, derivation chain, checkable witness
A28Sense GluingCh. 26formalA6, A13, A24Disambiguation is gluing: local sense choices must agree on overlaps
A29Predicate AcceptanceCh. 27formalA17, A24, A26Predicate invention safe only with tests, scope, invariants, versioning
A30Scoped EquivalenceCh. 28formalA10, A12, A23Equivalence is context-indexed; transport valid only within scope
A31N-ary Event ObjectCh. 29formalA22, A26Higher-arity events are meaning atoms; binarizing destroys invariants
A32The Third ModeCh. 30formalA10, A12, A12b, A13, A17, A17b, A21, A30A system is Third Mode iff it supports predicate invention, witnessed equivalence, sheaf gluing, and coherence cost accounting

Critical Path

The longest dependency chain through the anchor graph:

A1 → A7 → A8 → A9 → A10 → A12 → A12b → A13 → A16 → A17 → A18 → A19 → A19b → A20 → A21 → A22 → A24 → A25 → A26 → A29

Every other anchor either feeds into this spine or branches from it. The path traces the argument: from commitment discipline through Erlangen invariants, witnessed sameness, the sheaf condition, predicate invention, and finally predicate acceptance. A32 (Third Mode Definition) is the argumentative culmination but reaches it by drawing on multiple branches of this spine rather than extending it linearly.

Normative Correspondence

The 32 anchors constitute the formal apparatus. The four governing equations of the Codex constitute the normative argument. The correspondence between them is not accidental: each equation draws on a specific region of the anchor graph for its formal grounding.

EquationNormative ClaimAnchorsWhat They Formalize
Truth needs witnessesClaims require verification; the cost of verification determines who gets to countA1–A14Commitment sets, provenance judgments, witness classes, schemas, epistemic status, the coherence requirement, sense boundaries, group invariants, isomorphism, adjunctions, witnessed sameness, cover structures, the sheaf condition, fibrations
Value needs workYou cannot create value without expenditure; expenditure leaves tracesA21Coherence cost model, monotonicity theorem, coherence budget
Freedom needs receiptsPower that leaves no trace dominates in darkness; receipts make power legibleA17–A20, A22–A29Predicate invention, conservative extension, invariant sets, proposal operators, certification contracts, predicate search, context-graph substrate, identity maintenance, predicate packages, query semantics, versioning, refusal obligation, sense gluing, predicate acceptance
Humanity needs mercyNot formalizedThe formal apparatus stops where mercy begins

The distribution is itself significant. Equation 1 (Truth) commands the largest formal territory because epistemology is the foundation: fourteen anchors specify what it means for local truth to compose into global coherence. Equation 3 (Freedom) commands the second largest because constitutional standing requires the most institutional machinery: thirteen anchors formalize the apparatus of predicate invention, certification, and accountable query that makes power inspectable. Equation 2 (Value) is compact because its formal content is concentrated: the coherence cost model in A21 captures the thermodynamic relationship between local assertion and global composition. Equation 4 (Mercy) has no anchors by design. The fourth equation marks the boundary where formal specification must yield to human judgment. Formalizing mercy would be a category error: mercy is precisely what you grant despite what the formal apparatus shows.

The absence of anchors under Equation 4 is not a gap in the formalization. It is the formalization's most important result. The first three equations can be mechanized; the fourth cannot. The boundary between what can be formalized and what must remain human is the mercy threshold, and the anchor registry's silence on Equation 4 is itself the formal expression of that boundary.

Witness Claim Index

Volume I states four witness claims explicitly (WC-08-01 through WC-08-04, all in Ch. 8 Similes of Symmetry). Each names a property of the witness frame and points at the formal anchor or anchors that bear its proof obligation. The table below resolves the references.

WCPropertyAnchor(s)What it formalizes
WC-08-01compositionA21, A24Coherence cost model; predicate package
WC-08-02recourseA23, A10Identity maintenance; witnessed sameness
WC-08-03bindingA1, A2, A10Commitment set; provenance judgement; witnessed sameness
WC-08-04stakesA21Coherence cost model

WC-08-01 and WC-08-04 are intended to be read together: WC-08-01 predicts transitional concentration after a verification cost transition, WC-08-04 predicts eventual dispersal. The chapter prose makes this linkage explicit, and both claims rest on A21 — WC-08-01 invokes A21 alongside A24 (predicate package), WC-08-04 invokes it alone. The joint claim is that the rent component of the trust tax becomes measurable as verification cost approaches the coherence fee.


Full formal statements, citations, and touchstone mappings are maintained in the project's anchor registry (references/anchors.ts).

← Back to AppendicesBack to The Proofs →