Subgroups of polynomial automorphisms with diagonalizable fibers (Q2344285)

Problem 1. Let \(G\) be a subgroup of \(\Aut_R R[x]\) such that \(G_{(0)}\) is diagonalizable. Does it follow that \(G\) is diagonalizable? Let \(R\) be an integral domain over a field \(k\), and \(G\) a subgroup of the automorphism group of the polynomial ring \(R[x_1,\dots,x_n]\) over \(R\). In this paper, the author discusses when \(G\) is diagonalizable under the assumption that \(G\) is diagonalizable over the field of fractions of \(R\). The author considers the following: Problem 2. Let \(G\) be a subgroup of \(\Aut_R R[x]\) such that \(G_p\) is diagonalizable for all the prime ideals \(p\) of \(R\). Does it follow that \(G\) is diagonalizable? \(a^i := a_1^{i_1}\dots a_n^{i_n}\) for each \(\vec{a} = (a_1,\dots,a_n)\in G\) and \(\vec{i} = (i_1, \dots,i_n) \in{\mathbb Z}^n\), and define \(M_G\) to be the set of \(i\in{\mathbb Z}^n\) such that \(a_i = 1\) for all \(a\in G\). Let \(\gamma_1,\dots,\gamma_n\) be the images of the coordinate unit vectors of \({\mathbb Z}^n\) in \(\Gamma_G := {\mathbb Z}^n/M_G\). For each \(i\), let \(\Gamma^{(i)}_G\) be the subgroup of \(\Gamma_G\) generated by \(\gamma_j\) for \(1\leq j \leq n\) with \(j\neq i\). The following theorem is the main result of this paper. Theorem 1.1. {\parindent=6mm \begin{itemize} \item[1.] If \(n=2\) and \(R\) has nice properties (PID or UFD and some properties of cyclic elements: \(\Gamma^{(1)}_G\) or \(\Gamma^{(2)}_G\) is not equal to \(\Gamma_G\).) then Problem 1 has an affirmative answer. \item[2.] When \(n\geq 3\), Problem 2 has an affirmative answer if \(R\) is a regular UFD, and at least \(n - 1\) of \(\Gamma^{(1)}_G,\dots,\Gamma^{(n)}_G\) are not equal to \(\Gamma_G\). \end{itemize}} For \(n=2\), the author uses structure description of automorphism group over field, in general \(G\)-action provides eigenfunctions which belongs to all localizations \(R_p[x_1,\dots,x_n]\) and it implies that they belong to \(R[x_1,\dots,x_n]\) if \(R\) is nice and action is rich enough.