AFTD Auto-Formalizing Theoretical Domains

CommunicationComplexity.CoinTape

abbrevimported Lean

$\texttt{CoinTape}(n)$ is the type $\mathrm{Fin}\,n \to \mathrm{Bool}$, i.e.\ the set of all binary strings of length $n$, representing the $2^n$ possible outcomes of $n$ independent fair coin flips.

Statement

set_option relaxedAutoImplicit false in
set_option autoImplicit false in
abbrev CommunicationComplexity.CoinTape (n : ℕ)
Defined in
TCSlib, `CommunicationComplexity.CoinTape`
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.
Verified
07 Oct 2026
Axioms
none listed
Used by 19

Lean source view module on GitHub

set_option relaxedAutoImplicit false in
set_option autoImplicit false in
/-- A coin tape of length `n`: a sequence of `n` bits, one per fair coin flip, i.e. a function `Fin n → Bool`. This is the random string that a randomized protocol has access to beyond its inputs [RY20, Ch. 3, Definition (randomized protocol)]; here it consists of `n` fair bits, uniformly distributed via `coinTapeMeasure`. -/
abbrev CommunicationComplexity.CoinTape (n : ℕ) := Fin n → Bool
See it in the graphDiscuss this resultChallenge it