Exactly one of four relations for graph parameters
Lax825442.RelationClassification · concepts/Lax825442/RelationClassification.lean · lax-825442
No public endorsements yet.
Loading review…
Sign in with ORCIDNatural Language Statement
Theorem
For every pair of graph parameters, exactly one of four relations holds: the first strictly bounds the second, the second strictly bounds the first, the parameters are functionally equivalent, or they are incomparable.
Concept map
Evidence
Each proof establishes this claim relative to its assumptions.
Lean source view on GitHub
| 1 | import Lax825442.StrictlyBounds |
| 2 | import Lax825442.Equivalent |
| 3 | import Lax825442.Incomparable |
| 4 | |
| 5 | /-! |
| 6 | --- |
| 7 | title: Exactly one of four relations for graph parameters |
| 8 | type: theorem |
| 9 | --- |
| 10 | For every pair of graph parameters, exactly one of four relations holds: |
| 11 | the first strictly bounds the second, the second strictly bounds the first, |
| 12 | the parameters are functionally equivalent, or they are incomparable. |
| 13 | -/ |
| 14 | |
| 15 | namespace Lax825442.RelationClassification |
| 16 | open Lax153141.GraphParameters |
| 17 | open Lax825442.StrictlyBounds Lax825442.Equivalent Lax825442.Incomparable |
| 18 | |
| 19 | /-- Exactly one of the four cases holds: exhaustiveness and pairwise exclusiveness. -/ |
| 20 | axiom relationClassification (p q : GraphParam) : |
| 21 | (StrictlyBounds p q ∨ StrictlyBounds q p ∨ Equivalent p q ∨ Incomparable p q) ∧ |
| 22 | ¬ (StrictlyBounds p q ∧ StrictlyBounds q p) ∧ |
| 23 | ¬ (StrictlyBounds p q ∧ Equivalent p q) ∧ |
| 24 | ¬ (StrictlyBounds p q ∧ Incomparable p q) ∧ |
| 25 | ¬ (StrictlyBounds q p ∧ Equivalent p q) ∧ |
| 26 | ¬ (StrictlyBounds q p ∧ Incomparable p q) ∧ |
| 27 | ¬ (Equivalent p q ∧ Incomparable p q) |
| 28 | |
| 29 | end Lax825442.RelationClassification |
| 30 | |
| 31 |
Used by
none
From Mathlib
none
Discussion
Ask a question or add context. Endorsements and structured flags are kept in the review panel above.
0 comments