A simple graph can separate the traversal modes
Lax330177.SimpleSeparation · concepts/Lax330177/SimpleSeparation.lean · lax-330177
No public endorsements yet.
Loading review…
Sign in with ORCIDNatural Language Statement
Lemma
The directed chain with both arcs available only at time 0 is simple and fails properness. Its first vertex reaches its last nonstrictly but cannot reach it strictly.
Concept map
Lean source view on GitHub
| 1 | import Lax330177.Examples |
| 2 | |
| 3 | /-! |
| 4 | --- |
| 5 | title: A simple graph can separate the traversal modes |
| 6 | type: lemma |
| 7 | --- |
| 8 | The directed chain with both arcs available only at time 0 is simple and fails properness. Its first vertex reaches its last nonstrictly but cannot reach it strictly. |
| 9 | |
| 10 | [Read the proof.](Lax330177Proofs.Basic.simple_separation.html) |
| 11 | -/ |
| 12 | namespace Lax330177.SimpleSeparation |
| 13 | open Lax330177.Representations |
| 14 | open Lax330177.Settings |
| 15 | open Lax330177.Paths |
| 16 | open Lax330177.Examples |
| 17 | |
| 18 | axiom simple_separation : IsSimple simultaneousChain ∧ ¬ IsProper .directed simultaneousChain ∧ Reaches simultaneousChain .nonstrict 0 2 ∧ ¬ Reaches simultaneousChain .strict 0 2 |
| 19 | end Lax330177.SimpleSeparation |
| 20 |
Discussion
Ask a question or add context. Endorsements and structured flags are kept in the review panel above.
0 comments