SETS

 Well-defined collection of distinct object and is denoted an uppercase letter

A= {1,2,3,4,5}
↓
ELEMENT/MEMBER

WAYS OF DESCRIBING A SET

 ROSTER/TABULAR METHOD - Method in which the elements in the given set are
listed or enumerated, separated by a comma inside a pair of braces.

 RULE / DESCRIPTIVE METHOD - Method in which the common characteristics of the

elements are defined. This method uses set builder where x is used to represent any
element of the given set.

Example: The distinct letters in the word “MATH”

Let A be the set of distinct letters of the MATH,

Roster form: A= {m, a, t, h}

Rule form: A = {x│ x is the distinct letter of the world math}

Example: The colors of the rainbow.

Let B be the set of the color of the rainbow.

Roster form B= {red, orange, yellow, green, blue, indigo, violet}

Rule form B= {x│ x is the color of the rainbow}

Example: An even prime number.

Let C be the set of an even prime number.

Roster form C = {2}

Rule form c= { x│ x is an even prime number}

TYPES OF SET
•EMPTY/NULL/VOID SET- set that has no elements, denoted by ø or { }.

Example: The set of numbers in the English alphabet.

Roster form: E = { }
Rule form: E = {x│x is a number in the English alphabet}

1.2 TYPES OF SET

•FINITE SET= a set with a countable number of elements.

Example: The set of letters in the English alphabet.

Roster form: F = { a,b,c,d…, z}

Rule form: F = {x│x is a letter in English alphabet}

1.2TYPES OF SET
•INFINITE SET – a set has uncountable of element.

Example: The set of counting number.

Roster form G = {1, 2, 3, 4, …}

Rule form: G= {x│ x is a counting number}

TYPES OF SET

•UNIVERSAL SET- the totality of all the elements of the sets under consideration,
denoted by U.

Example: The set of realnumber.

Rule form: U = {x│x is a real number}

RELATION BETWEEN SETS
•EQUAL SETS – sets with the same elements
Example : A = {r, e, a, d}
B = {d ,e ,a, r}

•EQUIVALENT SETS = sets with the same numberbof elements.

Example : A = { r, e, a, d}
B = { 1, 2, 3, 4}

1.3 RELATION BETWEEN SETS

•JOINT SETS- sets with at least one common element.

Example: E = {①, 2, 4, 11, 15, 18, 20}
F = {①, 3, 9, 10}

•DISJOINT SETS- sets have no common element.

Example: E = {2, 4, 6, 8, 10,…}
F = {1, 3, 5, 7, 9,…}

SUBSET
 Proper subset- contains at least one common element from the main set.
 Improper subset- set itself and null set
Example:
U = {1, 2, 3, 4, 5, 6, 7, 8, 9,10}
A = {3,4,6} C = {1,2,3,4,5,6,7,8,9,10} E={}
B = {1, 2, 7, 8, 9, 10} D = {3}

POWER SET
•Set containing all the subsets of the given set.
Formula: 2ⁿ where “n” is the number of elements

Example:
A = {3, 4, 6]
2ⁿ = 2³ = 8 subsets
 Subset 1 = {3, 4} or {4, 3} Subset 5 = {4}
Subset 2 = {4, 6} or {6, 4} Subset 6 = {6]
Subset 3 = {3, 6} or [6, 3} Subset 7 = {3, 4, 6}
Subset 4 = {3} Subset 8 = { }

OPERATION ON SETS
UNION OF SETS A and B (DENOTE BY A U B)

 Set whose elements are found in both A and B

Example : A = {a,b,c,d}
B = {c,d,e}
THEN A U B ={ a,b,c,d,e} A B
⃝⃝
1.4 OPERATIONS ON SETS
2. INTERSECTION ON SET A and B (DENOTE BT A ∩ B)

 set whose elements are common to both sets.

Example: A = {a,b,c,d}
B = {c,d,e}
THEN A ∩ B = {c,d} A ⃝ B ⃝

OPERATIONS ON SETS
DIFFERENCE OF SETS A and B (DENOTED BY A –B)
-Set whose elements are found in set A but not set B.

EXAMPLE: A = {a, b,c,d} A B

B = {c,d,e} ⃝⃝
THEN A –B = {a,b}

1.4 OPERATIONS ON SETS

COMPLEMENT OF SET A (DENOTED BY A’)
 The set of elements found in the universal set but not in set A.

Example: Let U = { a,b,c d,e} A

A = {a,b,c,d} ⃝
B = {c,d,e}
THEN A’ = {e}

1.4 OPERATION ON SETS

Example: Let U = {a, b, c, d, e}
B = {c, d, e}
THEN B’ = {a, b}