Lax Lean Archive

Version history

Submission versions

  1. lax-710763current version

    Almost Linear Neighborhood Complexity of Monadically Dependent Graph Classes

    Created Lean v4.33.0mathlib db584cd6d46c92f209a44c0f1c829460d327499d
    GitHub sourceOpen version
  2. lax-5viewing

    Almost Linear Neighborhood Complexity of Monadically Dependent Graph Classes

    Created Lean v4.30.0mathlib c5ea00351c28e24afc9f0f84379aa41082b1188f
    GitHub sourceShown on this page

Environment v4.30.0. The archive's epoch is v4.33.0; only submissions in v4.30.0 can cite this work.

Monadically dependent classes have almost linear neighborhood complexity

Lax5.AlmostLinearNC · concepts/Lax5/AlmostLinearNC.lean · lax-5

proven

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

    Theorem

    Every monadically dependent graph class has almost linear neighborhood complexity: for every ε > 0 there is a constant c such that every member G and every nonempty vertex subset A satisfy |{N(v) ∩ A : v ∈ V(G)}| ≤ c · |A|^(1+ε).

    This is Theorem 2 of Dreier, Mählmann, McCarty, Pilipczuk, Toruńczyk, Neighborhood Complexity and Radius-1 Merge-Width in Monadically Dependent Graph Classes (2026).

    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 Lax5.MonadicDependence
    2import Lax12.NeighborhoodComplexity
    3
    4/-!
    5---
    6title: Monadically dependent classes have almost linear neighborhood complexity
    7type: theorem
    8---
    9Every monadically dependent graph class has almost linear neighborhood
    10complexity: for every ε > 0 there is a constant *c* such that every
    11member *G* and every nonempty vertex subset *A* satisfy
    12|{N(v) ∩ A : v ∈ V(G)}| ≤ *c* · |A|^(1+ε).
    13
    14This is Theorem 2 of Dreier, Mählmann, McCarty, Pilipczuk, Toruńczyk,
    15*Neighborhood Complexity and Radius-1 Merge-Width in Monadically
    16Dependent Graph Classes* (2026).
    17
    18# Formalization notes
    19
    20The hypothesis is the transduction-based definition of monadic
    21dependence, the subject of this submission; the conclusion is the
    22predicate `HasAlmostLinearNC` of the *Sparsity Lectures* submission
    23(Lax12), where neighborhood complexity is defined and endorsed. Stating
    24the theorem over that predicate is what makes it directly comparable to
    25the nowhere dense counting statement there: the same bound, under a
    26strictly weaker hypothesis.
    27-/
    28
    29namespace Lax5.AlmostLinearNC
    30
    31open Lax12.GraphClasses Lax12.NeighborhoodComplexity Lax5.MonadicDependence
    32
    33/-- Monadically dependent graph classes have almost linear neighborhood
    34complexity. -/
    35axiom hasAlmostLinearNC_of_monadicallyDependent
    36 (C : GraphClass) (h : MonadicallyDependent C) :
    37 HasAlmostLinearNC C
    38
    39end Lax5.AlmostLinearNC
    40
    Show Proof
    Formalization notes

    The hypothesis is the transduction-based definition of monadic dependence, the subject of this submission; the conclusion is the predicate HasAlmostLinearNCHasAlmostLinearNC of the Sparsity Lectures submission (Lax12), where neighborhood complexity is defined and endorsed. Stating the theorem over that predicate is what makes it directly comparable to the nowhere dense counting statement there: the same bound, under a strictly weaker hypothesis.

    Builds on
    Used by

    none

    From Mathlib

    none

    Discussion

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

    Loading discussion…