This PR adds the inverse of a dyadic rational, at a given precision, and characterising lemmas. Also cleans up various parts of the `Int.DivMod` and `Rat` APIs, and proves some characterising lemmas about `Rat.toDyadic`. --------- Co-authored-by: Rob23oba <152706811+Rob23oba@users.noreply.github.com>
12 lines
317 B
Text
12 lines
317 B
Text
/-
|
|
Copyright (c) 2025 Lean FRO, LLC. All rights reserved.
|
|
Released under Apache 2.0 license as described in the file LICENSE.
|
|
Authors: Kim Morrison
|
|
-/
|
|
module
|
|
prelude
|
|
|
|
public import Init.Data.Dyadic.Basic
|
|
public import Init.Data.Dyadic.Instances
|
|
public import Init.Data.Dyadic.Round
|
|
public import Init.Data.Dyadic.Inv
|