Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Theorem 3, p. 24 — the liability game vℓv_\ellvℓ​ is convex

Proved
SeqLoss.LiabilityGame.liabilityGame_convex

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

convex-gamecooperative-gameliabilityp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Let ℓ∈Ln\ell\in\mathcal L^nℓ∈Ln be a loss problem with n≥1n\ge1n≥1 agents and let vℓv_\ellvℓ​ be its liability game (vℓ(S)=∑i∈Sℓiv_\ell(S)=\sum_{i\in S}\ell_ivℓ​(S)=∑i∈S​ℓi​ if the initiator 1∈S1\in S1∈S, and 000 otherwise). Then vℓv_\ellvℓ​ is a convex game: vℓ(∅)=0v_\ell(\emptyset)=0vℓ​(∅)=0 and for all coalitions S,T⊆NS,T\subseteq NS,T⊆N,

vℓ(S)+vℓ(T)≤vℓ(S∪T)+vℓ(S∩T).v_\ell(S)+v_\ell(T)\le v_\ell(S\cup T)+v_\ell(S\cap T).vℓ​(S)+vℓ​(T)≤vℓ​(S∪T)+vℓ​(S∩T).

Convexity is what makes the Shapley value of vℓv_\ellvℓ​ lie in its core and, for big boss games, coincide with the nucleolus (Muto et al. 1988, Theorem 4.5).

Formalization Note. The paper shows convexity in the form of increasing marginal contributions, v(S∪{i})−v(S)≤v(T∪{i})−v(T)v(S\cup\{i\})-v(S)\le v(T\cup\{i\})-v(T)v(S∪{i})−v(S)≤v(T∪{i})−v(T) for S⊆TS\subseteq TS⊆T; the statement uses the platform's published IsConvexGame, which is the equivalent supermodular form together with v(∅)=0v(\emptyset)=0v(∅)=0. The hypothesis ℓi≥0\ell_i\ge0ℓi​≥0 for all iii is the paper's ℓ∈Ln\ell\in\mathcal L^nℓ∈Ln.

Preamble
import Mathlib
import Definitions.Def_Supermodularity_Monotonicity_SupermodularOn
import Definitions.Def_Supermodularity_Cooperative_IsConvexGame
import Definitions.Def_SeqLoss_FixedFraction_Setting
import Definitions.Def_SeqLoss_LiabilityGame_Game
Formal statement
namespace SeqLoss.LiabilityGame

theorem liabilityGame_convex {n : ℕ} [NeZero n] (ℓ : Fin n → ℝ) (hℓ : SeqLoss.FixedFraction.IsLoss ℓ) :
    Supermodularity.Cooperative.IsConvexGame (liabilityGame ℓ) := by sorry

end SeqLoss.LiabilityGame
Source
Gudmundsson, Hougaard & Ko, Sharing Sequentially Triggered Losses, accepted manuscript (2023), p. 24, Appendix A, proof of Theorem 3, first paragraph
Human review
  • Endorsed by Shuze Chen · Oct 15, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 15, 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