Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Prop. 2, p. 50 — v^B_M(P₁^B) ≥ c ⇔ c ≤ T₁ (then v^B_M(P₁^B) ≤ 1); eq. (8)'s threshold ≤ 1 ⇔ c ≤ 1 + δμ/(1 + δ), < c ⇔ c > (1 + δσ)/(1 + δμ + δσ)

Proved
GDPRDataMarkets.Benchmark.regime_conditions

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

gdprp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1privacytwo-period-pricing

Under the standing assumptions κH>κL>0\kappa_H>\kappa_L>0κH​>κL​>0, δ∈(0,1]\delta\in(0,1]δ∈(0,1], c≥0c\ge0c≥0, let v‾1B=vMB(P1B)\overline v_1^B=v^B_M(P_1^B)v1B​=vMB​(P1B​) be the threshold of eq. (6) at the price P1BP_1^BP1B​ of eq. (7). Let vN(p8)v_N(p_8)vN​(p8​) be the threshold (p1+(1+δ)c)/(1+δσ)(p_1+(1+\delta)c)/(1+\delta\sigma)(p1​+(1+δ)c)/(1+δσ) at the price p8p_8p8​ of eq. (8). Write

T1=2−δ+2δσ2−δ+2δμ+2δσ,T2=1+δ1+δμ.T_1=\frac{2-\delta+2\delta\sigma}{2-\delta+2\delta\mu+2\delta\sigma},\qquad T_2=1+\frac{\delta}{1+\delta}\mu.T1​=2−δ+2δμ+2δσ2−δ+2δσ​,T2​=1+1+δδ​μ.

Then:

  1. vMB(P1B)≥cv^B_M(P_1^B)\ge cvMB​(P1B​)≥c if and only if c≤T1c\le T_1c≤T1​;
  2. if c≤T1c\le T_1c≤T1​, then vMB(P1B)≤1v^B_M(P_1^B)\le 1vMB​(P1B​)≤1;
  3. vN(p8)≤1v_N(p_8)\le1vN​(p8​)≤1 if and only if c≤T2c\le T_2c≤T2​;
  4. vN(p8)<cv_N(p_8)<cvN​(p8​)<c if and only if c>1+δσ1+δμ+δσc>\dfrac{1+\delta\sigma}{1+\delta\mu+\delta\sigma}c>1+δμ+δσ1+δσ​.

These conditions separate the regimes of Proposition 2. In the first, the firm sells the basic good in period 2. In the second, it does not, but some consumers buy in period 1. In the third, nobody buys.

Formalization Note. Only the standing assumptions are needed; Assumption 1 is not used. The theorem also records that v‾1B\overline v_1^Bv1B​ as defined in the model equals vMB(P1B)v^B_M(P_1^B)vMB​(P1B​).

Preamble
import Mathlib
import Definitions.Def_GDPRDataMarkets_Benchmark_Model
import Definitions.Def_GDPRDataMarkets_Benchmark_Reduced
Formal statement
namespace GDPRDataMarkets.Benchmark
theorem regime_conditions (P : Params) (hS : P.Standing) :
    vB P (P1B P) = vbar1B P ∧
    (P.c ≤ vbar1B P ↔ P.c ≤ T1 P) ∧
    (P.c ≤ T1 P → vbar1B P ≤ 1) ∧
    (vN P (p8 P) ≤ 1 ↔ P.c ≤ T2 P) ∧
    (vN P (p8 P) < P.c ↔
      (1 + P.d * P.sigma) / (1 + P.d * P.mu + P.d * P.sigma) < P.c) := 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. 50, Appendix, proof of Proposition 2, paragraphs after eq. (7) and after eq. (8)
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