try ai
Popular Science
Edit
Share
Feedback
  • Cohen's Forcing

Cohen's Forcing

SciencePediaSciencePedia
Key Takeaways
  • Cohen's forcing is a powerful technique in set theory for building new mathematical universes (models of ZFC) by adding new sets.
  • Its most famous application was proving the Continuum Hypothesis (CH) is independent of the standard ZFC axioms, resolving a central problem in mathematics.
  • The method relies on a "forcing language" to describe potential universes and a "generic filter" to construct a specific, consistent new model.
  • The countable chain condition (ccc) is a key property that allows forcing to add new sets, like real numbers, without collapsing the universe's cardinal structure.
  • Forcing reveals the relative nature of mathematical truth, demonstrating that statements like CH are not absolute but depend on the specific mathematical universe one inhabits.

Introduction

For nearly a century, Cantor's Continuum Hypothesis (CH)—a fundamental statement about the size of the infinite—resisted all attempts at proof or disproof from the standard axioms of set theory (ZFC). While Kurt Gödel had shown CH could not be disproven, its provability remained a gaping hole in the foundations of mathematics. This is the problem that Paul Cohen's revolutionary method, known as forcing, was invented to solve. Forcing is not merely a logical trick; it is a profound and creative toolkit for constructing new mathematical realities, extending our familiar universe of sets to create new ones where different mathematical truths hold.

This article will guide you through the workshop where these universes are built. In the first chapter, ​​"Principles and Mechanisms"​​, we will examine the machinery of forcing itself, exploring the core concepts of conditions, names, the forcing relation, and the generic filters that bring a new world into existence. We will see how this process, while radical, is carefully designed to preserve the fundamental laws of set theory. Following that, in ​​"Applications and Interdisciplinary Connections"​​, we will witness the power of this method in action. We will see how it definitively settled the status of the Continuum Hypothesis and evolved into an indispensable tool for exploring the vast landscape of mathematical possibility, from building models for Martin's Axiom to mapping the fine structure of the real number line.

Principles and Mechanisms

Imagine you are a physicist. You have a set of fundamental laws—say, Newton's laws—and you want to know if they permit a certain phenomenon, like a perpetual motion machine. You can try to build one, and if you succeed, you've shown it's possible. If you can prove from the laws that building one leads to a contradiction, you've shown it's impossible. But what if you can do neither? This is the situation mathematicians found themselves in with Cantor's Continuum Hypothesis (CH). The standard axioms of set theory, Zermelo-Fraenkel with Choice (ZFC), seemed unable to either prove or disprove it.

So, what does a mathematician do? They take a page from the physicist's book: they try to build a universe. Kurt Gödel, in a stroke of genius, showed that you could find a universe within our own, a slimmed-down, orderly place called the ​​constructible universe (LLL)​​, where CH\mathrm{CH}CH is true. This proved that ZFC could not disprove CH\mathrm{CH}CH, because if it could, then even this inner sanctum LLL would have to obey that disproof, which it doesn't. This established one half of the independence of CH\mathrm{CH}CH.

Paul Cohen's great insight was to go in the other direction. Instead of building a smaller universe, he figured out how to build a bigger one. Forcing is the radical and beautiful machinery for constructing these new mathematical realities—universes that are extensions of the one we start with, but which contain new objects and, potentially, new truths. By building a universe where CH\mathrm{CH}CH is false, Cohen completed the proof that CH\mathrm{CH}CH is truly independent of our standard axioms. Let's walk through the workshop and see how these universes are made.

A Language for the Unseen: Conditions, Names, and Forcing

How can you describe a universe you haven't built yet? You can't just point to its new inhabitants. Cohen’s solution was to create a special language to talk about the properties of the new universe while standing firmly in the old one. This is the ​​forcing language​​.

The first ingredients are ​​conditions​​, which are finite pieces of information about the new objects we want to add. Think of them as blueprints. If we want to add a new real number (which can be seen as an infinite sequence of 0s and 1s), a condition might specify the first few digits. For example, in Cohen's original setup, the set of conditions, denoted P\mathbb{P}P, consists of all finite partial functions from the natural numbers ω\omegaω to {0,1}\{0, 1\}{0,1}. A condition like p={(0,1),(1,0),(2,1)}p = \{(0,1), (1,0), (2,1)\}p={(0,1),(1,0),(2,1)} is a piece of information specifying the first three bits of our new number. A "stronger" condition is one that contains more information; for example, q={(0,1),(1,0),(2,1),(3,0)}q = \{(0,1), (1,0), (2,1), (3,0)\}q={(0,1),(1,0),(2,1),(3,0)} is stronger than ppp because it extends it.

Next, every object in the new universe, from a simple number to a complex function, must have a ​​name​​ in our ground model. A name is a structured set that acts as a recipe, telling us how the object is to be constructed once the new "generic" information is available. For instance, we could create a name x˙\dot{x}x˙ that is intended to represent a new set of integers. The name might look like a collection of pairs: x˙={(nˇ,pn):n∈ω}\dot{x} = \{(\check{n}, p_n) : n \in \omega\}x˙={(nˇ,pn​):n∈ω}, where nˇ\check{n}nˇ is the canonical name for the integer nnn and pnp_npn​ is a condition. The rule for interpreting this name is: the integer nnn will be in our new set if the condition pnp_npn​ ends up being part of our final blueprint for the universe.

This leads us to the heart of the language: the ​​forcing relation​​, denoted by ⊩\Vdash⊩. A statement like p⊩φp \Vdash \varphip⊩φ means, "The condition ppp contains enough information to force the statement φ\varphiφ to be true in the new universe." For example, the condition p={(0,1)}p=\{(0,1)\}p={(0,1)} forces the statement "the 0-th bit of the new real is 1". The miracle of forcing is that this entire relationship—this ability to decide what a piece of information guarantees about a future world—can be precisely defined within our current universe. We can reason about all possible extensions without ever leaving home.

The Generic Compass: Navigating to a New Reality

The forcing language describes a whole multiverse of possibilities. To build one specific new universe, we must make a complete and consistent set of choices. This is the role of the ​​generic filter (GGG)​​.

Imagine you have a series of questions you must answer to specify your new universe. For Cohen's real number, these questions are "What is the 0-th bit?", "What is the 1st bit?", and so on. In the language of forcing, these questions correspond to ​​dense sets​​. A set DDD of conditions is dense if, no matter what information you already have (some condition ppp), you can always find a stronger piece of information ddd in DDD that answers the question. For instance, the set of all conditions that specify the 10th bit is a dense set.

A ​​generic filter GGG​​ is a special collection of conditions that provides a cohesive set of answers to all such questions that can be formulated in our ground model. It's a "generic" description because it's not biased; it avoids any special properties that we could have singled out beforehand. When we say GGG "meets" a dense set DDD, we mean their intersection is not empty (G∩D≠∅G \cap D \neq \emptysetG∩D=∅), which is just a formal way of saying GGG contains an answer to the question represented by DDD. It's worth noting that while GGG must intersect every dense set, this intersection isn't necessarily a single point. If the dense set contains compatible pieces of information, the generic filter might contain several of them.

Here comes the sleight of hand that makes forcing possible. It turns out that we cannot actually find a generic filter for our entire universe VVV that lives inside VVV. Trying to do so leads to a paradox related to Tarski's theorem on the undefinability of truth. It's like trying to find a map of the entire world that includes a map of itself—you get caught in an infinite regress. Cohen's solution was brilliant: don't try to extend the whole universe. Instead, start with a small, countable "toy" model of set theory, let's call it MMM. Because MMM is countable, it only has a countable number of dense sets. We can then, working in our larger universe VVV, easily construct a filter GGG that meets all of them. This GGG is not in MMM, but it is in VVV. This is enough! By building the extension M[G]M[G]M[G], we have created a new, perfectly valid model of set theory. If we can show that ZFC + ¬CH is true in this model, we have proved that ZFC + ¬CH is a consistent theory, which is exactly what's needed to establish independence.

A Universe Preserved: Why the Old Rules Still Apply

We've built a new world, M[G]M[G]M[G], by interpreting all our names using the information in our generic filter GGG. But is it a hospitable place for a mathematician? Does it still obey the fundamental laws of set theory, the ZFC axioms?

Amazingly, the answer is yes. The proof is a beautiful piece of self-reference. Let's take the Axiom of Separation as an example. It says that for any set AAA and any property ψ\psiψ, the collection of elements in AAA that have property ψ\psiψ also forms a set. To prove this holds in M[G]M[G]M[G], we take names for AAA and the property ψ\psiψ in our ground model MMM. We then construct a new name, let's call it B˙\dot{B}B˙, specifically designed to be the name for our desired subset. The recipe for B˙\dot{B}B˙ is: a name ρ\rhoρ gets put into B˙\dot{B}B˙ (with some condition ppp) if and only if ppp forces that the object named by ρ\rhoρ is in AAA and has the property ψ\psiψ.

