Hubbry Logo
Normal subgroupNormal subgroupMain
Open search
Normal subgroup
Community hub
Normal subgroup
logo
8 pages, 0 posts
0 subscribers
Be the first to start a discussion here.
Be the first to start a discussion here.
Contribute something
Normal subgroup
Normal subgroup
from Wikipedia

In abstract algebra, a normal subgroup (also known as an invariant subgroup or self-conjugate subgroup)[1] is a subgroup that is invariant under conjugation by members of the group of which it is a part. In other words, a subgroup of the group is normal in if and only if for all and 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 are precisely the kernels of group homomorphisms with domain 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.[2]

Definitions

[edit]

A subgroup of a group is called a normal subgroup of if it is invariant under conjugation; that is, the conjugation of an element of by an element of is always in [3] The usual notation for this relation is

Equivalent conditions

[edit]

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

  • The image of conjugation of by any element of is a subset of [4] i.e., for all .
  • The image of conjugation of by any element of is equal to [4] i.e., for all .
  • For all the left and right cosets and are equal.[4]
  • The sets of left and right cosets of in coincide.[4]
  • Multiplication in preserves the equivalence relation "is in the same left coset as". That is, for every satisfying and , we have
  • There exists a group on the set of left cosets of where multiplication of any two left cosets and yields the left coset . (This group is called the quotient group of modulo , denoted .)
  • is a union of conjugacy classes of [2]
  • is preserved by the inner automorphisms of [5]
  • There is some group homomorphism whose kernel is [2]
  • There exists a group homomorphism whose fibers form a group where the identity element is and multiplication of any two fibers and yields the fiber . (This group is the same group mentioned above.)
  • There is some congruence relation on for which the equivalence class of the identity element is .
  • For all and the commutator is in [citation needed]
  • Any two elements commute modulo the normal subgroup membership relation. That is, for all if and only if [citation needed]

Examples

[edit]

For any group the trivial subgroup consisting of just the identity element of is always a normal subgroup of Likewise, itself is always a normal subgroup of (If these are the only normal subgroups, then is said to be simple.)[6] Other named normal subgroups of an arbitrary group include the center of the group (the set of elements that commute with all other elements) and the commutator subgroup [7][8] More generally, since conjugation is an isomorphism, any characteristic subgroup is a normal subgroup.[9]

If is an abelian group then every subgroup of is normal, because More generally, for any group , every subgroup of the center of is normal in . (In the special case that is abelian, the center is all of , hence the fact that all subgroups of an abelian group are normal.) A group that is not abelian but for which every subgroup is normal is called a Hamiltonian group.[10]

A concrete example of a normal subgroup is the subgroup of the symmetric group consisting of the identity and both three-cycles. In particular, one can check that every coset of is either equal to itself or is equal to On the other hand, the subgroup is not normal in since [11] This illustrates the general fact that any subgroup of index two is normal.

As an example of a normal subgroup within a matrix group, consider the general linear group of all invertible matrices with real entries under the operation of matrix multiplication and its subgroup of all matrices of determinant 1 (the special linear group). To see why the subgroup is normal in , consider any matrix in and any invertible matrix . Then using the two important identities and , one has that , and so as well. This means is closed under conjugation in , so it is a normal subgroup.[a]

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.[12]

The translation group is a normal subgroup of the Euclidean group in any dimension.[13] This means: applying a rigid transformation, followed by a translation and then the inverse rigid transformation, has the same effect as a single translation. 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.

Properties

[edit]
  • If is a normal subgroup of and is a subgroup of containing then is a normal subgroup of [14]
  • 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.[15] However, a characteristic subgroup of a normal subgroup is normal.[16] A group in which normality is transitive is called a T-group.[17]
  • The two groups and are normal subgroups of their direct product
  • If the group is a semidirect product then is normal in though need not be normal in
  • If and are normal subgroups of an additive group such that and , then [18]
  • Normality is preserved under surjective homomorphisms;[19] that is, if is a surjective group homomorphism and is normal in then the image is normal in
  • Normality is preserved by taking inverse images;[19] that is, if is a group homomorphism and is normal in then the inverse image is normal in
  • Normality is preserved on taking direct products;[20] that is, if and then
  • Every subgroup of index 2 is normal. More generally, a subgroup, of finite index, in contains a subgroup, normal in and of index dividing called the normal core. In particular, if is the smallest prime dividing the order of then every subgroup of index is normal.[21]
  • The fact that normal subgroups of are precisely the kernels of group homomorphisms defined on 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,[22] 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

