Year 12 CAIE Further Mathematics: Structured Proof Writing – A Framework and Exemplar | Year 12 CAIE 进阶数学：论文写作框架与范文

📚 Year 12 CAIE Further Mathematics: Structured Proof Writing – A Framework and Exemplar | Year 12 CAIE 进阶数学：论文写作框架与范文

Strong performance in CAIE Year 12 Further Mathematics examinations depends not only on solving equations but also on communicating reasoning with clarity. Many high-mark questions require extended, essay-style responses – proofs by induction, trigonometric derivations or complex number arguments – that must be logically structured to earn full credit. This article lays out a reliable writing framework and provides a fully annotated exemplar so you can turn every proof question into a showcase of mathematical fluency.

在CAIE Year 12 进阶数学考试中取得高分，不仅需要会解方程，更需要清晰表达推理过程。许多高分题目要求写出拓展型、论文式的作答，例如数学归纳法证明、三角推导或复数论证，这些都必须具备严谨的逻辑结构才能拿到满分。本文将给出一个可靠的写作框架，并提供一篇详细注释的范文，帮助你把每一道证明题都变成展示数学功力的舞台。

---

1. Understanding the Question | 理解题目要求

Read the prompt twice. Identify the type of proof expected: direct deduction, proof by induction, counterexample, or a sequence of algebraic manipulations with justifications. Underline command words such as 'prove', 'show that', 'verify' or 'determine'. In CAIE Further Mathematics, marks are allocated for structure, use of notation and explicit referencing of standard results.

仔细阅读题目两遍。判断要求的是哪种类型的证明：直接推导、数学归纳法、反例构造，还是带说明的代数运算序列。在 'prove', 'show that', 'verify', 'determine' 等指令词下画线。在 CAIE 进阶数学中，卷面分不仅给在最终答案上，更给在作答结构、符号使用以及是否明确引用标准结论上。

Also note any domain restrictions or special cases. For example, 'for all positive integers n' signals an induction problem, while 'given that z = cosθ + i sinθ' hints that de Moivre' n with precise symbols, showing the examiner that you have interpreted the task correctly.

同时要注意定义域或特殊条件。例如 'for all positive integers n' 提示这很可能是一道归纳法题目，而 'given that z = cosθ + i sinθ' 暗示需要用到棣莫弗定理或三角恒等式。作答的第一段应该用精确的符号重新陈述命题，向阅卷人表明你已经准确理解了题意。

---

2. Planning Your Argument | 规划你的论证

Before writing a single line of working, sketch the logical skeleton on rough paper. For an induction proof, list: statement P(n), base case(s), inductive hypothesis, inductive step, and conclusion. For a trigonometric identity, plan which compound angle or double angle formulas will be applied and in what order. This skeleton prevents you from meandering off the logical path and wasting time on dead-end algebra.

在动笔之前，先在草稿纸上列出逻辑骨架。数学归纳法的骨架应包括：命题 P(n)、基础情况、归纳假设、归纳步骤和结论。三角恒等式的推导则应事先规划好使用哪些和角公式或倍角公式，以及使用的先后顺序。有了骨架，你就不会在逻辑上绕远路，也不会把时间浪费在无效的代数运算上。

Thinking ahead also helps you decide where to introduce auxiliary variables, how to factor common terms, and when to reference a theorem such as de Moivre's or the principle of mathematical induction. CAIE mark schemes consistently reward candidates who show a clear, forward-moving narrative rather than a scrambled set of equations.

提前思考还能帮你决定在何处引入辅助变量、如何提取公因子，以及何时引用棣莫弗定理或数学归纳法原理。CAIE 评分标准一贯青睐那些展现出清晰、持续推进的叙述的考生，而不是把一堆方程杂乱堆砌的答案。

---

3. Setting Up Notation and Assumptions | 建立符号与假设

Begin every extended response by defining your notation. If a question involves (cosθ + i sinθ)ⁿ, state 'Let P(n) be the statement … for n ∈ ℕ, n ≥ 1.' If you are working with complex numbers, write 'Let z = cosθ + i sinθ' and note that |z| = 1 and arg(z) = θ. Explicitly mention any assumptions, such as 'Assume the compound angle formulas hold for all real θ.'

每次展开作答前先定义符号。如果题目涉及 (cosθ + i sinθ)ⁿ，要写明 'Let P(n) be the statement … for n ∈ ℕ, n ≥ 1.' 如果使用复数，请写出 'Let z = cosθ + i sinθ'，并说明 |z| = 1 且 arg(z) = θ。明确写出任何假设条件，例如 'Assume the compound angle formulas hold for all real θ.'

Well-defined notation does two things: it reduces the risk of algebraic slips, and it demonstrates to the examiner that you are operating in a rigorous mathematical framework. In a proof by induction, failure to label P(n) can cost you the communication mark even if the algebra is correct.

清晰的符号定义有两个好处：降低代数运算失误的风险，同时向阅卷人表明你是在一套严谨的数学框架下进行推理。在数学归纳法中，如果不对 P(n) 进行标注，即便代数运算无误，也可能丢掉表达分。

