Proof of `Majority normalization of sparse cut profiles` (4th statement)
groundedproofs/Lax342547Proofs/CutSparsity.lean · lax-342547
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
Every minority-majority pair gives a distinct nonzero unordered cut. The majority has more than half the tags, which yields the support bound.