In mathematics, a rational function is any function that can be defined by a rational fraction, which is an algebraic fraction such that both the numerator and the denominator are polynomials. The coefficients of the polynomials need not be rational numbers; they may be taken in any field K. In this case, one speaks of a rational function and a rational fraction over K. The values of the variables may be taken in any field L containing K. Then the domain of the function is the set of the values of the variables for which the denominator is not zero, and the codomain is L. The set of rational functions over a field K is a field, the field of fractions of the ring of the polynomial functions over K.
Definitions A function f {\displaystyle f} is called a rational function if it can be written in the form
f ( x ) = P ( x ) Q ( x ) {\displaystyle f(x)={\frac {P(x)}{Q(x)}}}
where P {\displaystyle P} and Q {\displaystyle Q} are polynomial functions of x {\displaystyle x} and Q {\displaystyle Q} is not the zero function. The domain of f {\displaystyle f} is the set of all values of x {\displaystyle x} for which the denominator Q ( x ) {\displaystyle Q(x)} is not zero. However, if P {\displaystyle \textstyle P} and Q {\displaystyle \textstyle Q} have a non-constant polynomial greatest common divisor R {\displaystyle \textstyle R} , then setting P = P 1 R {\displaystyle \textstyle P=P_{1}R} and Q = Q 1 R {\displaystyle \textstyle Q=Q_{1}R} produces a rational function
f 1 ( x ) = P 1 ( x ) Q 1 ( x ) , {\displaystyle f_{1}(x)={\frac {P_{1}(x)}{Q_{1}(x)}},}
which may have a larger domain than f {\displaystyle f} , and is equal to f {\displaystyle f} on the domain of f . {\displaystyle f.} It is a common usage to identify f {\displaystyle f} and f 1 {\displaystyle f_{1}} , that is to extend "by continuity" the domain of f {\displaystyle f} to that of f 1 . {\displaystyle f_{1}.} Indeed, one can define a rational fraction as an equivalence class of fractions of polynomials, where two fractions A ( x ) B ( x ) {\displaystyle \textstyle {\frac {A(x)}{B(x)}}} and C ( x ) D ( x ) {\displaystyle \textstyle {\frac {C(x)}{D(x)}}} are considered equivalent if A ( x ) D ( x ) = B ( x ) C ( x ) {\displaystyle A(x)D(x)=B(x)C(x)} . In this case P ( x ) Q ( x ) {\displaystyle \textstyle {\frac {P(x)}{Q(x)}}} is equivalent to P 1 ( x ) Q 1 ( x ) . {\displaystyle \textstyle {\frac {P_{1}(x)}{Q_{1}(x)}}.}
… excerpt ends here. Continue reading the full article.






