Lemma 2, p. 163 — g_t and f_t are convex and continuous on the orthant, and the infimum in (1) is a minimum
ProvedTopkisRation.Levels.lemma_2In the model of Topkis (1968, §1) under Assumptions (A)–(C), let and let . Then:
- is convex and continuous on ;
- if , is convex and continuous on ;
- if , for every and the infimum in (1) is attained: there is a feasible with
and the bracket of (1) at is no larger than at any other feasible vector; 4. if , for every and the function is integrable with respect to the law of .
This is the regularity on which the rest of the analysis rests: the infimum in (1) can be replaced by a minimum, and is a genuine expectation.
Formalization Note. The page writes " and "; the second function is (a misprint: has one argument and the next sentence speaks of ). Item 4 makes explicit what the paper's proof derives from "the Lebesgue Convergence Theorem and the finite means of the demands"; it is what makes the Bochner integral defining the paper's expectation rather than a junk value. Item 3 is the paper's "the infimum can be replaced by minimum", which makes the real sInf defining the paper's value.
import Mathlib import Definitions.Def_TopkisRation_Levels_Model
namespace TopkisRation.Levels
open MeasureTheory
theorem lemma_2 {n : ℕ} (M : Model n) (hM : M.Standing) (t : ℕ) (ht : t ≤ M.k) :
(ConvexOn ℝ (Set.Ici (0 : ℝ) ×ˢ Set.Ici (0 : Fin n → ℝ)) (fun q => M.g t q.1 q.2) ∧
ContinuousOn (fun q => M.g t q.1 q.2) (Set.Ici (0 : ℝ) ×ˢ Set.Ici (0 : Fin n → ℝ))) ∧
(1 ≤ t →
ConvexOn ℝ (Set.Ici (0 : ℝ) ×ˢ Set.Ici (0 : Fin n → ℝ)) (fun q => M.f t q.1 q.2) ∧
ContinuousOn (fun q => M.f t q.1 q.2) (Set.Ici (0 : ℝ) ×ˢ Set.Ici (0 : Fin n → ℝ))) ∧
(1 ≤ t → ∀ z, 0 ≤ z → ∀ B : Fin n → ℝ, 0 ≤ B →
∃ u ∈ feasible z B, M.f t z B = M.obj t (M.g (t - 1)) z B u ∧
∀ u' ∈ feasible z B, M.obj t (M.g (t - 1)) z B u ≤ M.obj t (M.g (t - 1)) z B u') ∧
(1 ≤ t → ∀ z, 0 ≤ z → ∀ b : Fin n → ℝ, 0 ≤ b →
Integrable (fun x => M.f t z (b + x)) (M.μ t)) := by sorry
end TopkisRation.Levels
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.