Open main menu

Wikipedia β

Georg Cantor's first set theory article

  (Redirected from Cantor's first uncountability proof)
Georg Cantor, c. 1870.

Georg Cantor's first set theory article was published in 1874 and contains the first theorems of transfinite set theory, which studies infinite sets and their properties.[1] One of these theorems is "Cantor's revolutionary discovery" that the set of all real numbers is uncountably, rather than countably, infinite.[2] This theorem is proved using Cantor's first uncountability proof, which differs from the more familiar proof using his diagonal argument. The title of the article, "On a Property of the Collection of All Real Algebraic Numbers" ("Ueber eine Eigenschaft des Inbegriffes aller reellen algebraischen Zahlen"), refers to its first theorem: the set of real algebraic numbers is countable.

Cantor's article also contains a proof of the existence of transcendental numbers. As early as 1930, mathematicians have disagreed on whether this proof is constructive or non-constructive.[3] Books as recent as 2014 and 2015 indicate that this disagreement has not been resolved.[4] Since Cantor's proof either constructs transcendental numbers or does not, an analysis of his article can determine whether his proof is constructive or non-constructive.[5] Cantor's correspondence with Richard Dedekind shows the development of his ideas and reveals that he had a choice between two proofs, one that uses the uncountability of the real numbers and one that does not.

Historians of mathematics have examined Cantor's article and the circumstances in which it was written. For example, they have discovered that Cantor was advised to leave out his uncountability theorem in the article he submitted; he added it during proofreading. They have traced this and other facts about the article to the influence of Karl Weierstrass and Leopold Kronecker. Historians have also studied Dedekind's contributions to the article, including his contributions to the theorem on the countability of the real algebraic numbers. In addition, they have looked at the article's legacy—namely, the impact of the uncountability theorem and the concept of countability on mathematics.


The articleEdit

Cantor's article is short, not even four and a half pages. It begins with a discussion of the real algebraic numbers and a statement of his first theorem: The set of real algebraic numbers can be put into one-to-one correspondence with the set of positive integers. Cantor restates this theorem in terms more familiar to mathematicians of his time: The set of real algebraic numbers can be written as an infinite sequence in which each number appears only once.[6]

Cantor's second theorem works with a closed interval [ab], which is the set of real numbers ≥ a and ≤ b. The theorem states: Given any sequence of real numbers x1, x2, x3, … and any interval [ab], there is a number in [ab] that is not contained in the given sequence. Hence, there are infinitely many such numbers.[7]

The first part of this theorem implies the "Hence" part. For example, let [0, 1] be the interval, and consider its pairwise disjoint subintervals [0, 1/2], [3/47/8], [15/1631/32], …. Applying the first part of the theorem to each subinterval produces infinitely many numbers in [0, 1] that are not contained in the given sequence.

Cantor observes that combining his two theorems yields a new proof of the theorem that every interval [ab] contains infinitely many transcendental numbers. This theorem was first proved by Joseph Liouville.[7]

Cantor then remarks that his second theorem is:

the reason why collections of real numbers forming a so-called continuum (such as, all real numbers which are ≥ 0 and ≤ 1) cannot correspond one-to-one with the collection (ν) [the collection of all positive integers]; thus I have found the clear difference between a so-called continuum and a collection like the totality of real algebraic numbers.[8]

This remark contains Cantor's uncountability theorem, which only states that an interval [ab] cannot be put into one-to-one correspondence with the set of positive integers. It does not state that this interval is an infinite set of larger cardinality than the set of positive integers. Cardinality is defined in Cantor's next article, which was published in 1878.[9]

Cantor does not explicitly prove his uncountability theorem, which follows easily from his second theorem. To prove it, we use proof by contradiction. Assume that the interval [ab] can be put into one-to-one correspondence with the set of positive integers, or equivalently: The real numbers in [ab] can be written as a sequence in which each real number appears only once. Applying Cantor's second theorem to this sequence and [ab] produces a real number in [ab] that does not belong to the sequence. This contradicts the original assumption, and proves the uncountability theorem.

Cantor only states his uncountability theorem. He does not use it in any proofs.[6]

The proofsEdit

First theoremEdit

Algebraic numbers on the complex plane colored by polynomial degree. (red = 1, green = 2, blue = 3, yellow = 4). Points become smaller as the integer polynomial coefficients become larger.

To prove that the set of real algebraic numbers is countable, define the height of a polynomial of degree n with integer coefficients as: n − 1 + |a0| + |a1| + … + |an|, where a0, a1, …, an are the coefficients of the polynomial. Order the polynomials by their height, and order the real roots of polynomials of the same height by numeric order. Since there are only a finite number of roots of polynomials of a given height, these orderings put the real algebraic numbers into a sequence. Cantor went a step further and produced a sequence in which each real algebraic number appears just once. He did this by only using polynomials that are irreducible over the integers. The table below contains the beginning of Cantor's enumeration.

Second theoremEdit

Only the first part of Cantor's second theorem needs to be proved. It states: Given any sequence of real numbers x1, x2, x3, … and any interval [ab], there is a number in [ab] that is not contained in the given sequence. We simplify Cantor's proof by using open intervals. The open interval (ab) is the set of real numbers > a and < b.

To find a number in [ab] that is not contained in the given sequence, construct two sequences of real numbers as follows: Find the first two numbers of the given sequence that are in (ab). Denote the smaller of these two numbers by a1 and the larger by b1. Similarly, find the first two numbers of the given sequence that are in (a1b1). Denote the smaller by a2 and the larger by b2. Continuing this procedure generates a sequence of intervals (a1b1), (a2b2), (a3b3), … such that each interval in the sequence contains all succeeding intervals—that is, it generates a sequence of nested intervals. This implies that the sequence a1, a2, a3, … is increasing and the sequence b1, b2, b3, … is decreasing.

Either the number of intervals generated is finite or infinite. If finite, let (aNbN) be the last interval. If infinite, take the limits a = limn → ∞ an and b = limn → ∞ bn. Since an < bn for all n, either a = b or a < b. Thus, there are three cases to consider:

Case 1: Last interval (aN, bN)
Case 2: a = b
Case 3: a < b
  • Case 1: There is a last interval (aNbN). Since at most one xn can be in this interval, every y in this interval except xn (if it exists) is not contained in the given sequence.
  • Case 2: a = b. Then a is not contained in the given sequence since for all n: a belongs to (anbn) but xn does not. Cantor states without proof that xn ∉ (anbn); this will be proved below.
  • Case 3: a < b. Then every y in [ab] is not contained in the given sequence since for all n: y belongs to (anbn) but xn does not.

The proof is complete since, in all cases, at least one real number in [ab] has been found that is not contained in the given sequence.[A]

Cantor's proofs are constructive and have been used to write a computer program that generates the digits of a transcendental number. This program applies Cantor's construction to a sequence containing all the real algebraic numbers between 0 and 1. The article that discusses this program gives some of its output, which shows how the construction generates a transcendental.[10]

Dense sequencesEdit

Cantor observes that a = b when his construction is applied to the sequence of real algebraic numbers.[11] This sequence is dense in [ab], which means that every open subinterval (yz) of [ab] contains a term of the sequence. Cantor's observation follows from the lemma: If the sequence is dense in [ab], then a = b.

We prove the contrapositive: If a ≠ b, then the sequence is not dense in [ab]. If a ≠ b, then case 2 does not occur. Hence, there are two cases to consider:

  • Case 1: There is a last interval (aNbN), so at most one xn can be in this interval. If there is such an xn, then the interval (aNxn) contains no terms of the sequence. Otherwise, the interval (aNbN) contains no terms of the sequence.
  • Case 3: a < b. The interval (ab) contains no terms of the sequence.

In both cases, an open subinterval of [ab] has been found that contains no terms of the sequence, which implies that the sequence is not dense in [ab]. Therefore, the contrapositive of the lemma is true, which implies that the lemma is true.

Example of Cantor's constructionEdit

An example illustrates how Cantor's construction works and leads to a proof that xn ∉ (an, bn). Consider the sequence: 1/2, 1/3, 2/3, 1/4, 3/4, 1/5, 2/5, 3/5, 4/5, … This sequence is obtained by ordering the rational numbers in (0, 1) by increasing denominators, ordering those with the same denominator by increasing numerators, and omitting reducible fractions. Since this sequence is dense in [0, 1], the construction generates infinitely many intervals. The table below shows the first five steps of the construction. The table's first column contains the intervals (anbn). The second column lists the terms visited during the search for the first two terms in (anbn). These two terms are in red.

Let g(n) to be the least number such that xg(n) ∈ (an, bn). Then xi ∉ (an, bn) for 1 ≤ i < g(n). So proving g(n) > n implies xn ∉ (an, bn). In the table, xg(n) is the first red term of the n-th row. In the first row, xg(1) = x7 = 2/5, and xi ∉ (1/31/2) for 1 ≤ i < 7.

A proof will be given of the stronger result: g(n) > 2n. To simplify the proof, this result is proved only for constructions that generate infinitely many intervals, which implies that g(n) is defined for all n ≥ 1. These constructions, which are handled in cases 2 and 3 above, are the only constructions that need this result. The proof starts by observing that if an = xj and bn = xk, then xi ∉ (an, bn) for 1 ≤ i ≤ max(j, k) because each xi equals an or bn, or is not in the larger interval preceding (anbn). This implies g(n) > max(j, k) since g(n) is the least number such that xg(n) ∈ (an, bn).

Mathematical induction proves the inequality g(n) > 2n. The inequality holds for n = 1: if a1 = xj and b1 = xk, then max(jk) ≥ 2 because x1 is the first term of the sequence. Therefore, g(1) > max(j, k) ≥ 2, so g(1) > 2.

Assume the inductive hypothesis that the inequality holds for n—that is, g(n) > 2n. If an + 1 = xj and bn + 1 = xk, then g(n + 1) > max(j, k) ≥ min(jk) + 1. Now g(n) = min(jk) since xg(n) is the first term in (anbn). So g(n + 1) > g(n) + 1, which implies g(n + 1) ≥ g(n) + 2. Combine this result with the inductive hypothesis to obtain: g(n + 1) ≥ g(n) + 2 > 2n + 2 = 2(n + 1). Therefore, g(n + 1) > 2(n + 1), so the inequality holds for n + 1. This completes the inductive proof.

Generating a number using Cantor's construction
Interval Finding the next interval Interval (decimal)

Since the sequence contains all the rational numbers in (0, 1), the construction generates an irrational number, which turns out to be 2 − 1.

The development of Cantor's ideasEdit

The development leading to Cantor's article appears in the correspondence between Cantor and Richard Dedekind. On November 29, 1873, Cantor asked Dedekind whether the collection of positive integers and the collection of positive real numbers "can be corresponded so that each individual of one collection corresponds to one and only one individual of the other?" Cantor added that collections having such a correspondence include the collection of positive rational numbers, and collections of the form (an1n2, . . . , nν) where n1, n2, . . . , nν, and ν are positive integers.[15]

Dedekind replied that he was unable to answer Cantor's question, and said that it "did not deserve too much effort because it has no particular practical interest." Dedekind also sent Cantor a proof that the set of algebraic numbers is countable.[16]

On December 2, Cantor responded that his question does have interest: "It would be nice if it could be answered; for example, provided that it could be answered no, one would have a new proof of Liouville's theorem that there are transcendental numbers."[17]

On December 7, Cantor sent Dedekind a proof by contradiction that the set of real numbers is uncountable. Cantor starts by assuming the real numbers can be written as a sequence. Then he applies a construction to this sequence to produce a real number not in the sequence, thus contradicting his assumption.[18] The letters of December 2 and 7 lead to a non-constructive proof of the existence of transcendental numbers.

On December 9, Cantor announced the theorem that allowed him to construct transcendental numbers as well as prove the uncountability of the set of real numbers:

I show directly that if I start with a sequence
(I)     ω1, ω2, … , ωn, …
I can determine, in every given interval [α, β], a number η that is not included in (I).[19]

This is the second theorem in Cantor's article. It comes from realizing that his construction can be applied to any sequence, not just to sequences that supposedly enumerate the real numbers. So Cantor had a choice between two proofs that demonstrate the existence of transcendental numbers: one proof is constructive, but the other is not. We now compare the proofs assuming that we have a sequence consisting of all the real algebraic numbers.

The constructive proof applies Cantor's construction to this sequence and the interval [ab] to produce a transcendental number in this interval.

The non-constructive proof uses two proofs by contradiction:

  1. The proof by contradiction used to prove the uncountability theorem (see "The article" section above). It assumes that the real numbers in [ab] can be written as a sequence, applies Cantor's construction to obtain a contradiction, and concludes that the real numbers in [ab] cannot be written as a sequence.
  2. Assume that there are no transcendental numbers in [ab]. Then all the real numbers in [ab] are algebraic, which implies that they form a subsequence of the sequence of all real algebraic numbers. This contradicts what was proved in 1. Thus, the assumption that there are no transcendental numbers in [ab] is false. Therefore, there is a transcendental number in this interval.

Cantor chose to publish the constructive proof, which not only produces a transcendental number but is also shorter and avoids two proofs by contradiction.

The non-constructive proof from Cantor's correspondence is simpler than the one above because it works with all the real numbers rather than the interval [ab]. For example, this eliminates the subsequence step in the second proof by contradiction.

The disagreement about Cantor's existence proofEdit

Oskar Perron

The correspondence containing Cantor's non-constructive reasoning was published in 1937. By then, other mathematicians had rediscovered its non-constructive proof. As early as 1921, this proof was attributed to Cantor and criticized for not producing any transcendental numbers.[20] In that year, Oskar Perron stated: "… Cantor's proof for the existence of transcendental numbers has, along with its simplicity and elegance, the great disadvantage that it is only an existence proof; it does not enable us to actually specify even a single transcendental number."[21]

Abraham Fraenkel

Some mathematicians have attempted to correct this misunderstanding of Cantor's work. In 1930, the set theorist Abraham Fraenkel stated that Cantor's method is "… a method that incidentally, contrary to a widespread interpretation, is fundamentally constructive and not merely existential."[22] In 1972, Irving Kaplansky wrote: "It is often said that Cantor's proof is not 'constructive,' and so does not yield a tangible transcendental number. This remark is not justified. If we set up a definite listing of all algebraic numbers … and then apply the diagonal procedure …, we get a perfectly definite transcendental number (it could be computed to any number of decimal places)."[23]

Cantor's diagonal argument has often replaced his 1874 construction in expositions of his proof. The diagonal argument is constructive and produces a more efficient computer program than his 1874 construction. Using it, a computer program has been written that computes the digits of a transcendental number in polynomial time. The program that uses Cantor's 1874 construction requires at least sub-exponential time.[24]

The disagreement about Cantor's proof occurs because two groups of mathematicians are talking about different proofs: the constructive one that Cantor published and the non-constructive one that was later rediscovered. The opinion that Cantor's proof is non-constructive appears in some books that were quite successful as measured by the length of time new editions or reprints appeared—for example: Eric Temple Bell's Men of Mathematics (1937; still being reprinted), Godfrey Hardy and E. M. Wright's An Introduction to the Theory of Numbers (1938; 2008 6th edition), Garrett Birkhoff and Saunders Mac Lane's A Survey of Modern Algebra (1941; 1997 5th edition), and Michael Spivak's Calculus (1967; 2008 4th edition).[25] Since these books view Cantor's proof as non-constructive, they do not mention his constructive proof. On the other hand, the quotations above from Fraenkel and Kaplansky show that they knew Cantor's work can be used non-constructively. The disagreement about Cantor's proof shows no sign of being resolved: since 2014, at least two books have appeared stating that Cantor's proof is constructive, and at least four have appeared stating that his proof does not construct any (or a single) transcendental.[26]

Asserting that Cantor gave a non-constructive proof can lead to erroneous statements about the history of mathematics. In A Survey of Modern Algebra, Birkhoff and Mac Lane state: "Cantor's argument for this result [Not every real number is algebraic] was at first rejected by many mathematicians, since it did not exhibit any specific transcendental number." Birkhoff and Mac Lane are talking about the non-constructive proof.[27] Cantor's proof produces transcendental numbers, and there appears to be no evidence that his argument was rejected.[28] Even Leopold Kronecker, who had strict views on what is acceptable in mathematics and who could have delayed publication of Cantor's article, did not delay it.[29] In fact, applying Cantor's construction to the sequence of real algebraic numbers produces a limiting process that Kronecker accepted—namely, it determines a number to any required degree of accuracy.[30][B]

The influence of Weierstrass and Kronecker on Cantor's articleEdit

Karl Weierstrass
Leopold Kronecker, 1865

Historians of mathematics have discovered the following facts about Cantor's article "On a Property of the Collection of All Real Algebraic Numbers":

  • Cantor's uncountability theorem was left out of the article he submitted. He added it during proofreading.[34]
  • The article's title refers to the set of real algebraic numbers. The main topic in Cantor's correspondence was the set of real numbers.[35]
  • The proof of Cantor's second theorem does not state why some limits exist. The proof he was using does.[36]
  • Cantor restricted his first theorem to the set of real algebraic numbers. The proof he was using demonstrates the countability of the set of all algebraic numbers.[16]

To explain these facts, historians have pointed to the influence of Cantor's former professors, Karl Weierstrass and Leopold Kronecker. Cantor discussed his results with Weierstrass on December 23, 1873.[37] Weierstrass was first amazed by the concept of countability, but then found the countability of the set of real algebraic numbers useful.[38] Cantor did not want to publish yet, but Weierstrass felt that he must publish at least his results concerning the algebraic numbers.[37]

From his correspondence, it appears that Cantor only discussed his article with Weierstrass. However, Cantor told Dedekind: "The restriction which I have imposed on the published version of my investigations is caused in part by local circumstances …"[37] Cantor biographer Joseph Dauben believes that "local circumstances" refers to Kronecker who, as a member of the editorial board of Crelle's Journal, had delayed publication of an 1870 article by Eduard Heine. Cantor would submit his article to Crelle's Journal.[39]

Weierstrass advised Cantor to leave his uncountability theorem out of the article he submitted, but Weierstrass also told Cantor that he could add it as a marginal note during proofreading, which he did.[34] It appears in a remark at the end of the article's introduction.[40] The opinions of Kronecker and Weierstrass both played a role here. Kronecker did not accept infinite sets, and it seems that Weierstrass did not accept that two infinite sets could be so different, with one being countable and the other not.[41] Weierstrass changed his opinion later.[42] Without the uncountability theorem, the article needed a title that did not refer to this theorem. Cantor chose "On a Property of the Collection of All Real Algebraic Numbers," which refers to the countability of the set of real algebraic numbers, the result that Weierstrass found useful.[43]

Kronecker's influence appears in the proof of Cantor's second theorem. Cantor used Dedekind's version of the proof except he left out why the limits a = limn → ∞ an and b = limn → ∞ bn exist. Dedekind had used his "principle of continuity" to prove they exist. This principle (which is equivalent to the least upper bound property of the real numbers) comes from Dedekind's construction of the real numbers, a construction Kronecker did not accept.[44]

Cantor restricted his first theorem to the set of real algebraic numbers even though Dedekind had sent him a proof that handled all algebraic numbers.[16] Cantor did this for expository reasons and because of "local circumstances."[45] This restriction simplifies the article because the second theorem works with real sequences. Hence, the construction in the second theorem can be applied directly to the enumeration of the real algebraic numbers to produce "an effective procedure for the calculation of transcendental numbers." This procedure would be acceptable to Weierstrass.[46]

Dedekind's contributions to Cantor's articleEdit

Richard Dedekind, c. 1870.

Since 1856, Dedekind had developed theories involving infinitely many infinite sets—for example: ideals, which he used in algebraic number theory, and Dedekind cuts, which he used to construct the real numbers. This work enabled him to understand and contribute to Cantor's work.[47]

Dedekind's first contribution concerns the theorem that the set of real algebraic numbers is countable. Cantor is usually given credit for this theorem, but the mathematical historian José Ferreirós calls it "Dedekind's theorem."[48] Their correspondence reveals what each mathematician contributed to the theorem.

In his letter introducing the concept of countability, Cantor stated without proof that the set of positive rational numbers is countable, as are sets of the form (an1n2, …, nν) where n1n2, …, nν, and ν are positive integers.[49] Cantor's second result uses indexed numbers: a set of the form (an1n2, …, nν) is the range of a function from the ν indices to the set of real numbers. His second result implies his first: let ν = 2 and an1n2 = n1/n2. The function can be quite general—for example, an1n2n3n4n5 = (n1/n2)1/n3 + tan(n4/n5).

Dedekind replied with a proof of the theorem that the set of all algebraic numbers is countable.[16] To obtain this result from Cantor's theorem about indexed numbers, Dedekind had to remove the restriction to positive integer indices and realize that the ordering produced can order the polynomials that have integer coefficients.

In his reply, Cantor did not claim to have proved Dedekind's result. He did indicate how he proved his theorem about indexed numbers: "Your proof that (n) [the set of positive integers] can be correlated one-to-one with the field of all algebraic numbers is approximately the same as the way I prove my contention in the last letter. I take n12 + n22 + ··· + nν2 =   and order the elements accordingly."[50] Cantor's ordering cannot handle indices that are 0.[51]

Dedekind's second contribution is his proof of Cantor's second theorem. Dedekind sent Cantor this proof in reply to Cantor's letter that announced the uncountability theorem and proved it using infinitely many sequences. Before Dedekind's proof arrived, Cantor wrote that he had found a simpler proof that did not use infinitely many sequences.[52] So Cantor had a choice of proofs and chose to publish Dedekind's.

Cantor thanked Dedekind privately for his help: "… your comments (which I value highly) and your manner of putting some of the points were of great assistance to me."[37] However, he did not mention Dedekind's help in his article. In previous articles, he had acknowledged help received from Kronecker, Weierstrass, Heine, and Hermann Schwarz. Cantor's failure to mention Dedekind's contributions damaged his relationship with Dedekind. Dedekind stopped replying to his letters and did not resume the correspondence until October 1876.[53]

The legacy of Cantor's articleEdit

Cantor's article introduced the uncountability theorem and the concept of countability. Both would lead to significant developments in mathematics.

The uncountability theorem demonstrated that one-to-one correspondences can be used to analyze infinite sets. In 1878, Cantor used them to define and compare cardinalities. He also constructed one-to-one correspondences to prove that the n-dimensional spaces Rn (where R is the set of real numbers) and the set of irrational numbers have the same cardinality as R.[54][C]

In 1883, Cantor extended the natural numbers with his infinite ordinals. This extension was necessary for his work on the Cantor-Bendixson theorem. Cantor discovered other uses for the ordinals—for example, he used sets of ordinals to produce an infinity of sets having different infinite cardinalities.[56] His work on infinite sets together with Dedekind's set-theoretical work created set theory.[57]

The concept of countability led to countable operations and objects that are used in various areas of mathematics. For example, in 1878, Cantor introduced countable unions of sets.[58] In the 1890s, Émile Borel used countable unions in his theory of measure, and René Baire used countable ordinals to define his classes of functions.[59] Building on the work of Borel and Baire, Henri Lebesgue created his theories of measure and integration, which were published from 1899 to 1901.[60]

Countable models are used in set theory. In 1922, Thoralf Skolem proved that if the axioms of set theory are consistent, then they have a countable model. Since this model is countable, its set of real numbers is countable. Skolem explained why this does not contradict Cantor's uncountability theorem: the model considers its set of real numbers to be uncountable because it contains no one-to-one correspondence between this set and its set of positive integers. The one-to-one correspondence between these sets exists outside the model.[61] In 1963, Paul Cohen used countable models to prove his independence theorems.[62]

See alsoEdit


  1. ^ The difference between our proof and Cantor's is that he generates the sequence of closed intervals [anbn]. To find an + 1 and bn + 1, he must also use the open intervals (anbn). By generating a sequence of open intervals, we avoid working with the closed intervals.
  2. ^ Kronecker's opinion was: "Definitions must contain the means of reaching a decision in a finite number of steps, and existence proofs must be conducted so that the quantity in question can be calculated with any required degree of accuracy."[31] So Kronecker would accept Cantor's argument as a valid existence proof, but he would not accept its conclusion that transcendental numbers exist. For Kronecker, they do not exist because their definition contains no means for deciding in a finite number of steps whether or not a given number is transcendental.[32] To prove that Cantor's construction calculates numbers to any required degree of accuracy, we need to prove: Given a k, an n can be computed such that bnan1/k where (anbn) is the n-th interval of Cantor's construction. An example of how to prove this is given in Gray 1994, p. 822. Cantor's diagonal argument provides an accuracy of 10n after n real algebraic numbers have been calculated because each of these numbers generates one digit of the transcendental number.[33]
  3. ^ Cantor's method of constructing a one-to-one correspondence between the set of irrational numbers and R can be used to construct one between the set of transcendental numbers and R.[55] The construction begins with the set of transcendental numbers T and removes a countable subset {tn} (for example, tn = e/n). Let this set be T0. Then T =  T0 ∪ {tn} = T0 ∪ {t2n – 1} ∪ {t2n}, and R = T ∪ {an} = T0 ∪ {tn} ∪ {an} where an is the sequence of real algebraic numbers. So both T and R are the union of three pairwise disjoint sets: T0 and two countable sets. A one-to-one correspondence between T and R is given by the function: g(t) = t if t ∈ T0, g(t2n – 1) = tn, and g(t2n)  = an.


  1. ^ Ferreirós 2007, p. 171.
  2. ^ Dauben 1993, p. 4.
  3. ^ "[Cantor's method is] a method that incidentally, contrary to a widespread interpretation, is fundamentally constructive and not merely existential." (Fraenkel 1930, p. 237; English translation: Gray 1994, p. 823.)
  4. ^ "Cantor's proof of the existence of transcendental numbers is not just an existence proof. It can, at least in principle, be used to construct an explicit transcendental number." (Sheppard 2014, p. 131.) "Meanwhile Georg Cantor, in 1874, had produced a revolutionary proof of the existence of transcendental numbers, without actually constructing any." (Stewart 2015, p. 285.)
  5. ^ Gray 1994, pp. 819–821.
  6. ^ a b Cantor 1874. English translation: Ewald 1996, pp. 840–843.
  7. ^ a b Cantor 1874, p. 259. English translation: Ewald 1996, pp. 840–841.
  8. ^ Cantor 1874, p. 259. English translation: Gray 1994, p. 820.
  9. ^ Cantor 1878, p. 242.
  10. ^ Gray 1994, p. 822.
  11. ^ Cantor 1874, p. 261. English translation: Ewald 1996, p. 842.
  12. ^ LeVeque 1956, pp. 154–155.
  13. ^ LeVeque 1956, p. 174.
  14. ^ Weisstein 2003, p. 541.
  15. ^ Noether & Cavaillès 1937, pp. 12–13. English translation: Gray 1994, p. 827; Ewald 1996, p. 844.
  16. ^ a b c d Noether & Cavaillès 1937, p. 18. English translation: Ewald 1996, p. 848.
  17. ^ Noether & Cavaillès 1937, p. 13. English translation: Gray 1994, p. 827.
  18. ^ Noether & Cavaillès 1937, pp. 14–15. English translation: Ewald 1996, pp. 845–846.
  19. ^ Noether & Cavaillès 1937, p. 16. English translation: Gray 1994, p. 827.
  20. ^ Gray 1994, pp. 827–828.
  21. ^ Perron 1921, p. 162. English translation: Gray 1994, p. 828.
  22. ^ Fraenkel 1930, p. 237. English translation: Gray 1994, p. 823.
  23. ^ Kaplansky 1972, p. 25.
  24. ^ Gray 1994, pp. 822–824.
  25. ^ Bell 1937, pp. 568–569; Hardy & Wright 1938, p. 159 (6th ed., pp. 205–206); Birkhoff & Mac Lane 1941, p. 392, (5th ed., pp. 436–437); Spivak 1967, pp. 369–370 (4th ed., pp. 448–449).
  26. ^ Proof is constructive: Dasgupta 2014, p. 107; Sheppard 2014, pp. 131–132. Proof is non-constructive: Jarvis 2014, p. 18; Chowdhary 2015, p. 19; Stewart 2015, p. 285; Stewart & Tall 2015, p. 333.
  27. ^ Birkhoff & Mac Lane 1941, p. 392, (5th ed., pp. 436–437).
  28. ^ Gray 1994, p. 828.
  29. ^ Edwards 1989; Gray 1994, p. 828.
  30. ^ Edwards 1989, pp. 74–75.
  31. ^ Burton 1995, p. 595.
  32. ^ Dauben 1979, p. 69.
  33. ^ Gray 1994, p. 824.
  34. ^ a b Ferreirós 2007, p. 184.
  35. ^ Noether & Cavaillès 1937, pp. 12–16. English translation: Ewald 1996, pp. 843–846.
  36. ^ Dauben 1979, p. 67.
  37. ^ a b c d Noether & Cavaillès 1937, pp. 16–17. English translation: Ewald 1996, p. 847.
  38. ^ Grattan-Guinness 1971, p. 124.
  39. ^ Dauben 1979, pp. 67, 308–309.
  40. ^ See "The article" section. Also: Cantor 1874, p. 259; English translation: Ewald 1996, p. 841.
  41. ^ Ferreirós 2007, pp. 184–185, 245.
  42. ^ "It is unclear when his attitude changed, but there is evidence that by the mid-1880s he was accepting the conclusion that infinite sets are of different powers [cardinalities]." (Ferreirós 2007, p. 185.)
  43. ^ Ferreirós 2007, p. 177.
  44. ^ Dauben 1979, pp. 67–68.
  45. ^ Ferreirós 2007, p. 183.
  46. ^ Ferreirós 2007, p. 185.
  47. ^ Ferreirós 2007, pp. 109–111, 172–174.
  48. ^ Ferreirós 1993, p. 350.
  49. ^ Noether & Cavaillès 1937, pp. 12–13. English translation: Ewald 1996, p. 844.
  50. ^ Noether & Cavaillès 1937, p. 13. English translation: Ewald 1996, p. 845.
  51. ^ Ferreirós 2007, p. 179.
  52. ^ Noether & Cavaillès 1937, pp. 14–16, 19. English translation: Ewald 1996, pp. 845–847, 849.
  53. ^ Ferreirós 1993, pp. 349–350; Ferreirós 2007, pp. 185–186.
  54. ^ Cantor 1878, pp. 245–254.
  55. ^ Cantor 1879, p. 4.
  56. ^ Ferreirós 2007, pp. 267–273.
  57. ^ Ferreirós 2007, pp. xvi, 320–321, 324.
  58. ^ Cantor 1878, p. 243.
  59. ^ Hawkins 1970, pp. 103–106, 127.
  60. ^ Hawkins 1970, pp. 118, 120–124, 127.
  61. ^ Ferreirós 2007, pp. 362–363.
  62. ^ Cohen 1963, pp. 1143–1144.