AFTD Auto-Formalizing Theoretical Domains

CommunicationComplexity.Deterministic.Rank.rectMatrix

defimported Lean

For a subset $R \subseteq X \times Y$, the matrix $M_R \in \mathbb{R}^{X \times Y}$ is defined by $(M_R)_{x,y} = 1$ if $(x,y) \in R$ and $(M_R)_{x,y} = 0$ otherwise.

Statement

set_option relaxedAutoImplicit false in
set_option autoImplicit false in
open Classical in
noncomputable def CommunicationComplexity.Deterministic.Rank.rectMatrix {X Y : Type*}
    (R : Set (X × Y)) : Matrix X Y ℝ
Defined in
TCSlib, `CommunicationComplexity.Deterministic.Rank.rectMatrix`
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
none listed
Used by 2

Lean source view module on GitHub

set_option relaxedAutoImplicit false in
set_option autoImplicit false in
open Classical in
/-- The `0/1` indicator matrix of a subset `R ⊆ X × Y`: the `(x, y)` entry is `1` if `(x, y) ∈ R` and `0` otherwise. -/
noncomputable def CommunicationComplexity.Deterministic.Rank.rectMatrix {X Y : Type*}
    (R : Set (X × Y)) : Matrix X Y ℝ :=
  Matrix.of fun x y => if (x, y) ∈ R then 1 else 0
See it in the graphDiscuss this resultChallenge it