AFTD Auto-Formalizing Theoretical Domains

CommunicationComplexity.Deterministic.Protocol.rectangleSign

defimported Lean

For a deterministic Boolean protocol $p$ and a set $R \subseteq X \times Y$, the rectangle sign is $+1$ if the protocol outputs $\mathrm{false}$ on every point of $R$, and $-1$ otherwise.

Statement

set_option relaxedAutoImplicit false in
set_option autoImplicit false in
open MeasureTheory in
open scoped BigOperators in
variable {X Y : Type*} in
noncomputable def CommunicationComplexity.Deterministic.Protocol.rectangleSign
    (p : Protocol X Y Bool) (R : Set (X × Y)) : ℝ
Defined in
TCSlib, `CommunicationComplexity.Deterministic.Protocol.rectangleSign`
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
Built on 2
Used by 5

Lean source view module on GitHub

set_option relaxedAutoImplicit false in
set_option autoImplicit false in
open MeasureTheory in
open scoped BigOperators in
variable {X Y : Type*} in
/-- The sign attached to a rectangle in the leaf partition of a Boolean protocol: it is `1` when the protocol outputs `false` on that rectangle, and `-1` otherwise. -/
noncomputable def CommunicationComplexity.Deterministic.Protocol.rectangleSign
    (p : Protocol X Y Bool) (R : Set (X × Y)) : ℝ := by
  classical
  exact if ∀ xy ∈ R, p.run xy.1 xy.2 = false then 1 else -1
See it in the graphDiscuss this resultChallenge it