Dr. Reyaz Ahmad
Democracy is often described in the language of politics: campaigns, parties, ideologies, candidates, constitutions and elections. Yet beneath every election lies another language that receives far less public attention—the language of mathematics.
Who wins an election may depend not only on how people vote, but also on how electoral boundaries are drawn, how votes are counted, how preferences are ranked and how collective choices are mathematically converted into political power.
In other words, democracy has a mathematical architecture.
And sometimes, that architecture can produce results that appear surprising, unfair or even contrary to what most voters seem to want.
Two particularly fascinating examples reveal how deeply mathematics enters democratic life: gerrymandering, where geometry can influence political representation, and voting paradoxes, where even perfectly honest voters can collectively produce contradictory outcomes.
Understanding these mathematical ideas does not require advanced mathematics. But it does reveal something important: designing a fair democracy is considerably more complicated than simply saying, “the majority should rule.”
When the shape of a district changes an election
Imagine a region containing 100 voters. Fifty-five support Party A and forty-five support Party B.
One might reasonably expect Party A to win approximately 55 percent of the representation.
But suppose the region is divided into five electoral districts.
Depending on how those boundaries are drawn, Party A could win four districts, three districts—or perhaps only two.
The voters have not changed.
Their political preferences have not changed.
Only the geometry has changed.
This is the basic mathematical principle behind gerrymandering: electoral boundaries can be designed in ways that concentrate or distribute voters strategically, thereby changing political outcomes.
Two commonly discussed techniques are known as packing and cracking.
Packing means concentrating large numbers of opposing voters into a small number of districts. They win those districts overwhelmingly, but many of their votes become electorally unnecessary.
Cracking does the opposite. Opposition voters are divided among several districts so that they remain minorities in each one.
The mathematics is simple but powerful.
Suppose Party B has 40 percent of the voters. If those voters are concentrated into two districts where they receive 90 percent of the vote, they may win only two seats out of five. Their overwhelming majorities in those districts do not help them elsewhere.
A map can therefore transform votes into seats in a highly unequal manner.
This is why modern electoral analysis increasingly uses mathematics, geometry, statistics and computer science to evaluate district maps.
Can geometry measure political fairness?
One approach involves measuring the compactness of electoral districts.
A district shaped approximately like a circle, square or other relatively regular geometric figure may appear more natural than one containing narrow corridors, tentacles or strangely winding boundaries.
A strangely shaped district is not automatically unfair. Natural geography, municipal boundaries, rivers, mountains, population concentrations and communities with shared interests may all produce irregular constituencies.
Conversely, even a visually compact district can sometimes produce partisan advantages.
Mathematics therefore provides evidence—not an automatic verdict.
Counting the votes that do not matter
Another measure sometimes used in discussions of partisan redistricting is the efficiency gap.
The idea is based on what are called “wasted votes.”
In a winner-takes-all district, votes for the losing candidate are considered wasted for this particular calculation. Votes cast for the winner beyond the number required to win are also counted as wasted.
Suppose a candidate needs 51 votes to win but receives 80.
The additional 29 votes did not change the result of that district.
If one party systematically wastes far more votes than another because of the way districts are designed, the overall map may create a representational advantage for its opponent.
The efficiency gap compares the wasted votes of the two parties relative to the total votes cast.
Again, the importance of the concept lies not in claiming that one formula can define democracy, but in showing that political representation can be studied quantitatively.
Geometry tells us something.
Statistics tells us something.
Graph theory tells us something.
But none alone tells us everything.
Electoral maps as graph-theory problems
Modern mathematics allows us to go even further.
An electoral map can be represented as a graph.
In graph theory, geographic areas can be represented as vertices, or nodes, while shared borders between them become edges connecting those nodes.
The redistricting problem then becomes a mathematical partitioning problem:
How can thousands of geographic units be divided into districts that are contiguous, similar in population, reasonably compact and respectful of existing communities?
Computer algorithms can generate thousands—or even millions—of alternative maps satisfying predetermined legal and geographic conditions.
Researchers can then compare an actual electoral map with this large collection of possible maps.
If the real map produces an extraordinarily unusual advantage for one political party compared with most mathematically reasonable alternatives, that may provide evidence worthy of closer scrutiny.
This is one of the most important contributions mathematics can make to democracy.
Rather than beginning with the accusation, “This map looks unfair,” mathematical modelling allows us to ask:
How unusual is this map compared with thousands of plausible alternatives?
That is a much more rigorous question.
But district boundaries are only half the mathematical story.
Even when electoral maps are perfectly fair, another problem remains.
How should votes themselves be counted?
Why “majority rules” is more complicated than it sounds
If there are only two candidates, voting appears simple.
Candidate A receives 60 percent.
Candidate B receives 40 percent.
Candidate A wins.
But introduce a third candidate and democracy suddenly becomes mathematically more complicated.
Consider three candidates: A, B and C.
Suppose:
40 percent of voters prefer A first, B second and C third;
35 percent prefer B first, C second and A third;
25 percent prefer C first, A second and B third.
Candidate A has the largest number of first-choice votes and might therefore win under a plurality system.
Yet 60 percent of voters prefer someone else as their first choice.
Now compare the candidates pairwise.
Depending on the preference structure, it is possible for voters collectively to prefer A over B, B over C, and yet C over A.
Symbolically,
“A > B, B > C, C > A”
This resembles the familiar game of rock-paper-scissors.
The collective preference becomes cyclical.
This phenomenon is associated with what is known as the Condorcet paradox.
Every voter individually may have perfectly rational preferences.
Yet when those preferences are combined, society can appear irrational.
This is one of the deepest mathematical lessons of democracy:
Individual rationality does not necessarily produce collective rationality.
Arrow’s Impossibility Theorem
The difficulty becomes even more profound through one of the most celebrated results in mathematical economics: Arrow’s Impossibility Theorem, developed by economist Kenneth Arrow.
Arrow asked whether a voting system could convert individual ranked preferences into a collective ranking while satisfying several seemingly reasonable democratic principles.
Among them were ideas such as:
Voters should be free to rank alternatives in any order.
If everyone prefers A to B, society should also prefer A to B.
The ranking between A and B should not be manipulated merely by introducing an irrelevant third option.
No single voter should always determine society’s preference.
The remarkable result is that, when there are at least three alternatives, no rank-order voting rule can satisfy all such desirable conditions simultaneously.
This does not mean democracy is impossible.
It means something subtler and more important:
Every electoral mechanism involves trade-offs.
Plurality voting has weaknesses.
Runoff systems have weaknesses.
Ranked-choice systems have weaknesses.
Proportional representation systems have their own compromises.
Democratic institutions therefore cannot simply search for a mathematically perfect voting mechanism because mathematics tells us that perfection itself may be unattainable under certain assumptions.
The real question becomes: Which imperfections are we willing to accept?
Ranked-choice voting: A better solution?
One alternative attracting attention in several democratic systems is ranked-choice voting, sometimes implemented through instant-runoff procedures.
Instead of selecting only one candidate, voters rank candidates:
First preference.
Second preference.
Third preference, and so on.
If one candidate obtains the required majority of first preferences, that candidate wins.
Otherwise, the candidate with the fewest first-choice votes may be eliminated, and those ballots are transferred according to voters’ next preferences. The process continues until a candidate satisfies the winning condition.
One advantage is that voters can express more information than under a simple one-choice ballot.
It can also reduce certain forms of “spoiler” effect, where two similar candidates divide their supporters and allow a less broadly preferred candidate to win.
But ranked-choice voting is not a mathematical miracle.
Depending on its precise form, it can fail some desirable voting criteria. Under instant-runoff voting, for example, unusual situations can arise in which gaining additional support does not necessarily improve a candidate’s outcome—a phenomenon related to non-monotonicity.
Again, mathematics teaches caution.
Every electoral rule rewards some structures of preference while handling others less elegantly.
Why citizens should understand the mathematics of democracy
In an age of data analytics, artificial intelligence and computational politics, citizens need more than political slogans.
They need mathematical literacy.
When electoral boundaries are proposed, people should understand why measures of compactness, proportionality and statistical bias matter.
When voting reforms are suggested, they should ask what mathematical properties the new system satisfies—and which ones it sacrifices.
When politicians claim that an electoral rule is “completely fair,” citizens should be sceptical.
Mathematics has already shown us that democratic systems inevitably involve compromises.
That does not weaken democracy.
It can strengthen it.
Because a mature democracy does not pretend that institutional design is simple.
It examines its rules carefully, tests them quantitatively and remains willing to improve them.
Mathematics cannot choose our leaders—but it can protect the rules
Mathematics should never be allowed to replace democratic judgment.
No equation can determine which political philosophy is correct.
No algorithm can decide what citizens ought to believe.
No geometric formula can fully define justice.
But mathematics can expose hidden distortions.
It can reveal when constituency boundaries produce extreme outcomes.
It can demonstrate why apparently simple voting rules sometimes behave unpredictably.
It can compare electoral alternatives rigorously rather than rhetorically.
And perhaps most importantly, mathematics can remind us that democracy is not merely an act performed on election day.
It is a system designed through rules.
Those rules determine how millions of individual voices become collective power.
Whenever rules convert preferences into outcomes, mathematics is already present.
The real democratic question, therefore, is not whether mathematics should enter politics.
It already has.
The question is whether citizens understand enough mathematics to recognize when the numbers, boundaries and voting rules shaping their democracy are genuinely serving them.
(The author is a freelancer and can be reached at [email protected])
