Documentation

Mathlib.Tactic.Inclusion.Extension.IntervalDyadicReal.Rational

Rational enclosures for interval_dyadic_real #

This file defines inclusion operations for the interval_dyadic_real inclusion family which define dyadic interval enclosures for rational numbers.

The precision of dyadic approximations, defaulting to zero.

Equations
Instances For

    Enclose a rational number in a dyadic interval with precision prec.

    Equations
    • One or more equations did not get rendered due to their size.
    Instances For
      theorem Inclusion.IntervalDyadicReal.ratCast_mem (q : ℚ) (prec : ℕ) :
      ↑q ∈ rat q prec

      The interval [(c - r) / d, (c + r) / d], rounded outward to precision prec.

      Equations
      • One or more equations did not get rendered due to their size.
      Instances For
        theorem Inclusion.IntervalDyadicReal.ratBall_mem {x : ℝ} {c r : ℤ} {d : ℕ} (hx : |x - ↑c / ↑d| ≤ ↑r / ↑d) (prec : ℕ) :
        x ∈ ratBall c r d prec

        Efficiently enclose m / d in a dyadic interval with precision prec.

        Equations
        • One or more equations did not get rendered due to their size.
        Instances For
          theorem Inclusion.IntervalDyadicReal.natDiv_eq_rat (m : ℕ) {d : ℕ} (prec : ℕ) (hd : 0 < d) :
          natDiv m d prec = rat (mkRat (↑m) d) prec
          theorem Inclusion.IntervalDyadicReal.natDiv_mem (m : ℕ) {d : ℕ} (prec : ℕ) (hd : 0 < d) :
          ↑m / ↑d ∈ natDiv m d prec

          m / d rounded down to precision prec (the lower endpoint of natDiv m d prec). Unlike (m / d : ℚ).toDyadic prec, this does not normalise the fraction m / d and so avoids a potentially very expensive Nat.gcd computation.

          Equations
          Instances For
            theorem Inclusion.IntervalDyadicReal.natDivLower_eq (m d prec : ℕ) :
            natDivLower m d prec = (↑m / ↑d).toDyadic ↑prec

            Enclose a scientific literal in a dyadic interval with precision prec.

            Equations
            Instances For