CommunicationComplexity.Deterministic.Protocol.leafRectangles_card
theoremverifiedimported Lean
Leaf rectangle count is at most two to the complexity. Let $p$ be a deterministic two-party communication protocol over input types $X$ and $Y$ producing values in $\alpha$, and let $c$ be its communication complexity. Then the number of leaf rectangles of $p$ is at most $2^{c}$.
Statement
set_option relaxedAutoImplicit false in set_option autoImplicit false in variable {X Y α : Type*} in lemma CommunicationComplexity.Deterministic.Protocol.leafRectangles_card (p : Protocol X Y α) : Set.ncard (leafRectangles p) ≤ 2 ^ p.complexity
- Source
- TCSlib, `CommunicationComplexity.Deterministic.Protocol.leafRectangles_card`
- 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.Protocol.leafRectangles_card← CommunicationComplexity.Deterministic.Protocol.leafRectangles_card (TCSlib/CommunicationComplexity/DeterministicCC/DetRectangle.lean:432): verbatim
- Verified
- 07 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 4
- CommunicationComplexity.Deterministic.Protocol.complexityThe communication complexity of a protocol $p$ is the worst-case total number of bits exchanged: an output node costs $0$, while an alice…
- CommunicationComplexity.Deterministic.Protocol.aux_cardLeaf rectangle count bounded by two to the complexity. Let $p$ be a deterministic two-party communication protocol with input types $X$…
- CommunicationComplexity.Deterministic.Protocol.leafRectanglesThe leaf rectangles of a protocol $p : \texttt{Protocol}\,X\,Y\,\alpha$ form the collection…
- CommunicationComplexity.Deterministic.ProtocolA deterministic two-party communication protocol over input types $X$ (Alice) and $Y$ (Bob) producing a value of type $\alpha$ is an…
- Used by 3
- CommunicationComplexity.Deterministic.Protocol.one_sub_two_distributionalError_le_two_pow_mulDiscrepancy lower bound on distributional error. Let $\mu$ be a finite probability measure on $X \times Y$, let…
- CommunicationComplexity.Deterministic.foolingSet_ncard_le_pow_of_communicationComplexity_leFooling set bound from communication complexity. Let $g : X \times Y \to \alpha$ be a two-argument function, and let…
- CommunicationComplexity.Deterministic.mono_partition_of_communicationComplexity_leLow deterministic complexity yields a small monochromatic partition. Let $g : X \times Y \to \alpha$ be a two-argument function, and let…
Lean source view module on GitHub
set_option relaxedAutoImplicit false in set_option autoImplicit false in variable {X Y α : Type*} in /-- A protocol of communication complexity `c` has at most `2 ^ c` leaf rectangles [RY20, Lemma 1.2] (a protocol tree of depth `c` has at most `2 ^ c` leaves). -/ lemma CommunicationComplexity.Deterministic.Protocol.leafRectangles_card (p : Protocol X Y α) : Set.ncard (leafRectangles p) ≤ 2 ^ p.complexity := aux_card p Set.univ Set.univ