CoalitionalGame.IsConvex.isSuperadditive
theoremverifiedformalizationimported Lean
Convexity implies superadditivity. The [LE U] constraint is all that's needed beyond the section's [AddZeroClass U].
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in open Finset BigOperators in variable {N : Type*} [DecidableEq N] {U : Type*} [AddZeroClass U] in variable (G : CoalitionalGame N U) in theorem CoalitionalGame.IsConvex.isSuperadditive [LE U] (hconv : G.IsConvex) : G.IsSuperadditive
- Formalizes
- EconCSLib, `CoalitionalGame.IsConvex.isSuperadditive`
- Lean proof
- By xbei (from the file's git history), from github.com/gametheoryinlean/EconCSLib at
1a88f809b538(Copyright (c) 2026 EconCSLib contributors. All rights reserved, Apache-2.0). Compiled here against leanprover/lean4:v4.33.1, Mathlib v4.33.1; written for leanprover/lean4:v4.30.0.CoalitionalGame.IsConvex.isSuperadditive← CoalitionalGame.IsConvex.isSuperadditive (EconCSLib/GameTheory/CoalitionalGame/Basic.lean:124): verbatim
- Verified
- 08 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 3
- CoalitionalGame.IsConvexA game is convex if it satisfies the supermodularity condition. [MSZ 17.51] Requires
[LE U](addition comes from[AddZeroClass U]). - CoalitionalGame.IsSuperadditiveA game is superadditive if the worth of the union of disjoint coalitions is at least the sum of their worths. [MSZ 16.8] Requires
[LE U]… - CoalitionalGameA coalitional game with transferable utility.
Nis the player type;Uis the utility type.vassigns a worth to each coalition, with…
- CoalitionalGame.IsConvexA game is convex if it satisfies the supermodularity condition. [MSZ 17.51] Requires
Lean source view module on GitHub
Choose a tactic — a marked line — to see the goals Lean had before and after it, as in Lean’s infoview. Step with ← → or j k.
set_option autoImplicit true inset_option relaxedAutoImplicit true inopen Finset BigOperators invariable {N : Type*} [DecidableEq N] {U : Type*} [AddZeroClass U] invariable (G : CoalitionalGame N U) in/-- Convexity implies superadditivity. The `[LE U]` constraint is all that's needed beyond the section's `[AddZeroClass U]`. -/theorem CoalitionalGame.IsConvex.isSuperadditive [LE U] (hconv : G.IsConvex) : G.IsSuperadditive := by intro S T hST have h := hconv S T rw [Finset.disjoint_iff_inter_eq_empty.mp hST, G.empty_zero, add_zero] at h exact h