Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Proposition 1, p. 35 — z^N is the unique maximizer of π₂₁(z) = (2z − 1)(1 − F(z)) on [0, 1]

Proved
SoftenDataShare.Mutual.pi21_lt_pi21_zN

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

hotellingmonotone-hazard-ratep2o-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 let zNz^NzN be the benchmark marginal consumer of Eq. (1). Write π21(z)=(2z−1)(1−F(z))\pi_{21}(z)=(2z-1)(1-F(z))π21​(z)=(2z−1)(1−F(z)) for firm 2's profit when its uniform price 2z−12z-12z−1 serves exactly the consumers in [z,1][z,1][z,1]. Then for every z∈[0,1]z\in[0,1]z∈[0,1] with z≠zNz\neq z^Nz=zN,

π21(z)<π21(zN).\pi_{21}(z)<\pi_{21}(z^N).π21​(z)<π21​(zN).

In words, the benchmark price is firm 2's unique optimal uniform price: the first-order condition (1) identifies the global maximum. The proof of Proposition 1 uses this to compare firm 2's two pricing options after data sharing on [zN,b][z^N,b][zN,b].

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

theorem pi21_lt_pi21_zN {F f : ℝ → ℝ} {zN : ℝ} (hF : MHRDist F f)
    (hzN : IsZN F f zN) :
    ∀ z ∈ Set.Icc (0 : ℝ) 1, z ≠ zN → pi21 F z < pi21 F zN := 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; also p. 33, proof of Lemma 1, and footnote 14, p. 8
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