The Art of Mathematical Writing: Structuring Proofs and Arguments in CAIE Further Mathematics | CAIE进阶数学证明写作框架与范文解析

📚 The Art of Mathematical Writing: Structuring Proofs and Arguments in CAIE Further Mathematics | CAIE进阶数学证明写作框架与范文解析

Writing clear and rigorous proofs is at the heart of Cambridge International AS & A Level Further Mathematics (9231). Whether you are tackling proof by induction, contradiction, or complex number arguments, a well-structured response not only secures marks but also demonstrates genuine mathematical maturity. This article presents a practical framework for constructing high-scoring “mini-essays” in the context of Year 12 topics, complete with worked examples that mirror CAIE mark scheme expectations.

清晰而严密的证明写作是 CAIE 进阶数学（9231）的核心能力。无论是数学归纳法、反证法还是复数相关的论证，结构条理分明的答案不仅能为你锁定分数，更能展现真正的数学思维深度。本文针对 Year 12 的考点，提供了一套搭建高分“小型论文”的实用框架，并附上完全符合 CAIE 评分标准的范文，帮助你在考试中游刃有余。

1. Why Structure Matters in Further Maths | 进阶数学中结构的重要性

In CAIE Further Mathematics, questions worth 5 – 8 marks often carry explicit communication marks (B or E marks) for a clear logical chain. Examiners do not simply look for the final answer; they reward the clarity of your reasoning, correct use of notation, and justified conclusions. A random heap of equations without linking words risks losing marks even if the mathematics is essentially correct.

在 CAIE 进阶数学中，占 5 – 8 分的题目通常设有明确的表达分（B 或 E 分），用于评判逻辑链条是否清晰。阅卷官不会只看最终答案，他们看重你的推理是否通透、符号使用是否正确、结论是否有充分依据。即使数学推导基本正确，如果只是把一堆等式杂乱无章地堆砌而没有衔接性语言，也极易丢分。

2. Understanding CAIE Expectation: The ‘Show’ and ‘Prove’ Question | 理解 CAIE 的命题意图：“求证”与“证明”题

In Papers 1 and 2 for the AS Further Mathematics syllabus, you will frequently encounter imperatives such as ‘Prove by induction that…’, ‘Show that…’, or ‘Determine whether… and justify your answer’. These are not purely computational items; they require a written argument. The mark scheme typically allocates marks for setting up the statement, performing the base case, stating the induction hypothesis, and completing the inductive step with a final verdict.

在 AS 进阶数学的试卷一与试卷二中，你会频繁遇到“用数学归纳法证明……”“求证……”或“判断……并论证你的答案”这类指令。它们不是单纯的计算题，而是要求你书写完整的论证过程。评分方案通常为：明确写出待证命题、完成基础情形、陈述归纳假设、完成递推步骤并给出结论——每一项都有对应分值。

3. The 4-Part Proof Framework | 四步证明框架

Almost every structured proof in CAIE Further Mathematics can follow a consistent 4-part pattern: (1) State – clearly restate what is to be proved; (2) Strategise – indicate the proof technique and set up initial conditions; (3) Execute – carry out the algebraic or logical manipulations step by step; (4) Conclude – write a sentence that confirms the statement has been proved. This framework works for induction, contradiction, direct proof, and even for vector or matrix arguments.

几乎 CAIE 进阶数学中所有结构化证明都可以遵循统一的四步法：（1）陈述——清晰复述待证命题；（2）策略——指明使用的证明方法并设定初始条件；（3）执行——逐步完成代数或逻辑推导；（4）结论——用一句话确认命题已得证。这一框架对归纳法、反证法、直接证明，乃至向量或矩阵论证同样适用。

Part \| 步骤	English Phrasing \| 英文表述	中文指引
1. State	‘We need to prove that…’	明确写出待证目标
2. Strategise	‘Let P(n) be the statement…’	引入记号或方法
3. Execute	‘LHS = … = RHS’	分步递推，对齐等式
4. Conclude	‘Hence P(n) is true for all n ∈ ℤ⁺.’	囊括所有正整数的结语

