Lax Lean Archive

Proof of `Independent Set Reduces to Multicoloured Clique` (5th statement)

groundedproofs/Lax496464Proofs/WHierarchy/MccNP/HardnessFinal.lean · lax-496464

What this proof establishes

no assumptions

thm✓Lax496464.WH_F4_IndependentSetToMcc (5th 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

The same map is a polynomial-time reduction on every word.