Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Proposition 1, p. 35 — π₂₁(z^N) = π̂₂₂(z^N) and π₂₁(1) < π̂₂₂(1), where π̂₂₂(b) = π₂₂(z^N, b)

Proved
SoftenDataShare.Mutual.pi22_boundary

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

data-sharinghotellingp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Let (F,f)(F,f)(F,f) be a monotone-hazard-rate distribution on [0,1][0,1][0,1] and zNz^NzN the benchmark marginal consumer of Eq. (1). Fix a=zNa=z^Na=zN and write π^22(b)=π22(zN,b)=max⁡z′∈[0,zN](2z′−1)(1−F(b)+F(zN)−F(z′))\hat\pi_{22}(b)=\pi_{22}(z^N,b)=\max_{z'\in[0,z^N]}(2z'-1)(1-F(b)+F(z^N)-F(z'))π^22​(b)=π22​(zN,b)=maxz′∈[0,zN]​(2z′−1)(1−F(b)+F(zN)−F(z′)). Then

π21(zN)=π^22(zN)andπ21(1)<π^22(1).\pi_{21}(z^N)=\hat\pi_{22}(z^N)\qquad\text{and}\qquad\pi_{21}(1)<\hat\pi_{22}(1).π21​(zN)=π^22​(zN)andπ21​(1)<π^22​(1).

At the two ends of the range of bbb, firm 2's two pricing options compare in opposite ways: at b=zNb=z^Nb=zN they tie, and at b=1b=1b=1 (all of firm 2's base shared) competing for [z′,zN][z',z^N][z′,zN] is strictly better. So an interval satisfying firm 2's incentive constraint (IC), if one exists, has b<1b<1b<1.

Preamble
import Mathlib
import Definitions.Def_SoftenDataShare_Mutual_MHRDist
import Definitions.Def_SoftenDataShare_Mutual_Model
Formal statement
namespace SoftenDataShare.Mutual

theorem pi22_boundary {F f : ℝ → ℝ} {zN : ℝ} (hF : MHRDist F f)
    (hzN : IsZN F f zN) :
    pi21 F zN = pi22 F zN zN ∧ pi21 F 1 < pi22 F zN 1 := by sorry

end SoftenDataShare.Mutual
Source
Choe, Cong & Wang, Softening Competition through Unilateral Sharing of Customer Data, Monash Discussion Paper 2021-10 (rev. Oct. 20, 2022), p. 35, proof of Proposition 1
Human review
  • Endorsed by Shuze Chen · Oct 16, 2026

    Confirmed by the moderator at approval.

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