Docs / Semantics / Aggregation / Arrow

Arrow's theorem

import Linglib.Semantics.Aggregation.Arrow · namespace Aggregation

This file proves Arrow's theorem. With three or more alternatives, a rule on profiles of values that is ordinally invariant, outputs weak orderings, respects weak Pareto and is independent of irrelevant alternatives has a dictator, an individual whose strict rankings are the strict overall rankings. Ordinal invariance makes the values carry no more than each individual's ranking, which recovers Arrow's setting. The proof is by field expansion and group contraction: the whole population is decisive, an almost decisive group is decisive for every pair, and a decisive group with two or more members has a decisive proper subgroup.

Main statements

References

  • Arrow 1950, A Difficulty in the Concept of Social Welfare
  • Sen 1970, Collective Choice and Social Welfare

Arrow's theorem

L55–58
L64–70

Arrow's theorem says that with three or more alternatives a rule that is ordinally invariant, outputs weak orderings, respects weak Pareto and is independent has a dictator.

theorem exists_isDictatorL264–287
{ι : Type u_1} {α : Type u_2} {K : Type u_3} [LinearOrder K] {a : Rule ι α K} [Field K] [IsStrictOrderedRing K] [Fintype α] [Fintype ι] (hO : MeasurementTheory.Invariant (ordinal ι K) a) (hW : WeakOrderValued a) (hP : WeakPareto a) (hI : Independent a) (h₃ : 3 ≤ Fintype.card α) :
∃ (i : ι), IsDictator a i
L289–293

Arrow's theorem is an impossibility, since no rule meets all of Arrow's conditions.

theorem arrowL295–297
{ι : Type u_1} {α : Type u_2} {K : Type u_3} [LinearOrder K] [Field K] [IsStrictOrderedRing K] [Fintype α] [Fintype ι] (h₃ : 3 ≤ Fintype.card α) (a : Rule ι α K) :
¬Arrovian (ordinal ι K) a