Fundamental Theory of Sets
Fundamental Theory of Sets
Fundamental Theory of Sets
Theory of Sets
👉 Set Notations
👉 Two Methods of Writing Sets
👉 Kinds of Sets
👉 Venn-Euler Diagram
👉 Operations on Sets
👉 Application of the Union and Intersection of Sets
👉 Computer Representation of Sets
3
The term discrete objects refers to different kind
of things that we frequently see in our day to
day life such as cellphones, books, subjects,
What programs, numbers, computer, etc.
is By well-defined, it means that the membership
in the set should be clear.
Set? Distinct means that each object is different from
A set is any well- the other objects within the set, such that in
defined collection, cases of duplication, only one occurrence of the
group, list, aggregation, objects is listed in the set.
or class of distinct
objects.
Examples of well-defined sets:
Example:
1. A is the set of integers
2. B is the set of whole numbers less than 1
3. C is the set of positive integers less than 1
4. D is the set of all even natural numbers between 20 and
40
5. E is the set of positive prime integers between 1 and 10
6. F is the set of consonants in the word “ structures”
10
form:
List the elements of the following sets:
1.R = {Set of real numbers}
8. A = {x| x Є N, 1< x <1}
2.Q = {Set of rational numbers}
3.{M is the set of integers lying 9. B = {x| x Є Z, x is even and x >-10
between -1 and 10} 10. C = {x| x Є Z, x is composite,
4.A = {-5, -4, -3, -2, -1, 0, 1} 25<x<1}
5.{B is the set of prime numbers, x
is even} 11. D = {x| x Є W, x < 1}
6.{0} 12. E = {x| x Є Z, -8 ≤ x < 8}
7.{X is the set of colors: Red,
Kinds of Sets
1. Finite Set
A set with k distinct elements, where k Є N. The given elements
are limited or countable and its last element can be identified
2. Infinite Set
A set whose elements are unlimited or countable.
Note: the infinity of the set is denoted by three dots { …} found
at the end of the listings.
14
5. Universal Set
Set of all possible elements under consideration.
6. Equal Sets
A = B, if and only if A is a subset of B and B is a subset of A. the
symbol “≠”is used to denote if two sets are not equal.
7. Equivalent Sets
Two sets A and B are equivalent if they have exactly the same
number of elements. The symbol for set equivalence is “≈”.
17
“CONSIDERATION”
1. P = {n, e, r, c} and M = {e, c, i, t, u, a}
2. M = {a, e, i, u} and C = {n, c, r, t, i, o}
3. C = {c, o, n, s, i, d, e, r} and S = {r, a, t, i, o, n}
4. R = { } and J = {c, o, n, s, i, d, e, r, a, t}
5. W = {t, e, i, d} and Y = {c, o, n, s, r, a}
20
10. Subsets Sets
A is a subset of B denoted by A ⊆ B, if every
element of A is contained in B.
Super Sets
If A is a subset of B, then we can say that B is a
superset of A, and write B ⊇ A.
Proper Subset
A is a proper subset of B, denoted by “A ⊂ B” if A ⊆ B
and A ≠ B.
Given: C ⊆ A
A = {1, 3, 5, 8, 9} C ⊂ B
B = {1, 2, 3, 5, 7} B ⊆ A
C = {1, 5} D ⊆ E
D = {2, 4, 6} E ⊆ D
E ⊆ E
E = {6, 2, 4}
ø ⊆ E
22
following:
Power Sets
If we let A = {a, b, c}
then, |A| = 3
|P(A)| = 23 = 8
P(A) = [ ø, {a}, {b}, {c}, {a, b}, {a, c}, {b, c}, {a, b, c}]
A
25
|AxB|=|A|.|B|
28
1. A x B
2. B x C
3. C x C
29
U
A B
U B U U
A A B A B
Given:
U = {1, 2, 3, 4, 5, 6, 7, 8}
A = {1, 2, 3, 4}
B = {2, 3}
C = {1, 3, 5, 7}
U A
1 2 3 4
2 1
3
3 1
B 2 C
3 5 3
7
6 8
32
Operations on Set:
1. U
Union
AUB
U
A BB
Example 33
Given:
U = {1, 2, 3, 4, 5, 6, 7, 8}
A = {1, 2, 3, 4}
B = {2, 3}
C = {1, 3, 5, 7}
U A
4
2 1
3
B C
5
7
6 8
34
Operations on Set:
2.
Intersection
AB
U
A B
Example 35
Given:
U = {1, 2, 3, 4, 5, 6, 7, 8}
A = {1, 2, 3, 4}
B = {2, 3}
C = {1, 3, 5, 7}
U A
4
2 1
3
B C
5
7
6 8
36
Operations on Set:
3. Complement C
AC
U
A
Example 37
Given:
U = {1, 2, 3, 4, 5, 6, 7, 8}
A = {1, 2, 3, 4}
B = {2, 3}
C = {1, 3, 5, 7}
U A
4
2 1
3
B C
5
7
6 8
38
Operations on Set:
4. Difference -
A-B
U
A B
Example 39
Given:
U = {1, 2, 3, 4, 5, 6, 7, 8}
A = {1, 2, 3, 4}
B = {2, 3}
C = {1, 3, 5, 7}
U A
4
2 1
3
B C
5
7
6 8
40
Operations on Set:
5. Symmetric
Difference
AB
U
A B
Example 41
Given:
U = {1, 2, 3, 4, 5, 6, 7, 8}
A = {1, 2, 3, 4}
B = {2, 3}
C = {1, 3, 5, 7}
U A
4
2 1
3
B C
5
7
6 8
Example 42
U U U A
A B A B
B C
U-B BC - A (AC U B) - C
U A U A U A U A
B C B C B C B C
(A U B) (A U (A B) C) CC – (A B) B U (A
C) C)
Example 43
U U
A B A B
U A U A U A
B C B C B C
44
Application
Addition Principle
For two sets:
|A U B| = |A| + |B| - |A B|
|A U B| = |A| + |B|
Ex.
25
35 10 30
40
car house
25
46
2. In the college, 125 male students are enrolled in the basketball class,
135 in the chess class and 100 in the volleyball class. Of these students, 3
are in both the basketball and chess classes, 6 are in both the chess and
volleyball classes, and 4 are in both the basketball and volleyball classes.
Two of these students are enrolled in all three classes. What is the total
number of enrolment in all classes?
U B
Solution: 120
= 120 + 2 + 2 + 1 + 92 + 4 + 128 2 1
= 349 V
2
92 4 128 C
47
U B
120
2 1
2
V
92 4 128 C
1. How many male students are enrolled in exactly one of these classes?
2. How many male students are enrolled at least two of these classes?
3. How many male students are enrolled in exactly two of these classes?
4. How many male students are enrolled none of these classes?
48
Computer Representation of Sets
Rules:
0U0=0
Let U = {1, 2, 3, 4, 5, 6, 7, 8, 9} 11=1
A=111100101 1–0=1
B=010101011 11=0
Find: 00=0
1. A U B
2. A B
3. AC
4. BC
5. A – B
6. A B