AFTD Auto-Formalizing Theoretical Domains

CommunicationComplexity.PrivateCoin.FiniteMessage.Protocol.ApproxComputes_eq_ApproxSatisfies

theoremverifiedimported Lean

Approximate computation as approximate satisfaction of equality. Let $p$ be a private-coin finite-message protocol over input types $X$, $Y$ with private-randomness types $\Omega_X$, $\Omega_Y$ and output type $\alpha$, each of $\Omega_X$ and $\Omega_Y$ carrying a measure, let $f : X \times Y \to \alpha$ be a target function, and let $\varepsilon \in \bbr$. Then the proposition that $p$ $\varepsilon$-computes $f$ coincides with the proposition that $p$ $\varepsilon$-satisfies the predicate $Q(x,y,a)$ given by $a = f(x,y)$; that is, the two propositions are equal.

Statement

set_option relaxedAutoImplicit false in
set_option autoImplicit false in
open MeasureTheory in
variable {Ω_X Ω_Y : Type*} {X Y α : Type*} in
theorem CommunicationComplexity.PrivateCoin.FiniteMessage.Protocol.ApproxComputes_eq_ApproxSatisfies
    [MeasureSpace Ω_X] [MeasureSpace Ω_Y]
    (p : Protocol Ω_X Ω_Y X Y α) (f : X → Y → α) (ε : ℝ) :
    p.ApproxComputes f ε =
      p.ApproxSatisfies (fun x y a => a = f x y) ε
Source
TCSlib, `CommunicationComplexity.PrivateCoin.FiniteMessage.Protocol.ApproxComputes_eq_ApproxSatisfies`
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
Classical.choiceQuot.soundpropext
Built on 3
Used by 1

Lean source view module on GitHub

set_option relaxedAutoImplicit false inset_option autoImplicit false inopen MeasureTheory invariable {Ω_X Ω_Y : Type*} {X Y α : Type*} in/-- A private-coin finite-message protocol `ε`-computes `f` if and only if it `ε`-satisfies the relation "the output on `(x, y)` equals `f x y`"; the two propositions are equal. -/theorem CommunicationComplexity.PrivateCoin.FiniteMessage.Protocol.ApproxComputes_eq_ApproxSatisfies    [MeasureSpace Ω_X] [MeasureSpace Ω_Y]    (p : Protocol Ω_X Ω_Y X Y α) (f : X → Y → α) (ε : ℝ) :    p.ApproxComputes f ε =      p.ApproxSatisfies (fun x y a => a = f x y) ε := by  simp only [ApproxComputes, ApproxSatisfies, ne_eq]
See it in the graphDiscuss this resultChallenge it