Get AI summaries of any video or article — Sign up free
Why Democracy Is Mathematically Impossible thumbnail

Why Democracy Is Mathematically Impossible

Veritasium·
6 min read

Based on Veritasium's video on YouTube. If you like this content, support the original creators by watching, liking and subscribing to their content.

TL;DR

First-past-the-post can award power to a party that does not win a majority of votes, creating a mismatch between seat control and voter preference.

Briefing

Democracy’s core mechanism—turning millions of individual preferences into a single collective choice—runs into hard mathematical limits. The central claim is that common ranked-choice approaches can’t satisfy a set of “reasonable” fairness rules at the same time once there are three or more candidates. That impossibility matters because it reframes election design from a moral debate into a technical problem: every voting system must trade off some notion of fairness, consistency, or strategic robustness.

The discussion starts with first-past-the-post (FPTP), where voters pick one favorite and the highest vote-getter wins. FPTP is widely used—especially in countries with British colonial histories—and it often produces outcomes where a party wins power without winning the majority of votes. In the last century of British parliamentary elections, single parties captured majorities of seats far more often than they captured majorities of voter support. FPTP also creates vote-splitting among similar parties and encourages strategic voting: if smaller parties can’t win, voters have incentives to abandon sincere preferences. The 2000 U.S. presidential election illustrates the spoiler effect. Ralph Nader’s Green candidacy drew nearly 100,000 votes in Florida, and many Nader supporters preferred Al Gore over George W. Bush—but under winner-takes-all rules, their votes effectively helped elect Bush.

To reduce spoiler dynamics, the transcript shifts to instant runoff voting (IRV), also called ranked-choice voting. Voters rank candidates; if no one reaches a majority, the lowest candidate is eliminated and their ballots transfer to the next preference. This is mathematically equivalent to repeatedly holding elections until someone crosses the 50%+1 threshold, but it avoids repeated ballots. IRV can also change candidate incentives: in Minneapolis’s 2013 mayoral race with 35 candidates, the campaign tone reportedly became unusually cooperative, with candidates competing for second and third preferences rather than trying to destroy rivals.

Yet ranked-choice systems still face counterintuitive failure modes. A constructed example with candidates “Einstein,” “Curie,” and “Bohr” shows how a candidate who performs worse in the first round can end up winning after transfers, depending on how voters’ second choices shift. That kind of “worse first-round performance helps” outcome is precisely the sort of inconsistency that motivated earlier work in social choice theory.

The transcript then traces the lineage of voting-system mathematics to Condorcet and Borda. Condorcet’s method aims for a candidate who beats every other candidate in head-to-head comparisons derived from ranked ballots. But with three or more options, preferences can cycle—Condorcet’s paradox—so no candidate may be able to win all pairwise matchups.

The decisive blow comes from Kenneth Arrow’s impossibility theorem. Arrow formalized five conditions—unanimity, non-dictatorship, unrestricted domain, transitivity, and independence of irrelevant alternatives—and proved that no ranked voting system with three or more candidates can satisfy all five simultaneously. A proof sketch using a “pivotal voter” argument shows that meeting these constraints forces the outcome to depend on a single voter’s preferences, effectively creating dictatorship.

The conclusion is not that elections are hopeless, but that ranked-choice aggregation is mathematically constrained. The transcript points to Duncan Black’s median-voter result for settings where political preferences lie along a single ideological line, and it highlights rated voting systems like approval voting as an alternative route around Arrow’s ordinal limitations. Approval voting—used historically in the Vatican for papal selection—lets voters express support without ranking, and research is cited for reducing spoiler effects and negative campaigning. The upshot: democracy isn’t “mathematically impossible” in every form, but ranked-choice voting inherits unavoidable tradeoffs, meaning election reform must choose which principles to sacrifice rather than pretending a perfect method exists.

Cornell Notes

The transcript argues that turning ranked voter preferences into one collective ranking runs into unavoidable mathematical contradictions. First-past-the-post often produces outcomes that don’t match majority preference and encourages strategic “spoiler” voting. Instant runoff voting (ranked-choice voting) reduces some spoiler effects by transferring ballots after eliminations, but it can still yield counterintuitive results where a candidate who does worse initially can win after transfers. Condorcet-style pairwise methods can suffer from preference cycles (Condorcet’s paradox). Kenneth Arrow’s impossibility theorem then shows that no ranked voting system with three or more candidates can satisfy a set of fairness conditions at the same time—forcing some principle to fail or effectively giving power to a single voter. Rated systems like approval voting are presented as a way around Arrow’s ordinal constraints.

Why does first-past-the-post often fail to reflect majority preference?

In first-past-the-post (FPTP), voters choose one candidate and the highest vote-getter wins, even if that winner lacks 50%+1 support. This can produce “majority mismatch” outcomes: a party can win seats and govern while a majority of voters supported other parties. The transcript notes that in the last century of British parliamentary elections, single parties won majorities of seats far more often than they won majorities of votes, meaning many voters backed parties that didn’t end up holding power.

How does the spoiler effect arise in winner-takes-all elections?

