Lax Lean Archive

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

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

groundedproofs/Lax470956Proofs/Checker.lean · lax-470956

What this proof establishes

no assumptions

thm✓Lax470956.Theorem2 (3rd 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 three halves of a reduction, put together: the map is Construction2.reduceConstruction2.reduce, its correctness is reducecorrectreduce_correct, the slice it lands in is reduceslicereduce_slice, and the time it takes is reduceramPolytimereduce_ramPolytime.