Riemann series theorem

Template:Short description In mathematics, the Riemann series theorem, also called the Riemann rearrangement theorem, named after 19th-century German mathematician Bernhard Riemann, says that if an infinite series of real numbers is conditionally convergent, then its terms can be arranged in a permutation so that the new series converges to an arbitrary real number, and rearranged such that the new series diverges. This implies that a series of real numbers is absolutely convergent if and only if it is unconditionally convergent.Template:Sfnm

As an example, the series

$1-1+\frac{1}{2}-\frac{1}{2}+\frac{1}{3}-\frac{1}{3}+\frac{1}{4}-\frac{1}{4}+\dots$

converges to 0 (for a sufficiently large number of terms, the partial sum gets arbitrarily near to 0); but replacing all terms with their absolute values gives

$1+1+\frac{1}{2}+\frac{1}{2}+\frac{1}{3}+\frac{1}{3}+\dots$

which sums to infinity. Thus, the original series is conditionally convergent, and can be rearranged (by taking the first two positive terms followed by the first negative term, followed by the next two positive terms and then the next negative term, etc.) to give a series that converges to a different sum, such as

$1+\frac{1}{2}-1+\frac{1}{3}+\frac{1}{4}-\frac{1}{2}+\dots$

which evaluates to ln 2. More generally, using this procedure with p positives followed by q negatives gives the sum ln(p/q). Other rearrangements give other finite sums or do not converge to any sum.

History

It is a basic result that the sum of finitely many numbers does not depend on the order in which they are added. For example, Template:Math. The observation that the sum of an infinite sequence of numbers can depend on the ordering of the summands is commonly attributed to Augustin-Louis Cauchy in 1833.Template:Sfnm He analyzed the alternating harmonic series, showing that certain rearrangements of its summands result in different limits. Around the same time, Peter Gustav Lejeune Dirichlet highlighted that such phenomena are ruled out in the context of absolute convergence, and gave further examples of Cauchy's phenomenon for some other series which fail to be absolutely convergent.Template:Sfnm

In the course of his analysis of Fourier series and the theory of Riemann integration, Bernhard Riemann gave a full characterization of the rearrangement phenomena.Template:Sfnm He proved that in the case of a convergent series which does not converge absolutely (known as conditional convergence), rearrangements can be found so that the new series converges to any arbitrarily prescribed real number.Template:Sfnm Riemann's theorem is now considered as a basic part of the field of mathematical analysis.Template:Sfnm

For any series, one may consider the set of all possible sums, corresponding to all possible rearrangements of the summands. Riemann’s theorem can be formulated as saying that, for a series of real numbers, this set is either empty, a single point (in the case of absolute convergence), or the entire real number line (in the case of conditional convergence). In this formulation, Riemann’s theorem was extended by Paul Lévy and Ernst Steinitz to series whose summands are complex numbers or, even more generally, elements of a finite-dimensional real vector space. They proved that the set of possible sums forms a real affine subspace. Extensions of the Lévy–Steinitz theorem to series in infinite-dimensional spaces have been considered by a number of authors.Template:Sfnm

Definitions

A series ${\sum }_{n=1}^{\mathrm{\infty }}{a}_n$ converges if there exists a value $\ell$ such that the sequence of the partial sums

$(S_1,S_2,S_3,\dots ),S_n=\sum _{k=1}^n{a}_k,$

converges to $\ell$. That is, for any ε > 0, there exists an integer N such that if n ≥ N, then

$|S_n-\ell |\le \epsilon .$

A series converges conditionally if the series ${\sum }_{n=1}^{\mathrm{\infty }}{a}_n$ converges but the series ${\sum }_{n=1}^{\mathrm{\infty }}\left|a_n\right|$ diverges.

A permutation is simply a bijection from the set of positive integers to itself. This means that if $\sigma$ is a permutation, then for any positive integer $b,$ there exists exactly one positive integer $a$ such that $\sigma (a)=b.$ In particular, if $x\ne y$, then $\sigma (x)\ne \sigma (y)$.

Statement of the theorem

Suppose that $(a_1,a_2,a_3,\dots )$ is a sequence of real numbers, and that ${\sum }_{n=1}^{\mathrm{\infty }}{a}_n$ is conditionally convergent. Let $M$ be a real number. Then there exists a permutation $\sigma$ such that

$\sum _{n=1}^{\mathrm{\infty }}{a}_{\sigma (n)}=M.$

There also exists a permutation $\sigma$ such that

$\sum _{n=1}^{\mathrm{\infty }}{a}_{\sigma (n)}=\mathrm{\infty }.$

The sum can also be rearranged to diverge to $-\mathrm{\infty }$ or to fail to approach any limit, finite or infinite.

Alternating harmonic series

Changing the sum

The alternating harmonic series is a classic example of a conditionally convergent series:$$\sum _{n=1}^{\mathrm{\infty }}\frac{(-1{)}^{n+1}}{n}$$is convergent, whereas$$\sum _{n=1}^{\mathrm{\infty }}\left|\frac{(-1{)}^{n+1}}{n}\right|=\sum _{n=1}^{\mathrm{\infty }}\frac{1}{n}$$is the ordinary harmonic series, which diverges. Although in standard presentation the alternating harmonic series converges to Template:Math, its terms can be arranged to converge to any number, or even to diverge.

One instance of this is as follows. Begin with the series written in the usual order,

$\ln (2)=1-\frac{1}{2}+\frac{1}{3}-\frac{1}{4}+\frac{1}{5}-\frac{1}{6}+\frac{1}{7}-\frac{1}{8}+\frac{1}{9}\cdots$

and rearrange and regroup the terms as:

$\begin{array}{cc}& 1-\frac{1}{2}-\frac{1}{4}+\frac{1}{3}-\frac{1}{6}-\frac{1}{8}+\frac{1}{5}-\frac{1}{10}-\frac{1}{12}+\cdots \\ =& (1-\frac{1}{2})-\frac{1}{4}+(\frac{1}{3}-\frac{1}{6})-\frac{1}{8}+(\frac{1}{5}-\frac{1}{10})-\frac{1}{12}+\cdots \end{array}$

where the pattern is: the first two terms are 1 and −1/2, whose sum is 1/2. The next term is −1/4. The next two terms are 1/3 and −1/6, whose sum is 1/6. The next term is −1/8. The next two terms are 1/5 and −1/10, whose sum is 1/10. In general, since every odd integer occurs once positively and every even integers occur once negatively (half of them as multiples of 4, the other half as twice odd integers), the sum is composed of blocks of three which can be simplified as:

$(\frac{1}{2k-1}-\frac{1}{2(2k-1)})-\frac{1}{4k}=\left(\frac{1}{2(2k-1)}\right)-\frac{1}{4k},k=1,2,\dots .$

Hence, the above series can in fact be written as:

$\begin{array}{cc}& \frac{1}{2}-\frac{1}{4}+\frac{1}{6}-\frac{1}{8}+\frac{1}{10}+\cdots +\frac{1}{2(2k-1)}-\frac{1}{2(2k)}+\cdots \\ =& \frac{1}{2}(1-\frac{1}{2}+\frac{1}{3}-\cdots )=\frac{1}{2}\ln (2)\end{array}$

which is half the sum originally, and can only equate to the original sequence if the value were zero. This series can be demonstrated to be greater than zero by the proof of Leibniz's theorem using that the second partial sum is half. Alternatively, the value of $\ln (2)$ which it converges to, cannot be zero. Hence, the value of the sequence is shown to depend on the order in which series is computed.

It is true that the sequence:

$\{b_n\}=1,-\frac{1}{2},-\frac{1}{4},\frac{1}{3},-\frac{1}{6},-\frac{1}{8},\frac{1}{5},-\frac{1}{10},-\frac{1}{12},\frac{1}{7},-\frac{1}{14},-\frac{1}{16},\cdots$

contains all elements in the sequence:

$\{a_n\}=1,-\frac{1}{2},\frac{1}{3},-\frac{1}{4},\frac{1}{5},-\frac{1}{6},\frac{1}{7},-\frac{1}{8},\frac{1}{9},-\frac{1}{10},\frac{1}{11},-\frac{1}{12},\frac{1}{13},-\frac{1}{14},\frac{1}{15},\cdots$

