Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§3.1, p. 15 — Assumption 1 implies 2(κ_L v − c) ≥ κ_H v − c ≥ 0 for every v ≥ v*_M(p₁)

Proved
GDPRDataMarkets.Rights.assumption1_case_i

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

gdprp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1privacy

Assume κH>κL>0\kappa_H>\kappa_L>0κH​>κL​>0, δ∈(0,1]\delta\in(0,1]δ∈(0,1], c≥0c\ge0c≥0 and Assumption 1, μ≥max⁡{(3+δ)σ, 12+(2+δ)σ}\mu\ge\max\{(3+\delta)\sigma,\ \tfrac12+(2+\delta)\sigma\}μ≥max{(3+δ)σ, 21​+(2+δ)σ}. Let p1∈Rp_1\in\mathbb Rp1​∈R and let vM∗(p1)=max⁡{c/(δσ), (p1+c)/(1+δσ)}v^*_M(p_1)=\max\{c/(\delta\sigma),\ (p_1+c)/(1+\delta\sigma)\}vM∗​(p1​)=max{c/(δσ), (p1​+c)/(1+δσ)} be the opt-in threshold of eq. (4). Then every v≥vM∗(p1)v\ge v^*_M(p_1)v≥vM∗​(p1​) satisfies

2(κLv−c) ≥ κHv−c ≥ 0.2(\kappa_Lv-c)\ \ge\ \kappa_Hv-c\ \ge\ 0.2(κL​v−c) ≥ κH​v−c ≥ 0.

So every consumer who opts in is in case (i) of eq. (1), and the personalized price of eq. (2) is optimal for her. This is where the first half of Assumption 1 enters the equilibrium.

Preamble
import Mathlib
import Definitions.Def_GDPRDataMarkets_Rights_Model
import Definitions.Def_GDPRDataMarkets_Rights_ClosedForms
Formal statement
namespace GDPRDataMarkets.Rights

/-- §3.1, p. 15: under Assumption 1, every `v ≥ v*_M(p₁)` satisfies `2(κ_L v − c) ≥ κ_H v − c ≥ 0`,
the condition of case (i) of eq. (1). -/
theorem assumption1_case_i (P : Params) (hS : P.Standing) (hA : P.Assumption1) (p1 v : ℝ)
    (hv : vStar P p1 ≤ v) :
    P.kH * v - P.c ≤ 2 * (P.kL * v - P.c) ∧ 0 ≤ P.kH * v - P.c := by sorry

end GDPRDataMarkets.Rights
Source
Ke, Sudhir, Privacy Rights and Data Security: GDPR and Personal Data Markets, SSRN 3643979 (pdfTeX build 2022-09-14), p. 15, §3.1, first paragraph
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