Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

p. 15 — under a ban the seller prefers the high-price option iff f > (1 − (2 − q)η)qv/(1 − η) − c

Proved
MarketplaceLeakage.Communication.s_option_choice

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

communication-banleakagep2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1platforms

Under a ban on buyer–seller communication, the seller compares two on-platform prices. At pm=vp_m=vpm​=v it sells to the fraction ηq\eta qηq of buyers who learn that they value the product at vvv, earning ηq (v−c−f)\eta q\,(v-c-f)ηq(v−c−f); at pm=qvp_m=qvpm​=qv it also sells to the 1−η1-\eta1−η uninformed buyers, earning (1−η+ηq)(qv−c−f)(1-\eta+\eta q)(qv-c-f)(1−η+ηq)(qv−c−f).

Let c<vc<vc<v, 0<q<10<q<10<q<1 and 0≤η<10\le\eta<10≤η<1. For every fee fff, the high-price option pays strictly more than the low-price option if and only if

f>(1−(2−q)η) qv1−η−c.f>\frac{(1-(2-q)\eta)\,qv}{1-\eta}-c .f>1−η(1−(2−q)η)qv​−c.

Otherwise the seller chooses the low-price option.

This threshold determines which option the marketplace induces with its fee, and is the basis of the computation of the marketplace's profit under a ban.

Formalization Note. The statement excludes η=1\eta=1η=1, where the threshold divides by zero; there the comparison does not depend on fff.

Preamble
import Mathlib
import Definitions.Def_MarketplaceLeakage_Communication_Setting
Formal statement
namespace MarketplaceLeakage.Communication

theorem s_option_choice (v c : ℝ) (hvc : c < v) (q η f : ℝ) (hq0 : 0 < q) (hq1 : q < 1)
    (hη0 : 0 ≤ η) (hη1 : η < 1) :
    lowPay v c q η f < highPay v c q η f ↔ (1 - (2 - q) * η) * q * v / (1 - η) - c < f := by sorry

end MarketplaceLeakage.Communication
Source
Hagiu, Wright, Marketplace Leakage, authors' manuscript dated March 2023 (sha256 cb89c…98a6; published in Management Science, doi:10.1287/mnsc.2023.4757), p. 15, §5.2, display after "Thus, S prefers the first (high-price) option"
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 paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me