Finite normal implies quotient-powering-invariant: Difference between revisions
No edit summary |
|||
| Line 7: | Line 7: | ||
Suppose <math>G</math> is a [[group]] and <math>H</math> is a [[finite normal subgroup]] of <math>G</math>. Then, <math>H</math> is a [[quotient-powering-invariant subgroup]] of <math>G</math>, i.e., for any [[prime number]] <math>p</math> such that <math>G</math> is [[group powered over a set of primes|powered over]] <math>p</math>, so is the [[quotient group]] <math>G/H</math>. | Suppose <math>G</math> is a [[group]] and <math>H</math> is a [[finite normal subgroup]] of <math>G</math>. Then, <math>H</math> is a [[quotient-powering-invariant subgroup]] of <math>G</math>, i.e., for any [[prime number]] <math>p</math> such that <math>G</math> is [[group powered over a set of primes|powered over]] <math>p</math>, so is the [[quotient group]] <math>G/H</math>. | ||
==Facts used== | |||
# [[uses::Left cosets are in bijection via left multiplication]] | |||
==Proof== | ==Proof== | ||
===Proof idea=== | ===Proof idea=== | ||
This is relatively straightforward, and involves using the fact that an injective map between subsets of equal cardinality (here, the subsets are cosets of <math>H</math>, and the map is the <math>p^{th}</matH> power map) must be surjective, and hence the inverse to it is defined. | This is relatively straightforward, and involves using the fact that an injective map between subsets of equal cardinality (here, the subsets are cosets of <math>H</math>, and the map is the <math>p^{th}</matH> power map) must be surjective, and hence the inverse to it is defined. Note that the key way the proof fails for infinite group is that it is possible for the powering map between cosets of an infinite normal subgroup to be such that a given coset is a disjoint union of the images under the <math>p^{th}</math> power map of more than one coset, even though all the maps are injective. | ||
===Proof details=== | ===Proof details=== | ||
{{ | '''Given''': A group <math>G</math>, a finite normal subgroup <math>H</math> of <math>G</math>. A prime number <math>p</math> such that for any <math>g \in G</math>, there exists a unique <math>x \in G</math> such that <math>x^p = g</math>. | ||
'''To prove''': For any <math>a \in G/H</math>, there exists <math>b \in G/H</math> such that <math>b^p = a</math>. | |||
'''Proof''': | |||
{| class="sortable" border="1" | |||
! Step no. !! Assertion/construction !! Facts used !! Given data used !! Previous steps used !! Explanation | |||
|- | |||
| 1 || The map <math>x \mapsto x^p</math> in <math>G</math> sends each coset of <math>H</math> to within a coset of <math>H</math>, namely, its <math>p^{th}</math> power in the quotient group structure on <math>G/H</math>. || || <math>H</math> is normal in <math>G</math>. || || Direct from definition of quotient group structure. | |||
|- | |||
| 2 || The restriction of the map <math>x \mapsto x^p</math> to any coset is injective from that coset to the target coset (namely, the coset in which the image lands). || || <math>G</math> is powered over <math>p</math>, i.e., every element has a unique <math>p^{th}</math> root. || Step (1) || By the fact that <math>G</math> is powered over <math>p</math>, two different elements cannot have the same <math>p^{th}</math> power, so the mapping is injective. | |||
|- | |||
| 3 || The restriction of the map <math>x \mapsto x^p</math> to any coset is bijective from that coset to the target coset (namely, the coset in which the image lands). || Fact (1) || <math>H</math> is finite || Step (2) || Since <math>H</math> is finite, all its cosets are finite and of the same finite size via Fact (1). Thus, the injective map of Step (2) is bijective. | |||
|- | |||
| 4 || Every coset of <math>H</math> in <math>G</math> is contained in the image of at least one coset under the map <math>x \mapsto x^p</math>. || || <math>G</math> is powered over <math>p</math>, i.e., every element has a <math>p^{th}</math> root. || || Pick any element in the coset, find a <math>p^{th}</math> root, and take the coset of that. | |||
|- | |||
| 5 || Every coset <math>a</math> of <math>H</math> in <math>G</math> is the full image of exactly one coset <math>b</math> of <math>H</math> in <math>G</math>, and is not contained in the image of any other coset. || || <math>G</math> is powered over <math>p</math>, i.e., every element has a unique <math>p^{th}</math> root. || Steps (3), (4) || By Step (4), we can find a coset <math>b</math> whose image under the <math>p^{th}</math> power map contains some elements of <math>a</math>. By Step (3), this forces that the <math>p^{th}</math> power map sends the elements of the coset <math>b</math> bijectively to <math>a</math>, i.e., every element of the coset <math>a</math> has a <math>p^{th}</math> root in the coset <math>b</math>. By the uniqueness of <math>p^{th}</math> roots, this means that there can be no element outside the coset <math>b</math> whose <math>p^{th}</math> power lies in <math>a</math>. | |||
|} | |||
Revision as of 00:40, 12 February 2013
This article gives the statement and possibly, proof, of an implication relation between two subgroup properties. That is, it states that every subgroup satisfying the first subgroup property (i.e., finite normal subgroup) must also satisfy the second subgroup property (i.e., quotient-powering-invariant subgroup)
View all subgroup property implications | View all subgroup property non-implications
Get more facts about finite normal subgroup|Get more facts about quotient-powering-invariant subgroup
Statement
Suppose is a group and is a finite normal subgroup of . Then, is a quotient-powering-invariant subgroup of , i.e., for any prime number such that is powered over , so is the quotient group .
Facts used
Proof
Proof idea
This is relatively straightforward, and involves using the fact that an injective map between subsets of equal cardinality (here, the subsets are cosets of , and the map is the power map) must be surjective, and hence the inverse to it is defined. Note that the key way the proof fails for infinite group is that it is possible for the powering map between cosets of an infinite normal subgroup to be such that a given coset is a disjoint union of the images under the power map of more than one coset, even though all the maps are injective.
Proof details
Given: A group , a finite normal subgroup of . A prime number such that for any , there exists a unique such that .
To prove: For any , there exists such that .
Proof:
| Step no. | Assertion/construction | Facts used | Given data used | Previous steps used | Explanation |
|---|---|---|---|---|---|
| 1 | The map in sends each coset of to within a coset of , namely, its power in the quotient group structure on . | is normal in . | Direct from definition of quotient group structure. | ||
| 2 | The restriction of the map to any coset is injective from that coset to the target coset (namely, the coset in which the image lands). | is powered over , i.e., every element has a unique root. | Step (1) | By the fact that is powered over , two different elements cannot have the same power, so the mapping is injective. | |
| 3 | The restriction of the map to any coset is bijective from that coset to the target coset (namely, the coset in which the image lands). | Fact (1) | is finite | Step (2) | Since is finite, all its cosets are finite and of the same finite size via Fact (1). Thus, the injective map of Step (2) is bijective. |
| 4 | Every coset of in is contained in the image of at least one coset under the map . | is powered over , i.e., every element has a root. | Pick any element in the coset, find a root, and take the coset of that. | ||
| 5 | Every coset of in is the full image of exactly one coset of in , and is not contained in the image of any other coset. | is powered over , i.e., every element has a unique root. | Steps (3), (4) | By Step (4), we can find a coset whose image under the power map contains some elements of . By Step (3), this forces that the power map sends the elements of the coset bijectively to , i.e., every element of the coset has a root in the coset . By the uniqueness of roots, this means that there can be no element outside the coset whose power lies in . |