Because the forcing relation (⊩\Vdash⊩) is definable in MMM, this entire recipe for B˙\dot{B}B˙ can be written down as a formula in the language of MMM. We can then use the Axiom of Separation in M to prove that this collection of pairs, B˙\dot{B}B˙, is a genuine set in MMM. We've used an axiom in the old universe to forge a name that guarantees the same axiom will hold in the new one! The forcing theorem then ensures that when we interpret B˙\dot{B}B˙ using our generic filter GGG, we get exactly the set we were looking for. This same style of argument works for all the other ZFC axioms, ensuring our new universe is structurally sound.

Surgical Strikes on the Continuum: The Power of the ccc

When performing surgery, a doctor wants to fix the problem without causing unintended damage. Forcing is similar. When we add new sets to our universe to make CH\mathrm{CH}CH false, we want to be surgical. The goal is typically to add new real numbers to make the continuum large, while leaving the cardinal numbers, like ℵ1\aleph_1ℵ1​, untouched. If we accidentally made ℵ1\aleph_1ℵ1​ (the first uncountable number) become countable in our new universe, our statement "2ℵ0>ℵ12^{\aleph_0} > \aleph_12ℵ0​>ℵ1​" would be meaningless.

This is where a crucial property of forcing notions comes in: the ​​countable chain condition (ccc)​​. An ​​antichain​​ is a set of conditions that are mutually incompatible—like a set of blueprints for a house where each one specifies a different color for the front door. You can only choose one. A forcing notion has the ccc if every such set of mutually exclusive options is countable.

This seemingly technical property has profound consequences. It acts as a governor, preventing the forcing from being powerful enough to destroy large cardinals. The key idea is this: to make an uncountable cardinal like ω1V\omega_1^Vω1V​ become countable in the new universe V[G]V[G]V[G], you would need to add a new function that maps the natural numbers ω\omegaω onto ω1V\omega_1^Vω1V​. The ccc condition ensures that any such function named in the ground model cannot be cofinal. The range of any function we can define is "pinned down" by a countable number of conditions, and the union of values these conditions can force is too small to cover all of ω1V\omega_1^Vω1V​. As a result, ω1V\omega_1^Vω1V​ remains the first uncountable cardinal in the new universe.

By using a ccc forcing, such as Cohen's, we can add a vast number of new real numbers—say, ℵ2\aleph_2ℵ2​ of them—while guaranteeing that ℵ1\aleph_1ℵ1​ remains ℵ1\aleph_1ℵ1​. In the resulting universe, we have 2ℵ0≥ℵ2>ℵ12^{\aleph_0} \ge \aleph_2 > \aleph_12ℵ0​≥ℵ2​>ℵ1​. We have successfully negated the Continuum Hypothesis, and we've done it with the precision of a master surgeon, creating a new, consistent mathematical world where the landscape of the infinite is demonstrably different.

Applications and Interdisciplinary Connections

Now that we have seen the nuts and bolts of the forcing machinery, we might be tempted to view it as a clever logical trick, a tool for proving that things are unprovable. But that would be like looking at a painter's brushes and pigments and seeing only tools for making a canvas not blank. The true power and beauty of forcing lie not in what it deconstructs, but in what it constructs. It is a toolkit for building universes, a method for exploring a vast, branching landscape of mathematical possibilities, each one a consistent world governed by the laws of ZFC. In this chapter, we will journey through some of these worlds, witnessing firsthand how forcing reshapes our understanding of the mathematical firmament.

Shattering a Foundational Question: The Continuum Hypothesis

For nearly a century after its formulation by Georg Cantor, the Continuum Hypothesis (CH)—the statement that there is no set whose size is strictly between that of the integers, ℵ0\aleph_0ℵ0​, and that of the real numbers, 2ℵ02^{\aleph_0}2ℵ0​—stood as one of mathematics' greatest unsolved problems. Kurt Gödel had shown in 1940 that one could not disprove CH within ZFC. The question of whether it could be proved remained open. Paul Cohen's invention of forcing in 1963 settled the matter in the most spectacular way possible: he showed that CH is also not provable from ZFC.

The core idea is one of profound elegance. We can start with any universe of sets MMM that we believe in, and by forcing, we can "gently" add new real numbers to it, creating a larger universe M[G]M[G]M[G]. The trick is to do this so delicately that we don't disturb the existing structure of the cardinals. The countable chain condition (ccc) is the key property that ensures our forcing is gentle enough not to collapse ℵ1\aleph_1ℵ1​ into a countable set, or ℵ2\aleph_2ℵ2​ into a set of size ℵ1\aleph_1ℵ1​.

