Theorem 2.1 — the recourse function is finite, convex and Lipschitz in
ProvedKallMayerSLP.Recourse.theorem_2_1Throughout, is a random vector in with distribution and support (the smallest closed set of probability one); the second-stage data are affine in as in (2.1), and the recourse matrix is fixed. The recourse function is the optimal value of the second-stage LP (2.9),
with value when the LP is infeasible and when it is unbounded. Assumption 2.1 (complete fixed recourse, (2.6)): . Assumption 2.2 ((2.8)): for every .
Assume Assumptions 2.1 and 2.2 and the standing assumption (p.199). Then:
- is finite for every and every ;
- for every , is convex on ;
- there is an integrable function such that for every and all
This is the scenario-wise regularity that Theorem 2.3 integrates to obtain the properties of the expected recourse.
Formalization Note is the Euclidean norm. Convexity and the Lipschitz bound are stated for the real part of the EReal recourse value, which by clause 1 is the value itself.
Differences from the source:
- encoding: probability space (Ω, ℱ, P) with ℱ = σ(ξ) and the induced distribution ℙ_ξ on ℝʳ → a probability measure μ = ℙ_ξ on
Fin r → ℝ(canonical space, ξ = id); reason: the statement involves ξ only through ℙ_ξ; same instances - encoding: Ξ = supp ℙ_ξ, the smallest closed set with ℙ_ξ(Ξ) = 1 →
μ.support(Mathlib's support: points all of whose neighbourhoods have positive measure); reason: the two sets coincide in ℝʳ - encoding: T(ξ), h(ξ), q(ξ) affine in ξ by (2.1), W(ξ) ≡ W fixed →
RandomDatawith fields T0, Tj, h0, hj, q0, qj and one fixed matrix W; reason: notation only - encoding: recourse value Q(x; T(ξ), h(ξ), q(ξ)) as an inf with values ±∞ → the published
KallMayer.Recourse.PointwiseRecourse, anERealinfimum (+∞ if infeasible, −∞ if unbounded); reason: the book's convention of p.200; same values - encoding: Q(·; ξ) as a real function →
EReal.toRealof the recourse value, with its finiteness asserted in the same statement; reason: no infinite value is collapsed - encoding: the norm ‖x⁽¹⁾ − x⁽²⁾‖ → the Euclidean norm
‖WithLp.toLp 2 (x₁ - x₂)‖; reason: the book's ‖·‖ on ℝ^{n₁} - generalization: clause a) for x ∈ B₁ = {x | Ax = b, x ≥ 0} → every x ∈ ℝ^{n₁}; reason: Assumption 2.1 makes the second-stage LP feasible for every x (proof of a)); B₁ ⊂ ℝ^{n₁}, so the statement specializes to the book's
- reading: b) 'convex in x', c) 'Lipschitz continuous in x' (no domain given) → on all of ℝ^{n₁}; reason: the proof of c) takes 'any two x⁽¹⁾ ≠ x⁽²⁾'; the function is defined and finite on ℝ^{n₁}
- encoding: 'Lipschitz constant D(ξ) ∈ L¹' → ∃ D : ℝʳ → ℝ,
Integrable D μ, with the Lipschitz inequality for every ξ ∈ Ξ; reason: same content
import Mathlib import Definitions.Def_KallMayer_Recourse_CompleteRecourse import Definitions.Def_KallMayer_Recourse_PointwiseRecourse import Definitions.Def_KallMayerSLP_Recourse_RandomData open MeasureTheory open KallMayer.Recourse (CompleteRecourse PointwiseRecourse) open Matrix
namespace KallMayerSLP.Recourse
/-- Theorem 2.1 (Kall & Mayer, Stochastic Linear Programming (2005), Chapter 3, Theorem 2.1, p.205,
PDF 214): let Assumptions 2.1 and 2.2 be satisfied. Then the recourse function
`Q(x; T(ξ), h(ξ), q(ξ))` is
a) finitely valued `∀ x ∈ B₁, ξ ∈ Ξ`,
b) convex in `x` `∀ ξ ∈ Ξ`, and
c) Lipschitz continuous in `x` `∀ ξ ∈ Ξ` with a Lipschitz constant `D(ξ) ∈ L¹`.
**Formalization Note.** `μ = ℙ_ξ` on `ℝʳ`, `Ξ = μ.support`, `ξ ∈ L²` (the standing assumption of
p.199, needed for `D ∈ L¹`). Clause a) is stated for every `x ∈ ℝ^{n₁}` (the proof uses only primal
feasibility from Assumption 2.1, which holds for every `x`); `B₁ ⊂ ℝ^{n₁}`, so this contains the
book's clause. Clauses b) and c) concern the real function `x ↦ Q(x; ξ)`, which is the `toReal` of
the `EReal` recourse value; by a) no infinite value is collapsed. The norm in c) is the Euclidean
norm `‖x⁽¹⁾ − x⁽²⁾‖` of `ℝ^{n₁}` (`WithLp.toLp 2`). -/
theorem theorem_2_1 {m₂ n₁ n₂ r : ℕ} (W : Matrix (Fin m₂) (Fin n₂) ℝ) (D : RandomData m₂ n₁ n₂ r)
(μ : Measure (Fin r → ℝ)) [IsProbabilityMeasure μ] (hξ : MemLp id 2 μ)
(hW : CompleteRecourse W)
(hdual : ∀ ξ ∈ μ.support, ∃ u : Fin m₂ → ℝ, W.transpose *ᵥ u ≤ D.q ξ) :
(∀ x : Fin n₁ → ℝ, ∀ ξ ∈ μ.support,
PointwiseRecourse W (D.T ξ) (D.h ξ) (D.q ξ) x ≠ ⊥ ∧
PointwiseRecourse W (D.T ξ) (D.h ξ) (D.q ξ) x ≠ ⊤) ∧
(∀ ξ ∈ μ.support,
ConvexOn ℝ Set.univ (fun x : Fin n₁ → ℝ => (PointwiseRecourse W (D.T ξ) (D.h ξ) (D.q ξ) x).toReal)) ∧
(∃ Dξ : (Fin r → ℝ) → ℝ, Integrable Dξ μ ∧
∀ ξ ∈ μ.support, ∀ x₁ x₂ : Fin n₁ → ℝ,
|(PointwiseRecourse W (D.T ξ) (D.h ξ) (D.q ξ) x₁).toReal -
(PointwiseRecourse W (D.T ξ) (D.h ξ) (D.q ξ) x₂).toReal| ≤
Dξ ξ * ‖WithLp.toLp 2 (x₁ - x₂)‖) := by sorry
end KallMayerSLP.Recourse
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.