evan's notes
cal 3discreteodeenv systems

On this page

  • Walkthrough
  • The core idea: matching a curve locally
  • Why factorials appear in the formula
  • Taylor polynomials and the Taylor series
  • Controlling the error: Taylor's inequality
  • Recovering coefficients from derivatives
  • Example: reading derivatives from a power series
  • Taylor and Maclaurin series
  • Three standard Maclaurin series
  • The Taylor remainder and approximation error
  • Taylor's inequality
  • Example: approximating exe^xex on (−1,1)(-1,1)(−1,1)
  • Convergence of the standard series everywhere
  • Small-angle approximations and error bounds
  • Building a logarithm series from the geometric series
  • The generalized binomial series
  • Evaluating limits with series
  • Integrating a function without an elementary antiderivative
  • Turning a Taylor error bound into an integral error bound
  • When can the bound be strict?
  • Smooth does not always mean analytic
  • Differentiating a known power series

Intermediate Calculus

§3 Taylor Series

Evan Luo · Sep 11, 2026

Intermediate Calculus

§3 Taylor Series

Evan LuoSep 11, 2026

18 min read

Walkthrough

The core idea: matching a curve locally

Suppose you have a complicated function f(x)f(x)f(x), but you only know what is happening at a single center point x=ax = ax=a. You know its value f(a)f(a)f(a), its slope f′(a)f'(a)f′(a), its concavity f′′(a)f''(a)f′′(a), and perhaps higher derivatives.

Can we build a simple polynomial that matches the behavior of f(x)f(x)f(x) near aaa?

A tangent line matches the value and the first derivative at aaa. If we add a quadratic term, we can match the second derivative as well. By adding terms of higher degree, we can match as many derivatives at aaa as we like. The resulting polynomial bends and curves to mimic f(x)f(x)f(x) around the center.

Why factorials appear in the formula

To see how derivatives determine the coefficients, suppose first that fff has a power-series representation near aaa:

f(x)=c0+c1(x−a)+c2(x−a)2+c3(x−a)3+⋯f(x) = c_0 + c_1(x-a) + c_2(x-a)^2 + c_3(x-a)^3 + \cdotsf(x)=c0​+c1​(x−a)+c2​(x−a)2+c3​(x−a)3+⋯

This is a temporary assumption for deriving the coefficients. A smooth function need not equal its Taylor series; we will return to the remainder condition below.

If we plug in x=ax = ax=a, every term with (x−a)(x-a)(x−a) vanishes, leaving just:

c0=f(a)c_0 = f(a)c0​=f(a)

Now differentiate the series term by term:

f′(x)=c1+2c2(x−a)+3c3(x−a)2+⋯f'(x) = c_1 + 2c_2(x-a) + 3c_3(x-a)^2 + \cdotsf′(x)=c1​+2c2​(x−a)+3c3​(x−a)2+⋯

Evaluating at x=ax = ax=a isolates the next coefficient: c1=f′(a)c_1 = f'(a)c1​=f′(a).

Differentiate a second time:

f′′(x)=2⋅1⋅c2+3⋅2⋅c3(x−a)+⋯f''(x) = 2 \cdot 1 \cdot c_2 + 3 \cdot 2 \cdot c_3(x-a) + \cdotsf′′(x)=2⋅1⋅c2​+3⋅2⋅c3​(x−a)+⋯

Plugging in x=ax = ax=a gives f′′(a)=2!c2f''(a) = 2! c_2f′′(a)=2!c2​, so c2=f′′(a)2!c_2 = \frac{f''(a)}{2!}c2​=2!f′′(a)​.

Every time you take another derivative, the power rule brings down the next integer exponent. By the nnnth derivative, that power has contributed a factor of n!n!n!:

f(n)(a)=n!cn  ⟹  cn=f(n)(a)n!f^{(n)}(a) = n! c_n \implies c_n = \frac{f^{(n)}(a)}{n!}f(n)(a)=n!cn​⟹cn​=n!f(n)(a)​

This formula means every coefficient is locked in place by a derivative of fff evaluated at the single point aaa.

Taylor polynomials and the Taylor series

Using these coefficients, the Taylor series associated with fff and centered at aaa is:

∑n=0∞f(n)(a)n!(x−a)n\sum_{n=0}^{\infty} \frac{f^{(n)}(a)}{n!}(x-a)^n∑n=0∞​n!f(n)(a)​(x−a)n

This series is built from the derivatives of fff at one point, but it equals f(x)f(x)f(x) only where its remainder approaches zero. When the center is set to a=0a = 0a=0, it is called a Maclaurin series. For example, because every derivative of exe^xex is exe^xex and e0=1e^0 = 1e0=1, its Maclaurin series is:

ex=∑n=0∞xnn!=1+x+x22!+x33!+⋯e^x = \sum_{n=0}^{\infty} \frac{x^n}{n!} = 1 + x + \frac{x^2}{2!} + \frac{x^3}{3!} + \cdotsex=∑n=0∞​n!xn​=1+x+2!x2​+3!x3​+⋯

