Effective bounds of functions approximating formal solutions of binomial equations (Q974393): Difference between revisions

\textit{M. Artin} proved the following theorem [Publ. Math., Inst. Hautes Étud. Sci. 36, 23--58 (1969; Zbl 0181.48802)]: Let \(K\) be a field and \(x=(x_1, \ldots, x_n), y=(y_1, \ldots, y_m)\) variables, \(I\subseteq K[x,y]\) an ideal. There exists a function \(\beta:\mathbb N\to\mathbb N\) with the following properties. Let \(\overline{y}(x)\in K[[x]]^m\) such that \(f(x,\overline{y})\equiv 0 \text{ mod } x^{\beta(i)}\) for all \(f\in I\), then there exist \(y(x)\in K[[x]]^m\) with \(f(x,y(x))=0\) for all \(f\in I\) and \(y(x)\equiv \overline{y}(x) \text{ mod }x^i\). Such a function is called an Artin function. It is proved that the Artin function of an ideal generated by binomials is bounded by a double exponential function. It can be bounded by an affine function if the order of the approximated solution is bounded.