in_std_simplex
def
A vector lies in the standard simplex: nonnegative entries summing to 1.
Statement
def in_std_simplex {n : ℕ} (w : Fin n → ℝ) : Prop
- Defined in
- How Banzhaf Makes a Victor: Curing a Distortion Paradox in Weighted Voting, EC 2026, Secs. 2-3 and 5; formalized by the operator (Claude), 2026-10-03
- Verified
- 03 Oct 2026
- Axioms
- none listed
- Used by 3
- is_optimal_banzhaf_weightsWeights are optimal for the inverse power problem (m, q, beta^p) if they lie in the simplex and minimise the discrepancy over the simplex.
- banzhaf_strict_majority_veto_distortion_ge_five_thirdsAt simple majority with strict quota, the Banzhaf index has veto distortion at least 5/3: for target (3/10, 7/10, 0) the weights (1/2,…
- bz3_props_patternThe winning pattern of a 3-player game with simplex weights and strict quota 1/2 satisfies bz3_props.
Lean source view module on GitHub
/-- `w` lies in the standard simplex: nonnegative entries summing to 1. -/ def in_std_simplex {n : ℕ} (w : Fin n → ℝ) : Prop := (∀ i, 0 ≤ w i) ∧ ∑ i, w i = 1