Proof of `Early and late direct paths`
groundedproofs/Lax330177Proofs/CostExamples.lean · lax-330177
What this proof establishes
no assumptions
Assuming the claims on the left, the claim on the right holds — checked by the archive's pipeline. Proof code is not displayed here.
Description
Vertices 0 and 2 are distinct, so every path needs at least one traversal and takes at least c time units. A direct traversal attains both bounds and has zero waiting, whether it departs at 0 or at 3. Departing at 0 gives arrival c, the earliest possible from release time 0. Departing at 3 uses the last available snapshot. Comparing the two direct paths shows that the early one loses on latest departure and the late one loses on foremost arrival.