[edit]

Given two normal subgroups, and of their intersection and their product are also normal subgroups of

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

The lattice is complete and modular.[20]

Normal subgroups, quotient groups and homomorphisms

[edit]

If 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 There is a natural homomorphism, given by This homomorphism maps into the identity element of which is the coset [23] that is,

In general, a group homomorphism, sends subgroups of to subgroups of Also, the preimage of any subgroup of is a subgroup of We call the preimage of the trivial group in the kernel of the homomorphism and denote it by As it turns out, the kernel is always normal and the image of is always isomorphic to (the first isomorphism theorem).[24] In fact, this correspondence is a bijection between the set of all quotient groups of and the set of all homomorphic images of (up to isomorphism).[25] It is also easy to see that the kernel of the quotient map, is itself, so the normal subgroups are precisely the kernels of homomorphisms with domain [26]

See also

[edit]

Notes

[edit]

References

[edit]

Bibliography

[edit]

Further reading

[edit]
[edit]
Revisions and contributorsEdit on WikipediaRead on Wikipedia
from Grokipedia
In , a normal subgroup of a group GG is a subgroup HH that remains unchanged under conjugation by any element of GG, satisfying gHg1=HgHg^{-1} = H for all gGg \in G. This invariance, also known as being invariant or self-conjugate, distinguishes normal subgroups from ordinary and is denoted by HGH \triangleleft G. An equivalent characterization is that the left and right cosets of HH in GG coincide, meaning gH=HggH = Hg for every gGg \in G. In abelian groups, every is normal due to the commutativity of the group operation. For non-abelian groups, such as the S3S_3, the alternating A3A_3 (consisting of even permutations) serves as a classic example of a normal subgroup. Normal subgroups are fundamental to because they allow the formation of quotient groups or factor groups, where the cosets of HH in GG form a new group under the induced operation, providing insight into the structure of GG. This construction is essential for concepts like , where the kernel of a is always normal, and for analyzing solvability and in finite groups.

Definitions

Formal Definition

A subgroup NN of a group GG is called normal, denoted NGN \triangleleft G, if for every gGg \in G and every nNn \in N, the conjugate gng1g n g^{-1} also belongs to NN. Equivalently, the set gNg1={gng1nN}g N g^{-1} = \{ g n g^{-1} \mid n \in N \} equals NN for all gGg \in G. This conjugation condition implies that GG acts on NN by the map ngng1n \mapsto g n g^{-1} for each fixed gGg \in G, and normality ensures that NN is invariant as a set under this . The concept of a normal subgroup was introduced by around 1832, initially termed an "invariant" subgroup, in his work on the solvability of equations by radicals; the modern terminology "normal" appeared later, formalized in treatments by mathematicians such as Camille Jordan in 1870. To verify normality directly, one checks the conjugation condition for all gGg \in G and nNn \in N, often by examining generators of NN if finitely generated. In particular, the trivial subgroup {e}\{ e \} (where ee is the identity) is always normal, since geg1=e{e}g e g^{-1} = e \in \{ e \} for all gGg \in G. Similarly, GG itself is normal in GG, as conjugation by any gGg \in G is an of GG, so gGg1=Gg G g^{-1} = G.

Equivalent Conditions

