2 Transitive Models

Observation: If M is transitive and M⊨“e is empty”, then e=∅. This is because if w∈e, then w∈e and e∈M gives us that w∈M by transitivity, so M⊨w∈e, so M⊨“e is not empty”.

Lemma. Assuming that:

  • M is transitive

Then
M⊨Extensionality+Foundation.

Proof. Extensionality: ∀⁡x∀⁡y(∀⁡w(w∈x↔w∈y)→x=y). Take x≠y, x,y∈M. Without loss of generality take z∈x∖y. Then z∈x and x∈M so z∈M. So M⊨z∈x∧z∉y. So M⊨¬⁡∀⁡w(w∈x↔w∈y).

Foundation: ∀⁡x(x≠∅→∃⁡m(m∈x∧∀⁡w¬⁡(w∈m∧w∈x))). Take x∈M. M⊨x≠∅ so x is not empty. So find m∈x which is ∈-minimal. Then since x∈M as well, we have m∈M. Therefore x has an ∈-minimal element in M. □

2.1 Absoluteness for transitive models

Definition (Bounded quantifier). We call a quantifier of the form ∃⁡x∈y,φ or ∀⁡x∈y,φ a bounded quantifier.

(Defined by ∃⁡x∈y,φ:=∃⁡x(x∈y∧φ) and ∀⁡x∈yφ:=∀⁡x(x∈y→φ)).

Definition (Closed under bounded quantification). A class of formulas Γ is closed under bounded quantification if whenever φ is in Γ, then so are ∃⁡x∈y,φ and ∀⁡x∈y,φ.

Definition (Delta0). Δ0 is the smallest class of formulas containing the atomic formulas that is closed under propositional connectives and bounded quantifiers.

Let T be any theory. Then Δ0T is the class of formulas equivalent to a Δ0 formula in T.

Theorem. Δ0 formulas are absolute for transitive models.

Proof. By induction:

  • (1) All atomic formulas are absolute by the substructure lemma.
  • (2) Propositional connectives: exactly the same proof as in the substructure lemma.
  • (3) Assume that φ is absolute and show that ∃⁡x∈y,φ and ∀⁡x∈y,φ are absolute.
    • ∃⁡x∈y,φ: If ∃⁡x∈y,φ is true for some y∈M, then pick a witness x∈y. Since y∈M, we have x∈M. By the induction hypothesis, we have that M⊨φ(x,y). Thus M⊨∃⁡x(x∈y∧φ(x,y)).

      If M⊨∃⁡x(x∈y∧φ(x,y)), then x∈y∧φ(x,y) is true.

    • ∀⁡x∈y,φ: Similar. □

Corollary. Assuming that:

  • T is any theory

  • M⊨T is transitive

Then Δ0T-formulas are absolute for M.

Definition (Sigma1, Pi1). A formula is called Σ1 if it is of the form ∃⁡x1,…∃⁡xn,φ where φ is Δ0.

It is called Π1 if it is of the form ∀⁡x1,…,∀⁡xn,φ where φ is Δ0.

(same for Σ1T, Π1T).

Proof. Just definition of the semantics of ∃⁡,∀⁡. □

Example. What is Δ0?

  • 1. x∈y
  • 2. x=y
  • 3. x⊆y: ⟺∀⁡w∈x(w∈y)
  • 4. z={x}: ⟺x∈z∧∀⁡w∈z(w=x)
  • 5. z={x,y}
  • 6. z=(x,y)={{x},{x,y}}
  • 7. z=∅: ⟺∀⁡w∈z(w≠w)
  • 8. z=x∪y: ⟺x⊆z∧y⊆z∧∀⁡w∈z(w∈x∨w∈y)
  • 9. z=x∩y
  • 10. z=x∖y
  • 11. z=x∪{x}
  • 12. z is transitive
  • 13. z=⋃⁡x

Definition (Absolute function). Let M a transitive set, and F:Mn→M (note that this means that M is closed under F). We say F is absolute for M if there is a formula Φ which is absolute for M such that

F(x1,…,xn)=z⟺Φ(x1,…,xn,z).

Observation: So, if M is closed under pairing (∀⁡x,y∈M,{x,y}∈M), then the pairing operation x,y↦{x,y} is absolute, and therefore M⊨Pairing.

Similarly for union.

Lemma. Assuming that:

Then ψ(x1,…,xm):=φ(G1(x1,…,xm),…,Gn(x1,…,xm))H(x1,…,xm):=F(G1(x1,…,xm),…,Gn(x1,…,xm))

are absolute for M.

Proof. Check the definitions! □

Example. More examples:

  • (14) z is an ordered pair:
    ∃⁡s∈z,∃⁡d∈z,∃⁡x∈s,∃⁡y∈d,(∀⁡w∈s,(w=x)∧∀⁡v∈d,(v=x∧v=y)∧∀⁡w∈z,(w=s∨w=d)).
  • (15) z=a×b
  • (16) z is a relation
  • (17) z=dom⁡x
  • (18) z=range⁡x
  • (19) z is a function
  • (20) z is injective
  • (21) z is surjective
  • (22) z is bijective

Ordinals

“x is an ordinal” means x is transitive and (x,∈) is a well-order.

We know: being well-founded is not expressible in first-order logic (see Example Sheet 1).

Because all transitive models satisfy Foundation, we have that if M is transitive, then

M⊨x is transitive∧(x,∈) is linearly ordered.

characterises ordinals. But this is clearly in Δ0.

So: being an ordinal is absolute for transitive models.

Thus M∩Ord⁡={x∈M:M⊨x is an ordinal}. This is transitive, thus there is α∈Ord⁡ such that α=M∩Ord⁡.

Also absolute:

Cardinals

“x is a cardinal” if and only if

x is an ordinal∧∀⁡f,∀⁡y∈x,f:y→x⟹f is not a surjection

Note that ∀⁡f is not bounded (while ∀⁡y∈x is bounded).

Observe: this is Π1 and therefore downwards absolute.

Remark.

  • (1) We may not want this to be absolute. If it was, we couldn’t change cardinal behaviour.
  • (2) We can’t obviously bound ∀⁡f, since the natural bound would be
    {h:h→y→x}

    or

    P(y×x).

    These, however, are not (yet??) on our list of absolute concepts.

  • (3) Not that neither (1) nor (2) is an argument, since there could be an equivalent formula that is Δ0.

2.2 Non-absoluteness

Assume that M⊨ZFC is transitive and countable. Then

M∩Ord⁡=α<ω1.

However, M⊨ZFC implies M⊨there are uncountable cardinals.

Let β<α be such that M⊨β is the least uncountable cardinal.

But β is a countable ordinal, so not a cardinal.

Consequence: All cardinals in M except ℵ0 are going to be fake.

So “x is a cardinal” can’t be absolute.

Note. This also shows that “x=P(y)” cannot be absolute:

Take y such that M⊨y=P(ω). Then y⊆P(ω), but is countable since y⊆M.

Thus y≠P(ω). Therefore “x=P(y)” is not absolute.

Recall the general proof strategy mentioned before:

If M is a countable transitive set such that M⊨ZFC, then there is a a countable transitive set N⊇M such that N⊨ZFC+¬⁡CH.

Question: Is this really solving the original problem? i.e. Con⁡(ZFC)⟹Con⁡(ZFC+¬⁡CH).

It’s not obvious that Con⁡(ZFC) implies that there is a countable transitive model (ctm) of ZFC.

Answer: That’s not only not obvious, but fake.

Let’s prove that Con⁡(ZFC) ⁄⟹ there is a countable transitive model of ZFC.

Why? Note that Con⁡(ZFC), or Con⁡(T) for any T is Δ0. So, it’s absolute for transitive models.

So if M is a countable transitive model of ZFC, then Con⁡(ZFC) is true, so by absoluteness, M⊨Con⁡(ZFC). So M⊨ZFC+Con⁡(ZFC). This contradicts Gödel’s Incompleteness Theorem.

