Foundation Nothing To Distinction Nothing Has No Object

The empty type

In mathematics, the empty set is the set with no elements. Its type-theoretic analogue is the empty type, often written as Empty, and the declaration nothing_has_no_object in the Recognition Science library is a machine-checked proof that this type indeed has no inhabitants. The proof is a single step: given any purported element, the eliminator for the empty type produces a contradiction. This is a theorem in the framework's machine-checked library of formal theorems, not a postulate.

The framework defines Nothing as the empty type and Something as the unit type, which has exactly one inhabitant. A companion theorem, nothing_ne_something, proves these two types are distinct: if they were equal, the single inhabitant of the unit type would transport into the empty type, which is impossible. This distinction is the type-level witness for the framework's T-1 floor, the claim that there exist two distinct types and two distinct propositions. The empty type and the unit type are the extremal pair: no two types are further apart.

What the declaration does not claim is that the framework derives distinction from nothing. Writing down "there is no distinction" already requires the sentence and the thing it denies. The proof relies on the ambient type theory: the universe hierarchy, inductive type formation, function types, and equality between types. An axiom audit that returns no axioms is a statement about postulates, never a claim that the result stands on nothing. The framework's actual claim is relative: the empty type is the initial object of the distinction signature, it is rigid, and it is unique up to unique isomorphism, so cost measured against it does not depend on a chosen base.

theorem nothing_has_no_object : IsEmpty Nothing :=
  ⟨fun e => Empty.elim e⟩

/-- The initial object of `Type`: no inhabitants, and a unique morphism into
every type. -/
def Nothing : Type := Empty

/-- The terminal object of `Type`: exactly one inhabitant. -/
def Something : Type := Unit

/-- **T-2.** The initial and terminal objects are distinct. Identifying them
would transport the inhabitant of `Unit` into `Empty`. -/
theorem nothing_ne_something : Nothing ≠ Something := by
  intro h
  have hn : Nonempty Nothing := by
    rw [h]; exact ⟨()⟩
  obtain ⟨e⟩ := hn
  exact Empty.elim e

/-- T-2 as a witness for the type half of the T-1 floor. -/
theorem type_floor_witness : ∃ α β : Type, α ≠ β :=
  ⟨Nothing, Something, nothing_ne_something⟩

What this page does not claim

The framework derives distinction from its own absence. An axiom audit returning no axioms means the result stands on nothing. The empty type is a rung below the T-1 floor.

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