Scribd
Upload
17 views5 pages

Theory of Sets

Math notes

Uploaded by

giftsimasiku115
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
17 views5 pages

Theory of Sets

Math notes

Uploaded by

giftsimasiku115
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 5

MATHEMATICS EDUCATION PTDP 1.

1
LECTURE 2
INTRODUCTION TO THE THEORY OF SETS

Chapter Outline
 Definitions and Notations of Sets
 Types of Sets
 Operations on Sets
 Laws of Set Algebra

Definitions and Notations of Sets


For the study of any branch of Mathematics, the notion of a set are basic.
Hence, this chapter will describe some of these notions which are essential
for the study of Mathematics.
Definition 1.19:
 A list or collection of well-defined objects is called a Set. The objects comprising a set
are called it’s members or elements.

letters i.e a, b, x, y, .... If an element a is in a set A, we write a ∈ A and say that “a is a


 Sets are denoted by capital letters i.e A, B, X, Y , ... and its elements are denoted by small

a ∈A.
member (element) of A", or that “a belongs to A". If a is not in A, then we write

Remark 1.14 (Describing a Set)

A set is normally defined by either listing its elements explicitly, or by


specifying a property that determines the elements of the set.
 Listing Method/Tabular Form : For example A = {a, e, i, o, u} denotes the set A whose
members are a, e, i, o, u. Note that the elements are separated by commas and enclosed in
braces {}.
 Rule Method /Set-builder: For example B = {x : x is an integer, x > 0} which reads “B is
the set of x such that x is an integer and x is greater than zero" denotes the set B whose
elements are positive integers.

Page 1 of 5
©KITE/PTDP/2024
Types of Sets
Definition 1.20: (Finite and Infinite Sets)
 A set is said to be finite if it contains a finite number of elements or no elements
otherwise it is infinite.

Example 1.15:
 Let X be the set of the days of the week: - X = {Monday, Tuesday, Wednesday,
Thursday, and Friday}. Then X is a finite set.
 Let Y = {2, 4, 6, 8 ...}. Then Y is infinite.
 Let P = { 1,2,3,4,5,6}, Then P is a finite set.

Definition 1.21 (Cardinal Number of a Finite Set)


 The number of elements in a given finite set A is called The number of elements/
cardinal number of elements of a finite set A and it is denoted by n (A).
Example 1.16:
Consider the sets A = {1, 3, 7, 11, 13, 17} and B = {a, b}.
Then n (A) = 6 and n (B) = 2
Definition 1.22: (Empty/Null Set)
 A set which contains no elements is called an empty or nullset, and is denoted by ∅ or {}.
The empty set is considered to be finite and a subset of every other set,

Definition 1.23: (Singleton Set)


 A singleton set is a set containing only a single element. i.e A= {3} is a singleton set
 Let A = {2}, and let B = {1, 2, 3}. Then set A is a singleton set but B is not.

Definition 1.24: (Equal and Equivalent Sets)


 Two sets A and B are said to be equal sets , if every element of A is a member of B and
every element of B is a member of A and we write A = B. That is, A and B contain
exactly the same elements.
 Two sets A and B are said to be equivalent sets and we write A ≡ B if A and B contain
the same number of elements, not necessarily exact, i.e., n (A) = n(B).

Page 2 of 5
©KITE/PTDP/2024
Definition 1.25: (Proper Subset)

one element of B that is not in set A. this case we sometimes write A ⊂ B.


 Let A and B be two sets, then set A is said to be a proper subset of A if there is at least

Definition 1.25 (Disjoint Sets)


 Two sets A and B are called disjoint Sets if they do not have any common element. i.e if
A= {1,2,3,4} and B = { 5,6,7,8} then set A and B are Disjoint.
Definition 1.26 (Universal Set)
 A set consisting of all possible elements which occurs under consideration, is called a
universal set and is denoted by U.

Number of Subset of a Finite Set


 The number of subsets of a given finite set A is defined by 2^n
Example 1.17
Consider the sets A = {1, 3} and B = {a, b, c, d, e}. Then
Number of subsets of A =2²= 4, since the subsets of A are ∅, {1}, {3} and {1, 3}.

Number of subsets of B = 32

Operations on Sets
We now define the methods of obtaining new sets from given ones.
Definition 1.27:
Let A and B be nonempty sets and U be the universal set.
 The union of two sets A and B, denoted by A ∪ B, is the set of all elements which
belong to either A or B. In set-builder notation, this is written
A ∪ B = {x : x ∈ A or x ∈ B}
 The intersection of two sets A and B, denoted by A ∪ B, is the set of all elements which
belong to both A and B. In set-builder notation, this is written
A ∩ B = {x: x ∈ A and x ∈ B}
 Complement of a Set: Let A be a Set, then the complement of set A is denoted A' it is a
set containing elements of the universal set that are not members of set A.

Page 3 of 5
©KITE/PTDP/2024
Remark 1.15
 if A ∩ B = ∅ then the sets A and B are said to be disjoint or Non-intersection.

Example 1.18:
Let U = {0, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15}. Let
A = {0, 2, 4, 6, 10, 12}, B = {0, 3, 6, 12, 15} and C = {1, 2, 3, 4, 5, 6, 7} be subsets of U.
List the following sets.
(i) A ∪ C

A ∩ (B ∪ C)
(ii) B ∩ C

(iv) B ∪ (A ∩ C)
(iii)

(v) A ∪ B
(vi) A' n C

Solutions
(i) A ∪ C = {0, 2, 4, 6, 10, 12} ∪ {1, 2, 3, 4, 5, 6, 7}
= {0, 1, 2, 3, 4, 5, 6, 7, 10, 12}.

(ii) B ∩ C = {0, 3, 6, 12, 15} ∩ {1, 2, 3, 4, 5, 6, 7}


= {3, 6}.

(iii) First determine B ∪ C = {0, 3, 6, 12, 15} ∪ {1, 2, 3, 4, 5, 6, 7}


={0, 1, 2, 3, 4, 5, 6, 7, 12, 15}. Then
A ∩ (B ∪ C) = {0, 2, 4, 6, 10, 12} ∩ {0, 1, 2, 3, 4, 5, 6, 7, 12, 15}
= {0, 2, 4, 6, 12}
(iv)First determine A ∩ C = {0, 2, 4, 6, 10, 12} ∪ {1, 2, 3, 4, 5, 6, 7}
= {2, 4, 6}. Then
B ∪ (A ∩ C) = {0, 3, 6, 12, 15} ∪ {2, 4, 6}
= {0, 2, 3, 4, 6, 12, 15}.
(v) A ∩ C = {0, 2, 4, 6, 10, 12} ∪ {1, 2, 3, 4, 5, 6, 7}
= {2, 4, 6}

Page 4 of 5
©KITE/PTDP/2024
(A ∩ C) = {2, 4, 6}

(vi) A' n C.
A' = {1,3,5,7,9,11,13,14,15}
C= {1,2,3,4,5,6,7}and so

A'nC = {1,3,5,7}

SHADING OF VENN DIAGRAMS

 Sometimes location of members of a given set is shown by shading the region occupied
by its members. The following diagrams shows the location of members in various sets.

. The end of Lecture 2


THANK YOU FOR YOUR ATTENTION

Page 5 of 5
©KITE/PTDP/2024

You might also like