The mathematical proof you are referring to is one of the most famous and profound concepts in social choice theory, economics, and political science. It is called Arrow’s Impossibility Theorem, formulated by economist Kenneth Arrow in his 1951 PhD thesis (which later earned him the Nobel Memorial Prize in Economic Sciences).

In short, Arrow’s Impossibility Theorem proves mathematically that when voters have three or more options to choose from, no ranked-choice voting system can convert individual preferences into a community-wide ranking while simultaneously meeting a specific set of basic, common-sense criteria for "fairness."

Here is a detailed breakdown of the theorem, the criteria for fairness, and why they logically contradict one another.

The Setup

Imagine an election with three or more candidates (let's call them A, B, and C). The voters are asked to rank the candidates in order of preference (e.g., 1st: B, 2nd: A, 3rd: C).

The goal of a voting system (the "social welfare function") is to take all of these individual rankings, crunch the numbers, and produce a single, definitive ranking that represents the "will of the people."

The Four Criteria of "Perfect Fairness"

Arrow established four mathematical conditions that any perfectly fair and rational democratic system should be able to meet:

1. Unrestricted Domain (Freedom of Choice) The voting system must account for all individual preferences. A voter must be allowed to rank the candidates in any order they choose, and the system must be able to process those rankings to produce a result.

2. Non-Dictatorship The final result must not simply mirror the preferences of one single person. No single voter possesses the power to always determine the group's outcome regardless of what the rest of the voters want.

3. Pareto Efficiency (Unanimity) If every single voter prefers Candidate A over Candidate B, the final election result must rank Candidate A higher than Candidate B.

4. Independence of Irrelevant Alternatives (IIA) This is the most crucial (and most frequently violated) criterion. It states that the group's preference between Candidate A and Candidate B should depend only on how voters ranked A relative to B. * Example: If society prefers Candidate A to Candidate B, the sudden entry or exit of Candidate C into the race should not magically cause society to suddenly prefer B over A. (In real-world politics, violating this rule is known as the "spoiler effect," where a third-party candidate ruins the chances of a mainstream candidate).

The Impossibility (The Proof)

Arrow's mathematical proof demonstrates that it is strictly mathematically impossible for any ranked voting system to satisfy all four of these conditions simultaneously.

To understand why, we can look at a simpler concept that paves the way for Arrow's math, known as the Condorcet Paradox.

Imagine three voters ranking three candidates: * Voter 1 ranks: A > B > C * Voter 2 ranks: B > C > A * Voter 3 ranks: C > A > B

Let's look at the head-to-head match-ups: * A vs B: Voters 1 and 3 prefer A over B. (A wins 2-to-1) * B vs C: Voters 1 and 2 prefer B over C. (B wins 2-to-1) * C vs A: Voters 2 and 3 prefer C over A. (C wins 2-to-1)

The "will of the people" is that A is better than B, B is better than C, and C is better than A. This is a logical loop—like Rock, Paper, Scissors. There is no clear winner.

If an election system tries to resolve this paradox and output a single winner, it must break one of Arrow's rules. * If you just declare A the winner, you are ignoring the fact that a majority prefers C over A (Violating Pareto or IIA). * If you let the election official decide the tie, you violate Non-Dictatorship. * If you tell voters they aren't allowed to vote in the specific pattern that causes the paradox, you violate Unrestricted Domain.

Arrow took this paradox and expanded it using rigorous set theory, proving that no matter how complex your algorithm for counting ranked ballots is (Plurality, Borda Count, Instant Runoff, etc.), a scenario will inevitably exist where at least one of the four fairness criteria is violated.

What are the Implications for Democracy?

When people first hear about Arrow’s Impossibility Theorem, they often conclude that "democracy is mathematically impossible." This is a misinterpretation.

The theorem simply proves that there is no perfect voting system. Because perfect fairness is mathematically impossible, society must decide which flaws it is most willing to tolerate.

For example: * First-Past-The-Post (Plurality Voting): Used in the US and UK. It routinely violates the IIA criterion due to the spoiler effect (e.g., Ralph Nader in 2000). * Ranked Choice Voting (Instant Runoff): Solves many spoiler issues, but mathematically can still violate IIA, and in rare, bizarre scenarios, can violate the Pareto principle (where ranking a candidate higher actually causes them to lose).

The Loophole: Cardinal Voting

It is important to note that Arrow’s theorem applies strictly to ordinal voting systems—systems where voters rank candidates (1st, 2nd, 3rd).

The theorem does not apply to cardinal voting systems, where voters assign a score to candidates independently. Examples include: * Approval Voting: You can vote for as many candidates as you want. (e.g., "I approve of A and C, but not B"). * Score Voting: You give each candidate a rating from 1 to 10, like reviewing a movie. The candidate with the highest average score wins.

Because these systems don't rely on comparing candidates to one another in a ranked hierarchy, they neatly bypass Arrow's Impossibility Theorem, though they come with their own distinct psychological and strategic flaws.