Exactly one of four relations for graph parameters

Lax825442.RelationClassification · concepts/Lax825442/RelationClassification.lean · lax-825442

proven

Loading review…

Sign in with ORCID

Community review

Flags

Each flag is tied to a public ORCID identity and explains why this concept may be incorrect.

No flags have been submitted.

    Community review

    Flag this concept

    State precisely what appears incorrect. This explanation will be public under your ORCID name.

    No source line selected.

    Natural 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
    7 concepts
    100%
    Proven claimDefinitionThis conceptRelated conceptA → B: B builds on A
    Evidence

    Each proof establishes this claim relative to its assumptions.

    Lean source view on GitHub

    1import Lax825442.StrictlyBounds
    2import Lax825442.Equivalent
    3import Lax825442.Incomparable
    4
    5/-!
    6---
    7title: Exactly one of four relations for graph parameters
    8type: theorem
    9---
    10For every pair of graph parameters, exactly one of four relations holds:
    11the first strictly bounds the second, the second strictly bounds the first,
    12the parameters are functionally equivalent, or they are incomparable.
    13-/
    14
    15namespace Lax825442.RelationClassification
    16open Lax153141.GraphParameters
    17open Lax825442.StrictlyBounds Lax825442.Equivalent Lax825442.Incomparable
    18
    19/-- Exactly one of the four cases holds: exhaustiveness and pairwise exclusiveness. -/
    20axiom 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
    29end Lax825442.RelationClassification
    30
    31
    Show Proof

    Discussion

    Ask a question or add context. Endorsements and structured flags are kept in the review panel above.

    Loading discussion…