Proof of `Clique number equals the maximum number of accepting random choices` (4th statement)
groundedproofs/Lax253009Proofs/ConsistencyGraph.lean · lax-253009
What this proof establishes
no assumptions
Assuming the claims on the left, the claim on the right holds — checked by the archive's pipeline. Proof code is not displayed here.
Description
Glue the compatible partial assignments in a clique, assigning false at positions no view fixes. Distinct vertices have distinct random choices.