While this submission is a draft, it cannot be used by other submissions.

Proof of `Combining recursive answers in round-or-cut` (2nd statement)

groundedproofs/Lax263307Proofs/RecursiveRounding.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.

Read the Lean proof on GitHub

Description

If a part's cost exceeds its certified bound, Lemma 13 supplies the cut. Otherwise sum the recursive size guarantees, replace each bound by the corresponding part cost, and use the separator's lightness to retain one additional factor of 1−δ1-δ.

Attribution

Bonnet–Chang, equation (24) in Lemma 14.