Cohen's original construction showed how to add ℵ2\aleph_2ℵ2​ new real numbers to a model of ZFC. Starting with a countable model MMM of ZFC, one can use the Cohen forcing poset Add⁡(ω,ℵ2M)\operatorname{Add}(\omega, \aleph_2^M)Add(ω,ℵ2M​) to build an extension M[G]M[G]M[G]. Because this forcing is ccc, cardinals are preserved, so (ℵ1)M(\aleph_1)^M(ℵ1​)M is still the first uncountable cardinal in M[G]M[G]M[G]. But now we have at least ℵ2M\aleph_2^Mℵ2M​ real numbers. The result is a perfectly valid model of ZFC where 2ℵ0≥ℵ22^{\aleph_0} \ge \aleph_22ℵ0​≥ℵ2​, and thus CH is false.

This immediately raises a tantalizing question: if we can make the continuum larger than ℵ1\aleph_1ℵ1​, just how large can we make it? Forcing provides the answer: almost as large as we want. The technique is remarkably versatile. By choosing a forcing notion like Fn⁡(κ,2,ω)\operatorname{Fn}(\kappa, 2, \omega)Fn(κ,2,ω), we can add precisely κ\kappaκ new real numbers for any cardinal κ\kappaκ we choose.

However, the final size of the continuum depends not only on the forcing we use but also on the "raw material" of the universe we start with. To gain precise control and set 2ℵ02^{\aleph_0}2ℵ0​ to be exactly ℵ2\aleph_2ℵ2​, for instance, it is helpful to start from a "clean" and well-behaved universe, such as one that satisfies the Generalized Continuum Hypothesis (GCH). In such a universe, the cardinal arithmetic is simple, allowing us to prove that forcing with Add⁡(ω,ℵ2)\operatorname{Add}(\omega, \aleph_2)Add(ω,ℵ2​) yields a model where 2ℵ0=ℵ22^{\aleph_0} = \aleph_22ℵ0​=ℵ2​ precisely. This interplay between the ground model and the forcing extension reveals that forcing is not a blunt instrument but a precision tool, whose effects we can predict and control.

The Relativity of Set-Theoretic Truth

Gödel's discovery of the constructible universe, LLL, gave mathematicians a glimpse of a beautifully minimalist world. LLL is an "inner model" of any universe of ZFC; it is a sub-universe built from the bottom up in the simplest way possible. In this rigid and orderly world, the Generalized Continuum Hypothesis is true. For a time, one might have wondered if LLL represented the "true" universe of sets.

Forcing demolishes this notion of a single, absolute truth. We can take the pristine universe LLL and, by forcing over it, create a new, larger universe L[G]L[G]L[G] where GCH is spectacularly false. For example, using the techniques we've seen, we can create an extension of LLL where 2ℵ0=ℵ22^{\aleph_0} = \aleph_22ℵ0​=ℵ2​. What does this mean for Gödel's theorem that LLL satisfies GCH? It means that truth is relative. From the perspective of the new, larger universe L[G]L[G]L[G], the old universe LLL is still there, existing as an "inner model." All the old theorems of LLL, including GCH, remain true inside LLL. But they are no longer true for the ambient reality of L[G]L[G]L[G], which contains new sets that LLL never dreamed of.

The situation is akin to the inhabitants of a two-dimensional "Flatland" (LLL) suddenly gaining the ability to perceive a third dimension. Their new world (L[G]L[G]L[G]) contains objects like spheres—the new sets—that are utterly alien to their old reality. Yet, their original Flatland still exists as a plane within this 3D space, and all the laws of 2D geometry are still valid on that plane. Forcing is the tool that gives us access to these higher-dimensional realities.

The ultimate expression of this freedom is Easton's Theorem, which shows that by using a more complex form of forcing, we can control the continuum function κ↦2κ\kappa \mapsto 2^\kappaκ↦2κ for regular cardinals almost arbitrarily, subject only to basic constraints of logic and monotonicity. We can build a universe where 2ℵ0=ℵ172^{\aleph_0} = \aleph_{17}2ℵ0​=ℵ17​, 2ℵ1=ℵ422^{\aleph_1} = \aleph_{42}2ℵ1​=ℵ42​, and 2ℵ2=ℵ20012^{\aleph_2} = \aleph_{2001}2ℵ2​=ℵ2001​, all at the same time. The question of the continuum's size is not a question with a single answer; it is a parameter of the universe we choose to inhabit.

Forcing as a Creative Tool

Beyond just proving independence, forcing is a powerful creative instrument for constructing new mathematical worlds with fascinating and often counter-intuitive properties. This allows us to test the relationships between different mathematical principles and explore the rich combinatorial structures that can exist.

Martin's Axiom: A User-Friendly Alternative to CH

