You may omit the proof of this theorem and you will still be able to learn the technique of partial fractions. This proof is presented here for completeness, and is a fairly easy consequence of Fundamental Theorem of Algebra and of the Euclidean algorithm for polynomials.
According to Fundamental Theorem of algebra the polynomial \(B\) can be factored in linear and quadratic terms. Hence there are real number \(K\), real numbers \(p\) and \(q\), sequences of real numbers \((\alpha_i)_{i=1}^p\), \((\beta_i)_{i=1}^q\), \((\gamma_i)_{i=1}^q\), and sequences of positive integers \((s_i)_{i=1}^p\) and \((t_i)_{i=1}^q\) such that all \(\alpha_i\) are distinct, all pairs \((\beta_i,\gamma_i)\) are distinct, and
\[B(x)=K\cdot \prod_{i=1}^p (x+\alpha_i)^{s_i}\cdot \prod_{i=1}^q \left((x+\gamma_i)^2+\beta_i^2\right)^{t_i}.\]
The factors \((x+\alpha_i)^{s_i}\), \left((x+\gamma_j)^2+\beta^j\right)^{t_j} are mutually relatively prime polynomials. If \(P(x)\) and \(Q(x)\) are relatively prime then according to euclidean algorithm applied to polynomials there are polynomials \(U\) and \(V\) such that \(1=U(x)P(x)+V(x)Q(x)\). This is equivalent to \[\frac1{P(x)Q(x)}=\frac{V(x)}{P(x)}+\frac{U(x)}{Q(x)}.\] Using induction we get a sequence of polynomials \(U_1(x)\), \(\dots\), \(U_{p}(x)\), \(V_1(x)\), \(\dots\), \(V_q(x)\) such that \[\frac1{B(x)}=\sum_{i=1}^{p}\frac{U_i(x)}{(x+\alpha_i)^{s_i}}+\sum_{i=1}^q\frac{V_i(x)}{\left((x+\gamma_i)^2+\beta_i\right)^{t_i}}.\] Therefore we have
\[\frac{A(x)}{B(x)}=\sum_{i=1}^{p}\frac{A(x)U_i(x)}{(x+\alpha_i)^{s_i}}+\sum_{i=1}^q\frac{A(x)V_i(x)}{\left((x+\gamma_i)^2+\beta_i\right)^{t_i}}.\]
It remains to prove the following two propositions:
- Proposition 1. Each of the fractions \(\displaystyle \frac{A(x)U_i(x)}{(x+\alpha_i)^{s_i}}\)
can be represented as a sum of a polynomial and summands of the form
\(\displaystyle \frac{d_i}{(x+\alpha_i)^k}\)
- Proposition 2. Each of the fractions \(\displaystyle \frac{A(x)V_i(x)}{\left((x+\gamma_i)^2+\beta_i\right)^{t_i}}\) can be expressed as a sum of a polynomials and summands of the form
\(\displaystyle \frac{e_ix+f_i}{\left((x+\gamma_i)^2+\beta_i^2\right)^k}\).
The first proposition is proved by introducing the substitution \(y=x+\alpha_i\). We can rewrite \(A(x)U_i(x)=S_i(y)\) for a polynomial \[S_i(y)=q_{i,k_i}y^{k_i}+q_{i,k_i-1}y^{k_i-1}+\cdots + q_{i,0},\] giving us: \[\frac{A(x)U_i(x)}{(x+\alpha_i)^{s_i}}=\frac{S_i(y)}{y^{s_i}}= q_{i,k_i}y^{k_i-s_i}+
q_{i,k_i-1}y^{k_i-s_i-1}+\cdots +q_{i,0}y^{-s_i}\] which is exactly what we wanted to prove.
The second proposition is proved in a similar way. We introduce the substitution \(y=x+\gamma_i\). There exists a polynomial \(T_i\) such that
\(A(x)V_i(x)=T_i(y)\). The polynomial \(T_i(y)\) can be divided by \(\left(y^2+\beta_i^2\right)^{t_i}\) with remainder giving us \(T_i(y)=\left(y^2+\beta_i^2\right)^{t_i} Q_{i,1}(y)+ T_{i,1}(y)\), for some polynomials \(Q_{i,1}(y)\) and \(T_{i,1}(y)\) such that \(\deg T_{i,1} < 2t_i\).
There are polynomials \(Q_{i,2}(y)\) and \(T_{i,2}(y)\) such that \(\deg T_{i,2} < 2(t_i-1)\) and \(T_{i,1}(y)=\left(y^2+\beta_i^2\right)^{t_i-1}Q_{i,2}(y)+ T_{i,2}(y)\). Since the degree of the polynomial \(T_{i,1}\) was at most \(2t_i-1\) we see that the degree of \(Q_{i,2}\) is at most 1. Continuing by induction we get a sequence of polynomials \(Q_{i,1}\), \(Q_{i,2}\), \(\dots\), \(Q_{i,t_i}\) such that \(\deg Q_{i,j}\leq 1\) for all \(j\geq 2\) and
\[T_i(y)=\left(y^2+\beta_i^2\right)^{t_i} Q_{i,1}(y)+\left(y^2+\beta_i^2\right)^{t_i-1} Q_{i,2}(y)+ Q_{i,t_i+1}(y),\]
and degree of each of \(Q_{i,j}\) is at most 1 for \(j\geq 2\). Dividing both sides by \(\displaystyle \left(y^2+\beta_i^2\right)^{t_i} \) yields
\[\frac{T_i(y)}{\left(y^2+\beta_i^2\right)^{t_i} }=Q_{i,1}(y)+\frac{Q_{i,2}(y)}{y^2+\beta_i^2}+\frac{Q_{i,3}(y)}{\left(y^2+\beta_i^2\right)^{2}}+\cdots +
\frac{Q_{i,t_i+1}(y)}{\left(y^2+\beta_i^2\right)^{t_i} }.\]
This proves Proposition 2 and completes the proof of the theorem.