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 `The finite few-amortized-free-bits test` (1st statement)

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

Outside the union of CNA decoding failures, each accepting table has a decoded assignment satisfying its side condition. Their projections agree on all reference functions, so the many-table agreement bound applies.