IndisputableMonolith.Numerics.Interval.Basic
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
- Does not implement floating-point or real-number endpoints.
- Does not compute bounds for transcendental functions.
- Does not include automatic error propagation or advanced tactics.
- Does not handle open or half-open intervals.
used by (8)
-
IndisputableMonolith.Numerics.Interval.Exp -
IndisputableMonolith.Numerics.Interval.GalacticBounds -
IndisputableMonolith.Numerics.Interval.Log -
IndisputableMonolith.Numerics.Interval.PhiBounds -
IndisputableMonolith.Numerics.Interval.PiBounds -
IndisputableMonolith.Numerics.Interval.Pow -
IndisputableMonolith.Numerics.Interval.Tactic -
IndisputableMonolith.Numerics.Interval.Trig
declarations in this module (27)
-
structure
Interval -
def
contains -
def
point -
theorem
contains_point -
def
mk' -
def
add -
theorem
add_lo -
theorem
add_hi -
theorem
add_contains_add -
def
neg -
theorem
neg_lo -
theorem
neg_hi -
theorem
neg_contains_neg -
def
sub -
theorem
sub_lo -
theorem
sub_hi -
theorem
sub_contains_sub -
def
mulPos -
theorem
mulPos_contains_mul -
def
smulPos -
theorem
smulPos_contains_smul -
def
npow -
theorem
npow_contains_pow -
theorem
lo_gt_implies_contains_gt -
theorem
hi_lt_implies_contains_lt -
theorem
lo_ge_implies_contains_ge -
theorem
hi_le_implies_contains_le