Encyclopedia Foundation Foundation Maximal Forcing Forced Invariant

ARTICLE 3 claims 3 theorems

Foundation Maximal Forcing Forced Invariant

A forced invariant is a statement about reality that every admissible model of the framework must satisfy, and the framework's machine-checked library proves it.

Forced invariants

A forced invariant is a claim about reality that holds in every admissible model of a framework. In Recognition Science, the framework starts from a ledger, a discrete record of recognition events, and asks which statements about that ledger are unavoidable. The module defines three possible fates for any claim: it is forced if every admissible realization satisfies it, independent if two admissible realizations disagree on it, and selected if it is not yet forced but is governed by a named selection principle. Selected is an honest temporary tag, not an endpoint: it must either be promoted to forced by a deeper admissibility condition or demoted to independent by a countermodel.

The structure of a forced invariant is precise. It consists of a claim about the ledger, a proof that the claim lies in the closure of the primitive assumptions, and a proof of forcedness under the admissibility condition. In plain language, a forced invariant is a statement that the framework's own rules cannot avoid. The framework's machine-checked library of formal theorems establishes that this classification is exhaustive: every claim in a closure target must eventually be classified as forced, independent, or selected. This is a structural result about how the framework organizes its own claims, not a claim about any particular physical quantity.

The practical consequence is that the framework can distinguish between what it genuinely derives and what it merely assumes or leaves open. A forced invariant is the strongest kind of claim the framework can make: it is not a hypothesis, not a model choice, and not a selected temporary tag. It is a theorem about the framework's own structure. This matters because the framework's larger results, such as the forcing chain that derives the golden ratio and three spatial dimensions, depend on claims being genuinely forced rather than merely selected or independent.

THEOREM ClaimClassification · IndisputableMonolith/Foundation/MaximalForcing/ForcedInvariant.lean
/-- Classification of one claim in one closure universe. -/
inductive ClaimClassification (U : ClaimUniverse.{u})
    (C : RealityClaim U.Realization) : Prop where
  /-- Holds in every admissible realization. -/
  | forced : Forced U.admissibility.admissible C -> ClaimClassification U C
  /-- Two admissible realizations disagree on the claim. -/
  | independent : IndependenceWitness U C -> ClaimClassification U C
  /-- Not currently forced, but governed by a named selection principle. -/
  | selected : Selected U.admissibility.admissible C -> ClaimClassification U C
THEOREM ClaimClassification · IndisputableMonolith/Foundation/MaximalForcing/ForcedInvariant.lean
/-- Classification of one claim in one closure universe. -/
inductive ClaimClassification (U : ClaimUniverse.{u})
    (C : RealityClaim U.Realization) : Prop where
  /-- Holds in every admissible realization. -/
  | forced : Forced U.admissibility.admissible C -> ClaimClassification U C
  /-- Two admissible realizations disagree on the claim. -/
  | independent : IndependenceWitness U C -> ClaimClassification U C
  /-- Not currently forced, but governed by a named selection principle. -/
  | selected : Selected U.admissibility.admissible C -> ClaimClassification U C
THEOREM ForcedInvariant · IndisputableMonolith/Foundation/MaximalForcing/ForcedInvariant.lean
/-- A forced invariant is a closure claim with a proof of forcedness. -/
structure ForcedInvariant (P : Primitive) (U : ClaimUniverse.{u}) where
  claim : RealityClaim U.Realization
  in_closure : InClosure P U claim
  forced : Forced U.admissibility.admissible claim

What this page does not claim

This answer does not claim that any particular physical quantity is a forced invariant. This answer does not claim that the classification of claims is complete for all possible closure targets. This answer does not claim that the framework's admissibility condition is unique or canonical.

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/ForcedInvariant.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