In practical calculations, we cannot sum infinitely many terms. Instead, we stop at a finite degree kkk to form the degree-kkk Taylor polynomial:

Tk(x)=∑n=0kf(n)(a)n!(x−a)nT_k(x) = \sum_{n=0}^{k} \frac{f^{(n)}(a)}{n!}(x-a)^nTk​(x)=∑n=0k​n!f(n)(a)​(x−a)n

Tk(x)T_k(x)Tk​(x) is a standard polynomial that serves as a practical, computable approximation of f(x)f(x)f(x) close to aaa.

Controlling the error: Taylor's inequality

An approximation is only useful if we know how accurate it is. We define the discrepancy between the true function and the degree-kkk polynomial as the remainder:

Rk(x)=f(x)−Tk(x)R_k(x) = f(x) - T_k(x)Rk​(x)=f(x)−Tk​(x)

The Taylor series converges to f(x)f(x)f(x) if and only if this remainder approaches zero as the degree kkk grows.

To determine how large this error can be, Taylor's inequality looks at the very next derivative, f(k+1)f^{(k+1)}f(k+1). If we can find an upper bound MMM such that ∣f(k+1)(u)∣≤M|f^{(k+1)}(u)| \le M∣f(k+1)(u)∣≤M for all points uuu between aaa and xxx, then:

∣Rk(x)∣≤M(k+1)!∣x−a∣k+1|R_k(x)| \le \frac{M}{(k+1)!}|x-a|^{k+1}∣Rk​(x)∣≤(k+1)!M​∣x−a∣k+1

For a fixed degree kkk, this bound shows why Taylor approximation is local: the factor ∣x−a∣k+1|x-a|^{k+1}∣x−a∣k+1 grows as xxx moves away from the center. Increasing kkk can improve the estimate only when the corresponding derivative bounds MkM_kMk​ remain controlled well enough for

Mk(k+1)!∣x−a∣k+1\frac{M_k}{(k+1)!}|x-a|^{k+1}(k+1)!Mk​​∣x−a∣k+1

to approach 000. Smoothness alone does not guarantee that this happens.

Recovering coefficients from derivatives

A Taylor series uses the derivatives of a function at a single point to construct a power series. Truncating this series to a finite degree yields a Taylor polynomial, which provides a practical polynomial approximation of the function near that center point.

To see how derivatives determine the terms of a power series, suppose a function fff is represented by a power series centered at aaa:

f(x)=∑n=0∞cn(x−a)n=c0+c1(x−a)+c2(x−a)2+⋯ .f(x)=\sum_{n=0}^{\infty}c_n(x-a)^n =c_0+c_1(x-a)+c_2(x-a)^2+\cdots. f(x)=n=0∑∞​cn​(x−a)n=c0​+c1​(x−a)+c2​(x−a)2+⋯.

Evaluating both sides at x=ax=ax=a eliminates every term containing a positive power of (x−a)(x-a)(x−a), isolating the constant term:

c0=f(a).c_0=f(a). c0​=f(a).

Differentiating term by term gives

f′(x)=c1+2c2(x−a)+3c3(x−a)2+⋯ .f'(x)=c_1+2c_2(x-a)+3c_3(x-a)^2+\cdots. f′(x)=c1​+2c2​(x−a)+3c3​(x−a)2+⋯.

Evaluating at x=ax=ax=a leaves only c1=f′(a)c_1=f'(a)c1​=f′(a). Differentiating a second time and evaluating at x=ax=ax=a gives

f′′(a)=2!c2,f''(a)=2!c_2, f′′(a)=2!c2​,

which implies c2=f′′(a)/2!c_2=f''(a)/2!c2​=f′′(a)/2!. Repeating this differentiation step nnn times yields

f(n)(a)=n!cn.f^{(n)}(a)=n!c_n. f(n)(a)=n!cn​.

Solving for cnc_ncn​ shows that each coefficient is uniquely determined by the nnnth derivative of fff at the center:

cn=f(n)(a)n!.\boxed{c_n=\frac{f^{(n)}(a)}{n!}}. cn​=n!f(n)(a)​​.

This relationship also provides a direct way to read derivatives from an already known power series: the coefficient of (x−a)n(x-a)^n(x−a)n is always f(n)(a)/n!f^{(n)}(a)/n!f(n)(a)/n!.

Example: reading derivatives from a power series

From the geometric-series calculation in the previous section,

32+x2=∑n=0∞3(−1)n2n+1x2n,∣x∣<2.\frac{3}{2+x^2} =\sum_{n=0}^{\infty}\frac{3(-1)^n}{2^{n+1}}x^{2n}, \qquad |x|<\sqrt2. 2+x23​=n=0∑∞​2n+13(−1)n​x2n,∣x∣<2​.

