The Galois group of over
Abstract.
We prove an irreducibility criterion for polynomials of the form relating to the Dickson polynomials of the first kind . In the case when , is a prime , and , for , we explicitly determine the Galois group of , which is or , and the Galois group of , which is , or .
Key words and phrases:
Galois group, irreducible, trinomial, Dickson polynomial, power compositional2020 Mathematics Subject Classification:
12F10, 12E05, 11R091. Introduction
Let be a field, a polynomial, and let be the splitting field of over . If is a separable polynomial, the central result of Galois theory is that there is a bijective correspondence between the subgroups of , the automorphisms of that fix , and the subfields containing . The group contains much information about the field extension . In particular, Galois proved (see [1, VI, Thm. 7.2]) that the roots of can be found via the usual arithmetic operations and th roots precisely when is a solvable group.
When , the Galois group of has been determined for a number of classes of polynomials of small degree. For example, the Galois group of the trinomial has been determined in the case of some small . The case was addressed in the work of [2] and [3], and the case was solved by [4], in the case when or a rational square. In [5], Jones solves the case when is a prime , , and is an integer with . In this paper, we expand on these results and determine the Galois group of the trinomial polynomial in the case when is prime and is a -th power in . In the process of determining this Galois group, we are also able to determine the Galois group of a related family of polynomials formed from the Dickson polynomials.
In [6], Dickson introduced a set of polynomials that often give automorphisms of the finite field . The Dickson polynomials of the first kind are defined by
is a degree polynomial and the next few polynomials are:
A closed-form expression for is given by:
We first establish a reducibility criterion that relates to the Dickson polynomials. It generalizes Theorem 1.1(1) of Jones [5], who considered the case when , is odd, , and .
Theorem 1.1.
Let be a field and . The polynomial is reducible if and only if one of the following conditions holds:
-
(1)
is reducible; or
-
(2)
For some prime divisor of , there exist with and ; or
-
(3)
and there exist with and .
Remark 1.2.
When is a prime and , we will see that the Galois group of is closely related to the Galois group of the polynomial
where is a prime and . When is irreducible, we prove in Theorem 1.3 that is irreducible and we explicitly classify the Galois groups of and . Theorem 1.3 generalizes Theorem 1.1(2) of Jones [5], who considered the case when , , and .
Theorem 1.3.
Let be prime and assume is irreducible. Then is irreducible and the Galois groups of and are determined as follows:
-
(1)
If , the Galois group of is the affine group of , , and the Galois group of is .
-
(2)
If and , the Galois groups of and are identically .
-
(3)
If and , then the Galois group of is , and the Galois group of is .
Remark 1.4.
In [5], the Galois group of in Theorem 1.3 (when ) is described using , the Holomorph of . It is defined as the semi-direct product:
Then the Galois group of is in part (1) and in part (2). Part (3) does not appear as part of [5, Thm 1.1(2)] as by its assumption that but the hypothesis of part (3) is that .
Example 1.
Remark 1.5.
The case of is a sub-case of the quartic, which has long been solved. Here, the Galois group of is , and the Galois group of is .
Remark 1.6.
The case of has been solved by Awtrey, Buerle, and Griesbach using resolvents as Example 4.1 of [3], over a general field. This generalizes Harrington and Jones’s [2]. In the case when , the statement of Theorem 1.3 is true, and can be derived from the work of [3]. (The Galois group must either be or , which can easily be distinguished by the degree of the extension.) For technical reasons, our proof of Theorem 1.3 does not work when .
2. Some Preliminaries
Let denote an arbitrary field. and will denote the norm and trace of with respect to . Let denote the monic trinomial , and denote its roots by and its determinant by .
A key theorem in establishing irreducibility of power compositional polynomials (cf., e.g., [2], [4]) is Capelli’s Theorem (see Theorem 22 of [9] for proof):
Theorem 2.1 (Capelli’s Theorem).
Let and assume is irreducible with root . Then is reducible in if and only if the polynomial is reducible in . Moreover, if has the prime factorization , with and irreducible polynomials , then
where and are irreducible.
Two well known consequences of this theorem are:
Theorem 2.2 (Capelli).
[1, VI, Thm. 9.1] Let . is irreducible in if and only if the following conditions hold:
-
(1)
for all primes ; and
-
(2)
If , .
Corollary 2.3.
For prime, is reducible if and only if with .
Thus, if is reducible, either is reducible, or there exists with and .
Define . The polynomial is symmetric in and its conjugate , so it can be expressed in terms of the symmetric polynomials. By expanding and equating coefficients, we will obtain the reducibility criterion of 1.1.
3. A Reducibility Criterion for
In this section, we prove Theorem 1.1, which gives a reducibility criteria for . Theorem 1.1 extends Jones’s reducibility criterion [5, Thm. 1.1(1)], which considered the case when . The proof of Theorem 1.1 is essentially the same as Jones’ proof in the case . It will follow as a corollary from Theorem 3.1, which gives a relationship of the coefficients of
when is irreducible. Recall from the introduction that are the Dickson polynomials.
Theorem 3.1.
Let be irreducible with a root , where . Then , for some positive integer if and only if there exists some with and .
Before proving Theorem 3.1, we need to establish two theorems about polynomials of the form . Given variables , define:
For , define
and define the polynomial . For , let be the coefficient of in
Theorem 3.2.
The are given by , , and the recursive formula
and is expressible in terms of by:
(where the outer sums are defined to be 0 in the case of ).
Proof.
We first compute from their definition.
The coefficient of the term is
We can then verify the base cases explicitly:
With regard to the recursive relation of the , we may compute:
And with regard to the expression of , we assume for induction that the identity holds for and expand :
∎
The following theorem will be a tool to study polynomials of the form and prove Theorem 3.1.
Theorem 3.3.
Use the same notation as in Theorem 3.2, and define the polynomial . Then , where is the th Dickson polynomial of the first kind.
Proof.
We define
Then . We observe now that:
Also, and . (Note: we define so that , in agreement with the direct expansion of .) So indeed , and as claimed, . ∎
We now use Theorem 3.3 and Capelli’s Theorem to study polynomials of the form and prove Theorem 3.1.
Proof of Theorem 3.1.
If there exists with , is a valid factorization of . We now identify the symbol from Theorems 3.2 and 3.3 with the conjugate of , namely . From Capelli’s Theorem (and the multiplicativity of norms), this factorization induces the -factorization
Equating coefficients with the expression from Theorem 3.3 gives the desired equality:
with
Conversely, if with the given conditions, then by Theorem 3.3,
By Capelli’s Theorem, is the product of the norms of some irreducible polynomials in that divide . is quadratic, so for some , and . ∎
The criterion for reducibility, Theorem 1.1, follows as a corollary.
Proof of Theorem 1.1.
We use the notation common to Theorems 1.1 and 3.1. If is reducible, so is . If is irreducible, from Capelli’s Theorem, is reducible if and only if is reducible in , where is a root of . From Theorem 2.2, this occurs if and only if for some prime, or and . From Theorem 3.1, if and only if there exist with and . If for some , denote the conjugate of over by , with . Then
By Waring’s identity (Remark 1.7). And indeed , . Conversely, if such exist, we observe that
So and therefore are reducible. ∎
Remark 3.4.
We note that the criterion of Theorem 1.1 is very similar to parts (vi) and (vii) of Theorem 6 of Schinzel [10]. It is quite possible that Theorem 1.1 is encompassed by the results in [10] on the reducibility of trinomials. However, those results utilize elliptic curves and the proof of Theorem 1.1 does not.
4. Properties of and
We now restrict ourselves to the case when , is prime, and the constant term of is the form . With
we assume in this section and the next that is irreducible. By Theorem 1.1(1), is not a rational square and the splitting field of is . Also, by Theorem 1.1(2), the irreducibility of implies that for any . Hence the polynomial has no rational roots.
Let be a primitive th root of unity and let
be the th cyclotomic field. We will denote the splitting field of by and the splitting field of by . We denote the roots of by . We then choose so that and (and indeed ). has roots, which are precisely
We claim now:
Lemma 4.1.
, and moreover, these are the only roots of in this extension of .
Proof.
By construction , so . Suppose that some other root of lies in , without loss of generality, . Then . If , . This is impossible because and , but given that . So , and , which is one of the given roots after all. ∎
As a corollary, there are no double roots: else is reducible, and the only pairs of roots which generate the same extension are of the form , whose th powers are , respectively.
Now denote and , with . Clearly, . Also, . We show that it is a root of .
Lemma 4.2.
.
Proof.
We now define the fields , with , and define
A priori, we do not know that the fields are distinct, but for now, it suffices that the distinct symbols are in bijective correspondence with and . Before examining the fields , it will be useful to prove that:
Lemma 4.3.
acts transitively and equivalently on , on , and on the roots of .
Proof.
Let . permutes the roots of , and from Lemma 4.1, it must be that for some . Then , and acts on . is transitive on the roots of irreducible , so its action on is also transitive. maps the pair of roots in to the pair of roots in , so the action on is equivalent to the action on the set of pairs of roots of . Then:
So . Therefore, acts equivalently on the roots of , on , and on , according to the correspondence , and these equivalent actions of are transitive. ∎
We can now prove the following properties about the fields .
Lemma 4.4.
is irreducible, so . Also, , and if and only if .
Proof.
By Theorem 3.3, , so is a root of . Thus, , and since , . Thus, could be , , or . because this would give a rational root for , a contradiction.
Now assume temporarily that . Then is an extension of either degree 2 or degree 4. given , so , and . By the transitive action of the Galois group, all are isomorphic and are thus quadratic extensions. So each root of is a root of a quadratic factor, and factors as a product of quadratics. But this would make even, a contradiction. So after all, and consequently, is irreducible with , as claimed.
Then because , so and , so . If but , then , a contradiction of Lemma 4.1. So if and only if , as desired. ∎
As a technical lemma, we must now note that:
Lemma 4.5.
. if and if .
Proof.
certainly contains all the roots of . Conversely, the roots of include and , so the splitting field is at least . Thus, .
and , and because is odd. Thus, . If , then is coprime to . Thus . If , then is again coprime to , and similarly . ∎
Remark 4.6.
As and are Galois extensions, an automorphism acts as an automorphism of .
Using the lemmas of this section, we are now able to specify the actions of in terms of its action on , and . We define .
Theorem 4.7.
If , then there exists a bijection between and given by . If , then there exists a bijection between and given by .
Proof.
permutes the roots of . Because all roots of are expressible in terms of and (as ), is determined entirely by and .
If , there are choices for and choices for , so . But , so all choices must correspond to distinct elements of the Galois group. The action determines , and vice-versa, and the actions on are also equivalent. Therefore, corresponds exactly to a choice of . ∎
If , determines . Therefore, determines and thus . There are choices for and choices for , so . But , so all choices must correspond to distinct elements of the Galois group. Therefore, corresponds exactly to a choice of . ∎
5. The Galois groups of and
As in Section 4, we assume that
that is irreducible and let denote the polynomial . The assumption on shows that is irreducible.
Theorem 5.1.
Let be the splitting field of over . Then and for all ,
Proof.
contains all of the roots of , which splits in , so for each . Since , each term is in . Then contains
as well.
Now choose an arbitrary which fixes . acts trivially on and and acts on either trivially or by conjugation. If , then , so . Thus:
Similarly, if , then , so . Thus,
Because is fixed by the subgroup fixing , . Finally, contains each , so . ∎
From this point, we will need to construct automorphisms using Theorem 4.7, rather than considering arbitrary automorphisms as we have done in the previous section. We can prove:
Theorem 5.2.
The splitting field of is .
To help to understand the proof of Theorem 5.2, Figures 1, 2, 3 provide diagrams of the relevant field inclusions in each case. All of the boxed fields are Galois over , and the fields marked are conjugates.
Proof.
from Theorem 5.1. Since
and is of degree at most 2, we see that that
Recall that is the cyclotomic field. There are then 3 cases:
-
(1)
; or
-
(2)
and ; or
-
(3)
and .
Case (1): Consider the case of . From Theorem 4.7, there exists an element of defined by . Then
for all , so fixes all roots of and therefore . The trivial element also fixes , so by the Galois correspondence, . So , and after all, and is of degree , using Lemma 4.5.
Case (2): Now suppose that and . Then is even, so by the Galois correspondence. Thus
and in fact , which by Lemma 4.5 is of degree .
Case (3): Finally, we suppose that , but . Then is odd, so by the Galois correspondence (else ). From Theorem 4.7, there exists an element defined by , and consequently because , the fixed field of conjugation in . Then as in case (1), fixes all roots of and therefore , so . Then , and , after all, and is of degree , using Lemma 4.5. ∎
Remark 5.3.
The choice of the automorphism fixing follows Jones’ construction in [5, Section 3, p. 6].
We are almost ready to prove Theorem 1.3, but first, we must recall the following fact about cyclotomic fields:
Lemma 5.4.
[1, VI, Thm 3.3] Let be an odd prime and let be the quadratic Legendre symbol. Let . Then and is the only quadratic extension of that is a subfield of .
Corollary 5.5.
if and only if .
Finally, we can prove Theorem 1.3.
Proof of Theorem 1.3.
Recall that we are studying irreducible polynomials of the form . We note that for any irreducible of this form, must fall into exactly one of the 3 cases given. And from Lemmas 4.4 and 5.2, is also irreducible with splitting field . We will use throughout the notation of . Note throughout that while we will be examining specific elements of , we will be considering their actions on the roots of , which is equivalent to the canonical actions of their images in under the division map.
Proof of Case 1. If , then by Corollary 5.5. From above, this means that is an extension of degree which does not contain .
Consider now the elements defined using Theorem 4.7 by:
Where is a generator of the group of th roots of unity. By inspection, and . Let be the symmetric group on the set . The Galois group of therefore contains the elements
The elements , generate , whose size is . As , . And , so the Galois group of is
Proof of Case 2. If and , then by Corollary 5.5. From above, is the splitting field of and , and . Now consider elements defined using Theorem 4.7 by:
For a generator. conjugates , so , and . is a generator because
So will be a -cycle. And again, . The Galois group of therefore contains the elements
As in Case 1, the elements , generate , and , so the Galois groups of are identically
Proof of Case 3. If and , then by Corollary 5.5. From above, , but . Again we consider elements defined using Theorem 4.7 by:
For a generator. again conjugates , so , and . However, we see that is of order because
So will be two -cycles, the square of the -cycle generated by . And again, . The Galois group of therefore contains the elements , where are the cycles
and is the cycle
The elements , generate the normal subgroup , whose size is . Thus, the Galois group of is
Now and as in Case 1, so
∎
Remark 5.6.
Remark 5.7.
In the cases of and (the solutions to which we mention in Section 1), our methods of proof fail beginning at Lemma 4.1, where we use the fact . The issue is essentially that for the case of and that if , then in the case of . These issues both invalidate the distinctness of the and , which is key to Lemma 4.4, on which all of our subsequent work regarding and its Galois group is based.
References
- [1] Serge Lang “Algebra” Springer, 2002 DOI: 10.1007/978-1-4613-0041-0
- [2] Joshua Harrington and Lenny Jones “The Irreducibility of Power Compositional Sextic Polynomials and Their Galois Groups” In Mathematica Scandinavica 102.2, 2017 DOI: https://doi.org/10.7146/math.scand.a-25850
- [3] Chad Awtrey, James R. Buerle and Hanna Noelle Griesbach “Field Extensions Defined by Power Compositional Polynomials” In Missouri Journal of Mathematical Sciences 33.2, 2021, pp. 163–180 DOI: 10.35834/2021/3302163
- [4] Malcolm Hoong Wai Chen, Angelina Yan Mui Chin and Ta Sheng Tan “Galois groups of certain even octic polynomials” In Journal of Algebra and its Applications, 2022 DOI: https://doi.org/10.1142/S0219498823502638
- [5] Lenny Jones “Monogenic Reciprocal Trinomials and Their Galois Groups” In Journal of Algebra and its Applications, 2020 DOI: https://doi.org/10.1142/S0219498822500268
- [6] L.E. Dickson “The analytic representation of substitutions on a power of a prime number of letters with a discussion of the linear group I, II” In Annals of Mathematics 11.1, 1897, pp. 65–120\bibrangessep161–183
- [7] R. Lidl, G.L. Mullen and G. Turnwald “Dickson polynomials” Longman Group, 1993
- [8] A.. Horadam “Vieta Polynomials” In Fibonacci Quarterly, 2002, pp. 223–232
- [9] Andrzej Schinzel “Polynomials with Special Regard to Reducibility” Cambridge University Press, 2000
- [10] Andrjez Schinzel “On reducible trinomials” In Dissertationes Mathematicae, 1993
- [11] Chad Awtrey and Peter Jakes “Subfields of Solvable Sextic Field Extensions” In North Carolina Journal of Mathematics and Statistics 4, 2018, pp. 1–11
- [12] Biswajit Koley and A. Reddy “Survey on irreducibility of trinomials”, 2020 arXiv:2012.07568 [math.HO]