Reducibility of quartic polynomials and its relation to Galois groups

. This paper deals with special classes of quartic polynomials and properties pertaining to their Galois groups and reducibility over certain fields. The existence of quartic polynomials irreducible over Q but reducible over every prime field is first proven, after which criteria are established for the Galois group of polynomials with this property. By constructing classes of V 4 -generic polynomials and comparing them with criteria put forth in previous studies for determining polynomials with this property, it can be shown that a polynomial of the biquadratic form x 4 + ax 2 + b has this property if and only if it can be written as 𝒙 𝟒 − 𝟐(𝒖 + 𝒗)𝒙 𝟐 + (𝒖 − 𝒗) 𝟐 with u, v ∈ ℚ such that none of u, v, or uv can be expressed as ratio of two squares, and 2(u+v),(u−v) 2 ∈ ℤ . The general form for biquadratic polynomials irreducible over ℚ and reducible modulo every integer n is found to have a general form similar to this one.


Introduction
The relation between polynomials has been an interesting topic for mathematicians in the past few decades.
Several previous studies focused on how to represent groups such as S n and A n as Galois groups of polynomials [1][2][3], and others tried to find out properties about these polynomials [4]. Among these studies, we found that the reducibility of quartic polynomials is especially appropriate for us to investigate. Both Rotman and Driver et. al included this topic in their researches [5][6]. This paper aims to review some important properties of quartic polynomials and open up room for further exploration.
We expand on problems put forward in the textbooks of Rotman as well as Dummit and Foote about classifying the family of quartic polynomials that are reducible in all prime fields [5,7]. Additionally, we address the question of constructing a generic polynomial for a given Galois group -something which is of high relevance to the inverse Galois problem.

