CSC102 - Discrete Structures

(Discrete Mathematics)
Slides by Dr. Mudassar

Sets
 What is a set?
 A set is an unordered collection of “objects”
 Cities in the Pakistan: {Lahore, Karachi, Islamabad, … }
 Sets can contain non-related elements: {3, a, red, Gilgit }
 We will most often use sets of numbers
 All positive numbers less than or equal to 5: {1, 2, 3, 4, 5}
 Properties
 Order does not matter
• {1, 2, 3, 4, 5} is equivalent to {3, 5, 2, 4, 1}
 Sets do not have duplicate elements
• Consider the list of students in this class
− It does not make sense to list somebody twice
 Specifying a Set
 Capital letters (A, B, S…) for sets
 Italic lower-case letter for elements (a, x, y…)
 Easiest way: list all the elements
 A = {1, 2, 3, 4, 5}, Not always feasible!
 May use ellipsis (…): B = {0, 1, 2, 3, …}
 May cause confusion. C = {3, 5, 7, …}. What’s next?
 If the set is all odd integers greater than 2, it is 9
 If the set is all prime numbers greater than 2, it is 11
 Can use set-builder notation
 D = {x | x is prime and x > 2}
 E = {x | x is odd and x > 2}
 The vertical bar means “such that”
 Specifying a set
 A set “contains” the various “members” or
“elements” that make up the set
 If an element a is a member of (or an element of) a set
S, we use the notation a  S
• 4  {1, 2, 3, 4}
 If not, we use the notation a  S
• 7  {1, 2, 3, 4}
 Often used sets
 N = {1, 2, 3, …} is the set of natural numbers
 W = {0, 1, 2, 3, …} is the set of Whole 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
Natural numbers)
 Note that people disagree on the exact definitions of whole
numbers and natural numbers
 Q = {p/q | p  Z, q  Z, q ≠ 0} is the set of rational
numbers
 Any number that can be expressed as a fraction of two
integers (where the bottom one is not zero)
 R is the set of real numbers
 The universal set 1
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
 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 vowels in the
b c d f U
alphabet
g h j S
 The individual elements k l m
are usually not written n p q a e i
in a Venn diagram
r s t o u
v w x
y z
 Sets of sets
 Sets can contain other sets
 S = { {1}, {2}, {3} }
 T = { {1}, {{2}}, {{{3}}} }
 V = { {{1}, {{2}}}, {{{3}}}, { {1}, {{2}}, {{{3}}} } }
• V has only 3 elements!
 Note that 1 ≠ {1} ≠ {{1}} ≠ {{{1}}}
 They are all different
 The Empty Set
 If a set has zero elements, it is called the empty (or
null) set
 Written using the symbol 
 Thus,  = { }  VERY IMPORTANT
 It can be a element of other sets
 { , 1, 2, 3, x } is a valid set
≠{}
 The first is a set of zero elements
 The second is a set of 1 element
 Replace  by { }, and you get: { } ≠ {{ }}
 It’s easier to see that they are not equal that way
 Set Equality, Subsets
 Two sets are equal if they have the same elements
 {1, 2, 3, 4, 5} = {5, 4, 3, 2, 1}
 {1, 2, 3, 2, 4, 3, 2, 1} = {4, 3, 2, 1}
 Two sets are not equal if they do not have the same elements
• {1, 2, 3, 4, 5} ≠ {1, 2, 3, 4}
 Tow sets A and B are equal iff  x (x  A ↔ x  B)
 If all the elements of a set S are also elements of a set T,
then S is a subset of T
 If S = {2, 4, 6}, T = {1, 2, 3, 4, 5, 6, 7}, S is a subset of T
 This is specified by S  T meaning that  x (x  S  x  T)
 For any set S, S  S i.e. S (S  S)
 For any set S,   S i.e. S (  S)
 Subsets
 A  B means “A is a subset of B.”
 A  B means “A is a superset of B.”
 A = B if and only if A and B have exactly the
same elements.
 iff, A  B and B  A
 iff, x ((x  A)  (x  B)).
 So to show equality of sets A and B, show:
 AB
 BA
 Proper Subsets
 If S is a subset of T, and S is not equal to T, then S is
