The Unapologetic Mathematician

Mathematics for the interested outsider

Convergence of Complex Series

Today, I want to note that all of our work on convergence of infinite series carries over — with slight modifications — to complex numbers.

First we have to get down an explicit condition on convergence of complex sequences. In any metric space we can say that the sequence z_n converges to a limit z if for every \epsilon>0 there is some N so that d(z_n,z)<\epsilon for all n>N. Of course, here we’ll be using our complex distance function |z_n-z|=\sqrt{(z_n-z)\overline{(z_n-z)}}. Now we just have to replace any reference to real absolute values with complex absolute values and we should be good.

Cauchy’s condition comes in to say that the series \sum\limits_{k=0}^\infty a_k converges if and only for every \epsilon>0 there is an N so that for all n\geq m>N the sum \left|\sum\limits_{k=m}^na_k\right|<\epsilon.

Similarly, we say that the series \sum\limits_{k=0}^\infty a_k is absolutely convergent if the series \sum\limits_{k=0}^\infty|a_k| is convergent, and this implies that the original series converges.

Since the complex norm is multiplicative, everything for the geometric series goes through again: \sum\limits_{k=0}^\infty c_0r^k=\frac{c_0}{1-r} if |r|<1, and it diverges if |r|>1. The case where |r|=1 is more complicated, but it can be shown to diverge as well.

The ratio and root tests are basically proven by comparing series of norms with geometric series. Since once we take the norm we’re dealing with real numbers, and since the norm is multiplicative, we find that the proofs go through again.

August 28, 2008 Posted by | Analysis, Calculus, Power Series | 1 Comment

Evaluating Power Series

Now that we’ve got some topological fields to use as examples, let’s focus in on power series over \mathbb{R} or \mathbb{C}.

Remember that a power series is like an infinite polynomial. In fact, we introduced a topology so we could see in any power series a sequence of polynomials that converged to it. To be explicit, we write the series as a limit

\displaystyle S=\sum\limits_{k=0}^\infty c_kX^k=\lim\limits_{n\rightarrow\infty}\sum\limits_{k=0}^nc_kX^k

where the c_k are coefficients selected from our base field.

Now evaluation of power series is specified by two conditions: it should agree with evaluation of polynomials when we’ve got a power series that cuts off after a finite number of terms, and it should be continuous.

The first condition says that each of our approximating polynomials should evaluate just the same as it did before. That is, if we cut off after the degree-n term and evaluate at the point x in the base field, we should get \sum\limits_{k=0}^nc_kx^k.

The second condition says that evaluation should preserve limits. And we’ve got a sequence right here: the nth term is the evaluation of the nth approximating polynomial! So the power series should evaluate to the limit \lim\limits_{n\rightarrow\infty}\sum\limits_{k=0}^nc_kx^k. If this limit exists, that is. And that’s why we need a topological field to make sense of evaluations.

Now we’re back in the realm of infinite series, and taking the limit of a sequence of partial sums. The series in question has as its nth term the evaluated monomial c_nx^n. We can start using our old techniques to sum these series.

August 27, 2008 Posted by | Analysis, Calculus, Power Series | 4 Comments

Power Series

Prodded by some comments, I think I’ll go even further afield from linear algebra. It’s a slightly different order than I’d originally thought of, but it will lead to some more explicit examples when we’re back in the realm of linear algebra, so it’s got its own benefits.

I’ll note here in passing that mathematics actually doesn’t proceed in a straight line, despite the impression most people get. The lower-level classes are pretty standard, yes — natural-number arithmetic, fractions, algebra, geometry, calculus, and so on. But at about this point where most people peter out, the subject behaves more like an alluvial fan — many parallel rivulets carry off in different directions, but they’re all ultimately part of the same river. So in that metaphor, I’m pulling a bit of an avulsion.

Anyhow, power series are sort of like polynomials, except that the coefficients don’t have to die out at infinity. That is, when we consider the algebra of polynomials \mathbb{F}[X] as a vector space over \mathbb{F} it’s isomorphic to the infinite direct sum

\displaystyle\mathbb{F}[X]\cong\bigoplus\limits_{k=0}^\infty\mathbb{F}X^k

but the algebra of power series — written \mathbb{F}[[X]] — is isomorphic to the infinite direct product

\displaystyle\mathbb{F}[[X]]\cong\prod\limits_{k=0}^\infty\mathbb{F}X^k

It’s important to note here that the X^i do not form a basis here, since we can’t write an arbitrary power series as a finite linear combination of them. But really they should behave like a basis, because they capture the behavior of every power series. In particular, if we specify that \mu(X^m,X^n)=X^{m+n} then we have a well-defined multiplication extending that of power series.

I don’t want to do all the fine details right now, but I can at least sketch how this all works out, and how we can adjust our semantics to talk about power series as if the X^i were an honest basis. The core idea is that we’re going to introduce a topology on the space of polynomials.

So what polynomials should be considered “close” to each other? It turns out to make sense to consider those which agree in their lower-degree terms to be close. That is, we should have the space of tails

\displaystyle\bigoplus\limits_{k=n+1}^\infty\mathbb{F}X^k

as an open set. More concretely, for every polynomial p with degree n there is an open set U_p consisting of those polynomials q so that X^{n+1} divides the difference q-p.

Notice here that any power series defines, by cutting it off after successively higher degree terms, a descending sequence of these open sets. More to the point, it defines a sequence of polynomials. If the power series’ coefficients are zero after some point — if it’s a polynomial itself — then this sequence stops and stays at that polynomial. But if not it never quite settles down to any one point in the space. Doesn’t this look familiar?

Exactly. Earlier we had sequences of rational numbers which didn’t converge to a rational number. Then we completed the topology to give us the real numbers. Well here we’re just doing the same thing! It turns out that the topology above gives a uniform structure to the space of polynomials, and we can complete that uniform structure to give the vector space underlying the algebra of power series.

So here’s the punch line: once we do this, it becomes natural to consider not just linear maps, but continuous linear maps. Now the images of the X^k can’t be used to uniquely specify a linear map, but they will specify at most one value for a continuous linear map! That is, any power series comes with a sequence converging to it — its polynomial truncations — and if we know the values f(X^k) then we have uniquely defined images of each of these polynomial truncations since each one is a finite linear combination. Then continuity tells us that the image of the power series must be the limit of this sequence of images, if the limit exists.

August 18, 2008 Posted by | Algebra, Power Series, Ring theory | 9 Comments

Follow

Get every new post delivered to your Inbox.

Join 392 other followers