AFTD Auto-Formalizing Theoretical Domains

CommunicationComplexity.Deterministic.Rank.clog_boolFunctionRank_le_communicationComplexity

theoremverifiedformalizationimported Lean

Log-rank lower bound on deterministic communication complexity. Let $X$ be a finite type and $Y$ a finite type, and let $f : X \to Y \to \mathrm{Bool}$ be a Boolean function with associated $0/1$ matrix $M_f \in \bbr^{X \times Y}$, whose rank $\mathrm{rank}(f) = \mathrm{rank}_{\bbr}(M_f)$ is the rank of $f$. Then the deterministic communication complexity $D(f) \in \bbn_\infty$ of $f$ satisfies \[ \lceil \log_2 \mathrm{rank}(f) \rceil \;\le\; D(f). \]

Statement

set_option relaxedAutoImplicit false in
set_option autoImplicit false in
theorem CommunicationComplexity.Deterministic.Rank.clog_boolFunctionRank_le_communicationComplexity
    {X Y : Type*} [Finite X] [Fintype Y]
    (f : X → Y → Bool) :
    (Nat.clog 2 (boolFunctionRank f) : ENat) ≤
      Deterministic.communicationComplexity f
Formalizes
Log-rank lower bound on deterministic communication complexity, as formalized in TCSlib (`CommunicationComplexity.Deterministic.Rank.clog_boolFunctionRank_le_communicationComplexity`)
Lean proof
By Lucy Horowitz, Timothe Kasriel, Mihir Singhal, from github.com/Shilun-Allan-Li/tcslib at c8a02591b1e5 (Copyright (c) 2026 Lucy Horowitz, Timothe Kasriel, and Mihir Singhal. All rights reserved, Apache-2.0). Compiled here against leanprover/lean4:v4.33.1, Mathlib v4.33.1; written for leanprover/lean4:v4.25.0.
Verified
07 Oct 2026
Axioms
Classical.choiceQuot.soundpropext
Built on 3

Lean source view module on GitHub

set_option relaxedAutoImplicit false inset_option autoImplicit false in/-- The log-rank lower bound: the deterministic communication complexity of a Boolean function `f` is at least `⌈log₂ rank(M_f)⌉` [RY20, Thm 2.11] (historically [MS82]). -/theorem CommunicationComplexity.Deterministic.Rank.clog_boolFunctionRank_le_communicationComplexity    {X Y : Type*} [Finite X] [Fintype Y]    (f : X → Y → Bool) :    (Nat.clog 2 (boolFunctionRank f) : ENat) ≤      Deterministic.communicationComplexity f := by  match h : Deterministic.communicationComplexity f with  | ⊤ => exact le_top  | (n : ℕ) =>    exact_mod_cast (Nat.clog_le_iff_le_pow (by norm_num)).mpr      (boolFunctionRank_le_pow_of_communicationComplexity_le f n (le_of_eq h))
See it in the graphDiscuss this resultChallenge it