Version history

Submission versions

  1. lax-323828current version

    Håstad’s inapproximability of Max Clique

  2. lax-253009viewing

    Håstad’s inapproximability of Max Clique

    GitHub sourceShown on this page

Proof of `Higher-moment bound for the small-coefficient CNA term` (1st statement)

groundedproofs/Lax253009Proofs/SmallCoefficientSoundness.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.

Read the Lean proof on GitHub

Description

Cancel tuples that are not double covers. For small unions use the small coefficient bound, and for large unions use mixed-predicate concentration.