Partial Fractions Decomposition
Partial Fractions Decomposition rewrites a single complicated rational function (a polynomial divided by a polynomial) as a sum of simpler fractions whose denominators are the factors of the original denominator. Key result: any proper rational function with a factorable denominator equals a sum of terms of the form and . Applies in: integration, inverse Laplace transforms, infinite series, control theory, and algebra. Origin: developed by Johann Bernoulli and Leibniz in the early 1700s for integrating rational functions.
Adding fractions combines many pieces into one by finding a common denominator; partial fractions runs this process in reverse. If you can see the denominator's factors, you can "un-add" the fraction back into the simple parts it came from. Because a polynomial of degree factors into linear/quadratic building blocks, the original fraction is a disguised sum — and decomposition recovers the disguise.
Formal Statement
A rational function is a quotient
Derivation hint: and are polynomials; the function is undefined at the roots of . where and are polynomials. The function is proper if , and improper if . Symbols: denotes the degree (highest power of ); denotes a root; denote unknown constants to be found.
Every proper rational function decomposes into a sum of terms drawn from these four types, depending on the factor in the denominator:
Derivation hint: arises from a single, non-repeated root of .
Derivation hint: a factor requires one term for each power from to .
Derivation hint: the numerator is linear (one degree below the quadratic) because prevents real factoring.
Derivation hint: each power of the repeated quadratic gets its own linear-over-quadratic term.
Let be a proper rational function with real coefficients, and let be factored completely into distinct linear factors and distinct irreducible quadratic factors . Then there exist unique real constants such that equals the sum of the corresponding standard-form terms [2]–[5]. If is improper, polynomial long division first yields
Derivation hint: divide by ; is the quotient polynomial and the remainder, which is now proper. where is a polynomial and the remaining proper fraction decomposes as above.
Why It Holds / Derivation
We show why the standard forms always provide enough freedom to match any proper numerator. 1. Count the unknowns. Suppose . Each distinct linear factor contributes one constant; a -fold linear factor contributes constants; each -fold quadratic factor contributes constants. Summing across all factors gives exactly unknown constants. 2. Count the equations. Clearing denominators produces a polynomial identity of degree at most (since is proper). A polynomial of degree has coefficients, so matching it produces exactly linear equations. 3. Match counts. We have unknowns and equations — a square linear system. The Fundamental Theorem of Algebra guarantees the factorization of exists, and the resulting system can be shown to be nonsingular, so a unique solution exists. 4. Uniqueness. If two decompositions existed, their difference would be a proper rational function equal to zero, forcing all its constants to vanish — contradiction unless they were identical.
∎Johann Bernoulli, a central figure of the early calculus era, systematically developed the integration of rational functions in his lectures (later compiled by L'Hôpital). He recognized that every rational function could be integrated in closed form by first splitting it into partial fractions and integrating each elementary piece — yielding logarithms, arctangents, and rational terms. This insight, shared with Leibniz, transformed integration from an art into an algorithm for the entire class of rational functions and cemented partial fractions as a foundational calculus tool.
Building Intuition
Think of a smoothie. The combined fraction is the smoothie — blended, you cannot tell what went in. Partial fractions is the recipe card that tells you it was made from and . The denominator reveals the ingredient list (the factors); the numerators are the amounts. Because adding over a common denominator returns exactly the original, you know the recipe is correct. The whole technique is just "reverse blending": find the factors, then solve for how much of each pure fraction recombines to the given mix.
```svg
```
Worked Examples
Given: Decompose .
Step 1 — Factor the denominator.
Derivation hint: find two numbers multiplying to and adding to : namely and .
Step 2 — Set up the form.
Derivation hint: one unknown constant per distinct linear factor.
Step 3 — Clear denominators.
Derivation hint: multiply both sides by .
Step 4 — Cover-up substitution. Set : . Set : .
Answer:
Check: . ✓
Given: Decompose .
Step 1 — Set up the full form. A squared linear factor needs two terms; an irreducible quadratic needs a linear numerator:
Derivation hint: forms [3] and [4] combined; four unknowns match .
Step 2 — Clear denominators.
Derivation hint: multiply through by .
Step 3 — Use convenient values. Set : .
Step 4 — Equate coefficients. Expanding and collecting:
- :
- :
- : , i.e. ...
Solving with gives .
Answer:
Common Misconceptions
Two of the most frequent errors:
- Forgetting to divide first. If (improper), you must do polynomial long division before decomposing, as in [6]. Skipping this gives a system with no solution.
- Putting a constant over a quadratic. An irreducible quadratic factor needs a linear numerator , not just a constant . Using only a constant loses a degree of freedom and the system fails.
Suppose a student writes
Derivation hint: this omits the linear numerators required by form [5]. This is wrong: a repeated irreducible quadratic requires linear numerators at every power. The correct form is
Derivation hint: solving gives — but the constant-only setup [12] cannot even produce the in the numerator.
Connections
Partial fractions sits at a crossroads of algebra and calculus. It depends directly on Polynomial Factorization and the Fundamental Theorem of Algebra to guarantee that the denominator splits into linear and quadratic pieces. It is the gateway to Integration of Rational Functions, turning each piece into a logarithm or arctangent. In analysis it powers the method of Telescoping Series, where decomposing a term reveals massive cancellation. In engineering it is the inverse step of the Laplace Transform, converting transfer functions back into time-domain signals. It also relates to Residues in Complex Analysis, where the cover-up coefficients are precisely residues at poles.
Real-World Applications
Historical Development
Subtleties & Limits
While partial fractions over the real numbers is fully solved, subtleties remain in practice and in theory. Factoring the denominator is the true bottleneck: by the Abel–Ruffini theorem, polynomials of degree five and higher have no general radical formula for their roots, so exact decomposition may be impossible in closed form and one must resort to numerical roots. Repeated and complex roots introduce numerical instability — coefficients computed by the cover-up method become ill-conditioned when roots cluster together. Over different fields (rationals vs. reals vs. complex numbers) the irreducible factors differ, so the "simplest" decomposition is field-dependent. Generalizing to functions of several variables (rational functions of and ) leads to deep questions in algebraic geometry where no simple universal decomposition exists.
See Also
Polynomial Factorization · Integration of Rational Functions · Laplace Transform · Telescoping Series · Fundamental Theorem of Algebra · Residues in Complex Analysis · Polynomial Long Division