Every democracy runs on a beautiful lie: that voting systems can be fair.
They can’t.
Not “imperfect.” Not “could be better.”
Mathematically, provably, fundamentally impossible.
This isn’t a political opinion. It’s a theorem. Proven in 1951 by economist Kenneth Arrow, who later won a Nobel Prize for basically proving that democracy is broken.
Welcome to Arrow’s Impossibility Theorem.
What Does “Fair” Even Mean?
Before we break democracy, let’s define what we want from a voting system.
Seems reasonable to ask for these five things:
- Unanimity (Pareto Efficiency) If every single voter prefers Candidate A over Candidate B, then the election should rank A above B.
This is the bare minimum. If literally everyone agrees, the system shouldn’t contradict them.
- Non-Dictatorship No single voter should determine the outcome for everyone.
Obvious, right? If one person’s vote always decides the winner regardless of what everyone else votes, that’s not democracy. That’s monarchy with extra steps.
- Independence of Irrelevant Alternatives (IIA) The ranking between two candidates shouldn’t change based on a third candidate entering or leaving the race.
Example: Say voters prefer:
- Alice > Bob > Carol
If Carol drops out, the ranking between Alice and Bob shouldn’t flip. That would be insane.
- Transitivity If the group prefers A > B and B > C, then the group should prefer A > C.
Without this, you get circular preferences. A beats B beats C beats A. That’s not a ranking. That’s a paradox.
- Unrestricted Domain The system should work for any set of individual preferences. Voters should be free to rank candidates however they want.
Surely, we can design a system that satisfies all five.
Right?
Arrow Says: No.
Arrow’s Impossibility Theorem states:
No ranked voting system with three or more candidates can simultaneously satisfy all five conditions.
Not “it’s hard.”
Not “we haven’t found one yet.”
Impossible. Full stop.
You can have four of the conditions. But never all five.
And here’s the kicker: the proof is airtight. It’s not a conjecture. It’s a mathematical certainty.
Democracy, as we imagine it, cannot exist.
The Proof (Simplified)
I’m not going to walk through the full proof—it’s dense and technical. But here’s the core idea:
Imagine three voters (Alice, Bob, Carol) ranking three candidates (X, Y, Z).
Alice’s preference: X > Y > Z
Bob’s preference: Y > Z > X
Carol’s preference: Z > X > Y
Now, try to aggregate these into a “group preference” that satisfies all five conditions.
If you satisfy unanimity, transitivity, and non-dictatorship, you inevitably violate IIA.
Specifically: the outcome depends on how you count the votes. And every counting method either:
- Violates IIA (adding/removing a candidate changes relative rankings), or
- Makes one voter a dictator (their preference always wins)
There’s no escape. The math doesn’t allow it.
Real-World Examples: Where Democracy Breaks
Example 1: The Spoiler Effect (Violating IIA)
US Presidential Election, 2000.
- George W. Bush: 50,456,002 votes
- Al Gore: 50,999,897 votes
- Ralph Nader: 2,882,955 votes
Gore lost Florida (and thus the presidency) by 537 votes.
Nader, a progressive candidate, pulled votes from Gore. If Nader hadn’t run, most of his voters would’ve chosen Gore as their second choice.
Nader’s presence changed the outcome between Bush and Gore.
That’s a direct violation of IIA. A “irrelevant” third candidate altered the race between the top two.
Mathematically, there was no way to avoid this. The system (plurality voting) satisfies unanimity, non-dictatorship, and transitivity. So it must violate IIA.
Arrow predicted this. Decades before it happened.
Example 2: The Condorcet Paradox (Violating Transitivity)
Imagine three voters choosing between three policies:
Voter 1: Policy A > Policy B > Policy C
Voter 2: Policy B > Policy C > Policy A
Voter 3: Policy C > Policy A > Policy B
Let’s do pairwise comparisons:
A vs. B:
- Voter 1 prefers A
- Voter 2 prefers B
- Voter 3 prefers A
A wins 2-1.
B vs. C:
- Voter 1 prefers B
- Voter 2 prefers B
- Voter 3 prefers C
B wins 2-1.
C vs. A:
- Voter 1 prefers A
- Voter 2 prefers C
- Voter 3 prefers C
C wins 2-1.
So: A beats B. B beats C. C beats A.
The group has circular preferences. There’s no “best” option. Just a loop.
This is called a Condorcet cycle. And it’s not rare. It happens constantly in real elections.
Arrow’s theorem says this is unavoidable. If you want unanimity, non-dictatorship, and IIA, you will get intransitivity sometimes.
Why This Matters
Arrow’s theorem isn’t just abstract math. It has real consequences.
Consequence 1: Every voting system is manipulable.
Because no system satisfies all five conditions, every system has exploits.
Plurality voting? Spoiler effect.
Ranked choice voting? Can violate monotonicity (getting more votes can make you lose).
Approval voting? Can elect candidates nobody ranked first.
There is no “perfect” system. Only tradeoffs.
Consequence 2: Strategic voting is rational.
If the system is manipulable, voters should vote strategically, not honestly.
In plurality voting, you shouldn’t vote for your favorite candidate if they can’t win. That’s “wasting” your vote.
In ranked choice, you might rank your second choice first to prevent your last choice from winning.
The system rewards dishonesty. Because the system is mathematically broken.
Consequence 3: Election results are somewhat arbitrary.
Change the voting method, change the winner.
Plurality voting might elect Candidate A.
Ranked choice might elect Candidate B.
Approval voting might elect Candidate C.
Same voters. Same preferences. Different outcomes.
Which one is “correct”?
None of them. Because there is no correct answer.
Escape Clauses (The Five Compromises)
Arrow proved you can’t have all five conditions. But you can have four.
Every voting system chooses which condition to violate:
- Violate Unanimity?
No real voting system does this. It’s too obviously broken.
- Violate Non-Dictatorship?
Some systems do this implicitly. Tiebreaker rules often give one person (the chair, the oldest member, etc.) deciding power. That’s just dictatorship with paperwork.
- Violate IIA?
Most systems violate this. Plurality voting, ranked choice, runoff elections—all suffer from spoiler effects.
- Violate Transitivity?
Condorcet methods sometimes produce cycles. When they do, we use arbitrary tiebreakers.
- Violate Unrestricted Domain?
Some systems only work if voter preferences are “well-behaved” (single-peaked, for instance). This restricts what voters can express.
Each compromise creates different pathologies. Pick your poison.
The Philosophical Implications
Arrow’s theorem says something deeper than “voting is hard.”
It says that collective rationality might not exist.
Even if every individual is rational (has consistent, transitive preferences), the group can still have irrational, contradictory preferences.
There is no “will of the people.” Just a collection of individual wills that can’t be consistently aggregated.
Democracy, in the idealized sense, is impossible.
What we call democracy is just a set of arbitrary rules we’ve agreed to follow, knowing they’ll sometimes produce nonsense.
So What’s the Answer?
What makes a fair election mathematically impossible?
The fact that “fairness” demands contradictory properties.
We want elections to respect everyone’s input (no dictatorship).
We want outcomes to be logically consistent (transitivity).
We want irrelevant candidates not to change results (IIA).
And mathematically, we can’t have all three.
Arrow proved that democracy, as we imagine it, is a beautiful fiction.
What we have instead is a collection of imperfect systems, each broken in different ways, and we pretend the breakage is acceptable.
Because the alternative—admitting there’s no perfect way to aggregate preferences—is too uncomfortable.
The Takeaway:
Next time someone says “the election was stolen” or “the system is rigged,” they might be more right than they know.
Not because of fraud.
Because the system was rigged from the start.
By mathematics.