Reachability on a proper graph
Lax330177.ProperModes · concepts/Lax330177/ProperModes.lean · lax-330177
No public endorsements yet.
Loading review…
Sign in with ORCIDNatural Language Statement
Theorem
On a proper directed or undirected graph, u reaches v strictly exactly when u reaches v nonstrictly.
Concept map
Evidence
Each proof establishes this claim relative to its assumptions.
In the paper
- page 2 of this submission's paper
Lean source view on GitHub
| 1 | import Lax330177.Paths |
| 2 | |
| 3 | /-! |
| 4 | --- |
| 5 | title: Reachability on a proper graph |
| 6 | type: theorem |
| 7 | --- |
| 8 | On a proper directed or undirected graph, u reaches v strictly exactly when u reaches v nonstrictly. |
| 9 | |
| 10 | [Read the proof.](Lax330177Proofs.Basic.proper_modes.html) |
| 11 | -/ |
| 12 | namespace Lax330177.ProperModes |
| 13 | open Lax330177.Representations |
| 14 | open Lax330177.Settings |
| 15 | open Lax330177.Paths |
| 16 | |
| 17 | axiom proper_modes {n} (G : Graph n) (d : Direction) (h : IsProper d G) (u v) : Reaches G .strict u v ↔ Reaches G .nonstrict u v |
| 18 | end Lax330177.ProperModes |
| 19 |
Discussion
Ask a question or add context. Endorsements and structured flags are kept in the review panel above.
0 comments