4. Mastering Proof by Induction | 精通数学归纳法写作

Proof by induction is the most heavily tested formal writing skill in the Year 12 syllabus. A model induction essay must contain: definition of P(n), base case (n = 1 verified), inductive hypothesis (assume true for n = k), and the inductive step where you add the (k + 1)th term or manipulate matrices to show P(k) ⇒ P(k+1). Each of these components must be labelled explicitly to meet mark scheme requirements.

数学归纳法是 Year 12 大纲中考查最密集的正式写作技能。一篇标准的归纳法“小论文”必须包含：P(n) 的定义、基础情形（验证 n = 1）、归纳假设（假设对 n = k 成立），以及递推步骤——通过添加第 (k + 1) 项或进行矩阵运算来证明 P(k) ⇒ P(k+1)。每一个组成部分都必须显式标注，才能精准匹配评分点。

For example, when proving the matrix result: For A = [[2, 1],[0, 2]], show that Aⁿ = [[2ⁿ, n·2ⁿ⁻¹],[0, 2ⁿ]]. The essay should begin with ‘Let P(n): Aⁿ = [[2ⁿ, n·2ⁿ⁻¹],[0, 2ⁿ]]’. The inductive step: assume P(k) true, then Aᵏ⁺¹ = A·Aᵏ, multiply out carefully and factor 2ᵏ.

例如，在证明矩阵结论 A = [[2, 1],[0, 2]] 时，需证明 Aⁿ = [[2ⁿ, n·2ⁿ⁻¹],[0, 2ⁿ]]。答案应从 ‘Let P(n): Aⁿ = [[2ⁿ, n·2ⁿ⁻¹],[0, 2ⁿ]]’ 开始。递推步骤：假设 P(k) 成立，则 Aᵏ⁺¹ = A·Aᵏ，仔细完成矩阵乘法并提取 2ᵏ，最终得到所需形式。

5. Crafting a Watertight Induction Proof: Full Model Answer | 滴水不漏的归纳法范文

Below is a model answer for a typical CAIE induction problem involving a series summation. Notice the linking phrases and the clear separation of the inductive step.

以下是一道典型 CAIE 级数求和归纳题的范文。请注意衔接性短语的使用以及递推步骤的清晰分层。

Question: Prove by induction that for all n ∈ ℤ⁺, Σᵣ₌₁ⁿ r(3r + 1) = n(n + 1)².

题目：用数学归纳法证明，对所有正整数 n，Σᵣ₌₁ⁿ r(3r + 1) = n(n + 1)²。

Model Answer:

Let P(n) be the statement: Σᵣ₌₁ⁿ r(3r + 1) = n(n + 1)².
Base case: For n = 1, LHS = 1×(3·1 + 1) = 4; RHS = 1·(1 + 1)² = 4. Hence P(1) is true.
Inductive step: Assume P(k) is true for some k ≥ 1, i.e. Σᵣ₌₁ᵏ r(3r + 1) = k(k + 1)².
For n = k + 1, LHS = Σᵣ₌₁ᵏ r(3r + 1) + (k + 1)(3(k + 1) + 1)
= k(k + 1)² + (k + 1)(3k + 4)
= (k + 1)[k(k + 1) + (3k + 4)]
= (k + 1)(k² + 4k + 4)
= (k + 1)(k + 2)²
= (k + 1)((k + 1) + 1)², which is exactly the RHS of P(k + 1).
Thus P(k) ⇒ P(k + 1). Since P(1) is true and the inductive step holds, by mathematical induction, P(n) is true for all n ∈ ℤ⁺.

范文：

