Every automorphism fixes zero and one, and preserves sums, products, negatives and multiplicative inverses of nonzero elements. Consequently elements fixed by every member of are closed under these operations and form a field. Artin fixed-field theorem gives for a finite automorphism group.
Here is the fraction field of , with transcendental; its elements are fractions of rational-coefficient polynomials, with nonzero denominator and the usual equality by cross-multiplication. Substitution of or defines an automorphism, each its own inverse. With meaning first apply to a field element and then , its image on is . Iterating gives and then , so its order is three. The relations reduce every word to at most six possibilities, and the six resulting images areThey are distinct rational functions, so the group has six elements. Its faithful permutation action on identifies it with .
For the first fixed field put . It is fixed by , and satisfies over . The degree is exactly two because the nontrivial automorphism fixes that field. The fixed-field degree is also two, soFor the inversion put . It is fixed and satisfies . The same degree argument givesThe source requests polynomial generators in both cases. The second requirement is impossible. If a nonconstant polynomial were fixed by inversion, would equate a Laurent polynomial with highest exponent to one with no positive exponent, a contradiction. Thus the only polynomial invariants of inversion are constants, which cannot generate its nonconstant fixed field. The fixed field of inversion in a rational function field therefore has the second displayed rational-function generator.
Clearing the denominators in the rational interpolation conditions givesThese are linear equations for unknowns. The th row of the coefficient matrix, in the order , isThis rational interpolation linearization is equivalent to the original fraction conditions only if at every interpolation node. If , the cleared equation merely forces , leaving the fraction undefined.
For , the coefficient row becomesThis is the Vandermonde matrix, whose determinant is . Equivalently, a vector in its null space would define a degree-at-most- polynomial vanishing at all distinct interpolation nodes, which is zero by the preceding uniqueness proof. Thus the cleared linear system has exactly one solution.
There is also a constructive description of that solution. Define the monic polynomialThe polynomial is monic of degree and vanishes at every interpolation node. It must therefore equal . By polynomial division, write uniquelyThe quotient is monic of degree , andis the unique coefficient solution. This does not assert that is nonzero at every interpolation node.
For a counterexample with , , choose and the specified data , so . The cleared equations reduce togiving the unique solution , . But at the quotient is . Indeed, any genuine rational interpolant of this prescribed form would need ; then forces the constant numerator to be zero. At a nonzero denominator its value at would also be zero, never one. Cancelling the common factor in the cleared candidate would merely give the identically zero rational function, which still fails the data. Hence
Suppose a rational function , with nonzero polynomials , had th power . Then , so comparison of degrees would give , impossible modulo . Thus has no root in , and part (b) proves it is irreducible.
In a splitting field containing with ,It has one distinct root with multiplicity , so it is inseparable. This is the purely inseparable polynomial over a rational function field.
Suppose a rational function , with nonzero polynomials , had th power . Then , so comparison of degrees would give , impossible modulo . Thus has no root in , and part (b) proves it is irreducible.
In a splitting field containing with ,It has one distinct root with multiplicity , so it is inseparable. This is the purely inseparable polynomial over a rational function field.
Not near the minimum at . The derivative being set to zero factors asso has multiplicity of a root equal to three. The ordinary Newton iteration at a multiple root is generally only linearly convergent, with error ratio here.
In fact, cancellation in gives the exact error identity, away from the original undefined quotient at the root,For iterates approaching , the factor tends to , proving linear convergence. The other zero of at is simple and could instead give quadratic local convergence; the failure at is due to its multiplicity, not to every stationary point of this rational function.
Polynomial factor Created 2026-10-05 Updated 2026-11-05
A polynomial factor of a polynomial satisfies for another polynomial . Common polynomial factors are cancelled when expressing a rational function in reduced form; its degree of a rational map of the Riemann sphere is determined after this cancellation.
A meromorphic function on the plane with outside a disc has no poles there and only finitely many poles inside. Subtract their finite principal parts to obtain an entire function. For , Cauchy estimates make every derivative of order above vanish, so the remainder is a polynomial. For the remainder tends to zero at infinity and is zero by Liouville theorem. Adding back the principal parts gives a rational function in either case.
Prime Weil divisor Created 2026-09-24 Updated 2026-11-05
A prime Weil divisor on a Noetherian integral scheme is an integral closed subscheme of codimension one. Its generic point has a one-dimensional local ring .
If is a normal variety, this local ring is a one-dimensional Noetherian normal domain, hence a discrete valuation ring. More generally it suffices that this local ring be regular. A uniformizer then writes every nonzero rational function as with a unit, giving its integer order along the divisor. This is the valuation used in the principal Weil divisor construction.[ref]
The Stacks project. Lemma 10.119.7, tag 00PD: equivalence of DVR, one-dimensional regular local ring and one-dimensional Noetherian normal local domain
The codimension-one definition alone does not imply regularity. On the cusp , the closed point is a prime Weil divisor. Its local ring has a maximal ideal requiring two generators, as its quotient by the square has basis . It is therefore not a discrete valuation ring. Passing to the normalization supplies a different local ring with uniformizer ; normality is a substantive hypothesis, not part of the definition of every prime divisor.
Principal Cartier divisor 2026-10-05
A principal Cartier divisor is represented on every chart by the same nonzero rational function. It is linearly equivalent to zero and has zero intersection number with every complete curve.
Principal divisor on an algebraic curve Created 2026-09-24 Updated 2026-10-03
For a nonzero rational function on a smooth projective curve , its principal divisor isIt records the zeros of with positive multiplicity and its poles with negative multiplicity. Every principal divisor has degree zero.
Proper rational transfer function 2026-10-14
A proper rational transfer function is a rational function whose numerator polynomial has polynomial degree no greater than its denominator polynomial, after common factors are canceled. Every finite-dimensional continuous-time linear time-invariant system of the form , has such a transfer function . [ref]
https://ocw.mit.edu/courses/6-241j-dynamic-systems-and-control-spring-2011/996025f6db0d90b00f11c44fc49b85f9_MIT6_241JS11_textbook.pdf. Dahleh, Dahleh and Verghese, Lectures on Dynamic Systems and Control, section 15.3.1
Quotient of polynomial division Created 2026-10-14 Updated 2026-10-18
In polynomial division over a field, the polynomial quotient is the polynomial . The polynomial remainder has smaller polynomial degree than the nonzero divisor unless it is zero.
In the notation , the polynomial quotient is instead named . It is a polynomial determined by the divisor and the polynomial degree bound. The pointwise ratio of the associated polynomial functions satisfiesFor the worked example, , while ; the correction is . Thus a polynomial quotient need not equal the rational function . At and , the pointwise ratio is undefined, but the polynomial quotient still has perfectly well-defined values. When , the divisor is a polynomial factor of and the ratio agrees with wherever .
For a degree- rational function of the Riemann sphere, choose relatively prime homogeneous polynomials of degree . Their joint norm on the unit three-sphere has positive lower and finite upper bounds. Thus is bounded. Averaging over a circle using a nonvanishing entire homogeneous lift of a meromorphic function proves the displayed law for the spherical characteristic. Jensen's formula and show that it also holds for the ordinary Nevanlinna characteristic.
Rational differential on an algebraic curve 2026-10-03
A rational differential on a smooth projective curve is a rational section of its canonical bundle. In a local coordinate it has the form for a rational function .
Rational interpolant 2026-10-25
A rational interpolant is a rational function agreeing with given data at every interpolation node. If the representation is required to have no zero denominator at those nodes, this condition is part of the problem, in addition to the degree restrictions. Even when removable common factors are cancelled before evaluation, the resulting rational function must still take the prescribed values. For example, at the data there is no interpolant : the first value forces when its denominator is nonzero, and then the second value cannot be one. The cleared equations nevertheless have the unique coefficient solution .
Rational interpolation 2026-10-25
Rational interpolation seeks a rational function with prescribed bounds on the polynomial degrees of its numerator and denominator and prescribed values at distinct interpolation nodes. A rational interpolant must have a well-defined value at each interpolation node. With a specified numerator-denominator representation, this requires for every . A normalization such as a monic polynomial denominator removes the common scaling freedom but does not guarantee existence or uniqueness. Multiplying by a zero denominator can create spurious solutions to the rational interpolation linearization.
Rational parametrization of an algebraic curve Created 2026-10-06 Updated 2026-10-07
A rational parametrization expresses the coordinates of an algebraic curve as rational functions of a parameter, with a rational inverse on a dense open subset. It identifies the function field with and the smooth projective normalization of an algebraic curve with the projective line. A nonconstant parametrizing map without an inverse is a weaker notion; even this cannot exist for an elliptic curve in characteristic zero.
Residue Created 2026-09-24 Updated 2026-10-13
The residue of a function at an isolated singularity is its Laurent coefficient of degree . More explicitly, if is holomorphic for , write its Laurent series asThis one Laurent coefficient determines the contour integral around a sufficiently small counterclockwise circle about . A complicated local Laurent series can therefore leave a remarkably simple answer after one complete trip around the point.
For a simple pole, multiplying by removes the pole, leaving a holomorphic extension whose value at is the residue:There is a useful shortcut for a quotient . If and are holomorphic near , has a simple zero there, and , then has a simple pole andThe first-order Taylor series of explains the denominator: dividing by leaves its derivative at in the limit. This computes a residue without finding the full Laurent series, which is especially useful when the numerator or denominator is complicated. [ref]
For example, the rational function has simple poles at and . Factoring the denominator makes both residues immediately visible:The signs matter: these residues cancel when both poles are enclosed, but either one contributes when enclosed alone. The residue theorem below turns this distinction into different contour integrals of the same function.
A residue is not the same thing as a pole, nor does it measure the order of a pole. The function has a double pole at zero but residue zero. Conversely,has an essential singularity at zero and residue one. Infinitely many negative powers cause no difficulty in reading off that particular Laurent coefficient. At a removable singularity the residue is zero. [ref]
Why does only this Laurent coefficient survive? Parametrize a counterclockwise circle by , , with . For every integer ,When , the complex exponential completes a whole number of turns and its contributions cancel; when , it is constant. Uniform convergence of the Laurent series on this circle justifies termwise integration, giving . Thus the residue isolates exactly the local information that a closed contour integral detects. [ref]
This selection rule explains why a very large value near an isolated singularity need not produce a large contour integral. The double pole grows faster near zero than , yet its contributions around a circle cancel completely. What matters is the arrangement of complex values along the path, including the differential , rather than their moduli alone. A residue records that surviving contribution, not the size of the function near the point.
Residue theorem Created 2026-09-24 Updated 2026-10-13
Let be a piecewise smooth contour forming a simple closed curve, positively oriented: travel counterclockwise, with the interior on the left. Suppose is holomorphic on an open set containing and its interior, except at finitely many isolated singularities strictly inside. ThenNo isolated singularity may lie on : the ordinary contour integral must be defined there. Reversing the direction of the contour reverses the sign of the answer. The theorem applies to essential singularities as well as poles. [ref]
Return to . A counterclockwise circle encloses both simple poles, soYet is nonzero everywhere it is defined. A zero contour integral does not imply a zero function, or even absence of poles: the enclosed residues can cancel. By contrast, the counterclockwise circle encloses only , givingThe picture compares these two selections. Changing the shape of a contour while keeping the same enclosed poles leaves the contour integral unchanged, provided the contour deformation stays where is holomorphic.
This is the practical appeal of the residue theorem: local Laurent coefficients determine a global contour integral. For a rational function, a few simple pole computations can replace a long parametrized calculation. It also makes real improper integrals accessible by treating the real line as part of a closed contour in the complex plane.
To compute , take and travel along the real line from to , then return along the upper semicircle , parametrized by for . This contour is positively oriented and encloses the simple pole only; is outside. HenceThe added arc must be controlled before taking a limit. On , the reverse triangle inequality gives , and the arc length is . The estimation lemma therefore yieldsThe denominator grows quadratically while the arc length grows only linearly. This quantitative comparison, rather than a sketch alone, explains why closing the contour does not alter the limiting real improper integral. It even supplies an error bound: the difference between and the finite real integral is at most .
For a numerical check, gives the finite real integral , leaving about to reach . The arc bound is , comfortably larger than that error. The graph shows both quantities approaching zero. The exact tail here can be checked with the antiderivative ; the residue theorem method remains useful for improper integrals where a convenient real antiderivative is unavailable.
Finally, both one-sided improper integrals converge absolutely: for , , whose tails are integrable. Thus the symmetric limit computes the ordinary improper integral, not merely a Cauchy principal value, andClosing below instead would enclose the simple pole . With the same left-to-right traversal of the real line, that contour is clockwise, so its contour integral is again. This provides a useful sign check: the opposite residue is accompanied by the opposite direction around the enclosed region.
The same strategy extends to many other rational functions: choose a contour, identify its enclosed isolated singularities, compute their residues, and bound the added pieces. The choice of contour and the bound are as much part of the calculation as the residues. [ref]

