Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proposition 4.3 — HJH_JHJ​ and KJK_JKJ​ are convex

Proved
KallMayerSLP.ICC.proposition_4_3

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, and suppose the expected values of T(ξ)T(\xi)T(ξ) and h(ξ)h(\xi)h(ξ) exist. Then

HJ(x)=Eξ[max⁡1≤i≤sζi−(x,ξ)],KJ(x)=Eξ[max⁡1≤i≤sζi+(x,ξ)]H_J(x)=\mathbb E_\xi\Big[\max_{1\le i\le s}\zeta_i^-(x,\xi)\Big],\qquad K_J(x)=\mathbb E_\xi\Big[\max_{1\le i\le s}\zeta_i^+(x,\xi)\Big]HJ​(x)=Eξ​[1≤i≤smax​ζi−​(x,ξ)],KJ​(x)=Eξ​[1≤i≤smax​ζi+​(x,ξ)]

are convex functions on Rn\mathbb R^nRn. This holds for a random technology matrix and with no restriction on the distribution of ξ\xiξ beyond the existence of the expected value.

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 entries; reason: the book says (1.2) is not used in the chapter; Ξ = ℝʳ with P = ℙ_ξ gives the book's case
  • generalization: s > 1 (§4.1.2) → every s ≥ 1; reason: the s = 1 case is covered by the same statement
Preamble
import Mathlib
import Definitions.Def_KallMayerSLP_ICC_KJ
import Definitions.Def_KallMayerSLP_ICC_HJ

open MeasureTheory
Formal statement
namespace KallMayerSLP.ICC

/-- **Proposition 4.3 (joint integrated probability functions are convex).**
Kall & Mayer, *Stochastic Linear Programming* (2005), Chapter 2, Proposition 4.3, p.155 (PDF 165).
Both `H_J(x)` and `K_J(x)` are convex functions on `ℝⁿ`.

**Formalization Note.** "The convexity property holds also for a random technology matrix and
without any restriction on the probability distribution of `ξ`, beyond the existence of the
expected value" (p.155): the only assumptions are `hT` and `hh`, the standing assumption of §4.1
(p.149), read entrywise. -/
theorem proposition_4_3 {Ξ : Type*} [MeasurableSpace Ξ] {s n : ℕ} [Nonempty (Fin s)]
    (P : Measure Ξ) [IsProbabilityMeasure P]
    (T : Ξ → Matrix (Fin s) (Fin n) ℝ) (h : Ξ → Fin s → ℝ)
    (hT : ∀ i j, Integrable (fun ξ => T ξ i j) P) (hh : ∀ i, Integrable (fun ξ => h ξ i) P) :
    ConvexOn ℝ Set.univ (HJ P T h) ∧ ConvexOn ℝ Set.univ (KJ P T h) := by sorry

end KallMayerSLP.ICC
Source
Kall & Mayer, Stochastic Linear Programming (2005), Chapter 2, Proposition 4.3, p.155 (PDF 165)
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