Graduate
  1. Real Analysis  1.1. Set Theory and Logic  1.1.1. Sets and Operations  1.1.2. Relations and Functions  1.1.3. Logic and Quantifiers  1.1.4. Cardinality of Sets  1.2. Metric Spaces  1.2.1. Open and Closed Sets  1.2.2. Convergence of Sequences  1.2.3. Continuous Functions in Metric Spaces  1.2.4. Compactness and Completeness in Metric Spaces in Real Analysis  1.3. Sequence and Series  1.3.1. Convergence of Sequences  1.3.2. Infinite Series  1.3.3. Uniform Convergence  1.3.4. Power Series  1.4. Differentiation  1.4.1. Mean Value Theorems  1.4.2. Taylor Series  1.4.3. Functions of Several Variables  1.4.4. Partial Derivatives  1.5. Integration  1.5.1. Riemann and Lebesgue Integration  1.5.2. Improper Integrals  1.5.3. Measure Theory  1.5.4. Fubini’s Theorem  1.6. Functional Analysis  1.6.1. Banach Spaces  1.6.2. Hilbert Spaces  1.6.3. Operators on Spaces  1.6.4. Spectral Theory
  2. Abstract Algebra  2.1. Groups  2.1.1. Definitions and Examples in Groups in Abstract Algebra  2.1.2. Group Homomorphisms  2.1.3. Normal Subgroups  2.1.4. Sylow Theorems  2.2. Rings and Fields  2.2.1. Ideals and Factor Rings  2.2.2. Field Extensions  2.2.3. Galois Theory  2.2.4. Polynomial Rings  2.3. Modules  2.3.1. Module Homomorphisms  2.3.2. Free Modules  2.3.3. Tensor Products  2.3.4. Exact Sequences  2.4. Linear Algebra  2.4.1. Vector Spaces  2.4.2. Eigenvalues and Eigenvectors  2.4.3. Inner Product Spaces  2.4.4. Diagonalization
  3. Topology  3.1. General Topology  3.1.1. Open and Closed Sets  3.1.2. Compactness and Connectedness  3.1.3. Continuous Maps  3.1.4. Separation Axioms  3.2. Algebraic Topology  3.2.1. Fundamental Groups  3.2.2. Homotopy and Homology  3.2.3. Simplicial Complexes  3.2.4. Exact Sequences in Homology  3.3. Differential Topology  3.3.1. Manifolds  3.3.2. Smooth Functions  3.3.3. Tangent and Cotangent Spaces  3.3.4. Vector Bundles
  4. Differential Equations  4.1. Ordinary Differential Equations  4.1.1. First-Order Equations  4.1.2. Second-Order Linear Equations  4.1.3. Systems of Differential Equations  4.1.4. Stability Analysis  4.2. Partial Differential Equations  4.2.1. Classification of PDEs  4.2.2. Fourier Series  4.2.3. Green's Functions  4.2.4. Method of Characteristics  4.3. Dynamical Systems  4.3.1. Stability Theory  4.3.2. Limit Cycles  4.3.3. Chaos Theory  4.3.4. Bifurcation Theory
  5. Probability and Statistics  5.1. Probability Theory  5.1.1. Random Variables  5.1.2. Probability Distributions  5.1.3. Law of Large Numbers  5.1.4. Central Limit Theorem  5.2. Statistical Inference  5.2.1. Hypothesis Testing  5.2.2. Confidence Intervals  5.2.3. Bayesian Methods  5.2.4. Maximum Likelihood Estimation  5.3. Stochastic Processes  5.3.1. Markov Chains  5.3.2. Brownian Motion  5.3.3. Poisson Processes  5.3.4. Martingales
  6. Numerical Analysis  6.1. Numerical Solutions of Equations  6.1.1. Root Finding  6.1.2. Iterative Methods  6.1.3. Convergence Analysis  6.1.4. Error Bounds in Numerical Solutions of Equations  6.2. Numerical Linear Algebra  6.2.1. Matrix Factorizations  6.2.2. Eigenvalue Computations  6.2.3. Sparse Matrices  6.2.4. Preconditioning Techniques  6.3. Numerical Integration and Differentiation  6.3.1. Quadrature Methods  6.3.2. Finite Differences  6.3.3. Error Analysis in Numerical Integration and Differentiation  6.3.4. Adaptive Methods
  7. Complex Analysis  7.1. Complex Numbers  7.1.1. Polar Form  7.1.2. Complex Conjugates  7.1.3. Exponential Form  7.1.4. Roots of Unity  7.2. Analytic Functions  7.2.1. Cauchy-Riemann Equations  7.2.2. Power Series  7.2.3. Conformal Mappings  7.2.4. Harmonic Functions  7.3. Integration in the Complex Plane  7.3.1. Cauchy’s Theorem  7.3.2. Residue Theorem  7.3.3. Contour Integration  7.3.4. Integral Transforms
  8. Mathematical Logic and Foundations  8.1. Propositional Logic  8.1.1. Truth Tables  8.1.2. Logical Equivalences  8.1.3. Proof Techniques in Propositional Logic  8.1.4. Resolution  8.2. Predicate Logic  8.2.1. Quantifiers in Predicate Logic  8.2.2. Formal Systems in Predicate Logic  8.2.3. Completeness and Soundness  8.2.4. Model Theory  8.3. Set Theory  8.3.1. Cardinality and Ordinality  8.3.2. Axiomatic Systems  8.3.3. Zermelo-Fraenkel Set Theory  8.3.4. Forcing
  9. Optimization  9.1. Linear Programming  9.1.1. Simplex Method  9.1.2. Duality in Linear Programming  9.1.3. Sensitivity Analysis  9.1.4. Interior Point Methods  9.2. Nonlinear Programming  9.2.1. Gradient Descent  9.2.2. Lagrange Multipliers  9.2.3. Convex Optimization  9.2.4. Quadratic Programming  9.3. Combinatorial Optimization  9.3.1. Graph Algorithms  9.3.2. Integer Programming  9.3.3. Network Flows  9.3.4. Approximation Algorithms
  10. Discrete Mathematics  10.1. Graph Theory  10.1.1. Graph Representations  10.1.2. Planarity and Coloring  10.1.3. Shortest Path Algorithms  10.1.4. Network Flows  10.2. Combinatorics  10.2.1. Permutations and Combinations  10.2.2. Generating Functions  10.2.3. Recurrence Relations  10.2.4. Inclusion-Exclusion Principle  10.3. Cryptography  10.3.1. Number Theory Applications in Cryptography  10.3.2. Symmetric and Asymmetric Cryptography  10.3.3. RSA and Elliptic Curve Cryptography  10.3.4. Post-Quantum Cryptography

Graduate → Mathematical Logic and Foundations → Set Theory ↓


Zermelo-Fraenkel Set Theory


Zermelo-Fraenkel set theory, commonly abbreviated as ZF, is a framework that forms the foundation of much of modern mathematics. It is a formal system that defines what sets are and how they behave. This framework was created to overcome the paradoxes that emerged from naive set theory and provide a more robust foundation for mathematics. Let's explore the key components and axioms of Zermelo-Fraenkel set theory with simple language and examples.

Basic concepts of set theory

Before delving into the specifics of Zermelo–Fraenkel set theory, it is important to familiarize ourselves with some basic concepts of set theory:

  • Set: A collection of distinct objects, considered as an object in its own right. Sets are usually represented by capital letters such as A, B, C.
  • Element: An object inside a set, often denoted as a, b, c. For example, in the set A = {1, 2, 3}, the number 1 is an element of the set A.
  • Subset: A set A is a subset of a set B if all the elements of A are also elements of B. We write this as A ⊆ B.

The symbol ∅ (read as "empty set") represents a set that contains no elements.

Axioms of Zermelo–Fraenkel set theory

Zermelo-Fraenkel set theory is based on a series of axioms, each of which specifies the properties and operations that sets can perform. Let's examine each of these axioms using examples and visual representations for clarity.

Axiom 1: Axiom of expandability

The axiom of extensionality states that two sets are equal if their elements are exactly the same. Formally, if x ∈ A if and only if x ∈ B for all elements x, then A = B.

    A = {1, 2, 3} B = {3, 2, 1} According to the Axiom of Extensionality, A = B.
A B 1, 2, 3

In the above figure, both the circles contain the same elements, which shows the principle of extensibility.

Axiom 2: The axiom of regularity (or basis)

