SETS

INTRODUCTION

Set theory is the branch of mathematics that

studies sets or the mathematical science of the
infinite.

Introduced by Georg Cantor (1845-1918), a German

mathematician.

We use capital letters to denote a set.

We use braces {} in constructing sets.
 SETS

A set is a well-defined collection of objects; the objects

are called the elements or members of the set; denoted
by ∈ .

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.

1. Set of odd numbers less than 10.

2. Set of integers greater than -5 but less than 0.
3. Set of prime numbers less than 20
4. Set of whole numbers.
5. Set of composite numbers.
 TWO WAYS OF NAMING SETS

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

Directions: List the elements in the following sets.

1. A= {y y is an integer, -1 ≤ y <4}
2. C= {h h is a positive integer, h ≤ 5}
3. E= {x x is a letter in the word basket}
4. G= {s s is an integer such that s2 = 9}
5. K= {m m is a continent of the world}
 EXERCISE

Directions: Write the following sets in ROSTER METHOD.

1. B= {x x is a letter in the word heart}
2. C= {x x is an integer, 1< x <10}
3. D= {x x + 2 =5}
4. E is the set of months with 31 days
5. G is the set of letters from a to e
 EXERCISE

Directions: Write the following sets in RULE METHOD.

1. A= {2, 4, 6,…}
2. E= {1/2, 1/3, ¾, 2/5, 2/3}
3. J= {Cavite, Laguna, Batangas, Cebu, Bohol, Davao}
4. G= {DepEd, CHED, TESDA, DSWD, DOH}
5. H= {Monday, Tuesday, Wednesday, Thursday, Friday,
Saturday, Sunday}
 TYPES OF SETS

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.

4. EMPTY SET (Null Set)

A unique set with no elements which can be denoted by {}
or Ø.
 EXERCISE

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.

Cardinal Number/Cardinality of a Set

It is the number of elements or members in the set; it is
denoted by n(A).
 EXERCISE

If U= {a, b, c, d, e, f, g, h, i, j, k}; A= {a, b, c, e, f}; B= {b, c, d,

e}; C= {f, g, h}; and D= {a, e, g, i}. Determine the cardinality or
cardinal numbers of the following:

1. n(A)
2. n(B)
3. n(C)
4. n(D)
5. n(U)
 SUBSET

If A and B are sets, A is called a subset of B, written A ⊆ B, if

and only if, every element of A is also an element of B.
 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.

A equals B, denoted by (A=B) if and only if, every element of A

is in B and every element of B is in A.
 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

Let U= {a, b, c, d, e, f, g}; A= {a, b, c, d, e}; B= {a, b, c}; and

C= {b, c, f}, identify which of the following are True and which
are False.

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

5. CARTESIAN PRODUCT OF SETS

In order to get the cartesian product of sets A and B,
written as A x B, we pair each element of A with each element of
B. The results as ordered pairs, with each element of A written
first and the element of B written second.
 EXERCISE

If U= {a, b, c, d, e, f, g, h, i, j, k}; A= {a, b, c, e, f}; B= {b, c, d, e}; C= {f, g,

h}; and D= {a, e, g, i}. List the elements of the following 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