📚 Mastering Mathematical Proof Writing: A Framework and Model Essays for Year 12 WJEC Further Mathematics | WJEC进阶数学证明题写作框架与范文
In the Year 12 WJEC Further Mathematics syllabus, the ability to construct rigorous, logically structured proofs is not merely a topic to be studied—it is the very language of the subject. Whether you are proving the irrationality of √2, establishing the validity of a summation formula via induction, or disproving a statement with a counterexample, what you are really doing is crafting a miniature mathematical essay. A disjointed collection of equations will never earn full marks in an examination; what examiners look for is a coherent narrative in which each step follows necessarily from the previous one, supported by precise justification. This article presents a comprehensive framework for proof writing, illustrated with complete model essays that exemplify the standard expected at WJEC Further Maths AS level.
在WJEC十二年级进阶数学课程中，构建严谨、逻辑清晰的证明能力并不仅仅是一个需要学习的话题——它本身就是这门学科的语言。无论你是要证明√2的无理性，用归纳法建立一个求和公式的有效性，还是通过反例来反驳一个命题，你实际上都是在撰写一篇微型的数学论文。一堆互不关联的方程永远无法在考试中赢得满分；阅卷官真正寻找的是一种连贯的叙述，其中每一步都必然由前一步推导而出，并辅以精确的理据。本文为证明书写提供了一个全面的框架，并配以完整的范文，具体展示了WJEC进阶数学AS水平所要求的标准。
1. Understanding Proofs in WJEC Further Mathematics | 理解WJEC进阶数学中的证明
A proof in mathematics is a watertight argument that demonstrates the truth of a statement beyond any doubt. Within the WJEC specification, you will encounter proofs in Pure Mathematics topics such as proof by contradiction, proof by induction, and direct proof, which are assessed not only through isolated questions but also as part of longer, structured problems involving complex numbers, sequences, and series. The key distinction between a mere calculation and a proof is the presence of a logical thread: you must explain why each algebraic manipulation is permissible and how it contributes to the overall conclusion.
数学中的证明是一个滴水不漏的论证，它无可置疑地展示了一个陈述的真实性。在WJEC的考试大纲中，你会在纯数学部分遇到反证法、归纳法和直接证明等证明方法，这些不仅通过单独的题目来考核，而且会嵌入到涉及复数、数列和级数的结构化长问题中。单纯的计算与证明之间的关键区别在于逻辑脉络的存在：你必须解释每一步代数操作的合理性，以及它是如何服务于最终结论的。
2. The Structure of a Mathematical Proof: A Mini-Essay | 数学证明的结构：一篇小论文
Just as a well-written essay has an introduction, body paragraphs, and a conclusion, a polished proof possesses a discernible tripartite structure. Begin by stating the proposition you intend to prove, using precise mathematical language and introducing any necessary notation. The body of the proof develops a chain of deductions, each justified by a definition, an axiom, or a previously established result. Finally, the conclusion reiterates that the proposition has been proved, often signalled by the phrase 'Therefore' or placing a small square (∎) at the end. Adopting this format prevents you from drifting into irrelevant calculations and ensures that your argument remains transparent to the examiner.
正如一篇好文章拥有引言、主体段落和结论，一个精美的证明也有着清晰可辨的三段式结构。首先，陈述你想证明的命题，使用精确的数学语言并引入所有必需的符号。证明的主体部分展开一连串的演绎推理，每一步都由一个定义、公理或先前确立的结论来支撑。最后，结论重申该命题已被证明，通常以“因此”一词标示或在末尾加上一个小方块（∎）。采用这种格式可以防止你偏离到无关的计算中去，并确保你的论证对考官而言清晰透明。
3. Key Logical Connectives and Quantifiers | 关键逻辑连接词与量词
stering the vocabulary of logical connectives is essential for crafting fluent proofs. Use 'if ... then' to express implication, 'if and only if' for equivalence, and words such as 'hence', 'thus', and 'consequently' to signal deductive steps. Quantifiers like 'for all' (∀) and 'there exists' (∃) must be handled with care: a statement like 'For all real numbers x, x² ≥ 0' is true, whereas 'There exists a real number x such that x² < 0' When you need to negate a statement containing a quantifier, remember that the negation of 'for all' is 'there exists' and vice versa, a technique that lies at the heart of proof by contradiction.
掌握逻辑连接词的词汇是写出流畅证明的关键。用“如果……那么……”来表达蕴含关系，用“当且仅当”来表达等价关系，并使用“因此”、“于是”、“从而”等词语来标示演绎步骤。像“对于所有”（∀）和“存在”（∃）这样的量词必须谨慎处理：命题“对于所有实数x，x² ≥ 0”为真，而“存在一个实数x使得x² < 0”为假。当你需要对一个含量词的命题进行否定时，请记住“对于所有”的否定是“存在”，反之亦然，这一技巧正是反证法的核心所在。
4. Direct Proof: Starting from What You Know | 直接证明法：从已知出发
usion. Consider proving that the sum of two even integers is even. Let the integers be 2m and 2n, where m and n are integers. Their sum is 2m + 2n = 2(m + n), which is clearly a multiple of 2, hence even. This style of proof is particularly suited to algebraic identities and properties of numbers, and it demands that each equal sign be accompanied by a reason, such as the distributive law or the definition of an even number.
直接证明法从假设一个条件命题的前提开始，通过一系列逻辑演绎，最终到达结论。试以证明两个偶数之和为偶数为例。令这两个整数分别为2m和2n，其中m和n为整数。它们的和为2m + 2n = 2(m + n)，这显然是2的倍数，因此为偶数。这种证明风格特别适合于代数恒等式和数的性质，它要求每个等号均伴随着理由，例如分配律或偶数的定义。
5. Proof by Contradiction: Assuming the Opposite | 反证法：假设反面
Proof by contradiction begins by negating the statement you wish to prove and then demonstrating that this negation leads to an impossibility—a contradiction with a known fact. The classic WJEC example is the proof that √2 is irrational. Assume, for contradiction, that √2 is rational, so √2 Squaring yields 2b² = a², implying a is even; write a = 2k, substitute to obtain 2b² = 4k² ⇒ s also even. This contradicts the assumption that a and b have no common factor, therefore √2 cannot be rational. The elegance of this method lies in reducing the impossible to the absurd.
反证法先否定你想证明的命题，然后论证这一否定会导致一个不可能的结论——即与已知事实相矛盾。WJEC中一个经典的例子是证明√2为无理数。假设√2是有理数（以待导出矛盾），即√2 = a/b，其中a和b为互素的整数。两边平方得2b² = a²，这意味着a为偶数；设a = 2k，代入得2b² = 4k² ⇒ b² = 2k²，故b也是偶数。这与a和b没有公因数的假设相矛盾，因此√2不可能是有理数。这种方法的精妙之处在于将不可能之事化为荒诞。
6. Proof by Contrapositive: Turning Statements Around | 逆否命题法：转换陈述
The contrapositive of the statement 'If P, then Q' is 'If not Q, then not P' t. Occasionally, proving the contrapositive is far simpler than tackling the original implication head-on. For instance, to prove 'If n² is even, then n is even' for an integer n, it is easier to prove its contrapositive: 'If n is odd, then n² is odd' 2k² + 2k) + 1, an odd number. This sweeping redirect can transform a stubborn problem into a straightforward algebraic verification.
命题“如果P，则Q”的逆否命题是“如果非Q，则非P”，这两者在逻辑上是等价的。有时候，证明逆否命题远比直接攻击原命题来得简单。例如，要证明“如果n²是偶数，则n是偶数”（n为整数），更简单的做法是证明其逆否命题：“如果n是奇数，则n²是奇数”。设n = 2k + 1，则n² = 4k² + 4k + 1 = 2(2k² + 2k) + 1，为一个奇数。这种巧妙的转向能将一个棘手的问题转变成直截了当的代数验证。
7. Proof by Mathematical Induction | 数学归纳法证明
ties, and inequalities. A valid induction proof has three clearly labelled components: the base case (usually n = 1), the inductive hypothesis (assume the statement true for n = k), and the inductive step (prove it for n = k + 1 using the hypothesis). The WJEC specification requires you to write a concluding sentence that invokes the principle of mathematical induction, explicitly stating that the proposition holds for all positive integers n.
归纳法是证明以自然数为索引的命题的首选技巧，例如求和公式、整除性质和不等式。一个规范的归纳证明拥有三个清晰标注的组成部分：基础情形（通常取n = 1）、归纳假设（假设命题对n = k成立）和归纳递推（运用该假设证明命题对n = k + 1成立）。WJEC考试大纲要求你书写一个引用数学归纳法原理的总结句，明确陈述该命题对所有正整数n均成立。
8. Disproof by Counterexample | 通过反例反驳
To disprove a universal statement, you need only produce a single counterexample—a specific case in which the statement fails. If someone claims 'All prime numbers are odd', you can instantly refute it by noting that 2 is prime and even. In an examination, a well-presented disproof simply states the counterexample, verifies that it satisfies the hypothesis but violates the conclusion, and then declares the original statement false. There is no need for lengthy discussion; one genuine counterexample is sufficient to bring down the whole conjecture.
要反驳一个全称命题，你只需给出一个反例——即一个使该命题不成立的特定情形。如果有人声称“所有质数都是奇数”，你可以立刻通过指出2是质数且为偶数来驳倒它。在考试中，一个漂亮的驳论只需陈述该反例，验证它满足前提却违背结论，然后宣布原命题为假。不必进行冗长的讨论；一个真实的反例就足以推翻整个猜想。
9. Crafting Coherent Arguments: Flow and Clarity | 构建连贯论证：流畅与清晰
Examiners reward proofs that read like a logical flow rather than a scattered list of symbols. To achieve this, connect your sentences with transitional phrases: 'From the induction hypothesis we deduce...', 'Applying the definition of an odd integer yields...', 'Hence, by the principle of mathematical induction...'. Whenever you introduce a new variable, define it explicitly. Do not assume that the reader will guess your intentions; a proof is a piece of communication, and clarity is paramount. A useful exercise is to read your proof aloud—any awkward jumps in logic will become immediately apparent.
阅卷官青睐读起来像逻辑流而不是杂乱符号列表的证明。要达到这个境界，需要用过渡性短语连接句子：“由归纳假设我们推得……”、“应用奇整数的定义可得……”、“因此，根据数学归纳法原理……”。每当你引入一个新变量，都要明确地定义它。不要假定读者会猜测你的意图；证明是一种交流，清晰至关重要。一个有益的练习是大声朗读你的证明——任何逻辑上的突兀跳跃都会立刻显现。
10. Common Pitfalls in Proof Writing | 证明书写中的常见误区
One frequent mistake is omitting the justification for algebraic steps, leaving the examiner to wonder whether you truly understand the underlying principle. Another is confusing the direction of an implication: writing 'If Q then P' when only 'If P then Q' has been established can invalidate an entire proof. In induction, students often forget to write the inductive hypothesis explicitly or fail to link it to the inductive step. Lastly, sloppy handling of division by a variable quantity can hide a division-by-zero error; always check that any denominator is non-zero before cancelling terms.
一个常见错误是省略代数步骤的理据，让阅卷官摸不清你是否真正理解了背后的原理。另一个错误是搞混蕴含的方向：明明只建立了“如果P则Q”，却写成“如果Q则P”，这可能使整个证明失效。在归纳法中，学生经常忘记明确写出归纳假设，或未能将其与归纳递推步骤联系起来。最后，草率处理除以变量的操作可能掩盖除数为零的错误；在约分之前，一定先要确认分母非零。
11. Model Essay 1: Proving the Irrationality of √2 | 范文一：证明根号2是无理数
Proposition: √2 is irrational.
Proof: We proceed by contradiction. Assume the contrary, that √2 is rational. Then there exist integers a and b, with b ≠ 0, such that √2 = a/b and the fraction a/b is in its lowest terms— uare of an odd integer is odd, a must be even. Write a = 2k for some integer k. Substituting into a² = 2b² yields (2k)² = 2b² ⇒ 4k² = 2b² ⇒ the assumption that a/b is in lowest terms. Therefore our initial assumption is false, and √2 is irrational. ∎
命题：√2是无理数。
证明：我们采用反证法。假设命题不成立，即√2是有理数。那么存在整数a和b，b ≠ 0，使得√2 = a/b，并且分数a/b为最简形式——即a和b除1外没有其他公因数。两边平方得2 = a²/b²，故a² = 2b²。这表明a²是一个偶数，而由于奇数的平方是奇数，a必须是偶数。设a = 2k，其中k为整数。代入a² = 2b²得(2k)² = 2b² ⇒ 4k² = 2b² ⇒ b² = 2k²。因此b²是偶数，从而b也为偶数。我们推出a和b都是偶数，这与a/b为最简形式相矛盾。因此我们的初始假设不成立，√2是无理数。 ∎
12. Model Essay 2: Induction Proof for the Sum of Squares | 范文二：平方和公式的归纳证明
Proposition: For all positive integers n, ∑ᵣ₌₁ⁿ r² = ⅙ n(n + 1)(2n + 1).
Proof: We use mathematical induction.
Base case: When n = 1, the left-hand side is ∑ᵣ₌₁¹ r² = 1² = 1. The right-hand side evaluates to ⅙ × 1 × 2 × 3 = 1. Hence the formula holds for n = 1.
Inductive hypothesis: Assume the formula is true for some arbitrary positive integer k, i.e., ∑ᵣ₌₁ᵏ r² = ⅙ k(k + 1)(2k + 1).
Inductive step: tion, ∑ᵣ₌₁ᵏ⁺¹ r² = ∑ᵣ₌₁ᵏ r² + (k + 1)². Substituting the inductive hypothesis, this equals ⅙ k(k + 1)(2k + 1) + (k + 1)². Factor out (k + 1): = (k + 1)[⅙ k(2k + 1) + (k + 1)] = (k + 1)[⅙(2k² + k) + ⅙(6k + 6)] = ⅙ k + 6). The quadratic factorises: 2k² + 7k + 6 = (k + 2)(2k + 3). Therefore the sum equals ⅙ ith n replaced by k + 1. Thus the formula holds for n = k + 1 whenever it holds for n = k.
Conclusion: By the principle of mathematical induction, the formula ∑ᵣ₌₁ⁿ r² = ⅙ n(n + 1)(2n + 1) is true for all positive integers n. ∎
命题：对于所有正整数n，∑ᵣ₌₁ⁿ r² = ⅙ n(n + 1)(2n + 1)。
证明：我们采用数学归纳法。
基础情形：当n = 1时，左边为∑ᵣ₌₁¹ r² = 1² = 1。右边计算得⅙ × 1 × 2 × 3 = 1。因此公式对n = 1成立。
归纳假设：假设公式对某个任意正整数k成立，即∑ᵣ₌₁ᵏ r² = ⅙ k(k + 1)(2k + 1)。
归纳递推：考虑n = k + 1时的和。由定义，∑ᵣ₌₁ᵏ⁺¹ r² = ∑ᵣ₌₁ᵏ r² + (k + 1)²。代入归纳假设，此式等于⅙ k(k + 1)(2k + 1) + (k + 1)²。提取公因式(k + 1)：= (k + 1)[⅙ k(2k + 1) + (k + 1)] = (k + 1)[⅙(2k² + k) + ⅙(6k + 6)] = ⅙(k + 1)(2k² + 7k + 6)。分解二次因式：2k² + 7k + 6 = (k + 2)(2k + 3)。因此总和等于⅙(k + 1)(k + 2)(2(k + 1) + 1)，这正是原公式中将n替换为k + 1的形式。于是，只要公式对n = k成立，它对n = k + 1也成立。
结论：由数学归纳法原理，公式∑ᵣ₌₁ⁿ r² = ⅙ n(n + 1)(2n + 1)对所有正整数n均成立。 ∎
Published by TutorHao | Further Mathematics Revision Series | aleveler.com
更多咨询请联系16621398022（同微信）
或截图后用「扫一扫 → 相册」选择本图