Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proposition 2, p. 17 — the platform's problem reduces to minimizing Ec[(n+1)MSE+∑iεiψi(ci)]−n VAR\mathbb E_c[(n+1)\mathrm{MSE} + \sum_i \varepsilon_i\psi_i(c_i)] - n\,\mathrm{VAR}Ec​[(n+1)MSE+∑i​εi​ψi​(ci​)]−nVAR under (21)

Proved
PrivAcq.Central.proposition_2

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

data-acquisitionmechanism-designp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1virtual-cost

Under the standing assumptions of the model:

  1. For every admissible mechanism that is incentive compatible (17) and individually rational (18),
Ec[MSE(c)+∑i=1nti(c)]  ≥  Ec[(n+1) MSE(c)+∑i=1nεi(c) ψi(ci)]−n VAR.(20)\mathbb E_c\Big[\mathrm{MSE}(c) + \sum_{i=1}^n t_i(c)\Big] \;\ge\; \mathbb E_c\Big[(n+1)\,\mathrm{MSE}(c) + \sum_{i=1}^n \varepsilon_i(c)\,\psi_i(c_i)\Big] - n\,\mathrm{VAR}. \qquad (20)Ec​[MSE(c)+i=1∑n​ti​(c)]≥Ec​[(n+1)MSE(c)+i=1∑n​εi​(c)ψi​(ci​)]−nVAR.(20)
  1. Conversely, for every admissible allocation (w,η,ε)(w, \eta, \varepsilon)(w,η,ε) whose interim privacy losses εˉi(z)=Ec−i[εi(z,c−i)]\bar\varepsilon_i(z) = \mathbb E_{c_{-i}}[\varepsilon_i(z, c_{-i})]εˉi​(z)=Ec−i​​[εi​(z,c−i​)] are weakly decreasing in zzz (constraint (21)), equipping it with the payments (19) with di=0d_i = 0di​=0 gives an admissible, incentive compatible and individually rational mechanism whose objective equals the right-hand side of (20).

Hence the optimal privacy losses are the solution of minimizing the right-hand side of (20) subject to (21): the analogue of Myerson's reduction of mechanism design to virtual welfare maximization.

Formalization Note The paper's "the optimal privacy loss … is the solution of (20)–(21)" is stated as the two inequalities/equalities that make the two problems equivalent. Payments (19) are used in ex post form, ti(c)=MSE(c)−VAR+ciεi(c)+∫cibiεi(z,c−i) dzt_i(c) = \mathrm{MSE}(c) - \mathrm{VAR} + c_i\varepsilon_i(c) + \int_{c_i}^{b_i}\varepsilon_i(z, c_{-i})\,dzti​(c)=MSE(c)−VAR+ci​εi​(c)+∫ci​bi​​εi​(z,c−i​)dz.

Preamble
import Mathlib
import Definitions.Def_PrivAcq_Central_Model
Formal statement
namespace PrivAcq.Central

open MeasureTheory

theorem proposition_2 {n : ℕ} (S : Setting n) (hS : S.Standing) :
    (∀ M : Mech n, Admissible S M → IC S M → IR S M →
      (∫ c, (((n : ℝ) + 1) * mse S M c + ∑ i, M.ε c i * S.ψ i (c i)) ∂S.typeLaw)
          - (n : ℝ) * S.var ≤ objective S M) ∧
    (∀ M : Mech n, AdmissibleAlloc S M →
      (∀ i : Fin n, AntitoneOn (interimEps S M i) (Set.Icc (S.a i) (S.b i))) →
      Admissible S (withPayments S M) ∧ IC S (withPayments S M) ∧ IR S (withPayments S M) ∧
        objective S (withPayments S M) =
          (∫ c, (((n : ℝ) + 1) * mse S M c + ∑ i, M.ε c i * S.ψ i (c i)) ∂S.typeLaw)
            - (n : ℝ) * S.var) := by sorry

end PrivAcq.Central
Source
Fallah, Makhdoumi, Malekian, Ozdaglar, arXiv:2201.03968v2, p. 17, Proposition 2, (20), (21); proof p. 44, (A35)
Human review
  • Endorsed by Shuze Chen · Oct 21, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 21, 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 paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me