Let F(X, Y ), G(X, Y ) be polynomials of degrees m, n > 0 respectively. We prove, that the set {(x, y) Є R² : F(x, y) = G(x, y) = 0} has at most mn connected components.

We provide the detailed proof of a sharpened version of the M. Artin Approximation Theorem.