Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

(5), p. 9 — the marketplace's profit at fee f ≥ 0 is f(1 − f/(2μ)) if f ≤ 2μ and 0 if f ≥ 2μ

Proved
MarketplaceLeakage.Baseline.eq_5

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

leakagep2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1platforms

In the baseline leakage game (value vvv, cost c<vc<vc<v, switching costs uniform on [0,μ][0,\mu][0,μ], μ>0\mu>0μ>0), let f≥0f\ge0f≥0 be a fee and let pdp_dpd​ be a seller-optimal direct price at fff. Then the marketplace's profit Π=f (1−G(v−pd))\Pi=f\,(1-G(v-p_d))Π=f(1−G(v−pd​)) equals

Π(f)={0if f≥2μ,f(1−f2μ)if f≤2μ.\Pi(f)=\begin{cases}0 & \text{if } f\ge 2\mu,\\ f\Bigl(1-\dfrac{f}{2\mu}\Bigr) & \text{if } f\le 2\mu.\end{cases}Π(f)=⎩⎨⎧​0f(1−2μf​)​if f≥2μ,if f≤2μ.​

This reduces the marketplace's problem to a one-dimensional maximization: at fees of 2μ2\mu2μ or more every buyer leaks to the direct channel and the marketplace earns nothing, and below 2μ2\mu2μ it keeps a share 1−f/(2μ)1-f/(2\mu)1−f/(2μ) of transactions.

Formalization Note. As with (4), the statement is posed for f≥0f\ge 0f≥0 rather than under the page's "Assuming f≤v−cf\le v-cf≤v−c". The two branches agree at f=2μf=2\muf=2μ. The standing assumption c<vc<vc<v is kept as a hypothesis.

Preamble
import Mathlib
import Definitions.Def_MarketplaceLeakage_Baseline_Setting
Formal statement
namespace MarketplaceLeakage.Baseline

/-- (5), p. 9: for `μ > 0`, a fee `f ≥ 0` and an optimal direct price `pd` of the seller at
`f`, the marketplace's profit is `0` if `f ≥ 2μ` and `f (1 − f/(2μ))` if `f ≤ 2μ`. -/
theorem eq_5 (v c μ : ℝ) (hvc : c < v) (hμ : 0 < μ) (f pd : ℝ) (hf : 0 ≤ f)
    (hpd : IsSOpt v c μ f pd) :
    MProfit v μ f pd = (if 2 * μ ≤ f then 0 else f * (1 - f / (2 * μ))) := by sorry

end MarketplaceLeakage.Baseline
Source
Hagiu, Wright, Marketplace Leakage, authors' manuscript dated March 2023 (sha256 cb89cc00…3c98a6; published in Management Science, doi:10.1287/mnsc.2023.4757), p. 9, display (5)
Human review
  • Endorsed by Shuze Chen · Oct 15, 2026

    Confirmed by the moderator at approval.

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