A shortest path can wait longer
Lax330177.SlowShortest · concepts/Lax330177/SlowShortest.lean · lax-330177
No public endorsements yet.
Loading review…
Sign in with ORCIDNatural Language Statement
Lemma
On the three-vertex chain and its shortcut triangle, each traversal takes c units, where c is zero or one. On the chain without the shortcut, departures at 0 and 3 give a shortest path for either traversal cost. Another feasible path arrives in less elapsed time and has less total waiting.
Concept map
Lean source view on GitHub
| 1 | import Lax330177.CostExamples |
| 2 | |
| 3 | /-! |
| 4 | --- |
| 5 | title: A shortest path can wait longer |
| 6 | type: lemma |
| 7 | --- |
| 8 | On the three-vertex chain and its shortcut triangle, each traversal takes c units, where c is zero or one. On the chain without the shortcut, departures at 0 and 3 give a shortest path for either traversal cost. Another feasible path arrives in less elapsed time and has less total waiting. |
| 9 | |
| 10 | [Read the proof.](Lax330177Proofs.CostExamples.slow_shortest.html) |
| 11 | -/ |
| 12 | namespace Lax330177.SlowShortest |
| 13 | open Lax330177.Representations Lax330177.Durations Lax330177.OptimalPaths |
| 14 | open Lax330177.CostExamples |
| 15 | |
| 16 | axiom slow_shortest (c : Fin 2) : Shortest (via false true c) ∧ |
| 17 | ¬ Fastest (via false true c) ∧ ¬ MinimumWaiting (via false true c) |
| 18 | end Lax330177.SlowShortest |
| 19 |
Discussion
Ask a question or add context. Endorsements and structured flags are kept in the review panel above.
0 comments