Lax Lean Archive

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

Proof of `Håstad inapproximability for bounded-error randomized algorithms` (2nd statement)

groundedproofs/Lax253009Proofs/RandomizedCliqueHardness.lean · lax-253009

What this proof establishes

thm✓Lax253009.RandomizedCliqueHardness (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

Contrapose the randomized implication through its concept statement so the archive records the dependency in the proof network.