Difference between revisions of "Exactly n elements of order dividing n in a finite solvable group implies the elements form a subgroup"
(→Proof) |
|||
Line 30: | Line 30: | ||
===Case that <math>p</math> divides <math>n</math>=== | ===Case that <math>p</math> divides <math>n</math>=== | ||
− | + | ||
+ | |||
+ | {| class="sortable" border="1" | ||
+ | ! No. !! Assertion/construction !! Facts used !! Given data/assumptions used !! Previous steps used !! Explanation | ||
+ | |- | ||
+ | | 1 || <math>K \subseteq S</math> || || <math>p</math> divides <math>n</math>, <math>K</math> is elementary abelian of order <math>p^i</math>, <math>S</math> comprises all elements whose <math>n^{th}</math> power is the identity || || <toggledisplay>Since <math>K</math> is elementary abelian of order <math>p^i</math>, this in particular means it has exponent <math>p</math>, so every element in it has order <math>1</math> or <math>p</math>. <math>S</math> contains all elements of order dividing <math>n</math>. Thus, it must contain all elements of <math>K</math>.</toggledisplay> | ||
+ | |- | ||
+ | | 2 || Let <math>n = p^jm</math> and <math>|G| = N = p^kl</math> where <math>m,l</math> are relatively prime to <math>p</math>. Then, <math>j \le k</math> and <math>m|l</math>. || || <math>n</math> divides the order of <math>G</math> || || Since <math>n</math> divides the order <math>g</math> of <math>G</math>, the <math>p</math>-part of <math>n</math> must divide the <math>p</math>-part of <math>N</math>, and the <math>p'</math>-part of <math>n</math> must divide the <math>p'</math>-part of <math>N</math>.</toggledisplay> | ||
+ | |- | ||
+ | | 3 || Let <math>u = p^{\max(j-i,0)}m</math>. Then, the order of <math>G/K</math> is divisible by <math>u</math>. || || || || <toggledisplay>This is clear from the fact that the order of <math>G/K</math> equals <math>p^{k-i}l</math>, and since <math>m|l</math> and <math>j \le k</math>, this follows. | ||
+ | |} | ||
+ | |||
+ | (remaining stuff needs to be cleaned up. Numbers may be off). | ||
− | |||
# <math>up</math> divides <math>n</math>: This follows essentially from the fact that exponent of <math>p</math> in <math>u</math> is strictly less than that in <math>n</math>. | # <math>up</math> divides <math>n</math>: This follows essentially from the fact that exponent of <math>p</math> in <math>u</math> is strictly less than that in <math>n</math>. | ||
# There exists some natural number <math>r</math> such that <math>G/K</math> has <math>ru</math> elements of order dividing <math>u</math>: This follows from fact (2). | # There exists some natural number <math>r</math> such that <math>G/K</math> has <math>ru</math> elements of order dividing <math>u</math>: This follows from fact (2). | ||
Line 57: | Line 68: | ||
This follows from the fact that if <math>\alpha</math> is a homomorphism from <math>G</math> to any subgroup of <math>G</math>, then <math>(\alpha(g))^n = \alpha(g^n)</math>. Hence, if <math>g^n = 1</math>, so is <math>(\alpha(g))^n</math>. | This follows from the fact that if <math>\alpha</math> is a homomorphism from <math>G</math> to any subgroup of <math>G</math>, then <math>(\alpha(g))^n = \alpha(g^n)</math>. Hence, if <math>g^n = 1</math>, so is <math>(\alpha(g))^n</math>. | ||
+ | |||
==References== | ==References== | ||
Revision as of 21:41, 26 May 2011
Contents
Statement
Suppose is a Finite solvable group (?), and is a natural number dividing the order of . If there are exactly elements of whose power is the identity element, then these elements form a subgroup. This subgroup is clearly a normal subgroup. In fact, it is a characteristic subgroup, and even better, is a fully characteristic subgroup, a homomorph-containing subgroup and a variety-containing subgroup.
Related facts
- Number of nth roots is a multiple of n
- Number of nth roots of any conjugacy class is a multiple of n
- Exactly n elements of order dividing n implies every finite subgroup is cyclic
Related conjectures
- Frobenius conjecture on nth roots: The conjecture states that the assumption of solvability can be dropped.
Facts used
- Minimal normal implies elementary abelian in finite solvable
- Number of nth roots is a multiple of n
- Solvability is quotient-closed
- Hall subgroups exist in finite solvable
Proof
Given: A group . A natural number . is the set of roots of unity in (i.e., the set of elements of order dividing , and has elements.
To prove: is a subgroup.
Proof: By fact (1), has a nontrivial elementary abelian normal subgroup of order for some prime power dividing the order of . We split the proof into two cases, based on whether divides or not.
Case that divides
No. | Assertion/construction | Facts used | Given data/assumptions used | Previous steps used | Explanation |
---|---|---|---|---|---|
1 | divides , is elementary abelian of order , comprises all elements whose power is the identity | [SHOW MORE] | |||
2 | Let and where are relatively prime to . Then, and . | divides the order of | Since divides the order of , the -part of must divide the -part of , and the -part of must divide the -part of .</toggledisplay> | ||
3 | Let . Then, the order of is divisible by . | <toggledisplay>This is clear from the fact that the order of equals , and since and , this follows. |
(remaining stuff needs to be cleaned up. Numbers may be off).
- divides : This follows essentially from the fact that exponent of in is strictly less than that in .
- There exists some natural number such that has elements of order dividing : This follows from fact (2).
- Let be the quotient map. The set of elements such that has size : This follows from step (3).
- If , we have : This follows from the fact that the order of any element in is either or .
- If , we have : This follows from the previous step and step (2), which says that .
- and : By steps (3) and (5), there are at least elements for which . Thus, . Simplifying, we obtain that . This forces and . Further, since equality holds even under these assumptions, we conclude that the solutions to exhaust all solutions to .
- The set of elements such that forms a subgroup. In particular, is a subgroup: By the previous step, , so there are exactly solutions in to . By fact (3), is solvable, so the induction hypothesis applies, and the set of solutions forms a subgroup.
- is a subgroup: It is the inverse image in of a subgroup of .
Case that does not divide
- divides the order of : This follows because divides the order of and is relatively prime to .
- The number of elements such that is for some natural number : This follows from fact (2).
- For every coset of in such that , there exists an element such that : Start with some element in the coset. Let . By definition, . Now, find an integer such that (this can be done since and are relatively prime). Let and let . Note that since is a power of , which in turn is a power of , commutes with . Thus, if , then since is a multiple of , and . Further, , so . Thus, we have found an element of whose order divides .
- There are at least solutions to in : This follows from steps (2) and (3).
- , and there are exactly solutions to in : This follows from the previous step and the assumption that there are exactly solutions.
- The set of solutions to in forms a subgroup, say : By fact (3), is solvable, so we can apply the induction hypothesis to the conclusion of the previous step.
- The inverse image, say of this subgroup of in is a group of order , where is relatively prime to .
- has a -complement, i.e., a Hall subgroup of order : This follows from fact (4).
- This Hall subgroup of order is precisely equal to the set of solutions to : All elements in the Hall subgroup of order are solutions to , and we know that there are exactly solutions. Hence, these must be the only solutions.
Proof that the subgroup is normal, characteristic and fully characteristic
This follows from the fact that if is a homomorphism from to any subgroup of , then . Hence, if , so is .
References
Textbook references
- The Theory of Groups by Marshall Hall, Jr., Page 145, Theorem 9.4.1, ^{More info}