Polynomial Rings
Arun Ram
Department of Mathematics and Statistics
University of Melbourne
Parkville, VIC 3010 Australia
aram@unimelb.edu.au
Last updates: 14 February 2011
Polynomial rings
Definition.
- Let be a commutative ring and for each
let
be a formal symbol. A polynomial with coefficients in in is an expression of the form
such that
- for
- There exists a positive integer such that
for all .
- Let be a commutative ring. Polynomials
and
with coefficients in are equal if
- The zero polynomial is the polynomial
- The degree, , of a polynomial
with coefficients in is the smallset nonnegative integer such that
and
for all . If
then we define .
- Let be a commutative ring. The ring of polynomials withe coefficients in is the set
of polynomials with coefficients in with the operations of addition and multiplication as defined as follows:
If
where
and
then
Let be a commutative ring. Then is a commutative ring.
Let be an integral domain. Then is an integral domain.
The following theorem is a deep theorem which will be proved at the end of this section.
Let be a unique factorization domain. Then is a unique factorization domain.
The following is an important theorem which shows that if is a field then is a Euclidean domain, and therefore, by Theorem 1.3, that is a principal ideal domain.
Let be a field. The ring is a Euclidean domain with size function given by
Let be commutative rings and
be a ring homomorphism. Then the map
is a ring homomorphism.
Adjoining elements to , the rings
Definition.
- Let be a commutative ring and let . The evaluation map
is the map given by
where, if
then
Let be a commutative ring and let . Then the evaluation homomorphism
is a ring homomorphism.
Definition
- Let be a commutative ring. Let be a subring and let
. Let
be the evaluation homomorphism given by evaluating at . The ring adjoined
is the subring of given by
HW: Prove that
is a subring of .
HW: Let be a commutative ring. Let be a subring and let show that the ring is the subring of consisting of all elements of the form
where and is a nonnegative integer.
Proof of Theorem 1.3
Definition. Let be a unique factorization domain. A polynomial
is primitive if there does not exist any such that divides all of the coefficients
of .
(Gauss' Lemma) Let be a unique factorization domain. Let
be primitive polynomials. Then is a primitive polynomial.
Let be a unique factorization domain. Let be the field of fractions of and let . Then
- There exists an element and a primitive polynomial
such that
- The factors and are unique up to multiplication by a unit.
- is irreducible in if and only if is irreducible in .
Let be a unique factorization domain. Then is a unique factorization domain.
References
[CM]
H. S. M. Coxeter and W. O. J. Moser, Generators and relations for discrete groups,
Fourth edition. Ergebnisse der Mathematik und ihrer Grenzgebiete [Results in Mathematics and Related Areas], 14. Springer-Verlag, Berlin-New York, 1980.
MR0562913 (81a:20001)
[GW1]
F. Goodman and H. Wenzl,
The Temperly-Lieb algebra at roots of unity, Pacific J. Math. 161 (1993), 307-334.
MR1242201 (95c:16020)
page history