Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Eq. (13.2)-(13.4): mean, variance and autocovariance of the stationary AR(1) demand

Proved
SupplyChainTheory.ar1_moments

by naimengye · Sep 24, 2026 · Mathlib 0df444a (Lean v4.33.1)

bullwhip-effectoperations-researchprobabilitysupply-chaintime-series

For the stationary AR(1) demand process Dt=d+ρDt−1+ϵtD_t = d + \rho D_{t-1} + \epsilon_tDt​=d+ρDt−1​+ϵt​ with ϵt∼N(0,σ2)\epsilon_t \sim N(0, \sigma^2)ϵt​∼N(0,σ2) and −1<ρ<1-1 < \rho < 1−1<ρ<1, for every period ttt and every lag k≥0k \ge 0k≥0,

E[Dt]=d1−ρ,Var[Dt]=σ21−ρ2,Cov[Dt,Dt−k]=ρk Var[Dt].\mathbb{E}[D_t] = \frac{d}{1-\rho}, \qquad \mathrm{Var}[D_t] = \frac{\sigma^2}{1-\rho^2}, \qquad \mathrm{Cov}[D_t, D_{t-k}] = \rho^k\,\mathrm{Var}[D_t].E[Dt​]=1−ρd​,Var[Dt​]=1−ρ2σ2​,Cov[Dt​,Dt−k​]=ρkVar[Dt​].

The book remarks that ddd is not the mean unless ρ=0\rho = 0ρ=0, and that these are the steady-state values, the same in every period. The autocovariance is what produces the factor (1−ρm)(1 - \rho^m)(1−ρm) in Theorem 13.2: the two demands entering the order, Dt−1D_{t-1}Dt−1​ and Dt−m−1D_{t-m-1}Dt−m−1​, are mmm periods apart.

Preamble
import Definitions.Def_SupplyChainTheory_bullwhip
Formal statement
namespace SupplyChainTheory

theorem ar1_moments {Ω : Type*} [MeasurableSpace Ω] {P : MeasureTheory.Measure Ω}
    [MeasureTheory.IsProbabilityMeasure P] (X : AR1Demand P) (t : ℤ) (k : ℕ) :
    (∫ ω, X.D t ω ∂P) = X.d / (1 - X.rho)
      ∧ ProbabilityTheory.variance (X.D t) P = X.sigma ^ 2 / (1 - X.rho ^ 2)
      ∧ ProbabilityTheory.covariance (X.D t) (X.D (t - k)) P
          = X.rho ^ k * ProbabilityTheory.variance (X.D t) P := by sorry

end SupplyChainTheory
Source
Lawrence V. Snyder and Zuo-Jun Max Shen, Fundamentals of Supply Chain Theory, 2nd ed., Wiley 2019, DOI 10.1002/9781119584445, p. 543, Sect. 13.2.2, Eq. (13.2), (13.3), (13.4)
Human review
  • Endorsed by Shuze Chen · Sep 25, 2026

    Confirmed by the moderator at approval.

  • Endorsed by naimengye · Sep 25, 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