Technique Masterclasses

Pure Mathematics 4

Deep Dive: Partial Fractions Decomposition and Integration

Provenance: written 2026-09-29. Read/checked this session: research/veridian/WMA14-verified-facts.md §1 (spec text for 2.1, 4.1, 6.3), §3 (formula-booklet contents — confirmed no discrete partial-fractions formula exists there; the general-nn binomial series that 4.1 leans on is booklet-given), §5.2 (this topic's own three real citations), §6 (series-reviewed scope), §7 (the topics-with-enough-material list — this topic is not on it), §8 (evidence-strength flags); the existing lesson file content/veridian/curriculum/wma14/partial-fractions-decomposition-and-integration.ts in full (every mechanism block, worked example, method-comparison, trap-taxonomy entry and MCQ, plus its own header and footer provenance notes); content/veridian/technique-hub/wma14/codex-formula-and-method-bank.md §2 and §2.2 (formula-status and method-choice skeleton) and its §6 integration entry; forge-exam-technique-guide.md (the algebraic-manipulation checklist and cross-topic trap-taxonomy row); signal-frequency-and-boundaries.md §1 (the frequency row: 3 of 7 series, no confirmed total mark size); content/veridian/question-bank/wma14.ts (checked — no item for this spec point yet); and this technique-hub's own codex-deep-dive-implicit-and-parametric-differentiation-tangents-and-normals.md, read as the format precedent for this document type. No new primary Pearson document was fetched this session — every exam citation below traces to the facts bank's own already-verified §5.2 quotes; the new material this document adds (§1's uniqueness proof, §1.4's account of why quadratic factors are excluded, and §3.3's differentiation worked example) is original mathematical/pedagogical exposition grounded directly in the spec's own text, labelled as such throughout rather than presented as exam-sourced. Not affiliated with or endorsed by Pearson Edexcel.

WMA14 · CODEX Deep-Dive — Partial Fractions Decomposition and Integration

Why this document exists, and what it does not repeat

The lesson file already contains a full worked treatment of every sub-case below: three distinct linear factors, one repeated linear factor, a top-heavy numerator, the 1a\frac1a integration rule, and the spec-4.1 series-expansion extension — each with its own mechanism block, marked solution, method comparison and MCQ, all built from real citations. This document does not re-run any of that. It exists for three things the lesson, the formula bank and the FORGE checklist do not do:

  1. Prove, rather than assert, why the decomposition is unique — the lesson's own mechanism block explains why substitution and coefficient-comparison are both valid (§1.1 below restates that in one line and cites it), but nowhere in this course is there a direct proof that they must always agree.
  2. Explain the mechanism behind the one sub-case the spec explicitly excludes — an irreducible quadratic factor — rather than only citing that it is excluded (§1.4).
  3. Cover the one application spec 2.1's own guidance names that has zero coverage anywhere else in this course: differentiation. Integration (spec 6.3) and series expansion (spec 4.1) each already have a full worked treatment; differentiation has none, in the lesson, the formula bank or the FORGE guide, despite being named in the same guidance sentence as the other two (§3.3).

Scope boundary, confirmed against the facts bank rather than assumed: this document stays inside spec 2.1 (decomposition) and 6.3 (the integration it feeds), the same two points the lesson file covers. It does not extend into spec 4.1's binomial-series machinery beyond citing where the lesson already connects the two.


1. The theoretical model

1.1 What licenses the two solving methods (restated in one line, not re-derived)

A partial-fraction decomposition is asserted with ≡\equiv, not ==: a claim that two expressions are identical for every value of xx, not merely equal for some. That single fact is the entire justification for both cover-up substitution (safe to evaluate the identity at any xx, including a root of the original denominator) and coefficient comparison (two polynomials identical for every xx must have identical coefficients). The lesson file's own mechanism block derives this in full; it is not repeated here.

1.2 Why a decomposition exists at all: a counting argument

For a denominator built from kk distinct linear factors (degree kk), spec 2.1 requires a proper numerator — degree at most k−1k-1, i.e. kk independent coefficients to match (xk−1x^{k-1} down to x0x^0). Assume the decomposition ∑iAi(factori)\sum_i \frac{A_i}{(\text{factor}_i)} and clear denominators: the numerator becomes ∑iAi×(product of every OTHER factor)\sum_i A_i\times(\text{product of every OTHER factor}), a polynomial of degree exactly k−1k-1 carrying kk unknown constants AiA_i. Equations and unknowns match exactly — kk coefficients to satisfy, kk free constants to satisfy them with. This is the same counting logic the lesson file's own mechanism block already applies to the repeated-factor case (there, a degree-3 denominator with one repeated factor needs three unknowns to match three coefficients, which is why a single term for the repeated factor is never enough) — restated here at the level of the general distinct-factor case it generalises, rather than re-derived for the specific repeated case the lesson already owns.