A subgroup NN of a group GG is normal if and only if it satisfies the conjugation invariance condition: gNg1=NgNg^{-1} = N for all gGg \in G. This is equivalent to gng1Ngng^{-1} \in N for all gGg \in G and nNn \in N. One standard equivalent condition is that the left and right s of NN coincide: gN=NggN = Ng for all gGg \in G. To see this, assume gNg1=NgNg^{-1} = N; then multiplying on the right by gg gives gN=NggN = Ng. Conversely, if gN=NggN = Ng, then for any nNn \in N, gn=nggn = ng' for some gGg' \in G, so gn=ng=n(gg1)g=nhggn = ng' = n(gg^{-1})g' = n h g where h=gg1Gh = gg^{-1} \in G, but more directly, gng1=(gn)g1Ng1=g1gNg1=gNg1g n g^{-1} = (g n) g^{-1} \in N g^{-1} = g^{-1} g N g^{-1} = g N g^{-1}, and since gN=Ngg N = N g, it follows that gng1Ng n g^{-1} \in N. Thus, the coset condition implies conjugation invariance. Another equivalent condition is that NN is the kernel of some group homomorphism ϕ:GK\phi: G \to K for a group KK. Kernels are always normal subgroups because if nN=kerϕn \in N = \ker \phi, then for any gGg \in G, ϕ(gng1)=ϕ(g)ϕ(n)ϕ(g)1=ϕ(g)eϕ(g)1=e\phi(g n g^{-1}) = \phi(g) \phi(n) \phi(g)^{-1} = \phi(g) e \phi(g)^{-1} = e, so gng1kerϕ=Ng n g^{-1} \in \ker \phi = N. Conversely, if NN is normal, the quotient map to G/NG/N (detailed in the Quotient Groups section) has NN as its kernel. Normality is also equivalent to NN containing all commutators of the form [g,n]=gng1n1[g, n] = g n g^{-1} n^{-1} for gGg \in G and nNn \in N, i.e., [G,N]N[G, N] \leq N. To derive this, note that if NN is normal, then gng1Ng n g^{-1} \in N, so [g,n]=(gng1)n1N[g, n] = (g n g^{-1}) n^{-1} \in N. Conversely, if [G,N]N[G, N] \leq N, then for nNn \in N, gng1=[g,n]nNg n g^{-1} = [g, n] n \in N, since both factors are in NN. These conditions are mutually equivalent through the conjugation invariance. For instance, the coset condition implies the commutator condition via gn=ngg n = n' g for n=gng1Nn' = g n g^{-1} \in N, yielding [g,n]=nn1N[g, n] = n' n^{-1} \in N. The kernel condition follows from normality enabling the quotient homomorphism. A subgroup NN is normal if and only if it is a union of conjugacy classes of GG. This holds because conjugacy classes are the orbits under conjugation, and normality means NN is invariant under conjugation, hence a of such orbits (including the identity class). The converse follows directly from the conjugation condition.

Examples

In Abelian and Nilpotent Groups

In abelian groups, every is normal. This property arises from the commutativity of the group operation: for any elements gGg \in G and nNn \in N where NN is a , the conjugate gng1=ng n g^{-1} = n, since gn=ngg n = n g. A representative example is the additive group of integers Z\mathbb{Z}, whose subgroups are of the form nZn\mathbb{Z} for integers n0n \geq 0; each such satisfies the normality condition due to the abelian structure. Cyclic groups provide further illustration, as they are abelian and their subgroups correspond directly to divisors of the group order. For a cyclic group GG of order mm, the subgroups are gm/d\langle g^{m/d} \rangle for each divisor dd of mm, and all are normal. The Klein four-group V4Z/2Z×Z/2ZV_4 \cong \mathbb{Z}/2\mathbb{Z} \times \mathbb{Z}/2\mathbb{Z}, an abelian group of order 4, has three proper nontrivial subgroups, each isomorphic to Z/2Z\mathbb{Z}/2\mathbb{Z}, and all are normal. To verify normality in an abelian group like Z×Z\mathbb{Z} \times \mathbb{Z}, consider the subgroup HH generated by (2,0)(2,0), which consists of elements (2k,0)(2k, 0) for kZk \in \mathbb{Z}. For any (a,b)Z×Z(a,b) \in \mathbb{Z} \times \mathbb{Z} and (2k,0)H(2k,0) \in H, the conjugate is (a,b)+(2k,0)(a,b)=(2k,0)(a,b) + (2k,0) - (a,b) = (2k,0), confirming HH is normal. Nilpotent groups extend this notion beyond strict abelian cases, featuring characteristic normal subgroups in their upper central series. The upper central series of a group GG is the sequence Z0(G)={e}Z1(G)Z2(G)Z_0(G) = \{ e \} \subseteq Z_1(G) \subseteq Z_2(G) \subseteq \cdots, where Zk+1(G)/Zk(G)Z_{k+1}(G)/Z_k(G) is contained in the center of G/Zk(G)G/Z_k(G), and each Zk(G)Z_k(G) is normal in GG. The quaternion group Q8={±1,±i,±j,±k}Q_8 = \{ \pm 1, \pm i, \pm j, \pm k \} with relations i2=j2=k2=ijk=1i^2 = j^2 = k^2 = ijk = -1 is nilpotent of class 2; its center Z(Q8)={±1}Z(Q_8) = \{ \pm 1 \} and derived subgroup Q8={±1}Q_8' = \{ \pm 1 \} are both normal, as are all its proper subgroups. In contrast to these structures, non-abelian groups generally possess subgroups that are not normal.

