Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Eq. (19a) — for uncorrelated b and c, E(c′Db) = (Ec)′D(Eb)

Proved
ChanceDetEquiv.EModel.eq_19a

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

chance-constrained-programmingp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1stochastic-programming

Let bbb and ccc be random vectors in Rm\mathbb R^mRm and Rn\mathbb R^nRn on a probability space, with integrable components bkb_kbk​, cjc_jcj​ and integrable products cjbkc_jb_kcj​bk​. Suppose bbb and ccc are uncorrelated in the sense that E(cjbk)=E(cj) E(bk)E(c_jb_k)=E(c_j)\,E(b_k)E(cj​bk​)=E(cj​)E(bk​) for all j,kj,kj,k (no assumption is made on the components of bbb among themselves, or of ccc). Then for every n×mn\times mn×m matrix DDD,

E(c′Db)=(Ec)′D(Eb)=μc′Dμb.E(c'Db)=(Ec)'D(Eb)=\mu_c'D\mu_b.E(c′Db)=(Ec)′D(Eb)=μc′​Dμb​.

This is the step that makes the objective of the E-model deterministic: the expected functional of (18) becomes the bilinear function μc′Dμb\mu_c'D\mu_bμc′​Dμb​ of the decision rule.

Formalization Note The paper's "b and c are uncorrelated" is stated as the componentwise product rule for expectations, which is exactly what uncorrelatedness of the components means.

Preamble
import Mathlib
import Definitions.Def_ChanceDetEquiv_EModel_Model

open MeasureTheory ProbabilityTheory Matrix
Formal statement
namespace ChanceDetEquiv.EModel

/-- **Eq. (19a)**, p. 26: if `b` and `c` are uncorrelated (componentwise:
`E(c_j b_k) = E(c_j) E(b_k)`), then `E(c'Db) = (Ec)'D(Eb)` for every decision rule `D`. -/
theorem eq_19a {Ω : Type*} [MeasurableSpace Ω] {P : Measure Ω} [IsProbabilityMeasure P]
    {m n : ℕ} (b : Ω → Fin m → ℝ) (c : Ω → Fin n → ℝ)
    (hb : ∀ k, Integrable (fun ω => b ω k) P)
    (hc : ∀ j, Integrable (fun ω => c ω j) P)
    (hcb : ∀ j k, Integrable (fun ω => c ω j * b ω k) P)
    (huncorr : ∀ j k, ∫ ω, c ω j * b ω k ∂P = (∫ ω, c ω j ∂P) * (∫ ω, b ω k ∂P))
    (D : Matrix (Fin n) (Fin m) ℝ) :
    expectedObjective P b c D = detObjective P b c D := by sorry

end ChanceDetEquiv.EModel
Source
Charnes and Cooper, Deterministic Equivalents for Optimizing and Satisficing under Chance Constraints, Oper. Res. 11 (1963), p. 26, Eq. (19a)
Human review
  • Endorsed by Shuze Chen · Oct 6, 2026

    Confirmed by the moderator at approval.

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