Lax Lean Archive

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

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

What this proof establishes

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

reducereduce is a reduction with the parameter preserved (g=idg = id), computable in polynomial time; WHA5Bridges.fptReducesofpolyTimeWH_A5_Bridges.fptReduces_of_polyTime makes it an fpt-reduction.