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

The pebble game characterization of Weisfeiler–Leman

Lax119563.GameCharacterization · concepts/Lax119563/GameCharacterization.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

    Cai, Fürer and Immerman, Immerman and Lander, and Hella: let k≥2k \geq 2, let G,HG, H be colored graphs, and let r≥0r \geq 0.

    1. If Spoiler wins BPk+1(G,H)\mathrm{BP}_{k+1}(G, H) within rr rounds, then kk-WL distinguishes GG and HH after at most rr rounds.
    2. If kk-WL distinguishes GG and HH after rr rounds, then Spoiler wins BPk+1(G,H)\mathrm{BP}_{k+1}(G, H) within r+kr + k rounds.

    In particular, Duplicator wins BPk+1(G,H)\mathrm{BP}_{k+1}(G, H) if and only if kk-WL does not distinguish GG and HH.

    Concept map
    4 concepts
    100%
    Proven claimDefinitionThis conceptRelated conceptA → B: B builds on A
    Evidence

    This concept declares 3 statements. Each proof establishes one of them relative to its assumptions.

    1 distinguishesAfter_of_spoilerWinsWithin proven

    3 spoilerWinsWithin_of_distinguishesAfter proven

    Lean source view on GitHub

    1import Lax119563.WeisfeilerLeman
    2import Lax119563.PebbleGame
    3
    4/-!
    5---
    6title: The pebble game characterization of Weisfeiler–Leman
    7type: theorem
    8---
    9Cai, Fürer and Immerman, Immerman and Lander, and Hella: let k≥2k \geq 2, let G,HG, H be
    10colored graphs, and let r≥0r \geq 0.
    11
    121. If Spoiler wins BPk+1(G,H)\mathrm{BP}_{k+1}(G, H) within rr rounds, then kk-WL distinguishes
    13 GG and HH after at most rr rounds.
    142. If kk-WL distinguishes GG and HH after rr rounds, then Spoiler wins
    15 BPk+1(G,H)\mathrm{BP}_{k+1}(G, H) within r+kr + k rounds.
    16
    17In particular, Duplicator wins BPk+1(G,H)\mathrm{BP}_{k+1}(G, H) if and only if kk-WL does not
    18distinguish GG and HH.
    19-/
    20
    21open Lax119563.ColoredGraphs Lax119563.WeisfeilerLeman Lax119563.PebbleGame
    22
    23namespace Lax119563.GameCharacterization
    24
    25/-- A win of Spoiler within `r` rounds of `BP_{k+1}(G, H)` yields a distinction by `k`-WL
    26after at most `r` rounds. -/
    27axiom distinguishesAfter_of_spoilerWinsWithin {k : ℕ} (hk : 2 ≤ k) {G H : ColoredGraph}
    28 {r : ℕ} (h : SpoilerWinsWithin (k + 1) r G H) :
    29 ∃ r' ≤ r, DistinguishesAfter k r' G H
    30
    31/-- A distinction by `k`-WL after `r` rounds yields a win of Spoiler within `r + k` rounds
    32of `BP_{k+1}(G, H)`. -/
    33axiom spoilerWinsWithin_of_distinguishesAfter {k : ℕ} (hk : 2 ≤ k) {G H : ColoredGraph}
    34 {r : ℕ} (h : DistinguishesAfter k r G H) :
    35 SpoilerWinsWithin (k + 1) (r + k) G H
    36
    37/-- Duplicator wins `BP_{k+1}(G, H)` if and only if `k`-WL does not distinguish `G` and `H`. -/
    38axiom duplicatorWins_iff {k : ℕ} (hk : 2 ≤ k) (G H : ColoredGraph) :
    39 DuplicatorWins (k + 1) G H ↔ ¬ Distinguishes k G H
    40
    41end Lax119563.GameCharacterization
    42
    Show ProofShow ProofShow 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…