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

A lower bound on the size of homomorphism witnesses

Lax119563.WitnessLowerBound · concepts/Lax119563/WitnessLowerBound.lean · lax-119563

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

    Theorem. Let k≥3k \geq 3 be fixed. For every n0∈Nn_0 \in \mathbb N there are some n≥n0n \geq n_0 and nn-vertex colored graphs G0,G1G_0, G_1, distinguished by kk-WL, such that every colored graph FF with tw⁡(F)≤k\operatorname{tw}(F) \leq k and hom⁡(F,G0)≠hom⁡(F,G1)\hom(F, G_0) \neq \hom(F, G_1) satisfies ∣V(F)∣≥2Ωk(nk−1)|V(F)| \geq 2^{\Omega_k(n^{k-1})}.

    By the homomorphism characterization of kk-WL, such graphs FF exist. The bound is tight up to a logarithmic factor in the exponent.

    Concept map
    5 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 Lax119563.ColoredHomomorphisms
    2import Lax119563.WeisfeilerLeman
    3
    4/-!
    5---
    6title: A lower bound on the size of homomorphism witnesses
    7type: theorem
    8---
    9**Theorem.** Let k≥3k \geq 3 be fixed. For every n0∈Nn_0 \in \mathbb N there are some
    10n≥n0n \geq n_0 and nn-vertex colored graphs G0,G1G_0, G_1, distinguished by kk-WL, such that
    11every colored graph FF with tw⁡(F)≤k\operatorname{tw}(F) \leq k and
    12hom⁡(F,G0)≠hom⁡(F,G1)\hom(F, G_0) \neq \hom(F, G_1) satisfies ∣V(F)∣≥2Ωk(nk−1)|V(F)| \geq 2^{\Omega_k(n^{k-1})}.
    13
    14By the homomorphism characterization of kk-WL, such graphs FF exist. The bound is tight up
    15to a logarithmic factor in the exponent.
    16
    17# Implementation notes
    18
    19The constant hidden in Ωk\Omega_k is made explicit: there is a C>0C > 0, depending on kk
    20only, such that every such FF has at least 2⌊nk−1/C⌋2^{\lfloor n^{k-1} / C \rfloor} vertices.
    21-/
    22
    23open Lax119563.ColoredGraphs Lax119563.WeisfeilerLeman Lax119563.ColoredHomomorphisms
    24
    25namespace Lax119563.WitnessLowerBound
    26
    27/-- **Witness size lower bound.** For `k ≥ 3` there are arbitrarily large pairs of `n`-vertex
    28colored graphs which `k`-WL distinguishes, but which are distinguished by the homomorphism
    29counts of a colored graph of treewidth at most `k` only if it has at least
    30`2 ^ (n ^ (k - 1) / C)` vertices. -/
    31axiom witness_lower_bound (k : ℕ) (hk : 3 ≤ k) :
    32 ∃ C : ℕ, 0 < C ∧ ∀ n₀ : ℕ, ∃ n ≥ n₀, ∃ G₀ G₁ : ColoredGraph,
    33 G₀.n = n ∧ G₁.n = n ∧ Distinguishes k G₀ G₁ ∧
    34 ∀ F : ColoredGraph, TreewidthAtMost F k → hom F G₀ ≠ hom F G₁ →
    35 2 ^ (n ^ (k - 1) / C) ≤ F.n
    36
    37end Lax119563.WitnessLowerBound
    38
    Show Proof

    Implementation notes

    The constant hidden in Ωk\Omega_k is made explicit: there is a C>0C > 0, depending on kk only, such that every such FF has at least 2⌊nk−1/C⌋2^{\lfloor n^{k-1} / C \rfloor} vertices.

    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…