Proper graphs have the same reachability graph in both modes
Lax330177.ProperReachGraphs · concepts/Lax330177/ProperReachGraphs.lean · lax-330177
No public endorsements yet.
Loading review…
Sign in with ORCIDNatural Language Statement
Lemma
On a proper temporal graph, strict and nonstrict traversal yield the same static reachability graph on the original vertices.
Concept map
Evidence
Each proof establishes this claim relative to its assumptions.
Lean source view on GitHub
| 1 | import Lax330177.ReachabilityGraph |
| 2 | |
| 3 | /-! |
| 4 | --- |
| 5 | title: Proper graphs have the same reachability graph in both modes |
| 6 | type: lemma |
| 7 | --- |
| 8 | On a proper temporal graph, strict and nonstrict traversal yield the same static |
| 9 | reachability graph on the original vertices. |
| 10 | |
| 11 | [Read the proof.](Lax330177Proofs.Observations.proper_graphs.html) |
| 12 | -/ |
| 13 | namespace Lax330177.ProperReachGraphs |
| 14 | open Lax330177.Representations Lax330177.Settings Lax330177.ReachabilityGraph |
| 15 | |
| 16 | axiom proper_graphs {n : ℕ} (G : Graph n) (d : Direction) (h : IsProper d G) : |
| 17 | reachabilityGraph G .strict = reachabilityGraph G .nonstrict |
| 18 | |
| 19 | end Lax330177.ProperReachGraphs |
| 20 |
Discussion
Ask a question or add context. Endorsements and structured flags are kept in the review panel above.
0 comments