Footnote ‡ to (30) — σ_i²(D) − μ_i²(D) = E[b̂_i − a_i′Db̂]²
ProvedChanceDetEquiv.EModel.footnote_30chance-constrained-programmingp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1probability
Let every component be square integrable. With
as in (30), for every decision rule and every row ,
This identity is what turns (28d), stated with the variance of , into the second constraint of (29), stated with the raw second moment and the squared mean slack .
Formalization Note The footnote's display labels the variance as , while (30) defines as the raw second moment. The Lean follows (30), the only reading under which (29) is equivalent to (28c)–(28d), and states the identity the footnote's "derivation" needs.
Preamble
import Mathlib import Definitions.Def_ChanceDetEquiv_EModel_Model open MeasureTheory ProbabilityTheory Matrix
Formal statement
namespace ChanceDetEquiv.EModel
/-- **Footnote ‡ to (30)**, p. 28: if every `b_k` is square integrable, then for every `D` and `i`,
`σ_i²(D) − μ_i²(D) = E[b̂_i − a_i'Db̂]²`, with `σ_i²(D) = E(a_i'Db − b_i)²` and
`μ_i²(D) = (μ_{b_i} − a_i'Dμ_b)²` as in (30). -/
theorem footnote_30 {Ω : Type*} [MeasurableSpace Ω] {P : Measure Ω} [IsProbabilityMeasure P]
{m n : ℕ} (A : Matrix (Fin m) (Fin n) ℝ) (b : Ω → Fin m → ℝ)
(hb : ∀ k, MemLp (fun ω => b ω k) 2 P)
(D : Matrix (Fin n) (Fin m) ℝ) (i : Fin m) :
sigmaSq P A b D i - (muRow P A b D i) ^ 2 = centeredSecondMoment P A b D i := by sorry
end ChanceDetEquiv.EModel
Source
Charnes and Cooper, Deterministic Equivalents for Optimizing and Satisficing under Chance Constraints, Oper. Res. 11 (1963), p. 28, Eq. (30) and its footnote ‡
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.