📚 AQA Year 13 Further Maths: Writing Frameworks for Proofs and Reasoning | AQA Year 13 进阶数学：证明与推理写作框架及范文
In AQA Year 13 Further Mathematics, many questions demand more than just a final answer — they require a coherent, logically structured argument. Whether you are proving a result by induction, using contradiction, or justifying a geometric property, the clarity of your written reasoning directly affects your marks. This article provides a practical framework for constructing these 'mini-essays' in exams, along with sample responses to illustrate best practice.
在 AQA Year 13 进阶数学考试中，许多题目要求的不只是一个最终答案，而是一段连贯、逻辑严密的论证。无论你是在用数学归纳法、反证法，还是证明几何性质，书面推理的清晰度都会直接影响得分。本文将提供一套实用的写作框架，帮助你构建这类考场“小论文”，并附上范文展示最佳实践。
1. Understanding the Question and Definitions | 理解题意与关键定义
Before you write a single line, highlight the key terms and any definitions you must use. For a proof question, identify what you are given and what you need to show. Write down the relevant definitions — for example, 'a rational number can be expressed as a/b where a,b ∈ ℤ and b≠0'. Referring to these definitions in your solution shows the examiner that your reasoning rests on solid foundations.
动笔之前，先圈出关键词和你必须使用的定义。对于一个证明题，明确已知条件和待证结论。写下相关定义——例如“有理数可表为 a/b，其中 a,b ∈ ℤ 且 b≠0”。在解答中引用这些定义能向考官表明你的推理建立在坚实的基础上。
2. Structuring a Direct Proof | 直接证明的框架
A direct proof moves from a known statement to the conclusion through a chain of logical implications. Start with 'Let ...' or 'Assume ...' to set up the given conditions. Then use a series of '⇒' (implies) statements, each justified by an algebraic rule, a theorem, or a definition. End with a clear concluding sentence, such as 'Hence, the result follows.'
直接证明通过一系列逻辑蕴含从已知陈述推出结论。以“设...”或“假设...”开头，给出已知条件。然后使用一连串“⇒”（推出）步骤，每一步都用代数法则、定理或定义作为依据。最后以明确的结论句收尾，例如“因此，原命题得证。”
Example (Direct Proof: sum of two even integers is even)
Let the two even integers be 2m and 2n, where m,n ∈ ℤ.
Sum = 2m + 2n = 2(m+n).
Since m+n is an integer, the sum is a multiple of 2, hence even.
This short structure works because every step is justified.
示例（直接证明：两偶数之和为偶数）
设两偶数为 2m 和 2n，其中 m,n ∈ ℤ。
和 = 2m + 2n = 2(m+n)。
因为 m+n 是整数，所以和是 2 的倍数，即为偶数。
这个简短的结构之所以有效，是因为每一步都有依据。
3. Proof by Contradiction | 反证法写作框架
Begin by assuming the opposite of what you want to prove. State clearly: 'Assume, for contradiction, that ...' Then use logical deductions until you reach an impossibility — a statement that contradicts the original assumption, a known fact, or itself. Conclude with 'This contradiction shows that our assumption was false, therefore the original statement is true.'
先假设你要证明的命题的否定形式。清晰地陈述：“假设为了推出矛盾，有...”。然后进行逻辑推演，直至得出一个不可能的情形——与原假设矛盾、与已知事实矛盾或自相矛盾。以“这一矛盾表明我们的假设是错误的，因此原命题为真。”收尾。
Example: Proving √2 is irrational
Assume, for contradiction, that √2 = a/b where a,b ∈ ℕ, b≠0, and a/b is in lowest terms.
Squaring gives 2 = a²/b² ⇒ a² = 2b², so a² is even, so a is even. Write a = 2k.
Substitute back: (2k)² = 2b² ⇒ 4k² = 2b² ⇒ b² = 2k², so b² is even, so b is even.
Both a and b are even, contradicting that a/b is in lowest terms. Hence √2 is irrational.
示例：证明 √2 是无理数
假设为了推出矛盾，有 √2 = a/b，其中 a,b ∈ ℕ，b≠0，且 a/b 是最简分数。
平方得 2 = a²/b² ⇒ a² = 2b²，所以 a² 为偶数，故 a 为偶数。令 a = 2k。
代回：(2k)² = 2b² ⇒ 4k² = 2b² ⇒ b² = 2k²，所以 b² 为偶数，故 b 为偶数。
a 和 b 均为偶数，与 a/b 为最简分数矛盾。因此 √2 是无理数。
4. Proof by Mathematical Induction | 数学归纳法写作框架
osition P(n). Then show the base case (usually n=1). Next, write the inductive hypothesis: 'Assume P(k) is true for some k ∈ ℕ'. Finally, prove that P(k) ⇒ P(k+1) using algebraic manipulation, and conclude: 'Since P(1) is true and P(k) ⇒ P(k+1), by mathematical induction P(n) holds for all n ∈ ℕ.'
归纳法证明必须遵循严格的三段结构。首先陈述命题 P(n)。然后验证基础情形（通常 n=1）。接着写出归纳假设：“假设对于某 k ∈ ℕ，P(k) 成立”。最后，通过代数操作证明 P(k) ⇒ P(k+1)，并得出结论：“由于 P(1) 为真且 P(k) ⇒ P(k+1)，由数学归纳法知 P(n) 对所有 n ∈ ℕ 成立。”
Model Solution: Proving ∑(r=1 to n) r² = n(n+1)(2n+1)/6
Let P(n): ∑(r=1 to n) r² = n(n+1)(2n+1)/6.
Base case n=1: LHS = 1² = 1, RHS = 1×2×3/6 = 1. So P(1) true.
Inductive hypothesis: Assume P(k) true, i.e., ∑(r=1 to k) r² = k(k+1)(2k+1)/6.
Consider ∑(r=1 to k+1) r² = ∑(r=1 to k) r² + (k+1)².
= k(k+1)(2k+1)/6 + (k+1)².
+1) + 6(k+1)] = (k+1)/6 [2k² + k + 6k + 6] = (k+1)/6 [2k² + 7k + 6] = (k+1)/6 (k+2)(2k+3).
This equals (k+1)((k+1)+1)(2(k+1)+1)/6, which is P(k+1).
Thus P(k) ⇒ P(k+1). By induction, P(n) true for all n ∈ ℕ.
范文：证明 ∑(r=1 to n) r² = n(n+1)(2n+1)/6
设 P(n): ∑(r=1 to n) r² = n(n+1)(2n+1)/6。
基础情形 n=1：左式 = 1² = 1，右式 = 1×2×3/6 = 1。故 P(1) 真。
归纳假设：假设 P(k) 真，即 ∑(r=1 to k) r² = k(k+1)(2k+1)/6。
考虑 ∑(r=1 to k+1) r² = ∑(r=1 to k) r² + (k+1)²。
= k(k+1)(2k+1)/6 + (k+1)²。
提取 (k+1)/6： k+1) + 6(k+1)] = (k+1)/6 [2k² + k + 6k + 6] = (k+1)/6 [2k² + 7k + 6] = (k+1)/6 (k+2)(2k+3)。
此即 (k+1)((k+1)+1)(2(k+1)+1)/6，正是 P(k+1)。
因此 P(k) ⇒ P(k+1)。由归纳法，P(n) 对所有 n ∈ ℕ 为真。
5. Proving Vector and Geometric Results | 向量与几何证明
When working with vectors, always define your vectors clearly: 'Let the position vectors of A, B, C be a, b, c.' oplanarity) to derive the required result. State geometric conclusions explicitly, such as 'Therefore the points are collinear' or 'the line is perpendicular to the plane'.
处理向量问题时，务必清晰定义你的向量：“设 A、B、C 的位置向量分别为 a、b、c。”利用向量运算和已知恒等式（例如点积性质、a · (b × c) = 0 意味着共面）推导所需结果。明确陈述几何结论，例如“因此这些点共线”或“该直线与平面垂直”。
6. Complex Numbers and Polar Form Proofs | 复数的极坐标形式证明
Many AQA Further Maths proofs revolve around De Moivre' i sin θ). When proving trigonometric identities, expand using De Moivre and compare real and imaginary parts. Remember to justify why you can equate these parts: because two complex numbers are equal iff their real and imaginary parts are equal.
AQA 进阶数学中许多证明围绕棣莫弗定理和极坐标表示展开。将复数写作 z = r(cos θ + i sin θ)。在证明三角恒等式时，运用棣莫弗定理展开并比较实部和虚部。记得说明为何可以等同实部和虚部：两个复数相等当且仅当它们的实部和虚部分别相等。
7. Matrix Proofs and Eigenvalue Arguments | 矩阵证明与特征值论证
ven relations. Use algebraic manipulation of matrix equations, remembering that matrix multiplication is not commutative. When eigenvalues appear, use the characteristic equation det(A − λI) = 0 and verify the Cayley–Hamilton theorem if needed.
矩阵证明常常要求你证明某个性质成立，例如 A² = I 或 A 是奇异的。首先说明矩阵的阶数和已知关系。对矩阵方程进行代数操作，注意矩阵乘法不满足交换律。涉及特征值时，使用特征方程 det(A − λI) = 0，如有必要可验证凯莱–哈密顿定理。
8. Verifying Solutions to Differential Equations | 微分方程解的验证
When asked to 'verify' a solution, simply differentiate the proposed function and substitute back into the differential equation. Clearly show each derivative, simplify both sides, and conclude that the equation is satisfied identically. A clean layout — with derivatives stacked vertically — makes it easier for the examiner to follow your work.
当要求“验证”一个解时，只需对给定的函数求导并代回微分方程。清晰地展示每一步导数，化简两边，并得出方程恒成立的结论。整洁的排版——将导数上下对齐——能让考官更容易跟上你的推理。
9. Using Precise Mathematical Language | 使用精准的数学语言
Your written reasoning should avoid ambiguity. Use connecting phrases: 'Therefore', 'Hence', 'Since ... it follows that ...', 'Conversely', 'Similarly'. Mark the end of a proof with a small box or '∎'. Where appropriate, use symbols like ⇒, ⇔, ∀, ∃, but do not overuse them to the point of replacing full sentences. A mixture of words and symbols reads most convincingly.
书面推理应避免歧义。使用连接词：“因此”、“从而”、“由于...可得出...”、“反之”、“类似地”。用一个小方块或“∎”标记证明结束。合适时使用 ⇒、⇔、∀、∃ 等符号，但不要过度使用以至于取代完整语句。词语与符号相结合读起来最有说服力。
10. Common Pitfalls and How to Avoid Them | 常见错误与规避
- Missing justifications: Every algebraic step must have a reason. Do not jump from a² = 2b² to 'a is even' without stating 'so a² is even ⇒ a is even'.
- Weak base case for induction: Always check n=1 (or the smallest value) explicitly; never assume it is obvious.
- Ignoring domain restrictions: If a variable is defined as a positive integer, mention why a certain step is valid.
- 缺少理由：每一步代数操作都必须有理由。不要从 a² = 2b² 直接跳到“a 为偶数”，而应说明“故 a² 为偶数 ⇒ a 为偶数”。
- 归纳法基础情形薄弱：永远明确验证 n=1（或最小取值）；不要想当然。
- 忽视定义域限制：如果变量定义为正整数，说明某一步合法的原因。
Also, avoid circular reasoning — never assume what you are trying to prove. Plan your argument backwards from the conclusion if you are stuck, but write it forwards.
此外，避免循环论证——绝不要假设你要证明的结论。如果卡住了，可以从结论倒推以构思思路，但书写要按正向顺序。
11. Worked Example: Applying the Framework to an Exam Question | 框架应用考题示例
Question: Prove by induction that 3ⁿ − 1 is divisible by 2 for all n ∈ ℕ.
题目：用归纳法证明对所有 n ∈ ℕ，3ⁿ − 1 能被 2 整除。
Model solution
Let P(n): 3ⁿ − 1 = 2m for some integer m (i.e., divisible by 2).
Base case n=1: 3¹ − 1 = 2 = 2×1, so true.
Inductive hypothesis: Assume P(k) true, i.e., 3ᵏ − 1 = 2p, p ∈ ℤ.
Then 3ᵏ⁺¹ − 1 = 3·3ᵏ − 1 = 3(2p + 1) − 1 = 6p + 3 − 1 = 6p + 2 = 2(3p + 1).
Since 3p+1 is an integer, 3ᵏ⁺¹ − 1 is divisible by 2, so P(k+1) holds.
Thus by induction, P(n) is true for all n ∈ ℕ.
范文
设 P(n)：存在整数 m 使得 3ⁿ − 1 = 2m（即能被 2 整除）。
基础情形 n=1：3¹ − 1 = 2 = 2×1，成立。
归纳假设：假设 P(k) 真，即 3ᵏ − 1 = 2p，p ∈ ℤ。
那么 3ᵏ⁺¹ − 1 = 3·3ᵏ − 1 = 3(2p + 1) − 1 = 6p + 3 − 1 = 6p + 2 = 2(3p + 1)。
因为 3p+1 是整数，3ᵏ⁺¹ − 1 能被 2 整除，故 P(k+1) 成立。
因此由归纳法，P(n) 对所有 n ∈ ℕ 为真。
Notice how the solution explicitly links the inductive hypothesis to the algebra, uses a clear integer representation, and ends with a concluding sentence. This structure matches what AQA examiners look for.
注意该解答如何明确将归纳假设与代数步骤联系起来，使用了清晰的整数表示，并以结论句收尾。这样的结构正是 AQA 考官所期望的。
Published by TutorHao | Further Mathematics Revision Series | aleveler.com
更多咨询请联系16621398022（同微信）
或截图后用「扫一扫 → 相册」选择本图