Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Proposition 2, pp. 36–37 — μ̄ > max{v − c, 1/(2k)}, and for μ > v − c the k-thresholds are equivalent to 1/(2k) ≤ μ ≤ μ̄ and μ ≥ μ̄

Proved
MarketplaceLeakage.Benefits.muBar_facts

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

comparative-staticsleakagep2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1platforms

Let c<vc < vc<v and k>0k > 0k>0, and let

μˉ=v−c2+14k+(v−c2)2+116k2.\bar\mu = \frac{v-c}{2} + \frac{1}{4k} + \sqrt{\Bigl(\frac{v-c}{2}\Bigr)^2 + \frac{1}{16k^2}} .μˉ​=2v−c​+4k1​+(2v−c​)2+16k21​​.

Then μˉ>max⁡{v−c, 1/(2k)}\bar\mu > \max\{v - c,\ 1/(2k)\}μˉ​>max{v−c, 1/(2k)}, and for every μ>v−c\mu > v - cμ>v−c:

  1. 12μ≤k≤2μ−(v−c)4μ(μ−(v−c))\dfrac{1}{2\mu} \le k \le \dfrac{2\mu - (v-c)}{4\mu(\mu - (v-c))}2μ1​≤k≤4μ(μ−(v−c))2μ−(v−c)​ if and only if 12k≤μ≤μˉ\dfrac{1}{2k} \le \mu \le \bar\mu2k1​≤μ≤μˉ​;
  2. k≥2μ−(v−c)4μ(μ−(v−c))k \ge \dfrac{2\mu - (v-c)}{4\mu(\mu - (v-c))}k≥4μ(μ−(v−c))2μ−(v−c)​ if and only if μ≥μˉ\mu \ge \bar\muμ≥μˉ​.

These equivalences translate the thresholds on the investment cost kkk found for fixed μ\muμ into thresholds on the switching-cost scale μ\muμ for fixed kkk, which is the form in which Proposition 2 is stated.

Formalization Note The restriction μ>v−c\mu > v - cμ>v−c is the paper's ("If μ>(v−c)\mu > (v-c)μ>(v−c)"); it keeps the denominator 4μ(μ−(v−c))4\mu(\mu - (v-c))4μ(μ−(v−c)) positive.

Preamble
import Mathlib
import Definitions.Def_MarketplaceLeakage_Benefits_Setting
Formal statement
namespace MarketplaceLeakage.Benefits

/-- Proof of Proposition 2, pp. 36–37: `μ̄ > max{v − c, 1/(2k)}`, and for `μ > v − c`,
`1/(2μ) ≤ k ≤ (2μ − (v − c))/(4μ(μ − (v − c)))` is equivalent to `1/(2k) ≤ μ ≤ μ̄`, while
`k ≥ (2μ − (v − c))/(4μ(μ − (v − c)))` is equivalent to `μ ≥ μ̄`. -/
theorem muBar_facts (v c k : ℝ) (hvc : c < v) (hk : 0 < k) :
    max (v - c) (1 / (2 * k)) < muBar v c k ∧
      ∀ μ : ℝ, v - c < μ →
        ((1 / (2 * μ) ≤ k ∧ k ≤ (2 * μ - (v - c)) / (4 * μ * (μ - (v - c)))) ↔
            (1 / (2 * k) ≤ μ ∧ μ ≤ muBar v c k)) ∧
        ((2 * μ - (v - c)) / (4 * μ * (μ - (v - c))) ≤ k ↔ muBar v c k ≤ μ) := by sorry

end MarketplaceLeakage.Benefits
Source
Hagiu, Wright, Marketplace Leakage, authors' manuscript dated March 2023 (sha256 cb89c…98a6; published in Management Science, doi:10.1287/mnsc.2023.4757), pp. 36–37, §8.3, Proof of Proposition 2 (definition of μ̄ and μ̄ > max{v − c, 1/(2k)})
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