Defining Multiplication in Polynomials over Rings of Matrices More explicitly, if $M_{2 \times 2}(\mathbb{R})[x]$ denotes the ring of polynomials over the ring of 2x2 matrices with real coefficients (with indeterminate x a 2 by 2 matrix with real coefficients), how do i properly define multiplication?  e.g. suppose $A_0,A_1,B_0,B_1 \in M_{2 \times 2}(\mathbb{R})$, and let $f[x] = A_0 + A_1x$ and $g[x] = B_0 + B_1x$ be elements of $M_{2 \times 2}(\mathbb{R})[x]$.  Then I would assume the product $fg[x]$ would be   
$
fg[x] = (A_0 + A_1x)(B_0 + B_1x) = A_0B_0 + A_0B_1x + A_1xB_0 + A_1xB_1x
$
But then complications arise due to $M_{2 \times 2}(\mathbb{R})$ being non-commutative.  As far as I know (I've only taken one course so far on abstract algebra), this ring is well-defined (in that a polynomial ring can have coefficients in any ring, not just commutative ones).  I've checked google, wikipedia, etc and haven't found anything relevant to this topic.  Is there any standard literature on this topic? 
My plan was to eventually be able to investigate cases in which unique factorizations may hold (if any), or maybe polynomials having unique left or right inverses, etc.  
 A: I have two answers for you, depending on what you have in mind.
You want to add an $x$ to the ring of 2x2 matrices, such that while $x$ commutes with multiples of the identity, it doesn't commute with anything else.  You can adjoin a noncommuting indeterminate by using what's called the free product.  You take the two rings $M_2(\mathbb{R})$ and $\mathbb{R}[x]$, and then you form the free product over $\mathbb{R}$.  Wikipedia has an entry on the free product of groups.  The construction for rings is fairly similar.
That construction has one weakness: $x$ will not satisfy any relations.  There relations that all 2x2 matrices will satisfy, but $x$ in the free product won't.  Rings all of whose elements satisfy identities are known as polynomial identity rings.  For example, any four 2x2 matrices satisfy an identity of degree four (described in this blog post).  So any three elements of $M_2(\mathbb{R})$ and $x$ should satisfy that relation.  (I don't know if all possible relations are generated from specializing this one relation.  There could be other relations that rely on specific properties of specific matrix elements.)
A: Ben has already answered the question in the comments by noting that the indeterminate $x$ commutes with elements of $M_2(\mathbb{R})\subseteq M_2(\mathbb{R})[x]$. But I wanted to add some comments because the construction of polynomial rings is a subtle business.
The polynomial ring $R[x]$ should be thought of a ring containing $x$ and a subring isomorphic to $R$, such that $R$ commutes with $x$, and an element $a_0 + a_1x + \cdots +a_nx^n\in R[x]$ is zero if and only if each $a_i\in R$ is zero. Note that this implies that the indeterminate $x$ is transcendental over $R$, that is, $x$ is not a root of any polynomial with nonzero coefficients in $R$. In your example, this cannot be true if $x$ is an element of $M_2(\mathbb{R})$.
A good reference treating the construction of $R[x]$ for an arbitrary rings $R$ (and lots more besides) is Hungerford's Algebra book.
A: There are already issues with $f[X] =X$ and $g[X] =B_0$. (I switched the variable to upper case, that seems less confusing in this context) Then $fg$ can not be written as $A_0 + A_1X$. So you have to allow "coefficents" on both sides and even between. Addition $AXB+CXD$ would also be a problem. 
