📚 Pre-U Cambridge Further Mathematics: Essential Vocabulary & Terminology Guide | Pre-U Cambridge 进阶数学：词汇术语速记指南
This guide is the expanded vocabulary and terminology companion for Pre-U Cambridge Further Mathematics. Terminology mastery is not a cosmetic skill: marks are awarded for precise notation, correct naming of theorems and clean logical connectives. The twelve sections below collect the highest-frequency terms from Further Pure Mathematics, Further Mechanics and Further Probability & Statistics, each paired with an English definition, a Chinese definition and a memory hook for timed conditions.
本指南是 Pre-U Cambridge 进阶数学的扩写版词汇与术语手册。掌握术语不是表面功夫：分数正是通过准确的记法、正确的定理命名和清晰的逻辑连接词给出的。以下十二个小节汇总了进阶纯数学、进阶力学和进阶概率统计中出现频率最高的术语，每个术语都配有英文定义、中文定义和限时条件下的记忆要点。
1. Core Symbols & Set Notation | 核心符号与集合记法
ℕ (Natural Numbers): The set {1, 2, 3, ...}, sometimes written as ℕ₀ when 0 is included. It is essential for indexing sequences and series.
ℕ（自然数）：集合 {1, 2, 3, ...}，包含 0 时有时写作 ℕ₀。在数列和级数的下标中必不可少。
ℤ (Integers): All whole numbers, positive, negative and zero. It appears in modular arithmetic, divisibility proofs and Diophantine equations.
ℤ（整数）：所有正整数、负整数和零。广泛用于模运算、整除证明和丢番图方程。
ℚ (Rational Numbers): Numbers that can be expressed as a fraction p/q with p, q ∈ ℤ and q ≠ 0. Recognizing a value as rational matters in exact-answer questions.
ℚ（有理数）：可以表示为 p/q 的数，其中 p, q ∈ ℤ，q ≠ 0。在要求精确值的题目中，识别有理数很关键。
ℝ (Real Numbers): All numbers on the continuous number line, including irrationals such as √2, π and e. Pre-U calculus and modelling rely on ℝ.
ℝ（实数）：数轴上所有连续的数，包括 √2、π、e 等无理数。Pre-U 的微积分和建模都依赖 ℝ。
ℂ (Complex Numbers): The superset of ℝ containing all numbers of the form a + bi, where i² = −1 and a, b ∈ ℝ. Every polynomial of degree n has exactly n roots in ℂ.
ℂ（复数）：ℝ 的超集，包含所有形如 a + bi 的数，其中 i² = −1 且 a, b ∈ ℝ。任意 n 次多项式在 ℂ 中恰有 n 个根。
∀ (For All) and ∃ (There Exists): Quantifiers. '∀ ε > 0' means 'for every positive epsilon'; '∃ δ > 0' means 'there exists a positive delta'. They are the standard vocabulary of limit arguments.
∀（任意）和 ∃（存在）：量词。'∀ ε > 0' 表示 '对任意正 ε'；'∃ δ > 0' 表示 '存在正 δ'。它们是极限论证的标准用语。
⇒ (Implies) and ⇔ (Equivalent): A ⇒ B means 'if A then B'; A ⇔ B means 'A if and only if B', so both directions hold. Confusing them is a common source of lost method marks.
⇒（推出）和 ⇔（等价）：A ⇒ B 表示 '若 A 则 B'；A ⇔ B 表示 'A 当且仅当 B'，两个方向都成立。混淆二者是常见的失分原因。
∈, ∉, ⊂, ∪, ∩, ∅: Read as 'is an element of', 'is not an element of', 'is a subset of', 'union', 'intersection' and 'empty set'. Use them to state domains and solution sets cleanly.
∈、∉、⊂、∪、∩、∅：分别读作 '属于'、'不属于'、'是子集'、'并集'、'交集' 和 '空集'。用它们可以干净地写出定义域与解集。
Memory hook: ℕ ⊂ ℤ ⊂ ℚ ⊂ ℝ ⊂ ℂ forms a nesting-doll chain, and in a limit definition the quantifier ε always appears before δ.
记忆要点：ℕ ⊂ ℤ ⊂ ℚ ⊂ ℝ ⊂ ℂ 构成一条套娃链；在极限定义中，量词 ε 总是出现在 δ 之前。
2. Logical Connectives & Proof Language | 逻辑连接词与证明用语
Converse: The converse of 'if A then B' is 'if B then A'. The converse is not automatically true, so it must be proved separately.
逆命题（Converse）：'若 A 则 B' 的逆命题是 '若 B 则 A'。逆命题不会自动成立，必须单独证明。
Contrapositive: The contrapositive of 'if A then B' is 'if not B then not A'. Unlike the converse, it is logically equivalent to the original statement.
逆否命题（Contrapositive）：'若 A 则 B' 的逆否命题是 '若非 B 则非 A'。与逆命题不同，它与原命题逻辑等价。
Necessary and sufficient: 'A is necessary for B' means B ⇒ A; 'A is sufficient for B' means A ⇒ B. Both together give A ⇔ B.
必要与充分（Necessary and sufficient）：'A 是 B 的必要条件' 指 B ⇒ A；'A 是 B 的充分条件' 指 A ⇒ B。二者同时成立即为 A ⇔ B。
Proof by contradiction: Assume the negation of the result, derive an impossibility such as 0 = 1 or √2 ∈ ℚ, and conclude the original statement must hold.
反证法（Proof by contradiction）：先假设结论的反面，推出如 0 = 1 或 √2 ∈ ℚ 之类的矛盾，从而断定原命题成立。
Proof by induction: , then prove it for n = k + 1. The closing line must state that the result holds for all n ∈ ℕ.
数学归纳法（Proof by induction）：先验证基础情形，再假设 n = k 时命题成立，进而证明 n = k + 1 时成立。结尾必须点明结论对所有 n ∈ ℕ 成立。
Counterexample and WLOG: A counterexample disproves a universal claim; 'without loss of generality' allows a symmetry argument that covers all remaining cases at once.
反例与不失一般性（Counterexample and WLOG）：反例可以推翻全称命题；'不失一般性' 允许用对称性论证一次覆盖其余所有情形。
3. Complex Numbers | 复数
Modulus |z|: The distance from the origin in the Argand diagram. For z = a + bi, |z| = √a² + b², and |z₁z₂| = |z₁||z₂|.
模（Modulus |z|）：阿尔冈图中到原点的距离。对 z = a + bi，|z|
更多咨询请联系16621398022（同微信）
或截图后用「扫一扫 → 相册」选择本图