Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 1 with (1) and Property 1, pp. 5–6 — T enters exactly the products v ≥ v_T = c/(1 − f)

Proved
RetailerMarketplace.Entry.lemma_1

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

marketplacep2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1product-entry

Let c>0c>0c>0, f∈[0,1)f\in[0,1)f∈[0,1), λ∈[0,1]\lambda\in[0,1]λ∈[0,1] and v∈Rv\in\mathbb Rv∈R, and let vT=c/(1−f)v_T=c/(1-f)vT​=c/(1−f) as in (1). Then

  1. TTT's monopoly profit is nonnegative exactly above the threshold: πTSBT(v)=(1−f)v−c≥0  ⟺  v≥vT\pi_T^{SBT}(v)=(1-f)v-c\ge 0\iff v\ge v_TπTSBT​(v)=(1−f)v−c≥0⟺v≥vT​;
  2. if 0<λ<10<\lambda<10<λ<1, the same holds for her duopoly profit: πTSBMT(v)≥0  ⟺  v≥vT\pi_T^{SBMT}(v)\ge 0\iff v\ge v_TπTSBMT​(v)≥0⟺v≥vT​;
  3. at v=vTv=v_Tv=vT​ her duopoly price equals the threshold: pˉT(vT)=vT\bar p_T(v_T)=v_Tpˉ​T​(vT​)=vT​;
  4. the products TTT enters, those with v(1−f)≥cv(1-f)\ge cv(1−f)≥c, are exactly those with v≥vTv\ge v_Tv≥vT​:
v(1−f)≥c  ⟺  v≥vT=c1−f.v(1-f)\ge c\iff v\ge v_T=\frac{c}{1-f}.v(1−f)≥c⟺v≥vT​=1−fc​.

This is Lemma 1 together with Property 1 (no entry deterrence): TTT's entry decision does not depend on whether MMM enters.

Formalization Note The duopoly clause is stated for 0<λ<10<\lambda<10<λ<1: at λ=1\lambda=1λ=1 (and at λ=0\lambda=0λ=0) πTSBMT≡0\pi_T^{SBMT}\equiv 0πTSBMT​≡0, so "πTSBMT≥0\pi_T^{SBMT}\ge 0πTSBMT​≥0 iff v≥vTv\ge v_Tv≥vT​" fails below vTv_TvT​. Entry at zero profit (at v=vTv=v_Tv=vT​) follows the paper's convention v≥vTv\ge v_Tv≥vT​. Assumption 1 is not needed and not assumed.

Preamble
import Mathlib
import Definitions.Def_RetailerMarketplace_Entry_Model
Formal statement
namespace RetailerMarketplace.Entry

/-- Lemma 1 with (1) and Property 1: T's monopoly profit is nonnegative exactly on `v ≥ v_T`; for
`0 < λ < 1` so is her duopoly profit; at `v = v_T` T's duopoly price equals `v_T`; and the products
T enters, `v(1 - f) ≥ c`, are exactly those with `v ≥ v_T = c/(1 - f)`. -/
theorem lemma_1 (c f lam v : ℝ) (hc : 0 < c) (hf : f ∈ Set.Ico (0 : ℝ) 1)
    (hlam : lam ∈ Set.Icc (0 : ℝ) 1) :
    (0 ≤ piSBT_T c f v ↔ vT c f ≤ v) ∧
      (0 < lam → lam < 1 → (0 ≤ piSBMT_T c f lam v ↔ vT c f ≤ v)) ∧
      pbarT c f lam (vT c f) = vT c f ∧
      (v ∈ mp c f ↔ vT c f ≤ v) := by sorry

end RetailerMarketplace.Entry
Source
Hervas-Drane & Shelegia, Retailer-Led Marketplaces, Management Science (2025), Articles in Advance, doi:10.1287/mnsc.2023.00315, p. 6 (PDF p. 8), display (1) and Lemma 1; p. 5 (PDF p. 7), Property 1
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