The same reachable pairs
Lax330177.UniformReaches · concepts/Lax330177/UniformReaches.lean · lax-330177
No public endorsements yet.
Loading review…
Sign in with ORCIDNatural Language Statement
Lemma
For every pair of vertices, reachability with uniform traversal time zero is equivalent to nonstrict reachability, and reachability with uniform time one is equivalent to strict reachability.
Concept map
Lean source view on GitHub
| 1 | import Lax330177.Durations |
| 2 | |
| 3 | /-! |
| 4 | --- |
| 5 | title: The same reachable pairs |
| 6 | type: lemma |
| 7 | --- |
| 8 | For every pair of vertices, reachability with uniform traversal time zero is equivalent to nonstrict reachability, and reachability with uniform time one is equivalent to strict reachability. |
| 9 | |
| 10 | [Read the proof.](Lax330177Proofs.Basic.uniform_reaches.html) |
| 11 | -/ |
| 12 | namespace Lax330177.UniformReaches |
| 13 | open Lax330177.Representations |
| 14 | open Lax330177.Paths |
| 15 | open Lax330177.Durations |
| 16 | |
| 17 | axiom uniform_reaches {n} (G : Graph n) (m : TraversalMode) (u v) : DurationReaches G (fun _ _ _ => if m = .strict then 1 else 0) u v ↔ Reaches G m u v |
| 18 | end Lax330177.UniformReaches |
| 19 |
Discussion
Ask a question or add context. Endorsements and structured flags are kept in the review panel above.
0 comments