Lax Lean Archive

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

Proof of `Clique inapproximability under NP not contained in BPP` (1st statement)

groundedproofs/Lax253009Proofs/ComplexityConsequences.lean · lax-253009

What this proof establishes

thm✓Lax253009.BPPConsequence (1st 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

Combine the main clique-hardness implication with the imported inclusion ZPP ⊆ BPP. Both statement dependencies are recorded by the archive.