In Symmetric and Alternating Groups

In the SnS_n, the AnA_n, consisting of all even , forms a normal subgroup of index 2 for n3n \geq 3. This normality follows from AnA_n being the kernel of the sgn:Sn{±1}\operatorname{sgn}: S_n \to \{\pm 1\}, which maps each to the parity of its number of inversions (or equivalently, the of the ); kernels of are always normal subgroups. Alternatively, since subgroups of index 2 are normal, and Sn:An=2|S_n : A_n| = 2 with An=n!/2|A_n| = n!/2, this confirms the result; moreover, AnA_n is the unique such subgroup because any other index-2 subgroup would also be the kernel of a to Z/2Z\mathbb{Z}/2\mathbb{Z}, but the is the only nontrivial one up to . The trivial subgroup {[e](/page/E!)}\{[e](/page/E!)\} and SnS_n itself are always normal in SnS_n. For n5n \geq 5, these, along with AnA_n, are the only normal subgroups of SnS_n; there are no other proper nontrivial normal subgroups. In the AnA_n, the structure of normal subgroups varies with nn. For n5n \geq 5, AnA_n is simple, meaning it has no nontrivial proper normal subgroups beyond {[e](/page/E!)}\{[e](/page/E!)\} and AnA_n itself. However, for smaller nn, exceptions arise: in A4A_4, the V={e,(12)(34),(13)(24),(14)(23)}V = \{e, (12)(34), (13)(24), (14)(23)\} is a normal subgroup of order 4, consisting of the identity and the three double transpositions, which form a single in A4A_4. Dihedral groups DmD_m, which describe the symmetries of a regular mm-gon and embed as subgroups of SmS_m via the action on vertices, provide further examples of normal subgroups in permutation groups. The subgroup r\langle r \rangle, generated by a rr of order mm, has index 2 in DmD_m and is thus normal. For the specific case of D4D_4 (order 8, symmetries of the square, embedded in S4S_4), explicit conjugation verifies this: label vertices 1,2,3,4 clockwise, with r=(1234)r = (1234) and reflections like s=(24)s = (24); then for any reflection ss' (e.g., s=(13)s' = (13)), srs1=r1=(1432)rs' r s'^{-1} = r^{-1} = (1432) \in \langle r \rangle, confirming closure under conjugation. A contrasting example occurs in S3S_3, the on 3 letters (order 6, isomorphic to D3D_3). The A3=(123)A_3 = \langle (123) \rangle, generated by the 3-cycle and consisting of even permutations {e,(123),(132)}\{e, (123), (132)\}, is normal as it coincides with the of index 2. However, the generated by a transposition, such as (12)={e,(12)}\langle (12) \rangle = \{e, (12)\}, is not normal: conjugation by (13)(13) yields (13)(12)(13)1=(23)(12)(13)(12)(13)^{-1} = (23) \notin \langle (12) \rangle.

