Polynomial

In algebra, a polynomial function, or polynomial for short, is a function of the form

where x is a scalar-valued variable, n is a nonnegative integer, and a₀,...,a_n are fixed scalars, called the coefficients of the polynomial f. The highest occurring power of x (n if the coefficient a_n is not zero) is called the degree of f; its coefficient is called the leading coefficient. Where the leading coefficient is 1, we describe the polynomial as monic. a₀=f(0) is called the constant coefficient of f. Each summand of the polynomial of the form a_k x^k is called a term. Here the variable x is, properly speaking, an indeterminate; it is on occasion replaced by something other than a scalar (some matrix or operator, for example). Monomials, binomials and trinomials are special cases of polynomials with one, two and three terms respectively. The polynomial can be written in sigma notation as:\n: In calculus, the scalars are almost always real or complex numbers.

Table of contents

1 Polynomials of low degree 2 Polynomials and calculus 3 Efficient evaluation 4 Roots 5 Formulae for roots 6 Several variables 7 Complexity 8 Abstract algebra 9 Divisibility 10 More variables 11 Special polynomials

Polynomials of low degree

Polynomials of\n* degree 0 are called constant functions,\n* degree 1 are called linear functions,\n* degree 2 are called quadratic functions,\n* degree 3 are called cubic functions,\n* degree 4 are called quartic functions and\n* degree 5 are called quintic functions. Examples of polynomials of low degree: \n\n\n\n\n\n\n\n\n The function\n:
\nis an example of a cubic function with leading coefficient -7 and constant coefficient 3.

Polynomials and calculus

Note that the polynomials of degree ≤ n are precisely those functions whose (n+1)st derivative is identically zero. One important aspect of calculus is the project of analyzing complicated functions by means of \napproximating them with polynomials. The culmination of these efforts \nis Taylor's theorem,\nwhich roughly states that every differentiable function locally\nlooks like a polynomial, and the \nStone-Weierstrass theorem, which states that every continuous function defined on\na compact interval of the real axis can be approximated on the whole interval\nas closely as desired by a polynomial. Polynomials are also frequently used to interpolate functions. Quotients of polynomials are called rational functions. Piecewise rationals are\nthe only functions that can be evaluated directly on a computer,\nsince typically only the operations of addition, multiplication,\ndivision and comparison are implemented in hardware. All the other functions\nthat computers need to evaluate, such as trigonometric functions,\nlogarithms and exponential functions, must then be approximated in software by suitable piecewise\nrational functions.

Efficient evaluation

In order to determine function values of polynomials for given values of the\nvariable x, one does not apply the polynomial as a formula\ndirectly, but uses the much more efficient Horner scheme\ninstead. If the evaluation of a polynomial at many equidistant points\nis required, Newton's difference method\nreduces the amount of work dramatically. The \nDifference Engine of\nCharles Babbage was designed to create large tables of values of logarithms\nand trigonometric functions automatically by evaluating approximating\npolynomials at many points using Newton's difference method.

Roots

A root or zero of the polynomial f(x) is a number r such that f(r) = 0. Determining the roots of polynomials, or "solving algebraic equations", is among the oldest problems in mathematics. Some polynomials, such as f(x) = x² + 1, do not have any roots among the real numbers. If however the set of allowed candidates is expanded to the complex numbers, every (non-constant) polynomial has a root (see Fundamental Theorem of Algebra). Approximations for the real roots of a given polynomial can be found using\nNewton's method, or more efficiently using Laguerre's method which employs complex arithmetic and can locate all complex roots. These root-finding algorithms are studies in numerical analysis.

Formulae for roots

There is a difference between approximating roots and finding concrete\nclosed formulas for them. Formulas for the roots of polynomials of\ndegree up to 4 have been known since the sixteenth century (see quadratic formula, Cardano, Tartaglia). But formulas for degree 5 eluded researchers for a long time. In 1824, Abel proved the striking result that there can be no general formula (involving only the arithmetical operations and radicals) for the roots of a polynomial of degree ≥ 5 in terms of its coefficients (see Abel-Ruffini theorem). This result marked the start of Galois theory which\nengages in a detailed study of relations among roots of polynomials.

Several variables

In multivariate calculus, polynomials in several variables play an important role. These are the simplest multivariate functions and can be defined using addition and multiplication alone. An example of a polynomial in the variables x, y, and z is

The total degree of such a multivariate polynomial can be gotten by adding the exponents of the variables in every term, and taking the maximum. The above polynomial f(x,y,z) has total degree 6.

Complexity

