CommunicationComplexity.Functions.Indexing.indexing
defimported Lean
The Index function on $n$ bits: given Alice's string $x : \mathrm{Fin}\,n \to \mathrm{Bool}$ and Bob's index $i \in \mathrm{Fin}\,n$, it returns Alice's $i$-th bit, $\mathrm{indexing}_n(x, i) := x_i$.
Statement
set_option relaxedAutoImplicit false in set_option autoImplicit false in open MeasureTheory ProbabilityTheory in open scoped BigOperators in variable (n : ℕ+) in def CommunicationComplexity.Functions.Indexing.indexing (x : Fin n → Bool) (i : Fin n) : Bool
- Defined in
- TCSlib, `CommunicationComplexity.Functions.Indexing.indexing`
- 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.Indexing.indexing← CommunicationComplexity.Functions.Indexing.indexing (TCSlib/CommunicationComplexity/DeterministicCC/FuncIndexing/Basic.lean:76): verbatim
- Verified
- 07 Oct 2026
- Axioms
- none listed
- Used by 1
- CommunicationComplexity.Functions.Indexing.le_oneWayCommunicationComplexityOne-way complexity of Index is at least $n$. Every correct deterministic one-way protocol for $\mathrm{IND}_n$ has cost at least $n$; that…
Lean source view module on GitHub
set_option relaxedAutoImplicit false in set_option autoImplicit false in open MeasureTheory ProbabilityTheory in open scoped BigOperators in variable (n : ℕ+) in /-- The Index function on `n` bits: Alice holds a string `x : Fin n → Bool`, Bob holds an index `i : Fin n`, and the answer is Alice's `i`-th bit `x i` [Rou16, §2.4 Definition (Index)]. -/ def CommunicationComplexity.Functions.Indexing.indexing (x : Fin n → Bool) (i : Fin n) : Bool := x i