Math 2.0

concept

Partial fraction decomposition

Summary

Partial fraction decomposition writes a rational function as a sum of a polynomial and simple fractions. Let KK be a field, and let P/QP/Q be a rational function with P,Q∈K[X]P, Q \in K[X] and Q≠0Q \neq 0. Assume that Q=∏i=1rqimiQ = \prod_{i=1}^{r} q_i^{m_i}, where the qiq_i are distinct monic irreducible polynomials. Then there are unique polynomials BB and AijA_{ij}, with deg⁡Aij<deg⁡qi\deg A_{ij} < \deg q_i, such that PQ=B+∑i=1r∑j=1miAijqi j.\frac{P}{Q} = B + \sum_{i=1}^{r} \sum_{j=1}^{m_i} \frac{A_{ij}}{q_i^{\,j}}.

Remarks

Example: 11−x−x2=15(φ1−φx−ψ1−ψx)\frac{1}{1 - x - x^2} = \frac{1}{\sqrt{5}} \left( \frac{\varphi}{1 - \varphi x} - \frac{\psi}{1 - \psi x} \right), with φ\varphi and ψ\psi the roots of X2−X−1X^2 - X - 1. In combinatorics it gives the coefficients of a rational generating function. Each term 11−ax\frac{1}{1 - ax} expands as a geometric series.

Explanations

L1 human

A complicated fraction of polynomials splits into a sum of simple fractions. For example, 1x(x+1)=1x−1x+1\frac{1}{x(x+1)} = \frac{1}{x} - \frac{1}{x+1}.

What this node needs for W2
  • edge defines in: at least one definition (0 of 1)
  • edge instance_of in: at least two examples (0 of 2)
  • edge not_instance_of in: at least one non-example (0 of 1)
  • edge specializes both: the more general notions and the special cases (0 of 1)

The writing levels say how complete the text of a node is. They do not measure its truth.

Sources

  1. Web https://en.wikipedia.org/wiki/Partial_fraction_decomposition, Basic principles