The fundamental theorem of algebra (FTA) asserts that any polynomial with complex coefficients has a root in the field of complex numbers. In a different form, it was stated by Albert Girard in 1629 and René Descartes in 1637. Colin MacLaurin and Leonard Euler gave a formulation, that is proven equivalent to the previous one. According to FTA, any polynomial with real coefficients can be decomposed into a product of linear and quadratic factors with real coefficients. In modern terms, the theorem says that the field $\mathbb{C}$ of complex numbers is algebraically closed (a polynomial with coefficient in $\mathbb{C}$ has solutions in $\mathbb{C}$). Tentatives of proof were given by d’Alembert (1746), Euler, Laplace, Lagrange, and others in the second half of the 18th century. Carl Friedrich Gauss was the first to prove the theorem in an almost complete way. He gave four different proofs, the first in 1799 and the last in 1849 (almost at the end of his life). He was never satisfied with his proofs. Namely, the theorem involves some form of topological properties, not rigorously defined in Gauss’ time, related to the completeness of complex numbers (having the limits of all their Cauchy sequences). Many proofs are available now, deduced by algebraic, topological, and complex analysis arguments. (see [1,2,3,4,5,6] for detailed accounts of the history and proofs of the theorem). We recall that: i) ${\mathbb{C}}^n$ is the product of n copies of the complex plane; ii) according to the Heine-Borel theorem [7,8], any bounded and closed set of ${\mathbb{C}}^n$ is a compact set; iii) for any continuous function f from ${\mathbb{C}}^n$ into ${\mathbb{C}}^n$, the image of a compact set is a compact set too; iv) the image of the frontier $\partial X$ of a compact subset X of ${\mathbb{C}}^n$ coincides with the frontier of the image $f\left(X\right)$ (the images of internal points of X are internal points of the image).

A formulation of the fundamental theorem of algebra is the following.

This formulation is equivalent to claim the surjectivity of the Polynomial coefficient function $F^n$: Namely, if $F^n$ is surjective, then we can conclude that the complex coefficients of any nth-degree polynomial are the image of the Polynomial coefficient function applied to n complex numbers (the polynomial roots). In symbols, if $F^n$ è surjective and $P\left(x\right)=b_0{x}^n+b_1{x}^{n-1}+b_2{x}^{n-2}+\dots +b_n$ there exists a vector $(a_1,a_2,\dots ,a_n)$ such that $(b_1/b_0,b_2/b_0,\dots ,b_n/b_0)=F^n(a_1,a_2,\dots ,a_n)$, that is: In a sense, the function $F^n$ inverts the equation-solving process in that of equation-making. Of course, $F^n$ is easy to compute from the roots, while equation-solving is, in general, very difficult to obtain ($F^n$ is a one-way encoding). Here we develop a proof of $F^n$ surjectivity by combining basic notions of general topology in hyperspaces of any finite dimension over complex numbers and a recurrent equation holding for $F^n$.

We know that a metric complete space such as ${\mathbb{C}}^n$ contains all the limits of Cauchy sequences in the space, and any closed subset of the space, is complete [7,8]. Therefore, for any closed and bounded set X of ${\mathbb{C}}^n$, $F(\partial X)=\partial F\left(X\right)$.

Let $\rho \left(F\left(H_m\right)\right)$ be the radius of $F\left(H_m\right)$, as the minimum norm (distance from the origin) reached by the points of the frontier $\partial F\left(H_m\right)$ of $F\left(H_m\right)$.

We will prove that, for $E\in \partial H_m$, $\parallel F\left(E\right)\parallel \ge \parallel mu\parallel -1$. This means that for increasing values of m the radius of $F\left(H_m\right)$ grows illimitably so that any vector in ${\mathbb{C}}^n$ is an image of F, whence the surjectivity of F follows.

In the following, we use $n+1$ rather than n (with no loss of generality because n is a generic value, and the theorem we are proving holds trivially for $n=1$).

Let $a\in \mathbb{C}$, we denote by $[a,E]$ the vector of ${\mathbb{C}}^{n+1}$ extending $E\in {\mathbb{C}}^n$, such that: and, for $k=1,\dots ,n$: Symmetrically, for $k=1,\dots ,n$: and: The following equations easily derive from the definition (1) of F, for $k=0,\dots ,n$, with $F_0\left(E\right)=1$ and $F_{n+1}\left(E\right)=0$:

which explicitly gives all the following equations:

Then, from the definitions of $[a,E]$, $[E,a]$, the equations above are synthesized, for any $a\in \mathbb{C}$, and $a\ne 0$, by the Recurrent Coefficient Equation:

Now, let $E\in \partial H_m\subset {\mathbb{C}}^{n+1}$, then we can suppose with no loss of generality (the order of components is not relevant in the determination of the F-image) that $E=[a_1,A_n]$, with $A_n=(a,a_2,\dots a_n)$ where $-mu\le a\le mu$ and $a_i=\pm mu$, for $i=1,2,\dots ,n$, that is, E is a point of the edge between vertices $(a_1,mu,a_2,\dots a_n)$ and $(a_1,-mu,a_2,\dots a_n)$ of $H_m$. According to the Recurrent Coefficient Equation (4) the following inequalities hold, which give a lower bound of the radius $\rho \left(F\left(H_m\right)\right)$:

In conclusion, the radius of $F\left(H_m\right)$ grows with m, therefore any of the blocks of $\mathcal{H}$ (which is a covering of ${\mathbb{C}}^{n+1}$) is included in the image of some block of $\mathcal{H}$. Then, F is surjective.