Abstract
Finding irreducible polynomials over (or over ) is not always easy. However, it is well-known that the mth cyclotomic polynomials are irreducible over . In this paper, we define the mth modified cyclotomic polynomials and we get more irreducible polynomials over systematically by using the modified cyclotomic polynomials. Since not all modified cyclotomic polynomials are irreducible, a criterion to decide the irreducibility of those polynomials is studied. Also, we count the number of irreducible mth modified cyclotomic polynomials when with p a prime number and a positive integer.
1. Introduction
For each , the mth cyclotomic polynomial is the unique irreducible polynomial with integer coefficients which is a divisor of and is not a divisor of for all . Its roots are all mth primitive roots of unity , where and k is relatively prime to m. More precisely, the mth cyclotomic polynomial is always irreducible over . However, there are more irreducible polynomials over , which are not the cyclotomic polynomials.
In this paper, we generalize the definition of cyclotomic polynomials to introduce a new kind of polynomials in , which is related to subgroups of the multiplicative group .
Let be an integer. A positive integer g is called a primitive root modulo m if each positive integer a that is relatively prime to m is congruent to a power of g modulo m. In other words, g is called a primitive root modulo m if for any integer a relatively prime to m, there exists a positive integer k such that . Such a k is said to be the index of a, denoted by .
Denote by e the identity element of a group G. If and there exists the smallest positive integer k such that , a is said to be of order k in G. We denote the order of by . Notice that if , there is a subgroup of G, . This subgroup is said to be cyclic, and a is called a generator of this cyclic (sub)group.
It is well-known that a positive integer m has a primitive root if and only if m is one of the following forms: 2, 4, , , where p is an odd prime and is a positive integer (see [1], Theorem 20.4). That is, the multiplicative group is cyclic if and only if m is one of 2, 4, , and . Here denotes the greatest common divisor of a and m. Likewise, we denote by the least common multiple of a and m.
Throughout this paper, we give following notations for the convenience.
- (a)
- If G is a finite cyclic group where one of its generators is , we get the following formula for the order of (see [2], Theorem 7.9):
- (b)
- Let denote the total number of positive factors of an integer m and let be the Euler’s phi function, which is the order of .
We notice that there is no primitive root modulo with . In Section 3, we introduce the structure of when .
The goals of our paper are
- (i)
- to study a criterion to check the irreducibility of modified cyclotomic polynomials;
- (ii)
- to count the number of irreducible mth modified cyclotomic polynomials.
The main results of this paper are Theorems 6 and 9 and Corollary 1. We prove in Theorem 6 that if for some integer , then there are only 4 irreducible mth modified cyclotomic polynomials. And Theorem 9 states that if p is an odd prime and for some integer , then there are exactly irreducible mth modified cyclotomic polynomials. On the other hand, we can also induce Theorems 7 and 8 from Theorem 9.
2. Modified Cyclotomic Polynomials
It is well-known that every cyclotomic polynomial is irreducible over and all of its coefficients are integral (see [3], Theorem 3.1, Chapter IV and [4], Theorem 1.2). The authors of [4] defined the mth ‘semi-cyclotomic polynomial’ from the notion of the cyclotomic polynomial, which is denoted by throughout this paper. We give the definition of a semi-cyclotomic polynomial as follows.
Definition 1.
We assume that is an integer. Let , , and let denote a reduced residue system modulo m. The mth semi-cyclotomic polynomial is defined as
Example 1.
There are a few examples of mth semi-cyclotomic polynomials as we see below.
| m | ||
| 3 | ||
| 4 | ||
| 5 | ||
| 6 | ||
| 7 | ||
| 8 |
For instance, we calculate with . Since ζ is a root of the 8th cyclotomic polynomial , we have . The rest of the calculation is
All six semi-cyclotomic polynomials listed in the table above are in . Further, they are all irreducible over , because , , and have degrees 2 or 3, and they have no rational roots ([2], Corollary 4.19 and Theorem 4.21).
In general, every is irreducible over , and each coefficient of is integral (see [4], Theorems 2.2 and 2.4). In a continuing study, another kind of polynomial was defined with a motivation from the notion of semi-cyclotomic polynomial. The author of [5] defined mth ‘modified semi-cyclotomic polynomial’ for specific .
Definition 2.
Let and . We can express as , where and . Then the following holds for the cosets of the subgroup , because an integer satisfies if and only if .
So, we obtain the quotient group . The mth modified semi-cyclotomic polynomial is defined as
| , | , | |
| , | , | |
| ⋮ | ⋮ | |
| , | . |
Example 2.
From Definition 2, the mth modified semi-cyclotomic polynomial is the product of quadratic polynomials. Furthermore, if we compare Definitions 1 and 2, it follows that has a factor while has a factor , where those factors belong to .
For instance, let ζ be a primitive 16th root of unity. We can decompose in . Then the 16th modified semi-cyclotomic polynomial is calculated by
The following theorem states about a property of subgroups of the cyclic group when m has a primitive root.
Lemma 1.
Let m be a positive integer which has a primitive root g, d be a positive divisor of , and . Then the congruence has a solution if and only if
If the congruence has a solution, it has exactly d distinct solutions.
Proof.
Since m has a primitive root g modulo m, the congruence is equivalent to the congruence with and . Note that . Then has a solution if and only if ([1], Theorem 3.1).
We denote . Then it follows that if and only if . By ([1], Definition 17.1), we obtain . That is, holds if and only if , which is equivalent to . Consequently, the congruence has a solution if and only if , and it has d distinct solutions if they exist. □
Like the semi-cyclotomic polynomial, for every , is in and it is irreducible over ([5], Theorems 1.4.5 and 1.4.6). The following lemma has been proved in [5], so we guide the reader to refer to the proof of ([5], Lemma 1.4.3).
Lemma 2.
([5], Lemma 1.4.3) Assume that for some integer . Let , , and for with . Then and are all distinct complex numbers for every distinct j and k.
In terms of Lemma 2, . The following theorems show that all the coefficients of modified semi-cyclotomic polynomials are integral and the modified semi-cyclotomic polynomials are irreducible over .
Theorem 1.
([5], Theorems 1.4.4 and 1.4.5) For any positive integer with , .
Proof.
Let us denote by a primitive mth root of unity. And let .
First we show that belongs to . Assume that r is an arbitrary element of and we define a -isomorphism in Galois group by and for all . We use the same definitions of s, , , and from Definition 2 and Lemma 2.
Assume that holds for all . The calculation deduces to .
Suppose that and for some without loss of generality. Then
But this is contrary to Lemma 2, so we obtain and for some . Therefore, we get either or , and it follows that by Lemma 2.
Hence, and , which implies that is one-to-one on . This proves that is a permutation on S for arbitrary . Since we have , every coefficient of is fixed by any . In other words, all coefficients of belong to the fixed field of and the fixed field is obviously by ([2], Theorem 12.9).
| ⟺ | ||
| ⟺ | ||
| ⟺ | . |
| ⟺ | ||
| ⟺ | ||
| ⟺ | ||
| ⟺ | ||
| ⟺ | ||
| ⟹ | (due to ) | |
| ⟺ | . |
We proved that , but in fact, . Note that is the irreducible monic polynomial with the minimal degree of over and K is a vector space over , whose basis is (see [2], Theorem 11.7). When , then we get since is a root of . Then if y is an arbitrary coefficient of , y can be expressed as , because y is the sum of products of ’s for some j’s and . Hence, implies because of the linear independence of . In particular, is an integer. Thus every coefficient of is integral. □
The following theorem has been proved in [5], so we guide the reader to refer to the proof of ([5], Theorem 1.4.6).
Theorem 2.
([5], Theorem 1.4.6) For any positive integer with , is irreducible over .
Later, a more general notion came out from the notions of , , and . This notion is a new kind of polynomial through prior researches [5,6,7], which is initially defined and named by ‘Galois polynomial’ in [6]. We rename this notion (Galois polynomial) to ‘modified cyclotomic polynomial’.
Definition 3.
. Suppose that H is a subgroup of . And let , , and . The mth modified cyclotomic polynomial of H is denoted by , and it is defined as .
Example 3.
We deal with an example of 7th modified cyclotomic polynomials. There are 4 subgroups of : , , , and . If ζ is a primitive 7th root of unity, we obtain and .
- (i)
- The corresponding quotient group is .Then we have .
- (ii)
- , where and .So, we get
- (iii)
- It follows that , where .Subsequently, .
- (iv)
- Note that is the trivial group. It follows from the fact that .
In general, is a polynomial of degree and all of its coefficients are integral (see [6], Theorems 2.2 and 2.3). By Definition 3, we know that and . When we denote the subgroup of where , it follows that .
If H equals the whole group , the corresponding polynomial is with where is a primitive mth root of unity. We give examples of when m is a power of a prime number as follows.
Example 4.
When and , we obtain the formula of inductively:
We get by definition of the th cyclotomic polynomial and .
We also give the form of , when α is a positive integer and for some odd prime p. We denote a primitive mth root of unity by ζ.
- (i)
- Let . Then we haveby the definition of the mth cyclotomic polynomial. So, according to Definition 3, we get . And it follows that .
- (ii)
- Let . We obtain following formula by the inductive process:Note that . So, we obtain and .
On the other hand, [5] shows the comparison of the coefficients of both mth and th modified cyclotomic polynomials for odd m. Hence, we guide the reader to refer to ([5], Theorem 2.3.1) for the proof of the following theorem.
Theorem 3.
([5], Theorem 2.3.1) For every odd positive integer m and every subgroup of , let be expressed as , where and . Then
where is defined by for and , and for with .
Example 5.
We use the notations and , which are given in the proof of Theorem 3. Let and let be a subgroup of for each j as below. Each corresponding is given by
| Subgroup of | Subgroup of | |
Then and corresponding to j are calculated as follows:
It is shown that each two coefficients of both and in the same degree has the same absolute value. However, as the degree decreases by 1, the sign of ‘ratio’ of corresponding coefficients changes in the alternating manner, starting from the situation that both leading coefficients coincide.
| j | ||
| 1 | ||
| 2 | ||
| 3 | ||
| 4 | x | x |
3. Irreducibility of Modified Cyclotomic Polynomial
In general, there are a number of reducible modified cyclotomic polynomials. For instance, see Example 5: If we have , the corresponding modified cyclotomic polynomial is , which is not irreducible. The previous researches [7,8,9] give a crucial criterion in this section, to determine whether an mth modified cyclotomic polynomial is irreducible or not.
First, we define , , and as below.
Definition 4.
Let be an integer, and its prime decomposition be , with prime factors and integers .
- (i)
- We define by
- (ii)
- A subset of is defined as .
- (iii)
- When with p a prime number and α a positive integer, we define a subset of as a cyclic subgroup of order .
Indeed, is a subgroup of , whose order equals (see [9], Lemma 6). In particular, if where p is an odd prime and , is of order . Note that if , two subgroups and are relatively prime, because of the fact . Then we conclude that is group isomorphic to by ([2], Theorem 9.3).
We need a theorem as below. For the definition of the Gauss sum, we refer the reader to [10].
Theorem 4.
([8], p. 218 and [9], Theorem 2) For , let H be a subgroup of . Then the Gauss sum is not zero if and only if .
We give a criterion to determine whether or not a modified cyclotomic polynomial is irreducible. This has been proved in [7].
Theorem 5.
([7], Theorem 3.7) Let be an integer, ζ be a primitive mth root of unity, and for a subgroup H of . Then is irreducible.
Note that the converse of Theorem 5 is not true, see Example 4 for instances. With the criterion above, we could decide whether a modified cyclotmoic polynomial is irreducible over . The following example shows how many irreducible pth modified cyclotomic polynomials exist for an odd prime p.
Example 6.
Let p be an odd prime. We have and we easily find that every subgroup H of satisfies . Alternatively, if ζ is a primitive pth root of unity, by the case of Example 4. So, every pth modified cyclotomic polynomial is irreducible over by Theorem 5. Also, there are exactly irreducible pth modified cyclotomic polynomials, since cyclic group has the unique subgroup of the order which divides .
We suggest Theorem 6 for figuring out which mth modified cyclotomic polynomial is irreducible, where . It is known that if , has an element h of order , though it has no primitive root (see [11], Theorem 2). We call this element h as ‘semi-primitive root’ modulo m. It follows that is isomorphic to , where h is a semi-primitive root modulo m by ([11], Lemma 1 and Theorem 3). That is, any element of is for some .
Before proving Theorem 6, we will prove the following lemma for predicting the number of elements in of order 2 when .
Lemma 3.
When , has exactly 3 elements of order 2.
Proof.
If , then . And it is obvious that 3, 5, and 7 are 3 elements of order 2. Assume that . Note that there exists a semi-primitive root h modulo , then is group isomorphic to .
Let be of order 2. There exists nonzero such that . We consider two cases and as below.
- (i)
- Assume that . Since , by in Introduction, the following holds.In this case, we get and . But and imply .
- (ii)
- Assume that . Remark that . Either or holds. By the result of , or .
So, the element u of order 2 belongs to . □
The following theorem is one of main results of this paper.
Theorem 6.
Assume that for some integer . There are only 4 irreducible mth modified cyclotomic polynomials such as x, , , and .
Proof.
Let be a primitive th root of unity and let H be a subgroup of .
We assume that . Then by Theorem 4, and is irreducible over by Theorem 5. If H is the trivial group , we have .
Suppose that , and let a and b be arbitrary elements of . We get by Definition 4, since . Then implies . Since we have for , it follows that . We get since . Also, a is of order 2. This shows that for some .
Note that is clearly of order 2 and
because . Then there are only 3 elements of order 2 by Lemma 3: , modulo m. Since is the nontrivial element, a is either or modulo m. So, if , we have . If , this leads to .
Suppose that is irreducible but . Thus we obtain by Theorem 4. By Definition 3, has a factor . Hence, is an irreducible polynomial over having a factor x, we conclude (And H equals in this case).
In conclusion, there are exactly 4 irreducible mth modified cyclotomic polynomials such as x, , , and . □
Example 7.
We find all the 16th modified cyclotomic polynomials as below:
In this example, we have according to Definition 4, since . Then if H is a subgroup of with , is irreducible over . So, x, , , and are only 4 irreducible 16th modified cyclotomic polynomials.
| SubgroupH | |
| x |
Theorem 7.
Let . Then there are only 3 irreducible mth modified cyclotomic polynomials such as x, , and .
Proof.
Let be a primitive mth root of unity and let H be a subgroup of .
We assume that . Then by Theorem 4, and is irreducible over by Theorem 5. If H is the trivial group , we have .
We assume that and a and b are arbitrary elements of . According to Definition 4, we have . Then implies . Since we have for , it follows that . We get since . Also, a is of order 2. This shows that for some . Note that m has a primitive root. Hence, , and it follows that by Lemma 1. In this case, and .
If , we obtain as in the proof of Theorem 6. Thus there are 3 irreducible mth modified cyclotomic polynomials: x, , and . □
Theorem 8.
Let . Then there are exactly 4 irreducible mth modified cyclotomic polynomials.
Proof.
Let be a primitive mth root of unity and let H be a subgroup of .
We assume that . Then by Theorem 4, and is irreducible over by Theorem 5. If H is the trivial group , we have .
We assume that . By Definition 4, we get and every nontrivial element of H is congruent to either 2, 3, or 4 modulo 5. We figure out H for following cases.
- (i)
- Assume that we have for every . Since we have , the fact . Both and imply . So, we have . By Lemma 1, we get and .
- (ii)
- Assume that there is a nontrivial element u in H with either or . If , we get with . Likewise, if , we have with . So, there are where and .
Then we obtain and , which leads to and by . Hence, , , and imply .
Suppose that there exists such that , , and . A similar calculation yields the following congruences, because of the fact .
| ⟹ | ||
| ⟹ | ||
| ⟹ |
And we have
In consequence, we get , , and . These show that holds for some . We denote this H by . Then is the unique subgroup of order 4, because is cyclic.
| ⟹ | ||
| ⟹ | ||
| ⟹ | ||
| ⟹ | ||
| ⟹ | ||
| ⟹ | . |
And if , we obtain as in the proof of Theorem 6. Thus there are 4 irreducible mth modified cyclotomic polynomials like x, , , and . □
The following main theorem predicts the number of irreducible mth modified cyclotomic polynomials, where p is an odd prime and for some integer .
Theorem 9.
If p is an odd prime and for some integer , there are exactly irreducible mth modified cyclotomic polynomials.
Proof.
Assume that is a primitive mth root of unity and H is a subgroup of .
We assume that . Then is irreducible over by Theorems 4 and 5. Note that is isomorphic to , and is isomorphic to (see [2], Theorem 9.3). Let be the canonical map, which is defined as . Then the kernel of is , and the restriction map has the kernel . That is, is the isomorphism because is onto.
In particular, H is isomorphic to , and so H is regarded as a subgroup of . Further, H is isomorphic to a subgroup of . Since is cyclic of order , there are exactly choices of H satisfying . In other words, there are irreducible mth modified cyclotomic polynomials for proper subgroups H. Also, we have as in the proof of Theorem 6. So, there are exactly irreducible mth modified cyclotomic polynomials. □
Example 8.
There are all the 49th modified cyclotomic polynomials as below:
| H | ||
| x |
By Theorem 5, we have . So, if H is a subgroup of with , corresponding is irreducible over . Thus there are irreducible 49th modified cyclotomic polynomials: , , , , .
Corollary 1.
If p is an odd prime and for some integer , there are exactly irreducible th modified cyclotomic polynomials.
Proof.
Let H be a subgroup of . We use the same definition of of Theorem 3. According to the proof of Theorem 3, is one-to-one correspondent to . We denote the polynomial with .
Let be the reciprocal polynomial of :
Then is irreducible if and only if is irreducible (see [12], Theorem 39). Let , then is irreducible if and only if is irreducible. Let be the reciprocal polynomial of . It follows that
So, we have by Theorem 3. This shows that is irreducible if and only if is irreducible. Therefore, there are exactly irreducible th modified cyclotomic polynomials due to Theorem 9. □
4. Discussion
In this paper, we defined and studied the modified cyclotomic polynomials mainly for the cases when m is or , with p a prime number.
One of the main results is the irreducibility of modified cyclotomic polynomial if , when . However, this result can be generalized in the case when , i.e., m has more than one prime factor. So, we may get more irreducible modified cyclotomic polynomials.
Another result of this paper is finding the number of the irreducible modified cyclotomic polynomials when , , , , or for general prime number p. This result can also be generalized to arbitrary positive number m when m has more than one prime factor. We may use the fact that the irreducibility of modified cyclotomic polynomial is obtained when , and this condition implies that , i.e., H is isomorphic to a subgroup of .
It is difficult to find examples of the application of modified cyclotomic polynomials among known references. The doctoral thesis [13] briefly mentioned the application of modified cyclotomic polynomials. Indeed, the author of [13] used the terminology “cyclotomic subgroup-polynomials” instead of “modified cyclotomic polynomials.” To the best of our knowledge, this is the only paper that mentioned examples of using modified cyclotomic polynomials.
However, examples of the application of cyclotomic polynomials have been found in a few papers. Readers interested in applications of cyclotomic polynomials should refer to [13,14,15].
In earlier researches like [8], the terminology “period polynomial” was used and its related topics were studied. Later in [6], the terminology “Galois polynomial” was chosen for the special case of the period polynomial, and this terminology has been used throughout researches including [5,6,7]. The motivation of this terminology is based on the use of Galois theory although we renamed the notion by our new terminology “modified cyclotomic polynomial” in the present paper, because we noticed that the notion is a modified concept of the cyclotomic polynomial. At a similar period, the author of [13] used the terminology “cyclotomic subgroup-polynomial”, whose corresponding notion is the same as ours.
5. Conclusions
As a generalization of cyclotomic polynomials, modified cyclotomic polynomials are defined. Main results of this paper are as follows:
- (i)
- A criterion to decide the irreducibility of a modified cyclotomic polynomial is studied when .
- (ii)
- The number of irreducible cyclotomic polynomials are calculated for the cases, , , , and respectively.
- (iii)
- More generally, the number of irreducible cyclotomic polynomials are obtained when , with p a prime number. If is prime, then the number of th irreducible modified cyclotomic polynomials is the same as the number of th ones.
Author Contributions
All authors contributed equally to the writing of this paper. Writing original draft, K.-S.L., S.-M.Y. and S.-M.J.; Writing review & editing, K.-S.L., S.-M.Y. and S.-M.J. All authors have read and agreed to the published version of the manuscript.
Conflicts of Interest
The authors declare no conflict of interest.
References
- Bolker, E.D. Elementary Number Theory: An Algebraic Approach; W.A. Benjamin: New York, NY, USA, 1970. [Google Scholar]
- Hungerford, T.W. Abstract Algebra: An Introduction, 3rd ed.; Brooks/Cole, Cengage Learning: Boston, MA, USA, 2014. [Google Scholar]
- Lang, S. Algebra; Addison-Wesley: Boston, MA, USA, 1984. [Google Scholar]
- Lee, K.-S.; Lee, J.-E.; Kim, J.-H. Semi-cyclotomic polynomials. Honam Math. J. 2015, 37, 469–472. [Google Scholar] [CrossRef]
- Lim, S.-A. A Note on the Properties of the Coefficients of Galois Polynomials. Master’s Thesis, Korea National University of Education, Cheongju, South Korea, 2018. [Google Scholar]
- Kwon, M.-Y.; Lee, J.-E.; Lee, K.-S. Galois irreducible polynomials. Commun. Korean Math. Soc. 2017, 32, 1–6. [Google Scholar] [CrossRef]
- Shin, G.-C.; Bae, J.-Y.; Lee, K.-S. Irreducibility of Galois polynomials. Honam Math. J. 2018, 40, 281–291. [Google Scholar]
- Evans, R.J. Period polynomials for generalized cyclotomic periods. Manuscr. Math. 1982, 40, 217–243. [Google Scholar] [CrossRef]
- Diamond, H.G.; Gerth, F.; Vaaler, J.D. Gauss sums and Fourier analysis on multiplicative subgroups of Zq. Trans. Am. Math. Soc. 1983, 227, 711–726. [Google Scholar]
- Jung, S.-M.; Lee, K.-S. Concise Number Theory with Applications: Introductory Theorems and Problems; Lambert Academic Publishing: Saarbrücken, Germany, 2011. [Google Scholar]
- Lee, K.-S.; Kwon, M.-Y.; Kang, M.-K.; Shin, G.-C. Semi-primitive root modulo n. Honam Math. J. 2011, 33, 181–186. [Google Scholar] [CrossRef][Green Version]
- Pless, V. Introduction to the Theory of Error-Correcting Codes; John Wiley & Sons: Hoboken, NJ, USA, 1998; Volume 48. [Google Scholar]
- Al-Shaghay, A. Some Classes of Generalized Cyclotomic Polynomials. Ph.D. Thesis, Dalhousie University, Halifax, NS, Canada, 2019. [Google Scholar]
- Bach, E.; Shallit, J. Factoring with cyclotomic polynomials. Math. Comput. 1989, 52, 201–219. [Google Scholar] [CrossRef]
- Duke, W.; Nguyen, H.N. Infinite products of cyclotomic polynomials. Bull. Aust. Math. Soc. 2015, 91, 400–411. [Google Scholar] [CrossRef]
© 2020 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (http://creativecommons.org/licenses/by/4.0/).