Encyclopedia Foundation Foundation Maximal Forcing Rsclosure Extension Register Saturated Under Classifi

ARTICLE 3 claims 3 theorems

Foundation Maximal Forcing Rsclosure Extension Register Saturated Under Classifi

A machine-checked theorem shows the framework's ledger of physical claims can never miss a forced fact, because any such fact slots in without disturbing what came before.

Verify this page

The register's closure

In the Recognition Science framework, reality keeps a ledger, a discrete record of which physical claims hold and which do not. The framework's central worry about this ledger has been one of completeness: a curated list of claims might omit a physically real invariant, a fact that the framework's own logic forces to be true. The theorem named register_saturated_under_classification addresses the forced half of that worry at the framework level.

The setting is a claim universe, a collection of claims together with the rules for which ones count as admissible. A complete classifier certificate is a proof that every claim in that universe falls into exactly one of three buckets: Forced (the framework's logic compels it), Independent (it can be true or false without contradiction), or Selected (it needs an explicit choice principle). The theorem states that if you have such a certificate for a universe, and you adjoin any new claim that you can classify, the extended universe again has a complete classifier. The new claim keeps its classification, and every old claim keeps its classification verbatim.

The consequence is structural. No forced invariant can ever be missing in a way that breaks the closure. If a new physically real invariant is proposed, exactly one of three things happens, and all three are handled: it is Forced and absorbed automatically, Independent and absorbed once you exhibit a countermodel, or Selected and absorbed once you name a selection principle. The residual content of the maximal-forcing program is never find the missing slot in the register; it is always produce the classification certificate for a specific proposed claim.

What the theorem does not claim is equally precise. It does not say the ledger already contains every physically real invariant; it says the ledger is closed under extension by any claim you can classify. It does not say independence or selection witnesses are easy to produce; those remain real proof obligations. And it does not say the framework has derived any particular physical constant, such as the fine-structure constant, whose exact value remains open. The register's incompleteness, if any, can only ever be an undiscovered independence or selection, never an undiscovered forced invariant.

THEOREM register_saturated_under_classification · IndisputableMonolith/Foundation/MaximalForcing/RSClosureExtension.lean
register_saturated_under_classification · IndisputableMonolith/Foundation/MaximalForcing/RSClosureExtension.lean:143 
/-- **THE REGISTER IS SATURATED UNDER CLASSIFIED EXTENSION (THEOREM).** This is the
complete structural statement of carrier-completeness, covering all three buckets at
once. A complete classifier survives adjoining any claim `C₀` for which a
classification certificate (`ClaimClassification U C₀`) exists. Equivalently: the
predicate "this universe has a complete classifier" is closed under extension by any
classifiable claim.

The honest reading: the curated carrier cannot be "incomplete" in any way the framework
fails to absorb. If a new physically-real invariant is proposed, exactly one of three
things happens, and all three are handled — it is `Forced` (absorbed automatically, the
yard/eos-style derivations), `Independent` (absorbed once you exhibit a countermodel),
or `Selected` (absorbed once you name a selection principle). The residual content of
the maximal-forcing program is never "find the missing slot in the register"; it is
always "produce the classification certificate for a specific proposed claim." -/
theorem register_saturated_under_classification {P : Primitive} {U : ClaimUniverse.{u}}
    (cert : MaximalClosureCert P U) {C0 : RealityClaim U.Realization}
    (h0 : ClaimClassification U C0) :
    Nonempty (MaximalClosureCert P (U.extend C0)) :=
  ⟨cert.extendClassified h0⟩
THEOREM forced_invariant_absorbed · IndisputableMonolith/Foundation/MaximalForcing/RSClosureExtension.lean
forced_invariant_absorbed · IndisputableMonolith/Foundation/MaximalForcing/RSClosureExtension.lean:131 
/-- **No forced invariant can be missing (THEOREM).** For any claim `C₀` forced over
`U`'s admissibility, the extended universe still admits a complete classifier and
`C₀` itself is `Forced` there. This is the precise structural answer to the
carrier-completeness worry on the forced side: the closure absorbs any forced fact
without disruption. -/
theorem forced_invariant_absorbed {P : Primitive} {U : ClaimUniverse.{u}}
    (cert : MaximalClosureCert P U) {C0 : RealityClaim U.Realization}
    (hC0 : Forced U.admissibility.admissible C0) :
    (Nonempty (MaximalClosureCert P (U.extend C0))) ∧
    Forced (U.extend C0).admissibility.admissible C0 :=
  ⟨⟨cert.extendForced hC0⟩, hC0⟩
THEOREM register_saturated_under_classification · IndisputableMonolith/Foundation/MaximalForcing/RSClosureExtension.lean
register_saturated_under_classification · IndisputableMonolith/Foundation/MaximalForcing/RSClosureExtension.lean:143 
/-- **THE REGISTER IS SATURATED UNDER CLASSIFIED EXTENSION (THEOREM).** This is the
complete structural statement of carrier-completeness, covering all three buckets at
once. A complete classifier survives adjoining any claim `C₀` for which a
classification certificate (`ClaimClassification U C₀`) exists. Equivalently: the
predicate "this universe has a complete classifier" is closed under extension by any
classifiable claim.

The honest reading: the curated carrier cannot be "incomplete" in any way the framework
fails to absorb. If a new physically-real invariant is proposed, exactly one of three
things happens, and all three are handled — it is `Forced` (absorbed automatically, the
yard/eos-style derivations), `Independent` (absorbed once you exhibit a countermodel),
or `Selected` (absorbed once you name a selection principle). The residual content of
the maximal-forcing program is never "find the missing slot in the register"; it is
always "produce the classification certificate for a specific proposed claim." -/
theorem register_saturated_under_classification {P : Primitive} {U : ClaimUniverse.{u}}
    (cert : MaximalClosureCert P U) {C0 : RealityClaim U.Realization}
    (h0 : ClaimClassification U C0) :
    Nonempty (MaximalClosureCert P (U.extend C0)) :=
  ⟨cert.extendClassified h0⟩

What this page does not claim

The ledger already contains every physically real invariant. Independence or selection witnesses are easy to produce. The framework has derived the fine-structure constant.

Verify this page

Every tagged claim above names its theorem. To check one yourself rather than trust this page, elaborate the source module with Lean 4 and audit its axiom basis:

$ lake env lean IndisputableMonolith/Foundation/MaximalForcing/RSClosureExtension.lean
expected axiom basis: [propext, Classical.choice, Quot.sound] (the Lean kernel's standard three; no RS-specific axioms)

A page whose claims cannot be reproduced this way does not ship. In production, every anchor links to the exact declaration in the public source release, and this block carries the build receipt for the page itself.

Derived articles

This page is generated by a question-recursion engine: the questions its answers raise become the next pages. The current agenda, with open targets marked red:

MACHINE LAYER · GROUNDED CLAIM TABLE · CLICK TO EXPAND