Proof of `Explicit integer budgets for the round-or-cut algorithm` (1st 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 load clears the accuracy denominator exactly. Sparsity is twice the target threshold, and the level is the sparsity times the binary-log bound.