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 `Soundness of the finite FAF composition` (2nd statement)

groundedproofs/Lax253009Proofs/FAFComposition.lean · lax-253009

What this proof establishes

no assumptions

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

Every factor is positive, so game soundness tending to zero can meet this threshold for each fixed choice of the verifier parameters.