Lax Lean Archive

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

Proof of `Just-in-Time Scheduling on Unrelated Machines as Day-Independent Due Dates` (4th statement)

groundedproofs/Lax117284Proofs/WordCorrect.lean · lax-117284

What this proof establishes

thm✓Lax117284.Theorem11 (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

A word encoding an instance of R∣∣∑ZR || ∑ Z is sent to the code of the constructed instance, which has day-independent due dates; every other word goes to the rejected word.