Lax Lean Archive

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

Proof of `Clique number equals the maximum number of accepting random choices` (1st statement)

groundedproofs/Lax253009Proofs/ConsistencyGraph.lean · lax-253009

What this proof establishes

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

Apply soundness to a maximum clique and completeness to every proof.