Draft — mutable and not usable as a dependency; its citation marks the draft state.

Proof of `Bipartite comb lemma`

groundedproofs/Lax54Proofs/BipartiteCombLemma.lean · lax-54

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.

Read the Lean proof on GitHub

Description

Proof of the d=1/2d=1/2 case of Theorem 2.1. At each four-adic degree scale, a maximal peeling sequence is pruned in reverse order to form a comb. If no block has the required size, strong induction on the degree bound, together with (a+b)22a2+2b2(a+b)^2\leq 2a^2+2b^2, yields the sparse alternative.