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

Proof of `Construction 1` (3rd statement)

groundedproofs/Lax470956Proofs/Construction1Index.lean · lax-470956

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.

Read the Lean proof on GitHub

Description

The machines are the C(k,2)C(k,2) edge selection machines, numbered by their colour pair, together with the validation machine numbered C(k,2)C(k,2); pairIdxltpairIdx_lt and pairIdxinjpairIdx_inj are what say that numbering uses each of the first C(k,2)C(k,2) numbers exactly once.