Proof of Taylor's Theorem for e^x Convergence

  • Thread starter Thread starter danago
  • Start date Start date
  • Tags Tags
    Theorem
Click For Summary

Homework Help Overview

The discussion revolves around proving the convergence of the Taylor series for the function f(x) = e^x about x = 0 for all real values of x. Participants are exploring Taylor's theorem and the behavior of the error term in the context of this series.

Discussion Character

  • Exploratory, Assumption checking, Mathematical reasoning

Approaches and Questions Raised

  • Participants discuss the requirement to show that the error term approaches zero as n increases. There are mentions of the growth rates of factorials compared to exponentials and inquiries about the implications of the inequality involving the error term.

Discussion Status

Some participants have provided insights into the relationship between the growth of the numerator and denominator in the error term. There is ongoing exploration of the assumptions regarding the variable b and the factors involved in the expressions, indicating a productive dialogue without a clear consensus yet.

Contextual Notes

There are questions regarding the positivity of b and the specific forms of the terms in the inequality, which may influence the discussion. Participants express uncertainty about how to utilize the information discussed to arrive at a conclusion.

danago
Gold Member
Messages
1,118
Reaction score
4
Show that the taylor series generated by [tex]f(x)=e^{x}[/tex] about x=0 converges to f(x) for ever real value of x.

Taylors theorem states that:

[tex] f(b) = P_{n} + \frac{e^c}{(n+1)!} b^{n+1}[/tex]

where P_n is the taylor polynomial of order 'n' and the following term is the error term and c is some value between 0 and b. If the error term approaches 0 as n approaches infinity, then the series converges to f(x).

Does this mean that to answer the question all i need to do is show that the error term approaches zero as n gets large? If so, how would i do so?

Thanks in advance for the help,
Dan.
 
Physics news on Phys.org
Well a non-rigorous approach would be to state that a factorial will grow faster than an exponential, especially since b is constant. The denominator of the error term will therefore outgrow the numerator and thereby kill of the whole term.
 
Yes, all you need to do is show that the error term approaches 0 as n gets large.

Since ex is an increasing function and c< b, ec< eb so
[tex]\frac{e^nb^{n+1}}{(n+1)!}< e^b\frac{b^{n+1}}{(n+1)!}[/tex].

Now, to expand on exk's comment, How many factors are there in bn+1? How many factors are there in (n+1)!? What happens as soon as n> b?
 
HallsofIvy said:
Yes, all you need to do is show that the error term approaches 0 as n gets large.

Since ex is an increasing function and c< b, ec< eb so
[tex]\frac{e^nb^{n+1}}{(n+1)!}< e^b\frac{b^{n+1}}{(n+1)!}[/tex].

Now, to expand on exk's comment, How many factors are there in bn+1? How many factors are there in (n+1)!? What happens as soon as n> b?

That inequality you posted...is that assuming that b is positive? And is the e^n in the left hand side supposed to be an e^c?

As for your second question, the bn+1 has n+2 factors? And the (n+1)! has 2n factors?

Im still a little stuck for as how id use this information to answer the question.

Thanks for the replies :smile:
 

Similar threads

  • · Replies 6 ·
Replies
6
Views
2K
  • · Replies 10 ·
Replies
10
Views
2K
Replies
2
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 5 ·
Replies
5
Views
2K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 7 ·
Replies
7
Views
2K
Replies
26
Views
3K
  • · Replies 1 ·
Replies
1
Views
2K
Replies
6
Views
3K