Proof of Theorem 6.3, p. 38 — η ⪯C η′, ψ strictly convex: ∫ψ dη ≤ ∫ψ dη′, with equality iff η = η′
ProvedMartOT.Product.strict_convex_integral_eq_iffLet be finite Borel measures on with finite first moments and , and let be strictly convex. Then
and, if ,
The integrals take values in (a convex function is bounded below by an affine one, which is integrable against a measure with finite first moment). The inequality is the definition of the convex order; the content is the equality case: a strictly convex test function detects every strict increase in the convex order. In the proof of Theorem 6.3 it is applied to and .
Formalization Note The integrals are the Setting layer's integralE, with values in EReal. The finiteness hypothesis is not on the page and is necessary: if both integrals are they are equal without the measures being equal (e.g. , the law of a random variable with finite mean and , and the law of with a fair sign independent of ). The page's is also nonnegative; that is not needed here.
import Mathlib import Definitions.Def_MartOT_Var_Setting
namespace MartOT.Product
open MeasureTheory
/-- Proof of **Theorem 6.3** (p. 38): for `η ⪯C η'` in `𝓜` and a strictly convex `ψ`,
`∫ ψ dη ≤ ∫ ψ dη'`, and when `∫ ψ dη' < +∞` equality holds if and only if `η = η'`. -/
theorem strict_convex_integral_eq_iff (η η' : Measure ℝ) (h : MartOT.Var.ConvexLE η η') (ψ : ℝ → ℝ)
(hψ : StrictConvexOn ℝ Set.univ ψ) :
MartOT.Var.integralE η ψ ≤ MartOT.Var.integralE η' ψ ∧
(MartOT.Var.integralE η' ψ < ⊤ → (MartOT.Var.integralE η ψ = MartOT.Var.integralE η' ψ ↔ η = η')) := by sorry
end MartOT.Product
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.