Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 4.2 — S^(α)\hat{\mathcal S}(\alpha)S^(α) is polyhedral for finite discrete ξ\xiξ (corrected: α∈[0,12]\alpha\in[0,\tfrac12]α∈[0,21​] replaces the printed "γ≥0\gamma\ge 0γ≥0, S(γ)\mathcal S(\gamma)S(γ)")

Proved
KallMayerSLP.ICC.theorem_4_2

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

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

Let ξ\xiξ have the finite discrete distribution (4.7), with tk=t(ξ^k)t^k=t(\hat\xi^k)tk=t(ξ^​k), hk=h(ξ^k)h^k=h(\hat\xi^k)hk=h(ξ^​k), 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 α∈[0,12]\alpha\in[0,\tfrac12]α∈[0,21​], the set S^(α)={x∣Kα(x)≤0}\hat{\mathcal S}(\alpha)=\{x\mid K_\alpha(x)\le 0\}S^(α)={x∣Kα​(x)≤0} is polyhedral, and

{x∣Kα(x)≤0}=⋂K⊂N{x ∣ (1−2α)∑k∈Kpk(tkx−hk)+α(tˉx−hˉ)≤0}.\{x\mid K_\alpha(x)\le 0\}=\bigcap_{\mathcal K\subset\mathcal N}\Big\{x\ \Big|\ (1-2\alpha)\sum_{k\in\mathcal K}p_k(t^kx-h^k)+\alpha(\bar t x-\bar h)\le 0\Big\}.{x∣Kα​(x)≤0}=K⊂N⋂​{x ​ (1−2α)k∈K∑​pk​(tkx−hk)+α(tˉx−hˉ)≤0}.

This gives the α\alphaα-variant of integrated chance constraints the same finite linear description as Theorem 4.1.

Formalization Note KαK_\alphaKα​, tˉ\bar ttˉ, hˉ\bar hhˉ are expectations against the law (4.7). The sentence before the theorem in the book fixes α∈[0,12]\alpha\in[0,\tfrac12]α∈[0,21​] and S^(α)\hat{\mathcal S}(\alpha)S^(α).

Differences from the source:

  • correction: "For γ ≥ 0, 𝒮(γ) is a polyhedral set" with the representation of {x | K_α(x) ≤ 0} → α ∈ [0, ½] and Ŝ(α) polyhedral, with that representation; reason: the hypothesis is copied from Theorem 4.1 and the preceding sentence fixes α ∈ [0, ½]; without it the representation is false at N = 1, p₁ = 1, t¹ = 1, h¹ = 0, α = 1, where the left side is ℝ and the right side is (−∞, 0]
  • generalization: ξ with realizations in ℝʳ, t(ξ), h(ξ) affine in ξ (1.2) → Ξ any measurable space with measurable singletons, t, h arbitrary functions, atoms not required distinct; reason: the book says (1.2) is not used in the chapter; Ξ = ℝʳ with its Borel sets gives the book's case
  • encoding: 𝒦 ⊂ 𝒩 over subsets of {1, …, N} → 𝒦 : Finset (Fin N), all subsets including ∅ and the whole set; reason: the book includes 𝒦 = ∅ with empty sum 0 (p.153); 0-based indices; same instances
Preamble
import Mathlib
import Definitions.Def_VanderbeiLP_StrictComp_Polyhedron
import Definitions.Def_KallMayerSLP_ICC_KAlpha
import Definitions.Def_KallMayerSLP_ICC_discreteLaw

open MeasureTheory Matrix
Formal statement
namespace KallMayerSLP.ICC

/-- **Theorem 4.2 (the `α`-variant, finite discrete distribution), corrected hypothesis.**
Kall & Mayer, *Stochastic Linear Programming* (2005), Chapter 2, Theorem 4.2, p.154 (PDF 164). For
`α ∈ [0, ½]`, `Ŝ(α) = {x | K_α(x) ≤ 0}` is a polyhedral set, and
`{x | K_α(x) ≤ 0} = ⋂_{𝒦 ⊂ 𝒩} {x | (1 − 2α) Σ_{k∈𝒦} p_k (tᵏx − hᵏ) + α(t̄x − h̄) ≤ 0}`.

**Formalization Note.** The book prints "For `γ ≥ 0`, `S(γ)` is a polyhedral set", which is copied
from Theorem 4.1; the sentence before it fixes `α ∈ [0, ½]` and `Ŝ(α)`. The hypothesis on `α` is
needed: the representation fails for `α > ½` (`N = 1`, `p₁ = 1`, `t¹ = 1`, `h¹ = 0`, `α = 1`).
`t̄`, `h̄` are the expectations against the law (4.7). -/
theorem theorem_4_2 {Ξ : Type*} [MeasurableSpace Ξ] [MeasurableSingletonClass Ξ] {N n : ℕ}
    (p : Fin N → ℝ) (ξhat : Fin N → Ξ) (hp : ∀ k, 0 < p k) (hsum : ∑ k, p k = 1)
    (t : Ξ → Fin n → ℝ) (h : Ξ → ℝ) (α : ℝ) (hα₀ : 0 ≤ α) (hα₁ : α ≤ 1 / 2) :
    VanderbeiLP.StrictComp.IsPolyhedron {x | KAlpha (discreteLaw p ξhat) t h α x ≤ 0} ∧
    {x | KAlpha (discreteLaw p ξhat) t h α x ≤ 0} =
      ⋂ 𝒦 : Finset (Fin N),
        {x | (1 - 2 * α) * ∑ k ∈ 𝒦, p k * (t (ξhat k) ⬝ᵥ x - h (ξhat k)) +
          α * ((∫ ξ, t ξ ∂(discreteLaw p ξhat)) ⬝ᵥ x - ∫ ξ, h ξ ∂(discreteLaw p ξhat)) ≤ 0} := by sorry

end KallMayerSLP.ICC
Source
Kall & Mayer, Stochastic Linear Programming (2005), Chapter 2, Theorem 4.2, 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