Proof of `Rounding loses at most one weight unit per vertex` (3rd statement)
groundedproofs/Lax263307Proofs/RoundingBounds.lean · lax-263307
What this proof establishes
no assumptions
Assuming the claims on the left, the claim on the right holds — checked by the archive's pipeline. Proof code is not displayed here.
Description
The number of copies is at most .
Proof strategy
Each floor is bounded by , and each weight by the maximum weight. Sum these bounds and substitute the chosen scale.
Attribution
Bonnet–Chang, proof of Theorem 2 in Section 6.