Name: ______________________________________ Corse and Set: ________________

Set Theory

1. Finite Set – has limited number of elements.

Example: {x ꞓ Z+ I 5 < x < 10}

Z = {6, 7, 8, 9}
2. Countable Infinite Set – has limitless number of element but can exhibit one – to – one correspondence
between set of positive integers and the set.
Example: {x ꞓ S I x > 10}
S = {11, 12, 13, . . .}
one – to – one correspondence
n n + 10
1 11
positive 2 12 elements of set
integers 3 13

3. Uncountable Infinite Set - has limitless number of element and cannot exhibit one – to – one
correspondence between set of positive integers and the set.
Example: {x ꞓ R I 1 > x >3}
This is an example of uncountable set since Real Numbers includes many types of numbers such as
rational, irrational, integers, etc.

Activity: State the type of the following given sets. If the set is finite, name all its elements, if the set is
countable infinite set, construct the map that shows it’s one – to – one correspondence between the positive
integer and the element of set.

_____________________1. {x ꞓ N I x = 2n-1}
_____________________2. {x ꞓ Z I IxI < 20}
_____________________3. {x ꞓ F I 0 < x ꓥ x are fractions with denominator of 5}
_____________________4. {x ꞓ Q’ I 0 < x}
_____________________5. {x ꞓ N I -5 < x < 10}

I. Extensionality Axiom
A and B are said to be equal if only if they have the same element
Ɐ A, B (Ɐx (x ∈ A ↔ x ∈ B) A = B) “for every A and B IF for every x, x is belongs to A if and only if x
belongs to B then A is equal to B”
Example: {x ∈ N I 0 < x < 6}
{x ∈ B I are prime factors of 15}

N = {1, 3, 5} B = {1, 3, 5}

II. Empty Set Axiom/Axiom of Elementary Set

ⱻB Ɐ x, x ∈ B “there exists B where x is not belongs to B” it is denoted with ƃ0
Example:
A = {1, 3, 5, 7, 9}
B = {2, 4, 6, 8}
A ∩ B = { } or Ø

III. Axiom of Separation - Given two objects, there is a set whose members are exactly the two given objects.

“For any object A and any object B, there is a set C such that,

for any object D, D is a element of C if and only
if D is equal to A or D is equal to B.”
Example: A = {1, 2, 3} B = {4, 5, 6}
C = {1, 2, 3, 4, 5}
(D = A) D = {1, 2, 3}
AUC=DUC

IV. Axiom of Pairing – Given x, y, denoted by {x, y} the set satisfying axiom of pairing.
 ⱯxⱯyⱻ!AⱯz(z ∈ A (z = x V z = y)) – “For any x and y, there exists a unique set A for all z, z is
element of A if and only if z is equal to x or z is equal to y.”

Example: A = {x, y}
Let x = (1, 2, 3)
y = (4, 5, 6)
A = {{1, 2, 3}, {4, 5, 6}}
z=x z = (1, 2, 3)
A = {z, y}
A = {{1, 2, 3}, {4, 5, 6}} - unordered pair exists
V. Union Axiom – Given F, denote by UF the set existing by Union axiom.
ⱯFⱻ!AⱯx(x ∈ A ⱻY∈F(x ∈ Y)) – “For every F there exists a unique set A such that for all x is an element
of A if and only if there exists Y which are elements of F such that x is an element of Y.”

F = {{A}, {A, Y}}

Example: x ∈Y Y = {x}
Y∈A A = {Y}
A∈F F= {{A}, {A, Y}}
x = (1, 2,3)
Y = {x}
Y = {1, 2, 3}
A = {Y}
A = {1, 2, 3}
F = {{1, 2, 3}, {1, 2, 3}}
F = {1, 2, 3}
F U A U Y = F U (A U Y)

Answer of Last Activity (Algebra of Sets)

1.
?
- Given
- Identity Law
- Distributive Law
- Identity Law
- Complement Law
- Idempotent Law

2.
- Given
- Difference Law
- De Morgan’s Law
- Involution Law
-

More Exercise! Activity

Prove the following set equation

1.
2.

3. (Ac ∪ (B – C))c = A ∩ (Bc ∪ C)

4. A ∪ (B ∩ A) = A
5. (A ∩ B) ∪ (A ∩ Bc) = A