Lax Lean Archive

Version history

Submission versions

  1. lax-888481current version

    Interval Scheduling with Eligible Machine Sets

    Created Lean v4.33.0mathlib db584cd6d46c92f209a44c0f1c829460d327499d
    GitHub sourceOpen version
  2. lax-470956viewing

    Interval Scheduling with Eligible Machine Sets

    Created Lean v4.33.0mathlib db584cd6d46c92f209a44c0f1c829460d327499d
    GitHub sourceShown on this page

Proof of `Scheduling every job is hard for constant processing times and unit weights` (1st statement)

conditional — 1 open assumptionproofs/Lax470956Proofs/Theorem2.lean · lax-470956

What this proof establishes

thm×Lax470956.Theorem2 (1st 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

The slice statement, forgetting the slice.