Set Theory-1 PDF
Set Theory-1 PDF
Set Theory-1 PDF
SET THEORY
We find the concept of a set in many branches of mathematics. In this chapter, we will
discuss the theory of sets and later different sets of numbers.
1.1 BASIC DEFINITIONS
Definition 1.1.1
A set is a collection of objects. The objects in the set are called elements of the set.
A set can be given by description or by listing the elements. We usually indicate a set by a
pair of braces but parentheses and square brackets are sometimes used as well.
Example 1.1.1
The following are sets:
(a) Top 10 selling fruits in Zambia.
(c) {x : x 2, x } [2, )
(d) { y : 0 y 1} (0,1)
Definition 1.1.2
Two sets are equal if they contain exactly the same elements.
Example 1.1.2
1. The set {1,3, 4,5} is equal to the set {1, 4,3,5}.
2. The set containing the letters of the word “SILENT” is equal to the set containing the
letters of the word “LISTEN”.
NOTATION
We usually use a lower case letter, say x to represent a generic element of a set and the
symbol " " to mean “is an element of” or “is a member of”. For example, x A would be
read as " x is an element of a set A " or " x is a member of a set A". If a set A is equal to a
set B , we write A B.
Definition 1.1.3
A universal set, denoted by U or E , is defined as the set containing all possible elements of
any set we wish to consider.
Example 1.1.3
What would be the universal set for the sets in Example 1.1.1?
(a) Fruits
(b) Whole numbers or Integers or Real numbers.
Definition 1.1.4
A set with no elements is called the empty set and is denoted by {} or .
Definition 1.1.5
A is a subset of B if every element of A is also an element of B.
NOTATION
If A is a subset of B and can also be equal to B , we denote this by A B. If A is a subset
of B and A B, then A is said to be a proper subset of B and we use the notation A B.
Sets can also be represented pictorially in a diagram called a Venn diagram. In a Venn
diagram, a rectangle is drawn to represent the universal set and closed figures (usually
circles) are drawn inside the rectangle to represent other sets.
U
B
A C
A B {x : x A or x B}.
Definition 1.2.2
The intersection of two sets A and B , denoted by A B, is the set containing all elements
that are found in both A and B , i.e.
A B {x : x A and x B}.
Definition 1.2.3
The complement of a set A, denoted by Ac or A, is the set of all elements that are not in A,
i.e.
Ac {x : x U , x A}.
Definition 1.2.4
The difference of two sets A and B , denoted by A B, is the set of elements which belong
to A and which do not belong to B , i.e.
A B {x : x A and x B c }
A B A Bc .
Example 1.2.1
Given that E {2, 1, 0,1, 2,3, 4,5, 6}, A {2,1,3}, B {0,1, 2,3} and C {2, 4}. Find
(h) A B C (i) A B C (j) Ac Bc C .
c
Represent the sets on a Venn diagram.
Solutions
(a) A B {2, 0,1, 2,3}
(b) Exercise
(c) A B C {2, 0,1, 2,3, 4}
(d) Exercise
(e) B C {2}
(g) Exercise
(h) A B C A B C .
c
A B C A B C {2}.
c
Ac Bc C {1,0, 2, 4,5,6} Ac
U B
A
-2 1 0
3
2 C
4
-1 5 6
Example 1.3.1
Simplify each of the following:
Solutions
We use laws of algebra of sets.
(ii) A ( Ac B) A ( Ac B c )c
A ( Ac )c ( B c )c
A ( A B)
( A A) ( A B )
A ( A B)
A.
The opposite of rational numbers are irrational numbers (denoted by IR ) . For example,
numbers such as 2, 3 and e are irrational numbers because they cannot be expressed as
ratios of integers.
Definition 1.4.4
Real numbers are a collection of rational and irrational numbers and are denoted by .
In others words, any number on the continuous line is a real number.
Definition 1.4.5
Complex numbers, denoted by , are numbers that can be expressed as z x iy, where
x, y and i 1. x is referred to as the real part while y is referred to as the imaginary
part of a complex number, i.e.
Re( Z ) x and Im( Z ) y.
NOTE: are also complex numbers with the imaginary part equal to zero.
IR
Example 1.4.1
Classify the following numbers:
2
0.3333..., e 2 , 9, , 2 i, 3 1 i ,1000.
3
Solutions
ALL
2
0.3333..., e 2 , 9, ,1000
3
2
IR e 2 ,
3
0.3333..., 9, 1000
9, 1000
1000
a b
2. (a, b] {x : a x b}
a b
3. [a, b) {x : a x b}
a b
4. [a, b] {x : a x b}
a b
5. (, a) {x : x a}
a
6. (, a] {x : x a}
a
7. (a, ) {x : x a}
8. [a, ) {x : x a}
a
We can do set operations of sets involving intervals as the next example shows:
Example 1.4.2
Given that the universal set is and that A (1, 7], B [5,3] and C [1,10], find each
of the following sets and display on the number line:
Solutions
(i) Ac Ac
A
1 0 7
(ii) B A B Ac
B
Ac Ac
5 1 0 3 7
B A B Ac [5, 1]
(iii) B
B A A
C C
C
5 1 0 3 7 10
B A (1,3] and C (, 1) (10, ). Therefore, ( B A) C .
1.4.2 Rational Numbers
Any rational numbers can be represented as a decimal and for some, numbers repeat after a
decimal point. Given any rational number in form of a decimalwith some figures repeating
a
after a decimal point, we can express it in the form , a, b , b 0. We place a bar over
b
the set of numbers which is to be repeated indefinitely.
Example 1.4.3
a
Express the following rational numbers in the form , a, b , b 0 in their lowest terms:
b
(i) Let x 3.14. Multiplying throughout by 100, we get 100x 314.14. We can now subtract
the two numbers. We need to make sure that numbers after the decimal point are the same so
that after subtraction we get zero after the decimal point. Thus,
100 x 314.14
x 3.14
99 x 311.0
311 311
x which is already in its lowest terms. Therefore, 3.14 .
99 99
(ii) Exercise
We now multiply by 1000 to get the same repeating numbers after the decimal point.
100000 x 29432.432
100 x 29.432
99900 x 29403
29403 1089
x , i.e.
99900 3700
1089
0.29432 .
3700
1.4.3 Irrational Numbers
(2k ) 2 2b 2
4k 2 2b 2
b 2 2k 2 .
Thus, b 2 is divisible by 2 implying that b is also divisible by 2. This means that a and b
have a common factor 2. This is a contradiction. Hence, 2 is irrational.
The square root of a prime number is a surd, for example, 2 , 3 and 5 are surds.
PROPERTY
If a and b are real numbers, then
(a) ab a . b
a a
(b)
b b
(c) a a a
Example 1.4.5
Simplify each of the following:
(a) 20 2 45 80 (b)
11 5 5 11 (c)
12
156
Solutions
(a) 20 2 45 80 4 5 2 9 5 16 5
4. 5 2. 9. 5 16. 5
2 5 2.3 5 4 5
2 56 54 5
4 5
(b)
11 5 5 11 5 11 11. 11 25 5 11
10 11 11 25
10 11 36
12 4 3 2 3 1
(c)
156 4 39 2 3 13 13
If a fraction has a number with surds in the denominator, then we can ‘remove’ the surd from
the denominator. We can do this by multiplying by a special ‘1’. When this is done, we say
that the denominator has been rationalised.
Example 1.4.6
Rationalise the denominator of each of the following:
1 1 2 20 5 18
(a) (b) (c)
2 1 2 1 48
Solutions
1 1 2 2
(a) .
2 2 2 2
(b)
1 2 1 2 1 2
1 2 1 2
1 2 2 2 3 2 2
3 2 2
1 2 1 2 1 2 1 2 1 2
1 2
1
(c)
20 5 18
20 5 18 1 48
20 5 18 1 48
1 48 1 48 1 48 1
48 1 48
20 20. 48 5 5. 48 18 18. 48
1 48
4. 5 4. 5. 16. 3 5 5. 16. 3 9. 2 9. 2. 16. 3
47
2 5 8 5. 3 5 4 5. 3 3 2 12 2. 3
47
5 4 5. 3 3 2 12 2. 3
47
5 4 15 3 2 12 6
47
Definition 1.4.6
If z x iy is a complex numbers, then the conjugate of z , denoted by z , is the complex
numbers z x iy. .
Complex numbers can be added, subtracted, multiplied and divided as the next example
shows.
Example 1.4.7
Given that z1 2 i and z2 4 2i, evaluate each of the following expressing your answer
in the form x iy :
z1
(a) z1 z2 (b) z1 z2 (c) z1 z2 (d)
z2
Solutions
(a) z1 z2 2 i 4 2i (2 4) i 2i 6 i
(b) z1 z2 2 i (4 2i) 2 4 i 2i 2 3i
z1 2i
(d)
z2 4 2i
To express it in the form x iy, we multiply by a special “1” using the conjugate of the
complex number in the denominator.
z1 2 i 4 2i (2 i )(4 2i ) 6 8i 3 2
i.
z2 4 2i 4 2i 42 4i 2 20 10 5
1.5 BINARY OPERATIONS
An operation can be applied to two numbers to generate a third number. Such operations are
known as binary operations.
Definition 1.5.1
Let S {a, b, c,...} be any set. The operation * is a binary operation on S if and only if to
every ordered pair (a, b), where a, b S , there is assigned unique element a * b S. We
indicate this assignment by the notation (a, b) a * b.
Example 1.5.1
The usual operation of arithmetic , and are binary operations on because each
operation on any two numbers from generates a number in .
Example 1.5.2
1. Determine whether the operation * defined by
(a) a * b 2a b (b) a * b a b
is a binary operation on .
2. For a binary operation * on defined by a * b a b ab, find
(a) 2*5 (b) (1* 2) * 5
Solutions
1. (a) For any a, b
a * b 2a b since a b
* is a binary operation.
(b) For any a, b , a b but for some numbers a b . For example,
if a 1, b 2, a * b 1*2 1 2 1 i .
* is not a binary operation.
2. (a) a *b a b ab
2*5 2 5 2(5) 7 10 3 .
1* 5
1 5 1 5
1
Definition 1.5.2
The binary operation * on a set S is commutative if and only if for every ordered pair (a, b)
of elements S
a *b b * a.
Definition 1.5.3
The binary operation * on a set S is associative if and only if for every a, b, c S ,
a * b * c a * b * c.
Example 1.5.3
1. For the following binary operations *, determine whether they are
(i) commutative or (ii) associative
(a) a * b 2a b on (b) a * b a 2 b2 on .
Solution
1. (a) (i) a * b 2a b 2b a b * a
The binary operation is commutative.
b c
(ii) a *(b * c) a *(2bc ) 2a 2
ab
(a * b)* c (2a b )* c 2(2 )c
a *(b * c) (a * b) * c
Thus, the binary operation is not associative.
(b) (i) a * b a 2 b2 b2 a 2 b * a
The binary operation is not commutative.
( a * b) * c ( a 2 b 2 ) * c a 2 b 2 c 2
2
a *(b * c) (a * b) * c
Definition 1.5.4
A binary operation * on a set S has an identity, denoted by e, if
a * e a e * a.
Examples of binary operations with an identity elements are and on . This is because
for any a, b
a 0 a 0 a
implying that 0 is an identity element of on and
a 1 a 1 a
implying that 1 is an identity element of on .
Definition 1.5.5
If * is a binary operation on a set S with identity e, then for a S , the element a 1 , called
the inverse of a, exists if and only if
a * a 1 e a 1 * a.
The inverse of a under addition is a since
a (a) 0 a a.
1
The inverse of a under multiplication is since
a
1 1
a 1 a.
a a
1
NOTE: The notation a 1 for the inverse of a S does not necessarily mean .
a
THE END!