nLab
continuum hypothesis

The Continuum Hypothesis

Idea

The continuum hypothesis is a statement of set theory which says, roughly, that every set of real numbers is either countable or has the same cardinality as the set of all real numbers (“the continuum”). It cannot be proven or disproven from any of the usual axioms of set theory.

Statement

Definition

Let E be an elementary topos with subobject classifier Ω and natural numbers object N. The (external) continuum hypothesis in E asserts that if there is a sequence of monomorphisms

NBΩ NN \hookrightarrow B\hookrightarrow \Omega^N

then either the first or the second is an isomorphism.

In the classical case (that is, in the topos Set with the axiom of choice), this equivalently asserts that there is no strict inequality of cardinal numbers

<α<Ω {|\mathbb{N}|} \lt \alpha\lt {|\Omega^\mathbb{N}|}

which it is more common to write as

0<α<2 0\aleph_0 \lt \alpha \lt 2^{\aleph_0}

Unprovability

Theorem

There exists a boolean topos in which the axiom of choice holds and the continuum hypothesis fails.

One topos for which the theorem holds is called the Cohen topos; it is the topos of sheaves with respect to the dense topology? (also called the ¬¬-topology) on the Cohen poset. Thus, in this topos, there exist monomorphisms B2 that are both not isomorphisms.

The Cohen topos will be constructed from the topos Set of sets. For this, recall that the subobject classifier of Set is 2{0,1}. The technique of constructing such a topos is called forcing.

Definition

(Cohen poset)

Let be the set of natural numbers; i.e. the natural-numbers object in Set. Let B be a set with strictly larger cardinality B>; e.g. B2 2 will do because of the diagonal argument?. Then the Cohen poset P is defined to be the set of morphisms

p:F p2p:F_p\to 2

where F pB× is any finite subset. The order relation on P is defined by

qpiffF qF pandq F p=pq\le p\; iff\; F_q\supseteq F_p\;and\;q|_{F_p}=p

where the right-hand condition means that q restricted to F p must coincide with p.

We think of each element of P as an approximation to the function F:B× that is the transpose of the putative monomorphism

f:B2 f:B\to 2^\mathbb{N}

with “smaller” elements considered as better approximations. The very rough intuition is that pq (if pp) forms a codirected diagram of monomorphisms with domains of increasing size whose colimit is f, and that by free cocompletion (i.e. forming (pre)sheaves) we obtain a topos in which this colimit exists.

Lemma

The dense? Grothendieck topology on P is subcanonical. In other words: For any pP we have y(p)=hom(,p)Sh(p,¬¬)

Lemma

Let k B×:{PSet pB× denote the functor constant on B×. Let

A:{PSet p{(b,n)p(b,n)=0}B×A:\begin{cases} P\to Set \\ p\mapsto \{(b,n)|p(b,n)=0\}\subseteq B\times \mathbb{N} \end{cases}

Then we have ¬¬A=A in Sub(k B×); i.e. A is a closed subobject with respect to the dense topology ¬¬ in the algebra of subobjects of k B×.

Let Ω denote the subobject classifier of Psh(P). Let Ω ¬¬ denote the subobject classifier of Sh(P,¬¬). Recall that Ω ¬¬ is given by the equalizer Ω ¬¬=eq(id Ω,¬¬).

By the preceding lemma, the characteristic morphism χ a of the subobject a:Ak B×=k B×k factors through some f:k B×Ω ¬¬.

Lemma

The adjoint g:k BΩ ¬¬ k of f is a monomorphism.

Corollary

The associated-sheaf functor sends g to a monomorphism in the Cohen topos.

Unrefutability

If V is a model of ZF, then the continuum hypothesis and the axiom of choice both hold in Gödel’s constructible universe L built from V.

References

Revised on August 2, 2012 21:00:59 by Todd Trimble (67.81.93.25)