To find f(10)(0)f^{(10)}(0)f(10)(0), locate the coefficient of the x10x^{10}x10 term. Setting the exponent 2n=102n=102n=10 requires n=5n=5n=5, which gives the coefficient

3(−1)526=−364.\frac{3(-1)^5}{2^6}=-\frac{3}{64}. 263(−1)5​=−643​.

Because this coefficient must equal f(10)(0)/10!f^{(10)}(0)/10!f(10)(0)/10!, equating the two gives

f(10)(0)=10!(−364).\boxed{f^{(10)}(0)=10!\left(-\frac{3}{64}\right)}. f(10)(0)=10!(−643​)​.

Since only even powers appear in this series, the coefficient of x9x^9x9 is 000, which immediately implies

f(9)(0)=0.\boxed{f^{(9)}(0)=0}. f(9)(0)=0​.

Taylor and Maclaurin series

Substituting the formula for cnc_ncn​ into the general power series gives the Taylor series of fff centered at aaa:

f(x)=∑n=0∞f(n)(a)n!(x−a)n\boxed{ f(x)=\sum_{n=0}^{\infty} \frac{f^{(n)}(a)}{n!}(x-a)^n } f(x)=n=0∑∞​n!f(n)(a)​(x−a)n​

This equality is valid for all values of xxx where the series converges to f(x)f(x)f(x). The definition relies on the standard conventions

f(0)(a)=f(a),0!=1,(x−a)0=1.f^{(0)}(a)=f(a), \qquad 0!=1, \qquad (x-a)^0=1. f(0)(a)=f(a),0!=1,(x−a)0=1.

When the center is chosen as a=0a=0a=0, the series is called a Maclaurin series:

f(x)=∑n=0∞f(n)(0)n!xn.f(x)=\sum_{n=0}^{\infty}\frac{f^{(n)}(0)}{n!}x^n. f(x)=n=0∑∞​n!f(n)(0)​xn.

Keeping only the terms through degree kkk yields the degree-kkk Taylor polynomial:

Tk(x)=∑n=0kf(n)(a)n!(x−a)n.\boxed{ T_k(x)=\sum_{n=0}^{k} \frac{f^{(n)}(a)}{n!}(x-a)^n }. Tk​(x)=n=0∑k​n!f(n)(a)​(x−a)n​.

Because Tk(x)T_k(x)Tk​(x) is a finite polynomial rather than an infinite sum, it serves as a computable approximation of f(x)f(x)f(x) near aaa.

Three standard Maclaurin series

Every derivative of exe^xex is exe^xex, and evaluating each derivative at 000 gives 111. Consequently,

ex=∑n=0∞xnn!=1+x+x22!+x33!+⋯ .\boxed{e^x=\sum_{n=0}^{\infty}\frac{x^n}{n!}} =1+x+\frac{x^2}{2!}+\frac{x^3}{3!}+\cdots. ex=n=0∑∞​n!xn​​=1+x+2!x2​+3!x3​+⋯.

The derivatives of sin⁡x\sin xsinx cycle in a repeating pattern:

sin⁡x,cos⁡x,−sin⁡x,−cos⁡x.\sin x,\quad \cos x,\quad-\sin x,\quad-\cos x. sinx,cosx,−sinx,−cosx.

At x=0x=0x=0, these derivative values cycle through 0,1,0,−10,1,0,-10,1,0,−1. The even powers drop out because their coefficients are zero, leaving only odd powers with alternating signs:

sin⁡x=∑n=0∞(−1)n(2n+1)!x2n+1=x−x33!+x55!−⋯ .\boxed{ \sin x=\sum_{n=0}^{\infty} \frac{(-1)^n}{(2n+1)!}x^{2n+1} } =x-\frac{x^3}{3!}+\frac{x^5}{5!}-\cdots. sinx=n=0∑∞​(2n+1)!(−1)n​x2n+1​=x−3!x3​+5!x5​−⋯.

Because the fourth-degree coefficient is 000, the degree-444 Maclaurin polynomial contains no fourth-degree term and matches the degree-333 polynomial:

T4(x)=x−x33!.T_4(x)=x-\frac{x^3}{3!}. T4​(x)=x−3!x3​.

Applying the same process to cos⁡x\cos xcosx produces the alternating pattern on even powers:

cos⁡x=∑n=0∞(−1)n(2n)!x2n=1−x22!+x44!−⋯ .\boxed{ \cos x=\sum_{n=0}^{\infty} \frac{(-1)^n}{(2n)!}x^{2n} } =1-\frac{x^2}{2!}+\frac{x^4}{4!}-\cdots. cosx=n=0∑∞​(2n)!(−1)n​x2n​=1−2!x2​+4!x4​−⋯.

Each of these three series converges to its corresponding function for every real xxx.

The Taylor remainder and approximation error

Because a Taylor polynomial Tk(x)T_k(x)Tk​(x) is an approximation, the difference between the true function value and the polynomial is quantified by the kkkth Taylor remainder:

