Normal subgroup

In abstract algebra, a normal subgroup is a subgroup that is invariant under conjugation by members of the group of which it is a part. In other words, a subgroup N of the group G is normal in G if and only if gng−1N for all gG and nN. The usual notation for this relation is .

Normal subgroups are important because they (and only they) can be used to construct quotient groups of the given group. Furthermore, the normal subgroups of G are precisely the kernels of group homomorphisms with domain G, which means that they can be used to internally classify those homomorphisms.

Évariste Galois was the first to realize the importance of the existence of normal subgroups.[1]

Definitions

A subgroup N of a group G is called a normal subgroup of G if it is invariant under conjugation; that is, the conjugation of an element of N by an element of G is always in N.[2] The usual notation for this relation is , and the definition may be written in symbols as

Equivalent conditions

For any subgroup N of G, the following conditions are equivalent to N being a normal subgroup of G. Therefore, any one of them may be taken as the definition:

  • Any two elements commute regarding the normal subgroup membership relation: g, hG, ghNhgN.
  • The image of conjugation of N by any element of G is a subset of N: gG, gNg−1N.[3]'
  • The image of conjugation of N by any element of G is N: gG, gNg−1 = N.[3]
  • gG, gN = Ng.[3]
  • The sets of left and right cosets of N in G coincide.[3]
  • The product of an element of the left coset of N with respect to g and an element of the left coset of N with respect to h is an element of the left coset of N with respect to gh: x, y, g, hG, if xgN and yhN then xy(gh)N.
  • N is a union of conjugacy classes of G: N = ⋃gN Cl(g).[1]
  • N is preserved by inner automorphisms.[4]
  • For all and , the commutator is in N.
  • There is some group homomorphism G H whose kernel is N.[1]

Examples

  • The trivial subgroup {e} consisting of just the identity element of G and G itself are always normal subgroups of G. If these are the only normal subgroups, then G is said to be simple.[5]
  • The translation group is a normal subgroup of the Euclidean group in any dimension.[6] This means: applying a rigid transformation, followed by a translation and then the inverse rigid transformation, has the same effect as a single translation (though typically a different one than the one we used earlier). By contrast, the subgroup of all rotations about the origin is not a normal subgroup of the Euclidean group, as long as the dimension is at least 2: first translating, then rotating about the origin, and then translating back will typically not fix the origin and will therefore not have the same effect as a single rotation about the origin.
  • Every subgroup N of an abelian group G is normal, because A group that is not abelian but for which every subgroup is normal is called a Hamiltonian group.[7]
  • The center of a group is a normal subgroup.[8]
  • More generally, any characteristic subgroup is normal, since conjugation is always an automorphism.[9]
  • In the Rubik's Cube group, the subgroups consisting of operations which only affect the orientations of either the corner pieces or the edge pieces are normal.[10]
  • The commutator subgroup is a normal subgroup of [11]. Given elements and , the commutator of these two elements is . Now, because the commutator is closed under multiplication and , the commutator is a normal subgroup.

Properties

  • If H is a normal subgroup of G, and K is a subgroup of G containing H, then H is a normal subgroup of K.[12]
  • A normal subgroup of a normal subgroup of a group need not be normal in the group. That is, normality is not a transitive relation. The smallest group exhibiting this phenomenon is the dihedral group of order 8.[13] However, a characteristic subgroup of a normal subgroup is normal.[14] A group in which normality is transitive is called a T-group.[15]
  • The two groups G and H are normal subgroups of their direct product G × H.
  • If the group G is a semidirect product , then N is normal in G, though H need not be normal in G.
  • Normality is preserved under surjective homomorphisms,[16] i.e. if G H is a surjective group homomorphism and N is normal in G, then the image f(N) is normal in H.
  • Normality is preserved by taking inverse images,[16] i.e. if G H is a group homomorphism and N is normal in H, then the inverse image f -1(N) is normal in G.
  • Normality is preserved on taking direct products,[17] i.e. if and , then .
  • Every subgroup of index 2 is normal. More generally, a subgroup, H, of finite index, n, in G contains a subgroup, K, normal in G and of index dividing n! called the normal core. In particular, if p is the smallest prime dividing the order of G, then every subgroup of index p is normal.[18]
  • The fact that normal subgroups of G are precisely the kernels of group homomorphisms defined on G accounts for some of the importance of normal subgroups; they are a way to internally classify all homomorphisms defined on a group. For example, a non-identity finite group is simple if and only if it is isomorphic to all of its non-identity homomorphic images,[19] a finite group is perfect if and only if it has no normal subgroups of prime index, and a group is imperfect if and only if the derived subgroup is not supplemented by any proper normal subgroup.

Lattice of normal subgroups

Given two normal subgroups, N and M, of G, their intersection and their product are also normal subgroups of G.

The normal subgroups of G form a lattice under subset inclusion with least element, {e} , and greatest element, G. The meet of two normal subgroups, N and M, in this lattice is their intersection and the join is their product.

