CommunicationComplexity.Deterministic.Rank.boolFunctionMatrix
defimported Lean
Given 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 $f\,x\,y = \mathrm{true}$ and $(M_f)_{x,y} = 0$ otherwise.
Statement
set_option relaxedAutoImplicit false in set_option autoImplicit false in open Classical in noncomputable def CommunicationComplexity.Deterministic.Rank.boolFunctionMatrix {X Y : Type*} (f : X → Y → Bool) : Matrix X Y ℝ
- Defined in
- TCSlib, `CommunicationComplexity.Deterministic.Rank.boolFunctionMatrix`
- 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.boolFunctionMatrix← CommunicationComplexity.Deterministic.Rank.boolFunctionMatrix (TCSlib/CommunicationComplexity/DeterministicCC/Rank.lean:67): verbatim
- Verified
- 07 Oct 2026
- Axioms
- none listed
- Used by 2
- CommunicationComplexity.Deterministic.Rank.boolFunctionRankThe 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.\…
- 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 open Classical in /-- The real-valued communication matrix of a Boolean function `f : X → Y → Bool`, whose `(x, y)` entry is `1` if `f x y = true` and `0` otherwise [RY20, Ch. 2] / [Rou16, §4.2.3 Definition (matrix representation)]. -/ noncomputable def CommunicationComplexity.Deterministic.Rank.boolFunctionMatrix {X Y : Type*} (f : X → Y → Bool) : Matrix X Y ℝ := Matrix.of fun x y => if f x y then 1 else 0