Allowing all vertices
Lax330177.UnrestrictedVertices · concepts/Lax330177/UnrestrictedVertices.lean · lax-330177
No public endorsements yet.
Loading review…
Sign in with ORCIDNatural Language Statement
Lemma
Restricting the path to the full vertex set recovers ordinary temporal reachability.
Concept map
Lean source view on GitHub
| 1 | import Lax330177.Paths |
| 2 | |
| 3 | /-! |
| 4 | --- |
| 5 | title: Allowing all vertices |
| 6 | type: lemma |
| 7 | --- |
| 8 | Restricting the path to the full vertex set recovers ordinary temporal reachability. |
| 9 | |
| 10 | [Read the proof.](Lax330177Proofs.Observations.allow_all.html) |
| 11 | -/ |
| 12 | namespace Lax330177.UnrestrictedVertices |
| 13 | open Lax330177.Representations |
| 14 | open Lax330177.Settings Lax330177.Paths |
| 15 | variable {n k : ℕ} {G : Graph n} {mode : TraversalMode} |
| 16 | |
| 17 | axiom allow_all (G : Graph n) (mode : TraversalMode) (u v : Fin n) : ReachesIn G mode Finset.univ u v ↔ Reaches G mode u v |
| 18 | end Lax330177.UnrestrictedVertices |
| 19 |
Discussion
Ask a question or add context. Endorsements and structured flags are kept in the review panel above.
0 comments