# Alternative proofs of Arrow’s general possibility theorem

- 1.1k Downloads
- 1 Citations

## Abstract

This paper provides two brief proofs of Arrow’s general possibility theorem. The second one is simple and short. Our proofs are inspired by the pioneering work by Inada (Ann. Inst. Stat. Math. **6**:115–122, 1954).

## Keywords

Arrow’s impossibility theorem Alternative proof## JEL Classification

D70 D71## 1 Introduction

Immediately after the publication of *Social Choice and Individual Values* (Arrow 1951), Inada (1954) provided alternative proofs of three results in the book, including for *Arrow’s general possibility theorem*. Later, Blau (1957) pointed out that the original version of the theorem is incorrectly stated; his observation also applies to Inada’s proof. In response to Blau (1957), Arrow (1963) provided a restatement of the general possibility theorem and its proof. Since then, most authors have followed the revised version, which is included in the second edition of Arrow’s book. As Blau (1957) and Arrow (1963) reformulated the set of axioms on which Inada’s proof was based, Inada’s proof has not received much attention in the context of Arrovian social choice theory.

The present article aims to rehabilitate Inada’s proof of Arrow’s general possibility theorem. In line with Inada (1954), we provide two simple proofs of the second version of the general possibility theorem. These proofs have some notable features compared with the existing ones. The standard approach to prove Arrow’s theorem was developed by Arrow (1963) and Sen (1970, 1979).^{1} Most proofs of the theorem are constructed along the same lines (Fishburn 1970; Blau 1972; Sen 1986, 1995; Denicolò 1996, 2001; Suzumura 2000). In such proofs, the so-called *field expansion lemma* is established as the first step: it says that if a group of individuals has decisive power over some pairs of alternatives, then it has decisive power over all pairs. Thus, this lemma shows that the decisiveness structure is invariant across all pairs under Arrow’s axioms.^{2} As the next step, the *group-contraction lemma* is proved using the field expansion lemma: for any decisive group with more than one individual, there exists some smaller decisive group within it. The theorem immediately follows from this lemma.

In Contrast to the standard proof, Inada and we do not construct the field expansion lemma as an auxiliary step. Instead, we employ the concept of a *minimal* (almost) decisive set to construct a group-contraction procedure as the first step: we prove that a minimal (almost) decisive set is a singleton for all pairs. Next, we show that the minimal (almost) decisive set is invariant across all pairs. Finally, we explain the relationship between our proofs and Inada’s. Inada used the concept of a decisive set, whereas we apply the concept of an almost decisive set in our first proof.

This difference is because of the difference between the original axioms and those of the 1963 theorem. In our second proof, we reconstruct the argument to apply standard decisiveness. It is one of the simplest proofs of Arrow’s theorem.

## 2 Terminology

Let \(X\) be the set of alternatives; this set must contain at least three alternatives. Let \(\succsim \) be a binary relation on \(X\). Moreover, the symmetric and asymmetric parts of \(\succsim \) are denoted by \(\sim \) and \(\succ \), respectively.^{3} A binary relation is said to be an *ordering* if and only if it is complete and transitive.^{4} Let \(\wp \) be the set of all orderings on \(X\).

Let \(N=\{ 1,2, \dots ,n\}\) be the finite set of individuals.^{5} Each individual \(i \in N\) has a preference ordering \(\succsim _i \in \wp \) on \(X\). Then, a typical profile of individual preference orderings can be denoted by \(\succsim _N =(\succsim _i)_{i \in N} \in \wp ^N\). For each \(D \subseteq N\), let \(\succsim _D := (\succsim _j)_{j \in D}\).

Let \(\succsim _N|_{A}\) be the restriction of \(\succsim _N \in \wp ^N\) to \(A \subseteq X\). Analogically, \(\succsim _i|_{A}\) is the restriction of \(\succsim _i \in \wp \) to \(A \subseteq X\).

