Proof of `Explicit integer budgets for the round-or-cut algorithm` (3rd statement)
groundedproofs/Lax263307Proofs/AlgorithmParameters.lean · lax-263307
What this proof establishes
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 protected-radius denominator is positive. A power of two with exponent that denominator plus two is larger than the denominator itself.