In computer science, we say that a polynomial of highest order n has a running time of O(xⁿ), see Big O notation. For example, take the polynomials:

\n:

We say this polynomial has order O(x⁴). From the definition of order, |f(x)| ≤ C |g(x)| for all x>1, where C is a constant. Proof:\n:         where x > 1\n:     because x³ < x⁴, and so on.\n:\n: From the definition of O-notation above, the polynomial 6x⁴-2x³+5 is in O(x⁴)

Abstract algebra

In abstract algebra, one must take care to distinguish between\npolynomials and polynomial functions. A polynomial f is defined to be a formal expression of the form

where the coefficients a₀, ... , a_n are elements\nof some ring R and X is considered to be a formal symbol. Two polynomials are considered to be equal if and only if the sequences of their coefficients are equal. Polynomials with coefficients in R can be added by simply adding corresponding coefficients and multiplied using the distributive law and the rules

  for all elements a of the ring R

  for all natural numbers k and l.

One can then check that the set of all polynomials with coefficients\nin the ring R forms itself a ring, the ring of polynomials over R,\nwhich is denoted by R[X]. If R is commutative, then R[X] is an\nalgebra over R. One can think of the ring R[X] as arising from R\nby adding one new element X to R and only requiring that X commute\nwith all elements of R. In order for R[X] to form a ring, all sums of powers of X have to be included as well. Formation of the polynomial ring, together with forming factor rings by factoring out ideals, are important tools for constructing new rings out of known ones.\nFor instance, the clean construction of finite fields involves the use of those operations, starting out with the field of integers modulo some prime number as the coefficient ring R (see modular arithmetic). To every polynomial f in R[X], one can associate a \npolynomial function with domain and range equal to R. One obtains the value of\nthis function for a given argument r by everywhere replacing the symbol X in f's\nexpression by r. The reason that algebraists have to distinguish\nbetween polynomials and polynomial functions is that over some rings R\n(for instance over finite fields), two different\npolynomials may give rise to the same polynomial function. This is not\nthe case over the real or complex numbers and therefore analysts don't\nseparate the two concepts.

Divisibility

In commutative algebra, one major focus of study is divisibility \namong polynomials. If R is an integral domain and f and g are polynomials in R[X], we say that f divides g if there exists a polynomial q in R[X] such that f q = g. One can then show that "every zero gives rise to a linear factor", or more formally: if f is a polynomial in R[X] and r is an element of R such\nthat f(r) = 0, then the polynomial (X - r) divides f. The converse is also true.\nThe quotient can be computed using the Horner scheme. If F is a field and f and g are polynomials in F[X] with g ≠ 0, then there exist polynomials q and r in F[X] with \n:\nand such that that the degree of r is smaller than the degree of g. The polynomials q and r are uniquely determined by f and g. This is called "division with remainder" or "polynomial long division" and shows that the ring F[X] is a Euclidean domain. Analogously we can define polynomial "primes" (more correctly, irreducible polynomials) which cannot be factorized into the product of two polynomials of lesser degree. Depending on the degree of the polynomial to be considered, simply checking if the polynomial has linear factors can eliminate several cases, and then resorting to checking divisibility of some other irreducible polynomials, however Eisenstein's criterion can be used to more efficiently determine irreducibility.

More variables

One also speaks of polynomials in several variables, obtained by\ntaking the ring of polynomials of a ring of polynomials: R[X,Y] =\n(R[X])[Y] = (R[Y])[X]. These are of fundamental importance in\nalgebraic geometry which studies the simultaneous zero sets of\nseveral such multivariate polynomials. Polynomials are frequently used to encode information about some other object. The characteristic polynomial of a matrix or linear operator contains information about the operator's eigenvalues. The minimal polynomial of an algebraic element records the simplest algebraic relation satisfied by that element. Other related objects studied in abstract algebra are formal power series, which are like\npolynomials but may have infinite degree, and the \nrational functions, which are ratios of polynomials.

Special polynomials

See also:\n* Polynomial sequence\n* Chebyshev polynomials\n* Ehrhart polynomial (It is appropriate that this title is singular although some of the other special polynomials named after persons that are listed here are plural, because those are special polynomial sequences.)\n* Hermite polynomials\n* Hurwitz polynomial (It is appropriate that this title is singular although some of the other special polynomials named after persons that are listed here are plural, because those are special polynomial sequences.)\n* Legendre polynomials\n* Polynomial interpolation\n* Binomial type\n* Sheffer sequence\n* List of polynomial topics Category:Complex analysis\nCategory:Algebra \nCategory:Abstract algebra \n \n \n \n\n \n \n \n