CommunicationComplexity.Functions.Equality.communicationComplexity_zero
theoremverifiedimported Lean
Deterministic complexity of equality at $n = 0$. Let $\mathrm{equality}_0 \colon \mathrm{BoolInput}\,0 \times \mathrm{BoolInput}\,0 \to \mathrm{Bool}$ be the equality function on $0$-bit Boolean inputs, and let $D(\mathrm{equality}_0)$ denote its deterministic communication complexity, that is, the infimum over all deterministic two-party protocols computing it of the worst-case number of bits exchanged, taken in $\bbn_\infty$. Then \[ D(\mathrm{equality}_0) = 0. \]
Statement
set_option relaxedAutoImplicit false in set_option autoImplicit false in open MeasureTheory in theorem CommunicationComplexity.Functions.Equality.communicationComplexity_zero : Deterministic.communicationComplexity (equality 0) = 0
- Source
- TCSlib, `CommunicationComplexity.Functions.Equality.communicationComplexity_zero`
- 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.Functions.Equality.communicationComplexity_zero← CommunicationComplexity.Functions.Equality.communicationComplexity_zero (TCSlib/CommunicationComplexity/DeterministicCC/FuncEquality.lean:92): verbatim
- Verified
- 07 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 6
- CommunicationComplexity.Deterministic.communicationComplexity_le_iffThreshold characterization of deterministic communication complexity. Let $f : X \to Y \to \alpha$ be a two-argument function and let $n$…
- 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.communicationComplexityThe deterministic communication complexity of $f : X \to Y \to \alpha$ is defined as…
- 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.Functions.Equality.equalityFor a natural number $n$,
CommunicationComplexity.Functions.Equality.equalityis the Boolean function… - CommunicationComplexity.Deterministic.Protocol.runGiven a protocol $p$,
runevaluates $p$ on inputs $x : X$ and $y : Y$ by recursively following the bit-branching structure until…
- Used by 1
- CommunicationComplexity.Functions.Equality.communicationComplexity_eqExact deterministic complexity of equality. For a natural number $n$, let $\mathrm{equality}_n$ denote the two-party Boolean function on…
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 inopen MeasureTheory in/-- When n = 0, equality has communication complexity 0: both inputs are the unique empty function, so the output is always `true`. -/theorem CommunicationComplexity.Functions.Equality.communicationComplexity_zero : Deterministic.communicationComplexity (equality 0) = 0 := by apply le_antisymm · change Deterministic.communicationComplexity (equality 0) ≤ (0 : ℕ) rw [Deterministic.communicationComplexity_le_iff] exact ⟨Deterministic.Protocol.output true, by ext x y; simp [equality, Deterministic.Protocol.run, Subsingleton.elim x y], by simp [Deterministic.Protocol.complexity]⟩ · exact bot_le