2 Introduction To Set Theory
2 Introduction To Set Theory
2 Introduction To Set Theory
Elements of a Set: The objects contained by a set are called the elements of the set.
If A = {1,2,3}, then 1,2,3 are elements of the set.
We can say “1 belongs to set A” represented as 1 ∈ A
Cardinality of a set: The cardinality of a set is the total number of unique elements in a set.
Example:
A = {1,6,7,8,9}
The cardinality of a set is: n(A) or |A| = 5
Examples of set:
1. Let X = {apple,tomato, orange}. Here, orange ∈ X, but potato ∉ X.
2. X = {2n : n is an integer}
3. The empty set, denoted ∅, is the set that has no element.
4. N := {1, 2, . . .}, the set of Natural numbers;
5. W := {0, 1, 2, . . .}, the set of whole numbers
6. Z := {0, 1, −1, 2, −2, . . .}, the set of Integers;
𝑝
7. Q := { 𝑞 : p, q ∈ Z, q ≠ 0}, the set of Rational numbers;
8. R := the set of Real numbers; and
9. C := the set of Complex numbers.
Example: “A set which contains all odd numbers less than 10”. Express this statement in Roaster
Form and Set Builder Form.
Empty set / Null Set / Void Set: The set which has no elements is said to be an empty set;
represented as { } or ϕ.
Ex- A = {x : x is a student presently studying in semester 3 and 5}
Singleton set: The set containing only one element is a singleton set.
Ex-
P = {x | x is even prime number}
P = {x | x is natural numbers less than 2}
Proper Subset: If a subset has fewer elements than the original set then it is called the proper
subset. For example, in set A = {1, 2} and B = {1, 2, 3}, the subset A doesn’t contain all the
elements of the original set B, hence A ⊂ B.
Superset: A set A is a superset of another set B if all elements of the set B are elements of the set
A. The superset relationship is denoted as A⊃B.
Equal Set: If two sets have the same elements, they are
equal.
Here all the elements of A and B are the same, or we can
say that A is the subset of B and B is a subset of A, So
A=B.
Power Set: Let X be a set. Then, the set that contains all subsets of X is called the power set of X
|𝑥|
and is denoted by P(X) or 2 .
|𝑥|
Cardinality of Power Set |P(A)| = 2 , where |x| means no. of elements in set X.
Let X = {x, y, z}. Then P(X) = {∅, {x}, {y}, {z}, {x, y}, {x, z}, {y, z}, {x, y, z}}.
Universal Set: Any set that contains all the sets under
discussion is referred to as a universal set.
U = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10}
i) Union of Sets ( ∪ )
The union of two sets A and B is the set C which consists of all those
elements which are either in A or in B (including those which are in
both). In symbols, we write A ∪ B = { x : x ∈A or x ∈B }
Note: Disjoint Sets: If A and B are two sets such that A ∩ B = ϕ, then
A and B are called disjoint sets.
------------------------------------------------------------------------------------------------
------------------------------------------------------------------------------------------------