0-Universal Properties

Functions to single object sets

Let A=a be a single element set. For every set X, there exists exactly one function
fX:Xa.

proof: Trivial. the only function is the one that takes each xX to fX(x)=a.


Ring

A ring R is a triple (R,+,) where (R,+) is an abelian group with identity 0R and (R,) is a monoid with identity 1R.
Morover, there are two way distributive laws a(b+c)=(b+c)a=ab+ac.
The cartesian product of n rings i=1nRi with addition and multiplication being element-wise on the tuples, also forms a ring.
A ring is commutative if (R,) is a commutative monoid.

Ring homomorphisms

let (R,+R,R)ϕ(S,+s,s) be a function from ring R to ring S. ϕ is a ring homomorphism if:

  • ϕ(x+Ry)=ϕ(x)+Rϕ(y)
  • ϕ(xRy)=ϕ(x)Rϕ(y)
  • ϕ(1R)=1S (this one needs to be defined, cant be extracted as a result cause multiplication on a ring is a monoid. to prove that ϕ(OR)=Os one uses the inverse available in the addition group, we don't have that luxury in the multiplication monoid).
Polynomial rings

let Nm be the monoid of natural number tuples, with addition (defined as element-wise addition on tuples). define the set of functions P from NmR where R is a commutative ring, with finite support:

P={p:NmR:|p(x)0R|<|N|}

where we have addition and multiplication on P:

(p+Pq)(x):=p(x)+Rq(x)(pPq)(x)=u+v=x         Rp(x)Rq(x)

Closure of addition and multiplication in polynomial rings

For p,qP, both p+q and pq are in P.

proof:
Let S(p)={x:p(x)0}, which is finite by definition.


Polynomial ring multiplication forms a commutative monoid

Multiplication in P is associative, commutative, and has an identity element 1P.

proof:
Associativity:

((pq)r)(x)=u+v=xpq(u)r(v)=u+v=xs+t=up(s)q(t)r(v).

Rearranging the addition (abelian group) and using associativity in R,

((pq)r)(x)=s+t+v=xp(s)q(t)r(v).

Similarly,

(p(qr))(x)=s+t+v=xp(s)q(t)r(v),

so multiplication is associative.

Commutativity:

(pq)(x)=u+v=xp(u)q(v)=u+v=xq(v)p(u)=(qp)(x).

Identity: Define 1P by 1P(0,,0)=1R and 1P(x)=0R otherwise. Then

(1Pp)(x)=u+v=x1P(u)p(v),

but only the term u=(0,,0) contributes, yielding p(x). Thus 1P is the identity.


Polynomial ring addition forms an abelian group

With addition defined as above (pointwise), (P,+) is an abelian group.

proof:


The ring of polynomials is itself a ring

Let R be a commutative ring, and PR be the polynomial ring over R as defined in Polynomial rings . Then PR is itself a commutative ring.

proof:
combine Closure of addition and multiplication in polynomial rings , Polynomial ring multiplication forms a commutative monoid , Polynomial ring addition forms an abelian group
.


Note: Now you may be wondering where are my good old ring of polynomials as expressions R[x1,x2,xm] well, there is a natural isomorphism from PR to R[x1,x2,xm] and I'll leave it to the reader to construct this classical polynomial ring and to find the isomorphism. hint: start with an empty expression, and then for any pPR whenever (t1,t2,..tm)S(p) (the support of p) "add" (as defined in the polynomial expression ring) the term p(t1,t2,tm)x1t1x2t2xmtm to the expression. Since we have a finite support set, we will get a finite polynomial expression. Bijectivity comes from the idea that every pPR is fully defined by its support and the image of its support in the ring, and hence induces a unique expression in R[x1,x2,xm] proving homomorphicity is straightforward but calculative in the sense of writing a good amount of algebraic equations, and that's not really my style.