CommunicationComplexity.Deterministic.Protocol.aux_bob_bit
theoremverifiedimported Lean
Bob's bit is fixed on a child's leaf rectangle. Let $p$ be a protocol on $X \times Y$, let $A \subseteq X$, $B \subseteq Y$, let $f : Y \to \{0,1\}$ be the bit Bob sends, and let $b$ be a bit. If $R$ is a leaf rectangle of $p$ run on the restricted input set $A \times (B \cap \{y \mid f(y) = b\})$, then every input $(x, y) \in R$ satisfies $f(y) = b$. This is the mirror image of $ CommunicationComplexity.Deterministic.Protocol.aux_alice_bit$.
Statement
set_option relaxedAutoImplicit false in set_option autoImplicit false in variable {X Y α : Type*} in lemma CommunicationComplexity.Deterministic.Protocol.aux_bob_bit {p : Protocol X Y α} {A : Set X} {B : Set Y} {f : Y → Bool} {b : Bool} {R : Set (X × Y)} (hR : R ∈ leafRectanglesAux p A (B ∩ {y | f y = b})) {x : X} {y : Y} (hxy : (x, y) ∈ R) : f y = b
- Source
- TCSlib, `CommunicationComplexity.Deterministic.Protocol.aux_bob_bit`
- 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_bob_bit← CommunicationComplexity.Deterministic.Protocol.aux_bob_bit (TCSlib/CommunicationComplexity/DeterministicCC/DetRectangle.lean:276): verbatim
- Verified
- 07 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 3
- 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.aux_subsetAuxiliary leaf rectangles lie within the constraint. Let $p$ be a deterministic two-party communication protocol over input types $X$…
- 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.aux_monoLeaf rectangles are output-monochromatic. Let $p$ be a deterministic communication protocol over input types $X$ (Alice) and $Y$ (Bob)…
- CommunicationComplexity.Deterministic.Protocol.aux_disjoint_bob_of_neLeaf rectangles on opposite Bob branches are disjoint. Let $p, q$ be protocols on $X \times Y$, let $A \subseteq X$, $B \subseteq Y$, let…
Lean source view module on GitHub
set_option relaxedAutoImplicit false in set_option autoImplicit false in variable {X Y α : Type*} in /-- Shared bit-split step of the `bob` branches: a leaf rectangle of the child reached on Bob's bit `b` only contains inputs `(x, y)` with `f y = b`; mirror of `aux_alice_bit`. -/ lemma CommunicationComplexity.Deterministic.Protocol.aux_bob_bit {p : Protocol X Y α} {A : Set X} {B : Set Y} {f : Y → Bool} {b : Bool} {R : Set (X × Y)} (hR : R ∈ leafRectanglesAux p A (B ∩ {y | f y = b})) {x : X} {y : Y} (hxy : (x, y) ∈ R) : f y = b := (aux_subset p _ _ R hR hxy).2.2