AFTD Auto-Formalizing Theoretical Domains

CommunicationComplexity.Deterministic.Protocol.rectangleSign_abs

theoremverifiedimported Lean

Rectangle sign has absolute value one. Let $p$ be a deterministic Boolean two-party communication protocol on input types $X$ (Alice) and $Y$ (Bob), and let $R \subseteq X \times Y$ be any set. Define the rectangle sign of $p$ on $R$ to be $+1$ when $p$ outputs $\mathrm{false}$ at every point of $R$ and $-1$ otherwise. Then the rectangle sign has absolute value $1$.

Statement

set_option relaxedAutoImplicit false in
set_option autoImplicit false in
open MeasureTheory in
open scoped BigOperators in
variable {X Y : Type*} in
lemma CommunicationComplexity.Deterministic.Protocol.rectangleSign_abs
    (p : Protocol X Y Bool) (R : Set (X × Y)) :
    |rectangleSign p R| = 1
Source
TCSlib, `CommunicationComplexity.Deterministic.Protocol.rectangleSign_abs`
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 2
Used by 1

Lean source view module on GitHub

set_option relaxedAutoImplicit false inset_option autoImplicit false inopen MeasureTheory inopen scoped BigOperators invariable {X Y : Type*} in/-- The rectangle sign has absolute value `1`. -/lemma CommunicationComplexity.Deterministic.Protocol.rectangleSign_abs    (p : Protocol X Y Bool) (R : Set (X × Y)) :    |rectangleSign p R| = 1 := by  classical  rw [rectangleSign]  split_ifs <;> norm_num
See it in the graphDiscuss this resultChallenge it