Polynomial/Advanced: Difference between revisions

From Citizendium
Jump to navigation Jump to search
imported>Barry R. Smith
mNo edit summary
imported>Barry R. Smith
(insert definition from main page)
Line 8: Line 8:


There are many possible equivalent approaches to defining polynomials.  For instance, they can be defined as the [[convolution algebra]] of the [[monoid]] of non-negative powers of the generator ''X'' of a cyclic group.  This method also allows one to define non-commuting polynomial rings, and to view polynomials in one variable as a special case.  Alternatively, polynomials can be defined as [[infinite sequence]]s of coefficients such that all but a finite number of coefficients are equal to zero.  This approach is useful because it allows one to view a polynomial ring as a [[subring]] of a [[ring of formal power series]].  This is the approach that will be used in this article.
There are many possible equivalent approaches to defining polynomials.  For instance, they can be defined as the [[convolution algebra]] of the [[monoid]] of non-negative powers of the generator ''X'' of a cyclic group.  This method also allows one to define non-commuting polynomial rings, and to view polynomials in one variable as a special case.  Alternatively, polynomials can be defined as [[infinite sequence]]s of coefficients such that all but a finite number of coefficients are equal to zero.  This approach is useful because it allows one to view a polynomial ring as a [[subring]] of a [[ring of formal power series]].  This is the approach that will be used in this article.
Let us consider some expressions like <math>X^2-2X+1</math>, <math>\frac{1}{2}X^3+X-\sqrt{2}</math>, or <math>2X^5-3X^2+1</math>. We can write all of them as follows:
: <math>X^2-2X+1=1+(-2)X+1X^2+0X^3+0X^4+\cdots,</math>
: <math>\frac{1}{2}X^3+X-\sqrt{2}=-\sqrt{2}+1X+0X^2+\frac{1}{2}X^3+0X^4+\cdots,</math>
: <math>2X^5-3X^2+1=1+0X+(-3)X^2+0X^3+0X^4+2X^5+0X^6+\cdots.</math>
This suggests that a polynomial can be entirely defined by giving a sequence of numbers, which are called its ''coefficients'', all of them being zero from some rank. For instance the three polynomials above can be written respectively <math>(1,-2,1,0,0,\cdots)</math>, <math>\left(-\sqrt{2},1,0,\frac{1}{2},0,\cdots\right)</math>, and <math>(1,0,-3,0,0,2,0,\cdots)</math>, the dots meaning the sequence continues with an infinity of zeros. This leads to the definition below.
'''Definition.''' A ''polynomial'' <math>P</math>, over the ring <math>R</math> is a sequence <math>P=\left(a_0,a_1,a_2,\cdots,a_n,\cdots\right)</math> of elements of <math>R</math>, called the ''coefficients'' of <math>P</math>, this sequence containing only a finite number of nonzero terms. The rank of the last nonzero term is called the ''degree'' of the polynomial.
Hence, the degrees of the three polynomials given above are respectively 2, 3 and 5. By convention, the degree of <math>(0,0,\cdots)</math> is set to <math>-\infty</math>.
This definition may surprise the reader, because in reality, one thinks of a polynomial as an expression of the form <math>a_0+a_1X+a_2X^2+\cdots+a_nX^n</math> rather than <math>\left(a_0,a_1,a_2,\cdots ,a_n,\cdots\right)</math>. We will progressively show how to return to this usual way of writing a polynomial. First, we identify any element <math>a_0</math> of the ring to the polynomial <math>\left(a_0,0,0,\cdots\right)</math>. For instance, we write only <math>7</math> instead of the cumbersome <math>\left(7,0,0,\cdots\right)</math>, (or in the familiar fashion <math>7+0X+0X^2+\cdots</math>).
Secondly, we merely denote by <math>X</math> the polynomial
<center><math>X=\left(0,1,0,0,\cdots\right)</math>.</center>
This is natural, as in the familiar fashion this sequence corresponds to <math>0+1X+0X^2+0X^3+\cdots</math> It remains to give a sense to <math>X^2</math>, <math>X^3</math>, etc. This will be made in the next two subsections.


== Polynomials versus polynomial functions ==
== Polynomials versus polynomial functions ==


It may be convenient to think of a polynomial as a function of its variables, that is, <math>x\mapsto x^2-2x+1</math> or <math>(x,y)\mapsto x^2+y^2</math>. Such a function is called a [[polynomial function]]. But in reality, both concepts are different, the unspecified variables being purely ''formal'' entities when one thinks of an abstract polynomial, whereas they are meant to be replaced by ''any number'' when one thinks of a function. The distinction is important in [[abstract algebra]], because what we have called "constant numbers" is more generally replaced by any [[ring (mathematics)|ring]], and for some rings the two concepts cannot be identified. There is not such a problem with polynomials over rings of usual numbers like [[integer]]s, [[rational number|rational]], [[real number|real]] or [[complex number|complex]] numbers. Still it is important to understand that calculations with polynomials can be conceived in an only formal way, without giving any special ontological status to the variables. To make the distinction clear, it is common in algebra to denote the abstract variables with capital letters (<math>X</math>, <math>Y</math>, etc.), while variables of functions are still denoted with lowercase letters. We will use this convention in what follows.
It may be convenient to think of a polynomial as a function of its variables, that is, <math>x\mapsto x^2-2x+1</math> or <math>(x,y)\mapsto x^2+y^2</math>. Such a function is called a [[polynomial function]]. But in reality, both concepts are different, the unspecified variables being purely ''formal'' entities when one thinks of an abstract polynomial, whereas they are meant to be replaced by ''any number'' when one thinks of a function. The distinction is important in [[abstract algebra]], because what we have called "constant numbers" is more generally replaced by any [[ring (mathematics)|ring]], and for some rings the two concepts cannot be identified. There is not such a problem with polynomials over rings of usual numbers like [[integer]]s, [[rational number|rational]], [[real number|real]] or [[complex number|complex]] numbers. Still it is important to understand that calculations with polynomials can be conceived in an only formal way, without giving any special ontological status to the variables. To make the distinction clear, it is common in algebra to denote the abstract variables with capital letters (<math>X</math>, <math>Y</math>, etc.), while variables of functions are still denoted with lowercase letters. We will use this convention in what follows.

Revision as of 14:39, 22 December 2008

In algebra, a polynomial is, roughly speaking, a formal expression obtained from constants (called coefficients) and one or more variables by making a finite number of additions, subtractions and multiplications. For instance, is a polynomial of one variable with integer coefficients, whereas is a polynomial of two variables with real number coefficients.

Two binary operations, called addition and multiplication are defined on the set of polynomials. These operations, in turn, are defined using addition and multiplication operations on the coefficients. Thus, the most general context where one can define polynomials that can be added and multiplied using the usual definitions is when the coefficients are drawn from a set with two binary operations. To ensure that addition and multiplication of polynomials have useful properties, typically the coefficients are restricted to be in a commutative ring with identity. This is by far the most useful type of polynomial, and will be the type of polynomial considered in this article. However, various noncommutative analogs of polynomials, including rings of twisted polynomials (in which constants do not necessarily commute with variables during polynomial multiplication) and non-commuting polynomials (where the variables do not commute with each other) are useful in some specialized contexts.

Definition

Polynomials in one variable

There are many possible equivalent approaches to defining polynomials. For instance, they can be defined as the convolution algebra of the monoid of non-negative powers of the generator X of a cyclic group. This method also allows one to define non-commuting polynomial rings, and to view polynomials in one variable as a special case. Alternatively, polynomials can be defined as infinite sequences of coefficients such that all but a finite number of coefficients are equal to zero. This approach is useful because it allows one to view a polynomial ring as a subring of a ring of formal power series. This is the approach that will be used in this article.

Let us consider some expressions like , , or . We can write all of them as follows:

This suggests that a polynomial can be entirely defined by giving a sequence of numbers, which are called its coefficients, all of them being zero from some rank. For instance the three polynomials above can be written respectively , , and , the dots meaning the sequence continues with an infinity of zeros. This leads to the definition below.

Definition. A polynomial , over the ring is a sequence of elements of , called the coefficients of , this sequence containing only a finite number of nonzero terms. The rank of the last nonzero term is called the degree of the polynomial.

Hence, the degrees of the three polynomials given above are respectively 2, 3 and 5. By convention, the degree of is set to .

This definition may surprise the reader, because in reality, one thinks of a polynomial as an expression of the form rather than . We will progressively show how to return to this usual way of writing a polynomial. First, we identify any element of the ring to the polynomial . For instance, we write only instead of the cumbersome , (or in the familiar fashion ).

Secondly, we merely denote by the polynomial

.

This is natural, as in the familiar fashion this sequence corresponds to It remains to give a sense to , , etc. This will be made in the next two subsections.

Polynomials versus polynomial functions

It may be convenient to think of a polynomial as a function of its variables, that is, or . Such a function is called a polynomial function. But in reality, both concepts are different, the unspecified variables being purely formal entities when one thinks of an abstract polynomial, whereas they are meant to be replaced by any number when one thinks of a function. The distinction is important in abstract algebra, because what we have called "constant numbers" is more generally replaced by any ring, and for some rings the two concepts cannot be identified. There is not such a problem with polynomials over rings of usual numbers like integers, rational, real or complex numbers. Still it is important to understand that calculations with polynomials can be conceived in an only formal way, without giving any special ontological status to the variables. To make the distinction clear, it is common in algebra to denote the abstract variables with capital letters (, , etc.), while variables of functions are still denoted with lowercase letters. We will use this convention in what follows.