Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 1, p. 29 — for fixed data collection ξ, the optimal protection is max{C_h(ξ), 0}

Proved
DigitalPrivacy.Strategy.lemma_1

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

best-responsedata-privacyoptimizationp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Let 0≤β<10 \le \beta < 10≤β<1, 0≤ρ<10 \le \rho < 10≤ρ<1, ψ>0\psi > 0ψ>0 and 0≤P≤10 \le P \le 10≤P≤1, and fix a data collection level ξ∈[0,1]\xi \in [0, 1]ξ∈[0,1]. Let Π(ξ,C)=(1−P)aˉ∗(ξ,C)+Pξaˉ∗(ξ,C)−ψC\Pi(\xi, C) = (1-P)\bar a^*(\xi, C) + P\xi\bar a^*(\xi, C) - \psi CΠ(ξ,C)=(1−P)aˉ∗(ξ,C)+Pξaˉ∗(ξ,C)−ψC be the business's profit and

Ch(ξ)=11−β(−ξ2+ξ1ψ(1+ρξ)(1−P+Pξ)).C_h(\xi) = \frac{1}{1-\beta}\Big(-\xi^2 + \xi\sqrt{\tfrac1\psi(1+\rho\xi)(1-P+P\xi)}\Big).Ch​(ξ)=1−β1​(−ξ2+ξψ1​(1+ρξ)(1−P+Pξ)​).

Then C∗(ξ)=max⁡{Ch(ξ),0}C^*(\xi) = \max\{C_h(\xi), 0\}C∗(ξ)=max{Ch​(ξ),0} is the unique maximizer of C↦Π(ξ,C)C \mapsto \Pi(\xi, C)C↦Π(ξ,C) over C≥0C \ge 0C≥0: for every C≥0C \ge 0C≥0,

Π(ξ,C)≤Π(ξ,max⁡{Ch(ξ),0}),\Pi(\xi, C) \le \Pi\big(\xi, \max\{C_h(\xi), 0\}\big),Π(ξ,C)≤Π(ξ,max{Ch​(ξ),0}),

with equality only if C=max⁡{Ch(ξ),0}C = \max\{C_h(\xi), 0\}C=max{Ch​(ξ),0}.

This is the business's best protection response to a given collection level; Theorem 1's C⋆C^\starC⋆ is this response evaluated at ξ⋆\xi^\starξ⋆.

Formalization Note The paper allows ψ≥0\psi \ge 0ψ≥0; the statement assumes ψ>0\psi > 0ψ>0, since ChC_hCh​ contains 1/ψ1/\psi1/ψ and for ψ=0\psi = 0ψ=0, ξ>0\xi > 0ξ>0 the profit increases in CCC without bound being attained. Uniqueness is the reading of "the business sets". Footnote 29 (when Ch(ξ)>0C_h(\xi) > 0Ch​(ξ)>0) is not part of the statement.

Preamble
import Mathlib
import Definitions.Def_DigitalPrivacy_Strategy_Setting
Formal statement
namespace DigitalPrivacy.Strategy

/-- Lemma 1, p. 29: for a fixed data collection level `ξ ∈ [0, 1]`, the protection level
`max{C_h(ξ), 0}` is the unique maximizer of `C ↦ Π(ξ, C)` over `C ≥ 0`. -/
theorem lemma_1 (β ρ ψ P ξ : ℝ) (hB : Basic β ρ ψ P) (hξ : ξ ∈ Set.Icc (0 : ℝ) 1) :
    0 ≤ max (Ch β ρ ψ P ξ) 0 ∧
    ∀ C : ℝ, 0 ≤ C →
      profit β ρ ψ P ξ C ≤ profit β ρ ψ P ξ (max (Ch β ρ ψ P ξ) 0) ∧
      (profit β ρ ψ P ξ C = profit β ρ ψ P ξ (max (Ch β ρ ψ P ξ) 0) →
        C = max (Ch β ρ ψ P ξ) 0) := by sorry

end DigitalPrivacy.Strategy
Source
Fainmesser, Galeotti, Momot, Digital Privacy, author manuscript (This Draft: April 2022; SSRN 3459274), p. 29, Lemma 1; proof Online App. B
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