Properties

Closure and Basic Properties

Normal subgroups exhibit closure properties under basic set operations within the group. Specifically, the of two normal subgroups of a group GG is itself a normal subgroup of GG. Let NN and MM be normal subgroups of GG. For any gGg \in G and xNMx \in N \cap M, since NGN \trianglelefteq G and MGM \trianglelefteq G, it follows that g1xgNg^{-1} x g \in N and g1xgMg^{-1} x g \in M, so g1xgNMg^{-1} x g \in N \cap M. Thus, NMGN \cap M \trianglelefteq G. The product of two normal subgroups is also normal. Let N,MGN, M \trianglelefteq G, and define NM={nmnN,mM}NM = \{ nm \mid n \in N, m \in M \}. For any gGg \in G and x=nmNMx = nm \in NM, compute g1xg=g1(nm)g=(g1ng)(g1mg)g^{-1} x g = g^{-1} (nm) g = (g^{-1} n g)(g^{-1} m g). Since NGN \trianglelefteq G and MGM \trianglelefteq G, g1ngNg^{-1} n g \in N and g1mgMg^{-1} m g \in M, so g1xgNMg^{-1} x g \in NM. Therefore, NMGNM \trianglelefteq G. If GG is finite, the order of NMNM satisfies NM=NM/NM|NM| = |N| |M| / |N \cap M|, as the map N×MNMN \times M \to NM given by (n,m)nm(n, m) \mapsto nm has kernel {(n,m)nm=e}NM\{(n, m) \mid nm = e\} \cong N \cap M. A normal subgroup consists of entire conjugacy classes. If NGN \trianglelefteq G and nNn \in N, then for any gGg \in G, the conjugate gng1Ng n g^{-1} \in N by the definition of normality, so the of nn is contained in NN. Since this holds for every nNn \in N and NN contains the identity (its own ), NN is a union of es of GG. The index of a normal subgroup relates directly to the group's order via . If NGN \trianglelefteq G and GG is finite, the G/NG/N has order [G:N][G : N], so G=N[G:N]|G| = |N| \cdot [G : N] and thus [G:N][G : N] divides G|G|. Associated with any subgroup are the normal core and normal closure in GG. The normal core of a subgroup HGH \leq G is the largest normal subgroup of GG contained in HH, given by coreG(H)=gGgHg1\mathrm{core}_G(H) = \bigcap_{g \in G} g H g^{-1}. The normal closure of HH is the smallest normal subgroup of GG containing HH. Normal subgroups are preserved under group automorphisms in the sense that their images remain normal. If NGN \trianglelefteq G and ϕAut(G)\phi \in \mathrm{Aut}(G), then ϕ(N)G\phi(N) \trianglelefteq G, because automorphisms preserve the group operation and conjugation: for gGg \in G and nNn \in N, ϕ(g)1ϕ(n)ϕ(g)=ϕ(g1ng)ϕ(N)\phi(g)^{-1} \phi(n) \phi(g) = \phi(g^{-1} n g) \in \phi(N) since g1ngNg^{-1} n g \in N.

Lattice of Normal Subgroups

The set of all normal subgroups of a group GG, ordered by inclusion, forms a lattice known as the normal subgroup lattice of GG. In this lattice, the meet of two normal subgroups HH and KK is their HKH \cap K, which is itself normal in GG. The join of HH and KK is the subgroup generated by their union, denoted HK\langle H \cup K \rangle or equivalently HKHK since both are normal, and this join is also normal in GG. This normal subgroup lattice is always modular. Modularity means that for any normal subgroups LKL \subseteq K and HH, the identity L(HK)=(LH)KL \vee (H \wedge K) = (L \vee H) \wedge K holds, where \vee denotes join and \wedge denotes meet. This property inherits from the broader subgroup lattice but applies specifically to normals due to their closure under conjugation. In the special case of abelian groups, where all subgroups are normal, the lattice is distributive; for example, in the infinite cyclic group Z\mathbb{Z}, the normal subgroups are precisely the subgroups nZn\mathbb{Z} for n0n \geq 0, forming a under inclusion: Z2Z4Z\mathbb{Z} \supseteq 2\mathbb{Z} \supseteq 4\mathbb{Z} \supseteq \dots, which is a distributive lattice. By the correspondence theorem, the normal subgroups of GG containing a fixed normal subgroup NN are in bijective correspondence with the normal subgroups of the G/NG/N, preserving the lattice structure under inclusion. Concrete examples illustrate the structure. In the S3S_3, the normal subgroups are the trivial subgroup {e}\{e\}, the alternating subgroup A3A_3 of index 2, and S3S_3 itself, forming a lattice of length 2. A subnormal series of GG is a of subgroups where each is normal in the previous one, providing a path in the normal subgroup lattice from GG to the trivial subgroup; such series connect to more advanced concepts like .

