Proof of Theorem 2, p. 7627 — if ρ(E)+ρ(Eᶜ) < 1, preferences over {E,Eᶜ}-measurable acts are represented by the minimum of two linear functionals
ProvedSurelyBetter.CLB.theorem2_min_repLet 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 (ambiguity aversion toward bets on ). Then on -measurable acts, i.e. profiles equal to on and off , the preference is represented by
for all , iff .
This turns the c-linearly biseparable preference, on the two-dimensional family of bets on , into a concave piecewise-linear functional; it is the first step of the proof that ambiguity aversion breaks monotonicity in optimal mixtures.
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. The paper justifies the representation with strict inequalities between the two linear terms; at the two terms coincide, and the representation is stated as such.
import Mathlib import Definitions.Def_Supermodularity_Lattices_InducedSetOrder import Definitions.Def_SurelyBetter_CLB_Model
namespace SurelyBetter.CLB
theorem theorem2_min_rep {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) (hρ : ρ E + ρ Eᶜ < 1) :
∀ a ∈ U, ∀ b ∈ U, ∀ a' ∈ U, ∀ b' ∈ U,
(V (binProf E a b) ≤ V (binProf E a' b') ↔
min (ρ E * a + (1 - ρ E) * b) ((1 - ρ Eᶜ) * a + ρ Eᶜ * b) ≤
min (ρ E * a' + (1 - ρ E) * b') ((1 - ρ Eᶜ) * a' + ρ Eᶜ * b')) := by sorry
end SurelyBetter.CLB
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.