Elapsed time splits into travel and waiting
Lax330177.ElapsedEq · concepts/Lax330177/ElapsedEq.lean · lax-330177
No public endorsements yet.
Loading review…
Sign in with ORCIDNatural Language Statement
Theorem
If every available traversal takes c time units, every feasible path has elapsed time equal to its total internal waiting time plus c times its number of hops.
Concept map
In the paper
- page 3 of this submission's paper
Lean source view on GitHub
| 1 | import Lax330177.UniformCosts |
| 2 | |
| 3 | /-! |
| 4 | --- |
| 5 | title: Elapsed time splits into travel and waiting |
| 6 | type: theorem |
| 7 | --- |
| 8 | If every available traversal takes c time units, every feasible path has elapsed time equal to its total internal waiting time plus c times its number of hops. |
| 9 | |
| 10 | [Read the proof.](Lax330177Proofs.UniformCosts.elapsed_eq.html) |
| 11 | -/ |
| 12 | namespace Lax330177.ElapsedEq |
| 13 | open Lax330177.Representations Lax330177.OptimalPaths |
| 14 | open Lax330177.UniformCosts |
| 15 | variable {n : ℕ} {G : Graph n} {q : Query G} |
| 16 | |
| 17 | axiom elapsed_eq (p : Candidate q) (c : ℕ) (h : Uniform q c) : |
| 18 | p.elapsed = p.waiting + p.hops * c |
| 19 | end Lax330177.ElapsedEq |
| 20 |
Discussion
Ask a question or add context. Endorsements and structured flags are kept in the review panel above.
0 comments