However, since the summation is defined as $\sum _{n=1}^{\mathrm{\infty }}{a}_n:=\underset{n\to \mathrm{\infty }}{\lim }(a_1+a_2+\cdots +a_n)$ and $\sum _{n=1}^{\mathrm{\infty }}{b}_n:=\underset{n\to \mathrm{\infty }}{\lim }(b_1+b_2+\cdots +b_n)$, the order of the terms can influence the limit.

Getting an arbitrary sum

An efficient way to recover and generalize the result of the previous section is to use the fact that

$1+\frac{1}{2}+\frac{1}{3}+\cdots +\frac{1}{n}=\gamma +\ln n+o(1),$

where γ is the Euler–Mascheroni constant, and where the notation o(1) denotes a quantity that depends upon the current variable (here, the variable is n) in such a way that this quantity goes to 0 when the variable tends to infinity.

It follows that the sum of q even terms satisfies

$\frac{1}{2}+\frac{1}{4}+\frac{1}{6}+\cdots +\frac{1}{2q}=\frac{1}{2}\gamma +\frac{1}{2}\ln q+o(1),$

and by taking the difference, one sees that the sum of p odd terms satisfies

$1+\frac{1}{3}+\frac{1}{5}+\cdots +\frac{1}{2p-1}=\frac{1}{2}\gamma +\frac{1}{2}\ln p+\ln 2+o(1).$

Suppose that two positive integers a and b are given, and that a rearrangement of the alternating harmonic series is formed by taking, in order, a positive terms from the alternating harmonic series, followed by b negative terms, and repeating this pattern at infinity (the alternating series itself corresponds to Template:Nowrap, the example in the preceding section corresponds to a = 1, b = 2):

$1+\frac{1}{3}+\cdots +\frac{1}{2a-1}-\frac{1}{2}-\frac{1}{4}-\cdots -\frac{1}{2b}+\frac{1}{2a+1}+\cdots +\frac{1}{4a-1}-\frac{1}{2b+2}-\cdots$

Then the partial sum of order (a + b)n of this rearranged series contains Template:Nowrap positive odd terms and Template:Nowrap negative even terms, hence

$S_{(a+b)n}=\frac{1}{2}\ln p+\ln 2-\frac{1}{2}\ln q+o(1)=\frac{1}{2}\ln \left(\frac{a}{b}\right)+\ln 2+o(1).$

It follows that the sum of this rearranged series is

$\frac{1}{2}\ln \left(\frac{a}{b}\right)+\ln 2=\ln \left(2\sqrt{\frac{a}{b}}\right).$

Suppose now that, more generally, a rearranged series of the alternating harmonic series is organized in such a way that the ratio Template:Nowrap between the number of positive and negative terms in the partial sum of order n tends to a positive limit r. Then, the sum of such a rearrangement will be

$\ln \left(2\sqrt{r}\right),$

and this explains that any real number x can be obtained as sum of a rearranged series of the alternating harmonic series: it suffices to form a rearrangement for which the limit r is equal Template:Nowrap.

Proof

Existence of a rearrangement that sums to any positive real M

Riemann's description of the theorem and its proof reads in full:Template:Sfnm Template:Blockquote

This can be given more detail as follows.Template:Sfnm Recall that a conditionally convergent series of real terms has both infinitely many negative terms and infinitely many positive terms. First, define two quantities, $a_n^{+}$ and $a_n^{-}$ by:

