Mathematics and Natural Sciences Department

Mr. Christian Paul S. Estrella

Course Instructor
 Sets and
Set Notation
SETS
A set is a well-defined collection of objects. These objects are called
elements or members of the set.

We use the symbol

∈ – if the object is element of the set
∉ – if the object is not an element of the set
EXAMPLE OF SETS

A = 𝑥 | 𝑥 is a positive integer less than 10

B = 𝑥 | 𝑥 is an integer, 1 < 𝑥 < 8

C = 𝑥 | 𝑥 is a set of vowel letters

“Set C is the set of all x such that x is a set of vowel letters” or

C = a , e, i, o, u
 LISTING OF ELEMENTS OF THE SET

A ={𝑥 | 𝑥 isa letter in the word "mathematics"}

>> A = {m, a, t, h, e, i, c, s}  ROSTER FORM/TABULATION METHOD

B = 𝑥 | 𝑥 is an integer, 1 < 𝑥 < 8  RULE METHOD/SET BUILDER NOTATION

>> B = 2, 3, 4, 5, 6, 7

C = 𝑥|𝑥 = 2𝑛 + 3, 𝑛 is a positive integer

>> C = 5, 7, 9, 11, 13, …
Roster Form to Rule Method

T = 𝑁𝑎𝑟𝑟𝑎, 𝑀𝑎ℎ𝑜𝑔𝑎𝑛𝑦, 𝑀𝑜𝑙𝑎𝑣𝑒, …

G = 𝐷𝑂𝐽, 𝐷𝑂𝐻, 𝐷𝑂𝑆𝑇, 𝐶𝐻𝐸𝐷, 𝐷𝐸𝑁𝑅, …

C = 𝐶𝐴𝑆, 𝐶𝐴𝐵𝐻𝐴, 𝐶𝐴𝑀, 𝐶𝑇𝐸, 𝐶𝑜𝐸, …

A = a, b, c, d, e
Rule Method to Roster Form

A = 𝑥 | 𝑥 is a positive integer less than 10

B = 𝑥 | 𝑥 is an integer, 1 < 𝑥 < 8

C = 𝑥 | 𝑥 is a letter in the word "conventional"

BASIC CONCEPTS IN SET

Empty Set

Finite Set

Equal Sets

Equivalent Sets

Cardinality of a Set
 Set
Operations
Universal Set
is the set of all elements that are under consideration. This is
usually denoted as U

Complement of a Set A
is the set of all elements of the universal set U that are not
elements of A. Denoted as A’
Subset
A set A is a subset of set B, denoted by 𝐴 ⊆ 𝐵, if and only if every element of A is
also an element of B.

Subset Relationships:
𝐴 ⊆ 𝐴, for any set 𝐴
∅ ⊆ 𝐴, for any set 𝐴
Proper Subset
Set A is a proper subset of set B, denoted by 𝐴 ⊂ 𝐵, if every element of A is an
element of B, and 𝐴 ≠ 𝐵 (or there is at least one element of B that is not in A). This is a set
that does not include the set itself.
Number of Subsets in a Set
To determine the number of subsets in a set:
Any set with n elements has 𝟐𝒏 subsets.
Union of Sets
The union of sets A and B, denoted by 𝐴 ∪ 𝐵, is the set that contains all the
elements that belong to A or to B or to both. In symbols:
𝑨 ∪ 𝑩 = {𝒙|𝒙 ∈ 𝑨 𝒐𝒓 𝒙 ∈ 𝑩}
Intersection of Sets
The intersection of sets A and B, denoted by 𝐴 ∩ 𝐵, is the set of elements common
to both A and B. In symbols:
𝑨 ∩ 𝑩 = {𝒙|𝒙 ∈ 𝑨 𝒂𝒏𝒅 𝒙 ∈ 𝑩}
Disjoint Sets
Two sets are disjoint if their intersection is the empty set.
Relations
and
Functions
CARTESIAN PRODUCT
Given set A and set B as nonempty sets, the Cartesian product of sets A and B
denoted by 𝑨 × 𝑩 is given by

A × B = {(a, b) | a ∈ A and b ∈ B}

Example: Let A = {2, 4, 6} and B = {3, 5}. Find the following sets: A × B, B × A, A × A
RELATION

A relation is a set of ordered pairs.

If x and y are elements of these sets and if a relation exists between x and y,
then we say that x corresponds to y, or that y depends on x and is
represented as the ordered pair of (x, y).

A relation from set A to set B is defined to be any subset of A × B

DOMAIN, CODOMAIN, & RANGE

DOMAIN
The set of all values for which a function or relation can be evaluated
The set of allowable “input” values

CODOMAIN
A set of all values (which includes the range) that could possibly come out from a function or
relation

RANGE
The set of all values a function or relation produce
The set of “output” values
FUNCTION
A relation in which for each value of the first component of the ordered pair, there
is exactly one value of the second component

FUNCTION FUNCTION NOT FUNCTION

 Binary
Operations
Binary Operations
Let G be a set. A binary operation on G is a function that
assigns each ordered pair of element of G.

Symbolically, a  b = c  G, for all a, b, c  G.

Group
A group is an ordered pair (G, ) where G is a set and  is a binary operation on G satisfying
these four properties:
❑ Closure property.
If any two elements are combined using the operation, the result must be an element of the set, that is,
𝑎𝑏 = 𝑐𝑮, 𝑓𝑜𝑟 𝑎𝑙𝑙 𝑎, 𝑏, 𝑐𝑮.
❑ Associative property.
(𝑎𝑏)𝑐 = 𝑎(𝑏𝑐), for all a, b, c  G.
❑ Identity property.
There exists an element e  G, such that for all a  G, 𝑎𝑒 = 𝑒𝑎.
❑ Inverse property.
For each a  G there is an element a–1 of G, such that 𝑎𝑎−1 = 𝑎−1  𝑎 = 𝑒.
Example
Determine whether the set of all integers under addition is a group.
>> This implies that G is the set of all integers, and  or binary operation is addition (+).

Solution:
Step 01: Closure property; here we may choose any two positive integers, such as,
3 + 9 = 12 and 5 + 10 = 15
We can see here that the sum of the two number from the set results with a number
that also belongs to the set. Same with the other possible elements of the set. Thus, it is
closed.
Example
Step 02: Associative property; here we may choose three positive integers from the set, say
3 + (2 + 4) = 3 + 6 = 9 (3 + 2) + 4 = 5 + 4 = 9

Since the result are equal, thus, it also satisfies the associative property.

Step 03: Identity property; we can choose any positive integer, i.e.
8 + 0 = 8; 9 + 0 = 9; 15 + 0 = 15
Thus, it also satisfies the identity property
Example
Step 04: Inverse property, choose any positive integer
4 + (–4) = 0; 10 + (–10) = 0; 23 + (–23) = 0

Note that a–1 = –a.

Thus, it also satisfies the inverse property.

Since it satisfies all conditions, thus the set of all integer under addition is a
group.