Polynomials reducible modulo every prime p
The topic of polynomials irreducible over ℚ but reducible modulo every prime number p is a recurring concept in textbooks of Galois Theory: the works of Dummit and Foote, Milne [8], and Rotman have all touched on and discussed its properties. For convenience, we shall call polynomials with this property hollow 1 The result directly follows from this. Lemma 2.3 Supplement 2 to the Law of Quadratic Reciprocity [9] ( 2 ) = { 1, The proof for this is slightly lengthier: denote X to be G can therefore be thought of as the integer, if it exists, such that G 2 ≡ 2 mod p Consider G p = X p + X −p mod p. Since X 8 = (X −1 ) 8 = 1, if p ≡ 1 or −1 mod 8, then if p ≡ 3 or −3 mod 8, then At the same time, Combining the two above equations, we can get which is what we want. The first case holds if p ≡ 1 mod 4 and p ≡ 1 or −1 mod 8, so it is true when The second case holds if p ≡ 3 mod 4 and p ≡ 3 or −3 mod 8, so it is true when p ≡ 3 mod 8 Going back to x 4 +1 mod p, we now see that we can consider three possible cases based on the possible modular values of p: (i) p ≡ 1 or −1 mod 8 ∃α :α 2 = 2, then x 4 +1 ≡ x 4 +2x 2 +1−2x 2 ≡ (x 2 + 1) 2 −α 2 ≡ (x 2 −α+1)(x 2 +α+1) mod p (ii) p ≡ 3 mod 8 ∃α :α 2 = −2, then x 4 +1 ≡ x 4 −2x 2 +1+2x 2 ≡ (x 2 − 1) 2 −α 2 ≡ (x 2 −α−1)(x 2 +α−1) mod p (iii) p ≡ 1 mod 4 ∃α :α 2 = −1, then x 4 + 1 ≡ x 4 − (α 2 ) ≡ (x 2 −α)(x 2 + α) mod p It should be obvious that every odd prime p will fall into one of the categories listed above. Therefore, we have shown that f(x) is reducible modulo every prime.
Using the same approach, it follows that g(x) = x 4 + γ 4 for some γ ∈ ℤ are hollow, but can we classify any other such polynomials besides g(x)? Let us exclusively examine hollow polynomials of degree 4. Example 2.5 2 Determine whether f(x) = x 4 − 10x 2 + 1 is hollow. We notice that the coefficient of the x 3 and x terms are 0, meaning we can f(x) as either In the first case, we obtain 10 = a 2 −b, solving for which gives us b 2 + 10b + 1 = 0, from which we can see that b is not rational. Likewise, in the second case we find that b 2 = 1, and a is not rational, meaning ( ) is irreducible. For factorization modulo p, we first complete the square; we now focus on the square root of 24, which is 2 √6. We write this as 2m, where m is the integer such that m 2 ≅6 mod p: for p such that m is solvable, ( ) can be factorized as ( For p such that m has no solution in ℤp, we try the next approach and try to find an element + in the field extension ℤp[m] such that 5+2m = (j+km) 2 . Lining up the coefficients gives us j 2 + 6k 2 = 5, jk=1.
From this we note that k = j −1 , and that the resultant equation We notice that, since (j + j −1 m) 2 = 5 + 2m, (j −j −1 m) 2 =5 − 2m, and we write ( Theorem 2.6 (Dedekind) 3 Let f(x) be a polynomial over ℤ [x] with Galois group G and a factorization modulo some prime p Proof 2.4 It follows from Dedekind's Theorem (2.6) that a polynomial of degree n has an n-cycle in its Galois group if and only if it is irreducible for some prime p. This means we can say that an irreducible polynomial is reducible modulo every prime p if and only if it has no n-cycle in its Galois group. However, a polynomial with a Galois group that is not transitive 4 in S n must be reducible( [6], Theorem 2.9, pg.3). In the case of quartic polynomials, the only transitive subgroups of S 4 that satisfy this condition are V 4 and A 4 .

Irreducible polynomials with Galois group V 4
In the following section we will consider hollow polynomials with Galois group V 4 . Definition 3.1 Define the minimal polynomial a( ) of α ∈ E/F for some Galois extension E/F as the unique, irreducible monic polynomial with Galois group Gal(E/F). This is given by As we can see, although α is an element of E/F where Gal(E/F) ≅ V 4 , its minimal polynomial is not quartic and therefore does not have Galois group V 4 . We gather that the degree of the minimal extension is determined by the cardinality of its stabilizer group and that an element α in E/F has Galois group equal to Gal(E/F)if and only if it has a trivial stabilizer group under the action of the group Gal(E/F). In other words, it holds if α is not fixed by any non-trivial automorphism of E/F. We now consider when Gal(E/F) ≅ V 4 : Lemma 3.3 The Galois extension E/F = ℚ(√ , √ ) is equivalent to ℚ (√ +√ ) Proof 3.1 Define j and k as distinct, square-free 5 j,k̸ ∉ ℚ) Let G = Gal(E/F); it can be shown that G≅V 4 . Let K denote the intermediate field F ⊂ K ⊂E generated by√ +√ . Then the Galois group of the extension E/K is, by definition, the group of automorphisms of E/K fixing K. Since E FK , Gal(E/K)(E/F). We see that since the three non-trivial elements of Gal(E/F) respectively fix√ , √ , and √ , no element fixes √ +√ . Therefore |Gal(E/K)| = |Aut(E/K)| = 1. By the Fundamental Theorem of Galois Theory, we have ( / ) = → = It follows that√ +√ is a primitive element of E/F, so, as desired, ℚ (√ , √ ) ≅ ℚ (√ +√ ). 4 A subgroup E of Sn, the permutation group of the set N, is transitive if, ∃σ ∈ E such that σ(n1) = n2, ∀n1,n2 ∈ N 5 Define an integer to be square-free if it is not divisible by any square other than 1 Proceedings of the 2nd International Conference on Computing Innovation and Applied Physics (CONF-CIAP 2023) DOI: 10.54254/2753-8818/5/20230277 Corollary 3. 4 We can express an element in the extension generated by√ +√ as √ + √ , where j and k are distinct square free integers, not necessarily positive, and a,b∈ℚ. Remark 3. 5 We further apply the argument presented in Lemma 3.3 to elements in E/F of the form l+ √ +√ + √ , and show that this too is a primitive element of E/F. Note that the dimension of the extension is 4, also the number of basis vectors in this element. It follows that every element in the extension E/F where Gal(E/F) ≅ V 4 can be written in the form a + √ + √ + √ , where a,b,c,d∈ ℚ. The same condition from Corollary 3.4 applies for j,k, and jk. Noting that we do not necessarily need jkto be square free, as that would restrict j and k to be co-prime.
We are now able to use this result to find the V 4 -generic class of irreducible polynomials. Theorem 3.6 If a polynomial is irreducible over Q and has Galois group V 4 , then it can be written in the form ∏ ( − ( + √ + √ + √ )) ∈ / or, written out, We will not provide the fully expanded form due to its being too intricate 6 , but it can be shown that the coefficient of the 3 term is −4a. By setting a to 0, we instead consider all reduced quartic polynomials, and have removed one parameter from the expression, giving This, too, cannot be easily manipulated. In the next theorem, we shall only consider two parameters. Definition 3.7 Define a quartic polynomial to be "biquadratic" if it can be written as 4 + a 2 + b for some a,b∈ℚ.

Theorem 3.8 A biquadratic polynomial p(x) is irreducible in Q and has Galois group V 4 if and if only if it can be written in the form
where u and v are distinct rationals such that none of u, v or uvcan be written as a ratio of two squares. Proof 3.2 Let us set one of b,c, or d to 0. There are now no simpler polynomials that we can construct, as removing any more parameters will result in a non-trivial stabilizer group. We now have either = √ 2 + √ 2 , = √ 2 + √ 2 , Without loss of generality, we can write any three of these as We must further restrict u and v in a way that is equivalent to the conditions given in 3.4 and 3.5. It must hold that neither √ or √ are in ℚ. We must further restrict u and v such that √ + √ cannot be written as a single radical, in which case Stab(α) = 2, so we end up with the conditions u,v, and uv cannot be written as ratio of two square integers. From this, the computation of the orbit group of Gal(E/F) on α should follow easily, and we find the minimal polynomial of α to be

Biquadratic Polynomials Modulo p
We have found an exclusive family of irreducible biquadratic polynomials which contains all hollow polynomials for V 4 . We now attempt to find an exclusive family of hollow polynomials for V 4 ; we do this by first generalizing the argument to all biquadratic polynomials, and considering the conditions under which they are reducible modulo p.

Biquadratic Polynomials Modulo n
Up until now, we have dealt with polynomials that are hollow in p, but it turns out that there exist polynomials that are hollow in every integer n greater than 1.
Example 3.14 The polynomial ( ) = 4 − 72 2 + 4 is irreducible over ℚ but reducible modulo every integer n >1. To show that ( ) is irreducible over ℚ, we consider f(x + 1) = (x 4 + 4x 3 + 6x 2 + 4x + 1) − 72(x 2 + 2x + 1) + 1 which is irreducible by Eisenstein's criterion [10]. Additionally, we can see that f(x) is hollow in p, by Theorem 3.11. We will use the following theorem to complete our proof for this claim. is irreducible over Z but reducible modulo n for every integer n greater than 1 if s 1 and s 2 are distinct odd primes that satisfy

Proof 3.3
In order to prove the hollowness for n, we need to prove that f(x) is reducible modulo p k for each arbitrary positive integer k. We first define t = s 1 −s 2 . Then we can easily find that α 2 − 4t 2 = 16s 1 s 2 ≠ □, −α + 2t = 4s 1 ≠ □, −α − 2t = 4s 2 ≠□ Because s 1 ≡ 1 (mod 8), −α+2t modulo 2 k can only be a square. As( 2 1 ) = 1 −α − 2t is a square modulo . By the law of quadratic reciprocity we can get ( 2 1 ) = 1 and −α − 2t modulo is a square. If ( ) = 1 (where a = 1 or 2), then −α±2t is a square modulo p k . While if ( ) = −1, then( 1 2 ) = 1 and α 2 − 4t 2 modulo p k is a square. Therefore, f(x) is hollow for p k . Since every integer greater than 1 can be factorized into a form of and 's are co-prime, we can use Chinese Remainder Theorem to get lemma 3.16 [11]. Lemma 3.16 If f(x) is reducible modulo all p k for all prime p, then it's reducible modulo n for all n. Therefore, we can easily end the proof. Remark 3.17 We notice the similarity between the respective expressions for biquadratic polynomials hollow in p and in n. The reader can check that the smallest pair of primes satisfying Theorem 3.15 are 2 and 17, the corresponding polynomial of which is x 4 − 38x 2 + 225. The next smallest pair of primes of primes are 13 and 17, which gives x 4 −60x 2 +16, the third smallest, 17 and 19, gives us the polynomial considered in Example 3.14.