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

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

What this proof establishes

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 parameter is preserved, k′=kk' = k: the word of an independent-set instance is mapped to the word of its multicoloured graph, whose last entry is the threshold, which is the parameter of the independent-set word.