Proof of `Quantitative gaps for recursive component cuts` (5th statement)
groundedproofs/Lax263307Proofs/StrongComponentGaps.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
Subtract the maximal coordinate perturbation loss from the feasible query gap, using k≥1 and coefficient sum at most 2n.