Path supports determine reachability
Lax330177.SupportReach · concepts/Lax330177/SupportReach.lean · lax-330177
No public endorsements yet.
Loading review…
Sign in with ORCIDNatural Language Statement
Lemma
If two graphs on the same vertices realize exactly the same ordered vertex sequences as temporal paths in their respective modes, then they have the same reachability relation.
Concept map
Lean source view on GitHub
| 1 | import Lax330177.Paths |
| 2 | |
| 3 | /-! |
| 4 | --- |
| 5 | title: Path supports determine reachability |
| 6 | type: lemma |
| 7 | --- |
| 8 | If two graphs on the same vertices realize exactly the same ordered vertex sequences as temporal paths in their respective modes, then they have the same reachability relation. |
| 9 | |
| 10 | [Read the proof.](Lax330177Proofs.Basic.support_reach.html) |
| 11 | -/ |
| 12 | namespace Lax330177.SupportReach |
| 13 | open Lax330177.Representations |
| 14 | open Lax330177.Settings |
| 15 | open Lax330177.Paths |
| 16 | |
| 17 | axiom support_reach {n} (G H : Graph n) (m l : TraversalMode) (h : SupportEquivalent G H m l) (u v) : Reaches G m u v ↔ Reaches H l u v |
| 18 | end Lax330177.SupportReach |
| 19 |
Discussion
Ask a question or add context. Endorsements and structured flags are kept in the review panel above.
0 comments