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 `Perfect completeness and local decoding of the long-code test` (4th statement)

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

The predicate recognizing the initial answer vector cannot vanish on every satisfying word: step (3) would identify its accepted answer with false.