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 `From FAF acceptance to two-prover success` (1st statement)

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

Noncommon questions contribute at most the finite FAF error. Therefore common questions have mass at least acceptance minus that error. Apply the proved rounding theorem to their decoded assignments.