MAT101

(Logic and Set Theory)

Roselainie D. Macapodi, PhD

Mathematics Department
Mindanao State University-Main Campus
Marawi City

MAT101 - Logic and Set Theory

Introduction to Set

MAT101 - Logic and Set Theory

Sets

Definition
A set is a well-defined collection of distinct objects.
Well-defined means that it must be clear from the way the set
is described whether any given object is in the set or not in the
set.
Example:
1. {a, b, c, d} is a set
2. {a, a, b, c, d} is not a set because a appears twice.
3. The collection of positive numbers less than 10.
4. The collection of integers between 1 to 2.
5. The collection of the best movie of all times.

MAT101 - Logic and Set Theory

Sets

Definition
If A is a set and x is an entity in A, we write x ∈ A and say
that x is an element of A.
To write x ∈ / A is to mean that x is not an element of A.
Methods of Writing a Set
A. Roster/Listing method
- a method that lists down the elements of the set.
- elements of the set are enclosed in curly braces,{}, and
separated by commas

MAT101 - Logic and Set Theory

Sets

Methods of Writing a Set

A. Roster/Listing method
- a method that lists down the elements of the set.
- elements of the set are enclosed in curly braces, {}, and
separated by commas
Example:
Let B be the set of whole numbers less than 6.

B = {0, 1, 2, 3, 4, 5}

Let C be the set of months of the year that start with the
letter J.
C = {January, June, July}

MAT101 - Logic and Set Theory

Sets

Methods of Writing a Set

B. Descriptive/Rule method (Set-builder notation)
- describes every element of the set using a variable or giving
a specific rule for determining the elements of the set.
- the set is specified in the form {x : P (x)}, which is read
“the set of all x such that P (x) is true.”
Example:
F = {a, e, i, o, u}

F = {y : y is a vowel in the English Alphabet}

G = {1, 2, 3, 4, 5, . . .}

G = {z : z is a natural number}

MAT101 - Logic and Set Theory

MORE EXAMPLES

MAT101 - Logic and Set Theory

Sets

Definition
The empty set, denoted by ∅ or { } is a set containing no
objects.

Definition
Let A and B be any two sets. If every element of a set A also
belongs to a set B, we say that A is a The subset of the set B
and write A ⊆ B or B ⊇ A.

MAT101 - Logic and Set Theory

Sets

Remark
1. Two sets A and B are equal, if they have the same
element, denoted by A = B, that is, A = B if and only if
A ⊆ B and B ⊆ A.
2. If A ⊂ B but A 6= B, (i.e, B contains some elements not in
A), A is a proper subset of B.
3. ∅ ⊂ A, for every set A.

MAT101 - Logic and Set Theory

Sets

Definition
A set A is said to be finite if it is either empty or it has n
elements for some n ∈ N.
A set A is said to be infinite if it is not finite.

Definition
The cardinality of a set is its size. For a finite set, the
cardinality of a set is the number of members it contains. In
symbol, the cardinality of a set A is written |A|.

MAT101 - Logic and Set Theory

Sets

Definition
The cardinality of a set is its size. For a finite set, the
cardinality of a set is the number of members it contains. In
symbol, the cardinality of a set A is written |A|.

Example:
1. If A = ∅, the cardinality is |A| = 0.
2. If M = {0, 1, 2, 5}, the cardinality is |M | = 4.
3. If B = {0, 1, 2, ∅, {2, 4}}, the cardinality is |B| = 5.

MAT101 - Logic and Set Theory

Sets

Definition
Let A be a set. The power set of A is the set where elemets
are the subsets of A and is denoted by P (A). Thus,
P (A) = {B : B ⊆ A}

Theorem
If |A| = n, then |P (A)| = 2n .

MAT101 - Logic and Set Theory

Sets

Example:
1. The set ∅ has 0 elements. The power set is P (∅) = {∅},
which has |P (∅)| = 20 = 1 elements.
2. The set A = {0, 1, 2} has three elements. The power set is
P (A) = {∅, {0}, {1}, {2}, {0, 1}, {0, 2}, {1, 2}, {0, 1, 2}}
which has |P (A)| = 23 = 8 elements.

MAT101 - Logic and Set Theory

Sets
Set Operations
Definition
Let A and B be sets.
The union of A and B is the set

A ∪ B = {x : x ∈ A ∨ x ∈ B}.

The intersection of A and B is the set

A ∩ B = {x : x ∈ A ∧ x ∈ B}.

The difference of A and B is the set

A − B = {x : x ∈ A ∧ x ∈
/ B}.

MAT101 - Logic and Set Theory

Sets

Definition
Two sets are disjoint if A ∩ B = ∅

Definition
Let U be the universe and A ⊆ U . The complement of A is
the set
A0 = {x : x ∈ U ∧ x ∈
/ A}.

MAT101 - Logic and Set Theory

Sets

Example:
A. Let A = {0, 1, 2, 3} and {−1, 2, 3, 4, 5}. Then
1 A ∪ B = {−1, 0, 1, 2, 3, 4, 5}
2 A ∩ B = {2, 3}
3 A − B = {0, 1}
4 B − A = {−1, 4, 5}
B. Let U = {−2, −1, 0, 1, 2, 3, 4} and C = {0, 1, 2, 4}. Then

