CommunicationComplexity.Functions.Equality.equality
defimported Lean
For a natural number $n$, CommunicationComplexity.Functions.Equality.equality
is the Boolean function
$\mathrm{equality}_n : \mathrm{BoolInput}\,n \times \mathrm{BoolInput}\,n \to \mathrm{Bool}$
that returns true if and only if Alice's input $x$ equals Bob's input $y$.
Statement
set_option relaxedAutoImplicit false in set_option autoImplicit false in open MeasureTheory in def CommunicationComplexity.Functions.Equality.equality (n : ℕ) (x y : BoolInput n) : Bool
- Defined in
- TCSlib, `CommunicationComplexity.Functions.Equality.equality`
- 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.equality← CommunicationComplexity.Functions.Equality.equality (TCSlib/CommunicationComplexity/DeterministicCC/FuncEquality.lean:64): verbatim
- Verified
- 07 Oct 2026
- Axioms
- none listed
- Built on 1
- CommunicationComplexity.BoolInput$\texttt{BoolInput}(n)$ is the type of $n$-bit Boolean inputs, defined as the function type $\mathrm{Fin}\,n \to \mathrm{Bool}$.
- Used by 4
- CommunicationComplexity.Functions.Equality.le_communicationComplexityDeterministic complexity lower bound for equality. For every natural number $n \ge 1$, the deterministic communication complexity of the…
- 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…
- CommunicationComplexity.Functions.Equality.communicationComplexity_leDeterministic complexity upper bound for equality. For every natural number $n$, the deterministic communication complexity of the $n$-bit…
- CommunicationComplexity.Functions.Equality.communicationComplexity_zeroDeterministic complexity of equality at $n = 0$. Let…
Lean source view module on GitHub
set_option relaxedAutoImplicit false in set_option autoImplicit false in open MeasureTheory in /-- The equality function on `n`-bit strings: `equality n x y` is `true` if and only if `x = y` [RY20, Ch. 1, eq. (1.1)]. -/ def CommunicationComplexity.Functions.Equality.equality (n : ℕ) (x y : BoolInput n) : Bool := decide (x = y)