Rk(x)=f(x)−Tk(x)\boxed{R_k(x)=f(x)-T_k(x)} Rk​(x)=f(x)−Tk​(x)​

Rearranging shows how the function splits into the polynomial approximation and its error term:

f(x)=Tk(x)+Rk(x).f(x)=T_k(x)+R_k(x). f(x)=Tk​(x)+Rk​(x).

For a given xxx, the Taylor series converges to f(x)f(x)f(x) precisely when the remainder vanishes as the degree increases:

lim⁡k→∞Rk(x)=0.\lim_{k\to\infty}R_k(x)=0. k→∞lim​Rk​(x)=0.

Thus, confirming that a Taylor series represents f(x)f(x)f(x) requires verifying that this error term tends to zero.

Taylor's inequality

Taylor's inequality provides an explicit upper bound on the size of the remainder. Suppose that the (k+1)(k+1)(k+1)th derivative is bounded by a constant MMM such that

∣f(k+1)(u)∣≤M|f^{(k+1)}(u)|\le M ∣f(k+1)(u)∣≤M

for every uuu between the center aaa and the evaluation point xxx. Then

∣Rk(x)∣≤M(k+1)!∣x−a∣k+1.\boxed{ |R_k(x)| \le \frac{M}{(k+1)!}|x-a|^{k+1} }. ∣Rk​(x)∣≤(k+1)!M​∣x−a∣k+1​.

This upper bound decreases as xxx moves closer to aaa, or as the factorial (k+1)!(k+1)!(k+1)! in the denominator outgrows the derivative bound MMM.

Example: approximating exe^xex on (−1,1)(-1,1)(−1,1)

Consider approximating exe^xex on (−1,1)(-1,1)(−1,1) using its degree-444 Maclaurin polynomial:

T4(x)=1+x+x22!+x33!+x44!.T_4(x)=1+x+\frac{x^2}{2!}+\frac{x^3}{3!}+\frac{x^4}{4!}. T4​(x)=1+x+2!x2​+3!x3​+4!x4​.

The error depends on the next derivative, f(5)(x)f^{(5)}(x)f(5)(x). Because every derivative of exe^xex is exe^xex, and exe^xex increases across (−1,1)(-1,1)(−1,1),

∣f(5)(x)∣=ex≤e,|f^{(5)}(x)|=e^x\le e, ∣f(5)(x)∣=ex≤e,

allowing us to choose M=eM=eM=e. Applying Taylor's inequality with k=4k=4k=4, center a=0a=0a=0, and ∣x∣<1|x|<1∣x∣<1 yields

∣R4(x)∣≤e5!∣x∣5<e120≈0.023.\begin{aligned} |R_4(x)| &\le \frac{e}{5!}|x|^5\\ &<\frac{e}{120}\\ &\approx0.023. \end{aligned} ∣R4​(x)∣​≤5!e​∣x∣5<120e​≈0.023.​

Therefore, for all xxx in (−1,1)(-1,1)(−1,1),

∣ex−T4(x)∣<0.023.\boxed{|e^x-T_4(x)|<0.023}. ∣ex−T4​(x)∣<0.023​.

The value 0.0230.0230.023 is a guaranteed upper bound on the approximation error across the interval; the true discrepancy at any specific point may be smaller.

Convergence of the standard series everywhere

Writing down Taylor coefficients does not automatically prove that the resulting series equals the original function. The missing step is to show that the remainder tends to zero.

For f(x)=sin⁡xf(x)=\sin xf(x)=sinx, every derivative is one of ±sin⁡x\pm\sin x±sinx or ±cos⁡x\pm\cos x±cosx. Therefore,

∣f(k+1)(u)∣≤1|f^{(k+1)}(u)|\le1 ∣f(k+1)(u)∣≤1

for every real uuu. Taylor's inequality then gives

∣Rk(x)∣≤∣x∣k+1(k+1)!.|R_k(x)|\le\frac{|x|^{k+1}}{(k+1)!}. ∣Rk​(x)∣≤(k+1)!∣x∣k+1​.

For each fixed real xxx, the factorial in the denominator eventually grows faster than the fixed power in the numerator, so

∣x∣k+1(k+1)!⟶0.\frac{|x|^{k+1}}{(k+1)!}\longrightarrow0. (k+1)!∣x∣k+1​⟶0.

The Squeeze Theorem now forces Rk(x)→0R_k(x)\to0Rk​(x)→0. This proves that the sine Maclaurin series represents sin⁡x\sin xsinx for every real xxx. The cosine argument is identical because its derivatives have the same absolute bound.

The same idea works for exe^xex, but its derivatives are not globally bounded by one. Instead, fix any r>0r>0r>0 and consider ∣x∣<r|x|<r∣x∣<r. Since every derivative of exe^xex is exe^xex,

∣dk+1dxk+1ex∣=ex≤er.\left|\frac{d^{k+1}}{dx^{k+1}}e^x\right| =e^x\le e^r. ​dxk+1dk+1​ex​=ex≤er.

