CommunicationComplexity.PublicCoin.newmanIndexSpace.isProbabilityMeasure
instanceimported Lean
CommunicationComplexity.PublicCoin.newmanIndexSpace.isProbabilityMeasure
Statement
set_option relaxedAutoImplicit false in set_option autoImplicit false in open MeasureTheory ProbabilityTheory in noncomputable instance CommunicationComplexity.PublicCoin.newmanIndexSpace.isProbabilityMeasure (X Y : Type*) [Fintype X] [Fintype Y] (ε c : ℝ) : IsProbabilityMeasure (volume : Measure (newmanIndexSpace X Y ε c))
- Defined in
- TCSlib, `CommunicationComplexity.PublicCoin.newmanIndexSpace.isProbabilityMeasure`
- 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.isProbabilityMeasure← CommunicationComplexity.PublicCoin.newmanIndexSpace.isProbabilityMeasure (TCSlib/CommunicationComplexity/NewmanTheorem/Newman.lean:96): verbatim
- Verified
- 07 Oct 2026
- Axioms
- none listed
- Built on 4
- CommunicationComplexity.PublicCoin.newmanIndexSpace.measureSpaceCommunicationComplexity.PublicCoin.newmanIndexSpace.measureSpace
- CommunicationComplexity.PublicCoin.newmanIndexSpace.fintypeCommunicationComplexity.PublicCoin.newmanIndexSpace.fintype
- CommunicationComplexity.PublicCoin.newmanIndexSpaceGiven finite input types $X$ and $Y$ and parameters $\varepsilon, c \in \mathbb{R}$, the Newman index space is…
- CommunicationComplexity.PublicCoin.newmanIndexSpace.nonemptyCommunicationComplexity.PublicCoin.newmanIndexSpace.nonempty
- Used by 5
- 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.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.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.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 noncomputable instance CommunicationComplexity.PublicCoin.newmanIndexSpace.isProbabilityMeasure (X Y : Type*) [Fintype X] [Fintype Y] (ε c : ℝ) : IsProbabilityMeasure (volume : Measure (newmanIndexSpace X Y ε c)) := by change IsProbabilityMeasure (ProbabilityTheory.uniformOn Set.univ) infer_instance