---

4. Logical Flow and Connectives | 逻辑流与连接词

Use connectives to guide the reader through your reasoning. Words like 'Therefore', 'Hence', 'Since', 'By the inductive hypothesis', 'Applying the identity …' and 'Consequently' signal the relationship between successive lines. Avoid the common mistake of presenting a long column of unconnected equations; the examiner should not have to guess whether line two follows from line one or is an independent statement.

使用连接词引导阅卷人阅读你的推理。'Therefore'、'Hence'、'Since'、'By the inductive hypothesis'、'Applying the identity …'、'Consequently' 这些词能够表明前后行之间的关系。不要犯常见错误，把一大堆没有连接关系的方程列成一排；阅卷人不应该是猜谜，不确定第二行是由第一行推出的、还是一个独立的陈述。

In CAIE scripts, a well-connected argument often earns all 'method' marks even if a small arithmetic error appears later. Connectives also help you detect gaps in your own logic during revision. Practice reading your proof aloud: if you find yourself saying 'and then… and then… and then…' without justification, you need to insert a linking phrase or supporting reference.

在 CAIE 答卷中，一个连接得当的论证即使后期出现轻微的算术错误，也往往能拿到全部方法分。连接词还能帮助你在检查时发现自己逻辑中的漏洞。试着把自己的证明读出声来：如果发现自己在不停地说 '然后…然后…然后…' 而没有给出理由，就需要插入连接短语或引用相关的定理作为支撑。

---

5. Mathematical Language and Precision | 数学语言与准确性

Use accurate mathematical language throughout. Write 'RHS' and 'LHS' to avoid repeating long expressions. Specify the domain when you introduce variables: 'for all θ ∈ ℝ', 'n ∈ ℤ⁺'. Use 'iff' only when the equivalence genuinely holds in both directions. Distinguish between 'necessary' and 'sufficient' conditions if the question requires this depth. Careless language can turn a correct proof into a questionable one.

全程使用准确的数学语言。用 'RHS' 和 'LHS' 来代表右式和左式，避免重复冗长的表达式。引入变量时指明定义域：'for all θ ∈ ℝ', 'n ∈ ℤ⁺'。只有在确实可双向推导时才使用 'iff'。如果题目有要求，要区分必要条件和充分条件。粗心的语言可能让一个原本正确的证明变得站不住脚。

Maintain consistent bracket usage and spacing to avoid ambiguity. For complex expressions such as (cos kθ + i sin kθ)(cosθ + i sinθ), inserting intermediate scaled brackets or writing multiplication as a centre dot can prevent slip-ups. Every symbol on the page should serve a clear logical purpose.

保持括号使用和间距的一致性，避免歧义。对于像 (cos kθ + i sin kθ)(cosθ + i sinθ) 这样的复杂表达式，插入适当的中间括号或用居中点表示乘法都能防止不小心犯错。页面上的每一个符号都应该服务于清晰的逻辑目的。

---

广告 / Sponsored

6. The Induction Proof Structure | 归纳法证明结构

Proof by mathematical induction appears frequently in CAIE FP1 papers and requires a fixed five-part template. Learning this template guarantees you do not omit essential components:

数学归纳法是 CAIE FP1 试卷上的常客，它需要一套固定的五部分模板。学会这个模板，就能确保不遗漏任何必要的成分：

Component (English)	中文说明
1. Statement of P(n)	明确写出命题 P(n)，清楚注明 n 的定义域
2. Base case (usually n = 1)	验证 n=1 时命题成立，展示 LHS = RHS
3. Inductive hypothesis: assume P(k) true	假设当 n=k 时命题成立，写出假设等式
4. Inductive step: prove P(k+1) using P(k)	从 P(k) 出发，通过代数运算、定理或恒等式推到 P(k+1)
5. Conclusion invoking the principle of induction	写明 'Hence, by mathematical induction, P(n) is true for all n ∈ ℕ, n ≥ 1.'

by failing to write the inductive hypothesis explicitly. Integrate the hypothesis line as: 'Assume that for some k ≥ 1, P(k) holds, i.e., …' and then immediately show how it is used. The step 'P(k) ⇒ P(k+1)' must appear clearly in your working.

许多学生因为没有写最终结论，或者没有明确写出归纳假设而丢分。请把假设行写成：'Assume that for some k ≥ 1, P(k) holds, i.e., …'，然后紧接着展示你是如何利用它的。在运算过程中必须清晰地体现出从 P(k) 推导至 P(k+1) 的过程。

---

7. Common Mistakes to Avoid | 常见错误规避

Beware of these frequent pitfalls in extended responses. (a) Omitting the base case completely or verifying it for the wrong value. (b) Circular reasoning: using what you are trying to prove as a 'known fact' halfway through. (c) Algebraic leaps that assume the conclusion, for instance writing P(k+1) and then manipulating it until you reach an identity; correct induction works forward from P(k). (d) Misapplying de Moivre's theorem when negative or fractional powers are involved without discussing branches.

