Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Theorem 3.2 [MT07] — the exponential mechanism is ε-differentially private

Proved
PrivateRelease.NetMechanism.theorem_3_2

by mikedeng1 · Oct 7, 2026 · Mathlib 0df444a (Lean v4.33.1)

differential-privacyexponential-mechanismp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1

Let XXX be a finite data universe, nnn an input size, RRR a finite nonempty range and q:Xn×R→Rq:X^n\times R\to\mathbb Rq:Xn×R→R a quality score with GSq>0GS_q>0GSq​>0. For every ε>0\varepsilon>0ε>0 the exponential mechanism ME(⋅,q,R)M_E(\cdot,q,R)ME​(⋅,q,R) is ε\varepsilonε-differentially private: for all inputs z,z′∈Xnz,z'\in X^nz,z′∈Xn differing in one entry and every set SSS of outputs,

Pr⁡[ME(z,q,R)∈S]≤eε Pr⁡[ME(z′,q,R)∈S],\Pr[M_E(z,q,R)\in S]\le e^{\varepsilon}\,\Pr[M_E(z',q,R)\in S] ,Pr[ME​(z,q,R)∈S]≤eεPr[ME​(z′,q,R)∈S],

and each output law is a probability distribution on RRR.

This is the privacy guarantee of McSherry and Talwar's exponential mechanism, of which the Net mechanism is an instance.

Formalization Note The hypothesis GSq>0GS_q>0GSq​>0 is where the paper's formula exp⁡(εq/(2GSq))\exp(\varepsilon q/(2GS_q))exp(εq/(2GSq​)) is defined. Neighbours differ in exactly one entry. The probability-measure clause is stated because the platform's privacy predicate alone does not require it.

Preamble
import Mathlib
import Definitions.Def_PrivateRelease_NetMechanism_ExpMech
Formal statement
namespace PrivateRelease.NetMechanism

open MeasureTheory

/-- Theorem 3.2 ([MT07], p. 8): the exponential mechanism `M_E(·, q, R)` over a finite nonempty
range `R`, with a quality score of positive sensitivity `GS_q`, preserves ε-differential
privacy; each of its output laws is a probability measure. -/
theorem theorem_3_2 {X O : Type} [Fintype X] [MeasurableSpace O] {n : ℕ} (R : Finset O)
    (q : (Fin n → X) → O → ℝ) (ε : ℝ) (hR : R.Nonempty) (hq : 0 < scoreSens R q)
    (hε : 0 < ε) :
    PrivLearn.Generic.IsDP (expMech R q ε) ε ∧
      ∀ z : Fin n → X, IsProbabilityMeasure (expMech R q ε z) := by sorry

end PrivateRelease.NetMechanism
Source
Blum, Ligett, Roth, A Learning Theory Approach to Non-Interactive Database Privacy, arXiv:1109.2229v1 (2011), p. 8, Theorem 3.2 (citing McSherry–Talwar 2007)
Human review
  • Endorsed by Shuze Chen · Oct 8, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 8, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me