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 `Deterministic bound for the large-coefficient CNA term`

groundedproofs/Lax253009Proofs/LargeCoefficientSoundness.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 each isolated distinguished label. The sum of coefficient magnitudes is at most 1/δ because δ|c| ≤ c² on all retained supports.