If

Tk(x)=∑n=0kxnn!,T_k(x)=\sum_{n=0}^{k}\frac{x^n}{n!}, Tk​(x)=n=0∑k​n!xn​,

then Taylor's inequality gives

∣ex−Tk(x)∣≤er∣x∣k+1(k+1)!≤errk+1(k+1)!⟶0.|e^x-T_k(x)| \le\frac{e^r|x|^{k+1}}{(k+1)!} \le\frac{e^r r^{k+1}}{(k+1)!} \longrightarrow0. ∣ex−Tk​(x)∣≤(k+1)!er∣x∣k+1​≤(k+1)!errk+1​⟶0.

Thus the series equals exe^xex whenever ∣x∣<r|x|<r∣x∣<r. Because rrr can be chosen larger than any fixed ∣x∣|x|∣x∣, the identity holds for every real xxx.

Small-angle approximations and error bounds

The first nonzero terms of the sine and cosine series give the familiar small-angle approximations

sin⁡x≈x,cos⁡x≈1−x22.\sin x\approx x, \qquad \cos x\approx1-\frac{x^2}{2}. sinx≈x,cosx≈1−2x2​.

Here xxx must be measured in radians. Taylor's inequality tells us exactly how much error these shortcuts can introduce.

For sine, the first- and second-order Maclaurin polynomials are both xxx because the quadratic coefficient is zero:

T1(x)=T2(x)=x.T_1(x)=T_2(x)=x. T1​(x)=T2​(x)=x.

Since f(3)(x)=−cos⁡xf^{(3)}(x)=-\cos xf(3)(x)=−cosx and ∣f(3)(x)∣≤1|f^{(3)}(x)|\le1∣f(3)(x)∣≤1,

∣sin⁡x−x∣≤∣x∣33!.\boxed{|\sin x-x|\le\frac{|x|^3}{3!}}. ∣sinx−x∣≤3!∣x∣3​​.

For example, if ∣x∣≤12|x|\le\frac12∣x∣≤21​ radians, then

∣sin⁡x−x∣≤16(12)3=148≈0.0208.|\sin x-x| \le\frac16\left(\frac12\right)^3 =\frac1{48} \approx0.0208. ∣sinx−x∣≤61​(21​)3=481​≈0.0208.

For cosine, the second- and third-order polynomials are both 1−x2/21-x^2/21−x2/2 because the cubic coefficient is zero:

T2(x)=T3(x)=1−x22.T_2(x)=T_3(x)=1-\frac{x^2}{2}. T2​(x)=T3​(x)=1−2x2​.

Using the fourth derivative gives

∣cos⁡x−(1−x22)∣≤∣x∣44!.\boxed{ \left|\cos x-\left(1-\frac{x^2}{2}\right)\right| \le\frac{|x|^4}{4!} }. ​cosx−(1−2x2​)​≤4!∣x∣4​​.

Therefore, when ∣x∣≤12|x|\le\frac12∣x∣≤21​,

∣cos⁡x−(1−x22)∣≤1384≈0.00260.\left|\cos x-\left(1-\frac{x^2}{2}\right)\right| \le\frac1{384} \approx0.00260. ​cosx−(1−2x2​)​≤3841​≈0.00260.

The power of ∣x∣|x|∣x∣ explains why the approximation improves rapidly near the center, while the factorial controls how quickly higher-order Taylor errors shrink.

Building a logarithm series from the geometric series

Instead of taking successive derivatives, some power series are easier to derive by integrating or differentiating a known series. Start with the geometric-series identity and rewrite 1/x1/x1/x around the center x=1x=1x=1:

1x=11−(1−x)=∑n=0∞(1−x)n=∑n=0∞(−1)n(x−1)n,∣x−1∣<1.\begin{aligned} \frac1x &=\frac1{1-(1-x)}\\ &=\sum_{n=0}^{\infty}(1-x)^n\\ &=\sum_{n=0}^{\infty}(-1)^n(x-1)^n, \qquad |x-1|<1. \end{aligned} x1​​=1−(1−x)1​=n=0∑∞​(1−x)n=n=0∑∞​(−1)n(x−1)n,∣x−1∣<1.​

Because (ln⁡x)′=1/x(\ln x)'=1/x(lnx)′=1/x, integrate the series term by term inside its radius of convergence:

ln⁡x=C+∑n=0∞(−1)nn+1(x−1)n+1.\ln x =C+\sum_{n=0}^{\infty} \frac{(-1)^n}{n+1}(x-1)^{n+1}. lnx=C+n=0∑∞​n+1(−1)n​(x−1)n+1.

Reindexing gives

ln⁡x=C+∑n=1∞(−1)n−1n(x−1)n.\ln x =C+\sum_{n=1}^{\infty} \frac{(-1)^{n-1}}{n}(x-1)^n. lnx=C+n=1∑∞​n(−1)n−1​(x−1)n.