A *constitution function* (or *social welfare function*) is a function \(f{:}\,\wp ^N \rightarrow \wp \) that maps each profile \(\succsim _N \in \wp ^N\) to a unique preference ordering \(f(\succsim _N) \in \wp \). For simplicity, we often use \(\succsim \) to denote \(f(\succsim _N)\) in what follows. The individual \(i \in N\) is a dictator for \(f\) if for all \(x, y \in X\) and all \(\succsim _N \in \wp ^N\), \(x \succ _i y \Rightarrow x \succ y \).

Next, we introduce axioms on \(f\). These are formulated in the second edition of Arrow’s book.

**Weak Pareto (WP):** \(\forall \succsim _N \in \wp ^N, \forall x,y \in X\), if \(x \succ _i y\) for all \(i \in N\), then \(x \succ y\).

**Independence of Irrelevant Alternatives (IIA):** \(\forall x, y\) \(\in X, \forall \succsim _N, \succsim _N^{\prime } \in \wp ^N\), if \(\succsim _N|_{\{ x,y \} } =\succsim _N^{\prime }|_{\{ x,y \} }\), then \([ x \succsim y \Leftrightarrow x \succsim ^{\prime } y ]\) and \([ y \succsim x \Leftrightarrow y \succsim ^{\prime } x ]\), where \(\succsim = f(\succsim _N)\) and \(\succsim ^{\prime } = f(\succsim _N^{\prime })\).

**Non-Dictatorship (ND):** There exists no dictator for \(f\).

*almost decisive over*\((x,y)\)

*for*\(f\) if for all \(\succsim _N \in \wp ^N\),

*almost decisive*

*for*\(f\) if it is almost decisive over \((x,y)\) for \(f\) for all \((x,y) \in X \times X\).

*decisive over*\((x,y)\)

*for*\(f\) if for all \(\succsim _N \in \wp ^N\),

*decisive*

*for*\(f\) if it is decisive over \((x,y)\) for \(f\) for all \((x,y) \in X \times X\).

## 3 The formal statement of Arrow’s theorem and its proofs

### **Theorem1**

There exists no constitution function \(f\) that satisfies weak Pareto, independence of irrelevant alternatives, and non-dictatorship.

*First Proof*Given \(a,b \in X\), \(M_{ab}\) denotes a minimal almost decisive set over \((a,b)\) for \(f\). Since \(N\) is a finite set, WP implies that \(M_{ab} \ne \emptyset \). We first show that \(M_{ab}\) is a singleton for all \(a,b \in X\) with \(a \ne b\). Take any distinct \(x,y \in X\). Let \(z \in X \setminus \{x,y \}\), and let \(\succsim _N \in \wp ^N\) be such that

The essential difference between our first proof and Inada’s is that Inada applies the concept of a decisive set, whereas we have applied the concept of an almost decisive set. Inada’s argument is based on the original version of Arrow’s theorem; thus, he postulates *positive association of social and individual values* (Condition 2 of Arrow’s original axioms). We now state it as follows.

**Positive Association of Social and Individual Values:**For all \(\succsim _N, \succsim _N^{\prime }\), if

- (i)
\(\forall i \in N: \ x^{\prime } \succsim _i y^{\prime } \Leftrightarrow x^{\prime } \succsim ^{\prime }_i y^{\prime }\) for all \(x^{\prime },y^{\prime } \in X \setminus \{ x \}\);

- (ii)
\(\forall i \in N: \ x \succsim _i y^{\prime }\,\, \Rightarrow x \succsim _i y^{\prime }\) for all \(y^{\prime } \in X \setminus \{ x \}\);

- (iii)
\(\forall i \in N: \ x \succ _i y^{\prime } \,\,\Rightarrow x \succ ^{\prime }_i y^{\prime }\) for all \(y^{\prime } \in X \setminus \{ x \}\);

In the presence of the positive association, the two decisiveness concepts are equivalent:^{6} if a set is almost decisive over \((x,y)\) for \(f\), then it must be decisive over \((x,y)\) for \(f\).^{7} Since Inada’s proof depends on the equivalence, we cannot directly follow his argument. In the absence of the positive association, one would have to work with almost decisive sets.

In our second proof, we modify the argument in the first proof to directly apply *decisiveness*.

