Calculus and extensions of Arrow's theorem (Q1176220)

Let \(F\) be a smooth aggregation procedure. If the Jacobian of \(F\) at \(0\) has full rank, then \(F\) will exhibit aggregation paradoxes, such as Simpson's paradox of conditional probability. The paper proves an analogous result for discrete aggregation procedures, using their level sets. This leads to new proofs of Arrow's theorem, the Gibbard- Satterthwaite theorem, Nakamura's theorem, and Sen's liberal paradox. The paper also proves a powerful extension of the domain restriction results of \textit{E. Kalai} and \textit{E. Muller} [J. Econ. Theory 16, 457-469 (1977; Zbl 0407.90005)] and \textit{E. Kalai} and \textit{Z. Ritz} [ibid. 22, 23-36 (1980; Zbl 0429.90006)]. This paper is a tour de force.