Encyclopedia Foundation Foundation Absolute Floor Closure Absolute Floor Closure Cert
ARTICLE 3 claims 3 theorems
Foundation Absolute Floor Closure Absolute Floor Closure Cert
A machine-checked proof shows that the framework's most basic requirement reduces to a simple fact: any universe with at least two distinct things can support the act of specifying one of them.
The absolute floor
The absolute floor, the minimum requirement for any system that keeps a ledger of recognition events, turns out to be a modest precondition. The declaration absoluteFloorClosureCert establishes that this floor is equivalent to a plain fact: a universe of discourse must contain at least two distinct objects. If it does, then it can support a non-trivial specification, a way of picking out one object as opposed to another. This is the precondition for any act of recognition, the framework's term for the basic event of distinguishing one thing from another.
Formally, the certificate packages three results. First, it includes a self-bootstrap certificate, a separate theorem about the framework's own starting point. Second, it states that for any inhabited type, having two distinct elements is equivalent to having a non-trivial specification. Third, it provides a concrete witness: the Boolean type, with its two values false and true, realizes the absolute floor. The certificate itself is theorem-backed, meaning it is a proved statement in the machine-checked library of formal theorems, not a definitional choice.
The key equivalence, absolute_floor_iff_bare_distinguishability, says that the absolute floor holds exactly when there exist two distinct elements. The proof is constructive: from the witness one derives the two distinct elements, and conversely from two distinct elements one constructs the witness. The meta-language part, that propositions can be distinguished, is theorem-backed by a separate route. The certificate is deliberately modest: it does not assert that the framework's physical postulates are true, only that its most basic logical precondition is met by any non-singleton universe.
What this changes is the starting point. The framework does not need to assume a rich structure from the outset. It needs only the bare fact that the universe of discourse is not a single point. Everything else, the cost function, the golden ratio, the eight-tick cycle, builds on this floor. The certificate closes the question of what the framework's most fundamental assumption is: it is not a physical postulate but a logical precondition, the existence of at least two things to distinguish.
In Recognition Science, the certificate serves as the joint closure for the absolute-floor program. It shows that the floor reduces to meta-language proposition distinguishability plus a non-singleton universe of discourse. The actual mathematical receipt is the equivalence theorem; a self-equality between status strings adds no theorem. The floor is therefore not an RS-specific physical postulate but the precondition that there is a non-singleton universe of discourse in which any non-vacuous specification can be stated.
THEOREM absolute_floor_iff_bare_distinguishability · IndisputableMonolith/Foundation/AbsoluteFloorClosure.lean
/-- 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⟩
THEOREM bool_absolute_floor · IndisputableMonolith/Foundation/AbsoluteFloorClosure.lean
/-- The minimal concrete carrier `Bool` realizes the absolute floor. -/
theorem bool_absolute_floor : AbsoluteFloorWitness Bool :=
absolute_floor_of_bare_distinguishability ⟨false, true, bool_distinguishable⟩
THEOREM absoluteFloorClosureCert · IndisputableMonolith/Foundation/AbsoluteFloorClosure.lean
/-- 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 certificate does not assert that any physical postulate of Recognition Science is true. It does not claim that the absolute floor is a physical law; it is a logical precondition. It does not establish that any particular universe of discourse actually exists; it only states a conditional equivalence.
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:
- What is the self-bootstrap certificate that the absolute-floor certificate includes?
- How does the absolute floor connect to the forcing chain that derives the golden ratio and the eight-tick cycle?
- What does non-trivial specifiability mean for a universe of discourse that is not a type in a proof assistant?
MACHINE LAYER · GROUNDED CLAIM TABLE · CLICK TO EXPAND
THEOREM absolute_floor_iff_bare_distinguishability · IndisputableMonolith/Foundation/AbsoluteFloorClosure.lean
/-- 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 absolute floor holds exactly when there exist two distinct elements. absolute_floor_iff_bare_distinguishability · IndisputableMonolith/Foundation/AbsoluteFloorClosure.leanTHEOREM bool_absolute_floor · IndisputableMonolith/Foundation/AbsoluteFloorClosure.lean
/-- 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 Boolean type, with its two values false and true, realizes the absolute floor. bool_absolute_floor · IndisputableMonolith/Foundation/AbsoluteFloorClosure.leanTHEOREM absoluteFloorClosureCert · IndisputableMonolith/Foundation/AbsoluteFloorClosure.lean
/-- 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_floorThe certificate is theorem-backed, meaning it is a proved statement in the machine-checked library of formal theorems. absoluteFloorClosureCert · IndisputableMonolith/Foundation/AbsoluteFloorClosure.lean