Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Prop. 2, p. 49 — the personalized price r^B_M(v) = (1 + κ_L)v = (1 + μ − σ)v is optimal and both types keep buying

Proved
GDPRDataMarkets.Benchmark.personalized_price

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

gdprp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1personalized-pricingprivacy

Consider the benchmark model without privacy rights. The parameters satisfy κH>κL>0\kappa_H>\kappa_L>0κH​>κL​>0, δ∈(0,1]\delta\in(0,1]δ∈(0,1] and c≥0c\ge0c≥0, with μ=(κH+κL)/2\mu=(\kappa_H+\kappa_L)/2μ=(κH​+κL​)/2 and σ=(κH−κL)/2\sigma=(\kappa_H-\kappa_L)/2σ=(κH​−κL​)/2, and moreover μ≥3σ−1\mu\ge3\sigma-1μ≥3σ−1. Let v≥0v\ge0v≥0 be the valuation of a first-period buyer, and let

R(v,ρ)=ρ2[1(ρ≤(1+κL)v)+1(ρ≤(1+κH)v)]R(v,\rho)=\frac{\rho}{2}\Big[\mathbb 1\big(\rho\le(1+\kappa_L)v\big)+\mathbb 1\big(\rho\le(1+\kappa_H)v\big)\Big]R(v,ρ)=2ρ​[1(ρ≤(1+κL​)v)+1(ρ≤(1+κH​)v)]

be the firm's expected revenue from her at the personalized price ρ\rhoρ. Then the price (1+μ−σ)v=(1+κL)v(1+\mu-\sigma)v=(1+\kappa_L)v(1+μ−σ)v=(1+κL​)v maximizes R(v,⋅)R(v,\cdot)R(v,⋅) over all real ρ\rhoρ:

R(v,ρ) ≤ R(v,(1+μ−σ)v)for all ρ∈R.R(v,\rho)\ \le\ R\big(v,(1+\mu-\sigma)v\big)\qquad\text{for all }\rho\in\mathbb R.R(v,ρ) ≤ R(v,(1+μ−σ)v)for all ρ∈R.

At this price (1+μ−σ)v≤(1+κL)v(1+\mu-\sigma)v\le(1+\kappa_L)v(1+μ−σ)v≤(1+κL​)v and (1+μ−σ)v≤(1+κH)v(1+\mu-\sigma)v\le(1+\kappa_H)v(1+μ−σ)v≤(1+κH​)v, so consumers of both types continue to buy in the second period.

This determines the second-period personalized price in every regime of Proposition 2.

Formalization Note. The page's condition μ≥3σ−1\mu\ge3\sigma-1μ≥3σ−1 is the hypothesis; Assumption 1 implies it. "Continue to purchase" is encoded by the convention that an indifferent consumer buys, i.e. a type κ\kappaκ buys iff ρ≤(1+κ)v\rho\le(1+\kappa)vρ≤(1+κ)v.

Preamble
import Mathlib
import Definitions.Def_GDPRDataMarkets_Benchmark_Model
Formal statement
namespace GDPRDataMarkets.Benchmark
theorem personalized_price (P : Params) (hS : P.Standing) (hμ : 3 * P.sigma - 1 ≤ P.mu)
    (v : ℝ) (hv : 0 ≤ v) :
    (∀ ρ : ℝ, RB P v ρ ≤ RB P v ((1 + P.mu - P.sigma) * v)) ∧
    (1 + P.mu - P.sigma) * v = (1 + P.kL) * v ∧
    (1 + P.mu - P.sigma) * v ≤ (1 + P.kL) * v ∧
    (1 + P.mu - P.sigma) * v ≤ (1 + P.kH) * v := by sorry
end GDPRDataMarkets.Benchmark
Source
Ke, Sudhir, Privacy Rights and Data Security: GDPR and Personal Data Markets, SSRN 3643979 (pdfTeX build 2022-09-14), p. 49, Appendix, proof of Proposition 2, first display
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