While this submission is a draft, it cannot be used by other submissions.

Proof of `A polynomial-size 3-SAT reduction to arbitrarily small projection-game value`

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