Lax Lean Archive

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

Proof of `Interval scheduling with eligible machine sets as a zoo problem` (2nd statement)

groundedproofs/Lax434175Proofs/PadReduction.lean · lax-434175

What this proof establishes

thm✓Lax434175.IsemLink (2nd 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

Padding: a job without an eligible machine gets one new machine and weight zero. A word RAM program computes it in one pass.