Foundation Maximal Forcing Forcing Closure In Closure

The closure operator

A forcing pass in Recognition Science is a sweep over a chosen universe of realizations, the possible worlds or models under study, with the goal of classifying every claim in that universe as forced, independent, or selected under a named principle. The declaration InClosure is the gate that defines the scope of such a pass. It states that a claim is in closure for a given primitive, a starting seed of structure, exactly when that claim belongs to the set of claims attached to the universe. In plainer terms, InClosure answers one question: which claims are on the table for a pass to resolve? It does not answer whether any of them will be resolved.

The definition is deliberately thin. It takes a primitive, a claim universe, and a claim, and returns the proposition that the claim is a member of the universe's claim set. The universe itself is a structure pairing a type of realizations with an admissibility class, a condition that picks which realizations count as legitimate, and a set of claims about those realizations. The closure operator ForcingClosure simply returns that entire claim set. Nothing in the definition inspects the content of a claim, checks whether a primitive can generate it, or assigns it a status. InClosure is the execution interface, the hook where later phases will attach a constructive procedure that builds the closure from syntax and semantics. Today it is only the interface.

What InClosure does establish is a target. The program 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 completeness condition is the real content of the declaration: it sets the bar for what a maximal forcing pass must achieve. A pass that leaves a claim in the closure unclassified has not finished. This is a bookkeeping rule about scope and completion, not a theorem about the world. It does not force any particular claim to be true, does not derive any physical constant, and does not say that every claim in a universe will be settled. It only says which claims a pass is responsible for.

In Recognition Science, this declaration sits at the start of the maximal forcing program, before any of the forcing chain that produces constants like the golden ratio or the number of spatial dimensions. Those later results depend on specific primitives and specific universes. InClosure itself is primitive-agnostic: it works for any primitive and any universe, because it only selects the claim set. The payoff is architectural. It lets the framework separate the question of what a pass must cover from the question of how coverage is achieved, so that the constructive machinery can be built later without changing the scope rule. A reader should take InClosure as the definition of a promise, not the delivery of one.

/-- A claim is in scope for maximal closure from a primitive. -/
def InClosure (P : Primitive) (U : ClaimUniverse.{u})
    (C : RealityClaim U.Realization) : Prop :=
  C ∈ ForcingClosure P U

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

InClosure does not prove that any claim in a closure is forced, independent, or selected. It does not derive any physical constant or any property of three-dimensional space. It does not say that every claim in a universe will be settled, only that a complete pass must classify each one.

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: