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 `Extracting prover strategies from decoded sets`

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

Fix a common answer separately for each second question. Randomly and independently choose one of B+1 slots for every first question; every decoded answer occupies a slot. Average over these global first-prover strategies and fix one whose success is at least the average.