Properness does not imply simplicity
Lax330177.ProperSeparation · concepts/Lax330177/ProperSeparation.lean · lax-330177
No public endorsements yet.
Loading review…
Sign in with ORCIDNatural Language Statement
Lemma
One undirected edge appearing twice gives a proper graph that fails simplicity. The two opposite directed arcs are proper as well, since every two-step traversal returns to its starting vertex.
Concept map
Lean source view on GitHub
| 1 | import Lax330177.Examples |
| 2 | |
| 3 | /-! |
| 4 | --- |
| 5 | title: Properness does not imply simplicity |
| 6 | type: lemma |
| 7 | --- |
| 8 | One undirected edge appearing twice gives a proper graph that fails simplicity. The two opposite directed arcs are proper as well, since every two-step traversal returns to its starting vertex. |
| 9 | |
| 10 | [Read the proof.](Lax330177Proofs.Basic.proper_separation.html) |
| 11 | -/ |
| 12 | namespace Lax330177.ProperSeparation |
| 13 | open Lax330177.Representations |
| 14 | open Lax330177.Settings |
| 15 | open Lax330177.Paths |
| 16 | open Lax330177.Examples |
| 17 | |
| 18 | axiom proper_separation : IsProper .undirected repeatedEdge ∧ ¬ IsSimple repeatedEdge ∧ IsProper .directed repeatedEdge |
| 19 | end Lax330177.ProperSeparation |
| 20 |
Discussion
Ask a question or add context. Endorsements and structured flags are kept in the review panel above.
0 comments