Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 5, PDF p. 16 — in {AB,C}, L^(AB) = r(2α+s₁)/(1−α) on Ω^(AB)_1 and rα/k on Ω^(AB)_2

Proved
EndogMerger.SymLoyal.lemma_5

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

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

Consider the mixed merger structure {AB,C}\{AB,C\}{AB,C} 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(AB)L^{(AB)}L(AB), Π(AB)\Pi^{(AB)}Π(AB), ΠC(AB)\Pi^{(AB)}_CΠC(AB)​ be the Table A1 lower bound of price support, merged-entity profit and firm CCC profit.

  1. If (α,k)∈Ω1(AB)(\alpha,k)\in\Omega^{(AB)}_1(α,k)∈Ω1(AB)​, i.e. k1(AB)(α)≤k<1−2αk^{(AB)}_1(\alpha)\le k<1-2\alphak1(AB)​(α)≤k<1−2α, then
L(AB)=r(2α+s1)1−α,Π(AB)=r(2α+s1),ΠC(AB)=r(2α+s1)k1−α.L^{(AB)}=\frac{r(2\alpha+s_1)}{1-\alpha},\qquad \Pi^{(AB)}=r(2\alpha+s_1),\qquad \Pi^{(AB)}_C=\frac{r(2\alpha+s_1)k}{1-\alpha}.L(AB)=1−αr(2α+s1​)​,Π(AB)=r(2α+s1​),ΠC(AB)​=1−αr(2α+s1​)k​.
  1. If (α,k)∈Ω2(AB)(\alpha,k)\in\Omega^{(AB)}_2(α,k)∈Ω2(AB)​, i.e. α<k<k1(AB)(α)\alpha<k<k^{(AB)}_1(\alpha)α<k<k1(AB)​(α), then
L(AB)=rαk,Π(AB)=rα(1−α)k,ΠC(AB)=rα.L^{(AB)}=\frac{r\alpha}{k},\qquad \Pi^{(AB)}=\frac{r\alpha(1-\alpha)}{k},\qquad \Pi^{(AB)}_C=r\alpha.L(AB)=krα​,Π(AB)=krα(1−α)​,ΠC(AB)​=rα.

The lemma resolves the maximum in Table A1's mixed-merger column, telling which entity is more pricing aggressive; the proof of Proposition 3 uses it for every comparison involving firm CCC.

Formalization Note The hypotheses 0<α0<\alpha0<α (the paper allows α=0\alpha=0α=0 in the model but every region requires α>0\alpha>0α>0) and r>0r>0r>0 (implicit: rrr is the reservation value) are added. The Table A1 quantities are defined from the table itself, not from these closed forms.

Preamble
import Mathlib
import Definitions.Def_EndogMerger_SymLoyal_Setting
import Definitions.Def_EndogMerger_SymLoyal_Regions
Formal statement
namespace EndogMerger.SymLoyal
theorem lemma_5 (α k r : ℝ) (hα0 : 0 < α) (hα3 : α < 1 / 3) (hαk : α < k)
    (hk : k < 1 - 2 * α) (hr : 0 < r) :
    (OmegaAB₁ α k →
      LAB α k r = r * (2 * α + s1 α k) / (1 - α) ∧
      piAB α k r = r * (2 * α + s1 α k) ∧
      piABC α k r = r * (2 * α + s1 α k) * k / (1 - α)) ∧
    (OmegaAB₂ α k →
      LAB α k r = r * α / k ∧
      piAB α k r = r * α * (1 - α) / k ∧
      piABC α k r = 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. 16, Lemma 5 and footnote 14; 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