在拓展型作答中，请警惕这些常见错误：(a) 完全漏掉基础情况，或用错误的 n 值去验证；(b) 循环论证：在推导中途把要证明的结论当作“已知事实”来用；(c) 跳跃式代数，比如先写出 P(k+1) 然后反向变形直到得出恒等式；正确的归纳法应当从 P(k) 正向推导；(d) 当涉及负指数或分数次幂时，未经讨论分支就随意应用棣莫弗定理。

Additionally, many candidates write the conclusion as 'P(k) is true, so P(k+1) is true' without explicitly linking back to the axiom of induction. Always finish with a sentence that references the principle: 'Since P(1) is true and P(k) ⇒ P(k+1), by mathematical induction P(n) is true for all positive integers n.' This final sentence can secure the last A1 mark.

此外，许多考生把结论写成 'P(k) 成立，所以 P(k+1) 成立'，却没有明确与归纳公理联系起来。务必用一句完整的话收尾：'Since P(1) is true and P(k) ⇒ P(k+1), by mathematical induction P(n) is true for all positive integers n.' 这个最后陈述往往能保下最后一个 A1 分数。

---

8. Exemplar Response with Annotations | 范文带注释

Below is a fully worked solution to a standard CAIE Further Mathematics induction problem, annotated with the framework components. The problem is: Prove by induction that (cosθ + i sinθ)ⁿ = cos nθ + i sin nθ for all positive integers n.

以下是一道标准 CAIE 进阶数学归纳法题目的完整解答，并加上了框架要素注释。题目为：用数学归纳法证明，对所有正整数 n，(cosθ + i sinθ)ⁿ = cos nθ + i sin nθ 成立。

Step 1 – State the proposition (框架第一步：陈述命题)
Let P(n) be the statement: (cosθ + i sinθ)ⁿ = cos nθ + i sin nθ, for n ∈ ℕ, n ≥ 1.

步骤1 – 陈述命题
令 P(n) 表示命题：(cosθ + i sinθ)ⁿ = cos nθ + i sin nθ，其中 n ∈ ℕ，n ≥ 1。

Step 2 – Base case (框架第二步：基础情况)
For n = 1: LHS = (cosθ + i sinθ)¹ i sinθ. RHS = cos(1·θ) + i sin(1·θ) = cosθ + i sinθ. Therefore LHS = RHS, so P(1) is true.

步骤2 – 基础情况
当 n = 1 时：LHS = (cosθ + i sinθ)¹ = cosθ + i sinθ，RHS = cos(1·θ) + i sin(1·θ) = cosθ + i sinθ。因此 LHS = RHS，P(1) 成立。

Step 3 – Inductive hypothesis (框架第三步：归纳假设)
Assume that P(k) is true for some integer k ≥ 1. That is, (cosθ + i sinθ)^k = cos kθ + i sin kθ.

步骤3 – 归纳假设
假设对于某个整数 k ≥ 1，P(k) 成立，即 (cosθ + i sinθ)^k = cos kθ + i sin kθ。

Step 4 – Inductive step (框架第四步：归纳步骤)
We must show that P(k+1) holds. Consider the left-hand side for n = k+1:
LHS = (cosθ + i sinθ)^k+1 = (cosθ + i sinθ)^k · (cosθ + i sinθ).
Using the inductive hypothesis, substitute for (cosθ + i sinθ)^k:
= (cos kθ + i sin kθ)(cosθ + i sinθ).
Expand the product:
= cos kθ cosθ + i cos kθ sinθ + i sin kθ cosθ + i² sin kθ sinθ.
Since i² = -1, this becomes:
= (cos kθ cosθ − sin kθ sinθ) + i (sin kθ cosθ + cos kθ sinθ).
e: cos(A+B) = cosA cosB − sinA sinB, sin(A+B) = sinA cosB + cosA sinB, with A = kθ, B = θ.
Hence, the expression simplifies to:
= cos(kθ + θ) + i sin(kθ + θ) = cos[(k+1)θ] + i sin[(k+1)θ].
This is exactly the right-hand side of P(k+1). Thus P(k) ⇒ P(k+1).

步骤4 – 归纳步骤
我们需要证明 P(k+1) 成立。考虑 n = k+1 时的左边：
LHS = (cosθ + i sinθ)^k+1 = (cosθ + i sinθ)^k · (cosθ + i sinθ)。
运用归纳假设，替换 (cosθ + i sinθ)^k：
= (cos kθ + i sin kθ)(cosθ + i sinθ)。
展开乘积：
= cos kθ cosθ + i cos kθ sinθ + i sin kθ cosθ + i² sin kθ sinθ。
因为 i² = -1，上式变为：
= (cos kθ cosθ − sin kθ sinθ) + i (sin kθ cosθ + cos kθ sinθ)。
运用和角公式：cos(A+B) = cosA cosB − sinA sinB，sin(A+B) = sinA cosB + cosA sinB，其中 A = kθ，B = θ。
于是表达式化简

Published by TutorHao | Year 12 进阶数学 Revision Series | aleveler.com

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