Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 4, PDF p. 15 — in {A,BC}, L^(BC) = r(α+s₃)/(1−2α), rα/k, 2rα/(1−α) on Ω^(BC)_1, Ω^(BC)_2, Ω^(BC)_3

Proved
EndogMerger.SymLoyal.lemma_4

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

capacityloyal-customersmergerp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1price-competition

Consider the small merger structure {A,BC}\{A,BC\}{A,BC} with 0<α<1/30<\alpha<1/30<α<1/3, α<k<1−2α\alpha<k<1-2\alphaα<k<1−2α and r>0r>0r>0, and let L(BC)L^{(BC)}L(BC), ΠA(BC)\Pi^{(BC)}_AΠA(BC)​, Π(BC)\Pi^{(BC)}Π(BC) be the Table A1 lower bound of price support, firm AAA profit and merged-entity profit. With s3=(1−3α)(1−2k/(1−α))s_3=(1-3\alpha)(1-2k/(1-\alpha))s3​=(1−3α)(1−2k/(1−α)):

  1. on Ω1(BC)\Omega^{(BC)}_1Ω1(BC)​:
L(BC)=r(α+s3)1−2α,ΠA(BC)=r(α+s3),Π(BC)=2r(α+s3)k1−2α;L^{(BC)}=\frac{r(\alpha+s_3)}{1-2\alpha},\quad \Pi^{(BC)}_A=r(\alpha+s_3),\quad \Pi^{(BC)}=\frac{2r(\alpha+s_3)k}{1-2\alpha};L(BC)=1−2αr(α+s3​)​,ΠA(BC)​=r(α+s3​),Π(BC)=1−2α2r(α+s3​)k​;
  1. on Ω2(BC)\Omega^{(BC)}_2Ω2(BC)​: L(BC)=rα/kL^{(BC)}=r\alpha/kL(BC)=rα/k, ΠA(BC)=rα(1−2α)/k\Pi^{(BC)}_A=r\alpha(1-2\alpha)/kΠA(BC)​=rα(1−2α)/k, Π(BC)=2rα\Pi^{(BC)}=2r\alphaΠ(BC)=2rα;
  2. on Ω3(BC)\Omega^{(BC)}_3Ω3(BC)​: L(BC)=2rα/(1−α)L^{(BC)}=2r\alpha/(1-\alpha)L(BC)=2rα/(1−α), ΠA(BC)=2rα(1−2α)/(1−α)\Pi^{(BC)}_A=2r\alpha(1-2\alpha)/(1-\alpha)ΠA(BC)​=2rα(1−2α)/(1−α), Π(BC)=2rα\Pi^{(BC)}=2r\alphaΠ(BC)=2rα.

The lemma resolves the maximum in Table A1's small-merger column; region Ω1(BC)\Omega^{(BC)}_1Ω1(BC)​ is the only place where a small firm gains from the small merger.

Formalization Note 0<α0<\alpha0<α and r>0r>0r>0 are added as in Lemma 5. α1(BC)=(11−17)/52\alpha^{(BC)}_1=(11-\sqrt{17})/52α1(BC)​=(11−17​)/52 is the closed form from the proof of Lemma 4. Part 1 implicitly contains k2(BC)(α)<(1−2α)2/(2−5α)k^{(BC)}_2(\alpha)<(1-2\alpha)^2/(2-5\alpha)k2(BC)​(α)<(1−2α)2/(2−5α) on 0<α<α1(BC)0<\alpha<\alpha^{(BC)}_10<α<α1(BC)​, so that Ω1(BC)\Omega^{(BC)}_1Ω1(BC)​ lies in Table A1's first row.

Preamble
import Mathlib
import Definitions.Def_EndogMerger_SymLoyal_Setting
import Definitions.Def_EndogMerger_SymLoyal_Regions
Formal statement
namespace EndogMerger.SymLoyal
theorem lemma_4 (α k r : ℝ) (hα0 : 0 < α) (hα3 : α < 1 / 3) (hαk : α < k)
    (hk : k < 1 - 2 * α) (hr : 0 < r) :
    (OmegaBC₁ α k →
      LBC α k r = r * (α + s3 α k) / (1 - 2 * α) ∧
      piBCA α k r = r * (α + s3 α k) ∧
      piBC α k r = 2 * r * (α + s3 α k) * k / (1 - 2 * α)) ∧
    (OmegaBC₂ α k →
      LBC α k r = r * α / k ∧
      piBCA α k r = r * α * (1 - 2 * α) / k ∧
      piBC α k r = 2 * r * α) ∧
    (OmegaBC₃ α k →
      LBC α k r = 2 * r * α / (1 - α) ∧
      piBCA α k r = 2 * r * α * (1 - 2 * α) / (1 - α) ∧
      piBC α k r = 2 * r * α) := by sorry
end EndogMerger.SymLoyal
Source
Wang, Wu, Tang & Dai, Endogenous merger decisions among competitors: impact of limited capacity and loyal segments, Management Science (2024), accepted manuscript, PDF p. 15, Lemma 4 and footnote 13; proof PDF p. 47
Human review
  • Endorsed by Shuze Chen · Oct 14, 2026

    Confirmed by the moderator at approval.

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