The lattice is complete and modular.[17]

Normal subgroups, quotient groups and homomorphisms

If N is a normal subgroup, we can define a multiplication on cosets as follows:

This relation defines a mapping . To show that this mapping is well-defined, one needs to prove that the choice of representative elements does not affect the result. To this end, consider some other representative elements . Then there are such that . It follows that

where we also used the fact that is a normal subgroup, and therefore there is such that . This proves that this product is a well-defined mapping between cosets.

With this operation, the set of cosets is itself a group, called the quotient group and denoted with G/N. There is a natural homomorphism, f: GG/N, given by f(a) = aN. This homomorphism maps into the identity element of G/N, which is the coset eN = N,[20] that is, .

In general, a group homomorphism, f: GH sends subgroups of G to subgroups of H. Also, the preimage of any subgroup of H is a subgroup of G. We call the preimage of the trivial group {e} in H the kernel of the homomorphism and denote it by ker(f). As it turns out, the kernel is always normal and the image of G, f(G), is always isomorphic to G/ker(f) (the first isomorphism theorem).[21] In fact, this correspondence is a bijection between the set of all quotient groups of G, G/N, and the set of all homomorphic images of G (up to isomorphism).[22] It is also easy to see that the kernel of the quotient map, f: GG/N, is N itself, so the normal subgroups are precisely the kernels of homomorphisms with domain G.[23]

gollark: `+` is right-to-left compose, `-` is left-to-right compose.
gollark: We could add that as their tostring method instead.
gollark: What should we do with functions? Composition?
gollark: Except no, because there's no single table metatable... sad.
gollark: We could make concating tables merge their keys/values!

See also

Operations taking subgroups to subgroups

Subgroup properties complementary (or opposite) to normality

Subgroup properties stronger than normality

Subgroup properties weaker than normality

Notes

  1. Cantrell 2000, p. 160.
  2. Dummit & Foote 2004.
  3. Hungerford 2003, p. 41.
  4. Fraleigh 2003, p. 141.
  5. Robinson 1996, p. 16.
  6. Thurston 1997, p. 218.
  7. Hall 1999, p. 190.
  8. Hungerford 2003, p. 45.
  9. Hall 1999, p. 32.
  10. Bergvall et al. 2010, p. 96.
  11. Hall 1999, p. 138.
  12. Hungerford 2003, p. 42.
  13. Robinson 1996, p. 17.
  14. Robinson 1996, p. 28.
  15. Robinson 1996, p. 402.
  16. Hall 1999, p. 29.
  17. Hungerford 2003, p. 46.
  18. Robinson 1996, p. 36.
  19. Dõmõsi & Nehaniv 2004, p. 7.
  20. Hungerford 2003, pp. 42–43.
  21. Hungerford 2003, p. 44.
  22. Robinson 1996, p. 20.
  23. Hall 1999, p. 27.

References

  • Bergvall, Olof; Hynning, Elin; Hedberg, Mikael; Mickelin, Joel; Masawe, Patrick (16 May 2010). "On Rubik's Cube" (PDF). KTH. Cite journal requires |journal= (help)CS1 maint: ref=harv (link)
  • Cantrell, C.D. (2000). Modern Mathematical Methods for Physicists and Engineers. Cambridge University Press. ISBN 978-0-521-59180-5.CS1 maint: ref=harv (link)
  • Dõmõsi, Pál; Nehaniv, Chrystopher L. (2004). Algebraic Theory of Automata Networks. SIAM Monographs on Discrete Mathematics and Applications. SIAM.CS1 maint: ref=harv (link)
  • Dummit, David S.; Foote, Richard M. (2004). Abstract Algebra (3rd ed.). John Wiley & Sons. ISBN 0-471-43334-9.CS1 maint: ref=harv (link)
  • Fraleigh, John B. (2003). A First Course in Abstract Algebra (7th ed.). Addison-Wesley. ISBN 978-0-321-15608-2.CS1 maint: ref=harv (link)
  • Hall, Marshall (1999). The Theory of Groups. Providence: Chelsea Publishing. ISBN 978-0-8218-1967-8.CS1 maint: ref=harv (link)
  • Hungerford, Thomas (2003). Algebra. Graduate Texts in Mathematics. Springer.CS1 maint: ref=harv (link)
  • Robinson, Derek J. S. (1996). A Course in the Theory of Groups. Graduate Texts in Mathematics. 80 (2nd ed.). Springer-Verlag. ISBN 978-1-4612-6443-9. Zbl 0836.20001.CS1 maint: ref=harv (link)
  • Thurston, William (1997). Levy, Silvio (ed.). Three-dimensional geometry and topology, Vol. 1. Princeton Mathematical Series. Princeton University Press. ISBN 978-0-691-08304-9.CS1 maint: ref=harv (link)

Further reading

  • I. N. Herstein, Topics in algebra. Second edition. Xerox College Publishing, Lexington, Mass.-Toronto, Ont., 1975. xi+388 pp.
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.