GEC 104 Week 4 - Basic Concept of Sets
GEC 104 Week 4 - Basic Concept of Sets
GEC 104 Week 4 - Basic Concept of Sets
Definition of Set
In Cantors naïve set theory, a set is described as a well-defined collection of objects. These
objects are called the elements or members of the set. Objects can be anything: numbers, people,
other sets, etc. It must be related and well defined.
Vowels in the English alphabet V = { a, e, i, o, u }
First seven prime numbers X = { 2, 3, 5, 7, 11, 13, 17 }
Naming of Set
A set is named using a capital letter. Each object of a set is called an element or a member
of a set. The elements of a set are enclosed by braces.
B = {2, 4, 6, 8, 10}
The individual objects in a set are called the elements or members of the set.
The symbol ∈ is used to indicate that an object is an element or member of the set.
F = {ruler, ballpen and notebook} ruler ∈ F cellphone ∈ F
2. Set-Builder Notation or Rule Method - The set can be defined, where possible, by describing
the elements. This is called the set-builder notation.
C = {x : x is an integer, x > – 3}
Read as: “C is the set of elements x such that x is an integer greater than –3.”
3. Venn Diagram - It uses overlapping circles or other shapes to illustrate the logical
relationships between two or more sets of items. Often, they serve to graphically organize
things, highlighting how the items are similar and different.
SUMMARY
1. Singleton Set or Unit Set – If a set contains only one element it is called to be a singleton set.
Example: S = { x | x ∈ N, 7 < x < 9 }
S = {8}
2. Finite Set – A set is called a finite set if the members of the set can be counted.
Example: (i) X = {1, 2, 3, 4}, which has 4 members.
(ii) Y = {x | x ∈ W , x ≤ 9}, which has 10 members.
It is not easy to write infinite sets in the tabular form because it is not possible to make a list of an
infinite number of members. The example (i) can be written in the tabular form as W = {0, 1, 2, ...}.
4. Empty Set or Null Set – An empty set contains no elements. It is denoted by ∅ or { }. As the
number of elements in an empty set is finite, empty set is a finite set. The cardinality of empty
set or null set is zero.
The set { ∅ } is not empty, but is a set which contains the empty set.
6. Proper Subset – The term “proper subset” can be defined as “subset of but not equal to”. A
Set X is a proper subset of set Y (Written as X ⊂ Y) if every element of X is an element of set
Y and $|X| < |Y|.
Any set is a subset of itself. Any set is a subset of the universal set The empty set is a subset of every
set including itself.
7. Power set – If A is a set, the power set of A is another set, denoted as P(A) and defined to be
the set of all subsets of A. In symbols, P(A) = { X : X ⊆ A }.
Example: Suppose A = {1, 2, 3}, The power set of A is the set of all subsets of A. We
learned how to find these subsets in the previous section, and they are { }, {1},
{2}, {3}, {1, 2}, {1, 3}, {2, 3} and {1, 2, 3}. Therefore the power set of A is
P(A) = {∅, {1}, {2}, {3}, {1, 2}, {1, 3}, {2, 3}, {1, 2, 3} }.
8. Equal Set – If two sets contain the same elements they are said to be equal.
Example: If A = { 1, 2, 6 } and B = { 6, 1, 2 }, they are equal as every element of set A is an
element of set B and every element of set B is an element of set A.
9. Equivalent Set – If the cardinalities of two sets are same, they are called equivalent sets.
Example: If A = { 1, 2, 6 } and B = { 16, 17, 22 }, they are equivalent as cardinality of A is
equal to the cardinality of B. i.e. |A| = |B| = 3.
10. Disjoint Sets – Two sets which have no elements in common. Two sets A and B are called
disjoint sets if they do not have even one element in common. i.e. Their intersection is empty:
A ∩ B = ∅.
Therefore, disjoint sets have the following properties:
n(A ∩ B) = ∅
n(A ∪ B) = n(A) + n(B)
Example: Let, A = { 1, 2, 6 } and B = { 7, 9, 14 }, there is not a single common element,
hence these sets are overlapping sets.
11. Universal Set – Any set which is a superset of all the sets under consideration is said to be
universal set and is either denoted by omega or S or U.
Let A = {1, 2, 3}
C = { 0, 1} then we can take
S = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9} as universal set.
Set Operation
Finding intersections, unions, and complements of sets are examples of set operations. An
operation is a rule or procedure by which one or more objects are used to obtain another object
(usually a set or number).
A universal set for a particular problem is a set which contains all the elements of all the sets
in the problem. A universal set often denoted by a capital U. In this section we will create subsets of a
given universal set and use set operations to create new subsets of the universal set.
There are three set operations we will learn in this section.
Complement – The complement of a set A is symbolized by A’ and it is the set of all elements
in the universal set that are not in A.
Intersection – The intersection of sets A and B is symbolized by A ∩ B and is the set
containing all of the elements that are common to both set A and set B.
Union – The union of set A and B symbolized by A U B and is the set containing all the
elements that are elements of set A or of set B or that are in both Sets A and B.
Find A’
A’ is all of the elements in the universal set that are not in set A.
Answer: A’ = {4, 5}
Find A ∩ B (This is asking me to find all of the elements that A and B have in common.)
Answer: A ∩ B = {2, 3}
Find A U B (This is asking me to list all of the elements in A followed by all of the elements in B, then
delete any elements that are written twice.)
A U B = {1, 2, 3, 2, 3, 4}
Answer: A U B = {1, 2, 3, 4}
ACTIVITY 1
A. Directions: Identify which of the following are sets. Write S for Sets and NS for Not Sets.
1) ____________ The collection of all the days in a week beginning with the letter ‘T’.
2) ____________ The collection of all difficult questions in the chapter on sets.
3) ____________ The collection of girls in your class.
4) ____________ The collection of all rivers in India.
5) ____________ The collection of all active teachers in the school.
6) ____________ The collection of all integers more than -3.
7) ____________ The collection of all beautiful flowers in the park.
B. Directions: State whether the following are TRUE or FALSE.
1. ____________ The set of letters in the word MASTER is finite.
2. ____________ The set of vowels in the word PLANET is an empty set.
3. ____________ {0} represents a null set.
4. ____________ Equivalent sets are always equal.
5. ____________ An empty set is a finite set.
6. ____________ 10 ∉ set of multiples of 5.
7. ____________ If two sets are equal, they are also equivalent.
C. Given: If,
A = {3, 5, 7, 9} C = {12, 14, 18, 20, 24}
B = {2, 4, 6, 8, 10} D = {21, 26, 31, 36}
Directions: State whether TRUE or FALSE.
1. ____________ 13 ∈ C 4. ____________ 31 ∈ D
2. ____________ 6 ∉ A 5. ____________ 36 ∉ D
3. ____________ 9 ∉ A 6. ____________ 20 ∉ C
ACTIVITY 2
A. Directions: Write the following sets in the roster form.
1. A = The set of all even numbers less than 12.
2. B = The set of all prime numbers greater than 1 but less than 29.
3. C = The set of integers lying between -2 and 2.
4. D = The set of letters in the word LOYAL.
5. E = The set of vowels in the word CHOICE.
6. F = The set of all factors of 36.
7. G = {x : x ∈ N, 5 < x < 12}.
ACTIVITY 3
Directions: Write the cardinal number for each of the following.
MASTERY TESTS
PART 1 If, A = {3, 5, 7, 9} B = {2, 4, 6, 8, 10} C = {12, 14, 18, 20, 24} D = {21, 26, 31, 36}
Complete the statement to make it true. Fill in the blanks.
PART 4 Solve the following. Write the final answer only on the space provided.
U = {1, 2, 3, 4, 5, 6} S = {2, 4, 6} T = {1, 2, 4} V = {4, 5, 6}
1. ___________________________ S U (T ∩ V)
2. ___________________________ (S U T)’
3. ___________________________ S ∩ (V ∩ T’)
4. ___________________________ (S’ U V’) ∩ T
5. ___________________________ T U V’ U S’