Proof of `Correctness of the complete recursive unweighted algorithm`
groundedproofs/Lax263307Proofs/RecursiveAlgorithm.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
Induct on the balanced-recursion depth, transfer independent sets through the canonical part labels, and use the target-search invariant. The explicit accuracy denominator bounds the accumulated multiplicative loss.