Slide 1 Set Theory
Slide 1 Set Theory
Slide 1 Set Theory
1
Every extraordinary feat began in ordinary circumstances. I will start my journey of success from where I am now.
Set Basics
Definition
A set is an unordered collection of objects, called elements or members
of the set. A set is said to contain its elements.
Example
People in a class: {Jui, Sujit, Salman, Koni}
Example
People in a class: {Trisha, Tanvir, Tonmoy, Keya}
6
How to describe a Set?
Three popular methods
1. Word description
Set of even counting numbers less than 10
2. The listing method / Roster method
{2, 4, 6, 8}
3. Set-builder notation
{x | x is an even counting number less than 10}
7
How to describe a Set?
1. Word description
• Make a word description of the set.
8
How to describe a Set?
2. Roster Method
• Represented by listing its elements between braces {}
• Example :
• Sometime use ellipses (...) rather than listing all elements.
• The set of positive integers less than 100 can be denoted by
{1,2,3,...,99}.
9
How to describe a Set?
3. Set-builder notation
• characterize all elements in the set by stating the property or properties they must have to
be members.
• the set O of all odd positive integers less than 10 can be written as
O = { x | x is an odd positive integer less than 10 }
O = { x ∈ Z+ | x is odd and x < 10 }
• Note that [a, b] is called the closed interval from a to b and (a, b) is
called the open interval from a to b. 11
Often used sets
• N = {0, 1, 2, 3, …} is the set of natural numbers
• Z = {…, -2, -1, 0, 1, 2, …} is the set of integers
• Z+ = {1, 2, 3, …} is the set of positive integers (a.k.a whole numbers)
– Note that people disagree on the exact definitions of whole numbers and natural numbers
B = {2, 4, 6, …….}
• E = {x | }
E = {1, 2}
13
Specifying
Specifying Sets Set
(cont.)
• A = {x: x Z, x is even, x <15 }
• B = {x: x Z, x + 4 = 3 }
B = {-1}
• C = {x: x Z, x2 + 2 = 6 }
E = {-2, +2}
14
Set - properties
15
Set Terminology : The universal set
Definition
U is the universal set – the set of all of elements (or the “universe”) from
which given any set is drawn
• For the set {-2, 0.4, 2}, U would be the real numbers
• For the set {0, 1, 2}, U could be the N, Z, Q, R depending on the context
• For the set of the vowels of the alphabet, U would be all the letters of the
alphabet
16
Set Terminology : The Empty Set
Definition
If a set has zero elements, it is called the empty (or null) set
• ≠{}
The first is a set of zero elements
The second is a set of 1 element [A set with one element is called a singleton set]
17
Venn diagrams
• Represents sets graphically
– The box represents the universal set
– Circles represent the set(s)
• Consider set S, which is the set of all b c d f
U
vowels in the alphabet g h j S
• The individual elements are usually not k l m
r s t
o u
v w x
y z
18
Set Terminology : Subset
Definition
The set A is a sub set of B if and only if every element of A is also an
element of B.
19
Set Terminology : Subset
Example
• If A = {2, 4, 6} and B = {1, 2, 3, 4, 5, 6, 7}; A is a subset of B
• If A = {1, 2, 3, 4} and B = {1, 2, 3, 4}; A is a subset of B
20
Set Terminology : Proper Subset
Definition
When a set A is a subset of a set B but that A B, we write A ⊂ B and say
that A is a proper subset of B.
• For A ⊂ B to be true, it must be the case that A ⊆ B and there must exist an
element y of B that is not an element of A.
22
Set Terminology : Set Equality
Definition
Two sets are equal if and only if they have the same elements. We write
A = B if A and B are equal sets.
• Therefore, if A and B are sets, then A and B are equal if and only if
∀x (x ∈ A ↔ x ∈ B)
23
Set Terminology : Set Equality
Example
• Let two sets A = {1, 2, 3} and B = {3, 2, 1}
then A = B (true or false?)
• Let two sets A = {1, 2, 3} and B = {3, 3, 2, 1, 2, 1}
then A = B (true or false?)
A=B?
24
Set Terminology : Set Cardinality
Definition
Let S be a set. If there are exactly n distinct elements in S where n is a
nonnegative integer, we say that S is a finite set and that n is the
cardinality of S. The cardinality of S is denoted by |S|.
The term cardinality comes from the common usage of the term cardinal number as
the size of a finite set.
25
Set Terminology : Set Cardinality
Example
• Let A be the set of odd positive integers less than 10. Then |A| = 5.
• || = 0
• = 1
26
Set Terminology : Finite Set and Infinite Set
Definition : Finite Set
27
Set Terminology : Power Set
Definition
Given a set S, the power set of S is the set of all subsets of the set S. The
power set of S is denoted by P(S).
28
Set Terminology : Cartesian Product
Definition
Let A and B be sets. The Cartesian product of A and B, denoted by A x B,
is the set of all ordered pairs (a, b) where a A and b B.
Hence A×B = {(a, b) | a ∈ A ∧ b ∈ B}.
29
Set Operations
30
Every extraordinary feat began in ordinary circumstances. I will start my journey of success from where I am now.
Set Operation
Operations
• Union ()
• Intersection ()
• Difference (-)
• Complement (“—”)
• Symmetric Difference ()
Definition
Let A and B be sets. The union of the sets A and B, denoted by A ∪ B, is
the set that contains those elements that are either in A or in B, or in both.
A U B = { x | x A x B }
32
Set Operation : Intersection
Definition
Let A and B be sets. The intersection of the sets A and B, denoted by
A∩B, is the set containing those elements in both A and B.
A B = { x | x A x B }
33
Union and Intersection in VD
34
Set Operation : Union and Intersection
Examples
A = {1, 2, 3, 4}, B = {3, 4, 5, 6, 7}, C = {2, 3, 5, 7}
• AUB= ?
• AUC= ?
• A∩B= ?
• B∩C=?
35
Disjoint Sets
Definition
Two sets are called disjoint if their intersection is the empty set.
i.e. A B = .
A B
36
Disjoint Union
Definition
• When A and B are disjoint, the disjoint union operation is well defined.
The circle above the union symbol indicates disjointedness.
U
A B
A B
37
Set Operation : principle
of inclusion–exclusion
38
Set Operation : Difference
Definition
Let A and B be sets. The difference of A and B, denoted by A−B, is the
set containing those elements that are in A but not in B. The difference of
A and B is also called the complement of B with respect to A.
A − B = { x | x ∈ A ∧ x B}
39
Set Operation : Difference
Example
• Let A = {1, 3, 5}, B = {1, 2, 3}
A – B = {5}
• Let A = {1, 3, 5, 6}, B = {1, 2, 3,9,10}
A – B = {5, 6}
40
Set Operation : Complement
Definition
Let U be the universal set. The complement of the set A, denoted by , is
the complement of A with respect to U. Therefore, the complement of the
set A is U−A.
A = {x ∈ U | x A}.
41
Set Operation : Symmetric Difference
Definition
Let A and B be sets. The symmetric difference of A and B, denoted by A
B, is the set containing those elements that are either in A or in B, but not
in both.
AB U
A B = { x | x ∈ A x B x (A }
A B
42
How to Prove a Set identities
Five Methods
43
Set identities
A = A AU = U
Identity Law Domination law
AU = A A =
AA = A
Idempotent Law (Ac)c = A Complement Law
AA = A
AB = BA (AB)c = Ac Bc
Commutative Law De Morgan’s Law
AB = BA (AB)c = Ac Bc
A(AB) = A A Ac = U
Absorption Law Complement Law
A(AB) = A A Ac =
Set identities: (A B ) C = A (B C )
Using set definition and set builder notation
45
Set identities =∪
Use set builder notation and logical equivalences
46
Set identities : A ∩ (B∪C) = (A∩B) ∪ (A∩C)
Use a membership table
47
Set identities = (∪)
Use set identity law
48
Set Identities via Venn
49
Visual DeMorgan
A: B:
50
Visual DeMorgan
A: B:
A B :
51
Visual DeMorgan
A: B:
L5 52
Visual DeMorgan
A: B:
A: B:
53
Visual DeMorgan
A: B:
A: B:
A B :
54
Visual DeMorgan
A B
=
A B
L5 55