Homepage Solution manuals David S. Dummit Abstract Algebra Exercise 4.5.44 (Sufficient condition to $N_G(P) = C_G(P)$)

Exercise 4.5.44 (Sufficient condition to $N_G(P) = C_G(P)$)

Let p be the smallest prime dividing the order of the finite group G . If P 𝑆𝑦 l p ( G ) and P is cyclic prove that N G ( P ) = C G ( P ) .

Answers

Proof. Let p be the smallest prime dividing the order of the finite group G , and consider some subgroup P 𝑆𝑦 l p ( G ) , where P is cyclic. Then | P | = p α , where

| G | = p α m , p m .

Since C G ( P ) N G ( P ) , we want to prove | N G ( P ) : C G ( P ) | = 1 . Put d = | N G ( P ) : C G ( P ) | .

By the normalizer-centralizer theorem (Corollary 15)

N G ( P ) C G ( P ) H , where  H Aut ( P ) .

Since P is cyclic of order p α , then

| Aut ( P ) | = φ ( p α ) = p α 1 ( p 1 ) .

Therefore

d p α 1 ( p 1 ) . (1)

Moreover d is a divisor of | N G ( P ) | , thus d is a divisor of | G | = p α m :

d p α m . (2)

If q is a prime divisor of d , then by (1), q = p or q p 1 . In the latter case, q < p , but q is a divisor of | G | by (2), and p is the smallest prime dividing G : this is contradiction, which proves q = p . So p is the only prime divisor of d (if any), therefore there is some integer k such that

d = | N G ( P ) : C G ( P ) | = p k , 0 k < α .

Note that P C G ( P ) since P is abelian, so

P C G ( P ) N G ( P ) G ,

hence

| G | = | G : N G ( P ) | | N G ( P ) : C G ( P ) | | C G ( P ) : P | | P : 1 | = p α + k | G : N G ( P ) | | C G ( P ) : P | .

Therefore p α + k p α m = | G | , where g . c . d ( m , p ) = 1 , thus p α + k p α . This implies k = 0 , thus | N G ( P ) : C G ( P ) | = p k = 1 , so

N G ( P ) = C G ( P ) .

User profile picture
2026-04-05 11:53
Comments