A Geometric Proof of Democracy
The simplest axiom of democracy: each voter casts one mark, and the candidate with the most marks wins. Like dividing a circle into unequal wedges, plurality reveals its flaw in its own geometry — a candidate can claim the largest slice while the majority of the circle belongs to others.
First-past-the-post systems have governed most of the world's democracies, yet the geometric proof of their inadequacy is elementary: when three or more candidates divide the electorate, the winner's wedge need only be marginally larger than any other, not larger than all others combined.
The instant runoff transforms a single election into a cascade of eliminations. Voters rank candidates in order of preference, and in each round the candidate with the fewest first-choice votes is eliminated, their votes redistributed according to the next preference marked.
Geometrically, imagine concentric rings — each ring representing a round of counting. The innermost ring holds the final two candidates; outer rings record the eliminated. The construction draws inward, collapsing complexity toward a binary choice at the center.
In approval voting, each voter may mark as many candidates as they find acceptable. The candidate approved by the most voters wins. This elegantly simple modification to plurality reveals hidden consensus — the geometry of overlapping circles proves that the intersection of approval sets captures the candidate closest to the collective center.
The Venn construction draws itself: three circles of approval overlap, and where all three converge, the neon glow intensifies — a visual proof that consensus lives in intersection, not in exclusion.
The Marquis de Condorcet proposed a criterion: the winner should be the candidate who defeats every other candidate in pairwise comparison. Construct a directed graph — each node a candidate, each arrow pointing from winner to loser in a head-to-head matchup.
But the geometry reveals a paradox: sometimes the arrows form a cycle. A beats B, B beats C, C beats A — an impossible loop, a geometric proof that collective preferences can be fundamentally intransitive. The arrows chase each other endlessly, democracy consuming its own logic.
Where other methods seek a single winner, proportional representation asks a different geometric question: how to subdivide a finite space — seats in a legislature — so that each faction receives area proportional to its support. The construction is a rectangle that tiles itself.
Watch as the rectangle partitions: first a vertical division, then horizontal subdivisions within each column, each sub-rectangle filling with a distinct neon hue. The final mosaic is a geometric proof that fair representation is an act of tessellation — fitting every voice into the whole without gaps or overlaps.
Kenneth Arrow proved that no ranked voting system can simultaneously satisfy all fairness criteria: unrestricted domain, non-dictatorship, Pareto efficiency, and independence of irrelevant alternatives. The geometry of this impossibility is a shape that cannot close.
The construction attempts to draw a perfect polygon — but each side, representing one fairness axiom, refuses to connect to the next. The shape spirals outward, never completing, a visual proof that perfection in collective choice is geometrically impossible. The orange glow of paradox illuminates this fundamental limit of democracy.
The geometry of choice is never simple.
But it is always beautiful.