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 . In this case, one speaks of a rational function and a rational fraction over . The values of the variables may be taken in any field containing . 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 .
The set of rational functions over a field is a field, the field of fractions of the ring of the polynomial functions over .
A function
f
f(x)=
| P(x) | |
| Q(x) |
where
P
Q
x
Q
f
x
Q(x)
However, if
styleP
styleQ
styleR
styleP=P1R
styleQ=Q1R
f1(x)=
| P1(x) | |
| Q1(x) |
,
which may have a larger domain than
f
f
f.
f
f1
f
f1.
| style | A(x) |
| B(x) |
| style | C(x) |
| D(x) |
A(x)D(x)=B(x)C(x)
| style | P(x) |
| Q(x) |
| style | P1(x) |
| Q1(x) |
.
A proper rational function is a rational function in which the degree of
P(x)
Q(x)
Q.
There are several non equivalent definitions of the degree of a rational function.
Most commonly, the degree of a rational function is the maximum of the degrees of its constituent polynomials and, when the fraction is reduced to lowest terms. If the degree of is, then the equation
f(z)=w
has distinct solutions in except for certain values of, called critical values, where two or more solutions coincide or where some solution is rejected at infinity (that is, when the degree of the equation decreases after having cleared the denominator).
In the case of complex coefficients, a rational function with degree one is a Möbius transformation.
The degree of the graph of a rational function is not the degree as defined above: it is the maximum of the degree of the numerator and one plus the degree of the denominator.
In some contexts, such as in asymptotic analysis, the degree of a rational function is the difference between the degrees of the numerator and the denominator.[1] [2]
In network synthesis and network analysis, a rational function of degree two (that is, the ratio of two polynomials of degree at most two) is often called a .[3]
The rational function
f(x)=
| x3-2x | |
| 2(x2-5) |
is not defined at
x2=5\Leftrightarrowx=\pm\sqrt{5}.
It is asymptotic to
\tfrac{x}{2}
x\toinfty.
The rational function
f(x)=
| x2+2 | |
| x2+1 |
is defined for all real numbers, but not for all complex numbers, since if x were a square root of
-1
f(i)=
| i2+2 | |
| i2+1 |
=
| -1+2 | |
| -1+1 |
=
| 1 | |
| 0 |
,
which is undefined.
A constant function such as is a rational function since constants are polynomials. The function itself is rational, even though the value of is irrational for all .
f(x)=P(x)
Q(x)=1.
f(x)=\sin(x),
Every Laurent polynomial can be written as a rational function while the converse is not necessarily true, i.e., the ring of Laurent polynomials is a subring of the rational functions.
The rational function
f(x)=\tfrac{x}{x}
The coefficients of a Taylor series of any rational function satisfy a linear recurrence relation, which can be found by equating the rational function to a Taylor series with indeterminate coefficients, and collecting like terms after clearing the denominator.
For example,
| 1 | |
| x2-x+2 |
=
| infty | |
| \sum | |
| k=0 |
akxk.
Multiplying through by the denominator and distributing,
1=(x2-x+2)
| infty | |
| \sum | |
| k=0 |
akxk
1=
| infty | |
| \sum | |
| k=0 |
akxk+2-
| infty | |
| \sum | |
| k=0 |
akxk+1+
| infty | |
| 2\sum | |
| k=0 |
akxk.
After adjusting the indices of the sums to get the same powers of x, we get
1=
| infty | |
| \sum | |
| k=2 |
ak-2xk-
| infty | |
| \sum | |
| k=1 |
ak-1xk+
| infty | |
| 2\sum | |
| k=0 |
akxk.
Combining like terms gives
1=2a0+(2a1-a0)x+
| infty | |
| \sum | |
| k=2 |
(ak-2-ak-1+2ak)xk.
Since this holds true for all x in the radius of convergence of the original Taylor series, we can compute as follows. Since the constant term on the left must equal the constant term on the right it follows that
a0=
| 1 | |
| 2 |
.
Then, since there are no powers of x on the left, all of the coefficients on the right must be zero, from which it follows that
a1=
| 1 | |
| 4 |
ak=
| 1 | |
| 2 |
(ak-1-ak-2) for k\ge2.
Conversely, any sequence that satisfies a linear recurrence determines a rational function when used as the coefficients of a Taylor series. This is useful in solving such recurrences, since by using partial fraction decomposition we can write any proper rational function as a sum of factors of the form and expand these as geometric series, giving an explicit formula for the Taylor coefficients; this is the method of generating functions.
In abstract algebra the concept of a polynomial is extended to include formal expressions in which the coefficients of the polynomial can be taken from any field. In this setting, given a field F and some indeterminate X, a rational expression (also known as a rational fraction or, in algebraic geometry, a rational function) is any element of the field of fractions of the polynomial ring F[''X'']. Any rational expression can be written as the quotient of two polynomials P/Q with Q ≠ 0, although this representation isn't unique. P/Q is equivalent to R/S, for polynomials P, Q, R, and S, when PS = QR. However, since F[''X''] is a unique factorization domain, there is a unique representation for any rational expression P/Q with P and Q polynomials of lowest degree and Q chosen to be monic. This is similar to how a fraction of integers can always be written uniquely in lowest terms by canceling out common factors.
The field of rational expressions is denoted F(X). This field is said to be generated (as a field) over F by (a transcendental element) X, because F(X) does not contain any proper subfield containing both F and the element X.
In complex analysis, a rational function
f(z)=
| P(z) | |
| Q(z) |
is the ratio of two polynomials with complex coefficients, where is not the zero polynomial and and have no common factor (this avoids taking the indeterminate value 0/0).
The domain of is the set of complex numbers such that
Q(z)\ne0
Rational functions are representative examples of meromorphic functions.
Iteration of rational functions (maps)[4] on the Riemann sphere creates discrete dynamical systems.
See main article: Function field of an algebraic variety.
Like polynomials, rational expressions can also be generalized to n indeterminates X1,..., Xn, by taking the field of fractions of F[''X''<sub>1</sub>,..., ''X''<sub>''n''</sub>], which is denoted by F(X1,..., Xn).
An extended version of the abstract idea of rational function is used in algebraic geometry. There the function field of an algebraic variety V is formed as the field of fractions of the coordinate ring of V (more accurately said, of a Zariski-dense affine open set in V). Its elements f are considered as regular functions in the sense of algebraic geometry on non-empty open sets U, and also may be seen as morphisms to the projective line.
Rational functions are used in numerical analysis for interpolation and approximation of functions, for example the Padé approximations introduced by Henri Padé. Approximations in terms of rational functions are well suited for computer algebra systems and other numerical software. Like polynomials, they can be evaluated straightforwardly, and at the same time they express more diverse behavior than polynomials.
Rational functions are used to approximate or model more complex equations in science and engineering including fields and forces in physics, spectroscopy in analytical chemistry, enzyme kinetics in biochemistry, electronic circuitry, aerodynamics, medicine concentrations in vivo, wave functions for atoms and molecules, optics and photography to improve image resolution, and acoustics and sound.
In signal processing, the Laplace transform (for continuous systems) or the z-transform (for discrete-time systems) of the impulse response of commonly-used linear time-invariant systems (filters) with infinite impulse response are rational functions over complex numbers.
. Bourbaki . N. . Nicolas Bourbaki. Algebra II . 1990 . Springer . 3-540-19375-8 . A.IV.20.