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 ↓


Forcing


Forcing is a powerful technique in set theory, a branch of mathematical logic that deals with the study of sets, which are fundamental objects in mathematics. The method was introduced by Paul Cohen in the 1960s to show the independence of the Continuum Hypothesis (CH) from Zermelo–Fraenkel set theory with the Axiom of Choice (ZFC). Understanding forcing requires a good understanding of mathematical logic, especially the axioms and properties of set theory. Let us understand the concept of forcing in a step-by-step manner.

Basics of set theory

Before delving into the use of force, it is important to have an understanding of set theory. A set is a well-defined collection of distinct objects. The study of these objects and their relationships forms the basis of set theory.

In set theory, we deal with the following concepts:

  • Elements: Objects included in a group.
  • Subset: A set whose all elements are contained in another set.
  • Union: A group of elements that belong to any of two groups.
  • Intersection: A set of elements that two sets have in common.
  • Power set: The set of all subsets of a set.

Set theory uses specific symbols and formulas to express concepts. Here are some examples:

    A ⊆ B // A is a subset of B
    A ∪ B // union of sets A and B
    A ∩ B // intersection of sets A and B
    P(A) // power set of A

Understanding models of set theory

When studying set theory, it is important to consider models - mathematical structures that satisfy the axioms of the theory. A model is essentially a universe of sets where these sets obey specific rules.

The concept of forcing is related to creating new models of set theory. This technique allows mathematicians to show that certain propositions cannot be proven or disproved using the standard axioms of set theory, which highlights their independence from these axioms.

Introduction to the use of force

Forcing allows us to extend a given model of set theory to a larger model in which certain propositions are true. For example, by starting with a model where the continuum hypothesis is undetermined, forcing can create a model where the hypothesis can be either true or false.

The basic idea is to constructively add a new set to the model, ensuring that the extension remains a model of set theory. Here's how it typically works:

1. Choose a compelling assumption

First, we need the concept of force, which is essentially a partially ordered set (also called a poset). This poset serves as a guide for adding new sets, specifying the conditions under which these sets must exist.

    P = {p, q, r, ...}

Each element (condition) expresses some property that our new set must satisfy. The order shows how these conditions are related; for example, one condition may be stronger or more restrictive than another.

2. Use the usual filters

A generic filter is a special set of conditions that:

  • Directed: For any two conditions, there is a third condition that is stronger than both.
  • Normal: it meets any dense subset of the poset.

Finding a generic filter allows us to create a new set in the extended model. The concept of genericity ensures that our new set behaves well with respect to all existing sets in the model.

3. Build the extension

After a common filter has been identified, the next step is to create an extended model that includes the new set defined by this filter. This involves formalizing how the new set and its elements interact with existing sets.

4. Verify the new model

Finally, we need to verify that the extended model satisfies the axioms of set theory. The main challenge here is to ensure that the model remains consistent and that the introduction of new sets does not violate any axioms.

Visual representation of the use of force

To understand forcing visually, consider the model as a container of sets. The new set added by forcing fits into this container, but changes its "shape" or properties without breaking it. Below is a simple illustration using a circle to represent the original model, which has been extended by the new sets.

Original model Extended Model

Examples of binding applications

Let us consider some practical applications where force is used to establish the independence of mathematical statements. These examples provide an insight into the importance and utility of force.

1. Continuum Hypothesis (CH)

The continuum hypothesis raises the question of whether there is a set whose cardinality is between the integers and the real numbers. Cohen used force to demonstrate that CH is independent of the standard axioms of set theory (ZFC). This showed that CH cannot be proven true or false using only these axioms.

2. The Axiom of Choice of Freedom (AC)

Forcing has also played an important role in studying the axiom of choice (AC) and its implications in set theory. The freedom of AC allows mathematicians to create models where AC is either valid or invalid, thus revealing different properties of mathematical constructions depending on the presence or absence of this axiom.

Challenges and philosophical implications

While force is a powerful and necessary tool in set theory, it also raises philosophical questions about the nature of mathematical truth. For example, if a proposition is independent of the standard set-theoretic axioms, what does it mean for it to be “true”? Does mathematical truth exist outside the confines of formal axiomatic systems?

These questions challenge traditional conceptions of mathematics and logic, and push the boundaries of the ways mathematicians understand and explore the universe of sets.

Conclusion

Forcing, introduced by Paul Cohen, is one of the most innovative techniques in mathematical logic. It has reshaped our understanding of freedom in logic and remains an area of active research, providing profound insights into the capabilities and limitations of formal systems in mathematics.

This exploration shows how force extends models of set theory, and provides a framework through which mathematicians can better understand the inherent flexibility and complexity of mathematical truths.


Graduate → 8.3.4


U
username
0%
completed in Graduate

← Prev (8.3.3)
Zermelo-Fraenkel Set Theory
Next (9) →
Optimization

Comments 



Forcing

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