a proper subset of T
 Can be written as: R  T and R  T
 Let T = {0, 1, 2, 3, 4, 5}
 If S = {1, 2, 3}, S is not equal to T, and S is a subset of T
 A proper subset is written as S  T
  x (x  S  x  T)   x (x  S  x  T)
 Let Q = {4, 5, 6}. Q is neither a subset of T nor a proper
subset of T
 The difference between “subset” and “proper subset”
is like the difference between “less than or equal to”
and “less than” for numbers
• Is   {1,2,3}? Yes!
• Is   {1,2,3}? No!
• Is   {,1,2,3}? Yes!
• Is   {,1,2,3}? Yes!
Quiz time:
Is {x}  {x}? Yes
Is {x}  {x,{x}}? Yes
Is {x}  {x,{x}}?
Yes
Is {x}  {x}?
No
 Set cardinality
 The cardinality of a set is the number of elements in a
set, written as |A|

 Examples
 Let R = {-2, -3, 0, 1, 2}. Then |R| = 5
 || = 0
 Let S = {, {a}, {b}, {a, b}}. Then |S| = 4
 Power Sets
 Given S = {0, 1}. All the possible subsets of S?
  (as it is a subset of all sets), {0}, {1}, and {0, 1}
 The power set of S (written as P(S)) is the set of all the
subsets of S
 P(S) = { , {0}, {1}, {0,1} }
• Note that |S| = 2 and |P(S)| = 4
 Let T = {0, 1, 2}. The P(T) = { , {0}, {1}, {2},
{0,1}, {0,2}, {1,2}, {0,1,2} }
 Note that |T| = 3 and |P(T)| = 8
 P() = {  }
 Note that || = 0 and |P()| = 1
 If a set has n elements, then the power set will have
2n elements
 Tuples
 In 2-dimensional space, it is a (x, y) pair of numbers to
specify a location
 In 3-dimensional (1,2,3) is not the same as (3,2,1) –
space, it is a (x, y, z) triple of numbers
 In n-dimensional space, it is a +y
n-tuple of numbers (2,3)
 Two-dimensional space uses
pairs, or 2-tuples
 Three-dimensional space uses
triples, or 3-tuples +x

 Note that these tuples are

ordered, unlike sets
 the x value has to come first
 Cartesian products
 A Cartesian product is a set of all ordered 2-tuples where
each “part” is from a given set
 Denoted by A × B, and uses parenthesis (not curly brackets)
 For example, 2-D Cartesian coordinates are the set of all
ordered pairs Z × Z
• Recall Z is the set of all integers
• This is all the possible coordinates in 2-D space
 Example: Given A = { a, b } and B = { 0, 1 }, what is their
Cartiesian product?
• C = A × B = { (a,0), (a,1), (b,0), (b,1) }

 Formal definition of a Cartesian product:

 A × B = { (a,b) | a  A and b  B }
 Cartesian Products 2
 All the possible grades in this class will be a
Cartesian product of the set S of all the students in
this class and the set G of all possible grades
 Let S = { Alice, Bob, Chris } and G = { A, B, C }
 D = { (Alice, A), (Alice, B), (Alice, C), (Bob, A), (Bob, B),
(Bob, C), (Chris, A), (Chris, B), (Chris, C) }
 The final grades will be a subset of this: { (Alice, C), (Bob,
B), (Chris, A) }
• Such a subset of a Cartesian product is called a relation (more on
this later in the course)
 Generalized Cartesian product
• The Cartesian product of more than two sets
can also be defined.
• The Cartesian product of the sets A1, A2, …, An,
denoted by A1 × A2 × · · · ×An, is the set of
ordered n-tuples (a1, a2, . . . , an), where ai
belongs to Ai for i = 1, 2, . . . , n.
• A1 × A2 ×· · ·×An = {(a1, a2, . . . , an) | ai ∈ Ai for i
= 1, 2, . . . , n}.

10/8/2023
 Cartesian product A × B × C?
• A = {0, 1}, B = {1, 2}, and C = {0, 1, 2} ?
• The Cartesian product A × B × C consists of all
ordered triples (a, b, c), where a ∈ A, b ∈ B, and c
∈ C.
• A × B × C = {(0, 1, 0), (0, 1, 1), (0, 1, 2), (0, 2, 0), (0,
2, 1), (0, 2, 2), (1, 1, 0), (1, 1, 1), (1, 1, 2), (1, 2, 0),
(1, 2, 1), (1, 2, 2)}.

10/8/2023