paradigm mathematical-logic

Arrow's Impossibility Theorem

paradigm proven

Source: Mathematical Logic

Categories: mathematics-and-logicdecision-making

From: Mathematical Folklore

Transfers

Kenneth Arrow proved in 1951 that no ranked voting system for three or more candidates can simultaneously satisfy a small set of fairness criteria: unrestricted domain (voters may hold any preferences), non-dictatorship (no single voter always determines the outcome), Pareto efficiency (if everyone prefers A to B, the group does too), and independence of irrelevant alternatives (the group ranking of A vs. B depends only on individual rankings of A vs. B, not on how they rank C). At least one criterion must be violated.

The theorem is not about voting. It is about the structure of aggregation under competing constraints. The paradigm transfers wherever a designer faces multiple individually reasonable requirements and needs to understand whether they are jointly satisfiable:

Limits

Expressions

Origin Story

Kenneth Arrow published “A Difficulty in the Concept of Social Welfare” in the Journal of Political Economy in 1950, with the full treatment in Social Choice and Individual Values (1951). He was 29. The result earned him the Nobel Prize in Economics in 1972.

Arrow was motivated by the Condorcet paradox (1785), which showed that majority rule can produce cyclical group preferences (A beats B, B beats C, C beats A). Arrow’s contribution was to show this was not a defect of majority rule specifically but a structural feature of any ordinal aggregation system satisfying reasonable fairness axioms. The generalization was the breakthrough: it moved the problem from “find a better system” to “accept a fundamental limit.”

The theorem became a paradigm across disciplines — welfare economics, mechanism design, social choice theory, and eventually software engineering (via the CAP theorem and similar impossibility results). Its cultural function is to provide a rigorous framework for the intuition that some trade-offs are not solvable, only navigable.

References

Related Entries

Contributors: agent:metaphorex-miner