$a_n^{+}=\{\begin{array}{cc}{a}_n& \text{if }{a}_n\ge 0\\ 0& \text{if }{a}_n<0,\end{array}{a}_n^{-}=\{\begin{array}{cc}0& \text{if }{a}_n\ge 0\\ a_n& \text{if }{a}_n<0.\end{array}$

That is, the series ${\sum }_{n=1}^{\mathrm{\infty }}{a}_n^{+}$ includes all a_n positive, with all negative terms replaced by zeroes, and the series ${\sum }_{n=1}^{\mathrm{\infty }}{a}_n^{-}$ includes all a_n negative, with all positive terms replaced by zeroes. Since ${\sum }_{n=1}^{\mathrm{\infty }}{a}_n$ is conditionally convergent, both the 'positive' and the 'negative' series diverge. Let Template:Mvar be any real number. Take just enough of the positive terms $a_n^{+}$ so that their sum exceeds Template:Mvar. That is, let Template:Math be the smallest positive integer such that

$M<\sum _{n=1}^{p_1}{a}_n^{+}.$

This is possible because the partial sums of the $a_n^{+}$ series tend to $+\mathrm{\infty }$. Now let Template:Math be the smallest positive integer such that

$M>\sum _{n=1}^{p_1}{a}_n^{+}+\sum _{n=1}^{q_1}{a}_n^{-}.$

This number exists because the partial sums of $a_n^{-}$ tend to $-\mathrm{\infty }$. Now continue inductively, defining Template:Math as the smallest integer larger than Template:Math such that

$M<\sum _{n=1}^{p_2}{a}_n^{+}+\sum _{n=1}^{q_1}{a}_n^{-},$

and so on. The result may be viewed as a new sequence

$a_1^{+},\dots ,a_{p_1}^{+},a_1^{-},\dots ,a_{q_1}^{-},a_{p_1+1}^{+},\dots ,a_{p_2}^{+},a_{q_1+1}^{-},\dots ,a_{q_2}^{-},a_{p_2+1}^{+},\dots .$

Furthermore the partial sums of this new sequence converge to Template:Mvar. This can be seen from the fact that for any Template:Mvar,

$\sum _{n=1}^{p_{i+1}-1}{a}_n^{+}+\sum _{n=1}^{q_i}{a}_n^{-}\le M<\sum _{n=1}^{p_{i+1}}{a}_n^{+}+\sum _{n=1}^{q_i}{a}_n^{-},$

with the first inequality holding due to the fact that Template:Math has been defined as the smallest number larger than Template:Math which makes the second inequality true; as a consequence, it holds that

$0<(\sum _{n=1}^{p_{i+1}}{a}_n^{+}+\sum _{n=1}^{q_i}{a}_n^{-})-M\le a_{p_{i+1}}^{+}.$

Since the right-hand side converges to zero due to the assumption of conditional convergence, this shows that the Template:Math'th partial sum of the new sequence converges to Template:Mvar as Template:Mvar increases. Similarly, the Template:Math'th partial sum also converges to Template:Mvar. Since the Template:Math'th, Template:Math'th, ... Template:Math'th partial sums are valued between the Template:Math'th and Template:Math'th partial sums, it follows that the whole sequence of partial sums converges to Template:Mvar.

Every entry in the original sequence Template:Math appears in this new sequence whose partial sums converge to Template:Mvar. Those entries of the original sequence which are zero will appear twice in the new sequence (once in the 'positive' sequence and once in the 'negative' sequence), and every second such appearance can be removed, which does not affect the summation in any way. The new sequence is thus a permutation of the original sequence.

Existence of a rearrangement that diverges to infinity

Let ${\sum }_{i=1}^{\mathrm{\infty }}{a}_i$ be a conditionally convergent series. The following is a proof that there exists a rearrangement of this series that tends to $\mathrm{\infty }$ (a similar argument can be used to show that $-\mathrm{\infty }$ can also be attained).

The above proof of Riemann's original formulation only needs to be modified so that Template:Math is selected as the smallest integer larger than Template:Math such that

$i+1<\sum _{n=1}^{p_{i+1}}{a}_n^{+}+\sum _{n=1}^{q_i}{a}_n^{-},$

and with Template:Math selected as the smallest integer larger than Template:Math such that

$i+1>\sum _{n=1}^{p_{i+1}}{a}_n^{+}+\sum _{n=1}^{q_{i+1}}{a}_n^{-}.$

The choice of Template:Math on the left-hand sides is immaterial, as it could be replaced by any sequence increasing to infinity. Since $a_n^{-}$ converges to zero as Template:Mvar increases, for sufficiently large Template:Mvar there is

$\sum _{n=1}^{p_{i+1}}{a}_n^{+}+\sum _{n=1}^{q_{i+1}}{a}_n^{-}>i,$

and this proves (just as with the analysis of convergence above) that the sequence of partial sums of the new sequence diverge to infinity.

Existence of a rearrangement that fails to approach any limit, finite or infinite

The above proof only needs to be modified so that Template:Math is selected as the smallest integer larger than Template:Math such that

$1<\sum _{n=1}^{p_{i+1}}{a}_n^{+}+\sum _{n=1}^{q_i}{a}_n^{-},$

and with Template:Math selected as the smallest integer larger than Template:Math such that

$-1>\sum _{n=1}^{p_{i+1}}{a}_n^{+}+\sum _{n=1}^{q_{i+1}}{a}_n^{-}.$

This directly shows that the sequence of partial sums contains infinitely many entries which are larger than 1, and also infinitely many entries which are less than Template:Math, so that the sequence of partial sums cannot converge.

Generalizations

Sierpiński theorem

Given an infinite series $a=(a_1,a_2,...)$, we may consider a set of "fixed points" $I\subset \mathbb{N}$, and study the real numbers that the series can sum to if we are only allowed to permute indices in $I$. That is, we let$$S(a,I)=\{\sum _{n\in \mathbb{N}}{a}_{\pi (n)}:\pi \text{ is a permutation on }\mathbb{N},\text{ such that }\mathrm{\forall }n\in ̸I,\pi (n)=n,\text{ and the summation converges.}\}$$With this notation, we have:

• If $I\mathrm{△}{I}^{\prime }$ is finite, then $S(a,I)=S(a,I^{\prime })$. Here $\mathrm{△}$ means symmetric difference.
• If $I\subset I^{\prime }$ then $S(a,I)\subset S(a,I^{\prime })$.
• If the series is an absolutely convergent sum, then $S(a,I)=\left\{\sum _{n\in \mathbb{N}}{a}_n\right\}$ for any $I$.
• If the series is a conditionally convergent sum, then by Riemann series theorem, $S(a,\mathbb{N})=[-\mathrm{\infty },+\mathrm{\infty }]$.

Sierpiński proved that rearranging only the positive terms one can obtain a series converging to any prescribed value less than or equal to the sum of the original series, but larger values in general can not be attained. That is, let $a$ be a conditionally convergent sum, then $S(a,\{n\in \mathbb{N}:a_n>0\})$ contains $[-\mathrm{\infty },\sum _{n\in \mathbb{N}}{a}_n]$, but there is no guarantee that it contains any other number.

More generally, let $J$ be an ideal of $\mathbb{N}$, then we can define $S(a,J)={\cup }_{I\in J}S(a,I)$.

Let $J_d$ be the set of all asymptotic density zero sets $I\subset \mathbb{N}$, that is, $\underset{n\to \mathrm{\infty }}{\lim }\frac{|[0,n]\cap I|}{n}=0$. It's clear that $J_d$ is an ideal of $\mathbb{N}$.

Template:Math theorem Proof sketch: Given $a$, a conditionally convergent sum, construct some $I\in J_d$ such that $\sum _{n\in I}{a}_n$ and $\sum _{n\in ̸I}{a}_n$ are both conditionally convergent. Then, rearranging $\sum _{n\in I}{a}_n$ suffices to converge to any number in $[-\mathrm{\infty },+\mathrm{\infty }]$.

Filipów and Szuca proved that other ideals also have this property.

Steinitz's theorem

Template:Main Given a converging series $\sum a_n$of complex numbers, several cases can occur when considering the set of possible sums for all series $\sum a_{\sigma (n)}$ obtained by rearranging (permuting) the terms of that series:

• the series $\sum a_n$ may converge unconditionally; then, all rearranged series converge, and have the same sum: the set of sums of the rearranged series reduces to one point;
• the series $\sum a_n$ may fail to converge unconditionally; if S denotes the set of sums of those rearranged series that converge, then, either the set S is a line L in the complex plane C, of the form $$L=\{a+tb:t\in ℝ\},a,b\in ℂ,b\ne 0,$$ or the set S is the whole complex plane C.

More generally, given a converging series of vectors in a finite-dimensional real vector space E, the set of sums of converging rearranged series is an affine subspace of E.

See also

• Template:Slink
• Agnew's theorem — describes all rearrangements that preserve convergence to the same sum for all convergent series

References

• Template:Cite book
• Template:Cite book
• Template:Cite book
• Template:Cite book
• Template:Cite journal
• Template:Cite book
• Template:Cite encyclopedia
• Template:Cite journal
• Template:Cite book
• Template:Cite book

External links

• Template:MathWorld