Substituting x=1x=1x=1 makes every series term vanish, so C=ln⁡1=0C=\ln1=0C=ln1=0. Hence

ln⁡x=∑n=1∞(−1)n−1n(x−1)n,∣x−1∣<1.\boxed{ \ln x =\sum_{n=1}^{\infty} \frac{(-1)^{n-1}}{n}(x-1)^n }, \qquad |x-1|<1. lnx=n=1∑∞​n(−1)n−1​(x−1)n​,∣x−1∣<1.

Replacing xxx by x+1x+1x+1 shifts the center to zero:

ln⁡(1+x)=∑n=1∞(−1)n−1nxn,∣x∣<1.\boxed{ \ln(1+x) =\sum_{n=1}^{\infty} \frac{(-1)^{n-1}}{n}x^n }, \qquad |x|<1. ln(1+x)=n=1∑∞​n(−1)n−1​xn​,∣x∣<1.

These conditions describe the open radius interval. As with any power series, endpoints must be tested separately.

The generalized binomial series

For a positive integer bbb, the ordinary binomial theorem is the finite expansion

(1+x)b=∑n=0b(bn)xn,(1+x)^b=\sum_{n=0}^{b}\binom{b}{n}x^n, (1+x)b=n=0∑b​(nb​)xn,

where

(bn)=b!(b−n)!n!\binom{b}{n} =\frac{b!}{(b-n)!n!} (nb​)=(b−n)!n!b!​

is read “bbb choose nnn.” It counts the number of ways to select nnn elements from a set of bbb elements. For example, (42)=6\binom42=6(24​)=6.

Now let bbb be any real number and set f(x)=(1+x)bf(x)=(1+x)^bf(x)=(1+x)b. Repeated differentiation gives

f(n)(x)=b(b−1)⋯(b−n+1)(1+x)b−n.f^{(n)}(x) =b(b-1)\cdots(b-n+1)(1+x)^{b-n}. f(n)(x)=b(b−1)⋯(b−n+1)(1+x)b−n.

Evaluating at the Maclaurin center produces

f(n)(0)=b(b−1)⋯(b−n+1).f^{(n)}(0)=b(b-1)\cdots(b-n+1). f(n)(0)=b(b−1)⋯(b−n+1).

This motivates the generalized definition

(bn):=b(b−1)⋯(b−n+1)n!.\boxed{ \binom{b}{n} :=\frac{b(b-1)\cdots(b-n+1)}{n!} }. (nb​):=n!b(b−1)⋯(b−n+1)​​.

Using the standard convention (b0)=1\binom b0=1(0b​)=1, the Taylor series becomes

(1+x)b=∑n=0∞(bn)xn,∣x∣<1.\boxed{ (1+x)^b =\sum_{n=0}^{\infty}\binom{b}{n}x^n }, \qquad |x|<1. (1+x)b=n=0∑∞​(nb​)xn​,∣x∣<1.

When bbb is a nonnegative integer, the factors eventually include zero, so the infinite series terminates and reduces to the ordinary finite binomial expansion.

Evaluating limits with series

Power series can evaluate an indeterminate limit by exposing the lowest-degree term that survives cancellation. Consider

lim⁡x→0ln⁡(1+x)−sin⁡x+12x2x3.\lim_{x\to0} \frac{\ln(1+x)-\sin x+\frac{1}{2}x^2}{x^3}. x→0lim​x3ln(1+x)−sinx+21​x2​.

Near x=0x=0x=0,

ln⁡(1+x)=x−x22+x33−x44+⋯\ln(1+x)=x-\frac{x^2}{2}+\frac{x^3}{3}-\frac{x^4}{4}+\cdots ln(1+x)=x−2x2​+3x3​−4x4​+⋯

and

sin⁡x=x−x33!+x55!−⋯ .\sin x=x-\frac{x^3}{3!}+\frac{x^5}{5!}-\cdots. sinx=x−3!x3​+5!x5​−⋯.

The linear terms cancel, and the added x2/2x^2/2x2/2 cancels the quadratic term from ln⁡(1+x)\ln(1+x)ln(1+x). The first surviving power is cubic:

ln⁡(1+x)−sin⁡x+12x2=(13+13!)x3+terms of degree at least 4=12x3+terms of degree at least 4.\begin{aligned} \ln(1+x)-\sin x+\frac{1}{2}x^2 &=\left(\frac13+\frac1{3!}\right)x^3 +\text{terms of degree at least }4\\ &=\frac12x^3+\text{terms of degree at least }4. \end{aligned} ln(1+x)−sinx+21​x2​=(31​+3!1​)x3+terms of degree at least 4=21​x3+terms of degree at least 4.​

After division by x3x^3x3, every remaining positive power of xxx tends to zero. Therefore,

lim⁡x→0ln⁡(1+x)−sin⁡x+12x2x3=12.\boxed{ \lim_{x\to0} \frac{\ln(1+x)-\sin x+\frac{1}{2}x^2}{x^3} =\frac{1}{2} }. x→0lim​x3ln(1+x)−sinx+21​x2​=21​​.

