Normalizer of a subgroup of prime index

  • Context: Undergrad 
  • Thread starter Thread starter Silviu
  • Start date Start date
  • Tags Tags
    Index Prime Subgroup
Click For Summary
SUMMARY

If H is a subgroup of prime index in a finite group G, it is established that either the normalizer N(H) equals G or N(H) equals H. The discussion highlights that since H has prime index, it is cyclic, and the orders of H, N(H), and G are related by the divisibility condition p=ord(H) | ord(N) | ord(G). The conclusion drawn is that either k1=1 or k2=1, where ord(N)=k1p and ord(G)=k2ord(N).

PREREQUISITES
  • Understanding of finite group theory
  • Knowledge of subgroup indices and normalizers
  • Familiarity with cyclic groups and their properties
  • Basic concepts of group order and divisibility
NEXT STEPS
  • Study the properties of cyclic groups in finite group theory
  • Learn about the relationship between normalizers and subgroup indices
  • Explore the implications of Lagrange's theorem in group theory
  • Investigate the structure of groups with prime index subgroups
USEFUL FOR

Mathematicians, particularly those specializing in group theory, educators teaching abstract algebra, and students preparing for advanced studies in algebraic structures.

Silviu
Messages
612
Reaction score
11
Hello! Can anyone help me with this problem?

If H is a subgroup of prime index in a finite group G, show that either N(H)=G or N(H) = H.

Thank you!
 
Physics news on Phys.org
What do you know about the index of a subgroup? And where is ##N_G(H)## settled with respect to ##H## and ##G##?
 
fresh_42 said:
What do you know about the index of a subgroup? And where is ##N_G(H)## settled with respect to ##H## and ##G##?
Well as H has prime index it means it is cyclic. Also we have that p=ord(H) | ord(N) | ord(G). So we should have ord(N)=##k_1##p and ord(G)=##k_2##ord(N)=##k_1## ##k_2## p. So we have to show that either ##k_1##=1 or ##k_2##=1. This is what I got by now. But I don't know what to do next
 
Silviu said:
Well as H has prime index it means it is cyclic. Also we have that p=ord(H) | ord(N) | ord(G). So we should have ord(N)=##k_1##p and ord(G)=##k_2##ord(N)=##k_1## ##k_2## p. So we have to show that either ##k_1##=1 or ##k_2##=1. This is what I got by now. But I don't know what to do next
So p=ord(H) | ord(N) | ord(G) means ##H \leq N_G(H) \leq G##. The index of ##H## is also equal to ##|G/H|##. Do you know what happens, if you factorize ##H## across these inclusions?
 
fresh_42 said:
So p=ord(H) | ord(N) | ord(G) means ##H \leq N_G(H) \leq G##. The index of ##H## is also equal to ##|G/H|##. Do you know what happens, if you factorize ##H## across these inclusions?
Sorry I am a little confused. You mean something like ##|H/H| \le |N(H)/H| \le |G/H| ##? This means ##1 \le |N(H)/H| \le |G/H|##. So what next?
 
If ##|G/H|=p## prime, how many orders fit in between ##1## and ##p##?

The essential part to be confused of, is the fact, that these cosets are possible disregarding whether ##H## is normal or not. Do you know why?
 
fresh_42 said:
If ##|G/H|=p## prime, how many orders fit in between ##1## and ##p##?

The essential part to be confused of, is the fact, that these cosets are possible disregarding whether ##H## is normal or not. Do you know why?
Thank you so much! I kept reading a subgroup of prime order. It is index not order. Now it is easy. Sorry for this and thank you again!
 

Similar threads

  • · Replies 1 ·
Replies
1
Views
1K
  • · Replies 1 ·
Replies
1
Views
589
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 5 ·
Replies
5
Views
2K
  • · Replies 3 ·
Replies
3
Views
1K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 14 ·
Replies
14
Views
3K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 12 ·
Replies
12
Views
4K
  • · Replies 10 ·
Replies
10
Views
3K