We can get a proof of

Con⁡(ZFC)⟹Con⁡(ZFC+¬⁡CH)

via a trick ( Example Sheet 1).

Lemma (Cohen Lemma). Assuming that:

  • T⊆ZFC

Then there is finite T∗⊆ZFC such that if M is a countable transitive model of T∗, then there is N⊇M such that N is a countable transitive model of T+¬⁡CH.

This reduces the problem to:

Find countable transitive models of T∗ for sufficiently large finite T∗⊆ZFC.

Definition (Hierarchy). We call an assignment α↦Zα a hierarchy if

  • (i) Zα is a transitive set
  • (ii) Ord⁡∩Zα=α
  • (iii) α<β⟹Zα⊆Zβ
  • (iv) λ limit⟹Zλ=⋃⁡α<λZα

If {Zα:α∈Ord⁡} is a hierarchy, we can define Z:=⋃⁡α∈Ord⁡Zα. This is a proper class as Ord⁡⊆Z. We also define ρZ(x):=min⁡{α:x∈Zα}, a notion of Z-rank.

Paradigmatic example: von Neumann hierarchy Vα, and V is the entire universe.

Theorem 2.1 (Levy Reflection Theorem). Assuming that:

  • Z is a hierarchy

  • φ is a formula

Then there are unboundedly many 𝜃 such that φ is absolute between Z𝜃 and Z.

Proposition 2.2 (Tarski-Vaught Test). Assuming that:

  • M is a substructure of N

Then M is an elementary substructure if and only if for any formula ϕ(v,w¯) and a¯∈M, if there is b∈N such that N⊨ϕ(b,a¯), then there is c∈M such that N⊨ϕ(c,a¯).

TVTΦ:

Let M⊆N and Φ be a collection of formulas closed under subformulas. Then the following are equivalent:

Warm-up: let (M,∈)⊨ZFC. Find countable N⊆M such that (N,∈)≺(M,∈).

Suppose p¯=(p0,…,pn)∈M and M⊨∃⁡y,ψ(y,p¯). Let w(ψ,p¯) be a witness for this:

M⊨ψ(w(ψ,p¯),p¯)

(if necessary, use Axiom of Choice).

(if M⊨¬⁡∃⁡y,ψ(y,p¯), then let w(ψ,p¯)=∅).

Set:

N0:=∅Ni+1:={w(ψ,p¯):ψ formula and p¯∈N1<ω}N:=⋃i∈ωNi

Note:

Remark. In general, even if M is transitive, N is not.

For example, if ω1∈M, then

∃⁡x,(x is the least countable ordinal)

is true in M.

w(ψ,∅)=ω1.

So ω1∈N. But ω1⊆N, since N is countable.

Relevant later!

Also see Example Sheet 1.

Proof of Levy Reflection Theorem. Fix φ and let Φ be its collection of subformulas. This is a finite set!

Need to show: ∀⁡α,∃⁡𝜃>α such that Z𝜃⊨φ⟺Z⊨φ.

For each ψ∈Φ and p¯=(p0,…,pn), write

