2 Transitive Models
Observation: If is
transitive and ,
then . This is
because if ,
then and
gives us
that by
transitivity, so ,
so .
Lemma.
Assuming that:
Then
|
Proof.
Extensionality: .
Take ,
.
Without loss of generality take .
Then
and
so .
So .
So .
Foundation: .
Take .
so
is not empty. So find
which is -minimal.
Then since
as well, we have .
Therefore
has an -minimal
element in .
□
2.1 Absoluteness for transitive models
Definition (Bounded quantifier).
We call a quantifier of the form
or
a bounded quantifier.
(Defined by
and ).
Definition (Closed under bounded quantification).
A class of formulas
is closed under bounded quantification if whenever
is in ,
then so are
and .
Definition (Delta0).
is the smallest class of formulas containing the atomic formulas that is closed under propositional
connectives and bounded quantifiers.
Let
be any theory. Then
is the class of formulas equivalent to a
formula in .
Theorem.
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
and
are absolute.
-
:
If
is true for some ,
then pick a witness .
Since ,
we have .
By the induction hypothesis, we have that .
Thus .
If ,
then
is true.
-
:
Similar. □
Corollary.
Assuming that:
-
is any theory
-
is transitive
Definition (, ).
A formula is called
if it is of the form
where
is .
It is called
if it is of the form
where
is .
(same for ,
).
Proof.
Just definition of the semantics of .
□
Example.
What is ?
-
1.
-
2.
-
3.
:
-
4.
:
-
5.
-
6.
-
7.
:
-
8.
:
-
9.
-
10.
-
11.
-
12.
-
13.
Definition (Absolute function).
Let
a transitive set, and (note
that this means that
is closed under ).
We say is absolute
for if there is a
formula which
is absolute for
such that
|
Observation: So, if is closed
under pairing (), then
the pairing operation is
absolute, and therefore .
Similarly for union.
Lemma.
Assuming that:
Then
are absolute for .
Proof.
Check the definitions! □
Example.
More examples:
-
(14)
is
an ordered pair:
|
-
(15)
-
(16)
-
(17)
-
(18)
-
(19)
-
(20)
-
(21)
-
(22)
Ordinals
“ is an ordinal”
means is
transitive and
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
is
transitive, then
|
characterises ordinals. But this is clearly in .
So: being an ordinal is absolute for transitive models.
Thus . This is
transitive, thus there is
such that .
Also absolute:
Cardinals
“ is a
cardinal” if and only if
|
Note that is not
bounded (while
is bounded).
Observe: this is
and therefore downwards absolute.
2.2 Non-absoluteness
Assume that
is transitive and countable. Then
However,
implies .
Let be such
that .
But is a
countable ordinal, so not a cardinal.
Consequence: All cardinals in
except
are going to be fake.
So “ is a
cardinal” can’t be absolute.
Note.
This also shows that “”
cannot be absolute:
Take
such that .
Then ,
but is countable since .
Thus .
Therefore “”
is not absolute.
Recall the general proof strategy mentioned before:
If
is a countable transitive set such that ,
then there is a a countable transitive set
such that .
Question: Is this really solving the original problem? i.e.
.
It’s not obvious that
implies that there is a countable transitive model (ctm) of ZFC.
Answer: That’s not only not obvious, but fake.
Let’s prove that
there is
a countable transitive model of ZFC.
Why? Note that ,
or for
any is
. So, it’s
absolute for transitive models.
So if is a countable transitive
model of ZFC, then is
true, so by absoluteness, .
So .
This contradicts Gödel’s Incompleteness Theorem.
We can get a proof of
via a trick ( Example Sheet 1).
Lemma (Cohen Lemma).
Assuming that:
This reduces the problem to:
Find countable transitive models of
for sufficiently large finite .
Definition (Hierarchy).
We call an assignment
a hierarchy if
-
(i)
is a transitive set
-
(ii)
-
(iii)
-
(iv)
If is a hierarchy, we
can define . This is
a proper class as .
We also define , a
notion of -rank.
Paradigmatic example: von Neumann hierarchy ,
and is
the entire universe.
Theorem 2.1 (Levy Reflection Theorem).
Assuming that:
-
is a hierarchy
-
is a formula
Then there are unboundedly many
such that is
absolute between
and .
Proposition 2.2 (Tarski-Vaught Test).
Assuming that:
Then is an elementary substructure
if and only if for any formula
and , if there
is such that
, then there
is such
that .
TVT:
Let and
be a
collection of formulas closed under subformulas. Then the following are equivalent:
-
(i)
All formulas in
are absolute between
and .
-
(ii)
For all ,
the TV-condition holds: if ,
then for all
if there is
sucht hat ,
then there is
such that .
Warm-up: let .
Find countable
such that .
Suppose
and .
Let be
a witness for this:
(if necessary, use Axiom of Choice).
(if , then let
).
Set:
Note:
Remark.
In general, even if
is transitive,
is not.
For example, if ,
then
|
is true in .
So . But
, since
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 .
For each
and ,
write
Then Tarski-Vaught Test implies that
and agree
on .
□
Corollary.
If is
finite, then there is
transitive such that .
Proof.
Let .
Since ,
we have that
is true. By Levy Reflection Theorem, we can find
such that .
Note
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
, and hence
get .
The problem is the case distinction in the definition of
: it requires to
check whether
is true.
Next goal: Obtain some
countable such that
and is
transitive.
TODO
Theorem (Mostowski’s Collapsing Theorem).
Let
be a relation
on a set
that is well-founded and extensional. Then there exists a transitive set
, adn a
bijection
such that .
Moreover,
and are
unique.
Proof.
Without loss of generality that
contains the axiom of extensionality. Form
transitive by Levy Reflection Theorem.
Use warm-up to obtain
countable. This is extensional and well-founded, so by Mostowski find
transitive such that
Then
adn ,
so
is countable. □
The next few lectures will be spent proving
using Gödel’s constructible universe.
Absoluteness is preserved under transfinite recursion.
Let be
three operations.
Proof.
Attempts: set functions satisfying the ().
-
L1
All attempts agree on their common domain.
-
L2
attempt such that .
if and only if there
exists attempt
with
and .
□
Note that for fixed, there is a
finite fragment that proves the
recursion theorem instance for .
Theorem.
If and
are absolute for
transitive models of ,
then so is
defined by ().
Want ,
and
proves
existence of .
Convention: We say “ is
sufficiently strong” if
is finite and
proves hte existence of all relevant operations such that they are absolute for transitive models of
.
Proof.
Observe that by assumption, being an “attempt” is absolute for transitive models of .
Let be
transitive.
-
(1)
To show: If ,
then .
If ,
then .
Without the ,
this would be absolute. So when we include the existential quantifier, we get an upwards absolute
sentence.
Thus: there is
such that
is an attempt and .
So .
-
(2)
Other direction. Assume
is an attempt with .
Since ,
we have
|
Since it is absolute,
is a real attempt.
By ???, .
Hence .
□
Note.
This uses the fact that “”
concepts are absolute.
Definition (Delta1T property).
A property is called
if it’s both
and .
Observe: concepts are
absolute (upwards from
and downwards from ).
Typical Applications
Bounding a quantifier by operation.
Let be an operation
and strong
enough to prove
is an operation and absolute.
Then the quantifiers
and
preserve absoluteness.
Applications
-
(1)
Encode formulas as elements of .
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| | | | | | | | | | | | |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
would
be .
. So,
is absolute for some (sufficiently strong) finite fragment of
(see
Example Sheet 1).
-
(2)
If is
any set then
(which means “”)
is defined by the usual (Tarski) recursion and thus also absolute ( Example Sheet 1).
2.3 The constructible hierarchy
Fix a set .
Define for each
and each
(parameter)
the subset of
defined by with
parameter .
For a sufficiently strong
finite, we have that
proves that
is an absolute operation (see Example Sheet 1).
|
This is absolute for a sufficiently strong theory (use Replacement to get
).
This
is sometimes (misleadingly) called the “definable power set of
” (it is misleading because it
is more like a “definable (by )
power set of ”).
()
Obvious: . Also:
If is transitive,
then so is .
The constructible
hierarchy.
We usually write .
Claim:
is a hierarchy (in the sense of Lecture). See Example Sheet 1.
By closure of absoluteness under transfinite recursion, the
-hierarchy is absolute
for transitive models of
where
is strong enough to prove that it exists.
i.e. if
transitive and
and ,
then .
So
The main theorem of next lecture will be:
If and
transitive, then
(Minimal -model).
Some first idea of what the -hierarchy
is like
Clearly, by induction, ,
and clearly for ,
. So
.
|
If , then
|
Thus .
Therefore ,
and
.
This means: (since
the first has size , while
the second has size ).
Note: This does not mean .
( means
).
is called
the “axiom of constructibility”.
There is a finite fragment
of [!]
that proves that all of the operations occuring in the definition of
, i.e.
are
well-defined and absolute.
Thus, if is a
transitive model of ,
then
and thus .
So .
Axioms of ZF
Structural axioms:
-
Extensionality:
|
-
Foundation:
|
-
Infinity:
|
Functional axioms:
-
Pairing:
|
-
Union:
|
-
Powerset:
|
-
Separation :
|
-
Replacement :
|
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
transitive with
will satisfy the axiom of infinity. TODO
Now do pairing and union.
Since the definitions of pairs and unions
are absolute for transitive models, it’s enough to show that
If ,
,
Powerset axiom.
The problem here is that is not
obviously absolute. In particular,
is not absolute.
Consider :
we have
and is
countable.
In , we
find
which is the best possible answer to the question “what is the power set of
?” that
can
give, but unlikely to be the correct answer.
Consider instead
and define
(reminder:
is the least
such that )
By Replacement, is a
set of ordinals, so find .
Then .
Therefore ,
so .
Separation:
|
If ,
then
If is not
absolute between
and ,
this won’t work.
Levy Reflection Theorem to the rescue:
such that is
absolute between
and .
Thus: form
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:
Then for all ,
. Axiom
of TODO.
Remark.
Remark on the Axiom of Choice.
Gödel (1938): .
Note first that everything we did so far only needed
in the universe. We will sketch that .
In fact a strong version of
known as GLOBAL CHOICE: there is an absolutely definable bijective operation between
and .
Sketch: Recursive construction of bijections
for some ordinal ,
and such that for
we have .
If is a limit
and is
defined for ,
then let
if .
Suppose
and
is given by .
Consider . Well-order
it in order type
via the induced
well-order. Then if ,
say
|
TODO
Cohen:
finite,
finite such that
if is a countable
transitive model of ,
then there is countable
transitive model of .
()
We have seen ( Example Sheet 1) that ()
implies .
Simplified: If is a countable
transitive model of ,
then there is countable
transitive model of .
Idea: If is a countable
transitive model of :
;
;
injection.
Force such
that
and .
Observe that there is a countable transitive model
such
that
and .
is transitive and
countable. Thus LSM gives
transitive countable with .
Know is an injection,
but no clue what
and in
are.
How do we control what we add?