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

Proof of `The auxiliary problem reduces to scheduling on two job lengths` (1st statement)

groundedproofs/Lax391470Proofs/Hardness.lean · lax-391470

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 reduction is the map reducereduce; its two properties are the two other statements.