Foundation Maximal Forcing Forced Invariant Forced Invariant

Forced invariants

In mathematics and physics, an invariant is a property that stays the same under a transformation: the distance between two points under a rigid motion, the energy of a closed system over time. The Recognition Science framework refines this idea into a formal object called a forced invariant, meaning a claim about reality that holds in every admissible model of the framework, with a proof that no alternative is possible. The declaration ForcedInvariant packages exactly that: a claim, a proof that the claim lies in the closure of the framework's primitive assumptions, and a proof that the claim is forced by the admissibility condition. In plain language, it is a statement that the framework's own rules leave no room for disagreement.

The framework's library of formal theorems, a machine-checked collection, defines three possible statuses for any claim about a model: forced, meaning it holds in every admissible realization; independent, meaning two admissible realizations disagree on it; and selected, a temporary tag for a claim not yet forced but governed by a named selection principle. A forced invariant is the first kind: a closure claim with a proof of forcedness. The structure requires three fields: the claim itself, a certificate that it belongs to the closure of the primitives, and a proof that the admissibility condition forces it. This is not a claim about the physical world directly; it is a claim about what the framework's axioms entail.

What ForcedInvariant does not claim is as important as what it does. It does not assert that the claim is true in the actual universe; it asserts that the claim follows from the framework's postulates. It does not claim that the framework's postulates are true. It does not claim that a selected claim will eventually become forced; a selected claim might be promoted to forced by a deeper condition or demoted to independent by a countermodel. The declaration is a bookkeeping device for the framework's internal logic, not a physical law.

In Recognition Science, the framework proves that any cost function satisfying five plain conditions must equal J(x) = (x + 1/x)/2 - 1, a theorem checked in the machine-checked library. That cost function is a forced invariant in the framework's sense: it holds in every admissible realization of the framework's primitives. But the framework does not claim that the cost function is the only possible one outside its own axioms; that would be a different, stronger claim. What ForcedInvariant gives the reader is a precise way to say: within this framework, this statement cannot be otherwise.

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

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

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

ForcedInvariant does not assert that the claim is true in the actual universe. ForcedInvariant does not claim that the framework's postulates are true. ForcedInvariant does not claim that a selected claim will eventually become forced.

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: