Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It only takes a minute to sign up.
Sign up to join this community
In this proof they prove it for fields, but they say that the proof holds for a commutative ring with unity. But why do we need it to be commutative, and why do we need a unity? Why does it not hold if we are only working with a ring?
In the last part of the proof they work with $1$, is this why we need the unity? I guess 1 here is the unity and not the number one, but would this part not work without the unity?
But I do not see where they use commutativity?
As you've noted yourself, the last line of the proof depends on the ring having an $1$ (that it, a multiplicative identity), which is what "ring with unity" means. So even if the theorem were to be true for rings without unity, it can't possibly be so "with the identical proof.
The ring needs to be commutative, because polynomials don't work well over non-commutative rings. For example, the product of two first-degree polynomials would be $$ (aX+b)(cX+d) = aXcX + bcX + aXd + bd $$ but according to the usual rule for the coefficients of a product of polynomials we ought to get $$ acX^2+(bc+ad)X + bd $$ and that's only equal to the above expression if $X$ commutes with $c$ and $d$.
We could still simply declare the polynomial multiplication rule to be valid in the noncommutative case and work with purely formal polynomials, investigating where that leads us. But the cost of doing that is that exactly the theorem you're looking at fails to hold. In more primitive terms, what happens is that the product of the values of two polynomial functions wouldn't equal the value of the product polynomial for the same input, or $p(x)q(x)\ne (pq)(x)$ in general.
Presumably in defining $F[x]$ you're assuming the indeterminate $x$ commutes with everything in $F$, so $(ax)(bx) = abx^2$. We have $\phi_\alpha(ax) = a\alpha$ and $\phi_\alpha(bx) = b\alpha$ but $\phi_\alpha(abx^2) = ab\alpha^2$. If $b$ and $\alpha$ don't commute, this may not be the same as $(a\alpha)(b\alpha)$.
Evaluating $\ a*x = x*a\ $ at $\, x = e\in E\,$ shows that every coefficient $\,a\,$ must commute with every element of the target ring, i.e. the image of $F$ in $E$ is central. It turns out that this necessary condition is sufficient for the evaluation map to be a ring hom.
Remark $\:R\:$-algebras are the rings $\:A\:$ into which one can evaluate $ R[x]$ for every $\:a \in A\:$. More directly, an $\:R$-algebra is just a ring $ A\:$ containing a central subring $ R'$ that's a ring image of $\: R\:,\:$ i.e. $\: R'\:$ is either an embedding of $\:R\:$ or $\:R/I\:$ for some ideal $\;I\in R\:.\;$ Being central is precisely the condition needed for elts in $\:R'\:$ to serve as "coefficients" in the sense that this makes polynomial rings $\: R[x]\:$ be universal $\:R\:$-algebras. Namely, the fact that the coefficients commute with all elts of $\:A\:$ is precisely what is required to make the evaluation map be a ring homomorphism $\: R[x]\to A\:,\:$ viz $\;\; r\; x = x\: r\;$ in $\:R[x]\;\Rightarrow\; r\: a = a\:r\;\;$ by evaluation $\: x\to a\in A,\:$ i.e. by definition polynomial multiplication assumes that the coefficients commute with the indeterminates, so this property must remain true at values of indeterminates if evaluation is to be a ring homomorphism.
