Encyclopedia Britannica

  • Games & Quizzes
  • History & Society
  • Science & Tech
  • Biographies
  • Animals & Nature
  • Geography & Travel
  • Arts & Culture
  • On This Day
  • One Good Fact
  • New Articles
  • Lifestyles & Social Issues
  • Philosophy & Religion
  • Politics, Law & Government
  • World History
  • Health & Medicine
  • Browse Biographies
  • Birds, Reptiles & Other Vertebrates
  • Bugs, Mollusks & Other Invertebrates
  • Environment
  • Fossils & Geologic Time
  • Entertainment & Pop Culture
  • Sports & Recreation
  • Visual Arts
  • Demystified
  • Image Galleries
  • Infographics
  • Top Questions
  • Britannica Kids
  • Saving Earth
  • Space Next 50
  • Student Center

Equations written on blackboard

continuum hypothesis

Our editors will review what you’ve submitted and determine whether to revise the article.

  • HMC Mathematics Online Tutorial - Continuum Hypothesis
  • Wolfram MathWorld - Continuum Hypothesis

continuum hypothesis , statement of set theory that the set of real number s (the continuum) is in a sense as small as it can be. In 1873 the German mathematician Georg Cantor proved that the continuum is uncountable—that is, the real numbers are a larger infinity than the counting numbers—a key result in starting set theory as a mathematical subject. Furthermore, Cantor developed a way of classifying the size of infinite sets according to the number of its elements, or its cardinality . ( See set theory: Cardinality and transfinite numbers .) In these terms, the continuum hypothesis can be stated as follows: The cardinality of the continuum is the smallest uncountable cardinal number.

In Cantor’s notation, the continuum hypothesis can be stated by the simple equation 2 ℵ 0  = ℵ 1 , where ℵ 0 is the cardinal number of an infinite countable set (such as the set of natural numbers), and the cardinal numbers of larger “ well-orderable sets ” are ℵ 1 , ℵ 2 , …, ℵ α , …, indexed by the ordinal numbers. The cardinality of the continuum can be shown to equal 2 ℵ 0 ; thus, the continuum hypothesis rules out the existence of a set of size intermediate between the natural numbers and the continuum.

Equations written on blackboard

A stronger statement is the generalized continuum hypothesis (GCH): 2 ℵ α  = ℵ α + 1 for each ordinal number α. The Polish mathematician Wacław Sierpiński proved that with GCH one can derive the axiom of choice .

Zermelo-Fraenkel axioms

Since ZF neither proves nor disproves the continuum hypothesis, there remains the question of whether to accept the continuum hypothesis based on an informal concept of what sets are. The general answer in the mathematical community has been negative: the continuum hypothesis is a limiting statement in a context where there is no known reason to impose a limit. In set theory, the power-set operation assigns to each set of cardinality ℵ α its set of all subsets, which has cardinality 2 ℵ α . There seems to be no reason to impose a limit on the variety of subsets that an infinite set might have.

  • Continuum Hypothesis
  • 1.1 Generalized Continuum Hypothesis
  • 2 Hilbert $23$
  • 3 Historical Note

There is no set whose cardinality is strictly between that of the integers and the real numbers .

Symbolically, the continuum hypothesis asserts:

Generalized Continuum Hypothesis

The Generalized Continuum Hypothesis is the proposition:

Let $x$ and $y$ be infinite sets .

In other words, there are no infinite cardinals between $x$ and $\powerset x$.

Hilbert $23$

This problem is no. $1$ in the Hilbert $23$ .

Historical Note

The Continuum Hypothesis was originally conjectured by Georg Cantor .

In $1940$, Kurt Gödel showed that it is impossible to disprove the Continuum Hypothesis (CH for short) in Zermelo-Fraenkel set theory (ZF) with or without the Axiom of Choice ( ZFC ).

In $1963$, Paul Cohen showed that it is impossible to prove CH in ZF or ZFC .

These results together show that CH is independent of both ZF and ZFC .

Note, however, that these results do not settle CH one way or the other, nor do they establish that CH is undecidable.

They merely indicate that CH cannot be proved within the scope of ZF or ZFC , and that any further progress will depend on further insights on the nature of sets and their cardinality .

It has been suggested that a key factor contributing towards the difficulty in resolving this question may be the fact that Gödel's Incompleteness Theorems prove that there is no possible formal axiomatization of set theory that can represent the entire spread of possible properties that can uniquely specify any possible set .

  • 1996:  H. Jerome Keisler  and Joel Robbin : Mathematical Logic and Computability  ... (previous)  ... (next) : Appendix $\text{A}.6$: Cardinality
  • 1972:  A.G. Howson : A Handbook of Terms used in Algebra and Analysis  ... (previous)  ... (next) : $\S 4$: Number systems $\text{I}$: A set-theoretic approach
  • 1998:  David Nelson : The Penguin Dictionary of Mathematics  (2nd ed.)  ... (previous)  ... (next) : continuum hypothesis
  • 2008:  Paul Halmos  and Steven Givant : Introduction to Boolean Algebras  ... (previous) : Appendix $\text{A}$: Set Theory: Cardinal Numbers
  • 2008:  David Nelson : The Penguin Dictionary of Mathematics  (4th ed.)  ... (previous)  ... (next) : continuum hypothesis
  • 2010:  Raymond M. Smullyan  and Melvin Fitting : Set Theory and the Continuum Problem  (revised ed.)  ... (previous)  ... (next) : Chapter $1$: General Background: $\S 5$ The continuum problem
  • Cardinality of Continuum
  • Named Theorems
  • Open Questions

Navigation menu

summary of continuum hypothesis

Continuum Hypothesis

Gödel showed that no contradiction would arise if the continuum hypothesis were added to conventional Zermelo-Fraenkel set theory . However, using a technique called forcing , Paul Cohen (1963, 1964) proved that no contradiction would arise if the negation of the continuum hypothesis was added to set theory . Together, Gödel's and Cohen's results established that the validity of the continuum hypothesis depends on the version of set theory being used, and is therefore undecidable (assuming the Zermelo-Fraenkel axioms together with the axiom of choice ).

Woodin (2001ab, 2002) formulated a new plausible "axiom" whose adoption (in addition to the Zermelo-Fraenkel axioms and axiom of choice ) would imply that the continuum hypothesis is false. Since set theoreticians have felt for some time that the Continuum Hypothesis should be false, if Woodin's axiom proves to be particularly elegant, useful, or intuitive, it may catch on. It is interesting to compare this to a situation with Euclid's parallel postulate more than 300 years ago, when Wallis proposed an additional axiom that would imply the parallel postulate (Greenberg 1994, pp. 152-153).

Portions of this entry contributed by Matthew Szudzik

Explore with Wolfram|Alpha

WolframAlpha

More things to try:

  • continuum hypothesis
  • 12-wheel graph
  • f'(t) = f(t)^2 + 1

Cite this as:

Szudzik, Matthew and Weisstein, Eric W. "Continuum Hypothesis." From MathWorld --A Wolfram Web Resource. https://mathworld.wolfram.com/ContinuumHypothesis.html

Subject classifications

We say that two sets are the 'same size' if their elements can be paired up one-to-one. This definition applies to infinite as well as finite sets. For example, consider the set N of 'natural numbers' {0, 1, 2, ...}. It's infinite, of course. It has the same size as the set of even natural numbers {0, 2, 4 ...} because, for example, you can match n with 2n. This may be counterintuitive.

Anyway, it's easy to show (see YouTube) that N also has the same size as the set of positive rational numbers (numbers of the form A/B, where A and B are natural numbers). Or the set of all finite sequences of letters. They're all the same size, and this is the smallest infinite size.

But there are bigger infinite sets. For example, consider the set C of all 'real' numbers - not just rationals - between 0 and 1. It's easy to show (using something called the 'diagonal argument'; see YouTube) that there's no one-to-one matching between C and N. Any matching misses some of the elements of C. Hence C is bigger than N. (BTW, C stands for 'continuum' - it's a continuous range of numbers).

The continuum hypothesis (CH) states that there are no sets bigger than N and smaller than C. CH was formulated by Georg Cantor around 1880.

CH seems pretty straightforward, kind of like saying that there are no integers between 0 and 1. It should be easy to prove or disprove, right?

Wrong. No one was able to prove or disprove it, and in 1900 David Hilbert put it first on his famous list of 23 open problems.

Amazingly, it turns out that CH can be neither proved nor disproved from the current axioms of mathematics. The two parts of this assertion were proved by Kurt Godel (in 1940) and Paul Cohen (in 1963). For his part of the proof, Cohen invented a general-purpose technique called "forcing". When I retire, I vow to learn about forcing, starting by reading .

In other words, unless a new axiom comes along - some obvious fact that has somehow eluded mathematicians to date - . This is analogous to the Heisenberg Uncertainty Principle, which proves (from the principles of quantum mechanics) that we can't measure both the position and momentum of a particle. It imposes a hard upper bound on what we puny humans can know.

You're probably wondering if there are sets even bigger than C. The answer is yes.

Given a set X, the 'power set of X' (denoted P(X)) is the set of all subsets of X. For example, if

X = {a,b,c}

then

P(X) = {{},{a},{b},{c},{a,b},{a,c},{b,c},{a,b,c}}.

It's easy to show (using a variant of the 'diagonal argument' mentioned above) that if X is any set (finite or infinite), P(X) is larger than X.

In particular, P(C) is larger than C. And P(P(C)) is larger than P(C), and so on. Given any set, there's always a larger one; there is no largest set.

As an aside: P(N) has the same size as C. This is easy to see. Every number in C can be written in binary; e.g. 0.1001011100011... We can think of this as corresponding to the set of natural numbers i for which there's a one in position i. This is in fact a one-to-one correspondence between P(N) and C.

Anyway, the 'Generalized Continuum Hypothesis' (GCH) says that, for any infinite set X, there are no sets larger than X and smaller than P(X). GCH is also independent of the axioms of mathematics.

Independently of whether we can prove CH, does it really have a unique truth value? Is there an unique abstract universe of sets in which there either is or isn't something intermediate in size between the integers and reals? This is the realm of the Philosophy of Mathematics. "Platonism" is the belief that there is a unique such universe; others believe, for example, that there is a 'multiverse' of them. CH might be true in some and false in others.

Paul Cohen thought that CH was obviously false. His argument (paraphrased): there are incremental ways of expanding infinite sets: e.g. taking their product (the set of all pairs). The power-set function (which produces the reals from the integers) is not incremental - it's something different and much cruder. There must be an incremental way to make a set bigger than the integers (but smaller than the reals). Note: I don't buy this at all - see below.

Hugh Woodin (a mathematician at UC Berkeley) has some results supporting the idea (but not proving) that CH is false. See and . (Warning: no one understands these papers).

Here's .

and . I understand very little of either.

Me personally? I'm an unabashed Platonist, and I lean towards thinking that CH is true, period. All the incremental ways of making bigger sets that we know of (limits, products, etc.) can't make the integers into something bigger. I think it's likely that there are no other incremental ways, and that power-set is the only way to make an infinite set bigger.

Can the Continuum Hypothesis Be Solved?

summary of continuum hypothesis

In 1900, David Hilbert published a list of twenty-three open questions in mathematics , ten of which he presented at the International Congress of Mathematics in Paris that year. Hilbert had a good nose for asking mathematical questions as the ones on his list went on to lead very interesting mathematical lives. Many have been solved, but some have not been, and seem to be quite difficult. In both cases, some very deep mathematics has been developed along the way. The so-called Riemann hypothesis, for example, has withstood the attack of generations of mathematicians ever since 1900 (or earlier). But the effort to solve it has led to some beautiful mathematics. Hilbert’s fifth problem turned out to assert something that couldn’t be true, though with fine tuning the “right” question—that is, the question Hilbert should have asked—was both formulated and solved. There is certainly an art to asking a good question in mathematics.

The problem known as the continuum hypothesis has had perhaps the strangest fate of all. The very first problem on the list, it is simple to state: how many points on a line are there? Strangely enough, this simple question turns out to be deeply intertwined with most of the interesting open problems in set theory , a field of mathematics with a very general focus, so general that all other mathematics can be seen as part of it, a kind of foundation on which the house of mathematics rests. Most objects in mathematics are infinite, and set theory is indeed just a theory of the infinite.

How ironic then that the continuum hypothesis is unsolvable—indeed, “provably unsolvable,” as we say. This means that none of the known mathematical methods—those that mathematicians actually use and find legitimate—will suffice to settle the continuum hypothesis one way or another. It seems odd that being unsolvable is the kind of thing one can prove about a mathematical question. In fact, there are many questions of this type, particularly about sets of real numbers—or sets of points on a line, if you like—that we know cannot be settled using standard mathematical methods.

Now, mathematics is not frozen in time or method—to the contrary, it is a very dynamic enterprise, each generation expanding and building on what went before. This process of expansion has not always been easy; sometimes it takes a while before new methods are accepted. This was true of set theory in the late nineteenth century. Its inventor, Georg Cantor , met with serious opposition on the part of those who were hesitant to admit infinite objects into mathematics.

What concerns us here is not so much the prehistory of the continuum hypothesis, but the present state of it, and the remarkable fact that mathematicians are in the midst of developing new methods by which the continuum hypothesis could be solved after all.

I will explain some of these developments, along with some of the more recent history of the continuum hypothesis, from the point of view of Kurt Gödel’s role in them. Gödel , a Member of the Institute’s School of Mathematics on several occasions in the 1930s, and then continuously from 1940 until 1976, 1 was a relative newcomer to the problem. But it turns out that Gödel’s hand is visible in virtually every aspect of the problem, from the post-Cantorian period onward. Curiously enough, this is even more true now than it was at the time of Gödel’s death nearly thirty-five years ago.

What is the Continuum Hypothesis?

Mathematics is nowadays saturated with infinity . There are infinitely many positive whole numbers 0, 1, 2, 3 . . . . There are infinitely many lines, squares, circles in the plane, balls, cubes, polyhedra in the space, and so on. But there are also different degrees of infinity. Let us say that a set—a collection of mathematical objects such as numbers or lines—is countable if it has the same number of elements as the sequence of positive whole numbers 1, 2, 3 . . . . The set of positive whole numbers is thus countable, and so is the set of all rational numbers. In the early 1870s , Cantor made a momentous discovery: the set of real numbers (such as 5, 17, 5/12, √–2, π, e, . . . ) sometimes called the “continuum,” is uncountable . By uncountable, we mean that if we try to count the points on a line one by one, we will never succeed, even if we use all of the whole numbers. Now it is natural to ask the following question: are there any infinities between the two infinities of whole numbers and of real numbers?

This is the continuum hypothesis, which proposes that if you are given a line with an infinite set of points marked out on it, then just two things can happen: either the set is countable, or it has as many elements as the whole line. There is no third infinity between the two.

At first, Cantor thought he had a proof of the continuum hypothesis; then he thought he could prove it was false; and then he gave up. This was a blow to Cantor, who saw this as a defect in his work—if one cannot answer such a simple question as the continuum hypothesis, how can one possibly go forward?

Some History

The continuum hypothesis went on to become a very important problem, so much so that in 1900 Hilbert listed it as the first on his list of open problems, as previously mentioned. Hilbert eventually gave a proof of it in 1925—the proof was wrong, though it contained some important ideas.

Around the turn of the century, mathematicians were able to prove that the continuum hypothesis holds for a special class of sets called the Borel sets. 2 This is a concrete class of sets, containing, for the most part, the usual sets that mathematicians work with. Even with this early success in the special case of Borel sets though, and in spite of Hilbert’s attempted solution, mathematicians began to speculate that the continuum hypothesis was in general not solvable at all. Hilbert , for whom nothing less than “the glory of human existence” seemed to depend upon the ability to resolve all such questions, was an exception. “ Wir müssen wissen . Wir werden wissen ,” 3 he said in 1930 in Königsberg . In a great irony of history, at the very same meeting, but on the day before, the young Gödel announced his first incompleteness theorem. This theorem, together with Gödel’s second incompleteness theorem, is generally thought to have dealt a death blow to Hilbert’s idea that every mathematical question that permits an exact formulation can be solved. Hilbert was not in the room at the time.

Gödel , however, became a strong advocate of the solvability of the continuum hypothesis, taking the view that his incompleteness theorems , though they show that some provably undecidable statements do exist, have nothing to do with whether the continuum hypothesis is solvable or not. Like Hilbert , Gödel maintained that the continuum hypothesis will be solved.

What is Provable Unsolvability Anyway?

We arrive at an apparent conundrum. On the one hand, the continuum hypothesis is provably unsolvable, and on the other hand, both Gödel and Hilbert thought it was solvable. How to resolve this difficulty? What does it mean for something to be provably unsolvable anyway?

Some mathematical problems may be extremely difficult and therefore without a solution up to now, but one day someone may come up with a brilliant solution. Fermat’s last theorem, for example, went unsolved for three and a half centuries. But then Andrew Wiles was able to solve it in 1994. The continuum hypothesis is a problem of a very different kind; we actually can prove that it is impossible to solve it using current methods , which is not a completely unknown phenomenon in mathematics. For example, the age-old trisection problem asks: can we trisect a given angle by using just a ruler and compass? The Greeks of the classical period were very puzzled by how to make such a trisection, and no wonder, for in the nineteenth century it was proved that it is impossible—not just very difficult but impossible. You need a little more than a ruler and compass to trisect an arbitrary angle—for example, a compass and a ruler with two marks on it.

It is the same with the continuum hypothesis: we know that it is impossible to solve using the tools we have in set theory at the moment. And up until recently nobody knew what the analogue of a ruler with two marks on it would be in this case. Since the current tools of set theory are so incredibly powerful that they cover all of existing mathematics, it is almost a philosophical question: what would it be like to go beyond set-theoretic methods and suggest something new? Still, this is exactly what is needed to solve the continuum hypothesis.

Consistency

Gödel began to think about the continuum problem in the summer of 1930, though it wasn’t until 1937 that he proved the continuum hypothesis is at least consistent . This means that with current mathematical methods, we cannot prove that the continuum hypothesis is false .

Describing Gödel ’s solution would draw us into unneeded technicalities, but we can say a little bit about it. Gödel built a model of mathematics in which the continuum hypothesis is true. What is a model? This is something mathematicians build with the purpose of showing that something is possible, even if we admit that the model is just what it is, a kind of artificial construction. Children build model airplanes; architects draw up architectural plans; mathematicians build models of the mathematical universe. There is an important difference though, between mathematicians’ models and architectural plans or model airplanes: building a model that has the exact property the mathematician has in mind, is, in all but trivial cases, extremely difficult. It is like a very great feat of engineering.

The idea behind Gödel’s model, which we now call the universe of constructible sets , was that it should be made as small as is conceivably possible by throwing everything out that was not absolutely essential. It was a tour de force to show that what was left was enough to satisfy the requirements of mathematics, and, in addition, the continuum hypothesis. This did not show that the continuum hypothesis is really true, only that it is consistent, because Gödel’s universe of constructible sets is not the real universe, only a kind of artifact. Still, it suffices to demonstrate the consistency of the continuum hypothesis.

Unsolvability

After Gödel’s achievement, mathematicians sought a model in which the continuum hypothesis fails, just as Gödel found a model in which the continuum hypothesis holds. This would mean that the continuum hypothesis is unsolvable using current methods. If, on the one hand, one can build a picture of the mathematical universe in which it is true, and, on the other hand, if one can also build another universe in which it is false, it would essentially tell you that no information about the continuum hypothesis is lurking in the standard machinery of mathematics.

So how to build a model for the failure of the continuum hypothesis? Since Gödel’s universe was the only nontrivial universe that had been introduced, and, moreover, it was the smallest possible, mathematicians quickly realized that they had to find a way to extend Gödel’s model, by carefully adding real numbers to it. This is hair-raisingly difficult. It is like adding a new card to a huge house of cards, or, more exactly, like adding a new point to a line that already is—in a sense—a continuum. Where do you find the space to slip in a few new real numbers?

Looking back at Paul Cohen ’s solution, a logician has to slap her forehead, not once, but a few times. His idea was that the real numbers one adds should have “no properties,” as strange as this may sound; they should be “generic,” as he called them. In particular, a Cohen real , as they came to be called, should avoid “saying anything” nontrivial about the model. How to make this idea mathematically precise? That was Paul Cohen’s great invention: the forcing method, which is a way to add new reals to a model of the mathematical universe.

Even with this idea, serious obstacles now stood in the way of a full proof. For example, one has to prove an extremely delicate metamathematical theorem—as these are called—that even though forcing extends the universe to a bigger one, one can still talk about it in the first universe; in technical terms, one has to prove that forcing is definable . Moreover, to violate the continuum hypothesis, we have to add a lot of new points to the continuum, and what we believe is “a lot” may in the final stretch turn out to be not so many after all. This last problem—the technical term is preserving cardinals —was a very serious matter. Cohen later wrote of his sense of unease at that point, “given the rumors that had circulated that Gödel was unable to handle the CH.” 4 Perhaps Cohen sensed, while on the brink of his great discovery, the almost physical presence of the one mathematician who had walked the very long way up to that very door, but was unable to open it.

Two weeks later, while vacationing with his family in the Midwest, Cohen suddenly remembered a lemma from topology (due to N. A. Shanin ), and this was just what was needed to show that everything falls into place. The proof was now finished. It would have been an astounding achievement for any set theorist, but the fact that it was solved by someone from a completely different field—Paul Cohen was an analyst after all, not a set theorist—seemed beyond belief.

Writing the Paper

The story of what happened in the immediate aftermath of Cohen’s announcement of his proof is very interesting, also from the point of view of human interest, so we will permit ourselves a slight digression in order to touch upon it here.

The announcement seems to have been made at a time when the extent of what had been shown was not clear, and the proof, though it was finished in all the essentials, was not in all details completely finished. In a first letter to Gödel , dated April 24, 1963, Cohen communicated his results. But about a week later, he wrote a second, more urgent letter, in which he expressed his fear that there might be a hidden flaw in the proof, and, at the same time, his exasperation with logicians, who could not believe that he was able to prove that very delicate theorem on the definability of forcing.

Cohen confessed in the letter that the situation was wearing, also considering “the unexpected interest my work has aroused among the general (non-logical) mathematical world.”

Gödel replied with a very friendly letter, inviting Cohen to visit him, either at his home on Linden Lane or in his office at the Institute, writing, “You have just achieved the most important progress in set theory since its axiomatization . So you have every reason to be in high spirits.”

Soon after receiving the letter, Cohen visited Gödel at home, whereupon Gödel checked the proof, and pronounced it correct.

What followed over the next six months is a voluminous correspondence between the two, centered around the writing of the paper for the Proceedings of the National Academy of Sciences . The paper had to be carefully written; but Cohen was clearly impatient to go on to other work. It therefore fell to Gödel to fine tune the argument, as well as simplify it, all the while keeping Cohen in good spirits. The Gödel that emerges in these letters—sovereign, generous, and full of avuncular goodwill, will be unfamiliar to readers of the biographies—especially if one keeps in mind that by 1963 Gödel had devoted a good part of twenty-five years to solving the continuum problem himself, without success. “Your proof is the very best possible,” Gödel wrote at one point. “Reading it is like reading a really good play.”

Gödel and Cohen bequeathed to set theorists the only two model construction methods they have. Gödel’s method shows how to “shrink” the set-theoretic universe to obtain a concrete and comprehensible structure. Cohen’s method allows us to expand the set-theoretic universe in accordance with the intuition that the set of real numbers is very large. Building on this solid foundation, future generations of set theorists have been able to make spectacular advances.

There was one last episode concerning Gödel and the continuum hypothesis. In 1972, Gödel circulated a paper called “Some considerations leading to the probable conclusion that the true power of the continuum is ℵ 2 ,” which derived the failure of the continuum hypothesis from some new assumptions, the so-called scale axioms of Hausdorff . The proof was incorrect, and Gödel withdrew it, blaming his illness. In 2000, Jörg Brendle , Paul Larson, and Stevo Todorcevic 5 isolated three principles implicit in Gödel’s paper, which, taken together, put a bound on the size of the continuum. And subsequently Gödel’s ℵ 2 became a candidate of choice for many set theorists, as various important new principles from conceptually quite different areas were shown to imply that the size of the continuum is ℵ 2 .

Currently, there are two main programs in set theory. The inner model program seeks to construct models that resemble Gödel’s universe of constructible sets, but such that certain strong principles, called large cardinal axioms, would hold in them. These are very powerful new principles, which go beyond current mathematical methods (axioms). As Gödel predicted with great prescience in the 1940s , such cardinals have now become indispensable in contemporary set theory. One way to certify their existence is to build a model of the universe for them—not just any model, but one that resembles Gödel’s constructible universe, which has by now become what is called “canonical.” In fact, this may be the single most important question in set theory at the moment—whether the universe is “like” Gödel’s universe, or whether it is very far from it. If this question is answered, in particular if the inner model program succeeds, the continuum hypothesis will be solved.

The other program has to do with fixing larger and larger parts of the mathematical universe, beyond the world of the previously mentioned Borel sets. Here also, if the program succeeds, the continuum hypothesis will be solved.

We end with the work of another seminal figure, Saharon Shelah . Shelah has solved a generalized form of the continuum hypothesis, in the following sense: perhaps Hilbert was asking the wrong question! The right question, according to Shelah , is perhaps not how many points are on a line, but rather how many “small” subsets of a given set you need to cover every small subset by only a few of them. In a series of spectacular results using this idea in his so-called pcf-theory , Shelah was able to reverse a trend of fifty years of independence results in cardinal arithmetic, by obtaining provable bounds on the exponential function. The most dramatic of these is 2 ℵω ≤ 2 ℵ0 + ℵ ω4 . Strictly speaking, this does not bear on the continuum hypothesis directly, since Shelah changed the question and also because the result is about bigger sets. But it is a remarkable result in the general direction of the continuum hypothesis.

In his paper, 6 Shelah quotes Andrew Gleason, who made a major contribution to the solution of Hilbert’s fifth problem:

Of course, many mathematicians are not aware that the problem as stated by Hilbert is not the problem that has been ultimately called the Fifth Problem. It was shown very, very early that what he was asking people to consider was actually false. He asked to show that the action of a locally-euclidean group on a manifold was always analytic, and that’s false . . . you had to change things considerably before you could make the statement he was concerned with true. That’s sort of interesting, I think. It’s also part of the way a mathematical theory develops. People have ideas about what ought to be so and they propose this as a good question to work on, and then it turns out that part of it isn’t so .

So maybe the continuum problem has been solved after all, and we just haven’t realized it yet.

1 Appointed to the permanent Faculty in 1953; 2 This was extended to the so-called analytic sets by Mikhail Suslin in 1917. Borel sets are named for Emile Borel, uncle of the late mathematician (and IAS Faculty member) Armand Borel.; 3 “We must know. We will know.”; 4 P. J. Cohen, “The Discovery of Forcing”; 5 In their "Rectangular Axioms, Perfect Set Properties and Decomposition"; 6 "The Generalized Continuum Hypothesis Revisited"

Some Mathematical Details

Intuitively, the set-theoretic universe is the result of iterating basic constructions such as products ∏ i ∈ I A i , unions U i ∈ I A i , and power sets P(A) . In addition, the universe is assumed to satisfy so-called reflection : any property that it has is already possessed by some smaller universe, the domain of which is a set. The process starts from some given urelements , objects that are not sets, i.e., do not consist of elements, but it has been proven that the urelements are unnecessary and the process can be started from the empty set. Iterating this process into the transfinite , we obtain the cumulative hierarchy V of sets. Transfinite iterations are governed by ordinals , canonical representatives of well-ordered total orders, denoted by lower-case Greek letters α , β , etc. The hierarchy V is defined recursively by V α = U β < α P ( V β ). The fact that V = U α V α is the entire universe of sets is the intuitive content of the axioms of Zermelo-Frankel set theory with the Axiom of Choice, or ZFC , the basic system we have been working with all along.

Now Gödel’s model of the ZFC axioms, the constructible hierarchy L = U α L α , where L α = U β <α P L ( V β ), is built up not by means of the unrestricted power set operation P ( A ), but by the restricted operation P L ( A ), which takes from P ( A ) only those sets that are definable in ( A , ∈). Gödel showed that we can consistently assume V = L , but Cohen showed that it is consistent to assume that there are real numbers that are not in L .

The Borel sets of reals are obtained from open sets by means of iterating complements and countable unions. If we enlarge the set of Borel sets by including images of continuous functions, we obtain the analytic sets; a set is coanalytic if its complement is analytic.

Finally, the projective sets are obtained from analytic sets by iterating complements and continuous images. The field of descriptive set theory asks, among other questions, whether the classical theory of analytic and coanalytic sets can be extended to the projective sets; in particular, whether the projective sets are Lebesgue measurable, and have the perfect set property and the property of Baire . This was settled in the 1980s with the work of Shelah and Woodin , building on earlier work of Solovay , who showed that the projective sets have these three properties as a consequence of the existence of certain so-called large cardinals. This also follows from projective determinacy , a principle that was shown by Martin and Steel to follow from the existence of such large cardinals. A cardinal α is called a large cardinal if V α behaves in certain ways like V itself. For example, in that case, V α is a model of ZFC , but more is assumed. A famous large cardinal is a measurable cardinal, introduced by Stanislaw Ulam , an example of which is the smallest cardinal that admits a nontrivial countably additive two-valued measure.

What a State Mathematics Would Be In Today . . .

Before coming to the Institute where he was appointed as one of its first Professors in 1933, John von Neumann was a student of David Hilbert’s in Göttingen . Von Neu­mann worked on Hilbert’s program to find a complete and consistent set of axioms for all of mathematics. In addition to his many other contributions to mathematics and physics, von Neumann defined Hilbert space (unbounded operators on an infinite dimensional space), which he used to formulate a mathematical structure of quantum mechanics. Below, the late Herman Goldstine , a former Member in the Schools of Mathematics, Natural Sciences, and Historical Studies, recalls von Neumann’s working dreams about Kurt Gödel’s incompleteness theorem(s). ( Ex­cerp­ted from an oral history transcript available at www.prince­ton.edu/%7Emudd/finding_aids/math­oral/pmc15.htm ; more information about von Neumann and Gödel is available at www.ias.edu/people/noted-figures .)

His work habits were very methodical. He would get up in the morning, and go to the Nassau Club to have breakfast. And then from the Nassau Club he’d come to the Institute around nine, nine-thirty, work until lunch, have lunch, and then work until, say, five, and then go on home. Many evenings he would entertain. Usually a few of us, maybe my wife and me. We would just sit around, and he might not even sit in the same room. He had a little study that opened off of the living room, and he would just sit in there sometimes. He would listen, and if something interested him, he would interrupt. Otherwise he would work away.

At night he would go to bed at a reasonable hour, and he would waken, I think, almost every night, judging from the things he told me and the few times that he and I shared hotel rooms. He would waken in the night, two, three in the morning, and would have thought through what he had been working on. He would then write. He would write down the things he had worked on. . . .

He, under Hilbert’s tutelage, was trying to prove the opposite of the Gödel theorem. He worked and worked and worked at this, and one night he dreamed the proof. He got up and wrote it down, and he got very close to the end. He went and worked all day on that part, and the next night he dreamed again. He dreamed how to close the gap, and he got up and wrote, and he got within epsilon of the end, but he couldn’t make the final step. So he went to bed. The next day he worked and worked and worked at it, and he said to me, “You know, it was very lucky, Herman, that I didn’t dream the third night, or think what a state mathematics would be in today.” [Laughter.]

Juliette Kennedy is Associate Professor in the Department of Mathematics and Statistics at the University of Helsinki and a Member (2011–12) in the School of Historical Studies. In the history and foundations of mathematics, she has worked extensively on a project that attempts to put Kurt  Gödel  in full perspective, historically and foundationally. Her project at the Institute this year is centered on  Gödel’s  notion of semantic content. The mathematical aspect of the project involves the question of how many of the larger “large cardinals” can be captured with a newly discovered class of L-like inner models of set theory.

  • Institutional Login

Access to the full content is only available to members of institutions that have purchased access. If you belong to such an institution, please log in or find out more about how to order .

Loading content

We were unable to load the content

Article Summary

  • content locked 1 The continuous, the discrete and the infinite
  • content locked 2 Numbering the continuum
  • content locked 3 Reactions to independence
  • content locked Bibliography

Continuum hypothesis

  • Tiles, Mary

The ‘continuum hypothesis’ (CH) asserts that there is no set intermediate in cardinality (‘size’) between the set of real numbers (the ‘continuum’) and the set of natural numbers. Since the continuum can be shown to have the same cardinality as the power set (that is, the set of subsets) of the natural numbers, CH is a special case of the ‘generalized continuum hypothesis’ (GCH), which says that for any infinite set, there is no set intermediate in cardinality between it and its power set.

Cantor first proposed CH believing it to be true, but, despite persistent efforts, failed to prove it. König proved that the cardinality of the continuum cannot be the sum of denumerably many smaller cardinals, and it has been shown that this is the only restriction the accepted axioms of set theory place on its cardinality. Gödel showed that CH was consistent with these axioms and Cohen that its negation was. Together these results prove the independence of CH from the accepted axioms.

Cantor proposed CH in the context of seeking to answer the question ‘What is the identifying nature of continuity?’. These independence results show that, whatever else has been gained from the introduction of transfinite set theory – including greater insight into the import of CH – it has not provided a basis for finally answering this question. This remains the case even when the axioms are supplemented in various plausible ways.

Related Searches

  • Philosophy of mathematics

Last updated 27/06/24: Online ordering is currently unavailable due to technical issues. We apologise for any delays responding to customers while we resolve this. For further updates please visit our website: https://www.cambridge.org/news-and-insights/technical-incident

We use cookies to distinguish you from other users and to provide you with a better experience on our websites. Close this message to accept cookies or find out how to manage your cookie settings .

Login Alert

summary of continuum hypothesis

  • > The Logic of Infinity
  • > The Axiom of Choice and the Continuum Hypothesis

summary of continuum hypothesis

Book contents

  • Frontmatter
  • 1 Introduction
  • 2 Logical foundations
  • 3 Avoiding Russell's paradox
  • 4 Further axioms
  • 5 Relations and order
  • 6 Ordinal numbers and the Axiom of Infinity
  • 7 Infinite arithmetic
  • 8 Cardinal numbers
  • 9 The Axiom of Choice and the Continuum Hypothesis
  • 11 From Gödel to Cohen
  • A Peano Arithmetic
  • B Zermelo–Fraenkel set theory
  • C Gödel's Incompleteness Theorems
  • Bibliography

9 - The Axiom of Choice and the Continuum Hypothesis

Published online by Cambridge University Press:  05 August 2014

The Axiom of Choice

Zermelo regards the axiom as an unquestionable truth. It must be confessed that, until he made it explicit, mathematicians had used it without a qualm; but it would seem that they had done so unconsciously. And the credit due to Zermelo for having made it explicit is entirely independent of the question whether it is true or false.

Strong versus weak Choice

The Axiom of Choice is one of the most interesting and most discussed axioms to have emerged in mathematics since the status of Euclid's parallel postulate was resolved in the mid-nineteenth century. The question of whether it should be adopted as one of the standard axioms of set theory was the cause of more philosophical debate among mathematicians in the twentieth century than any other question in the foundations of mathematics.

Axiom of Choice

For every set a there exists a function f such that, for all x ∈ a , if x ≠ Ø then f(x) ∈ x .

The function f is called a choice function ; it selects exactly one element from each set in a . Choice functions had been used without full recognition by Cantor and others long before Zermelo distilled the idea.

A much stronger form of Choice asserts that there is a universal choice function, that is, a function F such that, for all sets x , if x ≠ Ø then F ( x ) ∈ x .

Access options

Save book to kindle.

To save this book to your Kindle, first ensure [email protected] is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about saving to your Kindle .

Note you can select to save to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

Find out more about the Kindle Personal Document Service .

  • The Axiom of Choice and the Continuum Hypothesis
  • Barnaby Sheppard
  • Book: The Logic of Infinity
  • Online publication: 05 August 2014
  • Chapter DOI: https://doi.org/10.1017/CBO9781107415614.011

Save book to Dropbox

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Dropbox .

Save book to Google Drive

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Google Drive .

Help | Advanced Search

Mathematics > History and Overview

Title: independence of the continuum hypothesis: an intuitive introduction.

Abstract: The independence of the continuum hypothesis is a result of broad impact: it settles a basic question regarding the nature of N and R, two of the most familiar mathematical structures; it introduces the method of forcing that has become the main workhorse of set theory; and it has broad implications on mathematical foundations and on the role of syntax versus semantics. Despite its broad impact, it is not broadly taught. A main reason is the lack of accessible expositions for nonspecialists, because the mathematical structures and techniques employed in the proof are unfamiliar outside of set theory. This manuscript aims to take a step in addressing this gap by providing an exposition at a level accessible to advanced undergraduate mathematicians and theoretical computer scientists, while covering all the technically challenging parts of the proof.
Comments: - Edited the example in the Reflection definition. - Changed fonts for rank() and nr() - Changed fonts for CH to \mathrm{CH} - Corrected a few spurious typos
Subjects: History and Overview (math.HO); Logic in Computer Science (cs.LO); Logic (math.LO)
classes: 03-03
 classes: F.4
Cite as: [math.HO]
  (or [math.HO] for this version)
  Focus to learn more arXiv-issued DOI via DataCite

Submission history

Access paper:.

  • Other Formats

license icon

References & Citations

  • Google Scholar
  • Semantic Scholar

BibTeX formatted citation

BibSonomy logo

Bibliographic and Citation Tools

Code, data and media associated with this article, recommenders and search tools.

  • Institution

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs .

SEP thinker apres Rodin

Notes to The Continuum Hypothesis

1. See Hallett (1984) for further historical information on the role of CH in the early foundations of set theory.

2. We have of necessity presupposed much in the way of set theory. The reader seeking additional detail—for example, the definitions of regular and singular cardinals and other fundamental notions—is directed to one of the many excellent texts in set theory, for example Jech (2003).

3. To say that GCH holds below δ is just to say that 2 ℵ α = ℵ α+1 for all ω ≤ α < δ and to say that GCH holds at δ is just to say that 2 ℵ δ = ℵ δ+1 ).

4. To see this argue as follows: Assume large cardinal axioms at the level involved in (A) and (B) and assume that there is a proper class of Woodin cardinals. Suppose for contradiction that there is a prewellordering in L (ℝ) of length ℵ 2 . Now, using (A) force to obtain a saturated ideal on ℵ 2 without collapsing ℵ 2 . In this forcing extension, the original prewellordering is still a prewellordering in L (ℝ) of length ℵ 2 , which contradicts (B). Thus, the original large cardinal axioms imply that Θ L (ℝ) ≤ ℵ 2 . The same argument applies in the more general case where the prewellordering is universally Baire.

5. For more on the topic of invariance under set forcing and the extent to which this has been established in the presence of large cardinal axioms, see §4.4 and §4.6 of the entry “ Large Cardinals and Determinacy ”.

6. The non-stationary ideal I NS is a proper class from the point of view of H (ω 2 ) and it manifests (through Solovay’s theorem on splitting stationary sets) a non-trivial application of AC. For further details concerning A G see §4.6 of the entry “ Large Cardinals and Determinacy ”.

7. Here are the details: Let A ∈ Γ ∞ and M be a countable transitive model of ZFC. We say that M is A - closed if for all set generic extensions M [ G ] of M , A ∩ M [ G ] ∈ M [ G ]. Let T be a set of sentences and φ be a sentence. We say that T ⊢ Ω φ if there is a set A ⊆ ℝ such that

  • L ( A , ℝ) ⊧ AD + ,
  • 𝒫 (ℝ) ∩ L ( A , ℝ) ⊆ Γ ∞ , and
