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

An upper bound on the size of homomorphism witnesses

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

    Corollary

    Corollary. Let k≥2k \geq 2, and let G,HG, H be colored graphs with at most nn vertices each that are distinguished by kk-WL. Then some colored graph FF with tw⁡(F)≤k\operatorname{tw}(F) \leq k and hom⁡(F,G)≠hom⁡(F,H)\hom(F, G) \neq \hom(F, H) satisfies ∣V(F)∣≤2Ok(nk−1log⁡n)|V(F)| \leq 2^{O_k(n^{k-1} \log n)}.

    Together with the witness size lower bound, this shows that the lower 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 Mathlib.Data.Nat.Log
    2import Lax119563.ColoredHomomorphisms
    3import Lax119563.WeisfeilerLeman
    4
    5/-!
    6---
    7title: An upper bound on the size of homomorphism witnesses
    8type: corollary
    9---
    10**Corollary.** Let k≥2k \geq 2, and let G,HG, H be colored graphs with at most nn vertices
    11each that are distinguished by kk-WL. Then some colored graph FF with
    12tw⁡(F)≤k\operatorname{tw}(F) \leq k and hom⁡(F,G)≠hom⁡(F,H)\hom(F, G) \neq \hom(F, H) satisfies
    13∣V(F)∣≤2Ok(nk−1log⁡n)|V(F)| \leq 2^{O_k(n^{k-1} \log n)}.
    14
    15Together with the witness size lower bound, this shows that the lower bound is tight up to a
    16logarithmic factor in the exponent.
    17
    18# Implementation notes
    19
    20The constant hidden in OkO_k is made explicit: there is a CC, depending on kk only, such
    21that for all n≥2n \geq 2 a witness with at most 2Cnk−1⌊log⁡2n⌋2^{C n^{k-1} \lfloor \log_2 n \rfloor}
    22vertices exists.
    23-/
    24
    25open Lax119563.ColoredGraphs Lax119563.WeisfeilerLeman Lax119563.ColoredHomomorphisms
    26
    27namespace Lax119563.WitnessUpperBound
    28
    29/-- **Witness size upper bound.** If `k`-WL distinguishes colored graphs `G` and `H` with at
    30most `n` vertices each, then so do the homomorphism counts of a colored graph of treewidth at
    31most `k` with at most `2 ^ (C n ^ (k - 1) log₂ n)` vertices. -/
    32axiom witness_upper_bound (k : ℕ) (hk : 2 ≤ k) :
    33 ∃ C : ℕ, ∀ n : ℕ, 2 ≤ n → ∀ G H : ColoredGraph, G.n ≤ n → H.n ≤ n →
    34 Distinguishes k G H →
    35 ∃ F : ColoredGraph, TreewidthAtMost F k ∧ hom F G ≠ hom F H ∧
    36 F.n ≤ 2 ^ (C * n ^ (k - 1) * Nat.log 2 n)
    37
    38end Lax119563.WitnessUpperBound
    39
    Show Proof

    Implementation notes

    The constant hidden in OkO_k is made explicit: there is a CC, depending on kk only, such that for all n≥2n \geq 2 a witness with at most 2Cnk−1⌊log⁡2n⌋2^{C n^{k-1} \lfloor \log_2 n \rfloor} vertices exists.

    Discussion

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

    Loading discussion…