Foundation Absolute Floor Closure Absolute Floor Of Bare Distinguishability

The minimal starting point

In the Recognition Science framework, the declaration absolute_floor_of_bare_distinguishability establishes a precise equivalence. It proves that on any inhabited collection of objects, the existence of two distinct objects is logically equivalent to the existence of a non-trivial specification. A non-trivial specification means a statement that can be made about the objects which is not vacuously true for all of them. The theorem is a formal, machine-checked result in the framework's library of formal theorems, not a physical postulate.

The proof is deliberately modest. The framework shows that if you can distinguish two objects, then you can formulate a non-trivial specification, and conversely, if you can formulate a non-trivial specification, then there must be at least two distinguishable objects. The theorem also notes that the meta-language, the language in which the formal reasoning itself is conducted, already distinguishes between different propositions. This is a precondition for the whole framework: there must be a universe of discourse with more than one element in which any non-vacuous statement can be made.

The minimal concrete example is the Boolean type, with its two values false and true. The framework proves that this two-element set realizes the absolute floor. The result is a joint certificate, meaning it ties together two routes to the same conclusion. The first route is a self-bootstrap certificate, and the second route is the equivalence between bare distinguishability and non-trivial specifiability. The certificate confirms that the floor is not an RS-specific physical axiom but a logical precondition for any meaningful discourse.

What this theorem does not claim is that the universe is physically composed of two objects. It does not claim that the two-element Boolean type is the actual substrate of reality. The theorem is about the logical prerequisites for the framework's own language. It establishes that the framework's starting point is not arbitrary: it requires only the minimal condition that there is a non-singleton universe of discourse. This is a statement about the conditions for making any non-vacuous claim, not a claim about the physical constitution of the cosmos.

The consequence is that the framework's foundational floor is as lean as possible. It does not rest on a special physical assumption about the world. It rests on the logical necessity that a language of discourse has at least two distinguishable elements. This is a theorem about the framework's own preconditions, and it is this minimalism that the declaration establishes.

/-- Bare distinguishability and the absolute-floor witness are equivalent on
an inhabited carrier. -/
theorem absolute_floor_iff_bare_distinguishability
    {K : Type*} [Nonempty K] :
    AbsoluteFloorWitness K ↔ ∃ x y : K, x ≠ y :=
  ⟨bare_distinguishability_of_absolute_floor, absolute_floor_of_bare_distinguishability⟩

/-- The minimal concrete carrier `Bool` realizes the absolute floor. -/
theorem bool_absolute_floor : AbsoluteFloorWitness Bool :=
  absolute_floor_of_bare_distinguishability ⟨false, true, bool_distinguishable⟩

/-- The absolute-floor closure certificate is theorem-backed. -/
theorem absoluteFloorClosureCert : AbsoluteFloorClosureCert where
  routeA := selfBootstrapCert
  routeB := fun K _ => distinguishability_iff_nontrivial_specifiability (K := K)
  bool_witness := bool_absolute_floor

What this page does not claim

The theorem does not claim that the physical universe is composed of only two objects. The theorem does not claim that the Boolean type is the actual substrate of reality. The theorem does not establish any physical law; it establishes a logical precondition for the framework's language.

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