Zero traversal time
Lax330177.ZeroOptima · concepts/Lax330177/ZeroOptima.lean · lax-330177
No public endorsements yet.
Loading review…
Sign in with ORCIDNatural Language Statement
Lemma
With uniform traversal time zero, a feasible path is fastest exactly when it minimizes total internal waiting time.
Concept map
Evidence
Each proof establishes this claim relative to its assumptions.
In the paper
- page 3 of this submission's paper
Lean source view on GitHub
| 1 | import Lax330177.UniformCosts |
| 2 | |
| 3 | /-! |
| 4 | --- |
| 5 | title: Zero traversal time |
| 6 | type: lemma |
| 7 | --- |
| 8 | With uniform traversal time zero, a feasible path is fastest exactly when it minimizes total internal waiting time. |
| 9 | |
| 10 | [Read the proof.](Lax330177Proofs.UniformCosts.zero_optima.html) |
| 11 | -/ |
| 12 | namespace Lax330177.ZeroOptima |
| 13 | open Lax330177.Representations Lax330177.OptimalPaths |
| 14 | open Lax330177.UniformCosts |
| 15 | variable {n : ℕ} {G : Graph n} {q : Query G} |
| 16 | |
| 17 | axiom zero_optima (p : Candidate q) (h : Uniform q 0) : Fastest p ↔ MinimumWaiting p |
| 18 | end Lax330177.ZeroOptima |
| 19 |
Discussion
Ask a question or add context. Endorsements and structured flags are kept in the review panel above.
0 comments