Feasible departure times
Lax330177.UniformModes · concepts/Lax330177/UniformModes.lean · lax-330177
No public endorsements yet.
Loading review…
Sign in with ORCIDNatural Language Statement
Lemma
For integer timestamps, a departure sequence is feasible with traversal time zero exactly when it is weakly increasing. With traversal time one, it is feasible exactly when it is strictly increasing.
Concept map
Lean source view on GitHub
| 1 | import Lax330177.Durations |
| 2 | |
| 3 | /-! |
| 4 | --- |
| 5 | title: Feasible departure times |
| 6 | type: lemma |
| 7 | --- |
| 8 | For integer timestamps, a departure sequence is feasible with traversal time zero exactly when it is weakly increasing. With traversal time one, it is feasible exactly when it is strictly increasing. |
| 9 | |
| 10 | [Read the proof.](Lax330177Proofs.Basic.uniform_modes.html) |
| 11 | -/ |
| 12 | namespace Lax330177.UniformModes |
| 13 | open Lax330177.Representations |
| 14 | open Lax330177.Paths |
| 15 | open Lax330177.Durations |
| 16 | |
| 17 | axiom uniform_modes {k} (t : Fin k → ℕ) (m : TraversalMode) : Feasible t (fun _ => if m = .strict then 1 else 0) ↔ ∀ i j, i < j → TimeLE m (t i) (t j) |
| 18 | end Lax330177.UniformModes |
| 19 |
Discussion
Ask a question or add context. Endorsements and structured flags are kept in the review panel above.
0 comments