📚 2. The Functions of Congress | 2. 国会的职能：函数建模视角
The United States Congress performs a wide range of duties — from lawmaking to oversight — that can be modelled and analysed using mathematical functions studied in A‑Level Edexcel Mathematics. By treating political processes as input–output systems, we can use linear, polynomial, exponential and probabilistic functions to describe how Congress works, how votes are aggregated, and how resources are allocated. This article explores congressional functions through the lens of pure and applied mathematics, reinforcing key concepts such as domain, range, composition of functions and statistical models.
美国国会履行着从立法到监督的诸多职能，而这些过程都可以用 A‑Level Edexcel 数学中的函数进行建模和分析。如果把政治过程看作输入–输出系统，我们就能通过线性函数、多项式函数、指数函数和概率函数来描述国会如何运作、选票如何汇总以及资源如何分配。本文从纯数学和应用数学的视角审视国会的职能，同时强化定义域、值域、复合函数以及统计模型等重要概念。
1. Viewing Congress as a Function Machine | 把国会视为函数机器
rom a domain to a unique output in the codomain. Similarly, Congress can be seen as a function: a bill (input) enters the legislative process, undergoes committee review, amendments and floor votes, and finally either becomes a law or is rejected (output). The domain is the set of all proposed bills, while the range consists of enacted laws and defeated proposals.
一个基本的函数 f : x → y 将定义域中的输入映射到值域中的唯一输出。类似地，国会可以看作一个函数：一项法案（输入）进入立法程序，经历委员会审查、修正案和全院投票，最终要么成为法律，要么被否决（输出）。定义域是所有提出的法案的集合，而值域由已颁布的法律和被否决的提案组成。
s is a piecewise constant function, but its internal mapping is determined by multiple sub‑functions (committees, filibuster rules, etc.).
我们可以写成：L(b) = 结果，其中 b 是一项法案，L 是立法函数。如果 b 通过了所有阶段，L(b) = 1（法律）；如果失败，L(b) = 0。这是一个分段常数函数，但其内部映射由多个子函数（委员会、阻挠议事规则等）决定。
2. The Lawmaking Function as a Composite Function | 立法函数看作复合函数
oth the House of Representatives and the Senate. This suggests a composite function: L = S ○ H, where H(b) is the House outcome and S(x) is the Senate outcome applied to the House‑ In algebraic terms, L(b) = S( H(b) ). If either chamber rejects the bill, the output is 0.
一项法案必须先后经过众议院和参议院。这恰好构成一个复合函数：设 H(b) 为众议院处理后的结果，S(x) 为参议院对众议院通过版本 x = H(b) 的处理结果，那么立法函数 L = S ∘ H，即 L(b) = S( H(b) )。如果任一议院否决，最终输出为 0。
two chambers produce different versions, a conference committee resolves the discrepancies — romise. The full lawmaking function then becomes L(b) = C( H(b), S(H(b)) ), which is a two‑variable function.
此外，当两院产生不同版本时，会由一个协商委员会解决分歧——这又是一个双变量函数 C(y, z)，将两种输入合并为单一妥协案。完整的立法函数可写作 L(b) = C( H(b), S(H(b)) )，是一个二元函数。
3. Modelling Voting Power with Weighted Functions | 用加权函数对投票权建模
c, where s is seniority (years), p is party leadership score (0 or 1), c is committee chair score, and α, β, γ are positive weights determined by regression analysis.
每位国会议员拥有一票，但由于委员会主席、党派领导地位和资历的不同，影响力存在差异。我们可以将议员的投票权建模为函数 W(s, p, c) = αs + βp + γc，其中 s 为资历（年数），p 为党派领导得分（0 或 1），c 为委员会主席得分，α，β，γ 为通过回归分析确定的正权重。
The total voting power in a chamber can be summed: Σᵢ Wᵢ. When a bill requires a two‑ if member i votes yes, 0 otherwise. This is a linear inequality derived from weighted voting functions.
全院的总投票权可以求和：Σᵢ Wᵢ。当一项法案需要三分之二超级多数时，条件变为 Σ Wᵢ × vᵢ ≥ ²/₃ Σ Wᵢ，其中若议员 i 投赞成票则 vᵢ = 1，否则为 0。这正是一个来源于加权投票函数的线性不等式。
4. Oversight as a Periodic Review Function | 监督职能看作周期性审查函数
ge in oversight activity around election cycles, where A is the baseline level and B is the amplitude.
国会对行政部门的监督通常遵循听证会与报告的定期日程。我们可以将监督强度 O(t) 视为时间 t（以月为单位）的周期函数。例如，O(t) = A + B sin( 2π t /12 ) 可表示在选举周期前后监督活动的增强，其中 A 为基础水平，B 为振幅。
tal oversight capacity over a year is given by the definite integral ∫₀¹² O(t) dt. Using A‑ sight is 12A. This shows that consistent baseline oversight is more significant than short‑term peaks.
一年内的总监督能力由定积分 ∫₀¹² O(t) dt 给出。运用 A‑Level 积分知识，其结果等于 12A 加上一整个周期内正弦项的积分为零，因此净监督量为 12A。这表明持续的基础监督远比短期峰值重要。
5. Budget Allocation and Linear Programming | 预算分配与线性规划
objective functions. Suppose the total budget is B, and there are n departments with variables x₁,… ᵢ (statutory minima). This is a linear programming problem solved using graphical methods or the simplex algorithm, both covered in Edexcel Further Maths or modelled in decision mathematics.
国会掌握着财政大权。将联邦资金分配给各部门涉及约束条件和目标函数。设总预算为 B，n 个部门的资金变量为 x₁,…,xₙ。国会可能希望最大化效用函数 U = Σ cᵢ xᵢ，满足 Σ xᵢ ≤ B 且 xᵢ ≥ mᵢ (法定最低额)。这是一个线性规划问题，可用图解法或单纯形法求解，均在 Edexcel 进阶数学或决策数学中有所涉及。
A real‑ ≥ 800. The feasible region is a convex polygon, and the optimal solution lies at a vertex — found by evaluating U at intersection points.
一个现实案例：国防 (d) 与卫生 (h) 拨款。在 d + h ≤ 4000（十亿美元）、d ≥ 1500、h ≥ 800 的条件下最大化 U = 0.7d + 0.3h。可行域是一个凸多边形，最优解位于某个顶点——通过计算交点处的 U 值即可求得。
6. Confirmation Hearings and Probability Functions | 提名确认听证会与概率函数
rm is p, and senators vote independently, the number of yes votes Y follows a binomial distribution: Y ~ e confirmation function is P(confirm) = P(Y ≥ 51) = Σₖ₌₅₁¹⁰⁰ (100 choose k) pᵏ (1−p)¹⁰⁰⁻ᵏ.
参议院负责确认总统提名人选。假设被提名人需要至少 51 票，每位参议员投赞成票的概率为 p 且独立投票，则赞成票数 Y 服从二项分布：Y ~ B(100, p)。确认概率函数为 P(确认) = P(Y ≥ 51) = Σₖ₌₅₁¹⁰⁰ C(100, k) pᵏ (1−p)¹⁰⁰⁻ᵏ。
) ≈ P(Z ≥ (50.5−55)/4.97) = P(Z ≥ −0.905) ≈ 0.817, showing a high confirmation likelihood.
当 p = 0.55 时，可用正态分布近似：均值 μ = 100×0.55 = 55，方差 σ² = 100×0.55×0.45 = 24.75，σ ≈ 4.97。于是 P(Y ≥ 51) ≈ P(Z ≥ (50.5−55)/4.97) = P(Z ≥ −0.905) ≈ 0.817，表明确认概率很高。
7. Filibuster and Supermajority Functions | 阻挠议事与超级多数函数
(V) = 0 for V < 60, and f(V) = 1 for V ≥ 60, combined with another step for final passage.
在参议院结束阻挠议事需要 60 票（终结辩论）。这就产生了法案通过的分段函数：若赞成票 V < 60，成功函数 S(V) = 0；若 V ≥ 60，S(V) 继续进入只需简单多数的最终表决。因此 S 通过一个阈值函数依赖于 V：对于 V < 60，f(V) = 0；对于 V ≥ 60，f(V) = 1，再与最终表决的另一阶跃函数复合。
Thus the full function is S(V) = 1 only if V ≥ 60 and V ≥ 51, which simplifies to V ≥ 60.
数学上，可设 f(V) = floor(V / 60) （V ≤ 100），尽管真实情况为布尔指示函数。于是 S(V) = f(V) × g(V)，其中 g(V) = 1 当终结辩论后 V ≥ 51，否则为 0。因此完整函数 S(V) = 1 仅当 V ≥ 60 且 V ≥ 51，简化为 V ≥ 60。
8. Re‑election Campaigns and Exponential Decay of Attention | 连任竞选与注意力的指数衰减
House members face re‑ reness right after a major legislative success, t is time in years, and k is the decay constant. This model helps predict electoral vulnerability.
众议员每两年面临连任。公众对其成就的关注度往往呈现指数衰减：A(t) = A₀ e⁻ᵏᵗ，其中 A₀ 是一次重大立法成功后的初始知名度，t 为时间（年），k 为衰减常数。此模型有助于预测选举风险。
If a member wants A(t) to remain above 50% of A₀ at the next election (t = 2), we require A₀ e⁻²ᵏ ≥ 0.5 A₀ ⇒ e⁻²ᵏ ≥ 0.5 ⇒ −2k ≥ ln 0.5 ⇒ k ≤ −(ln 0.5)/2 ≈ 0.3466. Thus, a low decay constant is vital — perhaps achieved by frequent media appearances.
若一名议员希望下次选举 (t = 2) 时知名度不低于 A₀ 的 50%，则需要 A₀ e⁻²ᵏ ≥ 0.5 A₀ ⇒ e⁻²ᵏ ≥ 0.5 ⇒ −2k ≥ ln 0.5 ⇒ k ≤ −(ln 0.5)/2 ≈ 0.3466。可见，保持低衰减常数至关重要——或许可通过频繁的媒体曝光来实现。
9. Committee Assignments as Combinatorial Functions | 委员会分配看作组合函数
nction: N = (number of ways to partition 435 members into committees of given sizes) = 435! / (n₁! n₂! ... n₂₀!), where nⱼ are committee sizes.
将 435 名众议员分配到约 20 个常设委员会，可以看作从议员集合 M 到委员会集合 C 的一个满射函数，并受规模与比例的约束。可能的分配方式数是一个组合函数：N = (将 435 名议员按指定规模分组的方案数) = 435! / (n₁! n₂! ... n₂₀!)，其中 nⱼ 为各委员会人数。
se there are D Democrats and R Republicans; the allocation function f : M → C must satisfy |f⁻¹(c) ∩ D| / |f⁻¹(c)| or each committee c. Solving this involves integer programming, a topic in decision maths.
若还须在各委员会内部保持党派比例，该分配函数会受到更多约束。设民主党人数为 D，共和党人数为 R，则分配函数 f : M → C 必须满足对每个委员会 c，|f⁻¹(c) ∩ D| / |f⁻¹(c)| ≈ D/(D+R)。求解此问题涉及整数规划，属决策数学的范畴。
10. Representing Constituent Opinion as an Aggregator Function | 选民意见的汇总函数
ricts. Mathematically, a representative takes a vector of constituent preferences x = (x₁,… ngle policy position y = g(x). This g may be a median function, a weighted mean, or a mode — median(x) or y = Σ wᵢ xᵢ / Σ wᵢ, where wᵢ reflect voter turnout or campaign contributions.
国会议员代表其选区。从数学上看，议员将选民偏好向量 x = (x₁,…,xₘ) 映射为单一政策立场 y = g(x)。这个 g 可能是中位数函数、加权平均值或众数——取决于议员的理念。例如，y = median(x) 或 y = Σ wᵢ xᵢ / Σ wᵢ，其中 wᵢ 反映选民投票率或竞选捐款。
This aggregator function can be analysed using descriptive statistics. If the distribution of x is bimodal (e.g., strongly opposed groups), the median might lie in a sparse region, making the choice unstable. Functions help explain why some representatives face tough primary challenges.
这一汇总函数可以用描述性统计进行分析。如果 x 的分布呈双峰（如强烈对立的两派），中位数可能落在稀疏区域，导致立场选择不稳定。函数有助于解释为何某些议员会面临严峻的初选挑战。
11. Impeachment as a Two‑Stage Conditional Function | 弹劾看作两阶段条件函数
nvolves two discrete steps: House impeachment (simple majority) and Senate conviction (two‑ nd (votes_S ≥ 67); else 0. The domain is all pairs of voting outcomes, the range is {0,1}.
弹劾包含两个离散步骤：众议院通过弹劾条款（简单多数）和参议院定罪（三分之二多数）。这就形成了一个条件函数：C(votes_H, votes_S) = 1，若 votes_H ≥ 218 且 votes_S ≥ 67；否则为 0。定义域为所有投票结果对，值域为 {0,1}。
From a probability standpoint, if the House impeaches with probability pH, and given impeachment the Senate convicts with probability pS, then P(conviction) = pH × pS, because the events are sequential and independent in modelling. Hence, the conviction function is multiplicative.
从概率角度来看，若众议院弹劾的概率为 pH，且弹劾后参议院定罪的概率为 pS，则由于事件按顺序发生且在模型中独立，P(定罪) = pH × pS。因此定罪函数具有乘法性。
12. Conclusion: Congress Through the Lens of Functions | 结语：透过函数看国会
The United States Congress, with its complex rules and multiple stages, provides a rich context for revising A‑Level mathematics. Functions — whether linear, periodic, exponential, probabilistic or composite — offer powerful tools to describe lawmaking, oversight, budgeting and voting. By linking classroom concepts to a real‑world institution, learners can deepen their understanding of domain, range, transformations, integration and statistical modelling, all essential for Edexcel examinations.
美国国会因其复杂的规则和多阶段流程，为复习 A‑Level 数学提供了丰富的背景。函数——无论是线性、周期、指数、概率还是复合函数——都为我们描述立法、监督、预算和投票提供了有力工具。把课堂概念与现实机构相联系，学习者能够加深对定义域、值域、变换、积分以及统计建模的理解，而这些正是 Edexcel 考试的核心内容。
Published by TutorHao | Mathematics Revision Series | aleveler.com
更多咨询请联系16621398022（同微信）
或截图后用「扫一扫 → 相册」选择本图