Chapter overview
Set theory is the language of collections. It is used later in relations, functions, probability, domains, ranges, and logical classification.
1. Basic idea of a set
A set is a well-defined collection of objects.
Examples:
- A={1,2,3,4,5}
- B={a,e,i,o,u}
- N={1,2,3,…}
- Z={…,−2,−1,0,1,2,…}
If a belongs to set A:
a∈A
If a does not belong to set A:
a∈/A
2. Important number sets
| Symbol | Name | Meaning |
|---|
| N | Natural numbers | {1,2,3,…} |
| W | Whole numbers | {0,1,2,3,…} |
| Z | Integers | {…,−2,−1,0,1,2,…} |
| Q | Rational numbers | {qp:p,q∈Z, q=0} |
| R | Real numbers | Rational and irrational numbers |
Inclusion relation:
N⊂W⊂Z⊂Q⊂R
3. Representation of sets
Roster form
Elements are listed inside braces.
A={2,4,6,8,10}
Set-builder form
A rule is used to describe the elements.
A={x:x is an even natural number and x≤10}
Equivalent form:
{2,4,6,8,10}={x:x=2n, n∈N, 1≤n≤5}
4. Types of sets
| Type | Meaning | Example |
|---|
| Empty set | No element | ∅={} |
| Singleton set | One element | {0} |
| Finite set | Limited elements | {1,2,3} |
| Infinite set | Unlimited elements | N={1,2,3,…} |
| Equal sets | Same elements | {1,2,3}={3,2,1} |
| Equivalent sets | Same number of elements | {a,b,c} and {1,2,3} |
Cardinality:
n(A)=number of elements in A
Example:
A={2,4,6,8}⇒n(A)=4
5. Subset and proper subset
If every element of A is also an element of B, then:
A⊆B
Meaning:
A⊆B⟺(x∈A⇒x∈B)
Proper subset:
A⊂B
This means:
A⊆BandA=B
Important facts:
∅⊆A
A⊆A
A⊆U
6. Power set
The power set of A is the set of all subsets of A. It is denoted by P(A).
If:
A={a,b}
then:
P(A)={∅,{a},{b},{a,b}}
If n(A)=m, then:
n(P(A))=2m
Example:
n(A)=3⇒n(P(A))=23=8
7. Universal set and complement
The universal set U contains all objects under discussion.
Complement of A:
A′={x:x∈U, x∈/A}
Also:
Ac=U−A
Important:
A∪A′=U
A∩A′=∅
(A′)′=A
8. Set operations
Union
A∪B={x:x∈A or x∈B}
Example:
{1,2,3}∪{3,4,5}={1,2,3,4,5}
Intersection
A∩B={x:x∈A and x∈B}
Example:
{1,2,3}∩{3,4,5}={3}
Difference
A−B={x:x∈A, x∈/B}
Example:
{1,2,3,4}−{3,4,5}={1,2}
Symmetric difference
A△B=(A−B)∪(B−A)
Also:
A△B=(A∪B)−(A∩B)
9. Venn diagram logic
| Region | Meaning |
|---|
| Only A | A−B |
| Only B | B−A |
| Common | A∩B |
| Total in both | A∪B |
| Outside A | A′ |
10. Cardinality formulae
For two finite sets:
n(A∪B)=n(A)+n(B)−n(A∩B)
If A and B are disjoint:
A∩B=∅
then:
n(A∪B)=n(A)+n(B)
For three finite sets:
n(A∪B∪C)=n(A)+n(B)+n(C)−n(A∩B)−n(B∩C)−n(C∩A)+n(A∩B∩C)
Complement:
n(A′)=n(U)−n(A)
Difference:
n(A−B)=n(A)−n(A∩B)
11. Laws of algebra of sets
| Law | Formula |
|---|
| Idempotent | A∪A=A,A∩A=A |
| Identity | A∪∅=A,A∩U=A |
| Domination | A∪U=U,A∩∅=∅ |
| Complement | A∪A′=U,A∩A′=∅ |
| Commutative | A∪B=B∪A,A∩B=B∩A |
| Associative | (A∪B)∪C=A∪(B∪C) |
| Associative | (A∩B)∩C=A∩(B∩C) |
| Distributive | A∪(B∩C)=(A∪B)∩(A∪C) |
| Distributive | A∩(B∪C)=(A∩B)∪(A∩C) |
| Double complement | (A′)′=A |
12. De Morgan's laws
(A∪B)′=A′∩B′
(A∩B)′=A′∪B′
For three sets:
(A∪B∪C)′=A′∩B′∩C′
(A∩B∩C)′=A′∪B′∪C′
13. Intervals as subsets of real numbers
Open interval:
(a,b)={x:x∈R, a<x<b}
Closed interval:
[a,b]={x:x∈R, a≤x≤b}
Left-closed, right-open:
[a,b)={x:x∈R, a≤x<b}
Left-open, right-closed:
(a,b]={x:x∈R, a<x≤b}
Infinite intervals:
(a,∞)={x:x>a}
(−∞,b]={x:x≤b}
14. Cartesian product
A×B={(a,b):a∈A, b∈B}
Example:
A={1,2},B={x,y}
Then:
A×B={(1,x),(1,y),(2,x),(2,y)}
Number of ordered pairs:
n(A×B)=n(A)⋅n(B)
Usually:
A×B=B×A
15. Solved examples
Example 1
If:
A={1,2,3,4,5},B={4,5,6,7}
then:
A∪B={1,2,3,4,5,6,7}
A∩B={4,5}
A−B={1,2,3}
Example 2
In a group:
n(A)=40,n(B)=30,n(A∩B)=10
Therefore:
n(A∪B)=40+30−10=60
Example 3
If:
U={1,2,3,4,5,6,7,8,9,10}
and:
A={2,4,6,8,10}
then:
A′={1,3,5,7,9}
16. Common mistakes
- Writing repeated elements: {1,1,2} should be {1,2}.
- Thinking order matters: {1,2,3}={3,2,1}.
- Confusing ∈ and ⊆.
- Forgetting to subtract n(A∩B) in the union formula.
- Writing A−B=B−A. In general, this is false.
- Confusing interval notation (a,b) with ordered pair notation (a,b).
- Forgetting that ∅ is a subset of every set.
17. Quick revision table
| Concept | Formula / fact |
|---|
| Membership | a∈A |
| Not a member | a∈/A |
| Subset | A⊆B |
| Power set size | n(P(A))=2n(A) |
| Union | A∪B |
| Intersection | A∩B |
| Difference | A−B |
| Complement | A′=U−A |
| Two-set union | n(A∪B)=n(A)+n(B)−n(A∩B) |
| De Morgan 1 | (A∪B)′=A′∩B′ |
| De Morgan 2 | (A∩B)′=A′∪B′ |
| Cartesian product | A×B={(a,b):a∈A,b∈B} |