Quotients and Homomorphisms

Quotient Groups

If NN is a normal subgroup of a group GG, the G/NG/N is defined as the set of all left cosets of NN in GG, equipped with the (gN)(hN)=ghN(gN)(hN) = ghN for g,hGg, h \in G. This operation is well-defined, meaning it does not depend on the choice of representatives gg and hh from their respective cosets, precisely because NN is normal. To see this, suppose g=gng' = gn and h=hmh' = hm for some n,mNn, m \in N; then (gN)(hN)=(gn)(hm)N=gnhmN=g(h(h1nh)m)N=gh((h1nh)m)N(g'N)(h'N) = (gn)(hm)N = gnhmN = g(h(h^{-1}nh)m)N = gh((h^{-1}nh)m)N. Since NN is normal, h1nhNh^{-1}nh \in N, and (h1nh)mN(h^{-1}nh)m \in N as NN is a , so this equals ghNghN. The set G/NG/N forms a group under this operation. Associativity follows from that of GG: ((gN)(hN))(kN)=(ghN)(kN)=ghkN=gN(hN(kN))((gN)(hN))(kN) = (ghN)(kN) = ghkN = gN(hN(kN)). The is the coset NN, since gNN=gN=NgNgN \cdot N = gN = N \cdot gN. Inverses exist as (gN)1=g1N(gN)^{-1} = g^{-1}N, because gNg1N=gg1N=NgN \cdot g^{-1}N = gg^{-1}N = N and similarly for the other side. The order of the quotient group satisfies G/N=[G:N]=G/N|G/N| = [G : N] = |G|/|N|, the index of NN in GG. For example, taking N=nZN = n\mathbb{Z} in the additive group Z\mathbb{Z} yields the cyclic group Z/nZ\mathbb{Z}/n\mathbb{Z} of order nn. Another instance is the quotient S3/A3Z/2ZS_3 / A_3 \cong \mathbb{Z}/2\mathbb{Z}, where S3S_3 is the symmetric group on three letters and A3A_3 its alternating subgroup of order 3, so the quotient has order 2. If NHGN \leq H \trianglelefteq G with NN normal in GG, then H/NH/N is a normal subgroup of G/NG/N, and the quotient (G/N)/(H/N)(G/N)/(H/N) is isomorphic to G/HG/H. This is a preview of the third . The first states that for a ϕ:GK\phi: G \to K, the quotient G/kerϕG / \ker \phi is isomorphic to the imϕ\operatorname{im} \phi, connecting quotients directly to homomorphisms (with kernel details addressed separately). Subgroups that are not normal fail to produce quotient groups because the coset multiplication is not well-defined. For instance, in S3S_3, the subgroup H=(1 2)H = \langle (1\ 2) \rangle is not normal; consider the product of cosets H(1 3)HH \cdot (1\ 3)H: using representatives ee and (1 3)(1\ 3) gives (1 3)H(1\ 3)H, but using (1 2)(1\ 2) from HH and (1 3)(1\ 3) gives (1 2)(1 3)H=(1 3 2)H(1\ 2)(1\ 3)H = (1\ 3\ 2)H, and (1 3 2)H={(1 3 2),(1 3)}{(1 3),(1 2 3)}=(1 3)H(1\ 3\ 2)H = \{(1\ 3\ 2), (1\ 3)\} \neq \{(1\ 3), (1\ 2\ 3)\} = (1\ 3)H.

