AFTD Auto-Formalizing Theoretical Domains

CommunicationComplexity.PublicCoin.newmanIndexSpace

abbrevimported Lean

Given finite input types $X$ and $Y$ and parameters $\varepsilon, c \in \mathbb{R}$, the Newman index space is $\mathrm{Fin}(\mathtt{derandomizationSamples}\;X\;Y\;\varepsilon\;c)$, i.e.\ the finite type indexing the table of random seeds that Alice samples from in the Newman reduction.

Statement

set_option relaxedAutoImplicit false in
set_option autoImplicit false in
open MeasureTheory ProbabilityTheory in
noncomputable abbrev CommunicationComplexity.PublicCoin.newmanIndexSpace
    (X Y : Type*) [Fintype X] [Fintype Y] (ε c : ℝ)
Defined in
TCSlib, `CommunicationComplexity.PublicCoin.newmanIndexSpace`
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
Built on 1
Used by 9

Lean source view module on GitHub

set_option relaxedAutoImplicit false in
set_option autoImplicit false in
open MeasureTheory ProbabilityTheory in
/-- The index space of the Newman reduction: the finite type `Fin (derandomizationSamples X Y ε c)` of indices into the table of `t` good seeds, from which Alice samples uniformly and whose element she sends to Bob. [RY20, Thm 3.5 proof] (Alice sends the index of one of the `t` good strings). -/
noncomputable abbrev CommunicationComplexity.PublicCoin.newmanIndexSpace
    (X Y : Type*) [Fintype X] [Fintype Y] (ε c : ℝ) :=
  Fin (FiniteMessage.Protocol.derandomizationSamples X Y ε c)
See it in the graphDiscuss this resultChallenge it