2

Computing Galois groups of polynomials is a kind of standard thing to do in algebra, so I think this question goes without much further motivation.

It is known that every element of the Galois group is a permutation of the roots of the irreducible factors of some given polynomial. If we fix a labeling of the roots, this gives an injection from the Galois group into the symmetric group of the appropriate order, which is clearly a homomorphism, as both group operations are composition.

Since every group is a subgroup of a symmetric group, we have the natural question:

Is every group the Galois group of some polynomial (over $\mathbb Q$)?

Now it is also not hard to show using cyclotomic polynomials that every Abelian group is the Galois group for some polynomial over $\mathbb Q$, so in the abelian case, the answer is affirmative. What can be said in the remaining cases?

A. Thomas Yerger
  • 17,862
  • 4
  • 42
  • 85

1 Answers1

4

This is known as the inverse Galois problem (Wikipedia) and it has been extensively studied, with many partial results, though the problem remains unsolved in full generality.

Zev Chonoles
  • 129,973