Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Sect. 13.2.4.2: positively correlated ordering, Var[Qc]=Nσ2+μ2N2(R−1)\mathrm{Var}[Q^c] = N\sigma^2 + \mu^2N^2(R-1)Var[Qc]=Nσ2+μ2N2(R−1)

Proved
SupplyChainTheory.batch_correlated_ordering

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

bullwhip-effectoperations-researchprobabilitysupply-chain

In the extreme case in which all NNN retailers order on the same day of the RRR-period interval, the number of retailers ordering on a given day is X=NX = NX=N with probability 1/R1/R1/R and X=0X = 0X=0 otherwise, and the total order QtcQ^c_tQtc​ received by the supplier satisfies

E[Qtc]=Nμ,Var[Qtc]=Nσ2+μ2N2(R−1)  ≥  Nσ2.\mathbb{E}[Q^c_t] = N\mu, \qquad \mathrm{Var}[Q^c_t] = N\sigma^2 + \mu^2N^2(R-1) \;\ge\; N\sigma^2.E[Qtc​]=Nμ,Var[Qtc​]=Nσ2+μ2N2(R−1)≥Nσ2.

This is the "hockey stick" of MRP systems taken to its extreme, and it produces the largest variance of the three ordering patterns: the term μ2N2(R−1)\mu^2N^2(R-1)μ2N2(R−1) grows with the square of the number of retailers, against μ2N(R−1)\mu^2N(R-1)μ2N(R−1) under random ordering.

Preamble
import Definitions.Def_SupplyChainTheory_bullwhip
Formal statement
namespace SupplyChainTheory

theorem batch_correlated_ordering {Ω : Type*} [MeasurableSpace Ω] {P : MeasureTheory.Measure Ω}
    [MeasureTheory.IsProbabilityMeasure P] {N R : ℕ} {mu sigma : ℝ} (hR : 0 < R)
    (B : BatchOrders P N R mu sigma)
    (hX0 : P.real {ω | B.X ω = 0} = 1 - 1 / R) (hXN : P.real {ω | B.X ω = N} = 1 / R) :
    (∫ ω, B.supplierOrder ω ∂P) = N * mu
      ∧ ProbabilityTheory.variance B.supplierOrder P
          = N * sigma ^ 2 + mu ^ 2 * (N : ℝ) ^ 2 * (R - 1) := 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, pp. 549-550, Sect. 13.2.4.2 'Positively Correlated Ordering'
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