📚 The Mathematics of Election Cycles | 选举周期中的数学
Elections are not only about politics; they are a rich source of mathematical problems. From counting votes to predicting outcomes, mathematics underpins every stage of the election cycle.
选举不仅是政治事务，更是丰富的数学问题来源。从计票到预测结果，数学支撑着选举周期的每个阶段。
1. What is the Election Cycle? | 什么是选举周期？
The election cycle refers to the series of events that occur between two elections: voter registration, primary campaigns, polling, voting, counting, and the certification of results. At each stage, mathematical models help officials, candidates, and the public understand complex processes.
选举周期是指两次选举之间发生的一系列事件：选民登记、初选竞选、民意调查、投票、计票和结果认证。在每个阶段，数学模型都帮助官员、候选人和公众理解复杂的过程。
A central concern is fairness. How do we translate individual votes into a single outcome? How do we divide seats among regions? These questions are answered using discrete mathematics and statistics.
核心问题是公平性。我们如何将个人选票转化为单一结果？如何在各地区之间分配席位？这些问题需要借助离散数学和统计学来回答。
2. Voting Systems | 投票制度
A voting system is a method for determining the winner of an election. Different systems can produce different winners from the same set of ballots. Mathematicians study these systems to understand their strengths and weaknesses.
投票制度是决定选举获胜者的方法。对于同一组选票，不同的制度可能产生不同的获胜者。数学家用它来研究各种制度的优缺点。
Common systems include plurality, majority, preferential voting, and approval voting. Each system can be described by a set of mathematical rules.
常见的制度包括相对多数制、绝对多数制、偏好投票和同意投票。每种制度都可以用一组数学规则来描述。
3. Plurality and Majority | 相对多数制与绝对多数制
The plurality rule simply states that the candidate with the most votes wins, regardless of whether they receive more than half. This is widely used in single-member districts.
相对多数制规定获得最多票数的候选人获胜，无论是否超过半数。这广泛用于单议席选区。
The majority rule requires more than 50% of all valid votes. If no candidate reaches this threshold, a second round of voting may be held. Mathematically, this is a threshold decision problem.
绝对多数制要求候选人获得超过50%的有效票。如果没有候选人达到该门槛，则可能进行第二轮投票。从数学角度看，这是一个阈值决策问题。
Majority threshold = ½ × (total valid votes) + 1
绝对多数阈值 = ½ × (有效票总数) + 1
4. Preferential Voting and Borda Count | 偏好投票与波达计数法
In preferential voting, voters rank candidates in order of preference. The Borda count assigns points to each rank: for n candidates, first place gets n−1 points, second place gets n−2, and so on. The candidate with the highest total wins.
在偏好投票中，选民按偏好顺序对候选人排序。波达计数法为每个排名分配分数：对于n个候选人，第一名得n−1分，第二名得n−2，以此类推。总分最高的候选人获胜。
For example, with three candidates A, B, C, the ranking A > B > C gives A 2 points, B 1 point, C 0 points. This method allows a compromise candidate to win, as the points reflect overall acceptability.
例如，有三名候选人A、B、C，排序A > B > C则A得2分，B得1分，C得0分。这种方法允许折衷候选人获胜，因为分数反映了整体的接受度。
5. Condorcet’s Paradox | 孔多塞悖论
A Condorcet winner is a candidate who beats every other candidate in pairwise comparisons. However, such a candidate may not exist. This is demonstrated by Condorcet’s paradox, where majority preferences form a cycle.
孔多塞获胜者是指在两两比较中战胜其他所有候选人的候选人。然而，这样的候选人可能不存在。孔多塞悖论表明，多数偏好可能形成循环。
Consider three voters with the following rank orders:
考虑三位选民，他们的排序如下：
| Voter 1 | A > B > C |
| Voter 2 | B > C > A |
| Voter 3 | C > A > B |
In pairwise votes, A beats B (voters 1 and 3), B beats C (voters 1 and 2), and C beats A (voters 2 and 3). No candidate is undefeated, so majority rule fails to produce a clear winner.
在两两投票中，A击败B（选民1和3），B击败C（选民1和2），C击败A（选民2和3）。没有候选人保持不败，因此多数规则无法产生明确的获胜者。
6. Arrow’s Impossibility Theorem | 阿罗不可能定理
In 1951, economist Kenneth Arrow proved a fundamental result: no ranked voting system can satisfy all of a set of reasonable fairness criteria simultaneously. This theorem has profound implications for democratic design.
1951年，经济学家肯尼斯·阿罗证明了一个基本结论：不存在同时满足一组合理公平标准的排序投票制度。这一定理对民主制度设计具有深远影响。
The criteria include unanimity, non-dictatorship, and independence of irrelevant alternatives. Arrow showed that when there are at least three candidates, these conditions are logically inconsistent.
这些标准包括一致性、非独裁性和无关选择的独立性。阿罗证明，当候选人至少为三人时，这些条件在逻辑上是互不相容的。
The theorem can be stated as:
该定理可以表述为：
No perfect ranked voting system exists for 3 or more candidates.
对于3个或更多候选人，不存在完美的排序投票制度。
7. Apportionment of Seats | 席位分配
In proportional representation, seats in a parliament are divided among parties according to their vote shares. This is a problem of apportionment: how to allocate whole numbers of seats that sum to a fixed total.
在比例代表制中，议会席位根据各政党的得票比例进行分配。这是一个席位分配问题：如何分配整数的席位数，使其总和达到固定总数。
One common method is the D’Hondt method, which uses a series of divisors. Each party’s vote count is divided by 1, 2, 3, … and the largest resulting quotients are awarded seats one by one.
常用方法是洪德法，它使用一系列除数。将每个政党的得票数除以1、2、3……，然后按商数大小逐一分配席位。
For two parties with 600 and 400 votes and 5 seats, the quotients are:
对于两个政党，得票分别为600和400，分配5个席位，商数为：
| Party A (600) | 600, 300, 200, 150, 120 |
| Party B (400) | 400, 200, 133.33, 100, 80 |
Taking the five largest quotients (600, 400, 300, 200, 200), Party A gets 3 seats and Party B gets 2 seats.
取五个最大的商数（600、400、300、200、200），则A党获得3席，B党获得2席。
8. Statistical Sampling and Polls | 统计抽样与民意调查
During an election cycle, opinion polls are used to estimate the support of each candidate. Pollsters select a random sample of voters and measure the proportion supporting each option.
在选举周期中，民意调查用来估计每位候选人的支持率。调查机构抽取随机选民样本，并测量支持各选项的比例。
The sample proportion p̂ is an estimator of the true population proportion p. A larger sample usually gives a more precise estimate, but the relationship is governed by the variance of the sampling distribution.
样本比例 p̂ 是总体真实比例 p 的估计量。较大的样本通常能提供更精确的估计，但这种关系由抽样分布的方差决定。
For a simple random sample of size n, the standard error of the sample proportion is:
对于容量为 n 的简单随机样本，样本比例的标准误差为：
SE = √(p(1−p)/n)
标准误差 = √(p(1−p)/n)
9. Confidence Intervals and Margin of Error | 置信区间与误差幅度
Pollsters report results with a margin of error, usually for a 95% confidence level. For a sample proportion p̂, an approximate 95% confidence interval for the population proportion p is:
调查机构报告结果时附带误差幅度，通常采用95%置信水平。对于样本比例 p̂，总体比例 p 的近似95%置信区间为：
p̂ ± 1.96 × √(p̂(1−p̂)/n)
p̂ ± 1.96 × √(p̂(1−p̂)/n)
If p̂ = 0.5 and n = 1000, the margin of error is approximately 1.96 × 0.0158 ≈ 0.031, or ±3.1%. This helps us judge whether a lead is statistically significant.
如果 p̂ = 0.5 且 n = 1000，则误差幅度约为 1.96 × 0.0158 ≈ 0.031，即 ±3.1%。这帮助我们判断领先是否具有统计显著性。
In a race with two candidates, a poll showing 52% versus 48% has a margin of error that may be larger than the gap. Thus the election is too close to call.
在两党竞选中，若民调显示52%对48%，误差幅度可能大于差距，因此选举结果难分伯仲。
10. Game Theory and Strategic Voting | 博弈论与策略投票
Game theory models the interaction between voters and candidates as a strategic game. Voters may choose not to vote for their true first choice if they believe that candidate has no chance of winning. This is called tactical or strategic voting.
博弈论将选民与候选人的互动建模为策略博弈。如果选民认为其首选候选人没有胜选机会，他们可能不会投给真正的第一选择，这称为策略投票。
A classic example is the prisoner’s dilemma applied to voting. Two similar candidates split the left-wing vote, allowing a third candidate to win. Voters may coordinate to avoid this outcome.
经典的例子是囚徒困境在投票中的应用。两个相似候选人分散了左翼选票，导致第三名候选人获胜。选民可能会协调以避免这一结果。
Mathematically, we can model each voter’s decision as a binary choice: vote sincerely or strategically. The dominant strategy depends on the expected benefit and the probability of affecting the outcome.
在数学上，我们可以将每个选民的决定建模为二元选择：真诚投票或策略投票。占优策略取决于预期收益和影响结果的可能性。
11. Gerrymandering and Geometry | 杰利蝾螈与几何
Redrawing electoral boundaries can manipulate election outcomes. This practice is called gerrymandering. The geometry of district shapes creates asymmetries that are measurable using mathematics.
重新划分选区边界可能操纵选举结果，这种做法称为“杰利蝾螈”。选区形状的几何特征会产生可测量的不对称性。
One metric is the efficiency gap, which compares wasted votes between parties. A wasted vote is either a vote for a losing candidate or a surplus vote for a winning candidate.
一个衡量指标是效率差距，它比较两党的浪费选票。浪费选票指投给败选的候选人的票，或投给胜选候选人的多余票。
The efficiency gap can be expressed as:
效率差距可以表示为：
Efficiency gap = (Party A wasted votes − Party B wasted votes) / Total votes
效率差距 = (A党浪费选票 − B党浪费选票) / 总票数
A gap greater than 0.07 is often considered evidence of partisan gerrymandering in the United States.
在美国，差距超过0.07通常被视为党派杰利蝾螈的证据。
12. Conclusion | 结论
The election cycle is a mathematical journey. It involves discrete algorithms for vote counting, statistical inference for polling, and geometric analysis for redistricting. Understanding these mathematical tools empowers citizens to evaluate election fairness more rigorously.
选举周期是一场数学之旅。它涉及计票的离散算法、民调的统计推断以及选区划分的几何分析。理解这些数学工具，能够帮助公民更严谨地评估选举的公平性。
From Arrow’s impossibility theorem to the efficiency gap, mathematics reveals both the possibilities and the limitations of democratic decision-making.
从阿罗不可能定理到效率差距，数学揭示了民主决策的可能与局限。
By studying these concepts in A-Level mathematics, students gain not only exam skills but also a deeper appreciation for the structures that shape political life.
通过学习A-Level数学中的这些概念，学生不仅获得考试技能，更能深刻理解塑造政治生活的结构。
Published by TutorHao | Mathematics Revision Series | aleveler.com
更多咨询请联系16621398022（同微信）
屏轩国际教育cambridge primary/secondary checkpoint, cat4, ukiset,ukcat,igcse,alevel,PAT,STEP,MAT, ibdp,ap,ssat,sat,sat2课程辅导，国外大学本科硕士研究生博士课程论文辅导Cancel reply