设 P(n) 为命题：Σᵣ₌₁ⁿ r(3r + 1) = n(n + 1)²。
基础情形：当 n = 1 时，左 = 1×(3·1 + 1) = 4；右 = 1·(1 + 1)² = 4。故 P(1) 成立。
归纳步骤：假设 P(k) 对某 k ≥ 1 成立，即 Σᵣ₌₁ᵏ r(3r + 1) = k(k + 1)²。
对于 n = k + 1，左式 = Σᵣ₌₁ᵏ r(3r + 1) + (k + 1)(3(k + 1) + 1)
= k(k + 1)² + (k + 1)(3k + 4)
= (k + 1)[k(k + 1) + (3k + 4)]
= (k + 1)(k² + 4k + 4)
= (k + 1)(k + 2)²
= (k + 1)((k + 1) + 1)²，此即 P(k + 1) 的右式。
因此 P(k) ⇒ P(k + 1)。因 P(1) 为真且归纳步骤成立，由数学归纳法，对所有正整数 n 均有 P(n) 成立。

6. Proof by Contradiction: A Template for Irrationality | 反证法标准模板：以无理数证明为例

Contradiction proofs appear routinely, especially in topics like rationalising expressions or demonstrating that √2 is irrational. The framing sentence is vital: ‘Assume, to the contrary, that…’. Then you derive two contradictory facts (e.g., an integer is both even and odd), and conclude the original assumption must be false. Always finish with a concluding sentence such as ‘This contradiction shows our assumption was false; therefore…’

反证法在有理化表达、证明 √2 为无理数等题目中屡见不鲜。开篇句至关重要：“相反地，假设……” 然后推导出两个互相矛盾的事实（例如某个整数既是偶数又是奇数），最后得出原假设必为假的结论。务必以总结句收尾，如“这一矛盾表明原假设不成立，因此……”。

Example template: ‘Suppose by contradiction that √3 is rational. Then √3 = p/q with p,q coprime integers, q ≠ 0. Squaring gives 3 = p²/q² ⇒ p² = 3q², so 3 divides p², thus 3 divides p. Write p = 3k. Substitute to get 9k² = 3q² ⇒ q² = 3k², so 3 divides q² and hence 3 divides q. This contradicts the assumption that p and q are coprime. Hence √3 cannot be rational.’

标准模板：假设 √3 是有理数，则 √3 = p/q，其中 p、q 为互质整数且 q ≠ 0。平方得 3 = p²/q² ⇒ p² = 3q²，故 3 整除 p²，从而 3 整除 p。令 p = 3k。代入可得 9k² = 3q² ⇒ q² = 3k²，故 3 整除 q²，进而 3 整除 q。这与 p、q 互质矛盾。因此 √3 不可能是有理数。

7. Proof Involving Complex Numbers: Using Modulus and Argument | 复数论证写作框架

When asked to prove a geometric property using complex numbers, use a clear structure: state the representation (e.g., let z = x + iy). Begin with the condition given, then manipulate algebraic expressions to unveil the geometric truth. For example, to prove |z − a| = |z − b| represents the perpendicular bisector of the segment joining a and b, write: |z − a|² = |z − b|² ⇒ (z − a)(z̄ − ā) = (z − b)(z̄ − b̄). Expand and simplify to get a linear equation in z and z̄, which confirms it’s a line. End with ‘Hence the locus is the perpendicular bisector’.

当题目要求用复数证明几何性质时，采用清晰的结构：先指定表示（如令 z = x + iy）。从给定条件出发，通过代数变形揭示几何事实。例如证明 |z − a| = |z − b| 表示连接 a 与 b 的线段的垂直平分线，可写：|z − a|² = |z − b|² ⇒ (z − a)(z̄ − ā) = (z − b)(z̄ − b̄)。展开并化简得到关于 z 和 z̄ 的线性方程，确认其代表一条直线。以“因此该轨迹为垂直平分线”收尾。

8. Matrices and Determinant Arguments | 矩阵与行列式论证写作

In the Further Mathematics syllabus, you often prove properties like (AB)⁻¹ = B⁻¹A⁻¹ or det(AB) = det(A)·det(B) for specific matrices or in general. Your essay must show each algebraic manipulation explicitly, with clear justifications such as ‘by associativity of matrix multiplication’ or ‘since det(A) ≠ 0, A is invertible’. Avoid skipping steps; CAIE examiners are looking for logical completeness, not just an answer.

