A rational fraction over K (=R or C) is a quotient F=BA with A,B∈K[X], B=0; two quotients BA and B′A′ are identified when AB′=A′B. Every fraction has a reduced form with gcd(A,B)=1, unique up to constants. With the natural operations, the set K(X) of rational fractions is a field.
The poles of F (in reduced form) are the roots of B; the order of a pole is its multiplicity as a root of B. The degree of F is degF=degA−degB∈Z∪{−∞}.
Examples
Example 9.2 (Reading off poles, orders and degree)
Let F=X4−2X3+X2X3−X. Factor both layers: numerator X(X−1)(X+1), denominator X2(X−1)2; cancel the common factor X(X−1):
F=X(X−1)X+1(reduced form).
Poles: 0 and 1, both simple — the orders are read on the reduced denominator, so the apparent double roots of the original one are irrelevant. Degree: degF=1−2=−1, visible asymptotically (xF(x)→1 as x→∞). The degree behaves like the polynomial degree (degFG=degF+degG, deg(F+G)≤max), a bookkeeping rule used constantly in the coefficient hunts below: each “limit of xF(x)” argument is a degree count in disguise.
Example 9.4 (Reduce first, then divide)
Find the integer part of F=X2−1X3+1. Dividing blindly: X3+1=(X2−1)X+(X+1), so F=X+X2−1X+1. But the fraction was not reduced: X3+1=(X+1)(X2−X+1) and X2−1=(X+1)(X−1) share the factor X+1, and
F=X−1X2−X+1=X+X−11:
the same integer part X, but the fractional part collapses to a single brick, and the “pole” at −1 was never a pole at all. Always reduce to lowest terms before hunting poles: the poles of F are the roots of the reduced denominator. (The integer part is insensitive to the simplification, as the uniqueness in Proposition 9.3 guarantees.)
Example 9.8
Decompose F=X(X−1)(X−2)1. Three simple poles; cover-up at each:
c0=(0−1)(0−2)1=21,c1=1×(1−2)1=−1,c2=2×11=21,
so F=X1/2−X−11+X−21/2. Check at X=3: directly, F(3)=3⋅2⋅11=61; from the decomposition, 31/2−21+11/2=61−21+21=61.