C 0 = {−2, −1, 3}.

MAT101 - Logic and Set Theory

Sets

Definition
Let A and B be two sets. The Cartesian product of these
sets is the set

A × B = {(a, b) : a ∈ A ∧ b ∈ B}

This is the set of all ordered pairs such that the first entry
comes from A and the second entry comes from B. We will
often refer to A × B just as the product of A and B.

MAT101 - Logic and Set Theory

Sets

Remark
A × B 6= B × A

Proposition
Let A and B be finite sets, with |A| = m and |B| = n. Then
A × B is a finite set,with |A × B| = mn.

MAT101 - Logic and Set Theory

Sets

Example:
Let A = {a, b, c} and B = {0, 1, 2}. Then

1. A×B = {(a, 0), (a, 1), (a, 2), (b, 0), (b, 1), (b, 2), (c, 0), (c, 1), (c, 2)}

2. B×A = {(0, a), (0, b), (0, c), (1, a), (1, b), (1, c), (2, a), (2, b), (2, c)}

MAT101 - Logic and Set Theory

Families of Sets

MAT101 - Logic and Set Theory

Families of Sets

When every element of a set A is itself a set, then we often call

A a family or a collection of sets.
Definition
Let A be a family of sets which are all subsets of a universe U .
Then
The union over A is
[
A = {x : x ∈ A for some A ∈ A }
A∈A

The intersection over A is

\
A = {x : x ∈ A for every A ∈ A }
A∈A

MAT101 - Logic and Set Theory

Families of Sets

Example 1:
Let A1 = {−3, −2, −1, 2}, A2 = {−1, 0, 1, 5}, A3 = {−4, 1, 3, 4},
A4 = {0, 2, 5}. Then
4
[
1. Ai = A1 ∪ A2 ∪ A3 ∪ A4
i=1
= {−4, −3, −2, −1, 0, 1, 2, 3, 4, 5}
4
\
2. Ai = A1 ∩ A2 ∩ A3 ∩ A4
i=1
= ∅

MAT101 - Logic and Set Theory

Families of Sets

Example 2:  
1
For i ∈ N. Let Bi = 0, . Then
i
9
1 1 1 1 1 1 1 1
               
1.
[
Bi = [0, 1) ∪ 0, ∪ 0, ∪ 0, ∪ 0, ∪ 0, ∪ 0, ∪ 0, ∪ 0,
i=1 2 3 4 5 6 7 8 9
= [0, 1)
9
1 1 1 1 1 1 1 1
               
2.
\
Bi = [0, 1) ∩ 0, ∩ 0, ∩ 0, ∩ 0, ∩ 0, ∩ 0, ∩ 0, ∩ 0,
i=1 2 3 4 5 6 7 8 9
h 
= 0, 9 1

50
1 1 1 1 1 1 1
             
3.
\
Bi = 0, ∩ 0, ∩ 0, ∩ 0, ∩ 0, ∩ 0, ∩ . . . ∩ 0,
i=20 20 21 22 23 24 25 50
h 
= 0, 501

∞      
\ 1 1 1
4. Bi = [0, 1) ∩ 0, ∩ 0, ∩ 0, ∩ . . . = {0}
2 3 4
i=1

MAT101 - Logic and Set Theory

Families of Sets

Definition
Let Λ be a nonempty set and suppose that for each j ∈ Λ, there
is a corresponding set Aj . The family of sets {Aj |j ∈ Λ} is
called an indexed family of sets indexed by Λ. Each j ∈ Λ is
called an index and Λ is called an indexing set.

Definition
Let Λ be a nonempty indexing set and let A = {Aj |j ∈ Λ} be
an indexed family of sets. The union over Λ is defined as the
set of all elements that are in at least one of sets Aj , where
j ∈ Λ . We write
[
Aj = {x ∈ U : ∃j ∈ Λ, x ∈ Aj }.
j∈Λ

MAT101 - Logic and Set Theory

Families of Sets

Definition
Let Λ be a nonempty indexing set and let A = {Aj |j ∈ Λ} be
an indexed family of sets.
The union over Λ is defined as the set of all elements that are
in at least one of sets Aj , where j ∈ λ . We write
[
Aj = {x ∈ U : ∃j ∈ Λ, x ∈ Aj }.
j∈Λ

The intersection over Λ is the set of all elements that are in

all of the sets Aj for each j ∈ Λ. That is,
\
Aj = {x ∈ U : ∀j ∈ Λ, x ∈ Aj }
j∈λ

MAT101 - Logic and Set Theory

Example 1: Let Λ = {1, 2, 3, 4}, and for each j ∈ Λ, let
Aj = {2j − 1, 3j + 1} and A = {A1 , A2 , A3 , A4 }.
Determine A1 , A2 , A3 and A4 .
A1 = {1, 4}
A2 = {3, 7}
A3 = {5, 10}
A4 = {7, 13}
Example 2: Let Λ = N, and for each j ∈ Λ, let
Bj = {−j, 0, j}. Then
[ [ ∞
[
Bj = Bj = Bj = Z
j∈Λ j∈N j=1

and
\ \ ∞
\
Bj = Bj = Bj = {0}.
j∈Λ j∈N j=1

MAT101 - Logic and Set Theory

Venn diagram

In the late 1800s, an English logician named John Venn

developed a method to represent relationship between sets. He
represented these relationships using diagrams, which are now
known as Venn diagrams. A Venn diagram represents a set as
the interior of a circle. Often two or more circles are enclosed in
a rectangle where the rectangle represents the universal set.
Definition
A Venn diagram is a technique used for picturing set
relationships.

MAT101 - Logic and Set Theory

Example 1: A certain number of children were asked about
their choices between ice cream and french fries. 14 of them
chose ice cream, 25 chose french fries and 9 chose both. None of
them disliked both. Find the total number of children.

MAT101 - Logic and Set Theory

Example 2: 50 nurses working for a particular agency were
asked if they had worked in private or public hospitals in the
past two years. There were 11 who said they had worked in
neither while 17 said they had worked in both. If 27 had
worked in private during this time, how many nurses had
worked in private but not in public hospitals during this time?
How many had worked in public but not in private hospitals
during this time?

MAT101 - Logic and Set Theory

Theorems and Results about Sets

Theorem
Let A, B and C be subsets of the universal set U . Then
1. A ⊆ A ∪ B
2. A ∩ B ⊆ A
3. A ∩ U = A; A ∪ ∅ = A (Identity Laws)
4. A ∪ U = U ; A ∩ ∅ = ∅ (Domination Laws)
5. A ∪ A = A; A ∩ A = A (Idempotent Laws)
6. (A0 )0 = A (Complementation Laws)
7. A ∪ B = B ∪ A; A ∩ B = B ∩ A (Commutative Laws)

MAT101 - Logic and Set Theory

Theorems and Results about Sets

Theorem
8. A ∪ (B ∪ C) = (A ∪ B) ∪ C; A ∩ (B ∩ C) = (A ∩ B) ∩ C
(Associative Laws)
9. A∪(B∩C) = (A∪B)∩(A∩C); A∩(B∪C) = (A∩B)∪(A∩C)
(Distributive Laws)
10. (A ∩ B)0 = A0 ∪ B 0 ; (A ∪ B)0 = A0 ∩ B 0 (De Morgan’s Laws)
11. A ∪ (A ∩ B) = A; A ∩ (A ∪ B) = A (Absorption Laws)
12. A ∪ A0 = U ; A ∩ A0 = ∅ (Complement Laws)
13. A − B = A ⊆ B 0
14. A − ∅ = A; A − U = ∅; ∅0 = U ; U 0 = ∅

MAT101 - Logic and Set Theory

Theorems and Results about Sets

Theorem
Let A, B and C be subsets of the universal set U . Then
1. A ⊆ B ⇐⇒ A ∪ B = B
2. A ⊆ B ⇐⇒ A ∩ B = A
3. If A ⊆ B, then A ∪ C ⊆ B ∪ C.
4. If A ⊆ B, then A ∩ C ⊆ B ∩ C.
5. A ⊆ B ⇐⇒ B 0 ⊆ A0
6. A ∩ B = ∅ ⇐⇒ A ⊆ B 0

MAT101 - Logic and Set Theory

Theorems and Results about Sets

Theorem
Let A, B, C, T and Y be sets. then
1. A × (B ∩ C) = (A × B) ∩ (A × C)
2. A × (B ∪ C) = (A × B) ∪ (A × C)
3. (A ∩ B) × C = (A × C) ∩ (A × C)
4. (A ∪ B) × C = (A × C) ∪ (B × C)
5. A × (B − C) = (A × B) − (A × C)
6. (A − B) × C = (A × C) − (B × C)
7. A × ∅ = ∅
8. If T ⊆ A, then T × B ⊆ A × B.
9. If Y ⊆ B, then A × Y ⊆ A × B.

MAT101 - Logic and Set Theory

Theorems and Results about Sets

Theorem
Let Λ be a nonempty indexing set and let A = {Aj : j ∈ Λ} be
an indexed family of sets. Then
\
1. For each i ∈ Λ, Aj ⊆ Ai
j∈Λ
[
2. For each i ∈ Λ, Ai ⊆ Aj
j∈Λ
 0
\ [
3.  Aj  = A0j
j∈Λ j∈Λ
 0
[ \
4.  Aj  = A0j
j∈Λ j∈Λ

MAT101 - Logic and Set Theory

Theorems and Results about Sets

Theorem
Let Λ be a nonempty indexing set and let A = {Aj : j ∈ Λ} be
an indexed family of sets, and let B be a set. Then
 
[ [
1. B ∩  Aj  = (B ∩ Aj )
j∈Λ j∈Λ
 
\ \
2. B ∪  Aj  = (B ∪ Aj )
j∈Λ j∈Λ

MAT101 - Logic and Set Theory