I am attempting to understand cohen's proof by forcing that the continuum hypotheses is independent of ZFC . However,I am having trouble understanding intuitively the concept of a generic extension of a model. Can anyone give me an intuitive explanation (with examples if possible)?. Thanks in advance
2026-04-14 11:29:23.1776166163
Intuitive explanation of generic extension
239 Views Asked by Bumbble Comm https://math.techqa.club/user/bumbble-comm/detail At
1
There are 1 best solutions below
Related Questions in SET-THEORY
- Theorems in MK would imply theorems in ZFC
- What formula proved in MK or Godel Incompleteness theorem
- Proving the schema of separation from replacement
- Understanding the Axiom of Replacement
- Ordinals and cardinals in ETCS set axiomatic
- Minimal model over forcing iteration
- How can I prove that the collection of all (class-)function from a proper class A to a class B is empty?
- max of limit cardinals smaller than a successor cardinal bigger than $\aleph_\omega$
- Canonical choice of many elements not contained in a set
- Non-standard axioms + ZF and rest of math
Related Questions in INTUITION
- How to see line bundle on $\mathbb P^1$ intuitively?
- Intuition for $\int_Cz^ndz$ for $n=-1, n\neq -1$
- Intuition on Axiom of Completeness (Lower Bounds)
- What is the point of the maximum likelihood estimator?
- Why are functions of compact support so important?
- What is it, intuitively, that makes a structure "topological"?
- geometric view of similar vs congruent matrices
- Weighted average intuition
- a long but quite interesting adding and deleting balls problem
- What does it mean, intuitively, to have a differential form on a Manifold (example inside)
Related Questions in MODEL-THEORY
- What is the definition of 'constructible group'?
- Translate into first order logic: "$a, b, c$ are the lengths of the sides of a triangle"
- Existence of indiscernible set in model equivalent to another indiscernible set
- A ring embeds in a field iff every finitely generated sub-ring does it
- Graph with a vertex of infinite degree elementary equiv. with a graph with vertices of arbitrarily large finite degree
- What would be the function to make a formula false?
- Sufficient condition for isomorphism of $L$-structures when $L$ is relational
- Show that PA can prove the pigeon-hole principle
- Decidability and "truth value"
- Prove or disprove: $\exists x \forall y \,\,\varphi \models \forall y \exists x \,\ \varphi$
Trending Questions
- Induction on the number of equations
- How to convince a math teacher of this simple and obvious fact?
- Find $E[XY|Y+Z=1 ]$
- Refuting the Anti-Cantor Cranks
- What are imaginary numbers?
- Determine the adjoint of $\tilde Q(x)$ for $\tilde Q(x)u:=(Qu)(x)$ where $Q:U→L^2(Ω,ℝ^d$ is a Hilbert-Schmidt operator and $U$ is a Hilbert space
- Why does this innovative method of subtraction from a third grader always work?
- How do we know that the number $1$ is not equal to the number $-1$?
- What are the Implications of having VΩ as a model for a theory?
- Defining a Galois Field based on primitive element versus polynomial?
- Can't find the relationship between two columns of numbers. Please Help
- Is computer science a branch of mathematics?
- Is there a bijection of $\mathbb{R}^n$ with itself such that the forward map is connected but the inverse is not?
- Identification of a quadrilateral as a trapezoid, rectangle, or square
- Generator of inertia group in function field extension
Popular # Hahtags
second-order-logic
numerical-methods
puzzle
logic
probability
number-theory
winding-number
real-analysis
integration
calculus
complex-analysis
sequences-and-series
proof-writing
set-theory
functions
homotopy-theory
elementary-number-theory
ordinary-differential-equations
circles
derivatives
game-theory
definite-integrals
elementary-set-theory
limits
multivariable-calculus
geometry
algebraic-number-theory
proof-verification
partial-derivative
algebra-precalculus
Popular Questions
- What is the integral of 1/x?
- How many squares actually ARE in this picture? Is this a trick question with no right answer?
- Is a matrix multiplied with its transpose something special?
- What is the difference between independent and mutually exclusive events?
- Visually stunning math concepts which are easy to explain
- taylor series of $\ln(1+x)$?
- How to tell if a set of vectors spans a space?
- Calculus question taking derivative to find horizontal tangent line
- How to determine if a function is one-to-one?
- Determine if vectors are linearly independent
- What does it mean to have a determinant equal to zero?
- Is this Batman equation for real?
- How to find perpendicular vector to another vector?
- How to find mean and median from histogram
- How many sides does a circle have?
Assuming you're talking about set theory, the main theorem is that $V[G]$ is the minimal model of set theory containing $V$ with $G$ as an element.
More precisely, if $V\models \mathsf{ZFC}$ is a transitive model, $\mathbb{P}\in V$ is a poset, and $G$ (usually not in $V$) is $\mathbb{P}$-generic over $V$, then
The elements of the generic extension come from so-called $\mathbb{P}$-names. To give some context, consider the constructible universe $L$ defined in stages where we take $\{\in\}$-definable subsets at each stage. There's a notion of $L[x]$ where we take $\{\in,x\}$-definable subsets at each stage. In essence, we allow ourselves ask questions about membership in $x$. If $x\subseteq \mathbb{P}$ for some $\mathbb{P}\in L$, then $x\in L[x]$ and we basically consider everything constructible from $x$ in the same way we construct the elements of $L$.
This all works out nicely for $L$, which has a nice definition. But how should we generalize this to such an arbitrary $V$? Well the idea is that we consider all sorts of potential constructions that $V$ can carry out. Then when we have access to $V[G]$, we just thin out these potential constructions by our (outside of $V$) access to $G$. These potential constructions are just sets tagged with members of our poset $\mathbb{P}$. Once we know what's in $G$, we can include the elements tagged with things in $G$ and throw out the members tagged with things not in $G$. For example, if $G=\{p\}$, $\{\langle 0,p\rangle ,\langle 1,q\rangle \}$ would be thinned out to just $\{0\}$. If $G=\{p,q\}$, the same set would be thinned out to $\{0,1\}$.
So this is basically the setup: we iteratively form these potential constructions and then with access to $G$, we thing things out and end up with $V[G]$:
As described above, we thin these constructions our (or interpret) these names by setting $$\tau_G=\{\sigma_G:\langle \sigma,p\rangle\in \tau\text{ for some }p\in G\}\text{.}$$ Then we take $$V[G]=\{\tau_G:\tau\in V^{\mathbb{P}}=\bigcup_{\alpha\in\mathrm{Ord}}V_\alpha^{\mathbb{P}}\}$$ Why exactly does this work? For example, how do we know $G\in V[G]$? It's easy to see that $\tau = \{\langle p,p\rangle:p\in\mathbb{P}\}$ gives $\tau_G=G$. How do we know $V\subseteq V[G]$? One can show that there are canonical names for $x\in V$ basically just by iteratively setting $\check \emptyset = \emptyset$, and $$\check x = \{\langle \check y, p\rangle:y\in x\text{ and }p\in\mathbb{P}\}\text{.}$$ It's not too difficult to show that this works.
Again, the main idea is that $V[G]$ is what $V$ would look like if it had access to $G$ because we are basing $V[G]$ on what constructions $V$ allows.