Primitives of Rational Functions (Partial Fraction Decomposition)
This part deals with only one subject: How to find primitives of rational functions, i.e. of functions of the type with polynomials r and s. Without restriction we assume s to be non constant and normalized.
On intervals, for example between two adjacent zeros of s, f has a primitive as it is continuous. There is a concept to calculate these primitives which is essentially related to two basic theorems on polynomials:
-
Fundamental Theorem of Algebra
Each non constant normalized polynomial s on completely decomposes into a product of linear and indecomposable quadratic polynomials:
[1]
where the discriminant of a quadratic polynomial controls its decomposability:
is indecomposable
So we know that and that, consequently, all values of are positive. (Continuous functions with no zeros do not vary their algebraic sign on intervals!)
-
Partial Fraction Theorem
Based on the decomposition [1] each rational function with a non constant mormalized denominator s is representable as a sum:
t being a suitable polynomial such that if and otherweise.
Both theorems, especially the fundamental theorem, are pure existence theorems! And it is this fact that causes actual problems when it comes to application: Apart from simple and clear cut cases it is nearly impossible to get the necessary denominator's decomposition.
Example: We find a partial decomposition for
-
First we (sequentially) discover that 1 is a double zero of the denominator so that a twofold polynomial division yields the decomposition
-
and a further polynomial division then provides the identity
-
Finally, comparing the coefficients in the ansatz
yields the following linear system of equations
f thus decomposes like this
[2]
|
With a partial decomposition of f at hand, a primitive of f is easily found if we know primitives for each addend. This reduces our problem to only two types of rational functions, namely ()
-
-
where
Quotients of the first kind are easy to deal with, except for the case which needs the natural logarithm ln
i |
|
from chapter 8.
Proposition:
-
is a primitive function of .
|
[8.0.1] |
-
If then is a primitive function of .
|
[8.0.2] |
Proof:
1. ► In [8.7.1] we introduce ln as a primitive of the reciprocal function on . ln is thus differentiable and
for all
Using the chain rule [7.7.8] and the derivative of the absolute value function [7.4.3] we see that is differentiable and that
is its derivative.
2. ► is essentially a power of X, thus differentiable. We use the
power rule
i |
for all
|
to calculate the derivative:
|
Examples are quite straight usually:
-
is a primitive of .
-
is a primitive of .
Dealing with quotients of the second kind is a bit catchier. But as we always have the decomposition
[3]
we may confine ourselves only to the cases and . The first one is easy.
Proposition:
-
is a primitive function of .
|
[8.0.3] |
-
If then is a primitive function of .
|
[8.0.4] |
Proof: Both assertions are easily proved by using the chain rule. In 1. we note that, due to the premise, the values of are always . The domain of is thus the whole of .
|
As an example we see that
-
is a primitive function of .
-
is a primitive function of .
The remaining case is actually quite cumbersome. We recall that the discriminant is negative, thus is positive. At first we show that it is sufficient to consider only denominators like .
Proposition: If g is a primitive of then
|
[8.0.5] |
is a primitive function of .
Proof: The chain rule guarantees the differentiability of the function in [8.0.5] and provides the following derivative:
|
Primitives of are eventually constructed by recursion. For the base step we need the invers tangent,
,
the inverse of
i |
The restriction is bijective as it is
|
.
Proposition:
-
is a primitive function of .
|
[8.0.6] |
-
If g is a primitive of then
|
|
[8.0.7] |
is a primitive function of .
Proof:
1. ► As for all , arctan is differentiable due to [7.5.4] with
Note that [+] is valid according to the identity .
2. ► The function in [8.0.7] is differentiable due to the quotient rule [7.7.7]. Its derivative calculates to:
|
An example will show how this procedure works.
Example:
-
It takes three steps to construct a primitive function of recursively by [8.0.7]:
is a primitive of .
is a primitive of .
is a primitive of .
-
To get a primitive of we start by calculating the discriminant from the data and . With step two of the example above and with [8.0.5] we then find
as a primitive function.
-
Finally, to get a primitive of we first consider the decomposition
according to [3]. From the previous result and from [8.0.4] we now find
as a primitive.
|
We now return to our initial example
In [2] we showed that
is its partial fraction decomposition. Thus f is completely decomposed in processable basic typs and a primitive of f is simply gained by adding their primitive functions:
|