Lax Lean Archive

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

Proof of `The dynamic program for interval scheduling, and its state space` (1st statement)

groundedproofs/Lax470956Proofs/DynamicProgram.lean · lax-470956

What this proof establishes

no assumptions

def✓Lax470956.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.