M ⊧ “ T ⊧ Ω φ”,

where here AD + is a strengthening of AD.

8. Here are the details: First we need another conjecture: (The AD + Conjecture) Suppose that A and B are sets of reals such that L ( A , ℝ) and L ( B , ℝ) satisfy AD + . Suppose every set

X ∈ 𝒫 (ℝ) ∩ ( L ( A , ℝ) ∪ L ( B , ℝ))

is ω 1 -universally Baire. Then either

(Δ̰ 2 1 ) L ( A ,ℝ) ⊆ (Δ̰ 2 1 ) L ( B ,ℝ)
(Δ̰ 2 1 ) L ( B ,ℝ) ⊆ (Δ̰ 2 1 )} L ( A ,ℝ) .

(Strong Ω conjecture) Assume there is a proper class of Woodin cardinals. Then the Ω Conjecture holds and the AD + Conjecture is Ω-valid.

9. As mentioned at the end of Section 2.2 it could be the case (given our present knowledge) that large cardinal axioms imply that Θ L (ℝ) < ℵ 3 and, more generally, rule out the definable failure of 2 ℵ 0 = ℵ 2 . This would arguably further buttress the case for 2 ℵ 0 = ℵ 2 .

  • Architecture and Design
  • Asian and Pacific Studies
  • Business and Economics
  • Classical and Ancient Near Eastern Studies
  • Computer Sciences
  • Cultural Studies
  • Engineering
  • General Interest
  • Geosciences
  • Industrial Chemistry
  • Islamic and Middle Eastern Studies
  • Jewish Studies
  • Library and Information Science, Book Studies
  • Life Sciences
  • Linguistics and Semiotics
  • Literary Studies
  • Materials Sciences
  • Mathematics
  • Social Sciences
  • Sports and Recreation
  • Theology and Religion
  • Publish your article
  • The role of authors
  • Promoting your article
  • Abstracting & indexing
  • Publishing Ethics
  • Why publish with De Gruyter
  • How to publish with De Gruyter
  • Our book series
  • Our subject areas
  • Your digital product at De Gruyter
  • Contribute to our reference works
  • Product information
  • Tools & resources
  • Product Information
  • Promotional Materials
  • Orders and Inquiries
  • FAQ for Library Suppliers and Book Sellers
  • Repository Policy
  • Free access policy
  • Open Access agreements
  • Database portals
  • For Authors
  • Customer service
  • People + Culture
  • Journal Management
  • How to join us
  • Working at De Gruyter
  • Mission & Vision
  • De Gruyter Foundation
  • De Gruyter Ebound
  • Our Responsibility
  • Partner publishers

summary of continuum hypothesis

Your purchase has been completed. Your documents are now available to view.

book: Consistency of the Continuum Hypothesis. (AM-3), Volume 3

Consistency of the Continuum Hypothesis. (AM-3), Volume 3

  • X / Twitter

Please login or register with De Gruyter to order this product.

  • Language: English
  • Publisher: Princeton University Press
  • Copyright year: 1941
  • Audience: College/higher education;Professional and scholarly;
  • Main content: 69
  • Keywords: Axiom ; Theorem ; Propositional function ; Axiom of choice ; Existence theorem ; Axiom of infinity ; Ordinal number ; Set theory ; Continuum hypothesis ; Quantifier (logic) ; Axiom of extensionality ; Constructible set (topology) ; Boolean algebra (structure) ; Axiomatic system ; Mathematical induction ; Well-order ; Variable (mathematics) ; Absoluteness ; Transfinite induction ; Existential quantification ; Order by ; Transfinite ; Metatheorem ; Reductio ad absurdum ; Mathematical logic ; Requirement ; Addition ; Integer ; Mathematics
  • Published: March 2, 2016
  • ISBN: 9781400881635

Stack Exchange Network

Stack Exchange network consists of 183 Q&A communities including Stack Overflow , the largest, most trusted online community for developers to learn, share their knowledge, and build their careers.

Q&A for work

Connect and share knowledge within a single location that is structured and easy to search.

Specific axioms under which the continuum hypothesis is true or false

It is well-known that the continuum hypothesis (CH) cannot be proven under the standard axioms (i.e. independence from ZFC).

However, to (non-expert, beginning student of the field) me, it seems like we could add some "natural" axioms until we see that the CH is true or false.

Are there explicit axiom sets under which CH is true or false? Particularly, are there "convincing" sets, i.e. ones where the axioms seem natural and inarguable that allow proof of it, which might reasonably convince someone to believe in its truth or falsity? (Of course, it would also be cool to see more exotic ones too)

  • foundations

Stefan Mesken's user avatar

  • 1 $\begingroup$ Add CH as an axiom? $\endgroup$ –  Hagen von Eitzen Commented Dec 5, 2016 at 19:33
  • $\begingroup$ $V=L$ (The Gödel model) comes to mind. But natural I would not call it. I recall reading a paper on this exact question by Gödel, but I don't recall the title. $\endgroup$ –  Henno Brandsma Commented Dec 5, 2016 at 19:35
  • 1 $\begingroup$ Of interest: logic.harvard.edu/efi.php $\endgroup$ –  Henno Brandsma Commented Dec 5, 2016 at 19:38
  • $\begingroup$ @HagenvonEitzen Fair enough, but hard to say if that's natural or not (or this question might not exist) :) $\endgroup$ –  user3658307 Commented Dec 5, 2016 at 19:43
  • $\begingroup$ In addition to what @Henno linked, let me tout my own horn, and link this blog post . $\endgroup$ –  Asaf Karagila ♦ Commented Dec 5, 2016 at 21:55

3 Answers 3

The Axiom of Determinacy (AD) implies CH in the form "There is no set intermediate in cardinality between $\mathbb{N}$ and $\mathbb{R},\!"$ which I believe is the original form of CH. (Sometimes you'll see CH written as $2^{\aleph_0}=\aleph_1,$ which is equivalent in ZFC, but not in ZF alone.)

Of course, to accept AD, you need to be willing to forego the Axiom of Choice (in fact, under AD, the set of real numbers is not well-orderable, so $2^{\aleph_0}$ does not equal $\aleph_1).$

It's interesting to note that, although AD has some strange consequences, this one is natural; the proof that AD implies CH follows the idea of a proof that Cantor originally hoped would work in general: Every uncountable set of reals contains a perfect subset. (This is sufficient since every perfect set of reals has the cardinality of the continuum.)

Mitchell Spector's user avatar

  • 1 $\begingroup$ AD is a good argument. $\endgroup$ –  Asaf Karagila ♦ Commented Dec 5, 2016 at 22:09

This is an ongoing issue in the world of Platonists and set theory.

Some people take "canonical inner models" (which imply $\sf GCH$) as a reasonable additional axiom, Woodin for example is a proponent of the $V=\text{Ultimate }L$ axiom he formulated. This axiom allows very large cardinals to exist in the universe of sets, but at the same time this axiom still implies the continuum hypothesis and much more.

Some people, however, would argue that forcing axioms like $\sf PFA$ are more natural. These have natural consequences on the structure of sets of reals (e.g. every reasonably definable set of reals is Lebesgue measurable), and at the same time they also imply that $2^{\aleph_0}=\aleph_2$. Woodin, some years ago, was a strong proponent of these sort of axioms which had some sort of canonicity to them.

The real problem lies somewhere else, though. Once you've shown that some statement is neither provable nor disprovable, taking it becomes either an issue of faith, or choosing not to be a Platonist and not subscribing to a fixed notion of mathematical "truth". So non-Platonists generally don't have a problem that $\sf CH$ is undecidable. Or the Axiom of Choice, because why accept it and not its negation? But Platonists will generally have a hard time deciding whether or not some statement is true or not.

If you look at the historical references, Choice was a controversial axiom, and mathematicians like Lebesgue and Borel rejected Choice, as its consequences mismatched their views (e.g. all sets of reals should be measurable). Nowadays, however, we accept Choice because it entered the mathematical canon. It is perfectly reasonable to hope that in a few decades something like $\sf CH$ or its negation will enter the mathematical canon, but maybe it won't. We can't tell the future.

Asaf Karagila's user avatar

There is "diamond",often denoted by $\diamond,$ which is: There exists $\{A_x:x\in \omega_1\}$ with $A_x\subset x$ for all $x\in \omega_1,$ such that for any $S\subset \omega_1,$ the set $\{x\in \omega_1:S\cap x=A_x\}$ is stationary in $\omega_1.$

$\diamond$ is consistent with ZFC because $V=L\implies \diamond\;,$ but $\diamond$ does not imply $V=L.$

$\diamond \implies CH\;$ : For $S\subset \omega$ and $\omega\leq x<\omega_1$ we have $S\cap x =S,$ and the set $\{x\in \omega_1:S\cap x=A_x\}$ is stationary, hence unbounded, in $\omega_1.$ So there exists $x\geq \omega$ with $A_x=S\cap x=S.$ Let $f(S)$ be the least (or any) $x \geq \omega$ such that $A_x=S\cap x=S.$ We have $f(S)\ne f(T)$ for distinct $S,T \subset \omega,$ because $A_{f(S)}=S\ne T=A_{f(T)}.$ So $f: P(\omega)\to \omega_1$ is injective.

DanielWainfleet's user avatar

  • $\begingroup$ \lozenge or \diamondsuit produce $\lozenge$ which is a better symbol. $\endgroup$ –  Asaf Karagila ♦ Commented Dec 27, 2016 at 14:01
  • $\begingroup$ @AsafKaragila. Thank you. $\endgroup$ –  DanielWainfleet Commented Dec 27, 2016 at 21:30
  • 1 $\begingroup$ \Diamond works too: $\Diamond$ $\endgroup$ –  Noah Schweber Commented Dec 28, 2016 at 1:10
  • $\begingroup$ @NoahSchweber. Thank you. $\endgroup$ –  DanielWainfleet Commented Dec 28, 2016 at 1:12

You must log in to answer this question.

Not the answer you're looking for browse other questions tagged logic set-theory cardinals philosophy foundations ..

  • Featured on Meta
  • Upcoming sign-up experiments related to tags

Hot Network Questions

  • How to make D&D easier for kids?
  • What does Athena mean by 'slaughtering his droves of sheep and cattle'?
  • Find all sequence that satisfy the system of equation
  • Is there an image viewer for ubuntu that will read/apply xmp sidecars?
  • Co-authors with little contribution
  • What could explain that small planes near an airport are perceived as harassing homeowners?
  • Science fiction movie with one or more aliens on Earth and a puppet of a monster that can turn into an actual monster
  • Nuance of やぶさかではない
  • Were there engineers in blimp nacelles, and why were they there?
  • Different Bekenstein bound equations – what’s the difference?
  • what is the difference between prayer (προσευχῇ) and prayer also translated as supplication (δέησις) in Philippians 4:6?
  • Why was the animal "Wolf" used in the title "The Wolf of Wall Street (2013)"?
  • How do you say "living being" in Classical Latin?
  • How can I take apart a bookshelf?
  • Applying Bayesian probability to a generalized Monty Hall problem
  • How to Draw Gabriel's Horn
  • How to patch command to work differently in math mode?
  • Weird behavior by car insurance - is this legit?
  • How to produce this table: Probability datatable with multirow
  • Font shape warnings in LuaLaTeX but not XeLaTeX
  • Sets of algebraic integers whose differences are units
  • Trying to determine what this item is
  • Refining material assignment in Blender geometry nodes based on neighboring faces
  • Could a transparent frequency-altering material be possible?

summary of continuum hypothesis

IMAGES

  1. Explanation Notes for Continuum Hypothesis

    summary of continuum hypothesis

  2. PPT

    summary of continuum hypothesis

  3. Continuum Hypothesis

    summary of continuum hypothesis

  4. PPT

    summary of continuum hypothesis

  5. PPT

    summary of continuum hypothesis

  6. PPT

    summary of continuum hypothesis

VIDEO

  1. Continuum Hypothesis

  2. Fluid Mechanics

  3. Continuum Hypothesis

  4. Continuum Hypothesis Project CS4510

  5. Mathematical Logic, part 4: continuum hypothesis

  6. Hypothesis spaces, Inductive bias, Generalization, Bias variance trade-off in tamil -AL3451 #ML

COMMENTS

  1. Continuum hypothesis

    The continuum hypothesis was advanced by Georg Cantor in 1878, and establishing its truth or falsehood is the first of Hilbert's 23 problems presented in 1900. The answer to this problem is independent of ZFC, so that either the continuum hypothesis or its negation can be added as an axiom to ZFC set theory, with the resulting theory being ...

  2. The Continuum Hypothesis

    The continuum hypothesis (CH) is one of the most central open problems in set theory, one that is important for both mathematical and philosophical reasons. The problem actually arose with the birth of set theory; indeed, in many respects it stimulated the birth of set theory. In 1874 Cantor had shown that there is a one-to-one correspondence ...

  3. Continuum hypothesis

    continuum hypothesis, statement of set theory that the set of real number s (the continuum) is in a sense as small as it can be. In 1873 the German mathematician Georg Cantor proved that the continuum is uncountable—that is, the real numbers are a larger infinity than the counting numbers—a key result in starting set theory as a ...

  4. The Continuum Hypothesis, explained

    Cantor formulated one possible answer in his famous continuum hypothesis. This is one way to state it: Every infinite set of real numbers is either of the size of the natural numbers or of the size of the real numbers. The continuum hypothesis is, in fact, equivalent to saying that the real numbers have cardinality א‎1.

  5. PDF A brief history of the continuum hypothesis

    A brief history of the continuum hypothesis Kyle Gomez Abstract Cantor'sinsistenceonhisContinuumHypothesis,andtheinterestinitofmany others largely fueled the ...

  6. 8.5: The Continuum Hypothesis and The Generalized Continuum Hypothesis

    So the continuum hypothesis, the thing that got Georg Cantor so very heated up, comes down to asserting that \(ℵ_1 =\) c. There really should be a big question mark over that. A really big question mark. It turns out that the continuum hypothesis lives in a really weird world. . . To this day, no one has the least notion of whether it is true ...

  7. Continuum Hypothesis

    The Continuum Hypothesis was originally conjectured by Georg Cantor . In 1940 1940, Kurt Gödel showed that it is impossible to disprove the Continuum Hypothesis (CH for short) in Zermelo-Fraenkel set theory (ZF) with or without the Axiom of Choice ( ZFC ). In 1963 1963, Paul Cohen showed that it is impossible to prove CH in ZF or ZFC .

  8. Notes to The Continuum Hypothesis

    Back to Top. Notes to The Continuum Hypothesis. 1. See Hallett (1984) for further historical information on the role of CH in the early foundations of set theory. 2. We have of necessity presupposed much in the way of set theory. The reader seeking additional detail—for example, the definitions of regular and singular cardinals and other ...

  9. Continuum Hypothesis -- from Wolfram MathWorld

    The proposal originally made by Georg Cantor that there is no infinite set with a cardinal number between that of the "small" infinite set of integers and the "large" infinite set of real numbers (the "continuum"). Symbolically, the continuum hypothesis is that .Problem 1a of Hilbert's problems asks if the continuum hypothesis is true.. Gödel showed that no contradiction would arise if the ...

  10. The Continuum Hypothesis

    The Continuum Hypothesis. The continuum hypothesis (CH) states that there are no sets bigger than N and smaller than C. CH was formulated by Georg Cantor around 1880. CH seems pretty straightforward, kind of like saying that there are no integers between 0 and 1.

  11. The continuum hypothesis, the generic-multiverse of sets, and the Ω

    Summary § 1. A tale of two problems. The formal independence of Cantor' Continuum Hypothesis from the axioms of Set Theory (ZFC) is an immediate corollary of the following two theorems where the statement of the Cohen's theorem is recast in the more modern formulation of the Boolean valued universe.

  12. The Continuum: History, Mathematics, and Philosophy

    problem of the continuum explicitly and extensively. Aristotle's conception of the continuum is rst and foremost non-punctiform; that is, he maintained that the continuum cannot be composed of indivisibles like points. After presenting Aristotle's conception of the continuum, I will examine a few

  13. Mathematician W. Hugh Woodin Explains Continuum Hypothesis

    Mathematician W. Hugh Woodin has devoted his life to the study of infinity, attempting to solve the unsolvable. Doing so does require some mental gymnastics ...

  14. The continuum hypothesis

    The continuum hypothesis. Infinity comes in different sizes. That statement startles most math majors when they first learn about sets. It's counterintuitive on one level, as we are taught from an early age that there is only one infinity. But if I tell you that 2 2222 and 2 3000 are very large numbers, but the first is the larger of the two ...

  15. Can the Continuum Hypothesis Be Solved?

    The continuum hypothesis went on to become a very important problem, so much so that in 1900 Hilbert listed it as the first on his list of open problems, as previously mentioned. Hilbert eventually gave a proof of it in 1925—the proof was wrong, though it contained some important ideas.

  16. Continuum hypothesis

    Article Summary. The 'continuum hypothesis' (CH) asserts that there is no set intermediate in cardinality ('size') between the set of real numbers (the 'continuum') and the set of natural numbers. Since the continuum can be shown to have the same cardinality as the power set (that is, the set of subsets) of the natural numbers, CH ...

  17. 9

    The Axiom of Choice. Zermelo regards the axiom as an unquestionable truth. It must be confessed that, until he made it explicit, mathematicians had used it without a qualm; but it would seem that they had done so unconsciously. And the credit due to Zermelo for having made it explicit is entirely independent of the question whether it is true ...

  18. A Formal Proof of the Independence of the Continuum Hypothesis

    The continuum hypothesis (CH) states that there is no car-dinality between , the smallest infinite cardinal and , the cardinality of the continuum. It was posed by Cantor [6] in 1878 and was the first problem on Hilbert's list of twenty-three unsolved problems in mathematics. Gödel [14] proved

  19. Independence of the Continuum Hypothesis: an Intuitive Introduction

    The independence of the continuum hypothesis is a result of broad impact: it settles a basic question regarding the nature of N and R, two of the most familiar mathematical structures; it introduces the method of forcing that has become the main workhorse of set theory; and it has broad implications on mathematical foundations and on the role of syntax versus semantics. Despite its broad ...

  20. Notes to The Continuum Hypothesis

    Notes to The Continuum Hypothesis. 1. See Hallett (1984) for further historical information on the role of CH in the early foundations of set theory. 2. We have of necessity presupposed much in the way of set theory. The reader seeking additional detail—for example, the definitions of regular and singular cardinals and other fundamental ...

  21. Detailed Summary for 'Continuum Hypothesis and Poincaré ...

    The Continuum Hypothesis was shown to be independent of the standard axioms of set theory (known as ZFC) by Kurt Gödel in 1940. This means that the hypothesis cannot be proven or disproven using the standard axioms of set theory. However, the hypothesis can be assumed to be true or false, depending on the chosen set of axioms.

  22. Consistency of the Continuum Hypothesis. (AM-3), Volume 3

    The continuum hypothesis, introduced by mathematician George Cantor in 1877, states that there is no set of numbers between the integers and real numbers. It was later included as the first of mathematician David Hilbert's twenty-three unsolved math problems, famously delivered as a manifesto to the field of mathematics at the International ...

  23. Specific axioms under which the continuum hypothesis is true or false

    It is well-known that the continuum hypothesis (CH) cannot be proven under the standard axioms (i.e. independence from ZFC). However, to (non-expert, beginning student of the field) me, it seems like we could add some "natural" axioms until we see that the CH is true or false. Are there explicit axiom sets under which CH is true or false?