Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

(50:B) — non-negative weights define a W with (49:W*) iff they fulfil (50:B:a), (50:B:b)

Proved
TheoryOfGames.SimpleGames.weights_wstar_iff

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

cooperative-gamesp2o-batch-b23ap2o-gran-per-chapterp2o-plan-bookp2o-v1simple-gamesweighted-majority-games

Let w1,…,wn≧0w_1, \dots, w_n \geqq 0w1​,…,wn​≧0 be non-negative weights and let WWW be the set of all S⊆IS \subseteq IS⊆I with ∑i∈Swi>12∑i=1nwi\sum_{i \in S} w_i > \tfrac12 \sum_{i=1}^n w_i∑i∈S​wi​>21​∑i=1n​wi​ (50:1). Then WWW satisfies (49:W*) if and only if

  1. (50:B:a) 0≦wi0<12∑i=1nwi0 \leqq w_{i_0} < \tfrac12 \sum_{i=1}^n w_i0≦wi0​​<21​∑i=1n​wi​ for all i0=1,…,ni_0 = 1, \dots, ni0​=1,…,n, and
  2. (50:B:b) ∑i∈Swi≠12∑i=1nwi\sum_{i \in S} w_i \neq \tfrac12 \sum_{i=1}^n w_i∑i∈S​wi​=21​∑i=1n​wi​ for all S⊆IS \subseteq IS⊆I.

Verbally: no player has half the total weight or more, and no combination of players has precisely half. The weights satisfying (50:B) are exactly those defining a simple game, the weighted majority game [w1,…,wn][w_1, \dots, w_n][w1​,…,wn​].

Formalization Note The book states the equivalence for arbitrary real weights. Its argument for (49:W*:b) uses wi≧0w_i \geqq 0wi​≧0 ("clearly satisfied if all wi≧0w_i \geqq 0wi​≧0"), and without that assumption the "only if" direction is false: [10,10,10,−110][10, 10, 10, -\tfrac1{10}][10,10,10,−101​] defines the WWW of the direct majority of the first three players, which satisfies (49:W*), while w4<0w_4 < 0w4​<0. The statement is therefore made for non-negative weights, where it is exactly the book's equivalence; the "if" direction is unaffected, since (50:B:a) contains wi≧0w_i \geqq 0wi​≧0.

Preamble
import Mathlib
import Definitions.Def_TheoryOfGames_SimpleGames_Majority
Formal statement
namespace TheoryOfGames.SimpleGames

/-- (50:B), p. 433, for non-negative weights: the weights `w₁, …, wₙ` define by (50:1) a `W`
which satisfies (49:W*) if and only if they fulfil (50:B:a) and (50:B:b).
(The book states the equivalence without the standing assumption `wᵢ ≧ 0`; its sufficiency
argument for (49:W*:b) uses `wᵢ ≧ 0`, and without it the "only if" fails — e.g.
`[10, 10, 10, -1/10]` defines the `W` of the direct majority of the first three players.) -/
theorem weights_wstar_iff {n : ℕ} (w : Fin n → ℝ) (hw : ∀ i, 0 ≤ w i) :
    SatisfiesWStar (weightedW w) ↔ SatisfiesB w := by sorry

end TheoryOfGames.SimpleGames
Source
von Neumann & Morgenstern, Theory of Games and Economic Behavior (60th-anniversary ed., Princeton 2007), p. 433, (50:B); p. 429, (49:W*)
Human review
  • Endorsed by Shuze Chen · Oct 2, 2026

    Confirmed by the moderator at approval.

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