Notesale: Turn your study into money

Document Preview

Extracts from the notes are below, to see the PDF you'll receive please use the links above

---

Advance set theory:
Classifying Sets: Finite, Infinite, and Countable Sets
Sets can be categorized based on the number of elements they contain
...
Let's explore each of these categories in detail
...
Finite Sets:

A finite set is a set that contains a specific, well-defined number of elements
...
When counting the elements of a finite set, can reach a final number, and
the set is exhausted
...

The set of weekdays B= {Monday, Tuesday, Wednesday, Thursday, Friday}
Set ‘B’ is also finite since it consists of five elements
...


Countably Finite Sets:

A countably finite set is a set with a finite number of elements but can still be enumerated in a
sequence using natural numbers
...


2
...
It doesn't have a final or
fixed number of elements, and cannot exhaustively list all the elements of an infinite set
...
Examples of infinite sets
include:
The set of natural numbers {1, 2, 3, 4, 5,
...

The set of integers {
...
} is also infinite because always can find another integer
by adding or subtracting from the existing set
...


Cardinality and countability: Comparing infinite set:

In set theory, the concept of cardinality and countability is fundamental when comparing infinite sets
...
Explore the comparison of infinite sets based on their cardinality and
countability
...
Cardinality of Infinite Sets:

The cardinality of a set A is denoted as |A| and represents the number of elements in the set
...

However, when it comes to infinite sets, things become more intriguing
...
Infinite Set can classify into countable and
uncountable sets based on their cardinality
...
This means that list the elements of the set in a sequence such that every element in the set
corresponds to a unique natural number, and every natural number corresponds to a unique element
in the set
...
} is countable
...
, -3, -2, -1, 0, 1, 2, 3,
...


Uncountable Sets:

An uncountable set is an infinite set that is not countable
...
The most famous
example of an uncountable set is the set of real numbers R, which includes all rational and irrational
numbers
...
Cantor's diagonal argument is one of the classic proofs that
demonstrates the uncountability of the real numbers
...
Comparing Infinite Sets:
When comparing infinite sets, relationships can establish based on their
cardinalities:
a
...

"equipotent" refers to two sets having the same cardinality, meaning they contain the same number
of elements
...
This concept is important for comparing infinite sets, where size can be counterintuitive
...

“ bijection” is a type of function that is both injective and surjective, establishing a one-to-one
correspondence between elements of two sets
...


b
...

c
...

For example, the set of natural numbers N has the same cardinality as the set of integers Z, even
though N is a proper subset of Z
...

On the other hand, the set of real numbers R has a larger cardinality than the set of natural numbers
N, which means R is uncountably infinite and "larger" in size compared to N
...
Countable sets have the same cardinality as the set of natural numbers,
while uncountable sets have larger cardinalities and cannot be put into one-to-one correspondence
with the natural numbers
...
Zermelo-Fraenkel Set Theory (ZF) is one of the most widely
accepted axiomatic systems for set theory
...
The ZF axioms provide a foundation for modern mathematics and have
been extended to include the Axiom of Choice (AC) to create the Zermelo-Fraenkel Set Theory with
the Axiom of Choice (ZFC), which is the most commonly used set theory in mathematical practice
...
Below are the axioms of ZF:
1
...

∀x ∀y [∀z (z ∈ x ↔ z ∈ y) → x = y]
Example: Let A = {1, 2, 3} and B = {3, 2, 1}
...

2
...

Example: ∅ is the empty set, and it has no elements: ∅ = {}
...
Axiom of Pairing: For any two sets, there exists a set containing exactly those two sets as elements
...

4
...

∀x ∃y ∀z (z ∈ x → z ∈ y)
Example: If A = {{1, 2}, {3, 4}}, then the union of the elements of A is {1, 2, 3, 4}
...
Axiom of Power Set: For any set, there exists a set containing all possible subsets of the given set
...

6
...

