Rational inversion preserves binary height
ProvedAFT.RationalNumerics.HeightBound.invinfo-loss-lar-native-5c3becbrational-arithmeticstoc-2027
Let and . If the absolute reduced numerator and denominator of are both at most , then the same bounds hold for , with . This controls exact rational inversion in the constructive affine sampler.
Preamble
import Definitions.Def_InfoLossLAR_Native_AFT_RationalHeight import Mathlib /-! # Explicit binary height bounds for executable rational arithmetic -/ namespace AFT.RationalNumerics end AFT.RationalNumerics section AFT section RationalNumerics open AFT.RationalNumerics open scoped BigOperators namespace AFT.RationalNumerics.HeightBound end AFT.RationalNumerics.HeightBound section HeightBound open AFT.RationalNumerics.HeightBound
Formal statement
theorem AFT.RationalNumerics.HeightBound.inv {value : ℚ} {bits : ℕ} (h : HeightBound value bits) : HeightBound value⁻¹ bits := by sorrySource
Local manuscript repository commit 5c3becb254daaa8738368b474349766c1769c2a0; lean/AFT/RationalHeight.lean, theorem HeightBound.inv. The original theorem type is preserved exactly.