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.

Partial fractions decomposition is an algebraic technique that takes a proper rational function — where the degree of the numerator is less than that of the denominator — and expresses it as a sum of fractions whose denominators are the irreducible factors of . It matters because many operations that are hard or impossible on the combined fraction (integration, summing series, transforming back from the Laplace domain) become routine once the fraction is split into elementary pieces. The method rests on the fact that any polynomial with real coefficients factors completely into linear and irreducible quadratic factors. A surprising fact is that the decomposition is unique: there is exactly one way to write it once the form is fixed, which is what makes the "equate coefficients" method work reliably. Far from being a mere algebraic curiosity, it is the workhorse behind a huge portion of calculus and engineering mathematics.

The Core Insight

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

Rational Function and Properness

A rational function is a quotient

1
⟳ 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.

The Four Standard Forms

Every proper rational function decomposes into a sum of terms drawn from these four types, depending on the factor in the denominator:

2
⟳arises from a single, non-repeated root of .
3
⟳a factor requires one term for each power from to .
4
⟳the numerator is linear (one degree below the quadratic) because prevents real factoring.
5
⟳each power of the repeated quadratic gets its own linear-over-quadratic term.

Existence and Uniqueness of Decomposition

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

6
⟳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

Sketch of Existence via Dimension Counting

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.
  1. 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.
  1. 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.
  1. 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 | 1667–1748

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.

Reversing the addition of fractions: combining versus decomposing

<svg viewBox="0 0 460 260" xmlns="http://www.w3.org/2000/svg">
<rect width="460" height="260" fill="#0a0e17"/>
<text x="60" y="60" fill="#e2e8f0" font-size="15" font-family="serif">2/(x+1)</text>
<text x="60" y="200" fill="#e2e8f0" font-size="15" font-family="serif">3/(x−2)</text>
<text x="300" y="130" fill="#d4a853" font-size="15" font-family="serif">(5x−4)/(x²−x−2)</text>
<line x1="130" y1="55" x2="280" y2="120" stroke="#94a3b8" stroke-width="1.5"/>
<line x1="130" y1="195" x2="280" y2="140" stroke="#94a3b8" stroke-width="1.5"/>
<text x="190" y="80" fill="#94a3b8" font-size="12" font-family="serif">combine →</text>
<text x="170" y="180" fill="#d4a853" font-size="12" font-family="serif">← decompose</text>
<line x1="280" y1="115" x2="135" y2="60" stroke="#d4a853" stroke-width="1" stroke-dasharray="4 3"/>
<line x1="280" y1="145" x2="135" y2="190" stroke="#d4a853" stroke-width="1" stroke-dasharray="4 3"/>
<text x="30" y="240" fill="#94a3b8" font-size="11" font-family="serif">Simple pieces (the "recipe")</text>
<text x="270" y="240" fill="#94a3b8" font-size="11" font-family="serif">Combined fraction (the "smoothie")</text>
</svg>

Worked Examples

Distinct Linear Factors

Given: Decompose . Step 1 — Factor the denominator.
7
⟳find two numbers multiplying to and adding to : namely and .
Step 2 — Set up the form.
8
⟳one unknown constant per distinct linear factor.
Step 3 — Clear denominators.
9
⟳multiply both sides by .
Step 4 — Cover-up substitution. Set : . Set : . Answer:
Check: . ✓

Repeated Linear and Quadratic Factors

Given: Decompose . Step 1 — Set up the full form. A squared linear factor needs two terms; an irreducible quadratic needs a linear numerator:
10
⟳forms [3] and [4] combined; four unknowns match .
Step 2 — Clear denominators.
11
⟳multiply through by .
Step 3 — Use convenient values. Set : . Step 4 — Equate coefficients. Expanding and collecting:
  • :
  • :
  • : , i.e. ...

Solving with gives .

Answer:

Common Misconceptions

Always Check Properness and Irreducibility First

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.

A Wrong Setup That Cannot Work

Suppose a student writes

12
⟳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

13
⟳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

  1. Integral calculus. Every rational function can be integrated by decomposing it, since and yields logs and arctangents.
  2. Control engineering. Inverse Laplace transforms of transfer functions require partial fractions to recover the system's time response (e.g., step response of an RLC circuit).
  3. Signal processing. The inverse Z-transform of a digital filter's transfer function uses partial fractions to find its impulse response.
  4. Telescoping series. Sums like collapse after decomposition, giving exact closed forms.
  5. Differential equations. Solving linear ODEs via Laplace transforms ends with a partial-fraction step to invert.
  6. Probability and queuing theory. Generating functions and Markov-chain steady states are often rational and inverted by partial fractions.
  7. Chemical reaction kinetics. Integrating rate laws for consecutive reactions produces rational expressions decomposed this way.

Historical Development

  • 1650s–1670s: Early integration of simple rational forms appears in the work of Mercator and others studying the area under hyperbolas (yielding logarithms).
  • 1691–1700s: Leibniz and Johann Bernoulli develop the systematic decomposition of rational functions to integrate them, recognizing logs and arctangents as the resulting forms.
  • 1702: Leibniz publishes work noting that integration of rational functions reduces to the cases of linear and quadratic denominators.
  • 1740s: Euler refines and generalizes the technique, handling repeated factors and complex roots, in his foundational analysis texts.
  • 1748: Euler's Introductio in analysin infinitorum presents partial fractions as a standard tool, including expansions of trigonometric and other functions.
  • 1820s: Cauchy connects the coefficients to residues via complex analysis, giving the cover-up method a rigorous foundation.
  • 1890s–1900s: Oliver Heaviside popularizes the operational/cover-up shortcut in electrical engineering for solving circuit equations.
  • 1930s: The Laplace transform formalism standardizes partial fractions as the inversion technique in engineering mathematics.

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

Before this

Where this leads