Kernels of Homomorphisms

In group theory, the kernel of a plays a central role in connecting homomorphisms to normal subgroups. Given a homomorphism ϕ:GH\phi: G \to H between groups GG and HH, the kernel kerϕ\ker \phi is defined as the set {gGϕ(g)=eH}\{g \in G \mid \phi(g) = e_H\}, where eHe_H is the in HH. This set forms a of GG, and moreover, it is always normal in GG. To see this, note that for any gGg \in G and nkerϕn \in \ker \phi, the conjugate gng1g n g^{-1} satisfies ϕ(gng1)=ϕ(g)ϕ(n)ϕ(g)1=ϕ(g)eHϕ(g)1=eH\phi(g n g^{-1}) = \phi(g) \phi(n) \phi(g)^{-1} = \phi(g) e_H \phi(g)^{-1} = e_H, so gng1kerϕg n g^{-1} \in \ker \phi, confirming normality. The image of ϕ\phi, denoted imϕ={ϕ(g)gG}\operatorname{im} \phi = \{\phi(g) \mid g \in G\}, is a subgroup of HH. However, imϕ\operatorname{im} \phi is not necessarily normal in HH. The of ϕ\phi is defined as the H/imϕH / \operatorname{im} \phi when imϕ\operatorname{im} \phi is in HH; in general, for non-abelian groups, the cokernel may not exist unless this normality condition holds. A key result linking kernels, quotients, and homomorphisms is the third . Suppose NGN \trianglelefteq G is a normal subgroup of GG, and consider a homomorphism ϕ:G/NK\phi: G/N \to K. The kernel kerϕ\ker \phi then corresponds to a subgroup M/NM/N where NMGN \leq M \trianglelefteq G, yielding an (G/N)/(kerϕ)imϕ(G/N) / (\ker \phi) \cong \operatorname{im} \phi. More precisely, if NMGN \leq M \trianglelefteq G, then (G/N)/(M/N)G/M(G/N) / (M/N) \cong G/M. This follows from the first applied to the composition of the projection GG/NG \to G/N with ϕ\phi. The G/kerϕG / \ker \phi satisfies a with respect to homomorphisms from GG. Specifically, for any ψ:GK\psi: G \to K such that kerϕkerψ\ker \phi \subseteq \ker \psi, there exists a unique ψ:G/kerϕK\overline{\psi}: G / \ker \phi \to K such that ψ=ψπ\psi = \overline{\psi} \circ \pi, where π:GG/kerϕ\pi: G \to G / \ker \phi is projection. This characterizes the as the "universal" way to factor out the kernel. Illustrative examples highlight these concepts. The sign homomorphism sgn:Sn{±1}\operatorname{sgn}: S_n \to \{ \pm 1 \}, which maps a permutation to the sign of its corresponding permutation matrix (or equivalently, +1+1 for even permutations and 1-1 for odd), has kernel exactly the alternating group AnA_n, which is thus normal in SnS_n. Another example is the projection homomorphism π:ZZ/nZ\pi: \mathbb{Z} \to \mathbb{Z}/n\mathbb{Z}, sending an integer kk to its residue class modulo nn; here, kerπ=nZ\ker \pi = n\mathbb{Z}, the multiples of nn, which is normal in Z\mathbb{Z}.

Advanced Structures

Normal Series and Composition Series

