Proof of `Random sparsification of a consistency graph` (2nd statement)
groundedproofs/Lax253009Proofs/TestSampling.lean · lax-253009
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
The sampled clique number is attained by one of the 2^m global proofs. Apply the multiplicative tail bound simultaneously to all of them.