A set collects distinct elements
A set is a collection whose membership is clearly defined. The set of prime numbers below ten is {2, 3, 5, 7}. Listing an element twice does not change the set, and order does not matter. Thus {1, 2, 2, 3} and {3, 2, 1} describe the same set. Write x ∈ A when x belongs to A and x ∉ A when it does not. The number of distinct elements in a finite set is its cardinality, written n(A) or |A|.
A universal set U defines the full collection under discussion, such as all forty students in a class. Every other set in that problem is considered within U. The empty set ∅ has no elements. Do not confuse ∅ with {0}, which contains one element, or {∅}, which contains the empty set as an element. A finite set has a limited number of elements; an infinite set, such as the positive integers, does not. Most classroom Venn-diagram counting problems use finite universal sets.
Use subsets and complements precisely
A ⊆ B means every element of A belongs to B. The sets may be equal. A proper subset is contained in B but is not equal to B; notation varies between texts, so read the convention stated. The empty set is a subset of every set. If a set has n elements, it has 2ⁿ subsets, including itself and ∅. For {a, b}, the four subsets are ∅, {a}, {b} and {a, b}. An element and a subset are different objects: a ∈ {a, b}, but {a} ⊆ {a, b}.
The complement A′ contains elements in U that are not in A. Complements depend on the universal set. If and, then A′ = {1, 3, 5}. Changing U changes the complement even if A is unchanged. For finite sets. In a Venn diagram, draw the universal set as a rectangle and keep the region outside the circles available for elements in none of the named sets.
Distinguish union, intersection and difference
The union A ∪ B contains elements in A, in B, or in both. The intersection A ∩ B contains only elements common to both. Difference A \ B contains elements in A but not in B, so A \ ∩ B′. With and, the union is {1, 2, 3, 4, 5}, the intersection is {3, 4}, and A \. Difference is not commutative: B \ A is {5}.
Disjoint sets have empty intersection. Sets need not be disjoint merely because they have different names. In survey questions, a student can study both French and Music, so adding the two subject totals would count that student twice. The correction is n(A ∪ ∩ B). This inclusion-exclusion rule is a statement about distinct elements, not an arbitrary formula. Explaining which region was counted twice helps you choose the right operation when the wording changes.
Solve a two-set survey from the overlap
Suppose a class contains 40 students, 24 study French, 18 study Music, and 8 study both. Place 8 in the overlap first. French only is 24 − 8 = 16; Music only is 18 − 8 = 10. The union is 16 + 8 + 10 = 34, so neither subject is studied by 40 − 34 = 6 students. Notice that “French” means the whole French circle, whereas “French only” excludes the overlap. Confusing these expressions is a common source of wrong totals.
If the overlap is unknown, find it from the union. Among 50 learners, 28 play football, 25 play volleyball and 7 play neither. The union contains 50 − 7 = 43, so the overlap is 28 + 25 − 43 = 10. A useful check is that an intersection cannot exceed either individual set and that every separate Venn region must be nonnegative. A result of −3 students or 30 common students when one group contains only 25 indicates inconsistent data or an error.
Extend the counting to three sets
For three sets, fill the central triple intersection first. Then subtract that central value from each stated pairwise intersection to obtain the pair-only regions. For example, if n(A ∩ B) = 9 and n(A ∩ B ∩ C) = 4, the A-and-B-only region is 5. Finally subtract all relevant overlap regions from each circle total to find its single-only region. A pairwise intersection normally includes the triple intersection unless the question explicitly says “only”. Make that distinction before writing any numbers.
The general union formula is n(A ∪ B ∪ ∩ B) − n(A ∩ C) − n(B ∩ C) + n(A ∩ B ∩ C). The triple region is added at the end because subtracting all three pairwise intersections removes it too many times. De Morgan's laws state (A ∪ ∩ B′ and (A ∩ ∪ B′. Translate them verbally: not in either means outside both; not in both allows membership of just one.
Self-check: in, let A = {1, 2, 4} and. Then A ∩ ∪ B = {1, 2, 3, 4}, A′ = {3, 5}, and A \. Explain why n(A) + n(B) = 5 does not the union has five elements. The common element 2 has been counted twice. In written work, label each region, include the universal total, and verify the sum of all disjoint regions before answering the requested category.
Check a complete three-set calculation
Suppose a universe has 40 elements with n(A) = 20, n(B) = 18, n(C) = 15, pairwise intersections 8, 7 and 6, and triple intersection 3. The pair-only regions are 5, 4 and 3. The A-only region is 20 − 5 − 4 − 3 = 8; B-only is 18 − 5 − 3 − 3 = 7; C-only is 15 − 4 − 3 − 3 = 5. Adding all seven inside regions gives 35, so five elements belong to none.
“Exactly two” means adding the three pair-only regions, giving 12 in this example. “At least two” also includes the triple region, giving 15. “At most one” includes the single-only regions and the outside region, giving 25. These phrases specify different disjoint pieces. Translate the words into regions before calculating, rather than selecting a formula based only on the numbers present.