Foundation Maximal Forcing Admissible Realization Legitimate Tightening

A tightening that earns its name

In the Recognition Science framework, a tightening is a narrowing of the set of admissible realizations: every world allowed by the narrower class is also allowed by the wider one. The framework's library, a machine-checked collection of formal theorems, defines this order plainly. A tightening from class A to class B means that whatever is true in every A-world is also true in every B-world, since B admits a subset of A's worlds. The bare definition, however, carries a placeholder that says nothing: it stores a trivial proof, marked as true without content.

The declaration LegitimateTightening replaces that empty placeholder with a proof obligation. A tightening is legitimate only when it does real work and is justified by a deeper law. Doing real work means some world allowed by the wider class is excluded by the narrower one. The framework proves that if a claim is independent over the wider class (some worlds satisfy it, some do not) but forced over the narrower class (all narrower worlds satisfy it), then the narrower class must exclude at least one wider world. The deeper law is a separate proposition, with its own proof and a label naming it for audit. This turns legitimacy into a discharged proof obligation instead of a stored assumption.

The framework also proves a monotonicity fact: if a claim is forced on the wider class, it remains forced after any tightening, legitimate or not. Adding constraints cannot break a claim that already held everywhere. The smart constructor assembles a legitimate tightening from three ingredients: a subset proof, an independence-to-forcing flip, and a named, proved deeper law. This is the machinery the framework uses to promote a claim from merely selected to genuinely forced, by showing that the added constraint is not a free selection but a consequence of a deeper principle.

What LegitimateTightening does not claim is as important as what it does. It does not assert that any particular deeper law exists; it only requires that if a tightening is to be called legitimate, the law must be supplied and proved. It does not claim that a tightening is the only way to force a claim; the framework also allows proving independence by countermodel. And it does not claim that the narrower class is physically real; it only says that within the framework's formal structure, the narrowing is justified rather than arbitrary.

/-- A **legitimate** tightening. Beyond the subset order it carries:

* `does_work`: a proof the gate is non-vacuous (some `A`-admissible realization is
  excluded by `B`); and
* `deeper_law` together with `deeper_law_proof`: the actual RS forcing theorem that
  justifies the added constraint, so the tightening is forced by a deeper law, not
  chosen freely. `deeper_law_label` names it for the audit.

This replaces `strict_witness := True`: legitimacy is now a discharged proof
obligation, not a stored `True`. -/
structure LegitimateTightening {R : Type u} (A B : AdmissibilityClass R) where
  subset : ∀ r : R, r ∈ B.admissible -> r ∈ A.admissible
  does_work : ∃ r : R, r ∈ A.admissible ∧ r ∉ B.admissible
  deeper_law : Prop
  deeper_law_proof : deeper_law
  deeper_law_label : String

/-- A tightening does real work when some realization admissible for the wider
class `A` is excluded by the narrower class `B`. This is derived from a genuine
independence-to-forcing flip: if a claim is independent over `A` but forced over
`B`, then the `A`-admissible realization that *fails* the claim cannot be
`B`-admissible, since everything `B`-admissible satisfies it. -/
theorem tightening_does_work {R : Type u} {A B : AdmissibilityClass R}
    {C : RealityClaim R}
    (hIndep : Independent A.admissible C) (hForced : Forced B.admissible C) :
    ∃ r : R, r ∈ A.admissible ∧ r ∉ B.admissible := by
  obtain ⟨_r0, r1, _h0, h1, _hC0, hnotC1⟩ := hIndep
  exact ⟨r1, h1, fun hr1B => hnotC1 (hForced r1 hr1B)⟩

/-- If a claim is forced on a wider admissible class, it remains forced after
tightening. -/
theorem forced_of_forced_under_tightening {R : Type u}
    {A B : AdmissibilityClass R} {C : RealityClaim R}
    (hT : Tightening A B) (hA : Forced A.admissible C) :
    Forced B.admissible C := by
  intro r hr
  exact hA r (hT.subset r hr)

What this page does not claim

LegitimateTightening does not assert that any particular deeper law exists. It does not claim that tightening is the only way to force a claim. It does not claim that the narrower class of realizations is physically real.

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