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.CommunicationComplexity.PublicCoin.newmanIndexSpace← CommunicationComplexity.PublicCoin.newmanIndexSpace (TCSlib/CommunicationComplexity/NewmanTheorem/Newman.lean:78): verbatim
- Verified
- 07 Oct 2026
- Axioms
- none listed
- Built on 1
- CommunicationComplexity.PublicCoin.FiniteMessage.Protocol.derandomizationSamplesGiven finite types $X$ and $Y$ and real parameters $\varepsilon, c$, the number of random samples required for derandomization via…
- Used by 9
- CommunicationComplexity.PublicCoin.FiniteMessage.Protocol.newmanProtocolGiven a public-coin finite-message protocol $p$ over a probability space $\Omega$ that $\varepsilon$-computes $f : X \to Y \to \alpha$,…
- CommunicationComplexity.PublicCoin.newmanIndexSpace.isProbabilityMeasureCommunicationComplexity.PublicCoin.newmanIndexSpace.isProbabilityMeasure
- CommunicationComplexity.PublicCoin.FiniteMessage.Protocol.newmanProtocol_ApproxComputesNewman's reduction preserves approximate correctness. Let $\Omega$ be a finite probability space, let $X$ and $Y$ be finite types, and let…
- CommunicationComplexity.PublicCoin.newmanIndexSpace.measureSpaceCommunicationComplexity.PublicCoin.newmanIndexSpace.measureSpace
- CommunicationComplexity.PublicCoin.FiniteMessage.Protocol.newmanProtocol_complexityCommunication cost of the Newman protocol. Let $X$ and $Y$ be finite types, let $\Omega$ be a finite probability space, and let $p$ be a…
- CommunicationComplexity.PublicCoin.newmanIndexSpace.fintypeCommunicationComplexity.PublicCoin.newmanIndexSpace.fintype
- CommunicationComplexity.PublicCoin.newmanIndexSpace.nonemptyCommunicationComplexity.PublicCoin.newmanIndexSpace.nonempty
- CommunicationComplexity.PublicCoin.newmanNewman's theorem for communication complexity. Let $X$ and $Y$ be finite types, let $f : X \to Y \to \alpha$, and let…
- CommunicationComplexity.PublicCoin.newmanIndexSpace.finiteProbabilitySpaceCommunicationComplexity.PublicCoin.newmanIndexSpace.finiteProbabilitySpace
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)