MA-414 (Galois Theory)

Tutorial-8

March 11, 2023

1. Let m and n be coprime integers. Show that Q[⇣n , ⇣m ] = Q[⇣mn ].

2. Let m, n > 1 be integers and let l be their lcm. Show that Q[⇣n , ⇣m ] = Q[⇣l ].
Q
3. Let n (X) = (X ⇣ni ) denote the nth cyclotomic polynomial. Show
i2(Z/nZ)⇥
that Y
Xn 1= d (X) .
d|n

4. Let p be prime. Show that pr 1

pr (X) = p (X ).
5. Let n = pr11 pr22 . . . prl l . Let m = p1 p2 . . . pl . Show that
n/m
n (X) = m (X ).

6. If n > 1 is odd then 2n (X) = n( X).

7. If p is a prime not dividing n then p )/
pn (X) = n (X n (X). If p divides n
then pn (X) = n (X p ).
8. Define the Möbius µ-function by
8
< 1 if n = 1,
µ(n) = 0 if n has a square factor,
:
( 1)r if n has r distinct prime factors.

Let N be the set of all positive integers. Let f : N ! N be a function, and

define X
F (n) := f (d), 8 n 2 N .
d|n

The Möbius inversion formula states that one can recover the function f (n)
from F (n) by X
f (n) = µ(d)F (n/d), 8 n 2 N .
d|n

Use the Möbius inversion formula to show that

Y
n (x) = (xd 1)µ(n/d) .
d|n

1
 9. Let p be a primes and let n > 1 be an integer such that p - n. For a 2 Z,
we get an integer n (a) 2 Z, since n (X) 2 Z[X]. Show that p| n (a) i↵ the
order of a in (Z/pZ)⇥ is equal to n.

10. Let f (X) 2 Z[X] be a polynomial whose constant coefficient is 1. Let SN be

the set of those primes which divides any member of the set {f (n) | n N }.
Show that #SN is infinite.

11. Let f (X) 2 Z[X]. Let SN be the set of those primes which divides any member
of the set {f (n) | n N }. Show that #SN is infinite.

12. Let f (X) = n (X) and apply the previous exercise. Show that there are
infinitely many primes p such that n|(p 1). This is a special case of Dirichlet’s
Theorem.

13. Use the previous exercise to give a complete proof of the fact that every finite
abelian group occurs as the Galois group of an extension of Q.

14. Let a 2 Z. Show that if p is an odd prime dividing n (a), then either p | n or
n | (p 1).
p
15. Let p > 2 be a prime number and ⇣p = e2⇡i/p 2 C, where i = 1. Let L be a
subfield of Q(⇣p ) such that [L : Q] = 2 (p 1). Show that L = Q(⇣p + ⇣pp 1 ) =
1

Q(⇣p ) \ R.
Q
16. Show that p = pi=11 (1 ⇣pi ). Prove the following.
p p (p i)
(a) If p ⌘ 1 mod 4, show that p 2 Q(⇣p ). (HINT: Use ⇣pi = ⇣p )
p
(b) If p ⌘ 3 mod 4, show that p 2 Q(⇣p ).
p
(c) Show that 2 2 Q(⇣8 ).

17. Use the above two exercises to show that every quadratic extension of Q is
contained in a cyclotomic extension.

18. Let p, q > 0 be two distinct prime numbers. Show that Q(⇣pm ) \ Q(⇣qn ) = Q,
for any two positive integers n, m.

19. Let n = pr11 · · · prmm be the unique decomposition of a positive integer n 2

into product of distinct prime powers. Show that
Q
m
(a) Q(⇣n ) = Q(⇣pj rj ), and
j=1
Q
m
(b) Gal(Q(⇣n )/Q) ⇠
= Gal(Q(⇣pj rj )/Q).
j=1

20. For an integer n > 0, let ⇣n be the primitive n-th root of unity. Let r > 0 be an
integer with gcd(r, n) = 1. Let r 2 Gal(Q(⇣n )/Q) be such that r (⇣n ) = ⇣nr .
Show that, r (⇣) = ⇣ r , where ⇣ is a n-th root of unity.
p
21. Prove that Q( 3 2) is not contained in any cyclotomic extension of Q.

2
22. Prove that the set of all primitive n-th roots of unity form a basis over Q of
the cyclotomic field Q(⇣n ) of n-th roots of unity if and only if n is square free
(that is, n is not divisible by square of any prime number).

23. Let n 1 be an integer, and let p : Fpn ! Fpn be the Frobenius automorphism
define by p (a) = ap , for all a 2 Fpn . Consider Fpn as a Fp -vector space and
p a Fp -linear transformation.

(a) Find the characteristic polynomial of p.

(b) Show that the Fp -linear map p is diagonalizable over the algebraic closure
Fp of Fp if and only if gcd(n, p) = 1.

3
Ln Clearly QC3n CQC 5mn and
Q Jm CQ Sun
Hence G Jn Jm Jn QC3m C Tmn

Now we claim that 0 Jn Jn mm that is

3h3m is mn th primitive soot of units

Suppose 05h3m L Then clearly l 1mn

as Insm 1 Ls
l
Since 063m 3mi l In 3m31 L
Suppose Jn l I then Jn Sm
5m71 2 and o Tsn t off
But if 0cal h then 0cal Akane
Hence
I m In
l
Sinie Jn 2 Jm 2 1 Clime Cm
thin ch

But then [Link]

In
l
Henie In 3 Gm I
nll mll
nm Il as min l

By nm l which proves the claim

Finally we have 3mn QC5n5n C [Link]
Henie Q Tmnt Ocr Snl y
Sot We will show that
Q In 5m 9 Snyman Jml
Then our result will follow by

2 clear d 3 id d
as 5 where [Link]
E by G Jna Jml Q Se
Also In 5m E Q se
Q Jn Jn C O C Sel

Sol Let Mn 3 E E I 3 23

X I T X
Sem

T T x 3
din Sem
primitive

Tl OaGe
din
Soe
Method L
Note that deg Ipe X OCP prep 1 and
deg I XP s p deg Ep x peep 2
Let d be a root of Ip xp
Ip LP o

LP Jp Iwhere Sp is p te primitive root of unity

P P
12PM G I
LP I
Claim d is of Epe x that is L
root is p th
primitive root of unity
It is enough to show that LP I t 4 1 11

Suppose LP 2 for some h 2 dt

11 p't
aph p I note that r t h E INUI
Jp LP 2 X
Which proves the claim
Henie our serult will follow why II

Ipa X coed yucpeld

a

xp
Iii
1
xp s MCP I
wise
XP it 2

OrCyp
SII method I
Note that deg Onex 0cm dep pepe
pi p 17 pit Pe l
Ip pete CP D IPe D
Nlm Pi D IPe D

deg Om Xm deg Imax

In
him 0cm
Mm IP 17 Pe 17

Let d be a root of Om Xm
The Incan'm o
2mn 5m where In is mt primitive root
of unity
N'T Sn I
I I
Claim d is of In x that is d
root is n th
primitive root of unity
It is enough to show that 2h 2 V2 then hln
Suppose 2h 2 for some 2 then hln
a 1277hm
thn
Since Ken t knm m a 2 I't Be
where It be any teth
root of unity
 m
2 Jt
n
In L 5A X as tem and
3m is mt primitive
root of unity
Which proves the claim
Henie our serult will follow why II

Method 2 By using result of question

d
Incas T coed
din
ked
och'd z
I
Note that Mcd 0 it d has a square
factor
Mcd
Henie In CoD Coen'd
In
Mcd
Gemini'd 2
a
d Mcm'd
Cochin
It
Em xmm

Reale If M P past where I e si e di

Then also above result is true
Stf'ethod
Note that deg Ioan x 022ns 011 din in is odd
Oln

deg Inc x deg Onex den

Let 2 be a root of Ian x

Then 02h 47 0
2 522 where Jan is inth primitive loot
of unity
an Jan
Ln I
Til L I C as n is odd
C oh I

Claim d is of
rootEfx that is d is n th
primitive root of unity
It is enough to show that f 27 2 V2 then h n

Suppose 2 2 for some 2 then h h

C11h Lh 2 a 2h fi 2 as n is odd
so is k
22h fi I as 2h can and
X d Jae is anti primitive
root of unity
Which proves the claim
Hence our serult will follow why
 Method 2 By using result of question

02261 xd 1 Mcm'd

ped nyman'll ped puch'd

Th y
uch'd
Cat z eat guard
at g
I pett such'd
men'll
Now d Gx food 1

p Emad
had
ped
y
d
catty mental
In In o

Be

Soen
Method
Case a If Pln
Note that deg Ipn x term 44
P 17 Ochi pm

deg concxP Onex des conch des Conall

P deg Enix des CInall
P n 0cm
 Since Incx In ext to show that
Ipn X In XP Ely
it is equivalent to show that
Ipn X E x In XP

Let d be a root of Ipa X In ex

Then Ipn an Inca 0

Ipn 27 0 On In 21 0

L
5pm od 4 52
where 3pm is pm th primitive root of unity
and Jin is n th primitive root of unity

Claim L is root of In XP
Clearly LP I Cin both cases
We want to show that 2 1 K k 1 in if kin
Suppose 2 2 for some ke 2 n i k n
If 2 5pm then we got contradiction as pkepn
If a In the since
spiny 2 phony h as him
IS Z E Z S.t Sph th h
2h 2 Pks g th y
Which is contradiction as heh
Which proves the claim
Henie our serult will follow why

Case b If P n

Let n
p m s t
p mi 2 h I
 Note that deg Ipn x term
0 ph m
pepkt dem
ph p 17 demi

deg concxP des conch Pdes Enix

Polen p dephmi p ph p 174cm
ph p 1 foam

Let d be a root of Ipa x

Then Ipn d o L 3pm
where 3pm is pm th primitive soot of unity
LP 2

Elm L is root of In XP
We want to show that 12 1 k k 1 in if kin
Suppose 2 t 2 for some ke 2 n i k n
as phapu
whtinhigiovesistientmitti
Henie our serult will follow why If

Method 2 By using result of question

X ped 2 Mental
pi Jpn
Mf Pnd
T Pid 2
Pnd Gid 2
dipl
pld pld
u Pm'd
11mm'd
I fed
coed z
jp
 h Palpa
food 11mm'd apai
E y
ord gym Pmd Madl
Gcpd
q In

case al If Pln
MPH Madi
Ip X fond
In
Gcpd

and MCP mad Madl

gcpd
q In
coed p
Mall
epd Maldi
In Il
Id x In XP
In XP
g X

case bi If p n

Let me pin where h 7 Mip 1

fond 1yM Pnd epd Maldi

Ip X
Pldt
fond
McPhild Maldi
pepa
q In
Pldt
Pd M hid
Coed 1
IT I
dad
I In XP 2 In XP
Pat
Method 2
Let n Pi P each hi 2
We use induction on n check base ease

Let men be sat n pam

Suppose rn I then Pu 7m
In this case In Con pam
o

In CocP by
g
d
By induction Onex Coed 1
hypothesis
11
OmCaput Gernd 17mn41
In
But then XPnd 1 Mcm'd
Ence
MCM'd
Tl Ged
dim
 Since he Pum a All the divisor of n is of the
four d or Pnd where d is divisor of m

Mond Menta
In coil Tl food 1 p red p
din dim
Pald

d McPand
food 1 x red
If
din din
as MCPamd MCPDMCMdl

Ma'd fi Mcmldl
coed

Suppose In I then Palm

In this case In Con pam
o

CocPn by
In
d
By induction hypothesis Onex coed 1
gym

Em sepal fend 17Mt'd

In
Pnd Mcm'd
But then Ence x 1
E
octad puca
at
expand yuckynd
pan
 M Md
ed
I
Paid
d M Md
xd 1 ed
I ayy
Paid Pald

as if Patt Pitta a Mcm'd o

4d
God 11
In
Method 2
By X I E ex
In
log x D
Ey log Eaa

Use the Mobius inversion formula

log Onex Medi log x'd

E 1

uchi los xd it
In
xd purity
Its
dog T xd mum'd
din
Soe Note that
xn i da ex
In
an I old Ca where each
In Old Cal FZ

Now Oca n in 2 pz
an 2 o nod p al 2 O God p
t d e 1,2 in i

an 2 o mod p old Cal 0 mod pl

H de in i St din

On Ca I 0 mod p by
p Anfal

g Suppose Sn is finite
Let Sw P Pa and let
f x An Mt an X t 1
Let get p pe Intel Then Nearly ye 7N VLEINU

Now consider f le angel t taille 1

Cte I I mod Pi tis I is
 Hence
pi f f ta it is I e and the INV 03

Also note that the INUdo s t 18cg 72 why

Henie 2 a prime p [Link] tear p e Sn
But which is contradiction as p pi ti l is
Hence Sn is infinite

Sol Suppose Sn is finite

Let Sn P Pa and let
f x An Nt an X t do

Suppose A 0
Let Ae P Pa Nts dol
Then Nearly ye N Alemu's
Now consider f le angel t taille ta
del a an Hel a t a dela 2

Note that gela EZ and

gC9e an Hel a t a dela 2 I 1 mod Pil Fifi er

pill 9 de fi l it Alt INULOY

Also note that the INUdo s t 19cg 72 why

Henie 2 a prime p s.t p scar fear p e Sn
But which is contradiction as p pi ti l is
Hence Sn is infinite