56
$\begingroup$

I'm making my way through Thomas W Hungerfords's seminal text "Abstract Algebra 2nd Edition w/ Sets, Logics and Categories" where he makes the statement that the Continuum Hypothesis (There does not exist a set with a cardinality less than the reals and no set strictly greater than the natural numbers.) is neither true or false.

This is utterly baffling to me, If it's possible to construct a set between $\mathbb{N}$ and $\mathbb{R}$ then this statement is demonstrably false, but if not then the statement is true.

This seems to be a straitforward deduction, but many with a more advanced understanding of the topic matter believe CH to be neither.

How can this be?

  • 3
    "If it's possible to construct a set between $\mathbb{N}$ and $\mathbb{R}$ then this statement is demonstrably false, but if not then the statement is true." The predominant attitude among modern mathematicians is that math doesn't have to be constructive: that we can prove things exist without constructing them explicitly, and that such a proof is satisfactory. It then becomes possible to have things that you can prove exist, and can also prove can't be constructed explicitly; this is the situation, e.g., with ultrafilters. Independence of CH from ZFC says we can't rule this out for CH.2012-09-02

7 Answers 7

69

Set theory is much more complicated than "common" mathematics in this aspect, it deals with things which you can often prove that are unprovable.

Namely, when we start with mathematics (and sometimes for the rest of our lives) we see theorems, and we prove things about continuous functions or linear transformations, etc.

These things are often simple and have a very finite nature (in some sense), so we can prove and disprove almost all the statements we encounter. Furthermore it is a good idea, often, to start with statements that students can handle. Unprovable statements are philosophically hard to swallow, and as such they should usually be presented (in full) only after a good background has been given.


Now to the continuum hypothesis. The axioms of set theory merely tell us how sets should behave. They should have certain properties, and follow basic rules which are expected to hold for sets. E.g., two sets which have the same elements are equal.

Using the language of set theory we can phrase the following claim:

If $A$ is an uncountable subset of the real numbers, then $A$ is equipotent with $\mathbb R$.

The problem begins with the fact that there are many subsets of the real numbers. In fact we leave the so-called "very finite" nature of basic mathematics and we enter a realm of infinities, strangeness and many other weird things.

The intuition is partly true. For the sets of real numbers which we can define by a reasonably simple way we can also prove that the continuum hypothesis is true: every "simply" describable uncountable set is of the size of the continuum.

However most subsets of the real numbers are so complicated that we can't describe them in a simple way. Not even if we extend the meaning of simple by a bit, and if we extend it even more, then not only we will lose the above result about the continuum hypothesis being true for simple sets; we will still not be able to cover even anything close to "a large portion" of the subsets.


Lastly, it is not that many people "believe it is not a simple deduction". It was proved - mathematically - that we cannot prove the continuum hypothesis unless ZFC is inconsistent, in which case we will rather stop working with it.

Don't let this deter you from using ZFC, though. Unprovable questions are all over mathematics, even if you don't see them as such in a direct way:

There is exactly one number $x$ such that $x^3=1$.

This is an independent claim. In the real numbers, or the rationals even, it is true. However in the complex numbers this is not true anymore. Is this baffling? Not really, because the real and complex numbers have very canonical models. We know pretty much everything there is to know about these models (as fields, anyway), and it doesn't surprise us that the claim is true in one place, but false in another.

Set theory (read: ZFC), however, has no such property. It is a very strong theory which allows us to create a vast portion of mathematics inside of it, and as such it is bound to leave many questions open which may have true or false answers in different models of set theory. Some of these questions affect directly the "non set theory mathematics", while others do not.


Some reading material:

  1. A question regarding the Continuum Hypothesis (Revised)
  2. Neither provable nor disprovable theorem
  3. Impossible to prove vs neither true nor false
  • 1
    @Timothy: The term "true" is meaningless without a context. And since set theory does not have a default context like arithmetic, just saying something is true or false is meaningless. Sure, we often use "true in ZFC" to mean "provable from ZFC", but that is an abuse of language, and not a correct way of stating it. (Twice, in two different places I made such abuse of language in a talk I gave, and twice I was paused and asked for clarification.)2017-10-25
14

A number of mathematicians have definite opinions about the truth of CH, the majority I believe opting for false, Kurt Gödel among them. What there is agreement on, because it is a theorem, is that CH is neither provable nor refutable in ZFC. But that is quite a different assertion than "neither true nor false."

The theory ZFC captures many common intuitions about sets. It has been the dominant "set theory" for many years. There is no good reason that it will remain that forever.

  • 0
    @BenCrowell Thanks for the link. The author of the WP page seems to use *mathematicians* for *mathematicians with definite opinions about the truth of CH*.2012-09-03
13

One can construct a model of set theory in which CH is true, and one can construct a model in which CH is false.

  • 0
    @GerryMyerson yes I was meaning that. Thanks.2012-09-01
13

It is not possible to explicitly "construct" such a set and prove (using the ZFC axioms of set theory) that its cardinality is strictly between those of $\mathbb N$ and $\mathbb R$. That doesn't mean that no such set exists.

As a Platonist, I would not say that CH is "neither true nor false", rather that we do not know (and in a certain sense we cannot know) which it is. Truth and provability are very different things.

  • 2
    @Programmer2134 For every statement $A$, $A\vee\neg A$ is a true statement in classical logic. But that does not mean there is a proof of $A$ or a proof of $\neg A$.2018-01-23
4

If you take the parallel axiom away from Euclidean geometry, you cannot prove (using the remaining axiom system) whether it is true or false. But even in a geometry without parallel axiom, you can have interesting results (see http://en.wikipedia.org/wiki/Absolute_geometry ).

  • 1
    WP mentions the first 28 propositions from Euclid's Elements, the exterior angle theorem and the Saccheri-Legendre theorem. Maybe this isn't *terrible* interesting, but I guess good enough to get my point across. It's just an analogy, dude...2012-09-02
1

I beleive that your confusion rise from bad definition of CH. It is not "there does not exist a set with a cardinality less than the reals and no set strictly greater than the natural numbers" as you stated it, but rather "there does not exist a set with a cardinality less than the reals AND strictly greater than that of the natural numbers.".

0

(1)To make your wording more accurate, I assume you mean "there exists" when you state it as "It's possible to construct."

(2)Truth and Falsity in logic might have a different meaning than you think. Truth and Falsity here can only be talked within a scope, which is given by ZFC axiom system. Under the consistency assumption of ZFC, the system is incomplete, meaning that there are statements there not having a T/F answer.

(3) When people say CH "is neither true or false" in this context, they really just mean that such Truth or Falsity cannot be deduced from ZFC system. More precisely, they mean that under the consistency assumption of ZFC, if you add CH or its negation to ZFC, the system remains consistent, and therefore CH and its negation cannot be deduced from ZFC.

(4) In a larger system, it is possible to give a definitive answer to CH. As a trivial example, if we add CH to ZFC, then CH would be true.

  • 0
    Thank you. I did misspelled it.2014-11-18