Theorem 2, converse, pp. 7627–7628 — if ρ(E)+ρ(Eᶜ) ≥ 1 and max{ρ(E),ρ(Eᶜ)} < 1 or min{ρ(E),ρ(Eᶜ)} = 0, MOM holds on {E,Eᶜ}-measurable acts
ProvedSurelyBetter.CLB.theorem2_converseLet be a finite set of states and let be a convex set containing two distinct points; stands for , the range of a nonconstant affine utility on simple lotteries. Acts are represented by their utility profiles (see the definitions item for why this is exact). Let be a c-linearly biseparable preference with capacity : is normalized, monotone and continuous on , and for every event the functional , , represents on all binary acts. Fix an event and write for its complement.
Suppose that either or . If
then satisfies monotonicity in optimal mixtures restricted to acts measurable with respect to : for all such acts with statewise, the set of optimal weights on in is smaller in the set order (Definition 1) than the set of optimal weights on in .
This is the converse half of Theorem 2. Remark 2 of the paper (, ) shows that the side condition cannot be dropped.
Formalization Note Acts are utility profiles S → ℝ with values in U; the hypotheses Convex ℝ U and ∃ a ∈ U, ∃ b ∈ U, a ≠ b encode that for a nonconstant affine , and IsCLinBisep U V ρ bundles the standing MBA restriction of §4 with the representation (7) as an order equivalence over binary acts of all events.
import Mathlib import Definitions.Def_Supermodularity_Lattices_InducedSetOrder import Definitions.Def_SurelyBetter_CLB_Model
namespace SurelyBetter.CLB
theorem theorem2_converse {S : Type*} [Fintype S] (U : Set ℝ) (hU : Convex ℝ U)
(hU2 : ∃ a ∈ U, ∃ b ∈ U, a ≠ b) (V : (S → ℝ) → ℝ) (ρ : Set S → ℝ)
(hV : IsCLinBisep U V ρ) (E : Set S) :
(max (ρ E) (ρ Eᶜ) < 1 ∨ min (ρ E) (ρ Eᶜ) = 0) → 1 ≤ ρ E + ρ Eᶜ →
MOMOn V (measE U E) := by sorry
end SurelyBetter.CLB
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.