∃x (∅ ∈ x ∧ ∀y (y ∈ x → y ∪ {y} ∈ x))
Example: The set of natural numbers ℕ = {0, 1, 2, 3,
...
Axiom of Regularity (Foundation): Every non-empty set A contains an element that is disjoint
from A
...
In this case, A contains itself as an element, and it is disjoint from itself
...
Axiom of Replacement: Given a set and a functional relationship, the image of the set under the
function is also a set
...

9
...

For any formula φ(x), the following is an axiom:
∀a ∃y ∀x (x ∈ y ↔ x ∈ a ∧ φ(x))
10
...

or any formula φ(x, y), the following is an axiom:
∀a ∃b ∀x [(x ∈ a ∧ ∃y φ(x, y)) → ∃y (y ∈ b ∧ ∀x (x ∈ a ∧ φ(x, y) → x ∈ y))]

Additionally, the Axiom of Choice (AC) can be added to the ZF axioms to form ZFC
...
It allows for the construction of certain sets that might not be
explicitly definable using the other axioms
...
However, it is essential to note that
there are alternative axiomatic set theories, such as von Neumann-Bernays-Gödel set theory (NBG),
which extends ZFC to include classes and avoids certain inconsistencies that arise in ZFC
...
In this context, we will focus on two fundamental concepts in order theory: partial
orders and well-ordering principles
...
Let's define these
terms:

a) Reflexive: For every element "a" in a set "A," (a, a) is in the relation
...


b) Antisymmetric: For any elements "a" and "b" in "A," if (a, b) and (b, a) are in the relation, then
"a" must be equal to "b
...


c) Transitive: For any elements "a," "b," and "c" in "A," if (a, b) and (b, c) are in the relation, then (a,
c) must also be in the relation
...


A partially ordered set (p
...
set) is a pair (A, ≤), where "A" is a set, and "≤" is a partial order on "A
...
Elements "a" and "b" in "A" are said to be
comparable if either (a, b) or (b, a) is in the relation
...

Example: Consider the set of natural numbers {1, 2, 3, 4, 5} with the relation "≤" defined as follows: (a,
b) is in the relation if and only if "a" divides "b" (i
...
, b is a multiple of a)
...


Well-Ordering Principles:

The well-ordering principle states that every non-empty subset of a well-ordered set has a smallest
element
...

Formally, a well-ordered set is a p
...
set in which every non-empty subset has a minimum element
...
} with the usual order "≤" is a well-ordered set
...

Well-ordering principles are particularly useful in mathematical proofs and reasoning, especially in
induction proofs
...
A well-ordering principle states that every non-empty subset of a wellordered set has a smallest element
...


Transfinite Numbers: Unveiling the Mysteries of Infinity :

In the realm of set theory, a fascinating concept that defies traditional notions of numbers and
countability emerges - Transfinite Numbers
...
This topic provide an overview of transfinite numbers and
their role in unraveling the mysteries of infinity
...
The Infinity Conundrum:
Infinity, the concept of being boundless and unbounded, has perplexed mathematicians and
philosophers for centuries
...
In set theory, mathematicians have attempted to formalize and
study these infinite sets using transfinite numbers
...
George Cantor and the Birth of Transfinite Numbers:
The groundwork for transfinite numbers was laid by the German mathematician Georg Cantor in the
late 19th century
...
He discovered that some infinite sets are larger than others, giving rise to
different sizes of infinity
...
Cardinality and Aleph Numbers:
In Cantor's theory, he introduced the notion of "cardinality" to quantify the size of sets, including
infinite sets
...
The smallest infinite set, representing the
set of natural numbers, is denoted by ℵ ₀ (alpha-null)
...
Ordinal Numbers and Beyond:
Cantor's exploration of transfinite numbers extended beyond cardinality to the realm of "ordinal
numbers
...
Cantor showed that ordinals could also be used to represent different sizes of infinity,
leading to a deeper understanding of the infinite hierarchy
...
The Continuum Hypothesis:
Cantor's work led to a profound question known as the Continuum Hypothesis
...
It was finally resolved using advanced
set-theoretical tools, known as forcing, by Paul Cohen in 1963
...
Impact on Mathematics and Philosophy:
The study of transfinite numbers has had a profound impact on various branches of mathematics,
including real analysis, topology, and logic
...

7
...
The notion of "infinite sets" and
"uncountable infinities" has led to intriguing discussions about the nature of space-time and the
boundaries of our observable universe
...
From Cantor's foundational
work to modern applications in physics, these numbers continue to inspire researchers and
philosophers alike, pushing the boundaries of human comprehension and unlocking the mysteries of
infinity
...




---