Proposition 2, PDF p. 18 — L^(AB) ≥ L^(BC) ≥ L^(0) for all α < k < 1
ProvedEndogMerger.SymLoyal.proposition_2capacitymergerp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1price-competition
Let , and . The Table A1 lower bounds of price support in the three structures satisfy
Mergers soften price competition: the lower bound of the price support is highest under the mixed merger and lowest without merger.
Formalization Note "For all ranges of " is rendered as , the range of Table A1. and are added.
Preamble
import Mathlib import Definitions.Def_EndogMerger_SymLoyal_Setting
Formal statement
namespace EndogMerger.SymLoyal
theorem proposition_2 (α k r : ℝ) (hα0 : 0 < α) (hα3 : α < 1 / 3) (hαk : α < k)
(hk1 : k < 1) (hr : 0 < r) :
L0 α k r ≤ LBC α k r ∧ LBC α k r ≤ LAB α 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, PDF p. 18, Proposition 2; proof PDF pp. 47–48
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.