A subnormal series of a group GG is a finite chain of subgroups G=N0N1Nk={e}G = N_0 \trianglerighteq N_1 \trianglerighteq \cdots \trianglerighteq N_k = \{e\}, where each Ni+1N_{i+1} is a normal subgroup of NiN_i. The successive quotients Ni/Ni+1N_i / N_{i+1} are called the factors of the series. A normal series is a subnormal series in which every NiN_i is normal in the whole group GG. Any two subnormal series of a admit common refinements whose factor groups are pairwise isomorphic up to permutation. This refinement property is known as the Schreier refinement theorem, which provides the foundation for the Jordan–Hölder theorem applied to . A is a subnormal series that cannot be refined further, meaning each factor Ni/Ni+1N_i / N_{i+1} is a . The Jordan–Hölder theorem states that any two of a have the same length and the same simple factors up to and permutation. A solvable series is a subnormal series whose factors Ni/Ni+1N_i / N_{i+1} are all abelian groups. For example, the symmetric group S3S_3 admits the solvable series S3A3{e}S_3 \trianglerighteq A_3 \trianglerighteq \{e\}, where A3A_3 is the alternating subgroup of order 3, yielding factors S3/A3Z/2ZS_3 / A_3 \cong \mathbb{Z}/2\mathbb{Z} and A3/{e}Z/3ZA_3 / \{e\} \cong \mathbb{Z}/3\mathbb{Z}, both abelian. A chief series is a maximal normal series (with all subgroups normal in GG), meaning there are no further GG-normal subgroups between consecutive terms, and its factors (chief factors) are minimal normal subgroups of the corresponding quotients, which for finite groups are characteristically simple (direct products of isomorphic simple groups, often elementary abelian pp-groups). In nilpotent groups, the lower central series provides a canonical example of a normal series. Defined recursively by γ0(G)=G\gamma_0(G) = G and γi+1(G)=[G,γi(G)]\gamma_{i+1}(G) = [G, \gamma_i(G)], where [G,H][G, H] is the commutator subgroup generated by elements ghg1h1ghg^{-1}h^{-1} for gGg \in G and hHh \in H, this series terminates at the trivial subgroup after finitely many steps. Each γi(G)\gamma_i(G) is normal in GG, and the factors γi(G)/γi+1(G)\gamma_i(G) / \gamma_{i+1}(G) are abelian (actually nilpotent of class at most 1 less).

Simple Groups and Solvability

A is a nontrivial group whose only are the trivial subgroup and the group itself. This property implies that simple groups have no proper nontrivial , making them the "atoms" or building blocks in the structure of finite groups via . Representative examples include cyclic groups of prime order, which are abelian s, the A5A_5 of order 60, which is the smallest non-abelian , and the projective PSL(2,7)\mathrm{PSL}(2,7) of order 168. The , completed in 2004, states that every finite is isomorphic to one of 26 sporadic groups, an AnA_n for n5n \geq 5, a (such as PSL(2,q)\mathrm{PSL}(2,q) for certain qq), or a of prime order. This monumental result, spanning thousands of pages across multiple volumes, provides a complete list and underscores the rarity and structured nature of simple groups. A group GG is solvable if it possesses a subnormal series {Hi}\{H_i\} with H0=GH1Hk={e}H_0 = G \triangleright H_1 \triangleright \cdots \triangleright H_k = \{e\} such that each factor group Hi/Hi+1H_i / H_{i+1} is abelian. In the context of , a is solvable by radicals the of its over the rationals is solvable, linking group-theoretic solvability directly to the constructibility of via field extensions. For instance, the A5A_5 is non-solvable because it is a non-abelian , so its derived series G(0)=A5G^{(0)} = A_5, G(1)=[A5,A5]=A5G^{(1)} = [A_5, A_5] = A_5, and G(k)=A5G^{(k)} = A_5 for all k1k \geq 1 stabilizes at the nontrivial group itself rather than the trivial subgroup. A GG satisfies G=GG = G', where GG' is the derived (, meaning GG has no nontrivial abelian quotients. Non-abelian simple groups are perfect because their derived subgroup GG' is a nontrivial proper normal subgroup (since GG is non-abelian), but the only such subgroups are {e}\{e\} and GG, forcing G=GG' = G. from 1904 advanced the detection of normal subgroups in pp-groups by providing conditions under which groups of order paqbp^a q^b (for distinct primes p,qp, q) possess nontrivial normal Sylow subgroups, thereby ruling out non-abelian simple groups of such orders and facilitating solvability proofs.

References

Add your contribution
Related Hubs
Contribute something
User Avatar
No comments yet.