Math for Non-Geeks/Computation rules for series

From testwiki
Jump to navigation Jump to search

{{#invoke:Math for Non-Geeks/Seite|oben}}

We learned that series are in some sense "infinite sums". Do the same rules as for finite sums also apply to infinite sums? Like removing braces (associative law) and re-arranging terms (commutative law)? The answer is: Generally no. But in certain cases yes! The upcoming articles will tell you when the answer is yes and when it is no. A small spoiler ahead: adding series and multiplying them by a constant is always allowed - provided that the series converges.

Overview

Computation rules

In the article "Limit theorems" we proved the sum rule for sequences limn(an+bn)=limnan+limnbn , which holds if (an)n and (bn)n converge. These also hold for convergent series, since a series is just a sequence of partial sums. More precisely, ifk=1ak and k=1bk converge and λ, then:

Template:Math

In addition, a series k=1ak converges, whenever the even and odd subsequence k=1a2k and k=1a2k1 converge. And there is

Template:Math

More generally, within a convergent series k=1ak, we can set brackets and split

Template:Math

Here, (jl)l is the strictly monotonically increasing sequence of natural numbers with j1=1 where jl indexes the first summand within a bracket-sum. Conversely, for a divergent series l=1(k=jljl+11ak), we also have divergence of k=1ak.

What goes wrong with series

For partial sums we have (k=1nak)(k=1nbk)k=1nakbk. Multiplying two series is way harder: sometimes it works and sometimes not. We will cover the details later.

Math for Non-Geeks: Template:Frage

There is no general associative or commutative law for series: For finite sums, one may re-arrange terms and set brackets arbitrarily and still get the same result. For infinite sums (series), this does not work in general. However, there are indicators that tell us when it works and when not.

The sum rule

Proof of the sum rule

Math for Non-Geeks: Template:Satz

Example problems: sum rule for series

Math for Non-Geeks: Template:Aufgabe

The factor rule

Proof of the factor rule

Math for Non-Geeks: Template:Satz

Example problems: factor rule for series

Math for Non-Geeks: Template:Aufgabe

The splitting rule

Proof of the splitting rule

Math for Non-Geeks: Template:Satz

Math for Non-Geeks: Template:Frage

Example problems splitting rule

Math for Non-Geeks: Template:Aufgabe

The associative law

Why there is no associative law

For finite sums, the "Assoziativgesetzes der Addition" (German) allows to set brackets arbitrarily. For instance

Template:Math

Analogously

Template:Math

For "infinite sums", we need to pay attention: consider

Template:Math

The sequence of partial sums for this series is:

Template:Math

Which means, the partial sums "jump" between 0 and 1 , so the series diverges (0 and 1 are accumulation points). Setting brackets can, however, lead to a series converging to 0:

Template:Math

So if a series diverges, we cannot simply set brackets as we wish! For convergent series, the same holds true, since we can turn the series converging to 0 above into a divergent series by removing brackets: for k=1((1)2k+(1)2k+1) (which converges to 0), removing brackets yields k=1(1)k+1 (which diverges).

Math for Non-Geeks: Template:Frage

Example: where we can set brackets

Consider the converging series k=02k, which is an infinite sum 1+12+14+18+ . The corresponding sequence of partial sums is

Template:Math

What happens if we set brackets? We could, for instance, conclude every two neighbouring elements: (1+12)+(14+18)+. This leads to the series k=0(22k+2(2k+1)). The corresponding sequence of partial sums is

Template:Math

This is a subsequence of the original sequence of partial sums. Now, since the series k=02k converges, the sequence of its partial sums converges and hence every subsequence converges as well (and to the same limit. So k=0(22k+2(2k+1)) has the same limit as the original series. In this case, we case set brackets as we wish!

When can brackets be set and when not?

If we set brackets within a series and then consider the "bracketed series", then the partial sum sequence of the "bracketed series" is a subsequence of the original sequence of partial sums. Now

  • If a sequence converges, every subsequence converges.
  • If a subsequence diverges, the original sequence also diverges.

Since setting brackets leads to a subsequence of partial sums, we have that:

  • Within converging series, brackets can be set arbitrarily.
  • Within diverging series, brackets can be removed arbitrarily.

Or, concluded in a theorem:

Math for Non-Geeks: Template:Satz

What?! The sum of all natural numbers is equal to -1/12?

There are several Youtube videos and also some articles (here is a German one [1]) where people claim to have proven that the sum of all natural numbers equals 112:

Template:Math

This is obviously wrong! For the series above, the sequence of partial sums diverges quadratically to . It does not even attain any negative value. How do people then come up with the 112, then? The answer is: "by violating the associative law". All we have to do is to set brackets in divergent series (which is not allowed). Recall the sum formula for the geometric series:

Template:Math

Math for Non-Geeks: Template:Frage

In addition, for the series k=1(1)k1k we have the identity

Template:Math

Math for Non-Geeks: Template:Frage

If we divide this equation by 2, we get k=1(1)k1k=14. Subtracting it from the original series k=1k yields

Template:Math

Math for Non-Geeks: Template:Frage

After all those illegal steps, we get

Template:Math

q.e.d. (or rather w.t.f.)

Outlook: Series and vector spaces

For series k=1ak and k=1bk as well as λ we have the following computational rules:

Template:Math

In linear algebra, the notion of a vector space is introduced, which is roughly speaking "a set of elements, where we are allowed to add any two elements or multiply an element by a constant λ". The set of all real valued sequence V={(an)nV:an} is such a set, where we can add elements or multiply by a constant. So it is a vector space. The subset U={(an)n:k=1ak converges} which includes all sequences (an)n, for which the series k=1ak converges is a subset of V , which is a vector space again (we do not leave it by adding elements or multiplying by a constant). Such a subset is also called a subspace. The map f:U:(an)nk=1ak assigning each (an)n the limit of the series k=1ak preserves addition and scalar multiplication: Adding two series leads to addition of the limits. Scaling the series by a constant leads to a scaling of the limit by the same constant. maps which preserve addition and scaling are also called linear maps, so yf is a linear map.

{{#invoke:Math for Non-Geeks/Seite|unten}}

Template:BookCat