Cantors Algebra of Sets

Cantor’s Algebra of Sets
Arellano, Angelica
Gorospe, Geelan
Sebastian, Kevin
Cortez, Ryan
TOPIC 1:
Class Construction of Axiom
TOPIC 2:
Class Operations
TOPIC 3:
Russel’s Paradox
• CANTORS POWERCLASS THEOREM ALSO KNOWN AS POWERSET
THEOREM OR CANTORS THEOREM (1891)
= the power set of any set is always strictly larger in cardinality which
means that the power set of any set will always have more elements
than the original set
• Power set (the set of all subsets of x) can be used to create larger and
larger infinite sets.
• Cantors paradox
If  then, there is non exist function of x that goes to the power set of
x, such that it is surjection-for every output there is an input that maps
to that output
Proof:
Let A be a finite set, andP (A) be its power set. Then
A<P (A)
Ex:
Let A=1,2,3,so
P (A) = , 1 ,  2  , 3  ,1,2 ,  1,3  , 2,3  , 1,2,3 
• Cantors paradox
If  then, there is non exist function of x that goes
to the power set f x, such that it is surjection-for every
output there is an input that maps to that output

Cantors set
is the set of all numbers between 0 and 1 that
can be written in base 3 using only the digits 0
and 2
TOPIC 1
CLASS
CONSTRUCTION
OF AXIOM
CLASS
CONSTRUCTION
OF AXIOM
Axioms A1 and A2 are used to construct

classes.
Axioms A3 to A5 are used as tools to
construct sets.
symbols should be interpreted:
∈ is given the meaning “is an element of”
∨ is given the meaning “or”
∧ is given the meaning “and”
¬ is given the meaning “not”
⇒ is given the meaning “implies”
∃ is given the meaning “there exists”
∀ is given the meaning “for all”
Theorem 1
For any class C, C = C.
This follows from axiom A1:
Since x ∈ C ⇒ x ∈ C and x ∈ C ⇒ x ∈ C then C = C.
If the statement “A = B” is false then we will write A B

Theorem 2
If C, D, and E are classes (sets) then:
a) C = D ⇒ D = C.
b) C = D and D = E ⇒ C = E.
c) C ⊆ D and D ⊆ C ⇒ C = D.
d) C ⊆ D and D ⊆ E ⇒ C ⊆ E.
Theorem 3
There exists a class which is not an element.
Proof: Let C be the class C = {A : A is an element and A
satisfies ¬(A ∈ A)} = {x : x 6∈ x} By Axiom A2, the class C
is well-defined. Suppose C is an element. Then either C
belongs to {x : x 6∈ x} or it doesn’t. Both of these options
lead to a contradiction. Then C is not an element, as
required.
• Theorem 4
For any class C, ∅ ⊆ C.
Proof: Let C be a class. To show that ∅ ⊆ C it suffices to
show, by definition of “⊆”, that x ∈ ∅ ⇒ x ∈ C. Any
element in ∅ belongs to C since ∅ contains no elements;
then ∅ ⊆ C, as required.1
Theorem 5
Let S be a set.
Then: a) ∅ ⊆ S and so ∅ is a set. b) The set S is an element. Hence,
“All sets are elements”. Proof: a) We are given that S is a set. We
are required to prove that ∅ is a set. We can directly apply
axiom A4: Since ∅ = {x ∈ S : x 6= x} and, by hypothesis, S is a set
then, by A4, ∅ is a set as required. b) We are given that S is a set.
We are required to prove that S is an element. By axiom A3
(Axiom of pair), for any set S, {S, S} is a set. Since S ∈ {S, S}, for all
sets S, then, by definition, S is an element, as required.
Power sets
Axiom A3 allows us to construct new sets from known
ones by forming doubleton sets, while Axiom A4 allows
us to construct sets by taking subclasses of sets and
calling them subsets. Axiom A5 will allow us to construct,
from a known set A, what seems to be a larger set, P(A). It
is called the power set of A. We define “power set”.
TOPIC 2
CLASS
OPERATIONS
Unions, intersections and complements of classes. The union and
intersection of classes is a method for constructing new classes and sets
from old ones. We begin by defining these formally.
Let A and B be classes (sets). We define the union, A ∪ B, of the class A

