Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Theorem 2, p. 7627 — for f = xEy, g = wEz with the slope in the window, the unique optimal mixture is α* = 1/(1 + (u(x)−u(y))/(u(z)−u(w)))

Proved
SurelyBetter.CLB.theorem2_interior_optimum

by mikedeng1 · Oct 22, 2026 · Mathlib 0df444a (Lean v4.33.1)

ambiguity-aversionbiseparable-preferencesoptimal-mixturesp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Let SSS be a finite set of states and let U⊆RU\subseteq\mathbb RU⊆R be a convex set containing two distinct points; UUU stands for u(X)u(X)u(X), the range of a nonconstant affine utility uuu on simple lotteries. Acts are represented by their utility profiles v:S→Uv:S\to Uv:S→U (see the definitions item for why this is exact). Let VVV be a c-linearly biseparable preference with capacity ρ\rhoρ: VVV is normalized, monotone and continuous on USU^SUS, and for every event EEE the functional W(xEy)=u(x)ρ(E)+u(y)(1−ρ(E))W(xEy)=u(x)\rho(E)+u(y)(1-\rho(E))W(xEy)=u(x)ρ(E)+u(y)(1−ρ(E)), x≿yx\succsim yx≿y, represents VVV on all binary acts. Fix an event E⊆SE\subseteq SE⊆S and write EcE^cEc for its complement.

Suppose ρ(E)+ρ(Ec)<1\rho(E)+\rho(E^c)<1ρ(E)+ρ(Ec)<1. Let x,y,w,z∈Ux,y,w,z\in Ux,y,w,z∈U (utilities of prizes) with x>yx>yx>y, z>wz>wz>w, x>wx>wx>w, z>yz>yz>y, and let fff be the bet paying xxx on EEE and yyy off EEE, ggg the bet paying www on EEE and zzz off EEE. Suppose the slope of the segment between the two profiles lies strictly inside the window given by the two linear pieces:

1−ρ(Ec)ρ(Ec) > z−yx−w > ρ(E)1−ρ(E).\frac{1-\rho(E^c)}{\rho(E^c)}\ >\ \frac{z-y}{x-w}\ >\ \frac{\rho(E)}{1-\rho(E)}.ρ(Ec)1−ρ(Ec)​ > x−wz−y​ > 1−ρ(E)ρ(E)​.

Then the set of optimal mixtures αf,g∗\alpha^*_{f,g}αf,g∗​ — all α∈[0,1]\alpha\in[0,1]α∈[0,1] such that αf+(1−α)g\alpha f+(1-\alpha)gαf+(1−α)g is optimal in {βf+(1−β)g:β∈[0,1]}\{\beta f+(1-\beta)g:\beta\in[0,1]\}{βf+(1−β)g:β∈[0,1]} — is the single point

αf,g∗={11+x−yz−w},\alpha^*_{f,g}=\left\{\frac{1}{1+\frac{x-y}{z-w}}\right\},αf,g∗​={1+z−wx−y​1​},

the interior weight that equalizes utility across EEE and EcE^cEc.

Formalization Note Acts are utility profiles S → ℝ with values in U; the hypotheses Convex ℝ U and ∃ a ∈ U, ∃ b ∈ U, a ≠ b encode that U=u(X)U=u(X)U=u(X) for a nonconstant affine uuu, 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 slope window is stated cross-multiplied, ρ(E)(x−w)<(1−ρ(E))(z−y)\rho(E)(x-w)<(1-\rho(E))(z-y)ρ(E)(x−w)<(1−ρ(E))(z−y) and ρ(Ec)(z−y)<(1−ρ(Ec))(x−w)\rho(E^c)(z-y)<(1-\rho(E^c))(x-w)ρ(Ec)(z−y)<(1−ρ(Ec))(x−w), because ρ(Ec)=0\rho(E^c)=0ρ(Ec)=0 is allowed; then the left fraction is +∞+\infty+∞ and the second inequality reduces to x>wx>wx>w. The paper's existence remark (such x,y,w,zx,y,w,zx,y,w,z exist) is not part of this statement.

Preamble
import Mathlib
import Definitions.Def_Supermodularity_Lattices_InducedSetOrder
import Definitions.Def_SurelyBetter_CLB_Model
Formal statement
namespace SurelyBetter.CLB
theorem theorem2_interior_optimum {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)
    (x y w z : ℝ) (hx : x ∈ U) (hy : y ∈ U) (hw : w ∈ U) (hz : z ∈ U)
    (hxy : y < x) (hzw : w < z) (hxw : w < x) (hzy : y < z)
    (hslope_lo : ρ E * (x - w) < (1 - ρ E) * (z - y))
    (hslope_hi : ρ Eᶜ * (z - y) < (1 - ρ Eᶜ) * (x - w)) :
    optMix V (binProf E x y) (binProf E w z) = {1 / (1 + (x - y) / (z - w))} := by sorry
end SurelyBetter.CLB
Source
Ghili & Klibanoff, If It Is Surely Better, Do It More? Implications for Preferences Under Ambiguity, Management Science 67(12) (2021), p. 7627, proof of Theorem 2 (interior optimal mixture α*)
Human review
  • Endorsed by Shuze Chen · Oct 23, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 23, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me