Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

(4.13)–(4.15) — the α\alphaα-variant is equivalent to Kα(x)≤0K_\alpha(x)\le 0Kα​(x)≤0, and KαK_\alphaKα​ is convex or concave

Proved
KallMayerSLP.ICC.eq_4_13_to_4_15

by iris · Oct 30, 2026 · Mathlib 0df444a (Lean v4.33.1)

convexityintegrated-chance-constraintsp2o-gran-per-chapterp2o-plan-bookp2o-strengthenedp2o-v1polyhedrastochastic-programming

Let ξ\xiξ have law PPP, suppose the expected values of t(ξ)t(\xi)t(ξ) and h(ξ)h(\xi)h(ξ) exist, and put tˉ=Eξ[t(ξ)]\bar t=\mathbb E_\xi[t(\xi)]tˉ=Eξ​[t(ξ)], hˉ=Eξ[h(ξ)]\bar h=\mathbb E_\xi[h(\xi)]hˉ=Eξ​[h(ξ)]. For every α∈R\alpha\in\mathbb Rα∈R and every xxx, the three conditions

Eξ[ζ+(x,ξ)]≤α Eξ[∣ζ(x,ξ)∣],\mathbb E_\xi[\zeta^+(x,\xi)]\le\alpha\,\mathbb E_\xi[|\zeta(x,\xi)|],Eξ​[ζ+(x,ξ)]≤αEξ​[∣ζ(x,ξ)∣], (1−2α)Eξ[ζ+(x,ξ)]+α Eξ[ζ(x,ξ)]≤0,(1-2\alpha)\mathbb E_\xi[\zeta^+(x,\xi)]+\alpha\,\mathbb E_\xi[\zeta(x,\xi)]\le 0,(1−2α)Eξ​[ζ+(x,ξ)]+αEξ​[ζ(x,ξ)]≤0, (1−2α)Eξ[ζ+(x,ξ)]+α(tˉx−hˉ)≤0(1-2\alpha)\mathbb E_\xi[\zeta^+(x,\xi)]+\alpha(\bar t x-\bar h)\le 0(1−2α)Eξ​[ζ+(x,ξ)]+α(tˉx−hˉ)≤0

are equivalent. Moreover:

  1. Kα(x)=(1−α)K(x)−αH(x)K_\alpha(x)=(1-\alpha)K(x)-\alpha H(x)Kα​(x)=(1−α)K(x)−αH(x), so KαK_\alphaKα​ is the evaluation of ρsicα\rho^\alpha_{\mathrm{sic}}ρsicα​ at ζ(x,ξ)\zeta(x,\xi)ζ(x,ξ);
  2. KαK_\alphaKα​ is convex for α<12\alpha<\tfrac12α<21​;
  3. KαK_\alphaKα​ is concave for α>12\alpha>\tfrac12α>21​;
  4. for α=12\alpha=\tfrac12α=21​, Kα(x)=α(tˉx−hˉ)K_\alpha(x)=\alpha(\bar t x-\bar h)Kα​(x)=α(tˉx−hˉ) is linear-affine.

The sign of 1−2α1-2\alpha1−2α is what makes the constraint convex or not, and it is why the polyhedral representation below needs α≤12\alpha\le\tfrac12α≤21​.

Differences from the source:

  • generalization: ξ is a random vector in ℝʳ, t(ξ), h(ξ) affine in ξ (1.2), law ℙ_ξ → Ξ any measurable space, P any probability measure on Ξ, t, h arbitrary functions with integrable components; reason: the book says (1.2) is not used in the chapter; Ξ = ℝʳ with P = ℙ_ξ gives the book's case
  • generalization: α prescribed, with the remark that α ∈ [0, 1] suffices → every real α; reason: the identities hold for all α; [0, 1] is a special case
Preamble
import Mathlib
import Definitions.Def_KallMayerSLP_ICC_K
import Definitions.Def_KallMayerSLP_ICC_H
import Definitions.Def_KallMayerSLP_ICC_KAlpha

open MeasureTheory Matrix
Formal statement
namespace KallMayerSLP.ICC

/-- **The `α`-variant (4.13)–(4.15) and the shape of `K_α`.**
Kall & Mayer, *Stochastic Linear Programming* (2005), Chapter 2, (4.13)–(4.15), p.153 (PDF 163),
and p.154 (PDF 164). The inequality `𝔼_ξ[ζ⁺] ≤ α 𝔼_ξ[|ζ|]` (4.13) can be equivalently written as
`(1 − 2α)𝔼_ξ[ζ⁺] + α 𝔼_ξ[ζ] ≤ 0` (4.14) or as `(1 − 2α)𝔼_ξ[ζ⁺] + α(t̄x − h̄) ≤ 0` (4.15). Also
`K_α = (1 − α)K − αH`, the evaluation of `ρ^α_sic = (1 − α)𝔼[ϑ⁺] − α𝔼[ϑ⁻]` at `ζ(x, ξ)`; `K_α` is
convex for `α < ½`, concave for `α > ½`, and linear-affine for `α = ½`.

**Formalization Note.** No sign restriction on `α` is needed; the book's remark that `α ∈ [0, 1]`
suffices is a remark on which `α` give interesting constraints. `ht`, `hh` are the standing
assumption of §4.1 (p.149). -/
theorem eq_4_13_to_4_15 {Ξ : Type*} [MeasurableSpace Ξ] {n : ℕ} (P : Measure Ξ)
    [IsProbabilityMeasure P] (t : Ξ → Fin n → ℝ) (h : Ξ → ℝ)
    (ht : ∀ j, Integrable (fun ξ => t ξ j) P) (hh : Integrable h P) (α : ℝ) :
    (∀ x, (K P t h x ≤ α * ∫ ξ, |zeta t h x ξ| ∂P ↔
        (1 - 2 * α) * K P t h x + α * ∫ ξ, zeta t h x ξ ∂P ≤ 0) ∧
      ((1 - 2 * α) * K P t h x + α * ∫ ξ, zeta t h x ξ ∂P ≤ 0 ↔
        (1 - 2 * α) * K P t h x + α * ((∫ ξ, t ξ ∂P) ⬝ᵥ x - ∫ ξ, h ξ ∂P) ≤ 0)) ∧
    (∀ x, KAlpha P t h α x = (1 - α) * K P t h x - α * H P t h x) ∧
    (α < 1 / 2 → ConvexOn ℝ Set.univ (KAlpha P t h α)) ∧
    (1 / 2 < α → ConcaveOn ℝ Set.univ (KAlpha P t h α)) ∧
    (α = 1 / 2 → ∀ x, KAlpha P t h α x = α * ((∫ ξ, t ξ ∂P) ⬝ᵥ x - ∫ ξ, h ξ ∂P)) := by sorry

end KallMayerSLP.ICC
Source
Kall & Mayer, Stochastic Linear Programming (2005), Chapter 2, (4.13)–(4.15), p.153 (PDF 163), and p.154 (PDF 164)
Human review
  • Endorsed by Shuze Chen · Oct 31, 2026

    Confirmed by the moderator at approval.

  • Endorsed by iris · Oct 31, 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