Polynomials
Now we come to a really nice example of a semigroup ring. Start with the free commutative monoid on 
generators. This is just the product of copies of the natural numbers: 
. Now let’s build the semigroup ring ![\mathbb{Z}[\mathbb{N}^n]](https://s0.wp.com/latex.php?latex=%5Cmathbb%7BZ%7D%5B%5Cmathbb%7BN%7D%5En%5D&bg=e6e6e6&fg=333333&s=0&c=20201002)
on this monoid.
First off, an element of the monoid is an ordered -tuple of natural numbers 
. Let’s write it in the following, more suggestive notation: 
. We multiply such “monomials” just by adding up the corresponding exponents, as we know from the composition rule for the monoid. Now we build the semigroup ring by taking formal linear combinations of these monomials. A generic element looks like
where the 
are integers, and all but finitely many of them are zero.
Assuming everyone’s taken high school algebra, we’ve seen these before. They’re just polynomials in variables with integer coefficients! The addition and multiplication rules are just what we know from high school algebra. The only difference is here we specifically don’t think of 
as a “placeholder” for a number, but as an actual element of our ring.
But we can still use it as a placeholder. Let’s consider any other commutative ring 
with unit and pick elements of . Call them 
, 
, and so on up to 
. Since is a commutative monoid under multiplication there is a unique homomorphism of monoids from to sending to 
. That’s just what it means for to be a free commutative monoid. Now there’s a unique homomorphism of rings from to sending to , because is the semigroup ring of .
The upshot is that is the free commutative ring with unit on generators. Because of this, we’ll usually omit the intermediate step of constructing and just write this ring as ![\mathbb{Z}[x_1,x_2,...,x_n]](https://s0.wp.com/latex.php?latex=%5Cmathbb%7BZ%7D%5Bx_1%2Cx_2%2C...%2Cx_n%5D&bg=e6e6e6&fg=333333&s=0&c=20201002)
.
There are similar constructions to this one that I’ll leave you to ponder on your own. What if we just constructed the free monoid on generators (not commutative)? What about the free semigroup? What sort of rings do we get, and what universal properties do they satisfy?
April 16, 2007 -
Posted by John Armstrong |
Ring theory
The Unapologetic Mathematician 
[…] take 2 As I said before, if we take the free commutative monoid on generators, then build the semigroup ring from that, […]
Pingback by Polynomials, take 2 « The Unapologetic Mathematician | April 20, 2007 |
One nice and easy to check property of the polynomials is that K[X] = Z[X] + K, where “+” is the categorical sum (co-product) in the category of rings in both commutative and non-commutative cases.
furia_krucha, I don’t think that’s quite right for the non-commutative case, since X commutes with elements of K in K[X]. (We have K[X] = K tensor Z[X] in general, but the coproduct in the noncommutative case is not tensor, as you probably know already.)
Thanks for pointing this out Todd, of course it doesn’t work in the non-commutative case, because we are only looking at the homomorphisms K -> R, where image lies in the center of R.
[…] into linear algebra. Specifically, we’ll need to know a few things about the algebra of polynomials. Specifically (and diverging from the polynomials discussed earlier) we’re talking about […]
Pingback by Polynomials I « The Unapologetic Mathematician | July 28, 2008 |
[…] should be no surprise that the symmetric algebra on the dual space is isomorphic to the algebra of polynomial functions on , where the grading is the total degree of a monomial. If has finite dimension , we […]
Pingback by Tensor and Symmetric Algebras « The Unapologetic Mathematician | October 26, 2009 |