# Is \mathbb{C}^{n \times n} algebraically closed?

Inspite of the fact that $C^{n \times n}$ is not a field, is it still possible to talk about it being 'algebraically closed' in the sense that $\forall f \in \mathbb{C}^{n \times n}[x]$ does $\exists A \in \mathbb{C}^{n \times n}$ such that $f(A) = 0$? If so, then is it 'algebraically closed'?

Are there any other non-field sets that this idea can be extended to?

-
The real question is here what $\mathbb{C}^{n\times n}\left[x\right]$ means. With $\mathbb{C}^{n\times n}$ being non-commutative, it is not clear what kind of polynomials you wish to allow. For instance, the Amitsur-Levitzki theorem ( gilkalai.wordpress.com/2009/05/12/… ) gives a nontrivial polynomial relation between any $2n$ matrices in $\mathbb{C}^{n\times n}$; if you replace the right hand side by $1$ rather than $0$, you will get a polynomial that never attains zero (though it is hardly the zero polynomial.) – darij grinberg Feb 1 '10 at 10:29
On the other hand, Ore polynomials (coefficients on the left, powers of $x$ on the right) may have a chance of making the assertion correct. – darij grinberg Feb 1 '10 at 10:30
Ok, suppose we define $f \in \mathbb{C}^{n \times n}[x]$ by $f(x) = \sum_{i=0}^n A_i x^i$ where $A_i \in \mathbb{C}^{n \times n}$, so we do in fact have coefficients on the left, powers of x on the right (this way infact what I was thinking of). Does this help or is there a better definition to use? I would imagine the simplest way to find a counter example would be finding a matrix with no 'square root', i.e. an $A \in \mathbb{C}^{n \times n}$ such that $\forall B \in \mathbb{C}^{n \times n}$, $B^2 \neq A$. – Mark Bell Feb 1 '10 at 10:57
The correct generalization of algebraic closure for commutative rings rings is integral closure. I searched on google and found that there is a notion of integrality for NCRs, but I don't know what the requirements are. – Harry Gindi Feb 1 '10 at 11:03
@harry: we are in the noncommutative case. – Martin Brandenburg Feb 1 '10 at 11:46

The matrix $\left( \begin{array}{cc} 0 & 1 \\\\ 0 & 0 \end{array} \right)$ has no square root.
Polynomials make sense for continuous complex functions on a space. If that space is $\mathbb R$, then polynomial equations with complex coefficients are solvable. If that space is $\mathbb C$ or $S^1$ then $g^2 = f$ may not be solvable.
And so $f(x) = \left(\begin{array}{cc}1 & 0 \\ 0 & 1 \\ \end{array}\right) x^2 - \left(\begin{array}{cc}0 & 1 \\ 0 & 0 \\ \end{array}\right) = 0$ has no root over $\mathbb{C}^{n \times n}$. Hence $\mathbb{C}^{n \times n}[x]$ is not 'algebraically closed'. – Mark Bell Feb 1 '10 at 11:52