Integrating a function without an elementary antiderivative

The function e−x2e^{-x^2}e−x2 has no elementary antiderivative, but its Maclaurin series can be integrated term by term. Substituting −x2-x^2−x2 into the exponential series gives

e−x2=∑n=0∞(−1)nn!x2n.e^{-x^2} =\sum_{n=0}^{\infty}\frac{(-1)^n}{n!}x^{2n}. e−x2=n=0∑∞​n!(−1)n​x2n.

Integrating each term produces a power-series antiderivative valid for every real xxx:

∫e−x2 dx=C+∑n=0∞(−1)nn!(2n+1)x2n+1.\boxed{ \int e^{-x^2}\,dx =C+\sum_{n=0}^{\infty} \frac{(-1)^n}{n!(2n+1)}x^{2n+1} }. ∫e−x2dx=C+n=0∑∞​n!(2n+1)(−1)n​x2n+1​.

For the definite integral on [0,1][0,1][0,1], every power of xxx vanishes at the lower endpoint, so

∫01e−x2 dx=∑n=0∞(−1)nn!(2n+1).\int_0^1 e^{-x^2}\,dx =\sum_{n=0}^{\infty}\frac{(-1)^n}{n!(2n+1)}. ∫01​e−x2dx=n=0∑∞​n!(2n+1)(−1)n​.

Keeping the first three terms gives

∫01e−x2 dx≈1−13+110=2330.\int_0^1 e^{-x^2}\,dx \approx 1-\frac{1}{3}+\frac{1}{10} =\frac{23}{30}. ∫01​e−x2dx≈1−31​+101​=3023​.

This is an alternating series whose term magnitudes decrease. The alternating-series remainder estimate bounds the error by the first omitted term:

∣∫01e−x2 dx−2330∣≤13!⋅7=142.\left| \int_0^1 e^{-x^2}\,dx-\frac{23}{30} \right| \le \frac{1}{3!\cdot7} =\frac{1}{42}. ​∫01​e−x2dx−3023​​≤3!⋅71​=421​.

Turning a Taylor error bound into an integral error bound

A pointwise approximation can also approximate a definite integral. The key is to integrate an absolute error bound, rather than assume positive and negative errors will cancel.

Let

f(x)=esin⁡x,T2(x)=1+x+x22f(x)=e^{\sin x}, \qquad T_2(x)=1+x+\frac{x^2}{2} f(x)=esinx,T2​(x)=1+x+2x2​

be the function and its degree-two Maclaurin polynomial. The coefficients follow from

f(0)=1,f′(x)=esin⁡xcos⁡x,f′(0)=1,f′′(x)=esin⁡x(cos⁡2x−sin⁡x),f′′(0)=1.\begin{aligned} f(0)&=1,\\ f'(x)&=e^{\sin x}\cos x,&f'(0)&=1,\\ f''(x)&=e^{\sin x}(\cos^2x-\sin x),&f''(0)&=1. \end{aligned} f(0)f′(x)f′′(x)​=1,=esinxcosx,=esinx(cos2x−sinx),​f′(0)f′′(0)​=1,=1.​

Suppose a constant MMM satisfies ∣f(3)(x)∣≤M|f^{(3)}(x)|\le M∣f(3)(x)∣≤M on [−1,1][-1,1][−1,1]. Taylor's inequality gives

∣f(x)−T2(x)∣≤M3!∣x∣3(−1≤x≤1).|f(x)-T_2(x)|\le\frac{M}{3!}|x|^3 \qquad(-1\le x\le1). ∣f(x)−T2​(x)∣≤3!M​∣x∣3(−1≤x≤1).

Use linearity first, then the inequality ∣∫g∣≤∫∣g∣|\int g|\le\int|g|∣∫g∣≤∫∣g∣:

∣∫−11f(x) dx−∫−11T2(x) dx∣=∣∫−11[f(x)−T2(x)] dx∣≤∫−11∣f(x)−T2(x)∣ dx≤M3!∫−11∣x∣3 dx=2M3!∫01x3 dx=2M3![x44]01=2M4!=M12.\begin{aligned} \left|\int_{-1}^{1}f(x)\,dx-\int_{-1}^{1}T_2(x)\,dx\right| &=\left|\int_{-1}^{1}[f(x)-T_2(x)]\,dx\right|\\ &\le\int_{-1}^{1}|f(x)-T_2(x)|\,dx\\ &\le\frac{M}{3!}\int_{-1}^{1}|x|^3\,dx\\ &=\frac{2M}{3!}\int_0^1x^3\,dx\\ &=\frac{2M}{3!}\left[\frac{x^4}{4}\right]_0^1\\ &=\boxed{\frac{2M}{4!}=\frac{M}{12}}. \end{aligned} ​∫−11​f(x)dx−∫−11​T2​(x)dx​​=​∫−11​[f(x)−T2​(x)]dx​≤∫−11​∣f(x)−T2​(x)∣dx≤3!M​∫−11​∣x∣3dx=3!2M​∫01​x3dx=3!2M​[4x4​]01​=4!2M​=12M​​.​

