Exercise 4.2.8

Let a be a product of distinct prime numbers. Prove that x n a is irreducible over for any n 1 . What does this imply about a n when n 2 .

Answers

Proof. Let a = p 1 p r a product of distinct prime numbers.

We show that f = x n a is irreducible over . Suppose on the contrary that f = x n a is reducible. By Gauss Lemma f has a monic factor g [ x ] , 1 deg ( g ) < n .

The decomposition of f in [ x ] is

f = ζ 𝕌 n ( x ζ a n ) .

[ x ] being a unique factorization domain,

g = ζ A ( x ζ a n ) , A 𝕌 n ,

where | A | = s satisfies 1 s < n .

As g [ x ] , the constant term is an integer N , given by

N = ξ a n s ,

where ξ = ζ A ζ 𝕌 n is a n -th root of unity.

Moreover ξ = N a n s , thus ξ = ± 1 , and a n s = ± N = M .

But then p 1 s p r s = M n .

The unicity of the decomposition in prime factors shows that the p i are the only prime divisors of M : M = p 1 k 1 p r k r , and s = n k i , i = 1 , , r .

Thus n s , in contradiction with 1 s < n .

Conclusion: x n a is irreducible over , if a = p 1 p r is a product of distinct prime numbers.

The easy part of Proposition 4.2.6 shows that x n a , n 2 has no root in , in other words a n is irrational, for every a being a product of distinct prime numbers. □

User profile picture
2022-07-19 00:00
Comments