Mathematicians Prove Perfectly Fair Elections Are Mathematically Impossible
A team of mathematicians has published research demonstrating that perfectly fair elections are mathematically impossible. The researchers proved that no electoral system can simultaneously satisfy three desirable properties: local representation, proportional national results, and a fixed-size parliament.
The proof shows that when a sufficient number of political parties compete, these three goals become fundamentally incompatible. This builds on Arrow's famous impossibility theorem, which established that no ranked voting system can perfectly translate individual preferences into collective decisions. The new research extends this framework to examine how electoral systems distribute seats.
According to the researchers, the tension arises because local representation requires geographic districts, proportional representation requires party-wide vote counting, and fixed parliament sizes constrain the total number of seats available. Each constraint serves a legitimate democratic purpose, but they cannot all be maximized simultaneously.
The study also proposes a new voting method that could soften these unavoidable trade-offs. Rather than seeking a perfect solution, the approach aims to produce outcomes that are "much closer to fair" by accepting that some compromise is inevitable and optimizing for the most acceptable balance among competing democratic values.
The researchers note that understanding these mathematical limits helps explain why different countries have adopted such varied electoral systems. Rather than revealing flaws in any particular system, the impossibility result illuminates the inherent choices every democracy must make when designing how its citizens' votes translate into legislative seats.