and the class B as A ∪ B = {x : (x ∈ A) ∨ (x ∈ B)} That is, x ∈ A ∪ B if
and only if x ∈ A or x ∈ B. If A is a non-empty class of classes then we
define the union of all classes in A as [ C∈A C = {x : x ∈ C for some C ∈ A }
That is, x ∈ S C∈A C if and only if there exists C ∈ A such that x ∈ C
Venn diagrams.
We often use Venn diagrams as a tool to visualize
how sets relate to others. Venn diagrams should not
be substitutes for proofs of statement; but they are
helpful when used to guide our intuition.
Let C and D be classes (sets).
Then
a) C ⊆ C ∪ D
b) C ∩ D ⊆ C
Proof:
a) a) Let x ∈ C. It suffices to show that x ∈ C ∪ D. x ∈ C
⇒ x ∈ {x : x ∈ C or x ∈ D} ⇒ x ∈ C ∪ D
Let C and D be classes (sets). Then
a) C ∪ (C ∩ D) = C b) C ∩ (C ∪ D) = C
Proof:
a) What we are given: C and D are classes (sets).
What we are required to show: C ∪ (C ∩ D) = C C ⊆ C ∪ (C ∩ D)
C ∩ D ⊆ (C ∩ D) ∪ C
x ∈ (C ∩ D) ∪
C⇒x∈C∩D
or x ∈ C ⇒ x ∈ C
or x ∈ C (says C ∩ D ⊆ C) ⇒ x ∈ C ⇒ (C ∩ D) ∪ C ⊆ C So C ⊆ C ∪ (C ∩ D) and (C
∩ D) ∪ C ⊆ C implies C ∪ (C ∩ D) = C (Def. of equal classes).
Let C be a class (a set).
Then (C 0 ) 0 = C.
Proof:
x ∈ (C 0 ) 0 ⇒ x C 0 ⇒ x ∈ C ⇒ (C 0 ) 0 ⊆ C x ∈ C ⇒ x  C
0 ⇒ x ∈ (C 0 ) 0 ⇒ C ⊆ (C 0 ) 0 (C 0 ) 0 ⊆ C C ⊆ (C 0 ) 0 ⇒ (C 0 )
0=C
(De Morgan’s laws)
Let C and D be classes (sets).
Then a) (C ∪ D) 0 = C 0 ∩ D
b) (C ∩ D) 0 = C 0 ∪ D0
Proof:
a) Given: C and D are classes (sets). x ∈ (C ∪ D) 0 ⇒ x 6∈ C ∪ D (By
definition 3.4) ⇒ x 6∈ C and x 6∈ D (For if x ∈ C or ∈ D, then x ∈ C ∪ D)
⇒ x ∈ C 0 ∩ D 0 ⇒ (C ∪ D) 0 ⊆ C 0 ∩ D 0 Next x ∈ C 0 ∩ D 0 ⇒ x ∈ C 0
and x ∈ D 0 ⇒ x 6∈ C and x 6∈ D ⇒ x 6∈ C ∪ D (For if x ∈ C ∪ D, then x
∈ C or x ∈ D) ⇒ x ∈ (C ∪ D) 0 (⇒ C 0 ∩ D0 ⊆ (C ∪ D) 0 (C ∪ D) 0 ⊆ C 0 ∩ D0
C 0 ∩ D0 ⊆ (C ∪ D) 0 ⇒ (C ∪ D) 0 = C 0 ∩ D 0
Let C, D and E be classes (sets).
Then a) C ∪ D = D ∪ C and C ∩ D = D ∩ C (Commutative
laws) b) C ∪ C = C and C ∩ C = C (Idempotent laws) c) C ∪
(D ∪ E) = (C ∪ D) ∪ E and C ∩ (D ∩ E) = (C ∩ D) ∩ E
(Associative laws) d) C ∪ (D ∩ E) = (C ∪ D) ∩ (C ∪ E) and C ∩
(D ∪ E) = (C ∩ D) ∪ (C ∩ E) (Distribution)
A be a class and U denote the class of all elements.
a) U ∪ A = U
b) A ∩ U = A
c) U 0 = ∅
d) ∅0 = U e
) A ∪ A0 = U
Proof: a) U ⊆ U ∪ A. If x ∈ U ∪ A, then x ∈ A or x ∈ U . In either case

x is an element and so x ∈ U . Thus, U ∪ A ⊆ U . Hence, U ∪ A = U .
TOPIC 3
RUSSELL’S PARADOX
• Paradoxon–contrary to expectation
• Paradox- a statement that contradicts itself or that
must be both true and untrue at the same time.
-Also known as antimony
-It is logically self contradictory statement.
Ex. This sentence is a lie.

Cantors Algebra of Sets

Uploaded by

Copyright:

Available Formats

Cantors Algebra of Sets

Uploaded by

Document Information

Original Description:

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Cantors Algebra of Sets

Uploaded by

Copyright:

Available Formats

Cantor’s Algebra of Sets

Let A be a finite set, andP (A) be its power set. Then

Axioms A1 and A2 are used to construct

If the statement “A = B” is false then we will write A B

Let A and B be classes (sets). We define the union, A ∪ B, of the class A

Proof: a) U ⊆ U ∪ A. If x ∈ U ∪ A, then x ∈ A or x ∈ U . In either case

You might also like