forcing (mathematics)

forcing (mathematics)
Name	Forcing (mathematics)
Introduced	1963
Inventor	Paul Cohen
Field	Set theory
Notable	Independence of the Continuum Hypothesis

forcing (mathematics) is a technique developed to construct models of Set theory in which specific statements can be made true or false, demonstrating independence and relative consistency results. Originating with Paul Cohen's proof of the independence of the Continuum Hypothesis and the Axiom of Choice from Zermelo–Fraenkel set theory, the method blends combinatorial, model-theoretic, and Boolean-algebraic tools to extend models and analyze their properties. Forcing interacts with major themes in Kurt Gödel's constructibility, Paul Cohen's technique, and contemporary investigations involving Kurt Gödel's program and large cardinal hypotheses.

Introduction

Forcing was introduced by Paul Cohen to prove the independence of the Continuum Hypothesis from Zermelo–Fraenkel set theory with Axiom of Choice (ZFC). It builds on earlier work of Kurt Gödel on the constructible universe L and uses partial orders to adjoin new sets to a ground model, creating a forcing extension in which targeted statements such as the Continuum Hypothesis, forms of the Axiom of Choice, or combinatorial principles like Martin's axiom can be controlled. Subsequent developments by researchers connected to the Institute for Advanced Study and various universities expanded forcing into a central tool in modern Paul Cohen-era set theory, interacting with Solovay, Easton, Jech, Kunen, and others.

Forcing Notions and Partial Orders

A forcing notion is a partially ordered set (poset) P used to add generic objects to a model of Zermelo–Fraenkel set theory. Classic examples include Cohen forcing for adding subsets of ω (named after Paul Cohen), Levy collapse posets used by Azriel Levy and Robert Solovay for collapsing cardinals, and random forcing connected to measure-theoretic constructions studied by Robert Solovay and Itay Neeman. Proper forcing was defined by Stevo Todorčević and refined by Saharon Shelah to preserve ω1, while notions like countable support iterations and finite support iterations were developed in the work of Magidor, Shelah, and Menachem Magidor. Other prominent forcings include Sacks forcing, Miller forcing, Laver forcing, and Prikry forcing related to singular cardinal combinatorics investigated by Karel Prikry and Kenneth Kunen.

Forcing Language: Names, Conditions, and Generic Filters

Forcing uses a formal language of P-names and P-conditions inside a ground model M to describe objects in the extension. A generic filter G ⊆ P meeting dense sets coded in M yields the extension M[G], a model satisfying ZF-like axioms under appropriate hypotheses. Constructing names relies on transfinite recursion in the spirit of Kurt Gödel's definability hierarchies; evaluations via G produce new sets such as subsets of ω or functions ω→ω. The interplay between dense sets, maximal antichains, and genericity connects to classical combinatorial principles studied by Erdős, Paul Erdős, and A. R. D. Mathias and informs preservation properties analyzed by Saharon Shelah.

Forcing Extensions and Preservation Theorems

Forcing extensions M[G] are analyzed for which axioms and cardinal characteristics they preserve. Preservation theorems developed by Kunen, Solovay, Shelah, and Jech ensure that cardinals, cofinalities, or the axioms of ZF are retained under specific hypotheses such as chain conditions (c.c.c.), properness, or closure properties. The c.c.c. (countable chain condition) originates in measure and topology contexts connected to Alexandre Grothendieck-era techniques and ensures preservation of cardinals and cardinals' cofinalities in many classical constructions. Preservation results for stationary sets, reflection principles, and combinatorial structures tie into research by R. M. Solovay, William Mitchell, Hugh Woodin, and Foreman.

Applications in Set Theory (Independence and Consistency Results)

Forcing furnished the first relative consistency proofs of major statements: Paul Cohen used it to refute the provability in ZFC of the Continuum Hypothesis; later applications include independence of statements like Suslin's conjecture, the existence of Whitehead groups in algebra, and many propositions about cardinal invariants of the continuum studied by Blass and Stevo Todorčević. Easton's theorem on possible behaviors of the power function at regular cardinals uses forcing techniques developed by William Easton. Forcing has been combined with inner model theory led by Kunen and large cardinal research by Solovay, Silver, Menas, Mitchell, and Woodin to derive relative consistency results connecting large cardinal axioms with combinatorial statements, determinacy hypotheses, and descriptive set theory involving figures like Donald A. Martin.

Iterated and Proper Forcing

Iterated forcing, formalized by James Baumgartner, Solovay, and Shelah, builds long sequences of forcing notions using support conditions (countable, finite, or revised countable support) to produce complex extensions while controlling preservation. Proper forcing, introduced by Shelah, preserves stationary subsets of ω1 and underpins many modern constructions aimed at producing models satisfying combinatorial axioms like Martin's Axiom or Suslin-type statements. Techniques from iterated and proper forcing interact with approaches by Todorcevic, Magidor, Jech, and Woodin in constructing models with finely tuned cardinal arithmetic, reflection, and chain conditions.

Variants and Related Techniques (Boolean-Valued Models, Large Cardinals)

Boolean-valued models provide an algebraic formulation of forcing via complete Boolean algebras, a perspective championed by Dana Scott, Robert Solovay, and John von Neumann-inspired set-theoretic algebraists. Connections with large cardinals—measurable, supercompact, and Woodin cardinals—have been central to modern forcing applications explored by Kunen, Mitchell, Solovay, Hugh Woodin, and W. Hugh Woodin; these interactions produce deep consistency strength comparisons and implicate determinacy axioms studied by Donald A. Martin and John R. Steel. Related methods include symmetric submodels, Boolean ultrapowers, and Prikry-type forcings, which are essential in the study of Adrian Mathias-style combinatorics, inner model theory, and descriptive set-theoretic consequences.

Category:Set theory