SETS
SETS
SETS
INTRODUCTION
Examples:
A= { 2, 4, 6, 8, 10}
B= {circle, square, rectangle, triangle}
C= {a, e, i, o, u}
D= {1, 2, 3, 4, 5, 6, 7, 8, 9}
TWO WAYS OF NAMING SETS
1. Roster Method
This is done when the elements of the set are enumerated
and separated by a comma, it is also called tabulation method.
2. Rule Method
This method is used to describe the elements or members
of the set; it is also called the set builder notation. The symbol is
written as {x x is a …}
Examples:
1. {a, e, i, o, u}
2. {…-3, -2, -1, 1, 2, 3…}
3. {12, 14, 16, 18}
4. {1, 2, 3, 4, 5, 6, 7, 8, 9, 10,…}
5. {orange, banana, apple, watermelon}
EXERCISE
1. FINITE SET
It is a set whose elements are limited or countable, and the
last element can be identified.
2. INFINITE SET
The opposite of finite sets; it is a set whose elements are
unlimited or uncountable, and the last element cannot be
specified.
TYPES OF SETS
3. UNIT SET
A set with only one element. Also called a singleton.
Directions: Identify what type of set are referred to in the following items.
1. The set of first seven whole numbers.
2. The set of letters in the word empty.
3. The set of positive odd numbers.
4. The set of consonants in the English alphabet.
5. The set of whole numbers greater than 1 but less than 3.
6. The set of fractions in integers.
7. The set of parallel lines to the y-axis.
8. The set of circles through the origin (0, 0)
9. The set of even prime numbers.
10. The set of composite numbers less than 4.
MORE ON SETS
Universal Set
All sets under investigation in any application of set
theory are assumed to be contained in some large fixed set called
the universal set, denoted by the symbol U.
1. n(A)
2. n(B)
3. n(C)
4. n(D)
5. n(U)
SUBSET
Proper Subset
A is a proper subset of B, written as A⸦ B, if and only if,
every element of A is in B but there is at least one element of B
that is not in A. On the contrary, the symbol ⸦ denotes that it is
not a proper subset.
Example 1
Suppose A= {c, d, e}, B= {a, b, c, d, e}, and U= {a, b, c, d, e, f,
g}
Example 2
Suppose A= {c, d, e}, B= {a, b, c, d, e}, C= {e, a, c, b, d}, and
U= {a, b, c, d, e, f, g}
Example 3
Suppose A= {a, b, c, d, e}, B= {a, b, d, e, c}, and U= {a, b, c, d,
e, f, g}
EXERCISE
1. A=C 7. A ⸦ B
2. A=Ø 8. B ≠C
3. A⸦C 9. b ∈ A
4. a∈C 10. Ø ⊆ U
5. A⊆U 11. B ⸦ U
6. C⸦U 12. C ⊆ U
OPERATIONS ON SETS
1. UNION of SETS
The union of A and B, denoted A U B, is the set of all
elements in U such that x is in A or x is in B.
2. INTERSECTION of SETS
The intersection of A and B, denoted by A ∩ B, is the set
of all elements x in U such that x is in A and x is in B.
OPERATIONS ON SETS
3. COMPLEMENT of SETS
The complement of A, denoted by A´, is the set of all
elements x in U such that x is not in A.
4. DISJOINT SETS
Two sets are disjoint (or non-intersecting) if and only if,
they have no elements in common.
OPERATIONS ON SETS
1. A∩B 7. A U C´
2. D´ 8. D U C
3. A´ U D 9. B´
4. A∩U 10. (B ∩ D) U A
5. (C U B)´
6. (D ∩ Ø) U A
EXERCISE