Professional Documents
Culture Documents
IV. Matrix of Lesson-Submitted
IV. Matrix of Lesson-Submitted
IV. Matrix of Lesson-Submitted
CONCEPTS of SETS
(Reading Materials for asynchronous)
Set
It is a well-defined collection of objects. A well-defined set means that it is
possible to determine whether an object is belongs to a given set. The objects are
called members or elements of a set. It is denoted by ∈. Also, the symbol a ∉ S is
read as “a is not an element of set S ”.
C={ 5 , 10 ,15 , 20 , … }
The number of elements of any given set is called cardinality. If the given set A
has 5 elements, then the cardinality of A is 5. In symbols, n(A)=5.
Set B has 12 elements namely BGSM, SMB, ROS, TNT, NLEX, COL, BWE,
MER, PHX, MAG, ALA, GBP. Each PBA team is an element of set B.
In symbols:
BGSM , SMB , ROS , TNT , NLEX , COL , BWE , MER , PHX , MAG , ALA ,GBP ∈ B
Both sets A and B are finite sets since their elements can be counted. A set is said to
be finite if the number of elements are countable.
The numbers multiples of 5 are the elements of set C. These numbers are 5, 10,
15, 20 so on and so forth. Any number multiple of 5 is an element of set C.
In symbols: 5, 10, 15, 20, ...∈C
Set C is an infinite set since the counting of elements is endless. A set is infinite if the
number or counting of elements is endless. The symbol … is called ellipses.
Set D has 10 elements namely 10, 20, 30, 40, 50, 60, 70, 80, 90 and 100. The
elements of set D are the numbers multiples of 10 from 10 to 100. Each multiple of 10
from 10 to 100 is an element of set D. In symbols,
10, 20, 30, 40, ...100 ∈ D
Set D is a finite set.
Notice that both sets C and D has the symbol of ellipses but classified as infinite
and finite set, respectively. Set C does not have last element making the set infinite
while set D has last element.
A set which has only one element is called unit-set (or singleton), while a set
with no element is called null or empty set. An empty set is denoted by or { }.
In mathematics, there are lots of sets of numbers. Below are some of the sets of
numbers.
N=set of counting∨natural numbers={1 ,2 , 3 , 4 , … }
W =set of whole numbers={0 ,1 , 2 ,3 , … }
Z−¿=set of negative integers={… ,−3 ,−2 ,−1 }¿
Z=set of integers={… ,−3 ,−2,−1 ,0 , 1 ,2 , 3 , … }
Z' =set of non−integers={−1.25 , 0.5 ,−0. 3́ , 0.1 25
´ , π , φ , √2 , … }
a
Q=set of rational numbers={ ∨b≠ 0∧a , b ∈ Z }
b
Q' =set of irrational numbers={−π ,−φ ,−3 √ 2 ,−e , π , φ , √ 2, e ,… }
2. The rule form is a method which makes use of the symbol { x|x } which read as “
x such that x at the beginning of the descriptive phrases. It is also known as Set-
Builder Notation.
In the above examples of sets, sets A, C and D are examples of sets written in
tabular or roster form while set B is in rule form.
Name: Edward R. Torrefranca
Course: Doctor of Philosophy in Development Education
Semester: Second Semester, A.Y. 2020-2021
Professor: Dr. Regidor G. Gaboy
Page |7
Kinds of Sets
1. Equal sets. Sets A and B are equal, denoted by A=B, if the two sets have the same
cardinality and have the same elements.
2. Equivalent sets. Sets A and B are equivalent, denoted by A B, if they have the
same number of elements or cardinality.
3. Joint sets. Two sets are said to be joint if they have element in common.
4. Disjoint sets. Two sets are said to be disjoint if they have no element in
common.
Illustration
Sets E and F are equal sets, denoted by E=F, since they have the same
cardinality and same elements. Both sets have elements a, e, i, o, u and n(E)=n(F)=5.
Sets E, F and G are equivalent sets since they have the same cardinality.
n(E)=n(F)=n(G)=5.
Sets E and F are joint sets since they have elements in common, that is, the
vowels of the English alphabets. Also, set G is joint to set H. Sets G and H have
elements in common which are 10 and 20.
The pairs of sets E and G, E and H, F and G, and F and H are disjoint sets since
they have no element in common.
The universal set of sets E and F is maybe the set of uppercase letters of the
English alphabet while the universal set of sets G and H is maybe the set of counting
numbers, set of whole numbers, set of integers, set of rational numbers or set of real
numbers.
Subset
Kinds of Subsets
1. Proper subset. Set A is a proper subset of set B, denoted by A ⊂B, if only if every
element of A is in B but there is at least one element of B that is not in A. The
symbol ⊄ denotes that it is not a proper subset. In symbol it is written as “AB
x, xAxB”.
2. Improper subset. There are two improper subset of any given set – the null set and
the set itself.
Illustration
then, set M is proper subset of set L, denoted by M ⊂ L, since every element of set M
are found in set L but the element 30 of set L is not in set M. Likewise, set O is a proper
subset of set N, denoted by O ⊂ N since each element of set O are found in set N but
the elements 10, 60 and 70 of set N are not in set O.
The two improper subsets of all sets mentioned above are the null set and the
set itself. So, for sets L, M, N and O, their improper subsets are { } or and sets L, M,
N and O respectively.
Power Set
The power set of set A, denoted by (A), is a set whose elements are all
subsets of set A. The number of subsets of any given set can be determine using the
formula below.
Illustration
Notice that the number of elements of (A) is n((A)) = 8. These 8 elements are the
proper and improper subsets of set A. Using the formula 2k =23=8, which is the number
of subsets of set A.
5. Complement of a set. The complement of set A, denoted by A' , with respect to the
universal set ⋃ is a set containing elements found in the universal set but not in set
A.
In symbols, A' ={ x ∈ ⋃∨x ∉ A }
Illustration
Consider the following sets below:
K={f , l , o , w , e , r }
J ∪ K={v , a , s , e , f ,l , o , w , r }.
I ∩ K ={o , e }
J ∩ K={e }.
Also, the difference of set I to set J, set I to set K, and set J to set K are
I −J={i, o ,u }
I −K ={a , i, o }
J−K ={v , a , s }
while the difference of set J to set I, set K to set I, and set K to set J are
J−I ={v , s }
K−I ={f , l , w , r }
K−J ={f , l, o , w ,r }.
J ' ={b , c , d , f , g , h ,i , j , k ,l , m, n , o , p , q , r , t ,u , w , x , y , z }
K ' = { a ,b ,c , d , g , h , i, j , k , m, n , p , q , s , t ,u , v , x , y , z } .
C={ ( a , b ) , ( a , c ) , ( a , d ) , ( b , b ) , ( b , c ) , ( b , d ) }
in which the first component of each pair is an element of A while the second is an
element of B, is called product set C= A × B (in that order) of the given set. Thus if, A
and B are arbitrary sets, we define
A × B= { ( x , y ) : x ∈ A , x ∈ B }
Illustration
A × B= { ( 1, 2 ) , (1 , 4 ) , ( 1 , 6 ) , ( 2, 2 ) , ( 2, 4 ) , ( 2, 6 ) , ( 3 , 2 ) , ( 3 , 4 ) , ( 3 , 6 ) }
B× A= { ( 2 ,1 ) , ( 2, 2 ) , (2 , 3 ) , ( 4 , 1 ) , ( 4 , 2 ) , ( 4 , 3 ) , ( 6 ,1 ) , ( 6 , 2 ) , ( 6 , 3 ) }
A × A={ ( 1 ,1 ) , ( 1 ,2 ) , ( 1, 3 ) , ( 2 ,1 ) , ( 22 ) , ( 2 ,3 ) , ( 4 ,1 ) , ( 4 ,2 ) , ( 4 , 3 ) }
B× B= {( 2 , 2 ) , ( 2 , 4 ) , ( 2 , 6 ) , ( 4 , 2 ) , ( 4 , 4 ) , ( 4 , 6 ) , ( 6 , 2 ) , ( 6 , 4 ) , ( 6 ,6 ) }