Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proposition 1, PDF p. 13 — with ample capacity k ≥ 1−2α, the independent structure {A,B,C} is the equilibrium structure

Proved
EndogMerger.SymLoyal.proposition_1

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

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

Let 0<α<1/30<\alpha<1/30<α<1/3, r>0r>0r>0, and suppose the small firms have ample capacity, 1−2α≤k<11-2\alpha\le k<11−2α≤k<1. Then, with the Table A1 profits and conditions (1a)–(2b), the independent structure is the unique equilibrium structure:

{S:S is an equilibrium structure}={{A,B,C}}.\{S : S \text{ is an equilibrium structure}\}=\bigl\{\{A,B,C\}\bigr\}.{S:S is an equilibrium structure}={{A,B,C}}.

This settles the ample-capacity case, which Proposition 3 includes in its "otherwise" clause.

Formalization Note The paper states the result for kA>k≥1−2αk_A>k\ge 1-2\alphakA​>k≥1−2α; Table A1's last row is [1−2α,1)[1-2\alpha,1)[1−2α,1), so k<1k<1k<1 is a hypothesis and kAk_AkA​ is not modelled. 0<α0<\alpha0<α and r>0r>0r>0 are added. "The equilibrium structure" is rendered as: the set of equilibrium structures is exactly the singleton, as the proof (PDF p. 46) says "unique".

Preamble
import Mathlib
import Definitions.Def_EndogMerger_SymLoyal_Setting
Formal statement
namespace EndogMerger.SymLoyal
theorem proposition_1 (α k r : ℝ) (hα0 : 0 < α) (hα3 : α < 1 / 3)
    (hk : 1 - 2 * α ≤ k) (hk1 : k < 1) (hr : 0 < r) :
    {S | IsEquilibriumStructure α k r S} = {MarketStructure.indep} := 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. 13, Proposition 1; proof PDF p. 46
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