Proof of `Explicit integer budgets for the round-or-cut algorithm` (2nd statement)
groundedproofs/Lax263307Proofs/AlgorithmParameters.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 integer floor denominator is exactly the denominator of the heavy conditioning probability floor; rational casts preserve its reciprocal power.