Reachability can be asymmetric even on a happy graph
Lax330177.HappyAsymmetry · concepts/Lax330177/HappyAsymmetry.lean · lax-330177
No public endorsements yet.
Loading review…
Sign in with ORCIDNatural Language Statement
Lemma
The undirected chain with edge 1–2 at time 0 and edge 0–1 at time 1 is simple and proper. In both modes, 2 reaches 0 while 0 cannot reach 2.
Concept map
Lean source view on GitHub
| 1 | import Lax330177.Examples |
| 2 | |
| 3 | /-! |
| 4 | --- |
| 5 | title: Reachability can be asymmetric even on a happy graph |
| 6 | type: lemma |
| 7 | --- |
| 8 | The undirected chain with edge 1–2 at time 0 and edge 0–1 at time 1 is simple and proper. In both modes, 2 reaches 0 while 0 cannot reach 2. |
| 9 | |
| 10 | [Read the proof.](Lax330177Proofs.Basic.happy_asymmetry.html) |
| 11 | -/ |
| 12 | namespace Lax330177.HappyAsymmetry |
| 13 | open Lax330177.Representations |
| 14 | open Lax330177.Settings |
| 15 | open Lax330177.Paths |
| 16 | open Lax330177.Examples |
| 17 | |
| 18 | axiom happy_asymmetry (m : TraversalMode) : IsHappy .undirected backwardsChain ∧ Reaches backwardsChain m 2 0 ∧ ¬ Reaches backwardsChain m 0 2 |
| 19 | end Lax330177.HappyAsymmetry |
| 20 |
Discussion
Ask a question or add context. Endorsements and structured flags are kept in the review panel above.
0 comments