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