Finite normal implies quotient-powering-invariant: Difference between revisions

From Groupprops
 
(2 intermediate revisions by the same user not shown)
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.
 
For instance, for the case <math>G = \mathbb{Q}, H = \mathbb{Z}, p = 2</math>, the identity coset is not covered as the set of squares of any single coset, but is the union of the set of squares of the cosets <math>\mathbb{Z}</math> and <math>\frac{1}{2} + \mathbb{Z}</math>.


===Proof details===
===Proof details===


{{fillin}}
'''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 || Under the map <math>x \mapsto x^p</math>, 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>.
|-
| 6 || For any <math>a \in G/H</math>, there is a unique <math>b \in G/H</matH> such that <math>b^p = a</math>. || || || Step (5) || Just reinterpret the preceding step in the new language.
|}

Latest revision as of 00:44, 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 G is a group and H is a finite normal subgroup of G. Then, H is a quotient-powering-invariant subgroup of G, i.e., for any prime number p such that G is powered over p, so is the quotient group G/H.

Facts used

  1. Left cosets are in bijection via left multiplication

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 H, and the map is the pth 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 pth power map of more than one coset, even though all the maps are injective.

For instance, for the case G=Q,H=Z,p=2, the identity coset is not covered as the set of squares of any single coset, but is the union of the set of squares of the cosets Z and 12+Z.

Proof details

Given: A group G, a finite normal subgroup H of G. A prime number p such that for any gG, there exists a unique xG such that xp=g.

To prove: For any aG/H, there exists bG/H such that bp=a.

Proof:

Step no. Assertion/construction Facts used Given data used Previous steps used Explanation
1 The map xxp in G sends each coset of H to within a coset of H, namely, its pth power in the quotient group structure on G/H. H is normal in G. Direct from definition of quotient group structure.
2 The restriction of the map xxp to any coset is injective from that coset to the target coset (namely, the coset in which the image lands). G is powered over p, i.e., every element has a unique pth root. Step (1) By the fact that G is powered over p, two different elements cannot have the same pth power, so the mapping is injective.
3 The restriction of the map xxp to any coset is bijective from that coset to the target coset (namely, the coset in which the image lands). Fact (1) H is finite Step (2) Since H 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 H in G is contained in the image of at least one coset under the map xxp. G is powered over p, i.e., every element has a pth root. Pick any element in the coset, find a pth root, and take the coset of that.
5 Under the map xxp, every coset a of H in G is the full image of exactly one coset b of H in G, and is not contained in the image of any other coset. G is powered over p, i.e., every element has a unique pth root. Steps (3), (4) By Step (4), we can find a coset b whose image under the pth power map contains some elements of a. By Step (3), this forces that the pth power map sends the elements of the coset b bijectively to a, i.e., every element of the coset a has a pth root in the coset b. By the uniqueness of pth roots, this means that there can be no element outside the coset b whose pth power lies in a.
6 For any aG/H, there is a unique bG/H such that bp=a. Step (5) Just reinterpret the preceding step in the new language.