Using Galois ideals for computing relative resolvents (Q5927988): Difference between revisions

Let \(k\) be a perfect field and \(\overline{k}\) an algebraic closure of \(k\). Let, \(f\in k[X]\) be a separable univariate polynomial of degree \(n\) and \(\Omega= (\alpha_1,\dots, \alpha_n)\) be a tuple in \(\overline{k}^n\), of the \(n\) roots of \(f\), with some fixed order. Let \(x_1,\dots, x_n\) be ordered variables algebraically independent over \(k\). \textit{A. Valibouze} [Bull. Belg. Math. Soc. -- Simon Stevin 6, 507-535 (1999; Zbl 0943.12001)] introduced the notion of a Galois \((L,\Omega)\)-ideal in the ring \(k[x_1,\dots, x_n]\), associated to a subgroup \(L\) of the symmetric group \(S_n\). In the present paper it is proved that the Galois \((L,\Omega)\)-ideal containing the Galois group of \(f\) is generated by a separable triangular set of polynomials which forms a reduced Gröbner basis of this ideal for the lexicographical order. Triangular sets of polynomials are effective tools for solving algebraic systems. Using this the authors give an algebraic method for computing relative resolvents. Algorithms for computing characteristic polynomials and relative resolvents are given. If the Galois group of the polynomial \(f\) is known, their algorithm may be used for computing the ideal of relations among the roots of \(f\) and consequently for computations of the splitting field of \(f\). The algorithm for computing relative resolvents presented are illustrated in a concrete example of degree 8.