CommunicationComplexity.BoolInput
abbrevimported Lean
$\texttt{BoolInput}(n)$ is the type of $n$-bit Boolean inputs, defined as the function type $\mathrm{Fin}\,n \to \mathrm{Bool}$.
Statement
set_option relaxedAutoImplicit false in set_option autoImplicit false in abbrev CommunicationComplexity.BoolInput (n : Nat)
- Defined in
- TCSlib, `CommunicationComplexity.BoolInput`
- 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.BoolInput← CommunicationComplexity.BoolInput (TCSlib/CommunicationComplexity/DeterministicCC/Helper.lean:49): verbatim
- Verified
- 07 Oct 2026
- Axioms
- none listed
- Used by 6
- CommunicationComplexity.flipAt_apply_sameValue of the single-coordinate flip at the flipped coordinate. Let $n \in \bbn$, let $i \in \mathrm{Fin}\,n$ be a coordinate index, and…
- CommunicationComplexity.flipAtGiven $i : \mathrm{Fin}\,n$ and $x : \texttt{BoolInput}(n)$, $\texttt{flipAt}\,i\,x$ is the Boolean input obtained from $x$ by negating…
- CommunicationComplexity.flipAt_apply_neFlip leaves other coordinates unchanged. Let $x \colon \mathrm{Fin}\,n \to \mathrm{Bool}$ be an $n$-bit Boolean input, and let…
- CommunicationComplexity.Functions.Equality.le_communicationComplexityDeterministic complexity lower bound for equality. For every natural number $n \ge 1$, the deterministic communication complexity of the…
- CommunicationComplexity.flipAt_flipAtSingle-coordinate flip is an involution. Fix $n \in \bbn$, a coordinate $i \in \mathrm{Fin}\,n$, and an $n$-bit Boolean input…
- CommunicationComplexity.Functions.Equality.equalityFor a natural number $n$,
CommunicationComplexity.Functions.Equality.equalityis the Boolean function…
Lean source view module on GitHub
set_option relaxedAutoImplicit false in set_option autoImplicit false in /-- The type of `n`-bit Boolean inputs. -/ abbrev CommunicationComplexity.BoolInput (n : Nat) := Fin n → Bool