Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Proposition 1, Case t = 2, p. 780 — the first line fit, and the first condition of AAA forces p3=php_3 = p_hp3​=ph​

Proved
CVPricing.CertEquiv.case_t_two

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

dynamic-pricingleast-squaresp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1

Consider the model of CVPricing.CertEquiv.Model, initial prices pl≤p1<p2≤php_l \le p_1 < p_2 \le p_hpl​≤p1​<p2​≤ph​ and any noise path (ei)(e_i)(ei​). The least squares line through the two observations (pi, a0(0)+a1(0)pi+ei)(p_i,\ a_0^{(0)} + a_1^{(0)}p_i + e_i)(pi​, a0(0)​+a1(0)​pi​+ei​), i=1,2i = 1, 2i=1,2, has slope and intercept

a^12=a1(0)+e2−e1p2−p1,a^02=a0(0)+e1p2−e2p1p2−p1.\hat a_{12} = a_1^{(0)} + \frac{e_2 - e_1}{p_2 - p_1}, \qquad \hat a_{02} = a_0^{(0)} + \frac{e_1 p_2 - e_2 p_1}{p_2 - p_1}.a^12​=a1(0)​+p2​−p1​e2​−e1​​,a^02​=a0(0)​+p2​−p1​e1​p2​−e2​p1​​.

Moreover, if

(p2−2ph)e1+(2ph−p1)e2 ≥ −a1(0)(p2−p1) 2ph,(p_2 - 2p_h)e_1 + (2p_h - p_1)e_2 \ \ge\ -a_1^{(0)}(p_2 - p_1)\,2p_h ,(p2​−2ph​)e1​+(2ph​−p1​)e2​ ≥ −a1(0)​(p2​−p1​)2ph​,

then the certainty equivalent price of period 3 is p3=php_3 = p_hp3​=ph​.

This is the base case of the induction showing that on the event AAA all prices from period 3 on equal php_hph​.

Formalization Note The paper prints the intercept as a^02=(e1p2−e2p1)(p2−p1)−1\hat a_{02} = (e_1p_2 - e_2p_1)(p_2 - p_1)^{-1}a^02​=(e1​p2​−e2​p1​)(p2​−p1​)−1, omitting a0(0)a_0^{(0)}a0(0)​; the line through the two points has the intercept stated here. With the correct intercept, p3=php_3 = p_hp3​=ph​ is equivalent to a0(0)(p2−p1)+(p2−2ph)e1+(2ph−p1)e2≥−a1(0)(p2−p1)2pha_0^{(0)}(p_2 - p_1) + (p_2 - 2p_h)e_1 + (2p_h - p_1)e_2 \ge -a_1^{(0)}(p_2 - p_1)2p_ha0(0)​(p2​−p1​)+(p2​−2ph​)e1​+(2ph​−p1​)e2​≥−a1(0)​(p2​−p1​)2ph​; since a0(0)(p2−p1)>0a_0^{(0)}(p_2 - p_1) > 0a0(0)​(p2​−p1​)>0, the printed condition is sufficient, which is the implication stated. The proof assumes p1<p2p_1 < p_2p1​<p2​ without loss of generality.

Preamble
import Mathlib
import Definitions.Def_CVPricing_CertEquiv_CEPrice
Formal statement
namespace CVPricing.CertEquiv

open KeskinZeevi.SufficientConditions

theorem case_t_two (M : Model) {p₁ p₂ : ℝ} (hp₁ : p₁ ∈ Set.Icc M.pl M.ph)
    (hp₂ : p₂ ∈ Set.Icc M.pl M.ph) (h12 : p₁ < p₂) (e : ℕ → ℝ) :
    lsEstimateOf (cePrice M p₁ p₂ e) (demandOf M (cePrice M p₁ p₂ e) e) 2 =
        (M.a₀ + (e 1 * p₂ - e 2 * p₁) / (p₂ - p₁), M.a₁ + (e 2 - e 1) / (p₂ - p₁)) ∧
      (-M.a₁ * (p₂ - p₁) * (2 * M.ph) ≤ (p₂ - 2 * M.ph) * e 1 + (2 * M.ph - p₁) * e 2 →
        cePrice M p₁ p₂ e 3 = M.ph) := by sorry

end CVPricing.CertEquiv
Source
den Boer, Zwart, Simultaneously Learning and Optimizing Using Controlled Variance Pricing, Management Science 60(3):770–783 (2014), p. 780 (PDF 12), Appendix, proof of Proposition 1, Case t = 2
Human review
  • Endorsed by Shuze Chen · Oct 5, 2026

    Confirmed by the moderator at approval.

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