*Second Proof*Given \(a,b \in X\), \(M^*_{ab}\) denotes a minimal decisive set over \((a,b)\) for \(f\). WP implies that \(M^*_{ab} \ne \emptyset \). We show that \(M^*_{ab}\) is a singleton for all \(a,b \in X\) with \(a \ne b\). Take any distinct \(x,y \in X\). Let \(z \in X \setminus \{x,y \}\), and let \(\succsim _N \in \wp ^N\) be such that

Recently, the “pivotal voter” approach has received much attention (Barberá 1983; Geanakoplos 2005; Reny 2001; Cato 2010; Yu 2012). The approach is considered to have an advantage when researchers make simple and short proofs. Moreover, it is intuitively appealing. Yu (2012) indeed constructs a new short proof of Arrow’s theorem along this line.

Our second proof shows that the classical “decisiveness” approach can also provide a one-shot proof of the theorem. The key of our proof is the order of lemmas (the field expansion and group contraction lemmas). In the standard proof of the decisiveness approach, the invariance property of the decisive structure is first proved (the field expansion lemma), and an influential individual is next identified (the group contraction lemma). In our proof, an influential individual is first identified and the decisive structure is clarified next. This order is the same as that in the pivotal voter approach: a pivotal voter is first identified, and then, his decisive power is proved. Hence, our proof is similar to the pivotal voter approach in that an influential individual is identified in the first step.

The difference between our proof and the pivotal voter approach is in what kind of influence is focused. A pivotal voter is an individual who has an influence over a particular pair under a particular profile; we focus on an individual who has an influence over a particular pair under all profiles.^{8}

## Footnotes

- 1.
Recently, several authors have examined new approaches to prove Arrow’s theorem. Following Barberá (1983), the “pivotal voter” approach was developed further by many authors (Geanakoplos 2005; Reny 2001; Yu 2012). Blackorby et al. (1984) provided a diagrammatic proof of Arrow’s theorem. Feldman and Serrano (2006) and Feldman and Serrano (2008) proved variants of the theorem by employing neutrality axioms. In addition, see Dardanoni (2001) and Feldman74.

- 2.
- 3.
That is, the two binary relations \(\sim \) and \(\succ \) are defined by \(x \sim y \Leftrightarrow (x \succsim y \text{ and } y \succsim x)\) and \(x \succ y \Leftrightarrow (x \succsim y \text{ and } \lnot y \succsim x)\).

- 4.
A binary relation \(\succsim \) is

*complete*if and only if, for all \(x, y\in X\), \(x \succsim y \text{ or } y \succsim x;\;\succsim \) is*transitive*if and only if, for all \(x, y, z \in X\), \([x \succsim y \text{ and } y \succsim z] \Rightarrow x \succsim z\). - 5.
The finiteness of the population is crucial to obtain Arrow’s theorem. Under infinite population, there exists a constitution satisfying Arrow’s axioms. This fact was first discovered by Julian H. Blau. The formal discussion is provided by Fishburn (1970). See also Kirman and Sondermann (1972), Hansson (1976), and Cato (2012).

- 6.
The equivalence result does not depend on the postulate of collective rationality.

- 7.
Arrow (1951) formally stated the fact and used it in his proof (Consequence 2, p. 53).

- 8.
By definition, a decisive voter is pivotal.

## Notes

### Acknowledgments

I thank Nicholas C. Yannelis and two anonymous referees for their comments and helpful suggestions. This paper was financially supported by Grant-in-Aid for Young Scientists (B) from the Japan Society for the Promotion of Science and the Ministry of Education, Culture, Sports, Science and Technology.

## References

