Foundation Maximal Forcing Forcing Closure Claim Universe

The claim universe

A claim universe, in the Recognition Science framework, is a formal container: it pairs a chosen class of allowed realizations with a set of claims about those realizations. Think of it as the scope of a single investigation. The framework's machine-checked library of formal theorems defines this container in its ClaimUniverse structure, which holds three pieces: a type of realizations, an admissibility class governing which realizations are allowed, and a set of claims expressed about those realizations. The structure itself does no reasoning; it is the stage on which reasoning happens.

The companion definition, ForcingClosure, takes a primitive and a claim universe and returns the set of claims whose status is being closed. In plain terms, it names the list of statements that a given investigation intends to settle. A claim is "in closure" when it belongs to that list. The docstring states the program's ambition: the process is complete only when every claim in the closure is classified as forced, independent, or selected with a named principle that is itself scheduled for tightening. That is a target, not an achievement.

What the declaration does not do is just as important. ClaimUniverse proves no physical law, derives no constant, and forces no conclusion. It is a definitional choice, a way of organizing what a theory must address. The closure operator is currently an execution interface: later phases will make it constructive from syntax and semantics, but that construction does not exist yet in the library. The structure also does not say which realizations are admissible; that is carried by the separate AdmissibilityClass parameter, which the declaration leaves abstract.

In Recognition Science, this container plays a specific role. The framework's central results, such as the forced form of the cost function or the golden ratio as a self-similar scaling, are theorems proved elsewhere. The claim universe is the bookkeeping device that lets those theorems be organized into a complete program: for any given primitive, one can ask which claims remain open, which are settled, and which are independent. The value of the container is not that it answers questions, but that it makes the set of unanswered questions precise enough to be enumerated.

The honest summary is this: ClaimUniverse gives the framework a way to say what a theory must eventually settle, and it defines the interface through which that settling will be tracked. It does not itself settle anything. A reader who wants to know what Recognition Science has proved should look at the theorems, not at this container. A reader who wants to know what Recognition Science still owes should look here, because this is where the debts are listed.

/-- A universe of realizations and claims for one maximal-forcing pass. -/
structure ClaimUniverse where
  Realization : Type u
  admissibility : AdmissibilityClass Realization
  claims : Set (RealityClaim Realization)

/-- Closure operator: for a primitive and a claim universe, return the claims
whose status is being closed. Later phases will make this operator constructive
from syntax / semantics; here it is the execution interface. -/
def ForcingClosure (_P : Primitive) (U : ClaimUniverse.{u}) :
    Set (RealityClaim U.Realization) :=
  U.claims

/-- Closure operator: for a primitive and a claim universe, return the claims
whose status is being closed. Later phases will make this operator constructive
from syntax / semantics; here it is the execution interface. -/
def ForcingClosure (_P : Primitive) (U : ClaimUniverse.{u}) :
    Set (RealityClaim U.Realization) :=
  U.claims

What this page does not claim

ClaimUniverse does not prove any physical law or derive any constant. The closure operator is not yet constructive; it is an execution interface only. The declaration does not specify which realizations are admissible, leaving that to the abstract AdmissibilityClass parameter.

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/ForcingClosure.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: