Polynomial ring: Difference between revisions
Jump to navigation
Jump to search
imported>Richard Pinch (New entry, building on advanced page) |
imported>Richard Pinch (→Construction of the polynomial ring: explain exponential notation) |
||
Line 26: | Line 26: | ||
We have | We have | ||
:<math>X^2 = (0,0,1,0,\ldots) \,</math> | :<math>X^2 = X \star X = (0,0,1,0,\ldots) \,</math> | ||
:<math>X^3 = (0,0,0,1,0,\ldots) \,</math> | :<math>X^3 = X \star X \star X = (0,0,0,1,0,\ldots) \,</math> | ||
and so on, so that | and so on, so that |
Revision as of 16:28, 22 December 2008
In algebra, the polynomial ring over a commutative ring is a ring which formalises the polynomials of elementary algebra.
Construction of the polynomial ring
Let R be a ring. Consider the R-module of sequences
which have only finitely many non-zero terms, under pointwise addition
We define the degree of a non-zero sequence (an) as the the largest integer d such that ad is non-zero.
We define "convolution" of sequences by
Convolution is a commutative, associative operation on sequences which is distributive over addition.
Let X denote the sequence
We have
and so on, so that
which makes sense as a finite sum since only finitely many of the an are non-zero.
The ring defined in this way is denoted .
Properties
- If R is commutative then so is R[X].
- If R is an integral domain then so is R[X].
- In this case the degree function satisfies .
- If R is a unique factorisation domain then so is R[X].
- If R is a Noetherian domain then so is R[X].
- If R is a field, then R[X] is a Euclidean domain.