The spoiler effect occurs when voters who prefer Candidate A over Candidate B still vote for a third option C because they want their sincere preference recorded. Under FPTP, those votes can prevent A from winning, even if most of C’s voters would rather A than B. The transcript’s example is the 2000 U.S. presidential election in Florida: Ralph Nader (Green) drew nearly 100,000 votes, and many Nader supporters preferred Al Gore to George W. Bush, but their votes helped elect Bush under state-by-state winner-takes-all rules.

What is instant runoff voting, and why is it considered mathematically equivalent to repeated elections?

Instant runoff voting (IRV) asks voters to rank candidates. If no candidate gets a majority, the lowest candidate is eliminated and those ballots transfer to each voter’s next-ranked remaining candidate. This continues until someone reaches 50%+1. The transcript says IRV is mathematically identical to repeatedly holding elections that eliminate the lowest candidate each round, but it saves the hassle of conducting multiple separate elections.

What counterexample shows that ranked-choice systems can still behave oddly?

The transcript uses a three-candidate scenario (Einstein, Curie, Bohr). In one setup, Curie wins because Einstein is eliminated and Einstein voters transfer to Curie. In a second setup, Bohr performs worse in the first round because some Bohr voters switch to Einstein; then Curie is eliminated and Bohr wins after transfers. The key point is that worse first-round performance can lead to winning, which is the kind of inconsistency critics worry about.

What does Arrow’s impossibility theorem claim, and what does it imply about ranked voting?

Arrow’s theorem proves that with three or more candidates, no ranked voting system can satisfy five fairness conditions simultaneously: unanimity, non-dictatorship, unrestricted domain, transitivity, and independence of irrelevant alternatives. The transcript sketches a proof using a “pivotal voter” idea: under these constraints, the social preference between two candidates ends up depending on a single voter’s ranking, effectively creating dictatorship. The implication is that ranked aggregation must violate at least one “reasonable” condition.

How do rated voting systems like approval voting aim to avoid Arrow’s limitations?

Arrow’s impossibility applies to ordinal voting systems—those where voters rank candidates. Rated voting systems instead let voters express approval (approval voting) or strength of preference (e.g., a scale from disapprove to approve). The transcript claims research finds approval voting can increase turnout, reduce negative campaigning, and prevent spoiler effects because voters can support a candidate without needing to rank them relative to all others. It also notes approval voting has historical precedent, including papal selection in the Vatican between 1294 and 1621.

Review Questions

  1. Which specific fairness conditions in Arrow’s framework cannot all be satisfied at once for ranked voting with three or more candidates?
  2. How does instant runoff voting transfer ballots, and why does that mechanism reduce some spoiler effects compared with first-past-the-post?
  3. What is Condorcet’s paradox, and how does it relate to the idea of choosing a candidate who beats every other candidate head-to-head?

Key Points

  1. 1

    First-past-the-post can award power to a party that does not win a majority of votes, creating a mismatch between seat control and voter preference.

  2. 2

    Winner-takes-all rules incentivize strategic voting and can produce spoiler effects, where sincere third-party support changes which major candidate wins.

  3. 3

    Instant runoff voting (ranked-choice voting) transfers eliminated candidates’ ballots to next preferences, making it equivalent to repeated elimination elections while reducing the need for multiple ballots.

  4. 4

    Ranked-choice systems can still generate counterintuitive outcomes, including cases where a candidate who performs worse initially can win after transfers.

  5. 5

    Condorcet-style pairwise methods aim for a candidate that beats all others, but multi-candidate preference cycles (Condorcet’s paradox) can prevent any such winner from existing.

  6. 6

    Arrow’s impossibility theorem shows that no ranked voting system with three or more candidates can satisfy unanimity, non-dictatorship, unrestricted domain, transitivity, and independence of irrelevant alternatives simultaneously.

  7. 7

    Approval voting and other rated systems are presented as alternatives that avoid Arrow’s ordinal framework and may reduce spoiler effects and negative campaigning.

Highlights

In first-past-the-post, a party can win power with only minority support because the winner is simply the largest vote-getter, not the majority choice.
The 2000 Florida example illustrates the spoiler effect: many Nader voters preferred Gore over Bush, yet their votes helped elect Bush under winner-takes-all rules.
Instant runoff voting transfers ballots after eliminations, but ranked-choice can still produce paradoxical results where a worse first-round candidate wins.
Arrow’s theorem forces a tradeoff: with three or more candidates, ranked voting cannot satisfy a full set of fairness conditions without collapsing into dictatorship-like dependence.
Approval voting—letting voters express support rather than rank—offers a different mathematical route that can reduce spoiler dynamics.

Topics

  • Voting Systems
  • First-Past-The-Post
  • Instant Runoff
  • Social Choice Theory
  • Arrow’s Impossibility

Mentioned

  • Kenneth Arrow
  • Duncan Black
  • Jean-Charles de Borda
  • Jean-Charles de Borda
  • Marie-Jean-Antoine Nicolas de Caritat
  • Ramon Llull
  • Charles Dodgson
  • Lewis Carroll
  • Condorcet
  • Winston Churchill