Foundation Distinguishability From Specifiability

The specification floor

In mathematics, to specify something is to draw a line around it. A specification is any rule that sorts a collection of objects into those inside the boundary and those outside it. The rule must be honest: at least one object must satisfy it, and at least one must fail it. A rule that everything satisfies, or that nothing satisfies, draws no real boundary at all.

This idea has a long history. In set theory, a proper subset is exactly such a boundary: a collection inside a larger universe that is neither empty nor the whole universe. The classical Russell paradox showed how careless boundary-drawing can collapse a system. Modern foundations therefore treat specification as a primitive operation, the act of separating a sub-collection from its background.

In Recognition Science, the framework's library proves a small but sharp equivalence. The theorem states that on any inhabited collection, the existence of a non-trivial specification is logically equivalent to the existence of two distinct elements. In plain language: if you can describe a boundary with something on each side, then there are at least two different things to separate. Conversely, if there are two distinct objects, you can always build a specification that puts one inside and one outside. The machine-checked library of formal theorems records this as distinguishability_iff_nontrivial_specifiability.

Why does this matter? The framework's deeper program seeks an absolute floor for what any recognition system must presuppose. This theorem shows that specification and distinction are not two separate requirements but one and the same. A framework that can specify an ontology with something inside and something outside already possesses the distinction needed by the wider Law-of-Logic chain. The result is deliberately minimal: it needs no arithmetic, no ordering, no structure beyond a predicate and two witnesses.

The practical upshot is a certificate. The framework's library packages the equivalence as a certificate structure, a formal object that any future theorem can invoke. When a later result needs to know whether a carrier has at least two elements, it can check whether a non-trivial specification exists instead. This is not a claim about physics or about the physical world; it is a claim about what any formal system must already contain if it can draw a genuine boundary.

/-- Non-trivial specifiability is equivalent to object-level
distinguishability on an inhabited carrier. -/
theorem distinguishability_iff_nontrivial_specifiability
    {K : Type*} [Nonempty K] :
    (∃ x y : K, x ≠ y) ↔ Nonempty (NontrivialSpecification K) := by
  constructor
  · rintro ⟨x, y, hxy⟩
    have hy_ne_x : y ≠ x := by
      intro hyx
      exact hxy hyx.symm
    exact ⟨
      { inOntology := fun z => z = x
        someInside := ⟨x, rfl⟩
        someOutside := ⟨y, hy_ne_x⟩ }⟩
  · rintro ⟨S⟩
    exact distinguishability_from_specification S

/-- Specifiability forces distinguishability. -/
theorem distinguishability_from_specification
    {K : Type*} (S : NontrivialSpecification K) :
    ∃ x y : K, x ≠ y := by
  obtain ⟨P, ⟨x, hx⟩, ⟨y, hy⟩⟩ := S
  refine ⟨x, y, ?_⟩
  intro hxy
  have hyx : P y := by
    simpa [hxy] using hx
  exact hy hyx

/-- The specifiability closure certificate is theorem-backed. -/
theorem specifiabilityClosureCert (K : Type*) [Nonempty K] :
    SpecifiabilityClosureCert K where
  equivalence := distinguishability_iff_nontrivial_specifiability

What this page does not claim

This does not claim that specification requires a physical universe or any particular ontology. This does not claim that the equivalence holds without the inhabited-carrier condition. This does not claim that the framework derives any physical constant from this result alone.

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