Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Proposition 3, PDF p. 49 — Π^(0)_C < Π^(BC)_C on Ω^(BC)_1, = on Ω^(BC)_2 and for (1−α)/2 < k < 1−2α

Proved
EndogMerger.SymLoyal.firmC_indep_vs_small

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

capacityequilibrium-structuremergerp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1price-competition

Let 0<α<1/30<\alpha<1/30<α<1/3, α<k<1−2α\alpha<k<1-2\alphaα<k<1−2α and r>0r>0r>0. Firm CCC's Table A1 profit without merger, ΠC(0)\Pi^{(0)}_CΠC(0)​, and in the small merger, ΠC(BC)=Π(BC)/2\Pi^{(BC)}_C=\Pi^{(BC)}/2ΠC(BC)​=Π(BC)/2, satisfy

  1. on Ω1(BC)\Omega^{(BC)}_1Ω1(BC)​: ΠC(0)<ΠC(BC)\Pi^{(0)}_C<\Pi^{(BC)}_CΠC(0)​<ΠC(BC)​;
  2. on Ω2(BC)\Omega^{(BC)}_2Ω2(BC)​: ΠC(0)=ΠC(BC)\Pi^{(0)}_C=\Pi^{(BC)}_CΠC(0)​=ΠC(BC)​;
  3. if (1−α)/2<k(1-\alpha)/2<k(1−α)/2<k:
ΠC(0)=ΠC(BC)=rα.\Pi^{(0)}_C=\Pi^{(BC)}_C=r\alpha .ΠC(0)​=ΠC(BC)​=rα.

So condition (2a), a small firm's gain from the small merger, holds only on Ω1(BC)\Omega^{(BC)}_1Ω1(BC)​.

Preamble
import Mathlib
import Definitions.Def_EndogMerger_SymLoyal_Setting
import Definitions.Def_EndogMerger_SymLoyal_Regions
Formal statement
namespace EndogMerger.SymLoyal
theorem firmC_indep_vs_small (α k r : ℝ) (hα0 : 0 < α) (hα3 : α < 1 / 3) (hαk : α < k)
    (hk : k < 1 - 2 * α) (hr : 0 < r) :
    (OmegaBC₁ α k → piIndepB α k r < piBCB α k r) ∧
    (OmegaBC₂ α k → piIndepB α k r = piBCB α k r) ∧
    ((1 - α) / 2 < k → piIndepB α k r = piBCB α k 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, Appendix H, proof of Proposition 3, PDF p. 49
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