Proving Finite Index Subgroups in G Have Normal Subgroups of Lower Index

Click For Summary
If H is a subgroup of finite index in G, it can be proven that there exists a normal subgroup K of G, which is a subgroup of H, with an index less than n! in G. The discussion highlights the relationship between the indices of the subgroups, specifically using the equation |G:K| = |G:H||H:K|. A proposed approach involves utilizing the first isomorphism theorem and examining a mapping from G/H to itself, leading to insights about the kernel of the corresponding homomorphism. However, it is noted that the original theorem is not strictly true in all cases, as exemplified by the group S5 and its subgroup S4, where the inequality [G:K] < n! fails. The conclusion emphasizes the need to adjust the theorem to state [G:K] ≤ n! instead.
CornMuffin
Messages
51
Reaction score
5

Homework Statement


Prove: If H is a subgroup with finite index in G
Then there is a normal subgroup K of G such that K is a subgroup of H and K has index less than n! in G.


Homework Equations


Note: |G:H| represents the index of H in G

|G:H| is the number of left cosets of H in G, ie # of elements in {gH: g in G}


The Attempt at a Solution



I haven't had much progress in this proof at all.
The only thing that I can think of using is that |G : K| = |G : H||H : K| for a subgroup K of H

But i don't know what to try.
 
Physics news on Phys.org
CornMuffin said:

Homework Statement


Prove: If H is a subgroup with finite index in G
Then there is a normal subgroup K of G such that K is a subgroup of H and K has index less than n! in G.


Homework Equations


Note: |G:H| represents the index of H in G

|G:H| is the number of left cosets of H in G, ie # of elements in {gH: g in G}


The Attempt at a Solution



I haven't had much progress in this proof at all.
The only thing that I can think of using is that |G : K| = |G : H||H : K| for a subgroup K of H

But i don't know what to try.

Have you tried going from what you have and then using the first iso theorem?
 
suppose that [G:H] = n.

consider the mapping φg: G/H→G/H given by xH→(gx)H for any given g in G.

prove this mapping is a bijection on G/H, for every g in G (hint: it has an inverse, what is it?).

conclude g→φg is a homomorphism of G into Sym(G/H).

what is |Sym(G/H)| (hint: G/H is a set with n elements)?

what can you say about the kernel of the homomorphism g→φg?

*****

note that the theorem, strictly speaking, isn't true. for example, let G = S5, and let H = S4 = {elements of S5 that fix 5}. then [G:H] = 5, but the ONLY normal subgroups of S5 are A5 and {e}, and of these two, only {e} is a subgroup of S4, and {e} has index 5!, in other words, the inequality [G:K] < n! isn't true, but the inequality [G:K] ≤ n! is.
 
Question: A clock's minute hand has length 4 and its hour hand has length 3. What is the distance between the tips at the moment when it is increasing most rapidly?(Putnam Exam Question) Answer: Making assumption that both the hands moves at constant angular velocities, the answer is ## \sqrt{7} .## But don't you think this assumption is somewhat doubtful and wrong?

Similar threads

  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 3 ·
Replies
3
Views
3K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 2 ·
Replies
2
Views
2K
Replies
7
Views
2K
  • · Replies 3 ·
Replies
3
Views
3K
  • · Replies 4 ·
Replies
4
Views
3K
  • · Replies 23 ·
Replies
23
Views
3K