Finite normal implies quotient-powering-invariant
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
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.
For instance, for the case , 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 and .
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 .
|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||Under the map , 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 .|
|6||For any , there is a unique such that .||Step (5)||Just reinterpret the preceding step in the new language.|