Taylor Series
The philosophy of Taylor series is to approximate a function with polynomials that use only the information of a single point in the domain of the function. Consider the function f : R → R f: \mathbb{R} \rightarrow \mathbb{R} f : R → R and a point a ∈ R a \in \mathbb{R} a ∈ R . Further, we would like to use ( x − a ) 0 (x-a)^0 ( x − a ) 0 , ( x − a ) 1 (x- a)^1 ( x − a ) 1 , ( x − a ) 2 (x- a)^2 ( x − a ) 2 , ..., ( x − a ) n (x- a)^n ( x − a ) n as the basic building blocks of our approximation. The polynomial constructed is of the form:
p n ( x ) = c 0 + c 1 ( x − a ) + c 2 ( x − a ) 2 + . . . + c n ( x − a ) n
p_n(x) = c_0 + c_1 (x - a) + c_2(x - a)^2 + ... + c_n (x - a)^n
p n ( x ) = c 0 + c 1 ( x − a ) + c 2 ( x − a ) 2 + ... + c n ( x − a ) n Now, assume that the n n n -th derivative of f f f exits. To approximate f f f well, p n p_n p n should satisfy
p n ( a ) = f ( a )
p_n(a) = f(a)
p n ( a ) = f ( a ) so that c 0 = f ( a ) c_0 = f(a) c 0 = f ( a ) .
Further, f ′ ( a ) f'(a) f ′ ( a ) tell how the function f ( x ) f(x) f ( x ) changes when x x x moves from a a a by a little bit. We require p n ( x ) p_n(x) p n ( x ) to exhibit the same behavior:
p n ′ ( a ) = f ′ ( a )
p'_n(a) = f'(a)
p n ′ ( a ) = f ′ ( a ) so that c 1 = f ′ ( a ) c_1 = f'(a) c 1 = f ′ ( a ) .
To fit f ( x ) f(x) f ( x ) even better, we force the second order derivative of p n ( x ) p_n(x) p n ( x ) at x x x comply with f ′ ′ ( a ) f''(a) f ′′ ( a ) , hence
p n ′ ′ ( a ) = f ′ ′ ( a )
p_n''(a) = f''(a)
p n ′′ ( a ) = f ′′ ( a ) and c 2 = 1 2 f ′ ′ ( a ) c_2 = \frac{1}{2} f''(a) c 2 = 2 1 f ′′ ( a ) .
Following the above procedure,we get
c i = 1 i ! f ( i ) ( a )
c_i = \frac{1}{i!}f^{(i) } (a)
c i = i ! 1 f ( i ) ( a ) and
p n ( x ) = ∑ k = 0 n f ( k ) ( a ) k ! ( x − a ) k
p_n(x) = \sum_{k = 0}^n \frac{ f^{( k ) }(a) }{ k! } (x - a)^k
p n ( x ) = k = 0 ∑ n k ! f ( k ) ( a ) ( x − a ) k where f ( 0 ) ≐ f f^{(0)} \doteq f f ( 0 ) ≐ f , 0 ! ≐ 1 0! \doteq 1 0 ! ≐ 1 . We have just show that the construct polynomial satisfies
Theorem. p n ( k ) ( a ) = f ( k ) ( a ) p^{ (k) }_n (a) = f^{ (k) } (a) p n ( k ) ( a ) = f ( k ) ( a ) , for k ∈ [ n ] k \in [n] k ∈ [ n ] .
Remainder
One natural to ask is that, how accurate is the p n ( x ) p_n(x) p n ( x ) . In particular, given x ≠ a x \neq a x = a , we want to measure the error
r n ( x ) = f ( x ) − p n ( x )
r_n(x) = f(x) - p_n(x)
r n ( x ) = f ( x ) − p n ( x ) quantitively.
Note that if the function f f f is itself a polynomial up to order n n n , then the approximation is accurate that is r n ( x ) ≡ 0 r_n(x) \equiv 0 r n ( x ) ≡ 0 for x ∈ R x \in \mathbb{R} x ∈ R . In this case, we recover f f f globally using only local information at a a a .
In general, if f ( n + 1 ) ( x ) f^{ (n + 1)} (x) f ( n + 1 ) ( x ) exists and is continuous, then the error is characterized as
Theorem
r n ( x ) = 1 n ! ∫ a x f ( n + 1 ) ( t ) ( x − t ) n d t = − ∫ a x f ( n + 1 ) ( t ) d ( ( x − t ) n + 1 ( n + 1 ) ! )
r_n(x) = \frac{1}{n!} \int_a^x f^{ (n + 1) } (t) (x - t)^{n } dt = -\int_a^x f^{ (n + 1) } (t) d \left( \frac{(x - t)^{n + 1} }{(n + 1)!} \right)
r n ( x ) = n ! 1 ∫ a x f ( n + 1 ) ( t ) ( x − t ) n d t = − ∫ a x f ( n + 1 ) ( t ) d ( ( n + 1 )! ( x − t ) n + 1 ) Proof.
By fundamental theorem of calculus, we have
f ( x ) = f ( a ) + ∫ a x f ′ ( t ) d t
f(x) = f(a) + \int_{a}^x f'(t) dt
f ( x ) = f ( a ) + ∫ a x f ′ ( t ) d t On the other hand
∂ [ f ′ ( t ) ( t − x ) ] ∂ t = f ′ ′ ( t ) ( t − x ) + f ′ ( t )
\frac{\partial [f'(t) (t - x)] }{\partial t} = f''(t) (t - x) + f'(t)
∂ t ∂ [ f ′ ( t ) ( t − x )] = f ′′ ( t ) ( t − x ) + f ′ ( t ) Therefore,
f ′ ( t ) ( t − x ) ∣ t = a x = f ′ ( a ) ( x − a ) = ∫ a x f ′ ′ ( t ) ( t − x ) d t + ∫ a x f ′ ( t ) d t
f'(t) (t - x) \mid_{t = a}^x = f'(a) (x -a) = \int_{a}^x f''(t) (t - x) dt + \int_{a}^x f'(t) dt
f ′ ( t ) ( t − x ) ∣ t = a x = f ′ ( a ) ( x − a ) = ∫ a x f ′′ ( t ) ( t − x ) d t + ∫ a x f ′ ( t ) d t and
f ( x ) = f ( a ) + f ′ ( a ) ( x − a ) + ∫ a x f ′ ′ ( t ) ( x − t ) d t
f(x) = f(a) + f'(a) (x - a) + \int_{a}^x f''(t) (x - t) dt
f ( x ) = f ( a ) + f ′ ( a ) ( x − a ) + ∫ a x f ′′ ( t ) ( x − t ) d t Similarly,
∫ a x f ′ ′ ( t ) ( x − t ) d t = − ∫ a x f ′ ′ ( t ) d ( x − t ) 2 2 ! = f ′ ′ ( a ) ( x − a ) 2 2 ! + ∫ a x ( x − t ) 2 2 ! f ( 3 ) ( t ) d t
\begin{aligned}
\int_{a}^x f''(t) (x - t) dt
&= - \int_{a}^x f''(t) d \frac{ (x - t)^2}{2!} \\
&= f''(a) \frac{ (x - a)^2}{2!} + \int_{a}^x \frac{ (x - t)^2}{2!} f^{(3) } (t) dt
\end{aligned}
∫ a x f ′′ ( t ) ( x − t ) d t = − ∫ a x f ′′ ( t ) d 2 ! ( x − t ) 2 = f ′′ ( a ) 2 ! ( x − a ) 2 + ∫ a x 2 ! ( x − t ) 2 f ( 3 ) ( t ) d t As just shown, the proof can be finished by induction.
□ \square □
Weighted Mean Value Theorem.
Given a continuous functions f ≥ 0 f \ge 0 f ≥ 0 and an Riemann integral function g ≥ 0 g \ge 0 g ≥ 0 defined on an closed interval I I I , then
∫ I f ( t ) g ( t ) d t = f ( c ) ∫ I g ( t ) d t
\int_I f(t) g(t) dt = f(c) \int_I g(t) dt
∫ I f ( t ) g ( t ) d t = f ( c ) ∫ I g ( t ) d t for some c ∈ I c \in I c ∈ I .
Proof. As f f f is continuous and I I I is closed, ∃ m , M ∈ R \exists m, M \in \mathbb{R} ∃ m , M ∈ R , s.t.,
m ≤ f ( t ) ≤ M , ∀ t ∈ I
m \le f(t) \le M, \qquad \forall t \in I
m ≤ f ( t ) ≤ M , ∀ t ∈ I Therefore,
m g ( t ) ≤ f ( t ) g ( t ) ≤ M g ( t ) , ∀ t ∈ I
mg(t) \le f(t) g(t) \le M g(t), \qquad \forall t \in I
m g ( t ) ≤ f ( t ) g ( t ) ≤ M g ( t ) , ∀ t ∈ I Define S = ∫ I g ( t ) d t S = \int_I g(t) dt S = ∫ I g ( t ) d t . By monotonicity of Riemann integration, we have
m S ≤ ∫ I f ( t ) g ( t ) d t ≤ M S
m S \le \int_I f(t) g(t) dt \le M S
m S ≤ ∫ I f ( t ) g ( t ) d t ≤ M S Note that S f ( t ) S f(t) S f ( t ) is a continuous function in I I I . Hence, by mean value theorem, ∃ c ∈ I \exists c \in I ∃ c ∈ I , such that
S f ( c ) = ∫ I f ( t ) g ( t ) d t
S f(c) = \int_I f(t) g(t) dt
S f ( c ) = ∫ I f ( t ) g ( t ) d t □ \square □
Corollary 1. By weighted mean value theorem, we have
r n ( x ) = 1 n ! ∫ a x f ( n + 1 ) ( t ) ( x − t ) n d t = f ( n + 1 ) ( c ) ∫ a x 1 n ! ( x − t ) n d t = f ( n + 1 ) ( c ) ( n + 1 ) ! ( x − a ) n + 1
\begin{aligned}
r_n(x)
&= \frac{1}{n!} \int_a^x f^{ (n + 1) } (t) (x - t)^{n } dt \\
&= f^{ (n + 1) } (c) \int_a^x \frac{1}{n!} (x - t)^{n } dt \\
&= \frac{f^{ (n + 1) } (c ) }{(n + 1) ! } (x - a)^{n + 1 }
\end{aligned}
r n ( x ) = n ! 1 ∫ a x f ( n + 1 ) ( t ) ( x − t ) n d t = f ( n + 1 ) ( c ) ∫ a x n ! 1 ( x − t ) n d t = ( n + 1 )! f ( n + 1 ) ( c ) ( x − a ) n + 1 for some c ∈ [ a , x ] c \in [a, x] c ∈ [ a , x ] .
Corollary 2. Let f : → R n → R f:\rightarrow \mathbb{R}^n \rightarrow \mathbb{R} f :→ R n → R be a function with continuous second partial derivatives, then given a ∈ R n a \in \mathbb{R}^n a ∈ R n , it holds that
f ( x ) = f ( a ) + [ ∇ f ( c ) ] T ( x − a )
f(x) = f(a) + [\nabla f(c)]^T (x - a)
f ( x ) = f ( a ) + [ ∇ f ( c ) ] T ( x − a ) for some c ∈ a + t ( x − a ) c \in a + t(x - a) c ∈ a + t ( x − a ) , where t ∈ [ 0 , 1 ] t \in [0, 1] t ∈ [ 0 , 1 ] .
Proof: Define g ( t ) = f ( a + t ( x − a ) ) : [ 0 , 1 ] → R g(t) = f(a + t (x- a)) : [0,1] \rightarrow \mathbb{R} g ( t ) = f ( a + t ( x − a )) : [ 0 , 1 ] → R . Then
g ( 0 ) = f ( a ) g(0) = f(a) g ( 0 ) = f ( a ) .
g ( 1 ) = f ( x ) g(1) = f(x) g ( 1 ) = f ( x ) .
g ′ ( t ) = [ ∇ f ( a + t ( x − a ) ) ] T ( x − a ) g'(t) = [\nabla f(a + t (x- a) ) ]^T (x - a) g ′ ( t ) = [ ∇ f ( a + t ( x − a )) ] T ( x − a )
By mean value theorem, ∃ t ∈ [ 0 , 1 ] \exists t \in [0, 1] ∃ t ∈ [ 0 , 1 ] , s.t.,
g ( 1 ) − g ( 0 ) 1 = f ( x ) − f ( a ) = g ′ ( t ) = [ ∇ f ( a + t ( x − a ) ) ] T ( x − a )
\frac{g(1) - g(0)}{1} = f(x) - f(a) = g'(t) = [\nabla f(a + t (x- a) ) ]^T (x - a)
1 g ( 1 ) − g ( 0 ) = f ( x ) − f ( a ) = g ′ ( t ) = [ ∇ f ( a + t ( x − a )) ] T ( x − a ) □ \square □
Corollary 3. Let f f f , g g g and c c c as defined before, then
f ( x ) = f ( a ) + [ ∇ f ( a ) ] T ( x − a ) + 1 2 ( x − a ) T [ ∇ 2 f ( c ) ] ( x − a )
f(x) = f(a) + [\nabla f(a)]^T (x - a) + \frac{1}{2} (x - a)^T [\nabla^2 f(c)] (x - a)
f ( x ) = f ( a ) + [ ∇ f ( a ) ] T ( x − a ) + 2 1 ( x − a ) T [ ∇ 2 f ( c )] ( x − a ) Proof:
g ′ ′ ( t ) = ( x − a ) T [ ∇ 2 f ( a + t ( x − a ) ) ] ( x − a )
g''(t) = (x - a)^T [\nabla^2 f(a + t (x- a) ) ] (x - a)
g ′′ ( t ) = ( x − a ) T [ ∇ 2 f ( a + t ( x − a ))] ( x − a ) Then applying Corollary 1 gives
g ( 1 ) = g ( 0 ) + g ′ ( 0 ) ( 1 − 0 ) + 1 2 g ′ ′ ( t ) ( 1 − 0 ) 2
g(1) = g(0) + g'(0)(1 - 0) + \frac{1}{2} g''(t) (1 - 0)^2
g ( 1 ) = g ( 0 ) + g ′ ( 0 ) ( 1 − 0 ) + 2 1 g ′′ ( t ) ( 1 − 0 ) 2 for some t ∈ [ 0 , 1 ] t \in [0, 1] t ∈ [ 0 , 1 ] .
□ \square □
← Back to all notes Back to top ↑