Professional Documents
Culture Documents
Sets
Definition of a Set
A set is a collection of well – defined distinct objects called elements.
A set is represented by a capital letter and can be written explicitly by listing its
elements using braces while its elements are represented by lowercase letters.
Notation:
• If x is a member or element of the set A, we write x ∈ A.
• If x is not an element of A, we write x ∉ A.
Example:
Let A be the set of all positive integers.
➢ A = {1, 2, 3, 4, 5, 6, . . .}
➢ 1 ∈ A but 0 ∉ A
Representation of a Set
Sets can be represented in two ways − Roster or Tabular Method and the Rule
Method using the Set Builder Notation.
Examples:
1. set of vowels in the English alphabet, A = {a, e, i, o, u}
2. set of multiples of 4 less than 20, B = {4, 8, 12, 16}
Rule Method
This is a method of representing a set which is done by describing the elements
of it. The set is defined by specifying a property that elements of the set have in
common. It is written using the Set Builder Notation.
A = {x|x is a(an) . . . }
Examples:
1. set of vowels in the English alphabet, A = {x|x is a vowel in the English
alphabet }
2. set of multiples of 4 less than 20, B = { x|x is a multiple of 4 less than 20}
Cardinality of a Set
The cardinality of a set A, denoted by n(A), is the number of elements of the set.
The number is also referred as the cardinal number. If a set has an infinite number of
elements, its cardinality is ∞.
Examples:
1. Let A be the set of all positive integers, i.e., A = {1, 2, 3, 4, 5, 6, . . .}. The
cardinality of set A is ∞, denoted as n(A) = ∞.
2. Let B be the set of vowels in the English alphabet, i.e., B = {a, e, i, o, u}. The
cardinality of set B is 5, denoted as n(B) = 5
Types of Sets
1. Finite Set
A finite set is a set which contains a definite or a countable number of
elements.
Examples:
a. set of vowels in the English alphabet
b. set of continents in the world
c. set of planets in the solar system
d. set of universities in the Philippines
2. Infinite Set
An infinite set is a set which contains an unlimited or uncountable number
of elements.
Examples: set of real numbers
5. Universal Set
A universal set is a collection of all elements in a particular context or
application. All the sets in that context or application are essentially subsets of this
universal set. Universal sets are represented as U.
Examples:
a. Let U be the set of all animals on earth
b. Let U be the set of all students in SLC
6. Subset
Proper Subset
The term “proper subset” can be defined as “subset of but not equal to”. A
set A is a proper subset of set B if every element of A is an element of set B
and n(A) < n(B). It is denoted by ⊂.
Examples:
a. Let A = {1,2,3,4,5,6} and B = {1,2}. Here set B ⊂ A since all elements
in B are contained in A too and set A has at least one element more than
set B.
7. Equal Set
If two sets, A and B, have the same elements they are said to be equal. In
symbols we write A = B.
Example:
If A = {a,r,c} and B = {c,a,r}, they are equal because every element of set A
is an element of set B and every element of set B is also an element of set A. In
symbols, A = B.
8. Equivalent Set
If the two sets, A and B, have the same cardinalities, then the two sets are
said to be equivalent sets. In symbols we write A ≡ B.~
Example:
If M = {a,r,c} and J = {c,a,r}, they are equivalent because the sets have the
same number of elements. Hence, M ≡ J
Venn Diagram
Examples:
A B U U U
A B A B C
C
Set Operations
Set Operations include Union, Intersection, Difference, Complement, and
Cartesian Product.
1. Union of Sets
Let A and B be the two given sets. The union of sets A and B, denoted by
A ∪ B, is the set of elements which are in A, in B, or in both sets. Hence,
A ∪ B = {x | x ∈ A OR x ∈ B}.
Example: A B
If A = {0,1,2,3,4,5,6,7,8,9} and
B= {1,3,5,7,9,11,13,15},
then
A ∪ B = {0,1,2,3,4,5,6,7,8,9,11,13,15}. U
2. Intersection of Sets
Let A and B be the two given sets. The intersection of sets A and B,
denoted by A∩B, is the set of elements which are in both A and B. That is,
A∩B = {x | x ∈ A AND x ∈ B}
Example: If A = {0,1,2,3,4,5,6,7,8,9} and A B
B = {1,3,5,7,9,11,13,15}, then
A ∩ B = {1,3,5,7,9}. U
3. Difference between Sets
Let A and B be the two given sets. The difference of sets A and B, denoted
by A – B, is the set that contains elements of set A that are not found in B.
Hence, A – B = {x | x ∈ A AND x ∉ B}.
Examples: A B
If A = {0,1,2,3,4,5,6,7,8,9} and
B = {1,3,5,7,9,11,13,15}, then
B – A = {11,13,15}. U
A – B = {0,2,4,6,8}
4. Complement of a Set
Let A and B be the two given sets. The complement of a set A, denoted
by A′, is the set that contains the elements which are not in set A. Hence, A′ = {x
| x ∉ A}. More specifically, A′ = (U − A) where U is a universal set which contains
all objects.
Example:
If U = {x | x is a letter in the English alphabet}
A
A = {x | x is a vowel}
A’
A′ = { x | x is a consonant}
a 1
b 2
c 3
These new objects (a, 1), (b, 2), (c, 3) are called “ordered pairs” The word “ordered”
means that in the pairing process, the order of writing the element is important.
For example, the ordered pair (a, 1) will generally be different from the ordered
pair (1, a). The elements composing an ordered pair are called components. In an ordered
pair (a, 1), a is the first component and 1 is the second component
Let us now recall the definition of a cross product. We let A and B be two,
nonempty sets. The cross product of A and B, denoted by A x B is given as A x B = {(x,
y) | x є A and y є B}. This means that the cross product of A and B or A x B is the collection
of all ordered pairs such that the first component belongs to set A and the second
component belongs to set B.
Definition (Relation)
A relation, say R, from A to B is any nonempty subset of the cross product A x B.
In our previous example, suppose C = {0, 2, 4}, D = {x, y}, then we can say that R
= {(0, x), (0,y)} is a relation of C x D. We also say that S = {(2, y), (4, y)} is another relation
of C x D.
dom R = {x | (x,y)є R}
The range of R (rng R) is the set of all second components of all ordered pairs
belonging to R.
rng R = {y | (x,y) є R}
Examples:
1. Consider the relation R from the set of integers, Z to Z such that
R = {(x, y) |x, y є Z and y =2x}. Then, we say the following:
dom R = “the set of Integers” or Z
. rng R = “the set of even integers” or 2Z
Definition (Function)
Let A and B be nonempty sets. A function f from A to B is a relation from A to B
such that the following conditions hold:
1. Dom f = A
2. No two ordered pairs in f must have the same first component. That is, if
(x, y) є f and (x, w) є f, then y = w.
Remark: For a function, there must be a unique value y for each value of x in the domain
of the function.
The vertical line test states that the graph of a function can be intersected by a
vertical line in at most one point. R={(B,1),(C,2),(D,4),(F,3)}
B 1 B 1 B 1 B 1
C 2 C 2 C 2 C 2
D 3 D 3 D 3 D 3
E 4 E 4 E 4 E
Note that figure 1 and figure 2 both satisfy the two conditions for a function.
However, in figure 3, one component or element in the domain is mapped to two
components or elements in the co-domain, hence not a function, while in figure 4, not all
elements in the domain were mapped, and so is also not a function.