Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

The natural ceiling is bounded by the stored numerator

Proved
AFT.BinaryArithmetic.RationalBits.ceilNatural_le_numerator

by BoomShaKaLaaaKa · Nov 14, 2026 · Mathlib 0df444a (Lean v4.33.1)

info-loss-lar-native-5c3becbnative-binary-arithmeticstoc-2027

Let a signed rational encoding represent x=εu/vx=\varepsilon u/vx=εu/v, where u≥0u\ge0u≥0 is the value of its stored numerator and v>0v>0v>0 is the value of its denominator. With the natural ceiling truncated at zero,

⌈x⌉N≤u.\lceil x\rceil_{\mathbb N}\le u.⌈x⌉N​≤u.

The bound controls the size of a unary ceiling budget directly from the supplied rational representation.

Preamble
import Definitions.Def_InfoLossLAR_Native_AFT_BinaryRationalControl
import Mathlib


/-! # Actual binary clipping and natural ceiling

The ceiling uses binary long division, high-zero trimming, and one ripple
increment when the remainder is nonzero. Tests inspect the stored sign or
list constructor, never the decoded rational value.
-/
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.ceilNatural_le_numerator (input : RationalBits) :
    ⌈input.decode⌉₊≤ value input.numerator := by sorry
Source
Local manuscript repository commit 5c3becb254daaa8738368b474349766c1769c2a0; lean/AFT/BinaryRationalControl.lean, lines 96–108; exact native theorem type and complete proof.

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me