Lax Lean Archive

While this submission is a draft, it cannot be used by other submissions.

Incomparability of graph parameters

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

definition

Loading review…

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

    Definition

    Two graph parameters are incomparable when neither admits a functional bound in terms of the other. Both directions must fail. Unbounded ratios alone do not establish incomparability.

    Concept map
    4 concepts; 2 descendants hidden
    100%
    Proven claimDefinitionThis conceptRelated conceptA → B: B builds on A

    Lean source view on GitHub

    1import Lax825442.DoesNotBound
    2
    3/-!
    4---
    5title: Incomparability of graph parameters
    6type: definition
    7---
    8Two graph parameters are incomparable when neither admits a functional bound
    9in terms of the other. Both directions must fail. Unbounded ratios alone do
    10not establish incomparability.
    11-/
    12
    13namespace Lax825442.Incomparable
    14
    15open Lax153141.GraphParameters
    16
    17/-- Neither parameter functionally bounds the other. -/
    18def Incomparable (p q : GraphParam) : Prop :=
    19 (Lax825442.DoesNotBound.DoesNotBound p q) ∧
    20 (Lax825442.DoesNotBound.DoesNotBound q p)
    21
    22end Lax825442.Incomparable
    23
    Builds on
    Used by
    From Mathlib

    none

    Discussion

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

    Loading discussion…