在进阶数学大纲中，你经常需要证明诸如 (AB)⁻¹ = B⁻¹A⁻¹ 或 det(AB) = det(A)·det(B) 等命题。你的论证必须明确展示每一步代数操作，并附上充分理由，如“由矩阵乘法的结合律”或“因为 det(A) ≠ 0，所以 A 可逆”。务必避免跳步，CAIE 阅卷官注重的是逻辑的完整性，而不仅仅是结果。

Sample frame: ‘To prove det(AB) = det(A)det(B) for 2×2 matrices, let A = [[a,b],[c,d]] and B = [[e,f],[g,h]]. LHS = det(AB) = det([[ae+bg, af+bh],[ce+dg, cf+dh]]) = (ae+bg)(cf+dh) − (af+bh)(ce+dg). Expand and factor to show it equals (ad − bc)(eh − fg) = det(A)·det(B).’

写作范例：为证明 2×2 矩阵情况下 det(AB) = det(A)det(B)，设 A = [[a,b],[c,d]]，B = [[e,f],[g,h]]。左 = det(AB) = det([[ae+bg, af+bh],[ce+dg, cf+dh]]) = (ae+bg)(cf+dh) − (af+bh)(ce+dg)。展开并因式分解，即可得到 (ad − bc)(eh − fg) = det(A)·det(B)，从而得证。

9. Writing Vector Proofs: Showing Collinearity and Concurrency | 向量证明写作要领

Vector geometry proofs in CAIE require you to express vectors in terms of given parameters and use scalar multiples to show collinearity. A sharp essay will define position vectors, express required vectors (e.g., AB⃗, AP⃗) in terms of a common basis, and then confirm proportionality. Always end with a sentence such as ‘Since AP⃗ = λ PB⃗, points A, P and B are collinear.’

CAIE 中的向量几何证明需要你用给定参数表达向量，并用标量倍数关系来证共线。一篇精练的答案应定义位置向量，将待求向量（如 AB⃗, AP⃗）用统一基表达，再确认是否成比例。最后一定要写一句“因为 AP⃗ = λ PB⃗，所以 A、P、B 三点共线”。

Model snippet: ‘Let the origin be O. Position vectors: a = OA⃗, b = OB⃗. Then AB⃗ = b − a. Given AP⃗ = (2/3) AB⃗, we have AP⃗ = (2/3)(b − a). Therefore P has position vector p = a + AP⃗ = a + (2/3)(b − a) = (1/3)a + (2/3)b. Since coefficients sum to 1, P lies on AB. Moreover, AP⃗ is a scalar multiple of AB⃗, confirming collinearity.’

范文片段：设原点为 O。位置向量 a = OA⃗, b = OB⃗。则 AB⃗ = b − a。已知 AP⃗ = (2/3) AB⃗，故 AP⃗ = (2/3)(b − a)。因此 P 的位置向量 p = a + AP⃗ = a + (2/3)(b − a) = (1/3)a + (2/3)b。由于系数之和为 1，P 在 AB 上。且 AP⃗ 是 AB⃗ 的标量倍，确证共线。

10. Common Pitfalls That Lose Marks | 常见失分点与规避方法

Many candidates write impressive algebra but fail to pick up communication marks because they omit the conclusion or forget to state the range of validity (e.g., ‘for all n ∈ ℤ⁺’). Another trap is using ‘=’ when implication is intended; always use ‘⇒’ to connect steps logically. Also, in induction, stating the inductive hypothesis wrongly (e.g., assuming P(k+1) instead of P(k)) is an instant deduction. Always copy the assumption from P(k) exactly.

不少考生代数运算出色，却因为没有写结论或忘记标明成立范围（如“对所有 n ∈ ℤ⁺”）而丢掉了表达分。另一个常见陷阱是在应当使用蕴含符号的地方误用等号；务必用“⇒”来逻辑连接各步。此外，在归纳法中，错误表述归纳假设（例如假设 P(k+1) 而非 P(k)）会被直接扣分。务必准确复制 P(k) 的假设语句。

