Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 1 (lim π∗ = −∞ < π∗N > 0), p. 12 — high-quality free experiences drive the optimal profit to −∞

Proved
ExpRetail.Monopoly.theorem_1_limit

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

experiential-retailmultivariate-logitp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1pricing

Consider the monopoly model of §3.1 under the standing assumptions t>0t>0t>0, η>0\eta>0η>0, s>0s>0s>0, λ>0\lambda>0λ>0. Let π∗(ux)=sup⁡pπ(p)\pi^*(u^x)=\sup_p\pi(p)π∗(ux)=supp​π(p) be the optimal profit (4) with a free experience of quality uxu^xux, and π∗N=sup⁡pπN(p)\pi^{*N}=\sup_p\pi^N(p)π∗N=supp​πN(p) the optimal profit (5) without one. Then

lim⁡ux→∞π∗(ux)=−∞andπ∗N>0.\lim_{u^x\to\infty}\pi^*(u^x)=-\infty\qquad\text{and}\qquad\pi^{*N}>0 .ux→∞lim​π∗(ux)=−∞andπ∗N>0.

A free experience of high enough quality makes the retailer strictly worse off than offering none: its cost η(ux)2\eta(u^x)^2η(ux)2, borne also by free riders, outgrows every gain in sales.

Formalization Note The paper's chain "lim⁡ux→∞π∗=−∞<π∗N>0\lim_{u^x\to\infty}\pi^*=-\infty<\pi^{*N}>0limux→∞​π∗=−∞<π∗N>0" is read as the two facts above; "−∞<π∗N-\infty<\pi^{*N}−∞<π∗N" holds automatically for a real number.

Preamble
import Mathlib
import Definitions.Def_ExpRetail_Monopoly_Model
Formal statement
namespace ExpRetail.Monopoly

theorem theorem_1_limit (P : Params) (hP : P.Standing) :
    Filter.Tendsto (optProfit P) Filter.atTop Filter.atBot ∧ 0 < optProfitN P := by sorry

end ExpRetail.Monopoly
Source
Mutlu, El-Amine & Sahin, Offering memories to sell goods?, SSRN working paper 4617261 (PDF of 2023-10-30), p. 12, Theorem 1 ("lim_{u^x→∞} π∗ = −∞ < π∗N > 0")
Human review
  • Endorsed by Shuze Chen · Oct 21, 2026

    Confirmed by the moderator at approval.

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