Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Proposition 1, p. 780 — (a^0t,a^1t)=(a0(0),a1(0))+(eˉt−pˉtCt/Vt, Ct/Vt)(\hat a_{0t}, \hat a_{1t}) = (a_0^{(0)}, a_1^{(0)}) + (\bar e_t - \bar p_t C_t/V_t,\ C_t/V_t)(a^0t​,a^1t​)=(a0(0)​,a1(0)​)+(eˉt​−pˉ​t​Ct​/Vt​, Ct​/Vt​)

Proved
CVPricing.CertEquiv.ls_representation

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

least-squaresp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1statistics

Let (pi)i≥1(p_i)_{i\ge1}(pi​)i≥1​ be prices with p1≠p2p_1 \ne p_2p1​=p2​, let (ei)i≥1(e_i)_{i\ge1}(ei​)i≥1​ be noise values, and let di=a0+a1pi+eid_i = a_0 + a_1 p_i + e_idi​=a0​+a1​pi​+ei​. For every t≥2t \ge 2t≥2, the least squares estimates (a^0t,a^1t)(\hat a_{0t}, \hat a_{1t})(a^0t​,a^1t​) computed from (pi,di)i≤t(p_i, d_i)_{i \le t}(pi​,di​)i≤t​ satisfy

(a^0ta^1t)=(a0a1)+(eˉt−pˉtCt/VtCt/Vt),\begin{pmatrix}\hat a_{0t}\\ \hat a_{1t}\end{pmatrix} = \begin{pmatrix} a_0\\ a_1\end{pmatrix} + \begin{pmatrix}\bar e_t - \bar p_t C_t / V_t \\ C_t / V_t\end{pmatrix},(a^0t​a^1t​​)=(a0​a1​​)+(eˉt​−pˉ​t​Ct​/Vt​Ct​/Vt​​),

where pˉt,eˉt\bar p_t, \bar e_tpˉ​t​,eˉt​ are the sample means, Ct=∑i=1t(pi−pˉt)eiC_t = \sum_{i=1}^t (p_i - \bar p_t)e_iCt​=∑i=1t​(pi​−pˉ​t​)ei​ and Vt=∑i=1t(pi−pˉt)2V_t = \sum_{i=1}^t (p_i - \bar p_t)^2Vt​=∑i=1t​(pi​−pˉ​t​)2.

This expresses the estimation error of ordinary least squares through the two scalar sums CtC_tCt​ and VtV_tVt​, which the proof of Proposition 1 then controls.

Formalization Note The paper states the representation in the case p3=⋯=pt=php_3 = \dots = p_t = p_hp3​=⋯=pt​=ph​ of its induction; it holds for every price sequence with p1≠p2p_1 \ne p_2p1​=p2​ (which makes Vt>0V_t > 0Vt​>0), and is stated in that generality. The estimate is the referenced lsEstimateOf, the solution of the normal equations (4).

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

open KeskinZeevi.SufficientConditions

theorem ls_representation (a₀ a₁ : ℝ) (p e : ℕ → ℝ) (hp : p 1 ≠ p 2) {t : ℕ} (ht : 2 ≤ t) :
    lsEstimateOf p (fun s => a₀ + a₁ * p s + e s) t =
      (a₀ + (avgPriceOf e t - avgPriceOf p t * crossSum p e t / infoMetricOf p t),
        a₁ + crossSum p e t / infoMetricOf p t) := 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 ≥ 3, the display of the least squares estimates
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