Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§3.3 Benchmark, p. 11 — transparent selling earns at most 2·max{vH − cH, vL − cL}, attained at pH = vH or pL = vL

Proved
DynOpaque.TwoPeriod.benchmark_transparent

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

opaque-sellingp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1transparent-selling

Assume vH>vLv_H>v_LvH​>vL​, cH>cLc_H>c_LcH​>cL​, 0≤α≤10\le\alpha\le10≤α≤1, cL≤vLc_L\le v_LcL​≤vL​. A transparent policy sells one version m∈{H,L}m\in\{H,L\}m∈{H,L} in both periods at prices q1,q2q_1,q_2q1​,q2​; customers buy in period ttt iff qt≤vmq_t\le v_mqt​≤vm​. Then:

  1. every transparent policy earns at most
2max⁡{vH−cH, vL−cL};2\max\{v_H-c_H,\ v_L-c_L\};2max{vH​−cH​, vL​−cL​};
  1. selling HHH at price vHv_HvH​ in both periods earns 2(vH−cH)2(v_H-c_H)2(vH​−cH​);
  2. selling LLL at price vLv_LvL​ in both periods earns 2(vL−cL)2(v_L-c_L)2(vL​−cL​).

Hence the optimal transparent policy sells HHH when vH−cH≥vL−cLv_H-c_H\ge v_L-c_LvH​−cH​≥vL​−cL​ and LLL when vL−cL≥vH−cHv_L-c_L\ge v_H-c_HvL​−cL​≥vH​−cH​. This is the benchmark against which the probabilistic selling policy is compared in Proposition 1.

Formalization Note The bound in item 1 uses cL≤vLc_L\le v_LcL​≤vL​ (so the bound is nonnegative, covering prices at which nobody buys).

Preamble
import Mathlib
import Definitions.Def_DynOpaque_TwoPeriod_Model
Formal statement
namespace DynOpaque.TwoPeriod

/-- §3.3 Benchmark, p. 11: every transparent policy earns at most
`2 max{vH − cH, vL − cL}`; selling `H` at `vH` in both periods earns `2(vH − cH)`, selling `L` at
`vL` in both periods earns `2(vL − cL)`. -/
theorem benchmark_transparent (vH vL cH cL α : ℝ) (hS : Standing vH vL cH cL α) :
    (∀ (m : Version) (q₁ q₂ : ℝ),
      transparentProfit vH vL cH cL m q₁ q₂ ≤ 2 * max (vH - cH) (vL - cL)) ∧
    transparentProfit vH vL cH cL Version.H vH vH = 2 * (vH - cH) ∧
    transparentProfit vH vL cH cL Version.L vL vL = 2 * (vL - cL) := by sorry

end DynOpaque.TwoPeriod
Source
Huang and Yin, Dynamic Probabilistic Selling When Customers Have Boundedly Rational Expectations, SSRN manuscript 3627927, p. 11, §3.3 Benchmark
Human review
  • Endorsed by Shuze Chen · Oct 19, 2026

    Confirmed by the moderator at approval.

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