六至八年级Foundations计划中
Set-builder notation, quantifiers and infinite sets
Describing sets by properties, reading and writing 'for all' and 'there exists', negating quantified statements, and meeting the first infinite sets such as the natural numbers and the even numbers.
math.found.quantifiers
本主题的课程尚未编写。下面的提纲是课程地图的一部分，尚未经过审校。
前置知识
3 项必需的前置知识（一直追溯到底）
你将学会
- Read and write sets in set-builder notation, such as {n ∈ ℕ : n is even}.
- Translate between everyday sentences and statements using ∀ and ∃, and negate them correctly.
- Recognise ℕ, ℤ and the even numbers as infinite sets and explain why no finite list contains all natural numbers.
定义
- {x ∈ A : P(x)} is the set of those elements x of A for which P(x) is true.
- ∀x ∈ A, P(x) means P(x) holds for every x in A; ∃x ∈ A, P(x) means P(x) holds for at least one x in A.
- A set is finite if its elements can be listed as a₁, …, aₙ for some natural number n (n = 0 gives the empty set); otherwise it is infinite.
定理
- 'Not every x has P' is equivalent to 'some x does not have P', and 'no x has P' is equivalent to 'every x fails P'.
- The order of mixed quantifiers matters: in ℕ, ∀x ∃y (y > x) is true but ∃y ∀x (y > x) is false.
- ℕ is infinite: given any finite list of natural numbers, one more than the largest is not on the list.
常见误解
- Swapping the order of ∀ and ∃ and expecting the meaning to stay the same.
- Thinking a statement about all elements of the empty set must be false; it is vacuously true.
- Treating 'infinity' as a very large natural number.
通向
可选发现
- Countability and Cantor's diagonal argument Matching an infinite set one-to-one with ℕ, as with the even numbers, is the starting point of countability.
- First-order logic Quantifiers become part of a precise formal language with explicit rules of inference.