pith. machine review for the scientific record. sign in
module module high

IndisputableMonolith.Foundation.NonTrivialityFromDistinguishability

show as:
view Lean formalization →

This module establishes that operative distinguishability in the comparison operator domain is equivalent to non-trivial specifiability on an inhabited carrier. It supplies the Aristotelian content of comparison as the precondition for the Law of Logic. Researchers building the Recognition Science foundation cite it to justify the absolute floor without adding physical postulates. The argument consists of direct equivalence theorems that close the meta-language distinction already present in the carrier.

claimDistinguishability holds when there exist positive $x, y > 0$ such that the comparison $C(x, y)$ is not vacuous, where $C : ℝ → ℝ → ℝ$ is the comparison operator of the Law of Logic. This is equivalent to non-trivial specifiability on an inhabited carrier.

background

The module belongs to the Foundation layer and imports LogicAsFunctionalEquation, which encodes the Law of Logic via the comparison operator $C$, together with AbsoluteFloorClosure, whose joint certificate states that distinguishability is equivalent to non-trivial specifiability on an inhabited carrier. Distinguishability is introduced as the operative content of comparison: at least one pair of positive quantities yields a non-vacuous result. The meta-language already distinguishes propositions, so the remaining floor is not an RS-specific postulate.

proof idea

This is a definition module containing equivalence theorems. The core results are nonTrivial_of_distinguishability, distinguishability_of_nonTrivial, and nonTrivial_iff_distinguishability. Each direction follows from the closure properties certified in AbsoluteFloorClosure; the iff form is obtained by composing the two one-line implications.

why it matters in Recognition Science

The module feeds the root IndisputableMonolith theorem and the DomainBootstrap move that recovers the comparison-operator domain. It closes the precondition that the meta-language distinguishes propositions, allowing the Law of Logic to proceed from the recovered real line without circularity. Downstream DomainBootstrap explicitly invokes this equivalence to bootstrap the domain.

scope and limits

used by (2)

From the project-wide theorem graph. These declarations reference this one in their body.

depends on (2)

Lean names referenced from this declaration's body.

declarations in this module (18)