Foundation Maximal Forcing Forcing Closure

The closure operator

In any formal system that aims to derive physics from first principles, a decision must be made about which statements are true, which are false, and which are simply chosen as starting points. Recognition Science faces this problem through a construction called maximal forcing. The idea is simple: a primitive, a basic recognition event, targets a set of claims about the universe of possible realizations. The closure, the complete set of claims that primitive can reach, is what the framework must eventually account for.

The framework defines this precisely. A claim universe consists of a type of realizations, an admissibility class that says which realizations are allowed, and a set of claims about those realizations. The closure operator takes a primitive and a claim universe and returns exactly the claims in that universe. This is the execution interface: it says what is in scope for a given forcing pass, without yet specifying how each claim gets resolved.

The program is complete only when every claim in the closure is classified one of three ways: forced (derived from the primitive), independent (neither forced nor refuted), or selected with a named principle that is itself scheduled for tightening. This three-way classification is the heart of the construction. A claim cannot be left dangling; it must receive a status, and any selection must carry a principle that will eventually be examined in turn.

In Recognition Science, this closure operator is the bridge between the abstract machinery of the forcing chain and the concrete claim that reality keeps a ledger. The framework models the situation as a discrete record of recognition events, and the closure operator is what turns that record into a complete accounting. What the framework establishes is not that any particular claim is true, but that there is a well-defined notion of what it would mean for the program to finish.

The practical consequence is a standard of completeness. When a reader asks whether the framework has derived some physical constant or some structural fact, the answer must be traceable to a claim in some closure, with its status explicit. The closure operator does not itself prove anything; it defines the arena in which proofs happen. That distinction matters for anyone trying to audit the framework's 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

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

What this page does not claim

This framework proves any particular physical claim true. The closure operator itself determines whether a claim is forced, independent, or selected. Maximal forcing is the same as the forcing chain that derives the golden ratio.

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: