Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

(12), p. 34 — the planner's optimum stores weakly more user data than the business's

Proved
DigitalPrivacy.Welfare.eq_12

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

comparative-staticsdata-privacyp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1social-welfare

Work in the model of DigitalPrivacy.Welfare.Setting under the standing assumptions 0≤β<10\le\beta<10≤β<1, 0≤ρ<10\le\rho<10≤ρ<1, ψ>0\psi>0ψ>0, 0≤P≤10\le P\le10≤P≤1, 0<α≤10<\alpha\le10<α≤1. Let (ξ∗,C∗)(\xi^*,C^*)(ξ∗,C∗) be any business optimum and (ξW,CW)(\xi^W,C^W)(ξW,CW) any social optimum. If ξ∗≤ξW\xi^*\le\xi^Wξ∗≤ξW and C∗≥CWC^*\ge C^WC∗≥CW, then the total amount of user data stored at the social optimum is at least that stored at the business optimum:

aˉ∗(ξW,CW) ξW ≥ aˉ∗(ξ∗,C∗) ξ∗.\bar a^*(\xi^W,C^W)\,\xi^W\ \ge\ \bar a^*(\xi^*,C^*)\,\xi^*.aˉ∗(ξW,CW)ξW ≥ aˉ∗(ξ∗,C∗)ξ∗.

This is display (12) of the proof of Theorem 2, obtained from (11) and ξ∗≤ξW\xi^*\le\xi^Wξ∗≤ξW. Together with C∗≥CWC^*\ge C^WC∗≥CW it gives ΠW≥Π∗\Pi^W\ge\Pi^*ΠW≥Π∗, which the proof turns into a contradiction.

Formalization Note. Same hypotheses as (11): the contradiction assumptions ξ∗≤ξW\xi^*\le\xi^Wξ∗≤ξW, C∗≥CWC^*\ge C^WC∗≥CW are kept as printed, and the standing assumptions add α>0\alpha>0α>0, ψ>0\psi>0ψ>0 to the printed ranges.

Preamble
import Mathlib
import Definitions.Def_DigitalPrivacy_Welfare_Setting
Formal statement
namespace DigitalPrivacy.Welfare
theorem eq_12 (β ρ ψ P α : ℝ) (h : Standing β ρ ψ P α) (ξs Cs ξW CW : ℝ)
    (hs : DigitalPrivacy.Strategy.IsBusinessOpt β ρ ψ P ξs Cs) (hW : IsSocialOpt β ρ ψ P α ξW CW)
    (hξ : ξs ≤ ξW) (hC : CW ≤ Cs) :
    DigitalPrivacy.Strategy.abar β ρ ξs Cs * ξs ≤ DigitalPrivacy.Strategy.abar β ρ ξW CW * ξW := by sorry
end DigitalPrivacy.Welfare
Source
Fainmesser, Galeotti, Momot, Digital Privacy, author manuscript (This Draft: April 2022; SSRN 3459274), p. 34, App. A.4, display (12)
Human review
  • Endorsed by Shuze Chen · Oct 15, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 15, 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