An algorithmic version of Zariski's lemma (Q2117812)

The author gives an elementary and constructive proof of Zariski's lemma. Zariski's lemma: Let \(K\) be a field and \(R\) be an algebra over \(K\) which is a field. If \(R=K[x_1,\ldots,x_n]\), for \(x_1,\ldots,x_n\in R\), then \(x_1,\ldots,x_n\) are algebraic over \(K\), i.e., there are \(f_1,\ldots,f_n\in K[X]\setminus K\) with \(f_i(x_i)=0\). In fact, in the proof of Theorem 1, by induction on \(n\), he finds the polynomial \(f_i\). The author gives a computational interpretation of Zariski's lemma and uses his constructive proof to develop an algorithm which realizes the computational interpretation. For the entire collection see [Zbl 1482.68017].