Theorem 3.9.1 - closed convex cone characterization of the integral (corrected: contains the constants; probability measures; Borel sets and functions)
ProvedSupermodularity.MDP.closed_convex_cone_characterization_v2Let , let be a family of distribution functions on , represented by probability measures on the Borel sets of , and let be a set of real-valued functions on that is a closed convex cone containing the constant functions: is closed in the topology of pointwise convergence on , closed under addition and under multiplication by nonnegative scalars, and contains every constant function ().
Then the following are equivalent:
- belongs to for every Borel increasing (upward-closed) set ;
- belongs to for every Borel measurable increasing function that is -integrable for every .
This is Topkis's Theorem 3.9.1 with the correction below. It generalizes Lehmann's characterization of stochastic monotonicity (the case = increasing functions of ) to any property of defined by such a cone, in particular supermodularity and convexity or concavity in (Corollary 3.9.1), which is how stochastic supermodularity of the transition law enters Theorem 3.9.2.
Formalization Note. The retired version assumed only that is a closed convex cone and was disproved with = the nonnegative functions on : every is nonnegative, so (1) holds, but the increasing function has integral . The proof of (1) (2) writes a bounded increasing as a constant plus a limit of nonnegative combinations of indicators of increasing sets (layer-cake), so it needs the (possibly negative) constants to lie in ; every cone the book applies the theorem to (increasing, supermodular, convex functions of ) contains them. The new statement adds this hypothesis; if the printed statement already carries it, the retired version dropped a hypothesis rather than the source being in error, and the corrected statement is the same either way. Two conventions are made explicit as well: the are probability measures (the book's distribution functions; the retired version allowed arbitrary measures, for which the constant term is not a constant function), and the increasing sets and increasing functions are Borel measurable, which is what and presuppose (for an upward-closed set or an increasing function need not be Borel; the retired version evaluated the outer measure on arbitrary upward-closed sets). Integrability of against every is retained as the explicit form of "for which the integral exists"; with it, (1) (2) follows from the bounded case by truncation and dominated convergence, using the pointwise closedness of .
import Mathlib open MeasureTheory
namespace Supermodularity.MDP
/-- Theorem 3.9.1 (Topkis, *Supermodularity and Complementarity*, p. 159–160), corrected.
`T ⊆ ℝᵐ`, `{F(t,·) : t ∈ T}` is a family of distribution functions on `ℝⁿ` (probability
measures `μ t`), and `V` is a closed convex cone of real-valued functions on `T` (closed under
pointwise convergence, addition and nonnegative scaling) **containing the constant
functions**. Then `t ↦ ∫_S dF(t,w)` lies in `V` for every (Borel) increasing set `S ⊆ ℝⁿ`
iff `t ↦ ∫ h(w) dF(t,w)` lies in `V` for every (Borel measurable) increasing real-valued `h`
on `ℝⁿ` whose integrals exist.
**Corrections to the retired version.** (1) Without `−1 ∈ V` the forward direction is false
(the accepted disproof: `V` = nonnegative functions), because an increasing `h` is a
nonnegative combination of indicators of increasing sets only after subtracting a constant;
all of the book's cones (increasing, supermodular, convex functions) contain the constants,
and the proof needs it, so it is added as `hVconst`. (2) The `μ t` are now probability
measures, as the book's "distribution functions" are. (3) Sets and functions are Borel
measurable, the standing convention under which `∫_S dF` and `∫ h dF` are defined. -/
theorem closed_convex_cone_characterization_v2 {m n : ℕ} (T : Set (Fin m → ℝ))
(μ : (Fin m → ℝ) → Measure (Fin n → ℝ))
(hμprob : ∀ t : T, IsProbabilityMeasure (μ (t : Fin m → ℝ)))
(V : Set (T → ℝ))
(hVclosed : IsClosed V)
(hVadd : ∀ ⦃f g : T → ℝ⦄, f ∈ V → g ∈ V → f + g ∈ V)
(hVsmul : ∀ ⦃f : T → ℝ⦄, f ∈ V → ∀ ⦃c : ℝ⦄, 0 ≤ c → c • f ∈ V)
(hVconst : ∀ c : ℝ, (fun _ : T => c) ∈ V) :
(∀ ⦃S : Set (Fin n → ℝ)⦄, MeasurableSet S → IsUpperSet S →
(fun t : T => (μ (t : Fin m → ℝ) S).toReal) ∈ V) ↔
(∀ ⦃h : (Fin n → ℝ) → ℝ⦄, Measurable h → Monotone h →
(∀ t : T, Integrable h (μ (t : Fin m → ℝ))) →
(fun t : T => ∫ w, h w ∂ (μ (t : Fin m → ℝ))) ∈ V) := by sorry
end Supermodularity.MDP