Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Lemma B.1, p. 18 — SBT step: vf′ + t′ > vf* + t* iff v > v_T(f*, t*)

Proved
RetailerMarketplace.UnitFee.lemma_B_1_sbt_step

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

marketplacep2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1platform-feesunit-fee

Let c>0c>0c>0, f∗∈[0,1)f^*\in[0,1)f∗∈[0,1), 0<ε<t∗0<\varepsilon<t^*0<ε<t∗, and let (f′,t′)(f',t')(f′,t′) be the fees of the construction, t′=t∗−εt'=t^*-\varepsilont′=t∗−ε and f′=ε+f∗(c+t∗−ε)c+t∗f'=\frac{\varepsilon+f^*(c+t^*-\varepsilon)}{c+t^*}f′=c+t∗ε+f∗(c+t∗−ε)​. Then for every product valuation vvv, the monopolist's fee revenue in an SBT product market (where the third-party seller sells one unit at price vvv) is higher under (f′,t′)(f',t')(f′,t′) exactly above the entry threshold:

vf′+t′>vf∗+t∗  ⟺  v>vT(f∗,t∗)=c+t∗1−f∗.vf'+t'>vf^*+t^* \iff v>v_T(f^*,t^*)=\frac{c+t^*}{1-f^*}.vf′+t′>vf∗+t∗⟺v>vT​(f∗,t∗)=1−f∗c+t∗​.

This is the SBT step of the proof of Lemma B.1: on every product market served by the third-party seller alone, the switch of fees raises the monopolist's revenue.

Preamble
import Mathlib
import Definitions.Def_RetailerMarketplace_UnitFee_Model
Formal statement
namespace RetailerMarketplace.UnitFee

/-- Proof of Lemma B.1, p. 18 (SBT step): with the fees `(f', t')` of the construction, M's fee
revenue in an SBT product market rises, `v f' + t' > v f* + t*`, exactly when `v > v_T(f*, t*)`. -/
theorem lemma_B_1_sbt_step (c fs ts ε f' t' : ℝ) (hc : 0 < c)
    (hfs : fs ∈ Set.Ico (0 : ℝ) 1) (hε : 0 < ε) (hεts : ε < ts)
    (hf' : f' = (ε + fs * (c + ts - ε)) / (c + ts)) (ht' : t' = ts - ε) (v : ℝ) :
    v * f' + t' > v * fs + ts ↔ vT c fs ts < v := by sorry

end RetailerMarketplace.UnitFee
Source
Hervas-Drane & Shelegia, Retailer-Led Marketplaces, Management Science (2025), Articles in Advance, doi:10.1287/mnsc.2023.00315, p. 18 (PDF p. 20), Proof of Lemma B.1, second paragraph (SBT product markets)
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