Discrete Math 03

What it is and Presenting a set

Set Cardinality and Empty Set

Subsets and Supersets

Two equal sets vs Equivalent

Today’s Disjoint sets

Power Set

menu: Sets Set operations

Set Algebra Laws and Duality

Inclusion-Exclusion Principle

Partitioning a set

Set Proposition
 Yes, for sets, there’s
quite a lot on our
plate
Intermezzo
High school/middle
school maths should
have it, LTIC
 Set is defined as “group of
DISTINCT objects”
What the
• a.k.a. each member in a set
junk is a should be unique
set? Such object inside a set is
called either element or
member
 You can enumerate
• {you list each members here}

How do we Standard symbols

present a Set Generating notation
set? • {x | some conditions that x must
fulfill}

Venn Diagram
 Cardinal of a set is, TL;DR, the
quantity of the member of a set

Cardinality • Its symbol is |A| where A is a set

of a set Suppose there is a set which has

no member in it, we call it
empty set with cardinality 0 aka
zero
• You can define such a set as A={}
 A set is called a subset of others
IFF all element of the former is
element of the latter

Subset and
Three principles:
Superset
• A set is a subset of itself
• An empty set is a subset of any set
• Transitive rule: if A is subset of B and B is
subset of C, then A is subset of C
 First things first, those two are NOT
the same

Equal or
Equivalent Two sets are equal IFF A is subset of
B AND B is subset of A
?
Two sets are equivalent IFF the
cardinality of both sets are the
same (i.e., they are of the same size
 Two sets are called
disjoint if they share no
element
Disjoint • Call those A//B
sets
This can also be called
“mutually exclusive”
 Remember set-ception from last time around?
Where set can be a member of another set?

Power Set is such set-ception

Power Set Yes, Power Set of a set is a set in which its elements
are all possible subsets of the first set including the
OG set and the empty sets.
• Call it P(A)

The cardinality of power set is 2 to the power of the

cardinality of the OG set
 Intersection

Union

Set Complement

Operations Difference

Symmetric Difference

Cartesian Product
 Intersection
The ones you Union

Generalization
Cartesians
can do are: Symmetric
Differences

of Set
Operations The way you read this is
kind of like summations
aka Sigma operations
 Identity

Null/Domination

Complement

Idempotent

Laws of Involution (double-complement)

Set Algebra Absorption

Commutative

Associative

Distributive

DeMorgan
 TL;DR: a scheme where one can
switch (or complement) concept
and it still gives correct answer

Duality
DeMorgan, null/domination,
Principle identity, idempotent, absorption,
commutative, associative, and
distributive are all dual-able
• Is this “dual-able” thingy a proper word?
Am not sure
 This links tightly to cardinality
concept.
Inclusion-
Exclusion Keep in mind that an intersection of
sets will have their members
Principle counted as both member of the first
and second set
• When you count the cardinality for a union of a
set, the intersection will be counted twice,
watch the hell out
 • Partition of a set is a set of non-empty
subset that fulfills:
• Unions of such subsets will yield the
OG set
• All intersection of subsets are empty
set
• Some examples:

Set Partition • when I divided the class for group

projects, I partition the student set
into groups subsets.
• The union of all group subset is the
student set
• No intersection among all two subsets
(no students belong to two or more
groups)
 Proof of Set Propositions

• Using Venn Diagram

• Membership Tables
Additional •
•
Set Algebra
Using Definitions
topics
Multiset

• Set in which some members can

be duplicates