Early and late direct paths
Lax330177.DirectChoices · concepts/Lax330177/DirectChoices.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, direct departures at 0 and 3 both minimize hops, elapsed time and waiting for either traversal cost. Of these two paths, only the early one is foremost and only the late one is latest-departing.
Concept map
Lean source view on GitHub
| 1 | import Lax330177.CostExamples |
| 2 | |
| 3 | /-! |
| 4 | --- |
| 5 | title: Early and late direct paths |
| 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, direct departures at 0 and 3 both minimize hops, elapsed time and waiting for either traversal cost. Of these two paths, only the early one is foremost and only the late one is latest-departing. |
| 9 | |
| 10 | [Read the proof.](Lax330177Proofs.CostExamples.direct_choices.html) |
| 11 | -/ |
| 12 | namespace Lax330177.DirectChoices |
| 13 | open Lax330177.Representations Lax330177.Durations Lax330177.OptimalPaths |
| 14 | open Lax330177.CostExamples |
| 15 | |
| 16 | axiom direct_choices (c : Fin 2) : |
| 17 | Shortest (direct false c) ∧ Fastest (direct false c) ∧ MinimumWaiting (direct false c) ∧ |
| 18 | Foremost (direct false c) ∧ ¬ LatestDeparture (direct false c) ∧ |
| 19 | Shortest (direct true c) ∧ Fastest (direct true c) ∧ MinimumWaiting (direct true c) ∧ |
| 20 | LatestDeparture (direct true c) ∧ ¬ Foremost (direct true c) |
| 21 | end Lax330177.DirectChoices |
| 22 |
Discussion
Ask a question or add context. Endorsements and structured flags are kept in the review panel above.
0 comments