o(ψ,p¯):={least α such that ∃⁡y∈Zα with Z⊨ψ(y,p¯)if it exists0otherwiseo(p¯):=max⁡ψ∈Φo(ψ,p¯)𝜃0:=α+1𝜃i+1:=sup⁡{o(p¯):p¯∈Z𝜃i<ω}𝜃:=sup⁡i∈ω𝜃i

Then Tarski-Vaught Test implies that Z𝜃 and Z agree on φ. □

Corollary. If T⊆ZFC is finite, then there is M transitive such that M⊨T.

Proof. Let φ:=∧⁡ψ∈Tψ. Since ZFC⊢φ, we have that φ is true. By Levy Reflection Theorem, we can find 𝜃 such that V𝜃⊨φ. Note V𝜃 is transitive. □

Remark about the proof of Levy Reflection Theorem:

Can you do the same if Φ is infinite?

Of course not: otherwise we colud prove that there exists 𝜃 such that V𝜃⊨ZFC, and hence get Con⁡(ZFC).

The problem is the case distinction in the definition of o(ψ,p¯): it requires to check whether ∃⁡y,ψ is true.

Next goal: Obtain some M⊆V𝜃 countable such that M⊨φ and M is transitive.

TODO

Theorem (Mostowski’s Collapsing Theorem). Let r be a relation on a set a that is well-founded and extensional. Then there exists a transitive set b, adn a bijection f:a→b such that (∀⁡x,y∈a)(x r y⟺f(x)∈f(y)). Moreover, b and f are unique.

Proof. See Logic and Set Theory. □

Corollary. For every T⊆ZFC finite, there is a countable transitive model of T.

Proof. Without loss of generality that T contains the axiom of extensionality. Form M⊨T transitive by Levy Reflection Theorem.

Use warm-up to obtain N≺M countable. This is extensional and well-founded, so by Mostowski find W transitive such that

(W,∈)≅(N,∈).

Then W⊨T adn |W|=||, so W is countable. □

The next few lectures will be spent proving Con⁡(ZFC+CH) using Gödel’s constructible universe.

Absoluteness is preserved under transfinite recursion.

Let F,G,H be three operations.

R(0,x¯):=F(x¯)R(α+1,x¯):=G(α,R(α,x¯),x¯)R(λ,x¯):=H(λ,{R(α,x¯):α<λ},x¯)(∗)

Proof. Attempts: set functions satisfying the (∗).

  • L1 All attempts agree on their common domain.
  • L2 ∀⁡α,∃⁡r attempt such that (α,x¯)∈dom⁡(r).

R(α,x¯):=y if and only if there exists attempt r with (α,x¯)∈dom⁡(r) and r(α,x¯)=y. □

Note that for F,G,H fixed, there is a finite fragment TF,G,H⊆ZFC that proves the recursion theorem instance for F,G,H.

Theorem. If T⊇TF,G,H and F,G,H are absolute for transitive models of T, then so is R defined by (∗).

Want TF,G,H⊢L1(F,G,H), TF,G,H⊢L2(F,G,H) and TF,G,H proves existence of R.

Convention: We say “T is sufficiently strong” if T⊆ZFC is finite and T proves hte existence of all relevant operations such that they are absolute for transitive models of T.

Proof. Observe that by assumption, being an “attempt” is absolute for transitive models of T.

Let M⊨T be transitive.

  • (1) To show: If M⊨R(α,x¯)=z, then R(α,x¯)=z.

    If M⊨R(α,x¯)=z, then M⊨∃⁡r, r is an attempt and r(α,x¯)=z. Without the ∃⁡r, this would be absolute. So when we include the existential quantifier, we get an upwards absolute sentence.

    Thus: there is r such that r is an attempt and r(α,x¯)=z. So R(α,x¯)=z.

  • (2) Other direction. Assume r is an attempt with r(α,x¯)=z.

    Since TF,G,H⊢L2(F,G,H), we have

    M⊨∃⁡r′, r′ is an attempt and (α,x¯)∈dom⁡r′⏟absolute.

    Since it is absolute, r′ is a real attempt.

    By ???, r′(α,x¯)=r(α,x¯). Hence M⊨R(α,x¯)=z. □

Note. This uses the fact that “Δ1” concepts are absolute.

Definition (Delta1T property). A property is called Δ1T if it’s both Σ1T and Π1T.

Observe: Δ0T concepts are absolute (upwards from Σ1 and downwards from Π1).

Typical Applications

Bounding a quantifier by operation.

Let F be an operation and T strong enough to prove F is an operation and absolute.

T⊢∀⁡x,∃⁡z,F(x)=zT⊢∀⁡x,∀⁡z,∀⁡z′,F(x)=z∧F(x)=z′→z=z′

Then the quantifiers ∃⁡y∈F(x) and ∀⁡y∈F(x) preserve absoluteness.

∃⁡y∈F(x)ψ⟺∃⁡z(z=F(x)∧∃⁡y∈zψ)⏟absolute⏟upwards absolute⟺∀⁡z(z=F(x)→∃⁡y∈zψ)⏟absolute⏟downwards absolute
Applications

2.3 The constructible hierarchy

Fix a set X. Define for each φ∈Fml⁡ and each p∈X<ω (parameter)

D(φ,p,X):={w∈X:X⊨φ(p,w)}

the subset of X defined by φ with parameter p.

For a sufficiently strong T⊆ZFC finite, we have that T proves that D is an absolute operation (see Example Sheet 1).

D(X):={D(φ,p,X):φ∈Fml⁡,p∈X<ω}.

This is absolute for a sufficiently strong theory (use Replacement to get D(X)).

This D(X) is sometimes (misleadingly) called the “definable power set of X” (it is misleading because it is more like a “definable (by X) power set of X”).

(α∈D(X)⟺∃⁡φ∈Fml⁡,∃⁡p∈X<ω,a=D(φ,p,X))

Obvious: D(X)⊆P(X). Also: If X is transitive, then so is D(X).

L0:=∅Lα+1:=D(Lα)Lλ=⋃α<λLα The constructible hierarchy.

We usually write L:=⋂⁡α∈Ord⁡Lα.

Claim: L is a hierarchy (in the sense of Lecture). See Example Sheet 1.

By closure of absoluteness under transfinite recursion, the L-hierarchy is absolute for transitive models of T⊆ZFC where T is strong enough to prove that it exists.

i.e. if M⊨T transitive and α∈Ord⁡∩M and M⊨X=Lα, then X=Lα. So

⋃α∈Ord⁡∩MLα⊆M.

The main theorem of next lecture will be:

If L⊨ZF and M⊨ZF transitive, then

⋃α∈Ord⁡∩MLα⊨ZF.

(Minimal ZF-model).

Some first idea of what the L-hierarchy is like

Clearly, by induction, Lα⊆Vα, and clearly for n∈ω, Ln=Vn. So Lω=Vω.

Lα+1:=⋃φ∈Fml⁡⋃p∈Lα<ω{D(φ,p,Lα)}.

If α≥ω, then

|Lα+1|≤ℵ0⋅|Lα<ω|=ℵ0⋅|Lα|.

Thus |Lα|=|Lα+1|.

Therefore α<ω1, |Lα|=ℵ0 and |Lω1|=ℵ1.

This means: Vω+1≠Lω+1 (since the first has size 2ℵ0, while the second has size ℵ0).

Note: This does not mean V≠L. (V=L means ∀⁡x,∃⁡α,x∈Lα).

V=L is called the “axiom of constructibility”.

There is a finite fragment T𝕃 of ZF[!] that proves that all of the operations occuring in the definition of 𝕃, i.e. Fml⁡,X<ω,⊨,D,D are well-defined and absolute.

Thus, if M is a transitive model of T𝕃, then

∀⁡α∈Ord⁡∩M,𝕃α∈M

and thus 𝕃α⊆M.

So ⋃⁡α∈Ord⁡∩M𝕃α⊆M.

Axioms of ZF

Structural axioms:

Functional axioms:

Now we check that these hold in 𝕃.

In Lecture 2, we proved Extensionality and Foundation in all transitive structures, so also in 𝕃.

Note that ω satisfies the condition of the axiom of infinity, so any M transitive with ω∈M will satisfy the axiom of infinity. TODO

Now do pairing and union.

Since the definitions of pairs and unions

z={x,y}z=⋃x

are absolute for transitive models, it’s enough to show that

∀⁡x,y∈𝕃,{x,y}∈𝕃∀⁡x∈𝕃⋃x∈𝕃

If x,y∈𝕃α, φ(w,x,y):=w=x∨w=y,

D(φ,(x,y),Lα)={w∈Lα:Lα⊨φ(w,x,y)}={w∈Lα:Lα⊨w=x∧w}TODO

Powerset axiom.

∀⁡x,∃⁡p,∀⁡w,(w∈p↔w⊆x)⏟∗

The problem here is that ∗ is not obviously absolute. In particular, z=P(x) is not absolute.

Consider 𝕃ω+1: we have ω∈𝕃ω+1 and P∩𝕃ω+1 is countable.

In 𝕃ω+2, we find

{a∈𝕃ω+1:a⊆ω}

which is the best possible answer to the question “what is the power set of ω?” that 𝕃ω+1 can give, but unlikely to be the correct answer.

Consider instead P(ω)∩𝕃=:P and define

Ω:={ρ𝕃(a):a∈P}.

(reminder: ρ𝕃(a) is the least α such that a∈𝕃α+1)

By Replacement, Ω is a set of ordinals, so find α>Ω. Then P⊆𝕃α.

Therefore P={a∈𝕃α:a⊆ω}∈𝕃α+1, so P∈𝕃.

Separation:

∀⁡p¯,∀⁡x,∃⁡s,∀⁡w,(w∈s↔w∈x∧φ(w,p¯)⏟φ′(w,x,p¯))

If x∈𝕃α, then

D(φ′,x,Lα):={w∈Lα:Lα⊨φ′(w,x,p¯)}={w∈Lα:Lα⊨w∈x∧φ(w,p¯)}=?{w∈𝕃⏟not a problem:𝕃⏟this is a problem⊨w∈x∧φ(w,p¯)}

If φ is not absolute between Lα and L, this won’t work.

Levy Reflection Theorem to the rescue: ∀⁡φ,∀⁡α,∃⁡𝜃>α such that φ is absolute between L𝜃 and L.

Thus: form

D(φ′,x,L𝜃)={w∈L𝜃:L𝜃⊨w∈x∧φ(w,p¯)}=absolute{w∈L𝜃:L⊨w∈x∧φ(w,p¯)}

Replacement:

This will be on Example Sheet 2. The proof is a combination of the ideas from power set and separation.

Corollary 2.3 (Minimality). Assuming that:

  • T is a transitive model of ZF

Then for all α∈T∩Ord⁡, 𝕃α⊆T. Axiom of TODO.

Remark. Remark on the Axiom of Choice.

Gödel (1938): Con⁡(ZF)→Con⁡(ZFC).

Note first that everything we did so far only needed ZF in the universe. We will sketch that 𝕃⊨AC. In fact a strong version of AC known as GLOBAL CHOICE: there is an absolutely definable bijective operation between 𝕃 and Ord⁡.

Sketch: Recursive construction of bijections πα:𝕃α→ηα for some ordinal ηα, and such that for β<α we have πα|𝕃β=πβ.

If λ is a limit and πα is defined for α<λ, then let

πλ(x):=πα(x)

if x∈𝕃α.

Suppose α=β+1 and πβ is given by πβ:𝕃β→ηβ.

Consider Fml⁡×Lβ<ω. Well-order it in order type ηβ′ via the induced πβ well-order. Then if x∈Lα, say

πα(x):={πβ(x)if x∈Lβηβξif ξ is the ordinal corresponding to the least (φ,p¯) such that x=D(φ,p¯,TODO)

TODO

Cohen:

∀⁡T⊆ZFC finite, ∃⁡T∗⊆ZFC finite such that if M is a countable transitive model of T∗, then there is N⊇M countable transitive model of T+¬⁡CH. (∗)

We have seen ( Example Sheet 1) that (∗) implies Con⁡(ZFC)⟹Con⁡(ZFC+¬⁡CH).

Simplified: If M is a countable transitive model of ZFC, then there is N⊇M countable transitive model of ZFCh=¬⁡CH.

Idea: If M is a countable transitive model of ZFC: α:=ω1M; β:=ω2M; f:β→P(ω) injection. Force N such that f∈N and M⊆N.

Observe that there is a countable transitive model N such that f∈N and M⊆N. M∪tcl⁡({f}) is transitive and countable. Thus LSM gives N transitive countable with M∪tcl⁡({f})⊆N. Know N⊨∃⁡g:β→P(ω) is an injection, but no clue what ℵ1 and ℵ2 in N are.

How do we control what we add?