Sets · Lesson 6 of 6
Chapter Summary and Practice
“Connect the whole chapter through precise notation, mixed worked reasoning, proofs, and counterexamples.”
• Connect set descriptions, membership, classification, containment, and operations. • Use definitions to justify identities and equivalent subset conditions. • Distinguish a valid proof from checking examples or assuming cancellation. • Construct counterexamples to false statements and sets meeting combined requirements. • Review the whole chapter through its coverage table and varied quizzes.
Connecting the chapter
Sets begin with a simple question: which objects belong? Every later concept refines that question. A representation describes the membership rule; containment compares two rules; an operation creates a new rule from existing ones. Revising through those connections makes the notation easier to recall and the reasoning easier to check.
Before calculating, identify the kind of object being collected and any domain restriction. Then decide which relationship the question asks about. A membership question concerns one whole object, a subset question concerns every member of a set, and an equality question requires the same members in both directions. Many mistakes arise from applying a correct test to the wrong kind of question.
| Chapter concept | Meaning or main rule | Typical check or mistake |
|---|---|---|
| Well-defined set | A definite rule decides membership. | Subjective ranking needs a stated criterion. |
| Membership | x ∈ A or x ∉ A tests one whole object. | Nested braces change the object being tested. |
| Representations | Roster lists members; set-builder states their rule. | Retain domain, bounds, and the intended pattern. |
| Empty set | ∅ has no elements. | ∅, {0}, and {∅} are different. |
| Finite and infinite sets | Finite includes empty; count distinct elements. | A large or unknown finite count is not infinite. |
| Equality | Exactly the same members in both sets. | Order, repetition, and equal counts do not establish a difference or equality. |
| Subset and proper subset | Every A-member is a B-member; proper also means A ≠ B. | Here ⊂ allows equality; do not confuse it with ∈. |
| Number sets | N ⊂ Z ⊂ Q ⊂ R; T is the irrational part of R. | Integers are rational; 1 is not prime. |
| Intervals | Real-number sets described by endpoint inequalities. | Brackets include, parentheses exclude; length is b − a. |
| Universal set | U contains every set in the discussion. | It is context-dependent and may contain extra members. |
| Venn diagrams | Curves and shaded regions encode membership. | Circle size is not an automatic count of elements. |
| Union | A ∪ B: in either set or both. | Do not omit or duplicate shared members. |
| Intersection and disjointness | A ∩ B: in both; disjoint means intersection ∅. | Unequal sets can overlap. |
| Difference | A − B: in A but not B. | Order matters; no outsider enters A − B. |
| Operation properties | Commutativity, associativity, idempotence, and empty/universal laws. | Associativity of one operation does not justify arbitrary mixed regrouping. |
| Distributivity | A ∩ (B ∪ C) = (A ∩ B) ∪ (A ∩ C). | Check membership on both sides. |
| Complement | A′ = U − A. | State U and keep it fixed. |
| Complement laws | A ∪ A′ = U; A ∩ A′ = ∅; (A′)′ = A. | Outside U never becomes part of a complement. |
| De Morgan laws | (A ∪ B)′ = A′ ∩ B′; (A ∩ B)′ = A′ ∪ B′. | The operation switches when negated. |
| Proof and counterexample | A proof covers every allowed case; one counterexample disproves a universal claim. | Checking several lists does not establish a general identity. |
The miscellaneous worked examples
The closing examples revisit representation, subset lists, and equality through operations. Their value is in the reasoning, rather than in introducing a new procedure. Use them to practise choosing the definition that fits the question.
Problem
Show that the sets of letters needed to spell CATARACT and TRACT are equal.
- 1.CATARACT uses the distinct letters C, A, T, and R. Repeated occurrences do not add members, so X = {C, A, T, R}.
- 2.TRACT uses T, R, A, C, and a repeated T, so Y = {T, R, A, C}.
- 3.Every member of X belongs to Y, and every member of Y belongs to X.
- 4.Therefore X = Y. The words have different lengths, but the sets record only which letters occur.
Problem
List every subset of {−1, 0, 1}.
- 1.Group by size. With no elements: ∅.
- 2.With one element: {−1}, {0}, and {1}.
- 3.With two elements: {−1, 0}, {−1, 1}, and {0, 1}.
- 4.With three elements: {−1, 0, 1}.
- 5.There are eight subsets in this complete list. Each uses only allowed members; the grouping includes every way to choose them.
- 6.The negative member is still one object. Its sign does not change the subset-listing process.
Problem
Prove that A ∪ B = A ∩ B implies A = B.
- 1.We assume the equality of the two operations and must establish equality of A and B.
- 2.Let x be any member of A. Then x ∈ A ∪ B. By the assumed equality, x ∈ A ∩ B, which forces x ∈ B.
- 3.Thus every member of A is in B, so A ⊂ B.
- 4.Now let y be any member of B. Then y ∈ A ∪ B = A ∩ B, so y ∈ A. Hence B ⊂ A.
- 5.The two containments give A = B. No particular lists were chosen; the argument applies to arbitrary sets, including empty sets.
A method for proofs and counterexamples
A universal statement claims something about every allowed set or element. To prove it, begin with an arbitrary member and follow the definitions, or use previously established identities with justified steps. To disprove it, construct one allowed situation where the conclusion fails while the assumptions hold.
“Arbitrary” means the argument does not rely on a special choice such as x = 2. An element proof of P ⊂ Q starts with any x ∈ P and establishes x ∈ Q. An equality proof usually establishes both containments. A counterexample has the opposite job: one carefully chosen case is enough, but it must satisfy every assumption in the claim.
Problem
Is the statement “If x ∈ A and A ∈ B, then x ∈ B” always true?
- 1.Choose x = 1, A = {1}, and B = {{1}}.
- 2.The assumption x ∈ A is true, and A ∈ B is also true: B has the set {1} as its only member.
- 3.But 1 ∉ B, because its only member is {1}, not the number 1.
- 4.The assumptions hold and the conclusion fails, so the universal claim is false.
A related invalid claim is “If A ⊂ B and B ∈ C, then A ∈ C”. Take A = {1}, B = {1, 2}, and C = {{1, 2}}. A is contained in B and B is a member of C, but A is not the member listed in C. The error again swaps containment for membership.
Problem
Prove: if A ⊂ B and B ⊂ C, then A ⊂ C.
- 1.Take any x ∈ A.
- 2.Since A ⊂ B, we have x ∈ B.
- 3.Since B ⊂ C, we then have x ∈ C.
- 4.Every member of A therefore belongs to C, proving A ⊂ C. Both links use the same every-element relationship.
The analogous chain of failed containments does not work. For example, A = {1}, B = {2}, and C = {1} give A ⊄ B and B ⊄ C, yet A ⊂ C. Likewise, x ∈ A and A ⊄ B do not force x ∈ B: x = 1, A = {1}, and B = {2} violate that conclusion. A failed containment tells us that some A-member is absent from B, not that every A-member has one particular membership status.
Problem
Prove: if A ⊂ B and x ∉ B, then x ∉ A.
- 1.Suppose for a moment that x ∈ A.
- 2.The containment would imply x ∈ B, contradicting the given x ∉ B.
- 3.So x cannot belong to A. This argument uses the subset rule by ruling out the alternative.
- 4.The condition A ⊂ B is essential. Without it, a point outside B could still be in A.
Equivalent ways to express containment
The same relationship can often be recognised through different operations. Equivalent conditions mean that each condition gives exactly the same information, so any one can be used in place of the others. Proving equivalence requires directions of implication, not just numerical examples.
If A ⊂ B, no member of A lies outside B, so A − B = ∅. Conversely, if the difference is empty, there is no A-member missing from B, so A ⊂ B. This proves the first equivalence by translating the definition of difference.
If A ⊂ B, union adds no member outside B, giving A ∪ B = B. Conversely, if the union equals B, every member of A lies in the union and hence in B. For intersection, containment makes every A-member survive the both test, giving A ∩ B = A. Conversely, if the intersection is A, every A-member is in that intersection and therefore in B. These arguments establish all four conditions as equivalent.
Problem
Prove: if A ⊂ B, then C − B ⊂ C − A.
- 1.Let x ∈ C − B. Then x ∈ C and x ∉ B.
- 2.Because A ⊂ B, an element outside B cannot belong to A. Hence x ∉ A.
- 3.Therefore x ∈ C − A.
- 4.Every member of C − B passes the test for C − A, proving the containment. Removing the larger collection B can only leave the same or fewer members.
Identities from splitting and absorbing regions
A Venn region can be split into cases without changing its members. Some combinations then simplify because one part already contains everything contributed by the other. These ideas explain useful identities appearing in mixed reasoning.
Any member of A is either in B or not in B. In the first case it is in A ∩ B; in the second it is in A − B. Thus A is contained in the union on the right. Conversely, both parts consist only of members of A, so their union is contained in A. Equality follows. The two parts do not overlap, because one requires membership in B and the other forbids it.
The members of B that are already in A contribute nothing new to a union with A. Keeping just B − A therefore produces the same result. Formally, a member of A ∪ B is either already in A, or is in B outside A and hence in B − A. Conversely, A and B − A are both contained in A ∪ B.
For the first identity, A ∩ B is contained in A, so union with it cannot add any member. For the second, A is contained in A ∪ B, so intersection with that larger collection retains all of A and nothing beyond it. Both arguments use the equivalent containment conditions established above.
Problem
Derive A ∩ (A ∪ B) = A using distributivity.
- 1.Intersection distributes over union, so A ∩ (A ∪ B) = (A ∩ A) ∪ (A ∩ B).
- 2.Idempotence gives A ∩ A = A, so this becomes A ∪ (A ∩ B).
- 3.Since A ∩ B ⊂ A, the union is A.
- 4.Each transformation has a reason. The diagram interpretation and the symbolic derivation agree.
When cancellation fails and when equality follows
Set operations do not automatically behave like adding or multiplying ordinary numbers. In particular, a common intersection can hide differences outside that intersection. To infer equality, the assumptions must capture all relevant members rather than just one region.
Problem
Show that A ∩ B = A ∩ C does not always imply B = C.
- 1.Choose A = {1}, B = {1, 2}, and C = {1, 3}.
- 2.Both intersections with A equal {1}.
- 3.However, 2 ∈ B and 2 ∉ C, so B ≠ C.
- 4.The intersection with A cannot see members lying outside A. Cancelling A from the two intersections is therefore invalid.
Problem
Prove: if A ∪ B = A ∪ C and A ∩ B = A ∩ C, then B = C.
- 1.Take any x ∈ B and separate the cases x ∈ A and x ∉ A.
- 2.If x ∈ A, then x ∈ A ∩ B = A ∩ C, giving x ∈ C.
- 3.If x ∉ A, then x ∈ A ∪ B = A ∪ C. Since it is not in A, it must be in C.
- 4.Thus B ⊂ C. Repeat the same two-case reasoning starting with any y ∈ C to get C ⊂ B.
- 5.Both containments give B = C. The intersection controls the part inside A; the union controls the part outside A.
Problem
Suppose A ∩ X = ∅, B ∩ X = ∅, and A ∪ X = B ∪ X. Prove A = B.
- 1.Let x ∈ A. The union equality puts x in B ∪ X.
- 2.Because A ∩ X = ∅, this x cannot belong to X. It must therefore belong to B.
- 3.This proves A ⊂ B. Starting with a member of B and using B ∩ X = ∅ similarly proves B ⊂ A.
- 4.Thus A = B. The disjointness assumptions prevent X from hiding a difference.
- 5.A properties-based route is A = A ∩ (A ∪ X) = A ∩ (B ∪ X) = (A ∩ B) ∪ (A ∩ X) = A ∩ B. Similarly B = A ∩ B, so A = B.
Constructing sets with prescribed intersections
Sometimes a question gives a pattern of relationships and asks you to create sets meeting it. Start by deciding which members should belong to each overlap, then check every requirement. Pairwise overlap does not necessarily force a member common to all sets.
Problem
Find A, B, and C with nonempty pairwise intersections but A ∩ B ∩ C = ∅.
- 1.Use three objects, assigning each to exactly two sets: A = {1, 2}, B = {2, 3}, and C = {1, 3}.
- 2.A ∩ B = {2}, B ∩ C = {3}, and A ∩ C = {1}. Each pair has a member.
- 3.However, 1 is absent from B, 2 is absent from C, and 3 is absent from A.
- 4.No object belongs to all three, so A ∩ B ∩ C = ∅.
- 5.The pairwise common members can be different objects. That is why the pairwise condition does not force a triple overlap.
These worked arguments cover the reasoning patterns at the miscellaneous exercise boundary: comparing equation-defined sets, nested membership, transitive containment, equivalent conditions, reversed differences, region identities, absorption, failed cancellation, and constructing overlaps. The separate solved-exercises area will contain the exercise-by-exercise solutions; this lesson supplies the connected reasoning needed to understand them.
A brief historical perspective
Set language is now used throughout mathematics, but its foundations developed through difficult questions about infinite collections. The source’s historical note places the elementary ideas in that wider story. You do not need advanced set theory to use the definitions and proofs in this chapter.
Georg Cantor developed modern set theory while studying trigonometric series. His work during the late nineteenth century explored infinite collections and showed that real numbers cannot be placed in a one-to-one correspondence with the integers. This helps explain why R cannot be exhausted by an ordinary infinite roster like the integers. Different infinite collections require more care than simply saying that both never end.
Richard Dedekind supported Cantor’s work, while Leopold Kronecker criticised aspects of his treatment of infinity. Gottlob Frege connected foundations with logic. Bertrand Russell then exposed a contradiction in unrestricted assumptions about collections, prompting mathematicians to specify carefully which constructions of sets are allowed. A context-specific universal set in this chapter should therefore not be confused with a set containing everything whatsoever.
Ernst Zermelo proposed an axiomatic foundation in 1908, followed by developments associated with Abraham Fraenkel, John von Neumann, Paul Bernays, and Kurt Gödel. Axioms are explicit foundational rules. Their technical details lie beyond this chapter, but the lesson for our work is relevant: definitions and assumptions matter, especially when a statement claims to hold for every set.
Whole-chapter understanding check
Use these questions to connect concepts rather than repeat a single operation. Some ask for a counterexample or an implication, so checking one convenient list may be insufficient. Read the assumptions closely and use the explanations to identify the precise rule being tested.
Quiz
Which rule describes exactly the positive divisors of 6?
The positive divisors are {1, 2, 3, 6}. “6 divides x” describes multiples instead.
For S = {∅, 0}, which pair of statements is true?
S has two whole members: ∅ and 0. The singleton {0} is not a listed member.
Which statement is equivalent to A ⊂ B?
No A-member is outside B exactly when A is contained in B. The other three conditions instead express B ⊂ A.
Which set identity always holds?
Every A-member is either in B or outside B, so the two parts reconstruct A.
If A ∩ B = A ∩ C, must B = C?
Intersection with A hides members outside A. For A = {1}, B = {1, 2}, C = {1, 3}, the intersections agree while B and C differ.
If A ∪ B = A ∩ B, what follows?
Every member of either set must be common to both, giving containment in both directions. Nonempty equal sets also satisfy the assumption.
For U = {1, 2, 3, 4}, A = {1, 2}, B = {2, 3}, what is (A ∩ B)′?
The intersection is {2}. Its complement within U is {1, 3, 4}.
Which interval contains 0 but excludes both −1 and 1?
The open interval includes all real numbers strictly between −1 and 1, including 0, but neither endpoint.
A = {1, 2}, B = {2, 3}, C = {1, 3}. Which is true?
The pairwise intersections are {2}, {3}, and {1}. No member lies in all three sets.
What can establish a general set identity?
A general proof must cover every allowed case. Examples can illustrate or detect a failure but cannot establish universality by themselves.
Key Takeaways
• Start with the domain and a precise membership rule before choosing a method. • Equality requires the same members; mutual containment is a reliable proof method. • Keep the distinction between an object, a singleton containing it, and a subset. • Use interval endpoints and a stated universe consistently. • Union, intersection, difference, and complement are distinct membership conditions. • Containment has equivalent union, intersection, and difference descriptions. • Do not cancel a common intersection without sufficient assumptions. • General claims require proofs; one valid counterexample disproves a universal claim. • Pairwise intersections can be nonempty even when the triple intersection is empty.
Previous · Lesson 5
Complements and Their Properties
Next
End of chapter