CommunicationComplexity.Deterministic.Rank.boolFunctionRank
defimported Lean
The rank of a Boolean function $f : X \to Y \to \mathrm{Bool}$ is the $\mathbb{R}$-rank of its $0/1$ matrix $M_f$, i.e.\ $\mathrm{rank}(f) = \mathrm{rank}_{\mathbb{R}}(M_f) \in \mathbb{N}$.
Statement
set_option relaxedAutoImplicit false in set_option autoImplicit false in noncomputable def CommunicationComplexity.Deterministic.Rank.boolFunctionRank {X Y : Type*} [Fintype Y] (f : X → Y → Bool) : ℕ
- Defined in
- TCSlib, `CommunicationComplexity.Deterministic.Rank.boolFunctionRank`
- 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.CommunicationComplexity.Deterministic.Rank.boolFunctionRank← CommunicationComplexity.Deterministic.Rank.boolFunctionRank (TCSlib/CommunicationComplexity/DeterministicCC/Rank.lean:73): verbatim
- Verified
- 07 Oct 2026
- Axioms
- none listed
- Built on 1
- CommunicationComplexity.Deterministic.Rank.boolFunctionMatrixGiven a Boolean function $f : X \to Y \to \mathrm{Bool}$, the matrix $M_f \in \mathbb{R}^{X \times Y}$ is defined by $(M_f)_{x,y} = 1$ if…
- Used by 3
- CommunicationComplexity.Deterministic.Rank.clog_boolFunctionRank_le_communicationComplexityLog-rank lower bound on deterministic communication complexity. Let $X$ be a finite type and $Y$ a finite type, and let…
- CommunicationComplexity.Deterministic.Rank.boolFunctionRank_le_pow_of_communicationComplexity_leRank bound from communication complexity. Let $X$ and $Y$ be finite types and let $f : X \to Y \to \mathrm{Bool}$ be a two-party Boolean…
- CommunicationComplexity.Deterministic.Rank.boolFunctionRank_le_ncardRank bounded by monochromatic partition size. Let $X$ be a finite set, $Y$ a finite set, and $f : X \to Y \to \mathrm{Bool}$ a Boolean…
Lean source view module on GitHub
set_option relaxedAutoImplicit false in set_option autoImplicit false in /-- The rank of a Boolean function `f`, defined as the rank over `ℝ` of its real-valued communication matrix [RY20, Ch. 2] / [Rou16, §4.2.3 Definition (matrix representation)]. -/ noncomputable def CommunicationComplexity.Deterministic.Rank.boolFunctionRank {X Y : Type*} [Fintype Y] (f : X → Y → Bool) : ℕ := (boolFunctionMatrix f).rank