Cfrgtkky

Let $alpha$ be an ordinal. How can we show that the following theory is consistent?

$mathrm{ZF}$ + "there exists a set with rank greater than $alpha$ that is not well ordered" + "every set of rank lower than $alpha$ is well ordered".

The idea is to pick $kappa$ which is large enough, and does not inject into $V_alpha$. Then we add subsets to $kappa$ and use them to generate subsets of $2^kappa$ which cannot be well-ordered. These cannot be embedded into $V_alpha$ either, so we finished our proof.

We begin with the forcing $P$ whose conditions are functions from $kappatimeskappa$ into $2$, with domain of cardinality $<kappa$. $q$ is stronger than $p$ if $psubseteq q$, and we denote this by $qleq p$.

Easily, the forcing adds $kappa$ new subsets to $kappa$. But the forcing is $kappa$-closed (or $<kappa$-closed, depending on your flavor of terminology) so it doesn't add any subset to any smaller cardinal. In particular it doesn't add any subset to $V_alpha$, so no sets of rank $alpha$ are added.

We consider the following names, $dot r_alpha={(p,checkbeta)mid p(alpha,beta)=1}$, for $alpha<kappa$. These are the canonical names for the new subsets of $kappa$ that are being added.

Let $scr G$ be the group of all permutations of $kappa$ in the ground model. Although it is enough to consider permutations which only move finitely many points at a time (as an analysis of the following argument will show). $scr G$ acts on the poset $P$ in the following way: $$pi p(pialpha,beta)=p(alpha,beta).$$

Extend those actions to actions of $P$-names, by defining $pidot x={(pi p,pidot y)mid (p,dot y)indot x}$. We have now the following lemma,

The Symmetry Lemma: For every formula $varphi(dot u_1,ldots,dot u_k)$ and every condition $p$, and every $piinscr G$: $$pVdashvarphi(dot u_1,ldots,dot u_k)iffpi pVdashvarphi(pidot u_1,ldots,pidot u_k).$$

Proof. Induction on the formulas and the names.

Now take any regular $muleqkappa$, and we will define a model in which the name $dot R={(1,dot r_alpha)midalpha<kappa}$ is interpreted to have Hartogs number $mu$ (the least cardinal cannot be injected into the set), and $sf DC_{<mu}$ holds. In particular it shows that that set cannot be well-ordered, because it should have the Hartogs number of $kappa^+$.

Define $cal F$ to be a filter of subgroups of $scr G$ where $Hincal F$ if and only if there exists $Esubseteqkappa$ such that $|E|<mu$, and all the permutations in $H$ fix $E$ pointwise. We define by induction the class $sf HS$. Given a $P$-name $dot x$, we say that $dot xinsf HS$ if there exists $Hincal F$ such that whenever $piin H$, $pidot x=dot x$, and if every $dot y$ which appears in $dot x$ is already in $sf HS$.

If $H$ is a subgroup which contains the pointwise stabilizer of $E$, and $H$ fixes $dot x$, we say that $E$ is a support for $dot x$, and we note that every permutation which fixes $E$ pointwise will fix $dot x$ as well.

Lemma 1: The following holds.

1. For every $x$ in the ground model, $check xinsf HS$. With $varnothing$ as support.


2. For every $alpha<kappa$, $dot r_alphainsf HS$ with support ${alpha}$.


3. 
   $dot Rinsf HS$ with the empty support.

Proof. Exercise.

Let $Gsubseteq P$ be a generic filter. Let $V[G]$ be the generic extension of the universe and let $N={dot x^Gmiddot xinsf HS}$ be the interpretation of all the names in $sf HS$.

Lemma 2: $N$ is a transitive model of $sf ZF$, and $Vsubseteq N$.

Proof. Transitivity follows from the inductive definition of $sf HS$; $Vsubseteq N$ from the first point of the previous lemma; and $Nmodelssf ZF$ because it is almost universal and closed under Goedel functions, but one can also verify the axioms directly (see also Jech "Set Theory", 3rd eds. Ch. 15). $square$

Theorem: In $N$, $sf AC$ fails.

Proof. Let $R=dot R^Gin V$, we will show that it cannot be well-ordered in $N$, as promised.

From the last point of Lemma 1, $Rin N$. Suppose now that $fcolon muto R$ is an injection, and $fin N$. There exists some name $dot finsf HS$ and some $Ein[kappa]^{<mu}$ such that $dot f=f$ and $E$ is a support for $dot f$.

Let $p$ be a condition such that $pVdashdot fcoloncheckmutodot R$. We may assume without loss of generality that for some $alphanotin E$, and some $gamma<kappa$ we have $pVdashdot f(checkgamma)=dot r_alpha$.

Let $alpha<beta<kappa$ such that $betanotin E$ and there is no ordinal $delta$ such that $(beta,delta)inoperatorname{dom} p$. We define the permutation $pi$ to switch between $alpha$ and $beta$ and be the identity everywhere else.

Clearly $pi$ fixes $E$ pointwise and therefore $pidot f=dot f$. Therefore by the symmetry lemma, $pi pVdashdot fcoloncheckmutodot R$, and also $pi pVdashdot f(checkgamma)=dot r_beta$.

If $p$ and $pi p$ are compatible then we have a contradiction because $qleq p,pi p$ would have to force that $dot r_alpha=dot f(checkgamma)=dot r_beta$, and also $dot r_alphaneqdot r_beta$!

And indeed if $(xi,zeta)inoperatorname{dom} p$ then either $xi=alpha$ and then $pixi=beta$ and $(beta,zeta)notinoperatorname{dom} p$ at all; or $pixi=xi$. Similarly for $pi p$ exchanging $beta$ with $alpha$. Therefore the conditions $p$ and $pi p$ are compatible and this is a contradiction. $square$

Bonus Lemma: If $fcolon V[G]to N$ such that $operatorname{dom} f<mu$, then there exists $dot finsf H$ such that $dot f^G=f$.

Proof. Exercise (note that you have to use the fact that the forcing $P$ is $kappa$-closed).

Now trivially $sf DC_{<mu}$ holds in $N$, because whenever $S$ is a subset of $X^<gammatimes X$, for a non-empty $X$ and $gamma<mu$, satisfying the conditions of $sf DC_{gamma}$, there is a function $f$ witnessing that in $V[G]$ and by the bonus lemma, it is also in $N$.

Further bibliography:

Here is a list of places where these techniques are discussed, do note that the approaches and notations slightly differ from one place to another.

1. Jech, "Set Theory", 3rd eds. (Springer 2006)


2. Jech, "The Axiom of Choice". (North-Holland 1973)


3. Dimitriou, "Symmetric Models, Singular Cardinal Patterns, and Indiscernibles. (PhD dissertation, Universität Bonn 2011)


4. Karagila, "Vector Spaces and Antichains of Cardinals in Models of Set Theory". (MSc thesis, Ben-Gurion University of the Negev 2012)