The axiom of regularity asserts that every non-empty set A contains an element that is disjoint from A; in simpler terms, a set does not contain itself as an element, either directly or indirectly. This prevents circularity and contradictions.

For example, it is forbidden for a set A to satisfy A = {A}, since this would imply that A contains itself.

Axiom 3: Axiom of pairing

According to the pairing axiom, for any two sets A and B, there is a set that has exactly A and B as elements.

    A = {1}, B = {2} Pair = {A, B} = {{1}, {2}}
{1} {2}

This visual illustration shows how sets A and B are combined into a new set.

Axiom 4: The axiom of union

The axiom of union allows us to create a new set that contains all the elements of the sets contained in another set. Formally, for any set A, the union of its elements is a set.

    A = {{1, 2}, {3, 4}} Union(A) = {1, 2, 3, 4}
{1,2} {3,4} Milan

After 'unifying' the two sets A, all the elements become part of a single set.

Axiom 5: Axiom of power set

According to the axiom of power set, for any set A, there is a set containing all possible subsets of A. This new set is called the power set of A, denoted by P(A).

    A = {1, 2} P(A) = {∅, {1}, {2}, {1, 2}}
{1} {2} {1, 2}

Here, we can see how every possible subset of the set A is represented inside the power set.

Axiom 6: The axiom of replacement

The axiom of replacement guarantees that if you have a set and a rule that assigns an output to each input, then the outputs also form a set.

Suppose you have a set A = {1, 2, 3} and a function f(x) = x^2. The axiom of replacement states that the set of outputs {1^2, 2^2, 3^2} or {1, 4, 9} is also a set.

Axiom 7: The axiom of infinity

The axiom of infinity asserts that there exists a set that contains the empty set and is closed under the process of adding an element. This ensures the existence of infinite sets.

    S = {∅, {∅}, {{∅}}, ...} This represents the set of all natural numbers.

Axiom 8: Axiom of choice

The axiom of selection is a unique and somewhat controversial part of Zermelo–Fraenkel set theory. It states that given any collection of non-empty sets, there exists a selection function that selects exactly one element from each set.

While this may seem intuitive, it has led to some surprising and paradoxical results. This is often expressed as being able to select exactly one element from each of an infinite collection of nonempty sets, even if there is no explicit selection rule.

Illustrative examples and applications

Zermelo-Fraenkel set theory can be understood even better by considering some classic illustrative examples. These examples use the axioms in creative ways to solve problems or clarify concepts.

Example 1: Construction of natural numbers

One of the most profound applications of Zermelo-Fraenkel set theory is the construction of the natural numbers. Using the axiom of infinity, we can define the numbers as follows:

    0 = ∅ 1 = {0} = {∅} 2 = {0, 1} = {∅, {∅}} 3 = {0, 1, 2} = {∅, {∅}, {∅, {∅}}} …and so forth.

This construction shows the power and flexibility of set theory as a foundation for other areas of mathematics.

Example 2: Applying the principle of selection

A classic application of the axiom of selection is the so-called "Banach-Tarski paradox." This paradox states that one can decompose a solid sphere into a finite number of pieces and then reassemble those pieces into two identical copies of the original sphere.

Although this challenges physical intuition, it exemplifies the non-constructive nature of the axiom of choice.

Visual example

Let's visualize how a set is constructed by applying various axioms:

{} }, ... set of natural numbers

This view describes how sets develop from the empty set using various axioms to build up the natural numbers.

Conclusion

Zermelo-Fraenkel set theory provides a versatile and robust foundation for mathematics. By using axioms to define admissible sets and their properties, this framework eliminates the contradictions and inconsistencies of simpler set theory. From defining the natural numbers to exploring complex concepts such as the axiom of choice, Zermelo-Fraenkel set theory establishes the foundation on which much of modern mathematics is built.

As a universal language for mathematics, set theory guides mathematicians in systematically exploring numbers, logic, and structures. Understanding these principles is not just about grasping abstract concepts, but about developing the tools necessary for exploring the mathematical universe.


Graduate → 8.3.3


U
username
0%
completed in Graduate

← Prev (8.3.2)
Axiomatic Systems
Next (8.3.4) →
Forcing

Comments 



Zermelo-Fraenkel Set Theory

https://www.buddymath.com/g/8.3.3?bmal=en