Gravity Conditional Slot Vacuous Witness Shell Always Inhabited

The witness shell

A witness shell, a wrapper that packages a proposition together with a proof of it, can be built for any proposition at all. The machine-checked library of formal theorems proves this directly: the shell is always inhabited, because one can always fill it with the trivially true proposition and its trivial proof. The type of the shell, the signature that names what it contains, carries no information about which proposition was actually plugged in. Two shells with completely different content are both inhabited, so inhabitation tells you nothing about the assumption.

This was a real problem. A theorem that consumed such a shell looked unconditional, but its strength depended entirely on the invisible proposition inside. At the type level, "assumed nothing" and "assumed everything" were indistinguishable. The fix was to lift the proposition from a hidden field to a visible type parameter. The new structure, called a conditional slot, is inhabited if and only if its parameter holds. A slot for the proposition True is visibly trivial; a slot for a hard convergence theorem is visibly that theorem. A slot for False is not inhabited at all, which makes a false assumption visibly unconstructable.

In Recognition Science, this distinction matters for the quantum gravity claim surface. The old shell-bearing coordination module, a 57,000-line file, was retired and its endpoint restated over explicit proposition parameters. The flagship master surface was retyped on 2026-07-04. The migration was completed behind a kernel-checked bridge certificate, and the audit tool remains in place.

The lesson is about honesty in formal work. A proof that hides its assumptions in a shell is weaker than it appears. The conditional slot makes the assumption part of the type, so the compiler enforces the visibility that a naming convention cannot. What the declaration does not claim is that any particular physical theorem, such as the existence of a continuum or a Bianchi identity, is true. It claims only that the shell that would have hidden the assumption is always inhabited, and that the lifted slot carries exactly the information of its parameter.

/-- **The shell is always inhabited**, by `⟨True, trivial⟩`. Hence its type
carries no information about what was assumed: every such shell can be
constructed, whether the intended `P` is a deep theorem or `True`. This is
exactly why a "theorem" consuming a shell hides its contingency. -/
theorem vacuousWitnessShell_always_inhabited : Nonempty VacuousWitnessShell :=
  ⟨{ P := True, holds := trivial }⟩

/-- Two shells with completely different content are nonetheless both inhabited,
witnessing that inhabitation of the shell type tells you nothing about the
assumption. -/
theorem vacuousWitnessShell_inhabited_regardless (Q : Prop) (hQ : Q) :
    Nonempty VacuousWitnessShell ∧ Nonempty VacuousWitnessShell :=
  ⟨⟨{ P := True, holds := trivial }⟩, ⟨{ P := Q, holds := hQ }⟩⟩

/-- `ConditionalSlot True` is trivially inhabited -- and visibly so, because the
parameter is `True` right there in the type. -/
theorem conditionalSlot_true_inhabited : Nonempty (ConditionalSlot True) :=
  ⟨{ holds := trivial }⟩

/-- `ConditionalSlot False` is **not** inhabited. The contrast with
`vacuousWitnessShell_always_inhabited` is the whole point: a false assumption is
now visibly unconstructable, whereas the vacuous shell would have been
constructed anyway with `P := True`. -/
theorem conditionalSlot_false_not_inhabited : ¬ Nonempty (ConditionalSlot False) := by
  rw [conditionalSlot_nonempty_iff]
  exact not_false

What this page does not claim

The declaration does not prove that any particular physical theorem, such as the existence of a continuum or a Bianchi identity, is true. The declaration does not claim that the old shell was ever used to prove a false statement, only that it could have been. The declaration does not establish the truth of any proposition in the quantum gravity claim surface.

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/Gravity/ConditionalSlot.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: