Cantor's first set theory article contains Georg Cantor's first theorems of transfinite set theory, which studies infinite sets and their properties. One of these theorems is his "revolutionary discovery" that the set of all real numbers is uncountably, rather than countably, infinite. 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 was published in 1874. In 1879, he modified his uncountability proof by using the topological notion of a set being dense in an interval.
 Cantor's article also contains a proof of the existence of transcendental numbers. Both constructive and non-constructive proofs have been presented as "Cantor's proof." The popularity of presenting a non-constructive proof has led to a misconception that Cantor's arguments are non-constructive. Since the proof that Cantor published either constructs transcendental numbers or does not, an analysis of his article can determine whether or not this proof is constructive. Cantor's correspondence with Richard Dedekind shows the development of his ideas and reveals that he had a choice between two proofs: a non-constructive proof that uses the uncountability of the real numbers and a constructive proof that does not use uncountability.
 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 recognized the role played by the uncountability theorem and the concept of countability in the development of set theory, measure theory, and the Lebesgue integral.
 Cantor's article is short, less than 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.
 Cantor's second theorem works with a closed interval [a, b], 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 [a, b], there is a number in [a, b] that is not contained in the given sequence. Hence, there are infinitely many such numbers.
 Cantor observes that combining his two theorems yields a new proof of Liouville's theorem that every interval [a, b] contains infinitely many transcendental numbers.
 
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. This remark contains Cantor's uncountability theorem, which only states that an interval [a, b] 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.
 
 Cantor only states his uncountability theorem. He does not use it in any proofs.
 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 following table contains the beginning of Cantor's enumeration.
 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 [a, b], there is a number in [a, b] that is not contained in the given sequence.
 To find a number in [a, b] 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 the open interval (a, b). 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 (a1, b1). Denote the smaller by a2 and the larger by b2. Continuing this procedure generates a sequence of intervals (a1, b1), (a2, b2), (a3, b3), ... 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 (aL, bL) 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:
   
  The proof is complete since, in all cases, at least one real number in [a, b] has been found that is not contained in the given sequence.
 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.
 An example illustrates how Cantor's construction works. 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. The table below shows the first five steps of the construction. The table's first column contains the intervals (an, bn). The second column lists the terms visited during the search for the first two terms in (an, bn). These two terms are in red.
 Since the sequence contains all the rational numbers in (0, 1), the construction generates an irrational number, which turns out to be √2 − 1.
 
 Cantor's construction produces mediants because the rational numbers were sequenced by increasing denominator. The first interval in the table is 
  
    
      
        (
        
          
            1
            3
          
        
        ,
        
          
            1
            2
          
        
        )
        .
      
    
    {\displaystyle ({\frac {1}{3}},{\frac {1}{2}}).}
  
 Since 
  
    
      
        
          
            1
            3
          
        
      
    
    {\displaystyle {\frac {1}{3}}}
  
 and 
  
    
      
        
          
            1
            2
          
        
      
    
    {\displaystyle {\frac {1}{2}}}
  
 are adjacent in 
  
    
      
        
          F
          
            3
          
        
        ,
      
    
    {\displaystyle F_{3},}
  
 their mediant 
  
    
      
        
          
            2
            5
          
        
      
    
    {\displaystyle {\frac {2}{5}}}
  
 is the first fraction in the sequence between 
  
    
      
        
          
            1
            3
          
        
      
    
    {\displaystyle {\frac {1}{3}}}
  
 and 
  
    
      
        
          
            1
            2
          
        
        .
      
    
    {\displaystyle {\frac {1}{2}}.}
  
 Hence, 
  
    
      
        
          
            1
            3
          
        
        <
        
          
            2
            5
          
        
        <
        
          
            1
            2
          
        
        .
      
    
    {\displaystyle {\frac {1}{3}}<{\frac {2}{5}}<{\frac {1}{2}}.}
  
 In this inequality, 
  
    
      
        
          
            1
            2
          
        
      
    
    {\displaystyle {\frac {1}{2}}}
  
 has the smallest denominator, so the second fraction is the mediant of 
  
    
      
        
          
            2
            5
          
        
      
    
    {\displaystyle {\frac {2}{5}}}
  
 and 
  
    
      
        
          
            1
            2
          
        
        ,
      
    
    {\displaystyle {\frac {1}{2}},}
  
 which equals 
  
    
      
        
          
            3
            7
          
        
        .
      
    
    {\displaystyle {\frac {3}{7}}.}
  
 This implies: 
  
    
      
        
          
            1
            3
          
        
        <
        
          
            2
            5
          
        
        <
        
          
            3
            7
          
        
        <
        
          
            1
            2
          
        
        .
      
    
    {\displaystyle {\frac {1}{3}}<{\frac {2}{5}}<{\frac {3}{7}}<{\frac {1}{2}}.}
  
 Therefore, the next interval is 
  
    
      
        (
        
          
            2
            5
          
        
        ,
        
          
            3
            7
          
        
        )
        .
      
    
    {\displaystyle ({\frac {2}{5}},{\frac {3}{7}}).}
  

 We will prove that the endpoints of the intervals converge to the continued fraction 
  
    
      
        [
        0
        ;
        2
        ,
        2
        ,
        …
        ]
        .
      
    
    {\displaystyle [0;2,2,\dots ].}
  
 This continued fraction is the limit of its convergents:
 The 
  
    
      
        
          p
          
            n
          
        
      
    
    {\displaystyle p_{n}}
  
 and 
  
    
      
        
          q
          
            n
          
        
      
    
    {\displaystyle q_{n}}
  
 sequences satisfy the equations:
 First, we prove by induction that for odd n, the n-th interval in the table is: 
 and for even n, the interval's endpoints are reversed: 
  
    
      
        
          (
          
            
              
                
                  p
                  
                    n
                  
                
                
                  q
                  
                    n
                  
                
              
            
            ,
            
              
                
                  
                    p
                    
                      n
                    
                  
                  +
                  
                    p
                    
                      n
                      −
                      1
                    
                  
                
                
                  
                    q
                    
                      n
                    
                  
                  +
                  
                    q
                    
                      n
                      −
                      1
                    
                  
                
              
            
          
          )
        
        
        .
      
    
    {\displaystyle \left({\frac {p_{n}}{q_{n}}},{\frac {p_{n}+p_{n-1}}{q_{n}+q_{n-1}}}\right)\!.}
  

 This is true for the first interval since:
 Assume that the inductive hypothesis is true for the k-th interval. If k is odd, this interval is:
 The mediant of its endpoints 
  
    
      
        
          
            
              2
              
                p
                
                  k
                
              
              +
              
                p
                
                  k
                  −
                  1
                
              
            
            
              2
              
                q
                
                  k
                
              
              +
              
                q
                
                  k
                  −
                  1
                
              
            
          
        
        =
        
          
            
              p
              
                k
                +
                1
              
            
            
              q
              
                k
                +
                1
              
            
          
        
      
    
    {\displaystyle {\frac {2p_{k}+p_{k-1}}{2q_{k}+q_{k-1}}}={\frac {p_{k+1}}{q_{k+1}}}}
  
 is the first fraction in the sequence between these endpoints.
 Hence, 
  
    
      
        
          
            
              
                p
                
                  k
                
              
              +
              
                p
                
                  k
                  −
                  1
                
              
            
            
              
                q
                
                  k
                
              
              +
              
                q
                
                  k
                  −
                  1
                
              
            
          
        
        <
        
          
            
              p
              
                k
                +
                1
              
            
            
              q
              
                k
                +
                1
              
            
          
        
        <
        
          
            
              p
              
                k
              
            
            
              q
              
                k
              
            
          
        
        .
      
    
    {\displaystyle {\frac {p_{k}+p_{k-1}}{q_{k}+q_{k-1}}}<{\frac {p_{k+1}}{q_{k+1}}}<{\frac {p_{k}}{q_{k}}}.}
  

 In this inequality, 
  
    
      
        
          
            
              p
              
                k
              
            
            
              q
              
                k
              
            
          
        
      
    
    {\displaystyle {\frac {p_{k}}{q_{k}}}}
  
 has the smallest denominator, so the second fraction is the mediant of 
  
    
      
        
          
            
              p
              
                k
                +
                1
              
            
            
              q
              
                k
                +
                1
              
            
          
        
      
    
    {\displaystyle {\frac {p_{k+1}}{q_{k+1}}}}
  
 and 
  
    
      
        
          
            
              p
              
                k
              
            
            
              q
              
                k
              
            
          
        
        ,
      
    
    {\displaystyle {\frac {p_{k}}{q_{k}}},}
  
 which equals 
  
    
      
        
          
            
              
                p
                
                  k
                  +
                  1
                
              
              +
              
                p
                
                  k
                
              
            
            
              
                p
                
                  k
                  +
                  1
                
              
              +
              
                q
                
                  k
                
              
            
          
        
        .
      
    
    {\displaystyle {\frac {p_{k+1}+p_{k}}{p_{k+1}+q_{k}}}.}
  

 This implies: 
  
    
      
        
          
            
              
                p
                
                  k
                
              
              +
              
                p
                
                  k
                  −
                  1
                
              
            
            
              
                q
                
                  k
                
              
              +
              
                q
                
                  k
                  −
                  1
                
              
            
          
        
        <
        
          
            
              p
              
                k
                +
                1
              
            
            
              q
              
                k
                +
                1
              
            
          
        
        <
        
          
            
              
                p
                
                  k
                  +
                  1
                
              
              +
              
                p
                
                  k
                
              
            
            
              
                p
                
                  k
                  +
                  1
                
              
              +
              
                q
                
                  k
                
              
            
          
        
        <
        
          
            
              p
              
                k
              
            
            
              q
              
                k
              
            
          
        
        .
      
    
    {\displaystyle {\frac {p_{k}+p_{k-1}}{q_{k}+q_{k-1}}}<{\frac {p_{k+1}}{q_{k+1}}}<{\frac {p_{k+1}+p_{k}}{p_{k+1}+q_{k}}}<{\frac {p_{k}}{q_{k}}}.}
  

 Therefore, the (k + 1)-st interval is 
  
    
      
        
          (
          
            
              
                
                  p
                  
                    k
                    +
                    1
                  
                
                
                  q
                  
                    k
                    +
                    1
                  
                
              
            
            ,
            
              
                
                  
                    p
                    
                      k
                      +
                      1
                    
                  
                  +
                  
                    p
                    
                      k
                    
                  
                
                
                  
                    p
                    
                      k
                      +
                      1
                    
                  
                  +
                  
                    q
                    
                      k
                    
                  
                
              
            
          
          )
        
        
        .
      
    
    {\displaystyle \left({\frac {p_{k+1}}{q_{k+1}}},{\frac {p_{k+1}+p_{k}}{p_{k+1}+q_{k}}}\right)\!.}
  

 This is the desired interval; 
  
    
      
        
          
            
              p
              
                k
                +
                1
              
            
            
              q
              
                k
                +
                1
              
            
          
        
      
    
    {\displaystyle {\frac {p_{k+1}}{q_{k+1}}}}
  
 is the left endpoint because k + 1 is even. Thus, the inductive hypothesis is true for the (k + 1)-st interval. For even k, the proof is similar. This completes the inductive proof.
 Since the right endpoints of the intervals are decreasing and every other endpoint is 
  
    
      
        
          
            
              p
              
                2
                n
                −
                1
              
            
            
              q
              
                2
                n
                −
                1
              
            
          
        
        ,
      
    
    {\displaystyle {\frac {p_{2n-1}}{q_{2n-1}}},}
  
 their limit equals

  
    
      
        
          lim
          
            n
            →
            ∞
          
        
        
          
            
              p
              
                n
              
            
            
              q
              
                n
              
            
          
        
        .
      
    
    {\displaystyle \lim _{n\to \infty }{\frac {p_{n}}{q_{n}}}.}
  
 The left endpoints have the same limit because they are increasing and every other endpoint is 
  
    
      
        
          
            
              p
              
                2
                n
              
            
            
              q
              
                2
                n
              
            
          
        
        .
      
    
    {\displaystyle {\frac {p_{2n}}{q_{2n}}}.}
  
 As mentioned above, this limit is the continued fraction 
  
    
      
        [
        0
        ;
        2
        ,
        2
        ,
        …
        ]
        ,
      
    
    {\displaystyle [0;2,2,\dots ],}
  
 which equals 
  
    
      
        
          
            2
          
        
        −
        1.
      
    
    {\displaystyle {\sqrt {2}}-1.}
  

 In 1879, Cantor published a new uncountability proof that modifies his 1874 proof. He first defines the topological notion of a point set P being "everywhere dense in an interval":
 In this discussion of Cantor's proof: a, b, c, d are used instead of α, β, γ, δ. Also, Cantor only uses his interval notation if the first endpoint is less than the second. For this discussion, this means that (a, b) implies a < b.
 Since the discussion of Cantor's 1874 proof was simplified by using open intervals rather than closed intervals, the same simplification is used here. This requires an equivalent definition of everywhere dense: A set P is everywhere dense in the interval [a, b] if and only if every open subinterval (c, d) of [a, b] contains at least one point of P.
 Cantor did not specify how many points of P an open subinterval (c, d) must contain. He did not need to specify this because the assumption that every open subinterval contains at least one point of P implies that every open subinterval contains infinitely many points of P.
 Cantor modified his 1874 proof with a new proof of its second theorem: Given any sequence P of real numbers x1, x2, x3, ... and any interval [a, b], there is a number in [a, b] that is not contained in P. Cantor's new proof has only two cases. First, it handles the case of P not being dense in the interval, then it deals with the more difficult case of P being dense in the interval. This division into cases not only indicates which sequences are more difficult to handle, but it also reveals the important role denseness plays in the proof.
 In the first case, P is not dense in [a, b]. By definition, P is dense in [a, b] if and only if for all subintervals (c, d) of [a, b], there is an x ∈ P such that x ∈ (c, d). Taking the negation of each side of the "if and only if" produces: P is not dense in [a, b] if and only if there exists a subinterval (c, d) of [a, b] such that for all x ∈ P : x ∉ (c, d). Therefore, every number in (c, d) is not contained in the sequence P. This case handles case 1 and case 3 of Cantor's 1874 proof.
 In the second case, which handles case 2 of Cantor's 1874 proof, P is dense in [a, b]. The denseness of sequence P is used to recursively define a sequence of nested intervals that excludes all the numbers in P and whose intersection contains a single real number in [a, b]. The sequence of intervals starts with (a, b). Given an interval in the sequence, the next interval is obtained by finding the two numbers with the least indices that belong to P and to the current interval. These two numbers are the endpoints of the next open interval. Since an open interval excludes its endpoints, every nested interval eliminates two numbers from the front of sequence P, which implies that the intersection of the nested intervals excludes all the numbers in P.  Details of this proof and a proof that this intersection contains a single real number in [a, b] are given below.
 The recursive step starts with the interval (an–1, bn–1), the inequalities k1 < k2 <  . . . < k2n–2 < k2n–1 and a < a1 < . . . < an–1 < bn–1 . . . < b1 < b, and the fact that the interval (an–1, bn–1) excludes the first 2n –2 members of the sequence P — that is, xm ∉ (an–1, bn–1) for m ≤ k2n–2. Since P is dense in [a, b], there are infinitely many numbers of P in (an–1, bn–1). Let xk2n –1 be the number with the least index and xk2n be the number with the next larger index, and let an be the smaller and bn be the larger of these two numbers. Then, k2n –1 < k2n, an–1 < an < bn < bn–1, and (an, bn) is a proper subinterval of (an–1, bn–1). Combining these inequalities with the ones for step n –1 of the recursion produces k1 < k2 <  . . . < k2n–1 < k2n and a < a1 < . . . < an < bn . . . < b1 < b. Also, xm ∉ (an, bn) for m = k2n–1 and m = k2n since these xm are the endpoints of (an, bn). This together with (an–1, bn–1) excluding the first 2n –2 members of sequence P implies that the interval (an, bn) excludes the first 2n members of P — that is, xm ∉ (an, bn) for m ≤ k2n. Therefore, for all n, xn ∉ (an, bn) since n ≤ k2n.
 The sequence an is increasing and bounded above by b, so the limit A = limn → ∞ an exists. Similarly, the limit B = limn → ∞ bn exists since the sequence bn is decreasing and bounded below by a. Also, an < bn implies A ≤ B. If A < B, then for every n: xn ∉ (A, B) because xn is not in the larger interval (an, bn). This contradicts P being dense in [a, b]. Hence, A = B. For all n, A ∈ (an, bn) but xn ∉ (an, bn). Therefore, A is a number in [a, b] that is not contained in P.
 The development leading to Cantor's 1874 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 (an1, n2, . . . , nν) where n1, n2, . . . , nν, and ν are positive integers.
 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.
 
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."
 On December 7, Cantor sent Dedekind a proof by contradiction that the set of real numbers is uncountable. Cantor starts by assuming that the real numbers in 
  
    
      
        [
        0
        ,
        1
        ]
      
    
    {\displaystyle [0,1]}
  
 can be written as a sequence. Then, he applies a construction to this sequence to produce a number in 
  
    
      
        [
        0
        ,
        1
        ]
      
    
    {\displaystyle [0,1]}
  
 that is not in the sequence, thus contradicting his assumption. Together, the letters of December 2 and 7 provide a non-constructive proof of the existence of transcendental numbers. Also, the proof in Cantor's December 7th letter shows some of the reasoning that led to his discovery that the real numbers form an uncountable set.
 
 The proof is by contradiction and starts by assuming that the real numbers in 
  
    
      
        [
        0
        ,
        1
        ]
      
    
    {\displaystyle [0,1]}
  
 can be written as a sequence:
 An increasing sequence is extracted from this sequence by letting   
  
    
      
        
          ω
          
            1
          
          
            1
          
        
        =
      
    
    {\displaystyle \omega _{1}^{1}=}
  
 the first term
  
    
      
        ,
         
        
          ω
          
            1
          
          
            2
          
        
        =
      
    
    {\displaystyle ,\ \omega _{1}^{2}=}
  
 the next largest term following 
  
    
      
        
          ω
          
            1
          
          
            1
          
        
        ,
         
        
          ω
          
            1
          
          
            3
          
        
        =
      
    
    {\displaystyle \omega _{1}^{1},\ \omega _{1}^{3}=}
  
 the next largest term following 
  
    
      
        
          ω
          
            1
          
          
            2
          
        
        ,
      
    
    {\displaystyle \omega _{1}^{2},}
  
  and so forth. The same procedure is applied to the remaining members of the original sequence to extract another increasing sequence. By continuing this process of extracting sequences, one sees that the sequence 
  
    
      
        (
        
          I
        
        )
      
    
    {\displaystyle (\mathrm {I} )}
  
 can be decomposed into the infinitely many sequences:
 Let 
  
    
      
        [
        p
        ,
        q
        ]
      
    
    {\displaystyle [p,q]}
  
 be an interval such that no term of sequence (1) lies in it. For example, let 
  
    
      
        p
      
    
    {\displaystyle p}
  
 and 
  
    
      
        q
      
    
    {\displaystyle q}
  
 satisfy 
  
    
      
        
          ω
          
            1
          
          
            1
          
        
        <
        p
        <
        q
        <
        
          ω
          
            1
          
          
            2
          
        
        .
      
    
    {\displaystyle \omega _{1}^{1}<p<q<\omega _{1}^{2}.}
  
 Then 
  
    
      
        
          ω
          
            1
          
          
            1
          
        
        <
        p
        <
        q
        <
        
          ω
          
            1
          
          
            n
          
        
      
    
    {\displaystyle \omega _{1}^{1}<p<q<\omega _{1}^{n}}
  
 for 
  
    
      
        n
        ≥
        2
        ,
      
    
    {\displaystyle n\geq 2,}
  
 so no term of sequence (1) lies in 
  
    
      
        [
        p
        ,
        q
        ]
        .
      
    
    {\displaystyle [p,q].}
  

 Now consider whether the terms of the other sequences lie outside 
  
    
      
        [
        p
        ,
        q
        ]
        .
      
    
    {\displaystyle [p,q].}
  
 All terms of some of these sequences may lie outside of 
  
    
      
        [
        p
        ,
        q
        ]
        ;
      
    
    {\displaystyle [p,q];}
  
 however, there must be some sequence such that not all its terms lie outside 
  
    
      
        [
        p
        ,
        q
        ]
        .
      
    
    {\displaystyle [p,q].}
  
 Otherwise, the numbers in 
  
    
      
        [
        p
        ,
        q
        ]
      
    
    {\displaystyle [p,q]}
  
 would not be contained in sequence 
  
    
      
        (
        
          I
        
        )
        ,
      
    
    {\displaystyle (\mathrm {I} ),}
  
 contrary to the initial hypothesis. Let sequence 
  
    
      
        (
        k
        )
      
    
    {\displaystyle (k)}
  
 be the first sequence that contains a term in 
  
    
      
        [
        p
        ,
        q
        ]
      
    
    {\displaystyle [p,q]}
  
 and let 
  
    
      
        
          ω
          
            k
          
          
            n
          
        
      
    
    {\displaystyle \omega _{k}^{n}}
  
 be the first term. Since 
  
    
      
        p
        <
        
          ω
          
            k
          
          
            n
          
        
        <
        q
        ,
      
    
    {\displaystyle p<\omega _{k}^{n}<q,}
  
 let 
  
    
      
        
          p
          
            1
          
        
      
    
    {\displaystyle p_{1}}
  
 and 
  
    
      
        
          q
          
            1
          
        
      
    
    {\displaystyle q_{1}}
  
 satisfy 
  
    
      
        p
        <
        
          p
          
            1
          
        
        <
        
          q
          
            1
          
        
        <
        
          ω
          
            k
          
          
            n
          
        
        <
        q
        .
      
    
    {\displaystyle p<p_{1}<q_{1}<\omega _{k}^{n}<q.}
  
 Then 
  
    
      
        [
        p
        ,
        q
        ]
      
    
    {\displaystyle [p,q]}
  
 is a proper superset of 
  
    
      
        [
        
          p
          
            1
          
        
        ,
        
          q
          
            1
          
        
        ]
      
    
    {\displaystyle [p_{1},q_{1}]}
  
 (in symbols, 
  
    
      
        [
        p
        ,
        q
        ]
        ⊋
        [
        
          p
          
            1
          
        
        ,
        
          q
          
            1
          
        
        ]
      
    
    {\displaystyle [p,q]\supsetneq [p_{1},q_{1}]}
  
). Also, the terms of sequences 
  
    
      
        (
        1
        )
        ,
        (
        2
        )
        ,
        …
        ,
        (
        k
        −
        1
        )
      
    
    {\displaystyle (1),(2),\ldots ,(k-1)}
  
 lie outside of 
  
    
      
        [
        
          p
          
            1
          
        
        ,
        
          q
          
            1
          
        
        ]
        .
      
    
    {\displaystyle [p_{1},q_{1}].}
  

 Repeat the above argument starting with 
  
    
      
        [
        
          p
          
            1
          
        
        ,
        
          q
          
            1
          
        
        ]
        
        :
        
      
    
    {\displaystyle [p_{1},q_{1}]\!:\,}
  
 Let sequence 
  
    
      
        (
        
          k
          
            1
          
        
        )
      
    
    {\displaystyle (k_{1})}
  
 be the first sequence containing a term in 
  
    
      
        [
        
          p
          
            1
          
        
        ,
        
          q
          
            1
          
        
        ]
      
    
    {\displaystyle [p_{1},q_{1}]}
  
 and let 
  
    
      
        
          ω
          
            
              k
              
                1
              
            
          
          
            n
          
        
      
    
    {\displaystyle \omega _{k_{1}}^{n}}
  
 be the first term. Since 
  
    
      
         
        
          p
          
            1
          
        
        <
        
          ω
          
            
              k
              
                1
              
            
          
          
            n
          
        
        <
        
          q
          
            1
          
        
        ,
      
    
    {\displaystyle \ p_{1}<\omega _{k_{1}}^{n}<q_{1},}
  
 let 
  
    
      
        
          p
          
            2
          
        
      
    
    {\displaystyle p_{2}}
  
 and 
  
    
      
        
          q
          
            2
          
        
      
    
    {\displaystyle q_{2}}
  
 satisfy 
  
    
      
        
          p
          
            1
          
        
        <
        
          p
          
            2
          
        
        <
        
          q
          
            2
          
        
        <
        
          ω
          
            
              k
              
                1
              
            
          
          
            n
          
        
        <
        
          q
          
            1
          
        
        .
      
    
    {\displaystyle p_{1}<p_{2}<q_{2}<\omega _{k_{1}}^{n}<q_{1}.}
  
 Then 
  
    
      
        [
        
          p
          
            1
          
        
        ,
        
          q
          
            1
          
        
        ]
        ⊋
        [
        
          p
          
            2
          
        
        ,
        
          q
          
            2
          
        
        ]
      
    
    {\displaystyle [p_{1},q_{1}]\supsetneq [p_{2},q_{2}]}
  
 and the terms of sequences 
  
    
      
        (
        
          k
          
            1
          
        
        )
        ,
        …
        ,
        (
        
          k
          
            2
          
        
        −
        1
        )
      
    
    {\displaystyle (k_{1}),\ldots ,(k_{2}-1)}
  
 lie outside of 
  
    
      
        [
        
          p
          
            2
          
        
        ,
        
          q
          
            2
          
        
        ]
        .
      
    
    {\displaystyle [p_{2},q_{2}].}
  

 One sees that it is possible to form an infinite sequence of nested intervals 
  
    
      
        [
        p
        ,
        q
        ]
        ⊋
        [
        
          p
          
            1
          
        
        ,
        
          q
          
            1
          
        
        ]
        ⊋
        [
        
          p
          
            2
          
        
        ,
        
          q
          
            2
          
        
        ]
        ⊋
        …
      
    
    {\displaystyle [p,q]\supsetneq [p_{1},q_{1}]\supsetneq [p_{2},q_{2}]\supsetneq \ldots }
  
 such that:
      the members of the 
  
    
      
        
          1
          
            st
          
        
        ,
        
          2
          
            nd
          
        
        ,
        …
        ,
        (
        k
        −
        1
        
          )
          
            st
          
        
      
    
    {\displaystyle 1^{\text{st}},2^{\text{nd}},\ldots ,(k-1)^{\text{st}}}
  
 sequence lie outside 
  
    
      
        [
        p
        ,
        q
        ]
        ;
      
    
    {\displaystyle [p,q];}
  

      the members of the 
  
    
      
        
          k
          
            th
          
        
        ,
        …
        ,
        (
        
          k
          
            1
          
        
        −
        1
        
          )
          
            st
          
        
      
    
    {\displaystyle k^{\text{th}},\ldots ,(k_{1}-1)^{\text{st}}}
  
 sequence lie outside 
  
    
      
        [
        
          p
          
            1
          
        
        ,
        
          q
          
            1
          
        
        ]
        ;
      
    
    {\displaystyle [p_{1},q_{1}];}
  

      the members of the 
  
    
      
        (
        
          k
          
            1
          
        
        
          )
          
            th
          
        
        ,
        …
        ,
        (
        
          k
          
            2
          
        
        −
        1
        
          )
          
            st
          
        
      
    
    {\displaystyle (k_{1})^{\text{th}},\ldots ,(k_{2}-1)^{\text{st}}}
  
 sequence lie outside 
  
    
      
        [
        
          p
          
            2
          
        
        ,
        
          q
          
            2
          
        
        ]
        ;
      
    
    {\displaystyle [p_{2},q_{2}];}
  

      
  
    
      
        …
        ;
      
    
    {\displaystyle \ldots ;}
  

 Since 
  
    
      
        
          p
          
            n
          
        
      
    
    {\displaystyle p_{n}}
  
 and 
  
    
      
        
          q
          
            n
          
        
      
    
    {\displaystyle q_{n}}
  
 are bounded monotonic sequences, the limits 
  
    
      
        
          lim
          
            n
            →
            ∞
          
        
        
          p
          
            n
          
        
      
    
    {\displaystyle \lim _{n\to \infty }p_{n}}
  
 and 
  
    
      
        
          lim
          
            n
            →
            ∞
          
        
        
          q
          
            n
          
        
      
    
    {\displaystyle \lim _{n\to \infty }q_{n}}
  
 exist. Also, 
  
    
      
        
          p
          
            n
          
        
        <
        
          q
          
            n
          
        
      
    
    {\displaystyle p_{n}<q_{n}}
  
 for all 
  
    
      
        n
      
    
    {\displaystyle n}
  
 implies 
  
    
      
        
          lim
          
            n
            →
            ∞
          
        
        
          p
          
            n
          
        
        ≤
        
          lim
          
            n
            →
            ∞
          
        
        
          q
          
            n
          
        
        .
      
    
    {\displaystyle \lim _{n\to \infty }p_{n}\leq \lim _{n\to \infty }q_{n}.}
  
 Hence, there is at least one number 
  
    
      
        η
      
    
    {\displaystyle \eta }
  
 in 
  
    
      
        (
        0
        ,
        1
        )
      
    
    {\displaystyle (0,1)}
  
 that lies in all the intervals 
  
    
      
        [
        p
        ,
        q
        ]
      
    
    {\displaystyle [p,q]}
  
 and 
  
    
      
        [
        
          p
          
            n
          
        
        ,
        
          q
          
            n
          
        
        ]
        .
      
    
    {\displaystyle [p_{n},q_{n}].}
  
 Namely, 
  
    
      
        η
      
    
    {\displaystyle \eta }
  
 can be any number in 
  
    
      
        [
        
          lim
          
            n
            →
            ∞
          
        
        
          p
          
            n
          
        
        ,
        
          lim
          
            n
            →
            ∞
          
        
        
          q
          
            n
          
        
        ]
        .
      
    
    {\displaystyle [\lim _{n\to \infty }p_{n},\lim _{n\to \infty }q_{n}].}
  
 This implies that 
  
    
      
        η
      
    
    {\displaystyle \eta }
  
 lies outside all the sequences 
  
    
      
        (
        1
        )
        ,
        (
        2
        )
        ,
        (
        3
        )
        ,
        …
        ,
      
    
    {\displaystyle (1),(2),(3),\ldots ,}
  
 contradicting the initial hypothesis that sequence 
  
    
      
        (
        
          I
        
        )
      
    
    {\displaystyle (\mathrm {I} )}
  
 contains all the real numbers in 
  
    
      
        [
        0
        ,
        1
        ]
        .
      
    
    {\displaystyle [0,1].}
  
 Therefore, the set of all real numbers is uncountable.
 Dedekind received Cantor's proof on December 8. On that same day, Dedekind simplified the proof and mailed his proof to Cantor. Cantor used Dedekind's proof in his article. The letter containing Cantor's December 7th proof was not published until 1937.
 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
 (1)     ω1, ω2, ... , ωn, ...

 
I can determine, in every given interval [α, β], a number η that is not included in (1). 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. These two proofs can be compared by starting with a sequence consisting of all the real algebraic numbers.
 The constructive proof applies Cantor's construction to this sequence and the interval [a, b] to produce a transcendental number in this interval.
 The non-constructive proof uses two proofs by contradiction:
 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 [a, b]. This eliminates the subsequence step and all occurrences of [a, b] in the second proof by contradiction.
 Akihiro Kanamori, who specializes in set theory, stated that "Accounts of Cantor's work have mostly reversed the order for deducing the existence of transcendental numbers, establishing first the uncountability of the reals and only then drawing the existence conclusion from the countability of the algebraic numbers. In textbooks the inversion may be inevitable, but this has promoted the misconception that Cantor's arguments are non-constructive." 
 Cantor's published proof and the reverse-order proof both use the theorem: Given a sequence of reals, a real can be found that is not in the sequence. By applying this theorem to the sequence of real algebraic numbers, Cantor produced a transcendental number. He then proved that the reals are uncountable: Assume that there is a sequence containing all the reals. Applying the theorem to this sequence produces a real not in the sequence, contradicting the assumption that the sequence contains all the reals. Hence, the reals are uncountable. The reverse-order proof starts by first proving the reals are uncountable. It then proves that transcendental numbers exist: If there were no transcendental numbers, all the reals would be algebraic and hence countable, which contradicts what was just proved. This contradiction proves that transcendental numbers exist without constructing any.
 The correspondence containing Cantor's non-constructive reasoning was published in 1937. By then, other mathematicians had rediscovered his non-constructive, reverse-order proof. As early as 1921, this proof was called "Cantor's proof" and criticized for not producing any transcendental numbers. In that year, Oskar Perron gave the reverse-order proof and then 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."
 As early as 1930, some mathematicians have attempted to correct this misconception of Cantor's work. In that year, 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." 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)." Cantor's proof is not only constructive, it is also simpler than Perron's proof, which requires the detour of first proving that the set of all reals is uncountable.
 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.
 The presentation of the non-constructive proof without mentioning Cantor's constructive proof appears in some books that were quite successful as measured by the length of time new editions or reprints appeared—for example: Oskar Perron's Irrationalzahlen (1921; 1960, 4th edition), 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). 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.
 Asserting that Cantor gave a non-constructive argument without mentioning the constructive proof he published 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." The proof that Cantor published produces transcendental numbers, and there appears to be no evidence that his argument was rejected. 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. 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.
 Historians of mathematics have discovered the following facts about Cantor's article "On a Property of the Collection of All Real Algebraic Numbers":
 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. Weierstrass was first amazed by the concept of countability, but then found the countability of the set of real algebraic numbers useful. Cantor did not want to publish yet, but Weierstrass felt that he must publish at least his results concerning the algebraic numbers.
 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 ..." 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, one of Cantor's colleagues. Cantor would submit his article to Crelle's Journal.
 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. It appears in a 
remark at the end of the article's introduction. 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. Weierstrass changed his opinion later. Without the uncountability theorem, the article needed a title that did not refer to this theorem. Cantor chose "Ueber eine Eigenschaft des Inbegriffes aller reellen algebraischen Zahlen" ("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.
 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.
 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. Cantor did this for expository reasons and because of "local circumstances". 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.
 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.
 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." 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 (an1, n2, ..., nν) where n1, n2, ..., nν, and ν are positive integers. Cantor's second result uses an indexed family of numbers: a set of the form (an1, n2, ..., 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 an1, n2 = n1/n2. The function can be quite general—for example, an1, n2, n3, n4, n5 = (n1/n2)1/n3 + tan(n4/n5).
 Dedekind replied with a proof of the theorem that the set of all algebraic numbers is countable. In his reply to Dedekind, Cantor did not claim to have proved Dedekind's result. He did indicate how he proved his theorem about indexed families of 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 = 
  
    
      
        
          
            N
          
        
      
    
    {\displaystyle {\mathfrak {N}}}
  
 and order the elements accordingly." However, Cantor's ordering is weaker than Dedekind's and cannot be extended to 
  
    
      
        n
      
    
    {\displaystyle n}
  
-tuples of integers that include zeros.
 Dedekind's second contribution is his proof of Cantor's second theorem. Dedekind sent this proof in reply to Cantor's letter that contained the uncountability theorem, which Cantor proved using infinitely many sequences. Cantor next wrote that he had found a simpler proof that did not use infinitely many sequences. 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." 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.
 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.
 In 1883, Cantor extended the positive integers 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. His work on infinite sets together with Dedekind's set-theoretical work created set theory.
 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. 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. Building on the work of Borel and Baire, Henri Lebesgue created his theories of measure and integration, which were published from 1899 to 1901.
 Countable models are used in set theory. In 1922, Thoralf Skolem proved that if conventional axioms of set theory are consistent, then they have a countable model. Since this model is countable, its set of real numbers is countable. This consequence is called Skolem's paradox, and Skolem explained why it does not contradict Cantor's uncountability theorem: although there is a one-to-one correspondence between this set and the set of positive integers, no such one-to-one correspondence is a member of the model. Thus the model considers its set of real numbers to be uncountable, or more precisely, the first-order sentence that says the set of real numbers is uncountable is true within the model. In 1963, Paul Cohen used countable models to prove his independence theorems.
  . . . But this contradicts a very general theorem, which we have 
proved with full rigor in Borchardt's Journal, Vol. 77, page 260; namely, the following theorem:
     "If one has a simply [countably] infinite sequence 
            ω1, ω2, . . . , ων, . . .
of real, unequal numbers that proceed according to some rule, then in every given interval [α, β] a number η (and thus infinitely many of them) can be specified that does not occur in this sequence (as a member of it)."
      In view of the great interest in this theorem, not only in the present discussion, but also in many other arithmetical as well as analytical relations, it might not be superfluous if we develop the argument followed there [Cantor's 1874 proof] more clearly here by using simplifying modifications.
      Starting with the sequence:
            ω1, ω2, . . . , ων, . . .
(which we give [denote by] the symbol (ω)) and an arbitrary interval [α, β], where α < β, we will now demonstrate that in this interval a real number η can be found that does not occur in (ω).
      I. We first notice that if our set (ω) is not everywhere dense in the interval [α, β], then within this interval another interval [γ, δ] must be present, all of whose numbers do not belong to (ω). From the interval [γ, δ], one can then choose any number for η. It lies in the interval [α, β] and definitely does not occur in our sequence (ω). Thus, this case presents no special considerations and we can move on to the more difficult case.
      II. Let the set (ω) be everywhere dense in the interval [α, β]. In this case, every interval [γ,δ] located in [α,β], however small, contains numbers of our sequence (ω). To show that, nevertheless, numbers η in the interval [α, β] exist that do not occur in (ω), we employ the following observation.
      Since some numbers in our sequence:
            ω1, ω2, . . . , ων, . . .
   . . . Dem widerspricht aber ein sehr allgemeiner Satz, welchen wir in Borchardt's Journal, Bd. 77, pag. 260, mit aller Strenge bewiesen haben, nämlich der folgende Satz:      "Hat man eine einfach unendliche Reihe             ω1, ω2, . . . , ων, . . . von reellen, ungleichen Zahlen, die nach irgend einem Gesetz fortschreiten, so lässt sich in jedem vorgegebenen, Intervalle (α . . . β) eine Zahl η (und folglich lassen sich deren unendlich viele) angeben, welche nicht in jener Reihe (als Glied derselben) vorkommt."      In Anbetracht des grossen Interesses, welches sich an diesen Satz, nicht blos bei der gegenwärtigen Erörterung, sondern auch in vielen anderen sowohl arithmetischen, wie analytischen Beziehungen, knüpft, dürfte es nicht überflüssig sein, wenn wir die dort befolgte Beweisführung [Cantors 1874 Beweis], unter Anwendung vereinfachender Modificationen, hier deutlicher entwickeln.      Unter Zugrundelegung der Reihe:             ω1, ω2, . . . , ων, . . . (welcher wir das Zeichen (ω) beilegen) und eines beliebigen Intervalles (α . . . β), wo α < β ist, soll also nun gezeigt werden, dass in diesem Intervalle eine reelle Zahl η gefunden werden kann, welche in (ω) nicht vorkommt.      I. Wir bemerken zunächst, dass wenn unsre Mannichfaltigkeit (ω) in dem Intervall (α . . . β)  nicht überall-dicht ist, innerhalb dieses Intervalles ein anderes (γ . . . δ) vorhanden sein muss, dessen Zahlen sämmtlich nicht zu (ω) gehören; man kann alsdann für η irgend eine Zahl des Intervalls (γ . . . δ) wählen, sie liegt im Intervalle (α . . . β) und kommt sicher in unsrer Reihe (ω) nicht vor. Dieser Fall bietet daher keinerlei besondere Umstände; und wir können zu dem schwierigeren übergehen.      II. Die Mannichfaltigkeit (ω) sei im Intervalle (α . . . β) überall-dicht. In diesem Falle enthält jedes, noch so kleine in (α . . . β) gelegene Intervall (γ . . . δ) Zahlen unserer Reihe (ω). Um zu zeigen, dass nichtsdestoweniger Zahlen η im Intervalle (α . . . β) existiren, welche in (ω) nicht vorkommen, stellen wir die folgende Betrachtung an.      Da in unserer Reihe:             ω1, ω2, . . . , ων, . . . definitely occur within the interval [α, β], one of these numbers must have the least index, let it be ωκ1, and another: ωκ2 with the next larger index.
      Let the smaller of the two numbers ωκ1, ωκ2 be denoted by α', the larger by β'. (Their equality is impossible because we assumed that our sequence consists of nothing but unequal numbers.)
      Then according to the definition:
            α < α' < β' < β ,
furthermore:                           
                 κ1 < κ2 ;
and all numbers ωμ of our sequence, 
for which μ ≤ κ2, do not lie in the interior of the interval [α', β'], as is immediately clear from the definition of the numbers κ1, κ2. Similarly, let ωκ3 and ωκ4 be the two numbers of our sequence with smallest indices that fall in the interior of the interval [α', β'] and let the smaller of the numbers ωκ3, ωκ4 be denoted by α'', the larger by β''.
      Then one has:  
            α' < α'' < β'' < β' ,
              κ2 < κ3 < κ4 ;
and one sees that all numbers ωμ of our sequence, for which μ ≤ κ4, do not fall into the interior of the interval [α'', β''].
       After one has followed this rule to reach an interval [α(ν - 1), β(ν - 1)], the next interval is produced by selecting the first two (i. e. with lowest indices) numbers of our sequence (ω) (let them be ωκ2ν - 1 and ωκ2ν) that fall into the interior of [α(ν - 1), β(ν - 1)]. Let the smaller of these two numbers be denoted  by α(ν), the larger by β(ν).
      The interval [α(ν), β(ν)] then lies in the interior of all preceding intervals and has the specific relation with our sequence (ω) that all numbers ωμ, for which μ ≤ κ2ν, definitely do not lie in its interior. Since obviously:
            κ1 < κ2 < κ3 <  . . . , ωκ2ν – 2 < ωκ2ν – 1 < ωκ2ν , . . . 
and these numbers, as indices, are whole numbers, so:
            κ2ν ≥ 2ν ,
and hence:
            ν < κ2ν ;
thus, we can certainly say (and this is sufficient for the following):
      That if ν is an arbitrary whole number, the [real] quantity ων lies outside the interval [α(ν) . . . β(ν)].
  sicher Zahlen innerhalb des Intervalls (α . . . β) vorkommen, so muss eine von diesen Zahlen den kleinsten Index haben, sie sei ωκ1, und eine andere: ωκ2 mit dem nächst grösseren Index behaftet sein.      Die kleinere der beiden Zahlen ωκ1, ωκ2 werde mit α', die grössere mit β' bezeichnet. (Ihre Gleichheit ist ausgeschlossen, weil wir voraussetzten, dass unsere Reihe aus lauter ungleichen Zahlen besteht.)      Es ist alsdann der Definition nach:             α < α' < β' < β , ferner:                                             κ1 < κ2 ; und ausserdem ist zu bemerken, dass alle Zahlen ωμ unserer Reihe,  für welche μ ≤ κ2, nicht im Innern des Intervalls (α' . . . β') liegen, wie aus der Bestimmung der Zahlen κ1, κ2 sofort erhellt. Ganz ebenso mögen ωκ3, ωκ4 die beiden mit den kleinsten Indices versehenen Zahlen unserer Reihen [see note 1 below] sein, welche in das Innere des Intervalls (α' . . . β') fallen und die kleinere der Zahlen ωκ3, ωκ4 werde mit α'', die grössere mit β'' bezeichnet.      Man hat alsdann:               α' < α'' < β'' < β' ,               κ2 < κ3 < κ4 ; und man erkennt, dass alle Zahlen ωμ unserer Reihe, für welche μ ≤ κ4 nicht in das Innere des Intervalls (α'' . . . β'') fallen.      Nachdem man unter Befolgung des gleichen Gesetzes zu einem Intervall (α(ν - 1), . . . β(ν - 1)) gelangt ist, ergiebt sich das folgende Intervall dadurch aus demselben, dass man die beiden ersten (d. h. mit niedrigsten Indices versehenen) Zahlen unserer Reihe (ω) aufstellt (sie seien ωκ2ν – 1 und ωκ2ν), welche in das Innere von (α(ν – 1) . . . β(ν – 1)) fallen; die kleinere dieser beiden Zahlen werde mit α(ν), die grössere mit β(ν) bezeichnet.      Das Intervall (α(ν) . . . β(ν)) liegt alsdann im Innern aller vorangegangenen Intervalle und hat zu unserer Reihe (ω) die eigenthümliche  Beziehung, dass alle Zahlen ωμ, für welche μ ≤ κ2ν sicher nicht in seinem Innern liegen.  Da offenbar:             κ1 < κ2 < κ3 <  . . . , ωκ2ν – 2 < ωκ2ν – 1 < ωκ2ν , . . .  und diese Zahlen, als Indices, ganze Zahlen sind, so ist:             κ2ν ≥ 2ν , und daher:             ν < κ2ν ; wir können daher, und dies ist für das Folgende ausreichend, gewiss sagen:      Dass, wenn ν eine beliebige ganze Zahl ist, die Grösse ων ausserhalb des Intervalls (α(ν) . . . β(ν)) liegt.      Since the numbers α',  α'',  α''', . . ., α(ν), . . . are continually increasing by value while simultaneously being enclosed in the interval [α, β], they have, by a well-known fundamental theorem of the theory of magnitudes [see note 2 below], a limit that we denote by A, so that:
            A = Lim α(ν)  for  ν = ∞.
      The same applies to the numbers β', β'', β''', . . ., β(ν), . . ., which are continually decreasing and likewise lying in the interval [α, β]. We call their limit B, so that: 
            B = Lim β(ν)  for  ν = ∞.
      Obviously, one has:
            α(ν) < A ≤ B < β(ν).
      But it is easy to see that the case A < B can not occur here since otherwise every number ων of our sequence would lie outside of the interval [A, B] by lying outside the interval [α(ν), β(ν)]. So our sequence (ω) would not be everywhere dense in the interval [α, β], contrary 
to the assumption.
      Thus, there only remains the case A = B and now it is demonstrated that the number: 
            η = A = B 
does not occur in our sequence (ω).
      If it were a member of our sequence, such as the νth, then one would have: η = ων.
      But the latter equation is not possible for any value of ν because η is in the interior of the interval [α(ν), β(ν)], but ων lies outside of it.
       Da die Zahlen α', α'', α''',  . . ., α(ν),  . . . ihrer Grösse nach fortwährend wachsen, dabei jedoch im Intervalle (α . . . β) eingeschlossen sind, so haben sie, nach einem bekannten Fundamentalsatze der Grössenlehre, eine Grenze, die wir mit A bezeichnen, so dass:             A = Lim α(ν)  für  ν = ∞.      Ein Gleiches gilt für die Zahlen β', β'', β''', . . ., β(ν), . . .  welche fortwährend abnehmen und dabei ebenfalls im Intervalle (α . . . β) liegen; wir nennen ihre Grenze B, so dass:             B = Lim β(ν) für ν = ∞.      Man hat offenbar:             α(ν) < A ≤ B < β(ν).      Es ist aber leicht zu sehen, dass der Fall A < B hier nicht vorkommen kann; da sonst jede Zahl ων, unserer Reihe ausserhalb des Intervalles (A . . . B) liegen würde, indem ων, ausserhalb des Intervalls (α(ν) . . . β(ν)) gelegen ist; unsere Reihe (ω) wäre im Intervall (α . . . β) nicht überalldicht, gegen die Voraussetzung.      Es bleibt daher nur der Fall A = B übrig und es zeigt sich nun, dass die Zahl:             η = A = B in unserer Reihe (ω) nicht vorkommt.      Denn, würde sie ein Glied unserer Reihe sein, etwa das νte, so hätte man: η = ων.      Die letztere Gleichung ist aber für keinen Werth von v möglich, weil η im Innern des Intervalls [α(ν), β(ν)], ων aber ausserhalb desselben liegt. Note 2: Grössenlehre, which has been translated as "the theory of magnitudes", is a term used by 19th century German mathematicians that refers to the theory of discrete and continuous magnitudes. (Ferreirós 2007, pp. 41–42, 202.)