The Continuum Hypothesis is a very strong statement. Martin's Axiom (MA) is a more subtle and broadly applicable principle. In essence, MA is a general-purpose existence theorem. It states that for any "well-behaved" (ccc) partially ordered set P\mathbb{P}P, we can find a generic filter for any collection of dense sets, as long as that collection is not too large (smaller than the continuum). CH implies MA, but they are not equivalent. What if we want the powerful consequences of MA without the rigidity of CH?

Forcing allows us to build such a world. The consistency of MA + ¬\neg¬CH is one of the crown jewels of forcing theory. The proof is a masterpiece of construction. One starts with a model satisfying GCH and performs an "iterated forcing" of length ℵ2\aleph_2ℵ2​. This is like a grand construction project: at each of the ℵ2\aleph_2ℵ2​ stages, a bookkeeping device identifies a potential failure of MA and applies a specific forcing to "fix" it, adding a required generic filter. Simultaneously, at many of the stages, one also adds a new Cohen real. After ℵ2\aleph_2ℵ2​ steps, we have systematically satisfied every instance of MA while also adding ℵ2\aleph_2ℵ2​ new reals, resulting in a model of MA + (2ℵ0=ℵ22^{\aleph_0} = \aleph_22ℵ0​=ℵ2​).

The technical engine that makes this possible is ​​finite support iteration​​. This method allows us to chain together ccc forcings, with the crucial guarantee that the entire iterated construction remains ccc. This preservation property is the "magic" that ensures the process doesn't inadvertently collapse cardinals, allowing us to build these complex structures step-by-step without the whole edifice crumbling.

Cichon's Diagram: Charting the Continuum's Fine Structure

The question of the continuum's size is just the beginning. The real line, as studied in analysis and topology, has a rich and complex combinatorial structure. This structure can be measured by a collection of numbers known as ​​cardinal characteristics of the continuum​​. These are cardinals, typically between ℵ1\aleph_1ℵ1​ and 2ℵ02^{\aleph_0}2ℵ0​, that quantify the "difficulty" of certain infinite tasks.

For example, consider two such characteristics related to functions from ω\omegaω to ω\omegaω:

  • The ​​bounding number​​, b\mathfrak{b}b, is the smallest size of a family of functions that no single function can eventually dominate. It measures the difficulty of creating an "unpinnable" set of functions.
  • The ​​dominating number​​, d\mathfrak{d}d, is the smallest size of a family of functions that eventually dominates every other function. It measures the difficulty of creating an "all-pinning" set.

In ZFC, one can prove b≤d\mathfrak{b} \le \mathfrak{d}b≤d. But are they equal? Forcing provides the answer: not necessarily! We can use specific forcing notions tailored to the task. For example, Hechler forcing is designed to add a single function that dominates all functions from the ground model. By iterating this forcing, we can construct a model where b=ℵ1\mathfrak{b} = \aleph_1b=ℵ1​ but d=ℵ2\mathfrak{d} = \aleph_2d=ℵ2​. We can also design forcings to manipulate other characteristics, such as the splitting number s\mathfrak{s}s and the reaping number r\mathfrak{r}r, which relate to combinatorial properties of subsets of ω\omegaω. Forcing allows us to "pull apart" these characteristics, showing they correspond to genuinely distinct combinatorial notions and revealing an intricate landscape of possibilities for the structure of the real line, a landscape now famously mapped by Cichoń's diagram.

The Frontiers of Forcing

The development of forcing did not stop with Cohen. Modern set theorists have refined these techniques into an art form of incredible subtlety and power. One stunning example is the work of Saharon Shelah, who showed how to separate CH from another principle called the Diamond principle (◊ω1\Diamond_{\omega_1}◊ω1​​). The Diamond principle is a strong combinatorial statement that holds in Gödel's LLL and implies CH. For a long time, it was thought to be inextricably linked to CH.

However, using a highly sophisticated technique called ​​revised countable support iteration​​ with forcings that are "countably closed" (and thus add no new reals), Shelah was able to construct a model of ZFC where CH holds but ◊ω1\Diamond_{\omega_1}◊ω1​​ fails. This is akin to a master luthier tuning an instrument to produce a very specific, previously unheard chord. It demonstrates the almost surgical precision of modern forcing, allowing us to isolate and separate axioms that once seemed to be part of the same whole.

From its genesis as a tool to answer a single question, Cohen's forcing has blossomed into a rich and profound theory. It has transformed our view of mathematical truth from something static and absolute to something dynamic and relative. It gives us the power not just to observe the mathematical universe, but to take part in its creation, building new worlds that expand the horizons of what we know and what we can imagine.