Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 4 (corrected), p. 12 — at p1 = vL, p2 = vHL some optimum has ξ1 ∈ {0, 1}, dominated by (3) or (4)

Proved
DynOpaque.TwoPeriod.lemma_4_corrected

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 (5), the profit at p1=vLp_1=v_Lp1​=vL​, p2=vHLp_2=v_{HL}p2​=vHL​, together with objectives (3) and (4). This is a corrected version of Lemma 4:

  1. (i′) for every (ξ1,ξ2)∈[0,1]2(\xi_1,\xi_2)\in[0,1]^2(ξ1​,ξ2​)∈[0,1]2 there is (ξ1′,ξ2′)∈[0,1]2(\xi_1',\xi_2')\in[0,1]^2(ξ1′​,ξ2′​)∈[0,1]2 with ξ1′∈{0,1}\xi_1'\in\{0,1\}ξ1′​∈{0,1} and
Π(ξ1,ξ2∣vL,vHL)≤Π(ξ1′,ξ2′∣vL,vHL);\Pi(\xi_1,\xi_2\mid v_L,v_{HL})\le\Pi(\xi_1',\xi_2'\mid v_L,v_{HL});Π(ξ1​,ξ2​∣vL​,vHL​)≤Π(ξ1′​,ξ2′​∣vL​,vHL​);
  1. (ii) for every ξ2∈[0,1]\xi_2\in[0,1]ξ2​∈[0,1], Π(1,ξ2∣vL,vHL)≤Π(1,ξ2∣vHL,vHL)\Pi(1,\xi_2\mid v_L,v_{HL})\le\Pi(1,\xi_2\mid v_{HL},v_{HL})Π(1,ξ2​∣vL​,vHL​)≤Π(1,ξ2​∣vHL​,vHL​);
  2. (iii) for every ξ2∈[0,1]\xi_2\in[0,1]ξ2​∈[0,1] there is (ξ1′,ξ2′)∈[0,1]2(\xi_1',\xi_2')\in[0,1]^2(ξ1′​,ξ2′​)∈[0,1]2 with Π(0,ξ2∣vL,vHL)≤Π(ξ1′,ξ2′∣vHL,vL)\Pi(0,\xi_2\mid v_L,v_{HL})\le\Pi(\xi_1',\xi_2'\mid v_{HL},v_L)Π(0,ξ2​∣vL​,vHL​)≤Π(ξ1′​,ξ2′​∣vHL​,vL​).

Together, the price pair (vL,vHL)(v_L,v_{HL})(vL​,vHL​) is never needed: its best value is matched by (vHL,vHL)(v_{HL},v_{HL})(vHL​,vHL​) or by (vHL,vL)(v_{HL},v_L)(vHL​,vL​).

Formalization Note Part (i) as printed, "ξ1=1\xi_1=1ξ1​=1 or ξ2=0\xi_2=0ξ2​=0 is optimal", is false: at α=0\alpha=0α=0, cL=0c_L=0cL​=0, cH=1c_H=1cH​=1, vL=1v_L=1vL​=1, vH=3/2v_H=3/2vH​=3/2, objective (5) equals 1−ξ1+ξ2(5/4−ξ2)1-\xi_1+\xi_2(5/4-\xi_2)1−ξ1​+ξ2​(5/4−ξ2​), whose maximum 89/6489/6489/64 over [0,1]2[0,1]^2[0,1]2 is attained only at (0,5/8)(0,5/8)(0,5/8). Parts (ii) and (iii) of the page treat exactly the cases ξ1=1\xi_1=1ξ1​=1 and ξ1=0\xi_1=0ξ1​=0, which shows the intended claim: (5) is affine in ξ1\xi_1ξ1​, so some optimum has ξ1∈{0,1}\xi_1\in\{0,1\}ξ1​∈{0,1}. Part (i′) states that claim; (ii) and (iii) are as printed, with "dominated" read as a weak inequality against some decision of the other case.

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

/-- Lemma 4, p. 12, CORRECTED (`p₁ = vL`, `p₂ = vHL`, objective (5)). Part (i) as printed
("ξ₁ = 1 or ξ₂ = 0 is optimal") is false; the corrected (i′) says that some optimal decision has
`ξ₁ ∈ {0, 1}`, in the form: every offering pair is weakly beaten by one with `ξ₁ ∈ {0, 1}`.
(ii) with `ξ₁ = 1`, (5) is dominated by (3); (iii) with `ξ₁ = 0`, (5) is dominated by (4). -/
theorem lemma_4_corrected (vH vL cH cL α : ℝ) (hS : Standing vH vL cH cL α) :
    (∀ x ∈ box, ∃ y ∈ box, (y.1 = 0 ∨ y.1 = 1) ∧
      obj5 vH vL cH cL α x.1 x.2 ≤ obj5 vH vL cH cL α y.1 y.2) ∧
    (∀ ξ₂ ∈ Set.Icc (0 : ℝ) 1, obj5 vH vL cH cL α 1 ξ₂ ≤ obj3 vH vL cH cL α 1 ξ₂) ∧
    (∀ ξ₂ ∈ Set.Icc (0 : ℝ) 1, ∃ y ∈ box, obj5 vH vL cH cL α 0 ξ₂ ≤ obj4 vH vL cH cL y.1 y.2) := by sorry

end DynOpaque.TwoPeriod
Source
Huang and Yin, Dynamic Probabilistic Selling When Customers Have Boundedly Rational Expectations, SSRN manuscript 3627927, p. 12, Lemma 4 (part (i) corrected)
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