CommunicationComplexity.Deterministic.Protocol.aux_cover
theoremverifiedimported Lean
Leaf rectangles cover the input rectangle. Let $p$ be a deterministic two-party communication protocol with Alice's inputs drawn from a set $X$, Bob's inputs from a set $Y$, and outputs in a type $\alpha$, and let $A \subseteq X$ and $B \subseteq Y$. Then the rectangle $A \times B$ is contained in the union of the auxiliary leaf rectangles of $p$ relative to the constraint $A \times B$; that is, every pair $(x, y) \in A \times B$ lies in at least one rectangle of this collection.
Statement
set_option relaxedAutoImplicit false in set_option autoImplicit false in variable {X Y α : Type*} in lemma CommunicationComplexity.Deterministic.Protocol.aux_cover (p : Protocol X Y α) (A : Set X) (B : Set Y) : A ×ˢ B ⊆ ⋃₀ leafRectanglesAux p A B
- Source
- TCSlib, `CommunicationComplexity.Deterministic.Protocol.aux_cover`
- 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_cover← CommunicationComplexity.Deterministic.Protocol.aux_cover (TCSlib/CommunicationComplexity/DeterministicCC/DetRectangle.lean:248): verbatim
- Verified
- 07 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 2
- 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.ProtocolA deterministic two-party communication protocol over input types $X$ (Alice) and $Y$ (Bob) producing a value of type $\alpha$ is an…
- Used by 1
- CommunicationComplexity.Deterministic.Protocol.leafRectangles_coverLeaf rectangles cover the input space. Let $p$ be a deterministic communication protocol over input types $X$ (Alice) and $Y$ (Bob)…
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/-- The leaf rectangles of `p` relative to `A ×ˢ B` cover `A ×ˢ B`: an input `(x, y)` lies in the rectangle of the leaf it reaches, found by following its bits down the tree. -/lemma CommunicationComplexity.Deterministic.Protocol.aux_cover (p : Protocol X Y α) (A : Set X) (B : Set Y) : A ×ˢ B ⊆ ⋃₀ leafRectanglesAux p A B := by induction p generalizing A B with | output _ => intro xy hxy exact Set.mem_sUnion.mpr ⟨_, Set.mem_singleton _, hxy⟩ | alice f P ih => intro ⟨x, y⟩ ⟨hx, hy⟩ simp only [leafRectanglesAux, Set.sUnion_union] cases hf : f x with | false => exact Set.mem_union_left _ (ih false _ _ ⟨⟨hx, hf⟩, hy⟩) | true => exact Set.mem_union_right _ (ih true _ _ ⟨⟨hx, hf⟩, hy⟩) | bob f P ih => intro ⟨x, y⟩ ⟨hx, hy⟩ simp only [leafRectanglesAux, Set.sUnion_union] cases hf : f y with | false => exact Set.mem_union_left _ (ih false _ _ ⟨hx, ⟨hy, hf⟩⟩) | true => exact Set.mem_union_right _ (ih true _ _ ⟨hx, ⟨hy, hf⟩⟩)