Pith. sign in
module module moderate

IndisputableMonolith.Foundation.MaximalForcing.ForcedInvariant

show as:
view Lean formalization →

Defines how a single claim is classified inside one maximal-forcing closure universe: forced as an invariant, or witnessed as independent. Downstream RealityClosure cites this classification as the per-claim certificate atom. The module is definitional scaffolding over IndependenceWitness, not a proved uniqueness theorem.

claimIn a closure universe $U$, each claim $C$ receives a classification: either $C$ is a forced invariant of $U$, or independence is exhibited by an explicit countermodel pair. The classification is the atomic certificate later quantified over all $C$ in a forcing closure.

background

Maximal Forcing treats physical and logical structure as what survives every admissible closure of a presentation $P$ in a universe $U$. Claims that are not forced cannot be left as informal contingency: IndependenceWitness requires a concrete countermodel pair whenever a claim fails to be forced.

This module sits one layer above that witness language. It packages, for one claim in one universe, the dichotomy between forced invariance and witnessed independence. The local objects are the claim-classification type and the forced-invariant predicate (or structure) that name that dichotomy.

The surrounding program is Foundation-level: the same forcing chain that later pins $J$, $\varphi$, the eight-tick period, and $D=3$ needs a precise notion of what it means for a claim to be forced rather than optional.

proof idea

Definition module: no standalone theorem proof. It introduces the classification interface for one claim in one closure universe, wiring the independence-witness import into a forced-versus-independent status used by later certificate assembly. Argument structure is type-and-predicate packaging, not a multi-step derivation.

why it matters in Recognition Science

RealityClosure imports this module as part of the crown-theorem interface for Maximal Forcing Closure. That interface does not assert the final theorem; it states the certificate shape

forall C in ForcingClosure P U, ClaimClassification U C.

ForcedInvariant supplies the per-claim atom of that universal certificate: every closed claim must be classified, not merely listed. Without a sharp forced-invariant versus independence split, the closure program could not separate structural necessities (candidates for the T0–T8 forcing chain and related RS landmarks) from claims that remain open under maximal closure.

scope and limits

used by (1)

From the project-wide theorem graph. These declarations reference this one in their body.

depends on (1)

Lean names referenced from this declaration's body.

declarations in this module (2)