Every rational has a signed binary representation
ProvedAFT.BinaryArithmetic.RationalBits.exists_codeinfo-loss-lar-native-5c3becbnative-binary-arithmeticstoc-2027
Every rational number admits a valid signed binary numerator-denominator encoding:
The denominator in such an encoding has positive decoded value. The statement ensures that the arithmetic representation covers the entire rational coefficient space.
Preamble
import Definitions.Def_InfoLossLAR_Native_AFT_BinaryRationalLiterals import Mathlib /-! Finite stored literals and explicit copying. `exists_code` is a semantic encoding theorem; it is not a runtime rational-to-bits oracle. Programs store its finite Boolean literals before execution. -/ namespace AFT.BinaryArithmetic end AFT.BinaryArithmetic section AFT section BinaryArithmetic open AFT open AFT.BinaryArithmetic namespace AFT.BinaryArithmetic.RationalBits end AFT.BinaryArithmetic.RationalBits section RationalBits open AFT open AFT.BinaryArithmetic open AFT.BinaryArithmetic.RationalBits
Formal statement
theorem AFT.BinaryArithmetic.RationalBits.exists_code (q : ℚ) : ∃ code : RationalBits,code.decode=q := by sorry
Source
Local manuscript repository commit 5c3becb254daaa8738368b474349766c1769c2a0; lean/AFT/BinaryRationalLiterals.lean, lines 55–73; exact native theorem type and complete proof.