CommunicationComplexity.Deterministic.Protocol.aux_card
theoremverifiedimported Lean
Leaf rectangle count bounded by two to the complexity. Let $p$ be a deterministic two-party communication protocol with input types $X$ (Alice) and $Y$ (Bob), and let $A \subseteq X$ and $B \subseteq Y$. Then the number of distinct rectangles among the auxiliary leaf rectangles of $p$ relative to the constraint $A \times B$ is at most $2^{c}$, where $c$ is the communication complexity of $p$.
Statement
set_option relaxedAutoImplicit false in set_option autoImplicit false in variable {X Y α : Type*} in lemma CommunicationComplexity.Deterministic.Protocol.aux_card (p : Protocol X Y α) (A : Set X) (B : Set Y) : Set.ncard (leafRectanglesAux p A B) ≤ 2 ^ p.complexity
- Source
- TCSlib, `CommunicationComplexity.Deterministic.Protocol.aux_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.aux_card← CommunicationComplexity.Deterministic.Protocol.aux_card (TCSlib/CommunicationComplexity/DeterministicCC/DetRectangle.lean:403): verbatim
- Verified
- 07 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 4
- CommunicationComplexity.Deterministic.Protocol.leafRectanglesAuxFor a protocol $p$ and sets $A \subseteq X$, $B \subseteq Y$, $\texttt{leafRectanglesAux}(p, A, B)$ is the collection of rectangles…
- 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_card_stepUnion bound for two power-of-two cardinalities. Let $S_0, S_1$ be sets in a type $\beta$ and let $c_0, c_1 \in \mathbb{N}$. If…
- 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 2
- CommunicationComplexity.Deterministic.Protocol.comap_complexityPull-back preserves communication complexity. Let $p$ be a deterministic two-party communication protocol with Alice's inputs drawn from…
- CommunicationComplexity.Deterministic.Protocol.leafRectangles_cardLeaf rectangle count is at most two to the complexity. Let $p$ be a deterministic two-party communication protocol over input types $X$…
Lean source view module on GitHub
Choose a tactic — a marked line — to see the goals Lean had before and after it, as in Lean’s infoview. Step with ← → or j k.
set_option relaxedAutoImplicit false inset_option autoImplicit false invariable {X Y α : Type*} in/-- A protocol of complexity `c` has at most `2 ^ c` leaf rectangles relative to any constraint `A ×ˢ B`. **Proof sketch.** Induction on `p`. A terminal protocol has one leaf rectangle and complexity `0`. Step 1: at an Alice node the leaf rectangles are the union of the two children's, each bounded by the induction hypothesis, and `aux_card_step` gives `2 ^ c₀ + 2 ^ c₁ ≤ 2 ^ (1 + max c₀ c₁)`, the bound for the node. Step 2: a Bob node is identical. -/lemma CommunicationComplexity.Deterministic.Protocol.aux_card (p : Protocol X Y α) (A : Set X) (B : Set Y) : Set.ncard (leafRectanglesAux p A B) ≤ 2 ^ p.complexity := by induction p generalizing A B with | output _ => simp [leafRectanglesAux, complexity] | alice f P ih => -- Step 1: the two children contribute at most `2^c₀ + 2^c₁ ≤ 2^(1 + max c₀ c₁)`. simp only [leafRectanglesAux, complexity] exact aux_card_step (ih false _ _) (ih true _ _) | bob f P ih => -- Step 2: mirror of Step 1 for Bob's split. simp only [leafRectanglesAux, complexity] exact aux_card_step (ih false _ _) (ih true _ _)