Proving the Minimum Radius of Convergence for a Sum of Taylor Series

Click For Summary

Homework Help Overview

The discussion revolves around proving the radius of convergence for the sum of two Taylor series, specifically that it is greater than or equal to the minimum of their individual radii of convergence. Participants are exploring the implications of this relationship and the definitions involved.

Discussion Character

  • Conceptual clarification, Assumption checking, Mathematical reasoning

Approaches and Questions Raised

  • Participants discuss defining sequences based on the Taylor series and their convergence properties. There is an exploration of whether the radius of convergence for the sum can be strictly greater than the minimum of the individual radii.

Discussion Status

Some participants have offered guidance on how to approach the proof, while others are questioning the assumptions made regarding the relationship between the radii. There is an ongoing exploration of examples and counterexamples to clarify the conditions under which the radius of convergence holds.

Contextual Notes

There are mentions of specific values and conditions, such as the relationship between R1 and R2, and the implications of convergence definitions. Participants are also considering the impact of specific functions on the radius of convergence.

jaykobe76
Messages
6
Reaction score
0

Homework Statement


how to prove that radius of convergence of a sum of two series is greater or equal to the minimum of their individual radii

i don't know how to begin, can someone give me some ideas?
 
Physics news on Phys.org
Hi Jay,

Welcome to the Forums!

I wouldn't try to do this by working with the coefficients of the series directly. Instead fix some x within the radius of convergence of both sequences. Define fn(x) to be the quantity that x gets mapped to by the first n terms of the first power series, and gn(x) the same thing except for the second series. What do you know about the sequences

f1(x), f2(x), f3(x), ... and
g1(x), g2(x), g3(x), ... ?

Using that what can you say about the sequence (g + f)n(x)?
 
kai_sikorski said:
Hi Jay,

Welcome to the Forums!

I wouldn't try to do this by working with the coefficients of the series directly. Instead fix some x within the radius of convergence of both sequences. Define fn(x) to be the quantity that x gets mapped to by the first n terms of the first power series, and gn(x) the same thing except for the second series. What do you know about the sequences

f1(x), f2(x), f3(x), ... and
g1(x), g2(x), g3(x), ... ?

Using that what can you say about the sequence (g + f)n(x)?

now , i got some ideas. can i say that cause fn(X) gn(x) are both converges to somthing ,assume T ,S .then by definition of convergent we have |fn(x)-T|<esillope/2 for |x|<R1,and |gn(x)-S|<esillope/2 for |x|<R2 (R1 R2 are the radius of f(X) and g(X)) then choose the min{R1,R2} then we can get |fn(X)+gn(x)-(T+S)|<esillope which is convergent for |x|<min{R1,R2},then the new radius K=min{R1,R2} but how to conclude that it is greater than min{R1,R2}??and is the proof above correct?
 
Above proof is correct.

I don't see how the statement that the radius of convergence of the sum is strictly greater than the min(R1,R2) is even true. I mean take the taylor series for g(x)=0 as one of the series. Clearly the radius of convergence of the sum must be exactly equal to the radius of convergence of the other series. So greater than or equal to is best you can hope for.
 
Oh if you're asking why it might be greater, then it's simple because your proof excluded the possibility that

R1 + 2 < min(R1, R2)

So it must be true that

R1 + 2 ≥ min(R1, R2)

That means that it might be greater maybe, or it might be equal. And in fact you could find examples for both.
 
kai_sikorski said:
Oh if you're asking why it might be greater, then it's simple because your proof excluded the possibility that

R1 + 2 < min(R1, R2)

So it must be true that

R1 + 2 ≥ min(R1, R2)

That means that it might be greater maybe, or it might be equal. And in fact you could find examples for both.

sorry, i still cannot understand. from my proof i concluded that |x|<min{R1,R2}then the new radius =min{R1,R2}=K. then the sum of series convergent.but if K can be greater than min{R1,R2}then |x|<min{R1,R2}=<K ,but how can i get this from the proof?
 
kai_sikorski said:
Oh if you're asking why it might be greater, then it's simple because your proof excluded the possibility that

R1 + 2 < min(R1, R2)

So it must be true that

R1 + 2 ≥ min(R1, R2)

That means that it might be greater maybe, or it might be equal. And in fact you could find examples for both.
sorry, i think i get it . because from my proof that |x|<min{R1,R2} then it means that the new radius K cannot smaller than {R1,R2}so K>=min{R1,R2} is this the idea?
 
jaykobe76 said:
sorry, i think i get it . because from my proof that |x|<min{R1,R2} then it means that the new radius K cannot smaller than {R1,R2}so K>=min{R1,R2} is this the idea?

Yes exactly.

:smile:
 
jaykobe76 said:
then by definition of convergent we have |fn(x)-T|<esillope/2 for |x|<R1

I guess here technically you should say that there exists an N, such that this is true for all fn(x) with n>N.
 
  • #10
kai_sikorski said:
I guess here technically you should say that there exists an N, such that this is true for all fn(x) with n>N.


ok thank you so much
 
  • #11
kai_sikorski said:
I guess here technically you should say that there exists an N, such that this is true for all fn(x) with n>N.


sorry, can use give me one example that the T>min{R1,R2}(inequality is strict) cause i cannot find one case that satisfies.
 
  • #12
just take a taylor series for some function f(x) that has finite radius of convergence. make g(x) the taylor series for -f(x).
 

Similar threads

  • · Replies 5 ·
Replies
5
Views
2K
Replies
7
Views
2K
  • · Replies 7 ·
Replies
7
Views
3K
  • · Replies 14 ·
Replies
14
Views
2K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 24 ·
Replies
24
Views
3K
  • · Replies 6 ·
Replies
6
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
Replies
6
Views
2K
  • · Replies 2 ·
Replies
2
Views
2K