1398: Gödel showed
1962: Cohen showed
Theorem (Hartogs’s Theorem).
For every set
We denote this by Hartogs’s aleph of
Theorem.
For every set
Using Axiom of Choice, well-order
We have
|
Notation. Define:
Clearly,
Continuum Hypothesis (CH):
Generalised Continuum Hypothesis (GCH):
Why “continuum”?
Lemma.
CH if and only if
Proof.
|
Consider
Reminder:
Gödel showed
Cohen showed
Relative consistency proofs.
By Completeness Theorem, this means:
If there is
Analogy from algebra:
|
Axioms of fields: Fields.
Let
Idea: Start with
Construct by algebraic closure (not in the usual sense – here we just mean adding in
Obtain
This is easy because everything that matters (Fields and
Theorem (Substructure Lemma). All atomic formulas are absolute between substructures.
WHat if we have models of ZFC? Have
|
No function symbols nor constant symbols. So: almost nothing is atomic.
And: the formulas that we care about are definitely not atomic, but instead very complex.
Try to imagine a proof of:
If
Without loss of generality
What can we do to “get rid of
Maybe a surjection
Clearly, in
Does that show CH?
All sorts of things can happen
Assuming it is actually possible to form this smallest model
Maybe
Maybe
Consider
Consider
Consider
So
Instead of substructures, we will restrict out attention to transitive substructures: in particular, to
Next time: theorems about absoluteness for transitive substructures.
Clearly, if
Cohen’s proof becomes:
If