Fourier series and convergence

Niles
Messages
1,834
Reaction score
0

Homework Statement


Hi all.

There is an example in my book, where we have the following Fourier series, and the author writes it as:

<br /> f(x) = \sum\limits_{n = 1}^\infty {\left( {\frac{{( - 1)^n }}{{n^2 }}\cos \left( {\frac{{n\pi x}}{p}} \right) + \frac{1}{n}\sin \left( {\frac{{n\pi x}}{p}} \right)} \right)} = \sum\limits_{n = 1}^\infty {\frac{{( - 1)^n }}{{n^2 }}\cos \left( {\frac{{n\pi x}}{p}} \right)} + \sum\limits_{n = 1}^\infty {\frac{1}{n}\sin \left( {\frac{{n\pi x}}{p}} \right)} <br />

First of all, we are only allowed to split the sum up if, and only if each part in the summation converges, but the author does not check if they do or don't. Is he making a mistake or am I missing something?
 
Physics news on Phys.org
These expressions are identically equal because addition is associative. That is, it doesn't matter what in what order you add numbers.
 
Hmm, according to my analysis-book, both series have to converge in order for us to divide the sum up.
 
You are write - if the two series converge absolutely then the original sum equals the sum of the two terms as shown. But I have a question.

You've given this:

The following code was used to generate this LaTeX image:


<br /> <br /> f(x) = \sum\limits_{n = 1}^\infty {\left( {\frac{{( - 1)^n }}{{n^2 }}\cos \left( {\frac{{n\pi x}}{p}} \right) + \frac{1}{n}\sin \left( {\frac{{n\pi x}}{p}} \right)} \right)} = \sum\limits_{n = 1}^\infty {\frac{{( - 1)^n }}{{n^2 }}\cos \left( {\frac{{n\pi x}}{p}} \right)} + \sum\limits_{n = 1}^\infty {\frac{1}{n}\sin \left( {\frac{{n\pi x}}{p}} \right)} <br />

If this is written as a way of saying "the function f can be formally represented by this series, then convergence isn't an issue (although usually the notation f(x) \sim is used rather than equality)

If the statement is that the first series actually converges to f, then there may be a theorem that says "given these conditions on a function, the Fourier series actually converges and ...", and the work is justified by that. A final possibility is that the reader is supposed to supply the details about why this is valid.

(There is always the possibility of a typographical error in the text, but one of this magnitude would be, I think, rare)
 
The first sum is convergent, but the second requires thought. Break the second sum into a sum over odd integers plus a sum over even integers. The sum over odds describes a square wave of period 2p, so it is convergent. Every term in the even sum is smaller than the corresponding term in the odd sum, so it is convergent also by comparison.
 
There are two things I don't understand about this problem. First, when finding the nth root of a number, there should in theory be n solutions. However, the formula produces n+1 roots. Here is how. The first root is simply ##\left(r\right)^{\left(\frac{1}{n}\right)}##. Then you multiply this first root by n additional expressions given by the formula, as you go through k=0,1,...n-1. So you end up with n+1 roots, which cannot be correct. Let me illustrate what I mean. For this...
Back
Top