CommunicationComplexity.Deterministic.Protocol.aux_mono
theoremverifiedimported Lean
Leaf rectangles are output-monochromatic. Let $p$ be a deterministic communication protocol over input types $X$ (Alice) and $Y$ (Bob) with outputs in $\alpha$, and let $A \subseteq X$ and $B \subseteq Y$. If $R$ is one of the auxiliary leaf rectangles of $p$ constrained to $A \times B$, and $(x, y)$ and $(x', y')$ both belong to $R$, then running $p$ yields the same output at both inputs; that is, $p(x, y) = p(x', y')$.
Statement
set_option relaxedAutoImplicit false in set_option autoImplicit false in variable {X Y α : Type*} in lemma CommunicationComplexity.Deterministic.Protocol.aux_mono (p : Protocol X Y α) (A : Set X) (B : Set Y) (R : Set (X × Y)) (hR : R ∈ leafRectanglesAux p A B) (x x' : X) (y y' : Y) (hxy : (x, y) ∈ R) (hxy' : (x', y') ∈ R) : p.run x y = p.run x' y'
- Source
- TCSlib, `CommunicationComplexity.Deterministic.Protocol.aux_mono`
- 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_mono← CommunicationComplexity.Deterministic.Protocol.aux_mono (TCSlib/CommunicationComplexity/DeterministicCC/DetRectangle.lean:352): verbatim
- Verified
- 07 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 5
- 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_alice_bitAlice'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…
- CommunicationComplexity.Deterministic.ProtocolA deterministic two-party communication protocol over input types $X$ (Alice) and $Y$ (Bob) producing a value of type $\alpha$ is an…
- CommunicationComplexity.Deterministic.Protocol.runGiven a protocol $p$,
runevaluates $p$ on inputs $x : X$ and $y : Y$ by recursively following the bit-branching structure until… - CommunicationComplexity.Deterministic.Protocol.aux_bob_bitBob'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…
- Used by 3
- CommunicationComplexity.Deterministic.FiniteMessage.Protocol.completeTreeAlice_runEvaluation of the complete Alice-query tree. Fix a depth $d \in \bbn$, a family of binary query functions…
- CommunicationComplexity.Deterministic.Protocol.comap_runPull-back commutes with protocol execution. Let $p$ be a deterministic two-party communication protocol with Alice's inputs drawn from $X$…
- CommunicationComplexity.Deterministic.Protocol.leafRectangles_monoLeaf rectangles of a protocol are monochromatic. Let $p$ be a deterministic two-party communication protocol over input types $X$ and $Y$…
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 protocol output is constant on each leaf rectangle of `p` relative to `A ×ˢ B`. **Proof sketch.** Induction on `p`. A terminal protocol outputs a constant. Step 1: at an Alice node the rectangle `R` comes from one child, and both inputs in `R` send the bit of that child (`aux_alice_bit`), so both runs descend into the same child, where the induction hypothesis applies. Step 2: a Bob node is the mirror image with Bob's bit. -/lemma CommunicationComplexity.Deterministic.Protocol.aux_mono (p : Protocol X Y α) (A : Set X) (B : Set Y) (R : Set (X × Y)) (hR : R ∈ leafRectanglesAux p A B) (x x' : X) (y y' : Y) (hxy : (x, y) ∈ R) (hxy' : (x', y') ∈ R) : p.run x y = p.run x' y' := by induction p generalizing A B with | output v => rfl | alice f P ih => simp only [leafRectanglesAux, Set.mem_union] at hR -- Step 1: both inputs send the same bit, so the run descends into the same child. rcases hR with hR | hR <;> simp only [run, aux_alice_bit hR hxy, aux_alice_bit hR hxy'] <;> exact ih _ _ _ hR | bob f P ih => simp only [leafRectanglesAux, Set.mem_union] at hR -- Step 2: mirror of Step 1 for Bob's bit. rcases hR with hR | hR <;> simp only [run, aux_bob_bit hR hxy, aux_bob_bit hR hxy'] <;> exact ih _ _ _ hR