Replacing undirected edges by opposite arcs
Lax330177.BidirectPaths · concepts/Lax330177/BidirectPaths.lean · lax-330177
No public endorsements yet.
Loading review…
Sign in with ORCIDNatural Language Statement
Lemma
Replacing each undirected edge occurrence by both directed orientations preserves exactly the same timed paths of every length in the chosen traversal mode.
Concept map
Lean source view on GitHub
| 1 | import Lax330177.Paths |
| 2 | |
| 3 | /-! |
| 4 | --- |
| 5 | title: Replacing undirected edges by opposite arcs |
| 6 | type: lemma |
| 7 | --- |
| 8 | Replacing each undirected edge occurrence by both directed orientations preserves exactly the same timed paths of every length in the chosen traversal mode. |
| 9 | |
| 10 | [Read the proof.](Lax330177Proofs.Basic.bidirect_paths.html) |
| 11 | -/ |
| 12 | namespace Lax330177.BidirectPaths |
| 13 | open Lax330177.Representations |
| 14 | open Lax330177.Settings |
| 15 | open Lax330177.Paths |
| 16 | |
| 17 | axiom bidirect_paths {n s} (G : InterpretedGraph n s) (_ : s.direction = .undirected) (k : ℕ) : TemporalPath (bidirect G).graph s.mode k = TemporalPath G.graph s.mode k |
| 18 | end Lax330177.BidirectPaths |
| 19 |
Discussion
Ask a question or add context. Endorsements and structured flags are kept in the review panel above.
0 comments