Proof of `A detour with no waiting`
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.
In the paper
- page 3 of this submission's paper
Description
Depart on the two arcs at times 0 and c. The second departure is exactly the first arrival, so total waiting is zero, the least possible. The direct arc uses one hop instead of two. With c equal to zero the detour also takes zero elapsed time and is fastest. With c equal to one it takes two units, while the direct arc takes only one.