(50:B) — non-negative weights define a W with (49:W*) iff they fulfil (50:B:a), (50:B:b)
ProvedTheoryOfGames.SimpleGames.weights_wstar_iffLet be non-negative weights and let be the set of all with (50:1). Then satisfies (49:W*) if and only if
- (50:B:a) for all , and
- (50:B:b) for all .
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 .
Formalization Note The book states the equivalence for arbitrary real weights. Its argument for (49:W*:b) uses ("clearly satisfied if all "), and without that assumption the "only if" direction is false: defines the of the direct majority of the first three players, which satisfies (49:W*), while . 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 .
import Mathlib import Definitions.Def_TheoryOfGames_SimpleGames_Majority
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
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.