Serlo: EN: Rearrangement theorem for series

Aus testwiki
Version vom 3. Februar 2021, 08:26 Uhr von imported>LeRubikscube
(Unterschied) ← Nächstältere Version | Aktuelle Version (Unterschied) | Nächstjüngere Version → (Unterschied)
Zur Navigation springen Zur Suche springen

{{#invoke:Mathe für Nicht-Freaks/Seite|oben}}

In this article, we will investigate under which assumptions, we may re-arrange alaments within a series and under which circumstances, this is forbidden. Vorlage:Noprint We will follow a step-by-step approach starting from finite sums. As mentioned in the last article, absolute convergence will be crucial for re-arrangements of real-valued series.

Re-arrangement of finite sums

For finite sums, a re-arrangement is always allowed, since the summation is commutative and every re-arrangement can be written as a finite amount of commutations. As an example, consider the sum

Vorlage:Einrücken

If we re-arrange it such that there alternately aa positive and two negative elements, we get

Vorlage:Einrücken

Mathematically, every re-arrangement of this sum can be expressed by a bijection σ:{1,2,3,4,5,6,7,8}{1,2,3,4,5,6,7,8}. The bijection for the above re-arrangement is given by

Vorlage:Einrücken

therefore

Vorlage:Einrücken

So for any finite sum k=1nak with any n we can formulate a generalized commutative law:

Vorlage:Einrücken

Vorlage:Noprint

The problem with series

Series are sums of infinitely many elements, so there might be "infinitely many re-arrangement steps" necessary. And this may cause some trouble! At first, we need to precisely define what we mean by re-arranging those infinitely many elements:

Mathe für Nicht-Freaks: Vorlage:Definition

Sowe have a re-arrangement whenever elements of both series can be assigned one-to-one by a bijection (as it is also the case for finite sums).

Mathe für Nicht-Freaks: Vorlage:Beispiel

It would be nice to have a generalized commutative law also for series. However, re-arrangements might change the limit! Examples are not too easy to find. One of the easiest is the alternating harmonic series

Vorlage:Einrücken

This series converges, as shown in the article "Alternating series test" . Its limit is given by S=ln(2).

We use the re-arrangement:

Vorlage:Einrücken

Mathe für Nicht-Freaks: Vorlage:Frage

Within the article "Computation rules for series " it is shown taht the limit does not change if we set brackets. Hence, we can re-write the series as

Vorlage:Einrücken

we re-formulate a bit more in order to end up with another alternating harmonic series:

Vorlage:Einrücken

So under this re-arrangement, the limit of the series has halved from S to 12S.

Vorlage:Noprint

Mathe für Nicht-Freaks: Vorlage:Aufgabe

Mathe für Nicht-Freaks: Vorlage:Warnung

Re-arranged series might diverge

And it even gets worse: converging series can be made divergent by re-arrangement:

Vorlage:Noprint

So be careful:

Mathe für Nicht-Freaks: Vorlage:Warnung

Re-arrangement for non-negative series

The examples above treated alternating series, where one was able to "put together " in a way that any real number or even ± could be reached. We can circumvent this problem by only allowing positive series elements. But is just allowing positive elements sufficient to avoid any problems which may lead to different limits under re-arrangement? The answer is indeed: yes! We will formulate a theorem about this and prove it.

Vorlage:Noprint

Mathe für Nicht-Freaks: Vorlage:Satz

Mathe für Nicht-Freaks: Vorlage:Hinweis

Unconditional and conditional convergence

Based on its behaviour under re-arrangement, we define

Mathe für Nicht-Freaks: Vorlage:Definition

Mathe für Nicht-Freaks: Vorlage:Beispiel

So the re-arrangement theorem above can equivalently be formulated as follows:

Mathe für Nicht-Freaks: Vorlage:Satz

Re-arranging absolutely convergent series

What if there are positive and negative elements within a series? When can we be sure that any re-arrangement yields the same result? The answer is: if and only if it is absolutely convergent. An example is the series k=1(1)k+1k2. The corresponding series of absolute values is k=11k2 and converges. Since every absolutely convergent series converges, the series k=1(1)k+1k2 converges, as well.

Now, we are interested in proving that its limit is invariant under re-arrangement. In the article Absolute convergence of a series, we proved that a series k=1ak is absolutely convergent if and only if it can be split into converging series of non-negative elements k=1ak+and non-positive elements k=1ak . Now, k=1(1)σ(k+1)σ(k)2=k=1aσ(k) converges absolutely, so the series k=1aσ(k)+ and k=1aσ(k) converge, as well. As both are purely non-negative or non-positive, we can re-arrange them without changing the limit:

Vorlage:Einrücken

and

Vorlage:Einrücken

If we put both parts together, we obtain

Vorlage:Einrücken

So the entire series can also be re-arranged without changing the limit.

Mathe für Nicht-Freaks: Vorlage:Frage

Vorlage:Noprint

Re-arranging convergent, but not absolutely convergent series

So, if there is absolute convergence, then the limit of a series is invariant under re-arrangement. Can the limit also be invariant under re-arrangement if the series does not converge absolutely? The answer to this question is actually no! Absolute convergence is equivalent to the limit being invariant under re-arrangement. Even further:

Vorlage:-

Why does this hold? A series k=1ak being not absolutely convergent is equivalent to k=1ak+ or k=1ak from above being divergent, see the article Absolute convergence of a series. We even have:

Mathe für Nicht-Freaks: Vorlage:Satz

This theorem can be used to show that for any convergent, but non-divergent series, we can construct a diverging re-arrangement. The idea it to use the "infinite budgets" k=1ak+ and k=1ak and combine them in a way that one wins over the other. For instance, consider our "favourite example": the alternating harmonic series k=1(1)k+1k . We construct a re-arrangement k=1aσ(k), which diverges to the following way: We sum up a lot of positive terms, until we surpass n=1 . Then a negative term follows. Then, we sum up sufficiently many terms to get above n=2 . A negative summand follows and then again enough summands to surpass n=3 and so on...

The result will diverge to  : after n has been passed, we can get at most down by 1 again and always stay above n1. This argument holds for arbitrarily large n1 and hence yields divergence. For the alternating harmonic series, the re-arrangement looks as follows:

Vorlage:Einrücken

So for any (n1) there is an M with k=1maσ(k)n for all m>M and we get divergence.

This argument holds for any conditionally convergent series:

Mathe für Nicht-Freaks: Vorlage:Satz

Mathe für Nicht-Freaks: Vorlage:Hinweis


{{#invoke:Mathe für Nicht-Freaks/Seite|unten}}