The factor 222 comes from the evenness of ∣x∣3|x|^3∣x∣3. Keep the absolute value until splitting at zero: integrating x3x^3x3 over the symmetric interval would give zero, but that is not a bound on the error's magnitude.

The polynomial integral is easy to evaluate:

∫−11(1+x+x22) dx=2+0+13=73.\int_{-1}^{1}\left(1+x+\frac{x^2}{2}\right)\,dx =2+0+\frac13=\frac73. ∫−11​(1+x+2x2​)dx=2+0+31​=37​.

Therefore

∣∫−11esin⁡x dx−73∣≤M12.\boxed{\left|\int_{-1}^{1}e^{\sin x}\,dx-\frac73\right|\le\frac{M}{12}.} ​∫−11​esinxdx−37​​≤12M​.​

This method needs only a bound on the next derivative, not an elementary antiderivative of fff or an infinite series for the integral.

When can the bound be strict?

The chain above proves a non-strict inequality. For this particular function, we can also justify the strict bound. Differentiating once more gives

f(3)(x)=−esin⁡xsin⁡xcos⁡x (sin⁡x+3).f^{(3)}(x)=-e^{\sin x}\sin x\cos x\,(\sin x+3). f(3)(x)=−esinxsinxcosx(sinx+3).

This derivative is continuous, equals zero at 000, and is not identically zero on [−1,1][-1,1][−1,1], so any valid MMM is positive. On a sufficiently small interval around zero, continuity gives ∣f(3)(x)∣<M/2|f^{(3)}(x)|<M/2∣f(3)(x)∣<M/2. Applying Taylor's inequality on that smaller interval improves the local error bound to (M/2)∣x∣3/3!(M/2)|x|^3/3!(M/2)∣x∣3/3!.

Thus the integrand bound is strictly smaller than M∣x∣3/3!M|x|^3/3!M∣x∣3/3! on an interval of positive length and no larger elsewhere. Its integral is strictly smaller than M/12M/12M/12, giving

∣∫−11esin⁡x dx−73∣<M12.\boxed{\left|\int_{-1}^{1}e^{\sin x}\,dx-\frac73\right|<\frac{M}{12}.} ​∫−11​esinxdx−37​​<12M​.​

Smooth does not always mean analytic

A function is smooth when it has derivatives of every order. It is analytic at a point when its Taylor series there equals the function on some interval around that point. Smoothness is necessary for analyticity, but it is not sufficient.

Consider

f(x)={e−1/x2,x≠0,0,x=0.f(x)= \begin{cases} e^{-1/x^2},&x\ne0,\\ 0,&x=0. \end{cases} f(x)={e−1/x2,0,​x=0,x=0.​

The exponential approaches zero faster than every power of xxx as x→0x\to0x→0. One can show that fff is smooth and that

f(n)(0)=0for every n≥0.f^{(n)}(0)=0 \qquad\text{for every }n\ge0. f(n)(0)=0for every n≥0.

Its Maclaurin series is therefore the zero series:

∑n=0∞f(n)(0)n!xn=0.\sum_{n=0}^{\infty}\frac{f^{(n)}(0)}{n!}x^n=0. n=0∑∞​n!f(n)(0)​xn=0.

However, e−1/x2>0e^{-1/x^2}>0e−1/x2>0 whenever x≠0x\ne0x=0. The Taylor series matches fff at the center but not on any interval around it, so fff is smooth at 000 but not analytic there.

Differentiating a known power series

Known series can also generate new identities by differentiation. Starting with

11−r=∑n=0∞rn,∣r∣<1,\frac{1}{1-r}=\sum_{n=0}^{\infty}r^n, \qquad |r|<1, 1−r1​=n=0∑∞​rn,∣r∣<1,

differentiate term by term:

1(1−r)2=∑n=1∞nrn−1.\frac{1}{(1-r)^2} =\sum_{n=1}^{\infty}n r^{n-1}. (1−r)21​=n=1∑∞​nrn−1.

Substituting r=2xr=2xr=2x gives

1(1−2x)2=∑n=1∞n(2x)n−1,∣x∣<12.\boxed{ \frac{1}{(1-2x)^2} =\sum_{n=1}^{\infty}n(2x)^{n-1} }, \qquad |x|<\frac12. (1−2x)21​=n=1∑∞​n(2x)n−1​,∣x∣<21​.

Source: https://notes.ohevan.com/notes/intermediate-calculus/03-taylor-series

© 2026 Evan Luo. All rights reserved.

Back to Intermediate Calculus

0 reads

·Last edited Today
  • newsletter

  • about me

  • sponsor

© 2026 Evan Luo. All rights reserved.