Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Claim after eq. (6), p. 13 — at p1 = p2 = vL the optimal decisions are ξ1 = ξ2 = 0, earning 2(vL − cL)

Proved
DynOpaque.TwoPeriod.eq_6_optimal

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

opaque-sellingp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1probabilistic-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​, and consider objective (6), the profit at p1=p2=vLp_1=p_2=v_Lp1​=p2​=vL​,

Π(ξ1,ξ2∣vL,vL)=[vL−ξ1cH−(1−ξ1)cL]+[vL−ξ2cH−(1−ξ2)cL].\Pi(\xi_1,\xi_2\mid v_L,v_L)=[v_L-\xi_1c_H-(1-\xi_1)c_L]+[v_L-\xi_2c_H-(1-\xi_2)c_L].Π(ξ1​,ξ2​∣vL​,vL​)=[vL​−ξ1​cH​−(1−ξ1​)cL​]+[vL​−ξ2​cH​−(1−ξ2​)cL​].

Then (ξ1,ξ2)=(0,0)(\xi_1,\xi_2)=(0,0)(ξ1​,ξ2​)=(0,0) maximizes (6) over [0,1]2[0,1]^2[0,1]2, and its value is 2(vL−cL)2(v_L-c_L)2(vL​−cL​).

At the low price everyone buys in both periods, so delivering the expensive version is pure cost: the firm sells LLL transparently.

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

/-- Claim after display (6), p. 13: with `p₁ = p₂ = vL` the optimal offering decisions are
`ξ₁ = ξ₂ = 0`, i.e. transparent selling of product `L`, earning `2(vL − cL)`. -/
theorem eq_6_optimal (vH vL cH cL α : ℝ) (hS : Standing vH vL cH cL α) :
    IsOptimalOffering (obj6 vL cH cL) 0 0 ∧ obj6 vL cH cL 0 0 = 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. 13, claim after eq. (6)
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