pith. sign in
module module high

IndisputableMonolith.Foundation.RationalsFromLogic

show as:
view Lean formalization →

This module recovers the rational numbers from the integers built via the law of logic. It introduces PreRat as pairs of integers with nonzero denominator, equips them with the equivalence ratRel, and forms the quotient LogicRat. Researchers tracing the logic-native number tower cite it when constructing reals or auditing recovery steps. The module consists entirely of definitions and relation lemmas with no complex proofs.

claimA pre-rational is a pair $(n,d)$ with $n,d$ integers and $d$ nonzero. The relation identifies $(n_1,d_1)$ with $(n_2,d_2)$ precisely when $n_1 d_2 = n_2 d_1$. The quotient by this equivalence yields LogicRat, the logic-recovered rationals.

background

The module continues the foundation recovery of arithmetic from logic, importing the integer layer and using Mathlib setoids. PreRat is the raw pair type with nonzero denominator. ratRel is the equivalence relation on these pairs, setoid packages it, and LogicRat is the resulting quotient type. This supplies the third stage of the tower LogicNat to LogicInt to LogicRat.

proof idea

This is a definition module, no proofs.

why it matters in Recognition Science

The module supplies the rational layer in the recovered tower LogicNat to LogicInt to LogicRat to LogicReal to LogicComplex. It is imported by RealsFromLogic to complete LogicRat to reals via Bourbaki completion, by RecoveredTowerAxiomAudit to pin the named recovery theorems, and by LogicErdosStrausRCL to transport rational identities through LogicRat.toRat.

scope and limits

used by (3)

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

depends on (1)

Lean names referenced from this declaration's body.

declarations in this module (40)