- Arrow, K.J.: Social Choice and Individual Values. Wiley, New York (1951)Google Scholar
- Arrow, K.J.: Social Choice and Individual Values, 2nd edn. Wiley, New York (1963)Google Scholar
- Barberá, S.: Pivotal voters: a new proof of Arrow’s theorem. Econ. Lett.
**6**, 13–16 (1983)CrossRefGoogle Scholar - Blackorby, C., Donaldson, D., Weymark, J.: Social choice with interpersonal utility comparisons: a diagrammatic introduction. Int. Econ. Rev.
**25**, 327–356 (1984)CrossRefGoogle Scholar - Blau, J.H.: The existence of social welfare functions. Econometrica
**25**, 302–313 (1957)CrossRefGoogle Scholar - Blau, J.H.: A direct proof of Arrow’s theorem. Econometrica
**40**, 61–67 (1972)CrossRefGoogle Scholar - Cato, S.: Brief proofs of Arrovian impossibility theorems. Soc. Choice Welf.
**35**, 267–284 (2010)CrossRefGoogle Scholar - Cato, S.: Quasi-decisiveness, quasi-ultrafilter, and social quasi-orderings. Soc. Choice Welf. (forthcomming) (2012). doi: 10.1007/s00355-012-0677-z Google Scholar
- Dardanoni, V.: A pedagogical proof of Arrow’s impossibility theorem. Soc. Choice Welf.
**18**, 107–112 (2001)CrossRefGoogle Scholar - Denicolò, V.: An elementary proof of Arrow’s impossibility theorem. Jpn. Econ. Rev.
**47**, 432–435 (1996)CrossRefGoogle Scholar - Denicolò, V.: An elementary proof of Arrow’s impossibility theorem: correction. Jpn. Econ. Rev.
**52**, 134–135 (2001)CrossRefGoogle Scholar - Feldman, A.M.: A very unsubtle version of Arrow’s impossibility theorem. Econ. Inq.
**12**, 534–546 (1974)CrossRefGoogle Scholar - Feldman, A.M., Serrano, R.: Welfare Economics and Social Choice Theory, 2nd edn. Springer, New York (2006)Google Scholar
- Feldman, A.M., Serrano, R.: Arrow’s impossibility theorem: two simple single-profile versions. Harvard Coll. Math. Rev.
**2**, 46–57 (2008)Google Scholar - Fishburn, P.C.: Arrow’s impossibility theorem: concise proof and infinite voters. J. Econ. Theory
**2**, 103–106 (1970)CrossRefGoogle Scholar - Geanakoplos, J.: Three brief proofs of Arrow’s impossibility theorem. Econ. Theory
**26**, 211–215 (2005)CrossRefGoogle Scholar - Hansson, B.: The existence of group preference functions. Public Choice
**28**, 89–98 (1976)CrossRefGoogle Scholar - Inada, K.: Elementary proofs of some theorems about the social welfare function. Ann. Inst. Stat. Math.
**6**, 115–122 (1954)CrossRefGoogle Scholar - Kirman, A.P., Sondermann, D.: Arrow’s theorem, many agents, and invisible dictators. J. Econ. Theory
**5**, 267–277 (1972)CrossRefGoogle Scholar - Reny, P.J.: Arrow’s theorem and the Gibbard–Satterthwaite theorem: a unified approach. Econ. Lett.
**70**, 99–105 (2001)CrossRefGoogle Scholar - Sen, A.K.: Collective Choice and Social Welfare. Holden-Day, San Francisco (1970)Google Scholar
- Sen, A.K.: Personal utilities and public judgements: or what’s wrong with welfare economics? Econ. J.
**89**, 537–558 (1979)CrossRefGoogle Scholar - Sen, A.K.: Social choice theory. In: Arrow, K.J., Intriligator, M.D. (eds.) Handbook of Mathematical Economics, vol. 3, pp. 1073–1181. North-Holland, Amsterdam (1986)Google Scholar
- Sen, A.K.: Rationality and social choice. Am. Econ. Rev.
**85**, 1–24 (1995)Google Scholar - Suzumura, K.: Welfare economics beyond welfarist-consequentialism. Jpn. Econ. Rev.
**51**, 1–32 (2000)CrossRefGoogle Scholar - Ubeda, L.: Neutrality in Arrow and other impossibility theorems. Econ. Theory
**23**, 195–204 (2003)CrossRefGoogle Scholar - Yu, N.N.: A one-shot proof of Arrow’s impossibility theorem. Econ. Theory
**50**, 523–525 (2012)CrossRefGoogle Scholar