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

IndisputableMonolith.Numerics.Interval.Basic

show as:
view Lean formalization →

This module defines the core type of closed intervals with rational endpoints to underpin rigorous numerical bounds throughout the Recognition Science numerics layer. Interval arithmetic developers for exponential, logarithmic, and constant bounds cite it as the shared foundation. It supplies the Interval structure plus basic operations such as addition, negation, and containment checks, with no proof content.

claimA closed interval $I = [q_1, q_2]$ where $q_1, q_2$ are rational numbers, equipped with operations for addition, negation, and point containment.

background

The Numerics.Interval.Basic module introduces the Interval type as a closed interval whose endpoints lie in the rationals. It supplies the basic constructors and predicates (contains, point, add, neg) that later modules rely on for sound interval arithmetic. These definitions sit inside the broader Numerics domain and are imported by every higher-level bound module.

proof idea

This is a definition module with no proofs; it simply declares the Interval data type and the elementary operations on it.

why it matters in Recognition Science

The module supplies the shared interval type consumed by all downstream interval-arithmetic modules (Exp, Log, PhiBounds, PiBounds, Pow, GalacticBounds). Those modules in turn deliver the rigorous bounds on φ, π, exp, and log that feed the Recognition Science mass ladder and constant calculations.

scope and limits

used by (8)

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

declarations in this module (27)