Never start the induction step with ‘Assume true for n = k + 1’ — always assume for n = k.
Use brackets carefully when expanding (k + 1) terms to avoid algebraic slip-ups.
In contradiction proofs, explicitly state the contradiction ‘This contradicts the assumption that…’

切勿在递推步骤以“假设 n = k + 1 时成立”开头——必须假设 n = k 成立。
展开 (k + 1) 项时仔细使用括号，避免代数失误。
在反证法中，明确点明矛盾之处：“这与……的假设相矛盾”。

11. Model Answer: Proving a Matrix Property by Induction | 范文：矩阵性质归纳证明

Question: Given A = [[1, 2],[0, 1]], prove by induction that Aⁿ = [[1, 2n],[0, 1]] for all positive integers n.

题目：已知 A = [[1, 2],[0, 1]]，用数学归纳法证明对所有正整数 n，有 Aⁿ = [[1, 2n],[0, 1]]。

Model Answer:

Let P(n): Aⁿ = [[1, 2n],[0, 1]].
Base case: n = 1 → A¹ = [[1, 2],[0, 1]] = [[1, 2·1],[0, 1]], true.
Inductive step: Assume P(k) true for some k ≥ 1: Aᵏ = [[1, 2k],[0, 1]].
Consider Aᵏ⁺¹ = A·Aᵏ = [[1, 2],[0, 1]] × [[1, 2k],[0, 1]].
= [[1·1 + 2·0, 1·2k + 2·1],
[0·1 + 1·0, 0·2k + 1·1]]
= [[1, 2k + 2],[0, 1]]
= [[1, 2(k + 1)],[0, 1]].
This is exactly P(k + 1). Hence P(k) ⇒ P(k + 1).
Since P(1) true and P(k) ⇒ P(k + 1), by mathematical induction, Aⁿ = [[1, 2n],[0, 1]] for all n ∈ ℤ⁺.

范文：

设 P(n): Aⁿ = [[1, 2n],[0, 1]]。
基础情形：n = 1 → A¹ = [[1, 2],[0, 1]] = [[1, 2·1],[0, 1]]，真。
归纳步骤：假设 P(k) 对某 k ≥ 1 成立：Aᵏ = [[1, 2k],[0, 1]]。
考虑 Aᵏ⁺¹ = A·Aᵏ = [[1, 2],[0, 1]] × [[1, 2k],[0, 1]]
= [[1·1 + 2·0, 1·2k + 2·1], [0·1 + 1·0, 0·2k + 1·1]]
= [[1, 2k + 2],[0, 1]]
= [[1, 2(k + 1)],[0, 1]]。
此即 P(k + 1)。因此 P(k) ⇒ P(k + 1)。
因 P(1) 真且 P(k) ⇒ P(k + 1)，由数学归纳法，对所有 n ∈ ℤ⁺，Aⁿ = [[1, 2n],[0, 1]] 成立。

12. Final Checklist for Proof Writing Success | 证明写作通关清单

Before you move on to the next question, run through this mental checklist: Have I stated P(n) unambiguously? Did I verify the base case with working? Is my inductive hypothesis correctly phrased? Does my inductive step derive the target expression without logical gaps? Did I write a concluding statement? For contradiction: did I clearly state the contradiction? If you can tick all these boxes, you are well on your way to earning full communication marks in CAIE Further Mathematics.

在解答下一道题之前，请在心里过一遍这个清单：我是否清晰地陈述了 P(n)？基础情形的验证是否带演算步骤？归纳假设的表述是否准确？递推步骤是否无逻辑跳跃地推导出了目标式？是否写下了结论句？对于反证法：我是否明确写出了矛盾所在？如果这些你都能打勾，那么在 CAIE 进阶数学考试中拿下所有表达分将水到渠成。

Published by TutorHao | Further Mathematics Revision Series | aleveler.com

更多咨询请联系16621398022（同微信）

The Art of Mathematical Writing: Structuring Proofs and Arguments in CAIE Further Mathematics | CAIE进阶数学证明写作框架与范文解析