IndisputableMonolith.Foundation.MaximalForcing.ForcingClosure
Defines the claim universe and closure operators for one maximal-forcing pass: which realizations remain admissible and which claims sit inside the forced set. Foundation workers cite it when stating that a law is forced rather than merely consistent. The module is definitional scaffolding over admissible realization classes; no deep proofs live here.
claimFix an admissible class of realizations. A claim universe packages candidate claims against that class. Forcing closure is the operator that retains only claims forced on every admissible realization; membership $C \in \mathrm{InClosure}$ means $C$ is forced in that pass.
background
Maximal forcing, in the Recognition Science foundation layer, refuses lazy free parameters. Upstream, admissible realization classes are the working substrate: if a claim is not forced on the current class, the next move is either to tighten admissibility by a deeper law reality must satisfy, or to exhibit independence by countermodel.
This module sits one step downstream of that substrate. It packages a single forcing pass as a universe of realizations together with the claims under test, and names the closure of claims that survive every admissible realization. Sibling names mark the three pieces: the claim universe, the closure operator, and the membership predicate for forced claims.
Notation is intentionally thin: no J-cost, phi-ladder, or eight-tick structure appears here. Those enter only when concrete physical claims are fed into the same forcing machinery later in the chain (T5–T8 and the Recognition Composition Law).
proof idea
This is a definition module, not a theorem file. It introduces the claim-universe carrier, the forcing-closure operator relative to an admissible class, and the membership predicate for claims inside that closure. Argument structure is type-level packaging imported from AdmissibleRealization; substantive forcing or independence proofs live in sibling and downstream modules.
why it matters in Recognition Science
Without a named closure object, maximal forcing cannot distinguish forced laws from contingent ones. Downstream, IndependenceWitness imports this module and demands a countermodel pair whenever a claim falls outside closure: if a claim is not forced, maximal closure requires an explicit countermodel rather than a vague appeal to contingency.
In the broader RS forcing chain, this is bookkeeping infrastructure for the foundation layer that eventually feeds uniqueness results (J-cost, phi, eight-tick octave, D = 3). It does not itself prove those landmarks; it supplies the language in which a pass can say a claim is forced or must be discharged by independence.
scope and limits
- Does not prove any concrete physical claim is forced.
- Does not construct countermodels; that is IndependenceWitness.
- Does not tighten admissibility laws; that remains upstream.
- Does not encode J-cost, phi, octave, or dimension forcing.
- Does not assert global uniqueness across multiple forcing passes.