📚 H - Sets and Venn Diagrams | H - 集合与维恩图
A set is a well-defined collection of distinct objects, called elements or members. In mathematics, sets are fundamental building blocks used to organise numbers, geometric objects, and abstract ideas. Understanding sets and their representation through Venn diagrams allows us to visualise relationships between different groups, solve logical problems, and apply counting principles in probability and statistics.
集合是一组明确定义的不同对象，这些对象称为元素或成员。在数学中，集合是组织数字、几何图形和抽象概念的基本构件。理解集合及其通过维恩图的表示方法，能够帮助我们将不同群组之间的关系可视化，解决逻辑问题，并在概率论与统计中应用计数原理。
1. Basic Concepts of Sets | 集合的基本概念
A set is denoted by a capital letter, e.g. A = {2, 4, 6, 8}. The symbol ∈ means 'is an element of', so 4 ∈ A, while 7 ∉ rately. Two sets are equal if they contain exactly the same elements, regardless of order.
集合用大写字母表示，例如 A = {2, 4, 6, 8}。符号 ∈ 表示“属于”，因此 4 ∈ A，而 7 ∉ A。元素的排列顺序无关紧要，重复的元素不单独列出。如果两个集合包含完全相同的元素，无论次序如何，它们就是相等的。
ply a count of distinct elements. Sets can be infinite, such as the set of natural numbers ℕ = {1, 2, 3, …}, but we will mainly work with finite sets when using Venn diagrams.
集合 A 的大小或基数记为 n(A)，即它所包含的不同元素的个数。对于有限集，这就是不同元素的计数。集合也可以是无限的，比如自然数集 ℕ = {1, 2, 3, …}，但在使用维恩图时我们主要处理有限集。
2. Ways to Describe Sets | 集合的表示方法
yellow}. The other is set-builder notation, which uses a rule to define membership: C = {x | x is an even integer and 0 < x < 10}, which results in {2, 4, 6, 8}.
描述集合的方式通常有两种。一种是列举法，即将元素列在大括号内：B = {红色, 蓝色, 黄色}。另一种是描述法，利用一个规则来定义成员：C = {x | x 是偶数且 0 < x < 10}，这样得到的集合为 {2, 4, 6, 8}。
In set-builder notation, the vertical bar '|' is read as 'such that'. The expression {x ∈ D | condition} restricts the elements to those in a given domain D satisfying the condition. This is extremely useful for defining sets of numbers, coordinates, or solutions of equations.
在描述法中，竖线“|”读作“使得”。表达式 {x ∈ D | 条件} 将元素限制在给定范围 D 内且满足该条件。这在定义数集、坐标点集或方程的解集时非常有用。
3. Special Sets: Empty Set, Universal Set and Complement | 特殊集合：空集、全集和补集
The empty set, denoted ∅ or {}, contains no elements. It is a subset of every set. The universal set, often called U, is the set of all elements under consideration in a given context. Any set we discuss is assumed to be contained in U.
空集，记为 ∅ 或 {}，不包含任何元素，是任何集合的子集。全集，常记作 U，是在给定情境下所考虑的所有元素构成的集合。我们讨论的任何集合都被认为是包含在全集中。
The complement of a set A, written A' or Aᶜ, is the set of all elements in U that are not in A: A' = {x ∈ U | x ∉ A}. For example, if U = {1,2,3,4,5} and A = {1,2}, then A' = {3,4,5}. The complement essentially flips membership with respect to the universal set.
集合 A 的补集，记作 A' 或 Aᶜ，是指全集中所有不属于 A 的元素构成的集合：A' = {x ∈ U | x ∉ A}。例如，若 U = {1,2,3,4,5} 且 A = {1,2}，则 A' = {3,4,5}。补集本质上就是相对于全集翻转元素的归属关系。
4. Subsets and Proper Subsets | 子集与真子集
Set A is a subset of set B, written A ⊆ B, if every element of A is also an element of B. By definition, ∅ ⊆ A and A ⊆ A for any set A. If we want to emphasise that A ⊆ B and A ≠ B, we say A is a proper subset of B, denoted A ⊂ B.
如果集合 A 的每一个元素都是集合 B 的元素，则称 A 是 B 的子集，记作 A ⊆ B。根据定义，对于任何集合 A，都有 ∅ ⊆ A 且 A ⊆ A。如果要强调 A ⊆ B 且 A ≠ B，则称 A 是 B 的真子集，记作 A ⊂ B。
For finite sets, the number of subsets of a set with n elements is 2ⁿ. This includes the empty set and the set itself. The set of all subsets is called the power set. These ideas become very important when we apply Venn diagrams to logic and probability.
对于有限集，含有 n 个元素的集合的子集个数为 2ⁿ，其中包括空集和该集合自身。所有子集构成的集合称为幂集。当我们将维恩图应用于逻辑和概率时，这些概念会变得非常重要。
5. Intersection and Union of Sets | 集合的交集与并集
The intersection of A and B, A ∩ B, is the set of elements that belong to both A and B: A ∩ B = {x | x ∈ A and x ∈ B}. The union of A and B, A ∪ B, is the set of elements that belong to A, to B, or to both: A ∪ B = {x | x ∈ A or x ∈ B}.
A 与 B 的交集，记作 A ∩ B，是由既属于 A 又属于 B 的元素构成的集合：A ∩ B = {x | x ∈ A 且 x ∈ B}。A 与 B 的并集，记作 A ∪ B，是由属于 A、属于 B 或者同时属于两者的所有元素构成的集合：A ∪ B = {x | x ∈ A 或 x ∈ B}。
If A ∩ B = ∅ alled disjoint, meaning they have no common elements. Disjoint sets are represented by non‑ ve and associative operations, which makes algebraic manipulation of sets straightforward.
如果 A ∩ B = ∅，这两个集合就称为不相交的，意味着它们没有公共元素。在维恩图中，不相交的集合用互不重叠的圆圈表示。并集和交集都满足交换律和结合律，这使得集合的代数运算变得十分简便。
6. Set Difference and Symmetric Difference | 集合的差集与对称差
The set difference A \ B (or A − B) contains elements that are in A but not in B: A \ B = {x | x ∈ A and x ∉ is sometimes called the relative complement of B with respect to A. Note that in general A \ B ≠ B \ A.
差集 A \ B（或写作 A − B）包含所有属于 A 但不属于 B 的元素：A \ B = {x | x ∈ A 且 x ∉ B}。这有时也被称作 B 关于 A 的相对补集。注意，一般地 A \ B ≠ B \ A。
etric difference A Δ B consists of elements that are in exactly one of A and B: A Δ B = (A \ B) ∪ (B \ A) = (A ∪ B) \ (A ∩ and corresponds to the shaded region of a Venn diagram where the intersection is removed.
对称差 A Δ B 由恰好只属于 A 和 B 中一个集合的元素构成：A Δ B = (A \ B) ∪ (B \ A) = (A ∪ B) \ (A ∩ B)。它是两个差集之并，对应维恩图中去掉了交集后剩下的区域。
7. Venn Diagram Fundamentals | 维恩图基础
A Venn diagram is a visual representation of sets using overlapping circles (or other shapes) inside a rectangle that stands for the universal set. Each circle corresponds to a set, and the overlapping parts represent intersections. The regions inside the circles but outside overlaps show set differences, while the area outside all circles shows the complement of the union.
维恩图是一种用重叠的圆形（或其他形状）在代表全集的方框内直观表示集合的方法。每个圆对应一个集合，重叠部分表示交集。圆内但不在重叠区域的各部分表示差集，而所有圆之外的部分则表示并集的补集。
For two sets A and B there are four distinct regions: only A, only B, both A and B (intersection), and neither A nor B (outside both circles). By shading appropriate regions, we can illustrate any set operation. This visual tool is extremely helpful for solving problems in logic, probability and data analysis.
对于两个集合 A 和 B，共有四个不同的区域：只在 A 中，只在 B 中，同时在 A 和 B 中（交集），以及既不在 A 也不在 B 中（两圆之外）。通过给相应的区域涂上阴影，我们可以表示任何集合运算。这种图像化工具在解决逻辑、概率和数据分析问题时非常有帮助。
8. Venn Diagrams for Set Operations | 维恩图与集合运算
To represent A ∪ B, shade all regions inside circle A or circle B (or both). For A ∩ B, shade only the overlapping region. The complement A' is the entire rectangle outside circle A. The difference A \ B is the part of circle A that does not overlap with B. The symmetric difference highlights the two crescent‑shaped regions where only one of the sets appears.
要表示 A ∪ B，将圆 A 或圆 B 内（或两者）的所有区域涂上阴影。表示 A ∩ B 时，仅涂上重叠区域。补集 A' 是方框中圆 A 之外的全部区域。差集 A \ B 则是圆 A 中没有与 B 重叠的部分。对称差则突出显示两个仅有单一集合出现的月牙形区域。
validate many set identities. For instance, by comparing shaded regions one can see that A ∪ (B ∩ C) = (A ∪ B) ∩ (A ∪ uick Venn diagram can save time and reduce errors when evaluating complex set expressions.
这些可视化方法可以验证许多集合恒等式。例如，通过比较阴影区域可以看出 A ∪ (B ∩ C) = (A ∪ B) ∩ (A ∪ C)，这说明分配律成立。养成快速画出维恩图的习惯，可以在计算复杂集合表达式时节省时间并减少错误。
9. De Morgan's Laws | 德摩根定律
De Morgan' first law states that the complement of a union is the intersection of the complements: (A ∪ B)' = A' ∩ B'. In words, 'not (A or B)' is the same as 'not A and not B'.
德摩根定律揭示了并集、交集与补集之间的重要关系。第一条定律指出，并集的补集等于补集的交集：(A ∪ B)' = A' ∩ B'。用语言表述就是，“非（A 或 B）”等同于“非 A 且非 B”。
cond law states that the complement of an intersection is the union of the complements: (A ∩ B)' = A' ∪ B'. This means 'not (A and B)' is equivalent to 'not A or not B' e or B'. Venn diagrams with three or more sets can also demonstrate these laws elegantly by shading and comparing regions.
第二条定律指出，交集的补集等于补集的并集：(A ∩ B)' = A' ∪ B'。这意味着“非（A 且 B）”等价于“非 A 或非 B”。带有三个或更多集合的维恩图也可以通过阴影对比来优雅地证明这些定律。
10. The Inclusion-Exclusion Principle | 包含排斥原理
ion to the cardinalities of the individual sets and their intersections. For two sets: n(A ∪ B) = n(A) + n(B) − n(A ∩ B). This formula corrects the double counting of the intersection.
包含排斥原理将并集的基数与各个集合及其交集的基数联系起来。对于两个集合：n(A ∪ B) = n(A) + n(B) − n(A ∩ B)。该公式修正了交集部分被重复计数的问题。
For three sets A, B and C, the formula is: n(A ∪ B ∪ C) = n(A) + n(B) + n(C) − n(A ∩ B) − n(A ∩ C) − n(B ∩ C) + n(A ∩ B ∩ C). The pattern alternates between adding and subtracting higher‑order intersections. This principle is widely used in probability and survey analysis.
对于三个集合 A、B 和 C，公式为：n(A ∪ B ∪ C) = n(A) + n(B) + n(C) − n(A ∩ B) − n(A ∩ C) − n(B ∩ C) + n(A ∩ B ∩ C)。其规律是交替加减更高阶的交集基数。该原理广泛应用于概率论和问卷调查分析。
11. Venn Diagrams for Three Sets | 三个集合的维恩图
A three‑set Venn diagram uses three overlapping circles, creating eight distinct regions: three for each set alone, three for pairwise intersections minus the central part, one central region for all three, and the outside representing the complement of the union. Labelling these regions with cardinalities helps solve counting problems systematically.
三个集合的维恩图使用三个相互重叠的圆，形成八个互不重叠的区域：三个只在单一集合中的区域，三个成对交集减去中心部分的区域，一个三者共有的中心区域，以及代表并集补集的最外部区域。在这些区域中标注基数有助于系统地解决计数问题。
When a situation involves three categories, such as students studying Mathematics, Physics and Chemistry, you can use a three‑circle Venn diagram. Place the given numbers in the correct regions, starting from the innermost intersection n(A ∩ B ∩ C) and working outwards. Unknowns can then be found by solving linear equations based on total counts and inclusive relationships.
当问题涉及三个类别时，例如学习数学、物理和化学的学生，你可以使用三圆维恩图。从最里面的交集 n(A ∩ B ∩ C) 开始，由内向外地将已知数字填入各个区域。然后，可以根据总数与包含关系建立线性方程，求出未知量。
12. Application Examples | 应用举例
8. The number in the union is 25 + 10 + 18 = 53, so those studying neither is 60 − 53 = 7.
假设一个班级有60名学生。35人学习数学（M），28人学习物理（P），10人两门都学，还有一些人两门都不学。画出包含集合 M 和 P 的维恩图。先在交集中填入10，接着算只学数学的：35 − 10 = 25，只学物理的：28 − 10 = 18。并集中的人数为 25 + 10 + 18 = 53，因此两门都不学的人数为 60 − 53 = 7。
l club survey: 40 like football (F), 35 like basketball (B), 30 like tennis (T). Given n(F ∩ B) = 12, n(F ∩ T) = 10, n(B ∩ triple intersection with 5, then adjust the pairwise overlaps, and finally determine only‑one‑sport numbers. The inclusion‑exclusion formula can also be used directly to check the total union.
以三个集合为例，假设对学校社团的调查：40人喜欢足球（F），35人喜欢篮球（B），30人喜欢网球（T）。已知 n(F ∩ B) = 12，n(F ∩ T) = 10，n(B ∩ T) = 8，且有5人三项都喜欢。若共有80名学生，15人完全不喜欢这三项，求恰好只喜欢一项的人数。先在三个集合的交集处填入5，然后调整两两交集，最后确定只喜欢一项的人数。也可以直接利用包含排斥原理验证并集的总人数。
Published by TutorHao | IB Mathematics Revision Series | aleveler.com
更多咨询请联系16621398022（同微信）
或截图后用「扫一扫 → 相册」选择本图