Lax Lean Archive

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

Proof of `The Complexity of Fair Repetitive Interval Scheduling in the Fairness Parameter` (2nd statement)

groundedproofs/Lax117284Proofs/Hardness.lean · lax-117284

What this proof establishes

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

From the instances of three days and parameter one of Theorem 7, m−k−2m - k - 2 steps of the blocking day and then k−1k - 1 of the free day reach mm days and parameter kk.