compute the Galois group of an irreducible polynomial - Maple Help

Online Help

All Products    Maple    MapleSim

Home : Support : Online Help : Mathematics : Algebra : Polynomials : Operations : galois

galois - compute the Galois group of an irreducible polynomial

Calling Sequence


galois(f, x)




irreducible polynomial






The galois command computes the Galois group  of a polynomial f. The argument f must be an irreducible polynomial in x over Q --the field of rational numbers-- or over Q[t1,t2,...,tn], where the ti's are variables.


The Galois group of a polynomial over Ct, where C is the field of complex numbers, can be computed with algcurves[monodromy](f, t, x, group).


For polynomials over Q, the maximum degree is 9. For polynomials over Q[t1,t2,...,tn], the maximum degree in x is 8.


If f is a univariate polynomial, the argument x is optional.


The galois function returns an expression sequence of five elements:


1- A string giving the name of the Galois group using the notation of "The Transitive Groups of Degree up to Eleven" by G. Butler and J. McKay, Communications in Algebra, 11(8) 1983. For instance "8T24" stands for the twenty-fourth group in the list of degree 8 transitive groups.


2- A set of strings, each string giving a description for the group according to "On Transitive Permutation Groups" by J. H. Conway, A. Hulpke and J. McKay, London Mathematical Society Journal of Computation and Mathematics. See group[transnames] for more details.


3- A string indicating the parity of the group ("+" for even groups, "-" for odd groups).


4- The order of the group.


5- A set of generators in disjoint cycle notation. The generators are represented by strings.


Note that specialization of the parameters t1, t2, ... ,tn results in a group which is a subgroup of the original group. (See, for example, van der Wärden, Algebra I, 8.10.)


The set of generators can be used to build a permutation group with the permgroup command of the group package.


The function group[transgroup] returns information about transitive permutation groups.


The galois procedure is able to print out details of how the Galois group is computed.  To see some of this information you must first type infolevel[galois]:=1; before calling galois. To see all of the details type infolevel[galois]:=2; before invoking galois.



4T5,S(4),-,24,(1 4),(2 4),(3 4)



5T2,5:2,D(5),+,10,(1 2 3 4 5),(1 4)(2 3)



G:=5T3,5:4,F(5),-,20,(1 2 3 4 5),(1 2 4 3)







7T7,S(7),-,5040,(1 7),(2 7),(3 7),(4 7),(5 7),(6 7)



8T45,[1/2S(4)^2]2,+,576,(1 2 3),(1 8)(4 5),(2 8)(1 3),(4 8)(1 5)(2 6)(3 7)



8T17,[4^2]2,-,32,(1 2 3 8),(4 8)(1 5)(2 6)(3 7)



3T2,S(3),-,6,(1 3),(2 3)



9T1,C(9),+,9,(1 2 3 4 5 6 7 8 9)


See Also

GF, group, infolevel

Download Help Document

Was this information helpful?

Please add your Comment (Optional)
E-mail Address (Optional)
What is ? This question helps us to combat spam