Partial fraction
From Wikipedia, the free encyclopedia
In algebra, the partial fraction decomposition or (partial fraction expansion) is used to reduce the degree of either the numerator or the denominator of a rational function. The outcome of partial fraction expansion expresses that function as a sum of fractions, where:
- the denominator of each term is a power of an irreducible (not factorable) polynomial and
- the numerator is a polynomial of smaller degree than the denominator.
See partial fractions in integration for an account of their use in finding antiderivatives. They are also used in calculating the inverse of transforms; such as the Laplace transform, or the Z-transform.
Just which polynomials are irreducible depends on which field of scalars one adopts. Thus if one allows only real numbers, then irreducible polynomials are of degree either 1 or 2. If complex numbers are allowed, only 1st-degree polynomials can be irreducible. If one allows only rational numbers, then some higher-degree polynomials are irreducible.
[edit] Uses
One can use partial fraction expansion for one of two main uses:
- To change a function in the form into a function of the form
- To change a function in the form into a function of the form
[edit] Some examples
[edit] Simple example
If one wants to decompose x/(x+a), then one can follow these steps:
where A, B, and a are constants
- and
therefore
- and
[edit] Distinct first-degree factors in the denominator
Suppose it is desired to decompose the rational function
into partial fractions. The denominator factors as
and so we seek scalars A and B such that
One way of finding A and B begins by "clearing fractions", i.e., multiplying both sides by the common denominator (x − 8)(x + 5). This yields
Collecting like terms gives
Equating coefficients of like terms then yields:
The solution is A = 11/13, B = 2/13. Thus we have the partial fraction decomposition
[edit] An irreducible quadratic factor in the denominator
In order to decompose
into partial fractions, first observe that
The fact that x2 + 2x + 4 cannot be factored using real numbers can be seen by observing that the discriminant 22 − 4(1)(4) is negative. Thus we seek scalars A, B, C such that
When we clear fractions, we get
We could proceed as in the previous example, getting three linear equations in three variables A, B, and C. However, since solving such systems becomes onerous as the number of variables grows, we try a different method. Substitution of 2 for x in the identity above makes the entire second term vanish, and we get
i.e., 84 = 12A, so A = 7, and we have
Next, substitution of 0 for x yields
and so C = 4. We now have
Substitution of 1 for x yields
and so B = 3. Our partial fraction decomposition is therefore:
[edit] A repeated first-degree factor in the denominator
Consider the rational function
The denominator factors thus:
The multiplicity of the first-degree factor (x − 4) is more than 1. In such cases, the partial fraction decomposition takes the following form:
[edit] Repeated factors in the denominator generally
For rational functions of the form
(where the "" may be any polynomial of sufficiently small degree) the partial fraction decomposition looks like this:
The general pattern may be quickly guessed.
For rational functions of the form
with the irreducible quadratic factor x2 + 1 in the denominator (where again, the "" may be any polynomial of sufficiently small degree), the partial fraction decomposition looks like this:
and a similar pattern holds for any other irreducible quadratic factor.
[edit] High-degree polynomials in the numerator
When you need to apply the partial fraction decomposition to a polynomial division like
where , you just need to make the Polynomial long division procedure first, and apply the partial fraction decomposition to the remainder.
[edit] Use in deriving the logistic general equation
In many beginning calculus courses, partial fractions are introduced as a way to derive the general equation for a logistic function.
Logistic functions model a population which grows until it reaches a limit. The rate of change for the function is proportional (constant k) to both the population reached (P) and the fraction of the total carrying capacity (M) remaining. Thus:
- 1 = A(M − P) + BP
- 1 = AM − AP + BP
[edit] Basic principles
The basic principles involved are quite simple; it is the algorithmic aspects that require attention in particular cases.
Assume a rational function R(x) in one indeterminate x has denominator that factors as
- P(x)Q(x)
over a field K (we can take this to be real numbers, or complex numbers). If P and Q have no common factor, then R may be written as
- A/P + B/Q
for some polynomials A(x) and B(x) over K. The existence of such a decomposition is a consequence of the fact that the polynomial ring over K is a principal ideal domain, so that
- CP + DQ = 1
for some polynomials C(x) and D(x) (see Bézout's identity).
Using this idea inductively we can write R(x) as a sum with denominators powers of irreducible polynomials. To take this further, if required, write
- G(x)/F(x)n
as a sum with denominators powers of F and numerators of degree less than F, plus a possible extra polynomial. This can be done by the Euclidean algorithm, polynomial case.
Therefore when K is the complex numbers and we can assume F has degree 1 (by the fundamental theorem of algebra) the numerators will be constant. When K is the real numbers we can have the case of
- degree F = 2,
and a quotient of a linear polynomial by a power of a quadratic will occur. This therefore is a case that requires discussion, in the systematic theory of integration (for example in computer algebra).
[edit] Examples
- As an introductory example we take the rational function
- This by the difference of two squares identity can also be written as
- which can be transformed further. Consider an identity
- where A and B are constants. In more explicit form,
- We know that the constants on one side of an expression must equal those on the other side. On the left hand side, the constants are −A and B, and on the right, the constant is simply 0. So, comparing constants on both sides of the expression, we can see that
- i.e. A = B.
- Now, in the same way, we know that the number of x terms on the left must equal the number of x's on the right. Therefore, looking at x terms on both sides,
- therefore
- and so, given that A = B, we can say that
-
-
A + A = 1 2A = 1 A = B = 0.5
-
- Finally we find:
- or
- which holds true for all x ≠ ±1.
- The preceding example can be generalized to the following situation:
- Assume that Q(x) is a monic polynomial of some degree n which over the underlying field K decomposes into linear factors
- where all xi are pairwise different. In other words Q has simple roots (over K). If P(x) is any polynomial of degree then according to the Lagrange interpolation formula (see Lagrange form) P(x) can be uniquely written as a sum (the Lagrange form representation)
- where is the Lagrange polynomial
- Dividing the Lagrange representation on the right side termwise by the polynomial Q(x) in its factored form one obtains
- This is the partial fraction decomposition
- of the rational function with coefficients
- The first example can be obtained as the special case .