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

Homomorphism witnesses from rounds

Lax119563.WitnessFromRounds · concepts/Lax119563/WitnessFromRounds.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≥2k \geq 2 and r≥0r \geq 0, and let G,HG, H be colored graphs. If kk-WL distinguishes GG and HH after rr rounds, then some colored graph FF with tw⁡(F)≤k\operatorname{tw}(F) \leq k and

    ∣V(F)∣≤k(kM)r,where M=∣V(G)∣k+∣V(H)∣k,|V(F)| \leq k (k M)^r, \qquad \text{where } M = |V(G)|^k + |V(H)|^k,

    satisfies hom⁡(F,G)≠hom⁡(F,H)\hom(F, G) \neq \hom(F, H).

    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: Homomorphism witnesses from rounds
    7type: theorem
    8---
    9**Theorem.** Let k≥2k \geq 2 and r≥0r \geq 0, and let G,HG, H be colored graphs. If kk-WL
    10distinguishes GG and HH after rr rounds, then some colored graph FF with
    11tw⁡(F)≤k\operatorname{tw}(F) \leq k and
    12∣V(F)∣≤k(kM)r,where M=∣V(G)∣k+∣V(H)∣k,|V(F)| \leq k (k M)^r, \qquad \text{where } M = |V(G)|^k + |V(H)|^k,
    13satisfies hom⁡(F,G)≠hom⁡(F,H)\hom(F, G) \neq \hom(F, H).
    14-/
    15
    16open Lax119563.ColoredGraphs Lax119563.WeisfeilerLeman Lax119563.ColoredHomomorphisms
    17
    18namespace Lax119563.WitnessFromRounds
    19
    20/-- A distinction by `k`-WL after `r` rounds is witnessed by the homomorphism counts of a
    21colored graph of treewidth at most `k` with at most `k (k M) ^ r` vertices, where
    22`M = |V(G)| ^ k + |V(H)| ^ k`. -/
    23axiom witness_from_rounds {k : ℕ} (hk : 2 ≤ k) {r : ℕ} {G H : ColoredGraph}
    24 (h : DistinguishesAfter k r G H) :
    25 ∃ F : ColoredGraph, TreewidthAtMost F k ∧
    26 F.n ≤ k * (k * (G.n ^ k + H.n ^ k)) ^ r ∧ hom F G ≠ hom F H
    27
    28end Lax119563.WitnessFromRounds
    29
    Show Proof
    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…