A detour with no waiting
Lax330177.NoWaitDetour · concepts/Lax330177/NoWaitDetour.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. In the triangle, the two-hop path departing at 0 and c minimizes waiting for either traversal cost and uses more hops than the shortcut. It is fastest exactly when c is zero.
Concept map
In the paper
- page 3 of this submission's paper
Lean source view on GitHub
| 1 | import Lax330177.CostExamples |
| 2 | |
| 3 | /-! |
| 4 | --- |
| 5 | title: A detour with no waiting |
| 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. In the triangle, the two-hop path departing at 0 and c minimizes waiting for either traversal cost and uses more hops than the shortcut. It is fastest exactly when c is zero. |
| 9 | |
| 10 | [Read the proof.](Lax330177Proofs.CostExamples.no_wait_detour.html) |
| 11 | -/ |
| 12 | namespace Lax330177.NoWaitDetour |
| 13 | open Lax330177.Representations Lax330177.Durations Lax330177.OptimalPaths |
| 14 | open Lax330177.CostExamples |
| 15 | |
| 16 | axiom no_wait_detour (c : Fin 2) : MinimumWaiting (via true false c) ∧ |
| 17 | ¬ Shortest (via true false c) ∧ (Fastest (via true false c) ↔ c.val = 0) |
| 18 | end Lax330177.NoWaitDetour |
| 19 |
Discussion
Ask a question or add context. Endorsements and structured flags are kept in the review panel above.
0 comments