Lax Lean Archive

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

Proof of `Håstad's clique inapproximability theorem` (2nd statement)

groundedproofs/Lax253009Proofs/ComplexityConsequences.lean · lax-253009

What this proof establishes

thm✓Lax253009.CliqueHardness (2nd statement)

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

Contraposition of the main clique-hardness implication. This proof retains that implication as an explicit archive assumption.