1.3 Why the decomposition, once it exists, is unique — a direct proof

Existence (§1.2) shows the counting works out; it does not by itself show two different candidate decompositions can't both be correct. This is checkable directly, and is genuine additive content — no document in this course currently proves it. Suppose two decompositions of the same proper fraction over kk distinct linear factors both held:

∑iAix−ri=∑iAi′x−ri.\sum_i \frac{A_i}{x-r_i} = \sum_i \frac{A_i'}{x-r_i}.

Subtracting and clearing denominators gives a polynomial identity, true for every xx:

∑i(Ai−Ai′)× ⁣ ⁣∏j≠i(x−rj)=0for all x.\sum_i (A_i-A_i')\times\!\!\prod_{j\neq i}(x-r_j) = 0 \quad\text{for all } x.

Evaluate this at x=r1x=r_1: every term in the sum except the i=1i=1 term contains the factor (x−r1)(x-r_1) explicitly and vanishes; the surviving term is (A1−A1′)×∏j≠1(r1−rj)(A_1-A_1')\times\prod_{j\neq1}(r_1-r_j), and that product is nonzero precisely because the kk roots are distinct. A product equal to zero with a nonzero factor forces the other factor to be zero: A1=A1′A_1=A_1'. The same substitution at r2,…,rkr_2,\dots,r_k in turn forces every remaining constant to match. This is exactly why the cover-up rule always produces the unique right answer, rather than one of several possible answers: distinctness of the roots is not a convenience for the method, it is the fact that makes the decomposition unique in the first place. For a repeated root the same argument extends (evaluate the cleared identity's own derivative at the repeated root to isolate the next constant, rather than the identity itself a second time) but is not spelled out in full here, since the counting argument in §1.2 and the lesson's own repeated-factor mechanism block already establish the practical version a P4 student needs.

1.4 Why an irreducible quadratic factor is genuinely excluded, not arbitrarily excluded

Spec 2.1's guidance names the boundary directly: a denominator factor of the shape (x2+a)(x^2+a) with a>0a>0 is not required on this paper. The lesson file cites this exclusion and shows the one worked contrast (xx2+5\frac{x}{x^2+5}, handled by recognition rather than decomposition); neither it nor the formula bank states the mathematical reason the boundary sits exactly there. It is this: cover-up substitution needs a real root of the factor being isolated — a value of xx that sends that one bracket to zero while every other bracket in the identity survives. A linear factor ax+bax+b always has exactly one, at x=−bax=-\frac{b}{a}. A quadratic factor x2+ax^2+a with a>0a>0 has discriminant −4a<0-4a<0: no real root exists, so there is no real value of xx that isolates a constant sitting over it the way cover-up isolates every other constant in this topic. The general algebraic theory does have a matching form for this case — a linear numerator over the quadratic factor, Px+Qx2+a\frac{Px+Q}{x^2+a}, two unknowns rather than one — but solving for PP and QQ needs coefficient-comparison or complex substitution, neither of which is P4 content, which is exactly why the spec draws the line where it does: every technique this paper actually teaches (cover-up by a real root, or coefficient-comparison against a linear/repeated-linear assumed form) depends on the denominator factoring completely over the reals into linear pieces. x2+5x^2+5 does not, so it was never a partial-fractions question at all — it is handled by recognition instead, precisely because no real factorisation exists to decompose.


2. The three required sub-cases — restated compactly, each with a short original micro-example

Full worked chains, marked solutions and trap-taxonomy for all three already exist in the lesson file; the micro-examples below use different numbers from every one of the lesson's own worked examples, specifically so nothing here could be mistaken for a reproduction of that file's content.

2.1 Three distinct linear factors

Spec 2.1 names the shape (ax+b)(cx+d)(ex+f)(ax+b)(cx+d)(ex+f) directly. Micro-example: 2x2+5x−1(x−1)(x+1)(x+2)\dfrac{2x^2+5x-1}{(x-1)(x+1)(x+2)} decomposes, by cover-up at x=1x=1, x=−1x=-1, x=−2x=-2 in turn, to

1x−1+2x+1−1x+2\frac{1}{x-1}+\frac{2}{x+1}-\frac{1}{x+2}

(verified by clearing denominators and confirming the recombined numerator matches term by term — every numeric claim in this document was checked this way before being written in, the same discipline the lesson file's own header states for its content). This specific decomposition is reused, not re-derived, in §3 below to build the "one decomposition, three applications" synthesis.

2.2 One repeated linear factor

Spec 2.1's other named shape, (ax+b)(cx+d)2(ax+b)(cx+d)^2. Micro-example: 3x2−6x+9(x+1)(x−2)2\dfrac{3x^2-6x+9}{(x+1)(x-2)^2} decomposes to

2x+1+1x−2+3(x−2)2.\frac{2}{x+1}+\frac{1}{x-2}+\frac{3}{(x-2)^2}.

The repeated root x=2x=2 isolates the highest-power constant (here, 3) directly by cover-up in one substitution, exactly as the lesson's own method-comparison demonstrates; the middle constant (1) still needs either a second convenient value or coefficient comparison, for the counting reason given in §1.2.

2.3 Numerator degree ≥\geq denominator degree

Spec 2.1 states this is a required case, not an edge case. Micro-example, degree of numerator equal to degree of denominator: x2+x−1(x−1)(x+2)\dfrac{x^2+x-1}{(x-1)(x+2)}. Dividing x2+x−1x^2+x-1 by (x−1)(x+2)=x2+x−2(x-1)(x+2)=x^2+x-2 gives a quotient of 11 and a remainder of 11 (since (x2+x−1)−(x2+x−2)=1(x^2+x-1)-(x^2+x-2)=1), so

x2+x−1(x−1)(x+2)=1+1(x−1)(x+2)=1+13(x−1)−13(x+2).\frac{x^2+x-1}{(x-1)(x+2)} = 1+\frac{1}{(x-1)(x+2)} = 1+\frac{1}{3(x-1)}-\frac{1}{3(x+2)}.

The lesson file's own worked example for this sub-case uses long division and the identity method side by side on a different numerator; this micro-example exists only to keep §2's three sub-cases parallel in one place, not to re-run that comparison.


3. One decomposition, three applications — the synthesis spec 2.1's own guidance asks for directly

Spec 2.1's guidance closes with one sentence naming all three uses this decomposition is ever put to on this paper: integration, differentiation, series expansion. The lesson file and formula bank each cover integration and series expansion — with different worked examples for each, never the same one run through all three. This section reuses §2.1's own decomposition,

f(x)=2x2+5x−1(x−1)(x+1)(x+2)≡1x−1+2x+1−1x+2,f(x)=\frac{2x^2+5x-1}{(x-1)(x+1)(x+2)} \equiv \frac{1}{x-1}+\frac{2}{x+1}-\frac{1}{x+2},

for all three, which is the genuinely new structural contribution this section makes: showing that one decomposition is the shared starting point spec 2.1's guidance sentence is actually describing, not three unrelated skills that happen to share a name.

3.1 Integration (cited, not re-derived)

∫f(x) dx=ln⁡∣x−1∣+2ln⁡∣x+1∣−ln⁡∣x+2∣+c.\int f(x)\,dx = \ln|x-1| + 2\ln|x+1| - \ln|x+2| + c.

Every 1a\frac1a scaling factor here is trivially 11 (each bracket's xx-coefficient already is), so this particular decomposition does not itself exercise the two-series-confirmed 1a\frac1a-omission slip the lesson's own marked solution is built around (Oct 2022, Q2; Jan 2024, Q2(b) — see §4). It is included here only to complete the three-application picture; the lesson file remains the place for the fully worked, error-anchored integration treatment.

3.2 Series expansion (cited, not re-derived)

Expanding f(x)f(x) in ascending powers of xx about x=0x=0 uses the same (1+u)n(1+u)^n machinery the lesson's own spec-4.1 block already drills in full (factor a constant from each bracket, apply the general binomial series, sum the three resulting series, take the tightest of the three individual validity conditions). For this decomposition the individual conditions are ∣x∣<1|x|<1 (from the x−1x-1 factor), ∣x∣<1|x|<1 (from the x+1x+1 factor) and ∣x∣<2|x|<2 (from the x+2x+2 factor), so the combined range is ∣x∣<1|x|<1 — the same "most-restrictive-of-the-three" rule the lesson's own worked chain already establishes and is not re-derived here.

3.3 Differentiation — the genuine content gap this document fills

No document in this course currently works this application, despite spec 2.1 naming it in the same breath as the other two. There is no examiner-report or mark-scheme citation for it anywhere in the facts bank either — this is stated plainly rather than dressed up as exam-sourced, per this course's own no-fabrication discipline (§5 below repeats the point explicitly).

Differentiating the decomposed form is direct chain-rule work on three single-power terms, with no quotient rule required at all:

f′(x)=−1(x−1)2−2(x+1)2+1(x+2)2.f'(x) = -\frac{1}{(x-1)^2} - \frac{2}{(x+1)^2} + \frac{1}{(x+2)^2}.

Differentiating the original quotient form directly would instead require the quotient rule (or the product rule on a factored denominator raised to −1-1) on a degree-2-over-degree-3 rational function in one un-split step — mechanically riskier, with more terms to track in a single application, for the identical result. This is the real content of "partial fractions as an application to differentiation": decomposition does not just simplify the algebra of finding an antiderivative, it does the same simplifying work for a derivative, turning one compound-quotient differentiation into three short chain-rule applications, each of the same shape as ddx ⁣[(x−a)−1]=−(x−a)−2\frac{d}{dx}\!\left[(x-a)^{-1}\right]=-(x-a)^{-2}. A genuine use for this beyond the mechanical saving: locating where f′(x)=0f'(x)=0 (a stationary point of the original rational function) is a three-term equation in the decomposed form rather than a single quotient-rule numerator that would otherwise need expanding out to a common denominator first — the decomposition is doing real algebraic work before any calculus-specific step happens at all.


4. Synthesis — every real exam angle this specific topic has actually been tested from

Restricted strictly to spec 2.1/6.3, the facts bank's question-level review yields exactly three real, citable angles, across three series — confirmed as 3 of 7 series that received real question-by-question mining, per this course's own SIGNAL document, with no single confirmed total mark size captured for a partial-fractions question in either source document.

Series, questionReal angle testedWhat the report/scheme actually documentsSub-case (§2)
Oct 2021, Q3(a)Decomposition with numerator degree ≥\geq denominator degree, long division vs. the identity methodA sign lost forming the remainder, quoted directly: "set the numerator of the partial fraction equal to 6 rather than -6"§2.3
Oct 2022, Q2Decomposition feeding directly into integration, in one questionThe 1a\frac1a scaling factor dropped on a ln-form integral, quoted directly: "a common error was to omit the ½"§2.1/§2.2 into §3.1
Jan 2024, Q2(a)–(b)Decomposition of a repeated-linear-factor denominator, then integrating it(a) Simultaneous equations confirmed "more prone to error than attempts via substitution"; a distinct error multiplying by the repeated factor one power too many; (b) the same 1a\frac1a-omission slip, independently, a series apart§2.2 into §3.1

What this table adds beyond SIGNAL's frequency row and FORGE's checklist: those two documents record that three angles exist and list the trap-taxonomy names for each. This table is the first place in the technique-hub layer that maps each real angle onto the specific sub-case (§2.1–§2.3) it exercises — the same connective role this technique-hub's implicit/parametric-differentiation deep-dive already establishes for its own topic.


5. What is genuinely not evidenced — stated rather than invented

This is the honest shape of the evidence for this topic: three real citations across three series, a counting/uniqueness argument and an exclusion mechanism that are genuine mathematics rather than exam citations, and one spec-named application with no documented exam angle at all. The facts bank's own §7 does not list this topic among those with "enough verified material for a genuine standalone lesson" — consistent with why this document is the length it is rather than longer, and why §5 is as explicit as it is about where the real record stops.


Cross-references (cited, not duplicated)

Sources used

research/veridian/WMA14-verified-facts.md §1 (spec 2.1/4.1/6.3 verbatim text), §3 (formula-booklet contents), §5.2 (the three real citations synthesised in §4: Oct 2021 Q3(a), Oct 2022 Q2, Jan 2024 Q2(a)–(b)), §6 (series-reviewed scope, used for §4's "3 of 7" figure via SIGNAL's own re-derivation), §7 (confirms this topic is not on the "enough material for a standalone lesson" list), §8 (evidence-strength flags). signal-frequency-and-boundaries.md §1 (the frequency-table row for this topic, re-cited exactly, not re-derived). No new primary Pearson document was fetched this session; §1.2–§1.4 and §3.3 are original mathematical/pedagogical exposition grounded in the spec's own text rather than in an exam citation, and are labelled as such at each point they appear.