Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

(2.13), p.96 — B(α)\mathcal B(\alpha)B(α) as a union of intersections of realized constraint sets

Proved
KallMayerSLP.ProbConstr.eq_2_13

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

chance-constraintsp2o-gran-per-chapterp2o-plan-bookp2o-strengthenedp2o-v1probability-constraintsstochastic-programming

Let ξ\xiξ be a random vector in Rr\mathbb R^rRr with an arbitrary distribution Pξ\mathbb P_\xiPξ​, and let T(ξ)T(\xi)T(ξ), h(ξ)h(\xi)h(ξ) be measurable random data. For every level α∈R\alpha\in\mathbb Rα∈R, the feasible set B(α)={x∣G(x)≥α}\mathcal B(\alpha)=\{x\mid G(x)\ge\alpha\}B(α)={x∣G(x)≥α} satisfies B(α)={x∣S(x)∈Gα}\mathcal B(\alpha)=\{x\mid S(x)\in\mathcal G_\alpha\}B(α)={x∣S(x)∈Gα​} and

B(α)=⋃A∈Gα{x∣S(x)=A}=⋃A∈Gα{x∣∀ξ∈A: T(ξ)x≥h(ξ)}=⋃A∈Gα ⋂ξ∈A{x∣T(ξ)x≥h(ξ)},\mathcal B(\alpha)=\bigcup_{A\in\mathcal G_\alpha}\{x\mid S(x)=A\} =\bigcup_{A\in\mathcal G_\alpha}\{x\mid \forall\xi\in A:\ T(\xi)x\ge h(\xi)\} =\bigcup_{A\in\mathcal G_\alpha}\ \bigcap_{\xi\in A}\{x\mid T(\xi)x\ge h(\xi)\},B(α)=A∈Gα​⋃​{x∣S(x)=A}=A∈Gα​⋃​{x∣∀ξ∈A: T(ξ)x≥h(ξ)}=A∈Gα​⋃​ ξ∈A⋂​{x∣T(ξ)x≥h(ξ)},

where S(x)={ξ∣T(ξ)x≥h(ξ)}S(x)=\{\xi\mid T(\xi)x\ge h(\xi)\}S(x)={ξ∣T(ξ)x≥h(ξ)} and Gα\mathcal G_\alphaGα​ is the family of Borel events of probability at least α\alphaα.

This representation exhibits B(α)\mathcal B(\alpha)B(α) as a union of convex sets; it specializes to (2.17) for a finite discrete distribution.

Differences from the source:

  • generalization: T(ξ) = T + Σ_j T^j ξ_j and h(ξ) = h + Σ_j h^j ξ_j affine in ξ (Notations, p.ix) → T(ξ), h(ξ) any functions of ξ whose entries are Borel measurable; reason: affine maps are continuous, hence measurable, so the book's data are an instance
  • encoding: the distribution ℙ_ξ of ξ on (ℝ^r, 𝓑^r) → a probability measure μ on Fin r → ℝ with its Borel σ-algebra; probabilities are (μ A).toReal; reason: the real value of a probability is exact, so every instance is the same
Preamble
import Mathlib
import Definitions.Def_KallMayerSLP_ProbConstr_feasibleEvent
import Definitions.Def_KallMayerSLP_ProbConstr_realizationSet
import Definitions.Def_KallMayerSLP_ProbConstr_levelEvents
import Definitions.Def_KallMayerSLP_ProbConstr_feasibleSet

open Matrix MeasureTheory
Formal statement
namespace KallMayerSLP.ProbConstr

/-- The representations of the feasible set of a joint probability constraint:
`B(α) = {x | S(x) ∈ 𝒢_α}` and (2.13)
`B(α) = ⋃_{A∈𝒢_α} {x | S(x) = A} = ⋃_{A∈𝒢_α} {x | ∀ξ ∈ A : T(ξ)x ≥ h(ξ)}
      = ⋃_{A∈𝒢_α} ⋂_{ξ∈A} {x | T(ξ)x ≥ h(ξ)}`.

Kall & Mayer 2005, Chapter 2, §2.1, (2.13), p.96 (PDF 106).

**Formalization Note.** `μ` is any probability measure on `ℝ^r` (the book: "without any assumptions concerning
the probability distribution of ξ"). The data `T(ξ)`, `h(ξ)` are any Borel measurable functions
of `ξ` (entrywise); the book's affine data (Notations, p.ix) are continuous, hence measurable, so
the statement contains the book's. Every real `α`. -/
theorem eq_2_13 {r m n : ℕ} (μ : Measure (Fin r → ℝ)) [IsProbabilityMeasure μ]
    (T : (Fin r → ℝ) → Matrix (Fin m) (Fin n) ℝ) (h : (Fin r → ℝ) → Fin m → ℝ)
    (hT : ∀ i j, Measurable fun ξ => T ξ i j) (hh : ∀ i, Measurable fun ξ => h ξ i) (α : ℝ) :
    feasibleSet μ T h α = {x | feasibleEvent T h x ∈ levelEvents μ α} ∧
    feasibleSet μ T h α = ⋃ A ∈ levelEvents μ α, {x | feasibleEvent T h x = A} ∧
    feasibleSet μ T h α = ⋃ A ∈ levelEvents μ α, {x | ∀ ξ ∈ A, h ξ ≤ T ξ *ᵥ x} ∧
    feasibleSet μ T h α = ⋃ A ∈ levelEvents μ α, ⋂ ξ ∈ A, realizationSet T h ξ := by sorry

end KallMayerSLP.ProbConstr
Source
Kall & Mayer, Stochastic Linear Programming: Models, Theory, and Computation (Kluwer/Springer 2005), Chapter 2, Chapter 2, §2.1, (2.13), p.96 (PDF 106)
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