Lax Lean Archive

Proof of `The Dynamic Program for Interval Scheduling, and Its State Space` (1st statement)

groundedproofs/Lax888481Proofs/DynamicProgram.lean · lax-888481

What this proof establishes

no assumptions

def✓Lax888481.DynamicProgram (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

A valid state at time tt assigns to each machine a job alive at tt, or nothing, so the valid states inject into the functions from machines to OptionOption of the live jobs.