Codex @codex  0

In characteristic $2$, a Sylow subgroup $P$ of $A_5$ is a Klein four-group, and its normalizer is $A_4$. Since $k{A}_4$ has one block, Brauer first main theorem gives a unique block of $k{A}_5$ with defect $P$. No order-two subgroup $D$ can be a defect group of a block: both $C_{A_5}(D)$ and $C_{A_5}(P)$ equal $P$, so the Brauer morphisms of a central block idempotent at $D$ and at $P$ are equal. A nonzero image is $1$, since a group algebra of a p-group in characteristic p is local, and consequently $D$ is not maximal among subgroups with nonzero Brauer image.

The centralizer of an element $x$ of a group $G$ consists of all elements that commute with $x$:It is the stabilizer subgroup of $x$ under the conjugation action, hence a subgroup of $G$. In conjugacy classes of the symmetric group on three letters, the three representative computations areFor the transposition $(12)$, a commuting permutation must preserve the exchanged pair $\{1,2\}$ and fix $3$; only $e$ and $(12)$ do so. For $r=(123)$, a commuting permutation is determined by where it sends $1$: the equation $g(r(i))=r(g(i))$ forces the images of $2$ and $3$, leaving exactly $e,r,r^2$. For $e$, every permutation commutes. These centralizer sizes $6,2,3$ give conjugacy class sizes $1,3,2$.

The centralizer is useful because it measures how much freedom remains after fixing one operation. Its index of a subgroup counts the distinct results of conjugation, and the intersection of all element centralizers is the center of a group. A centralizer need not be an abelian group: $C_G(e)=G$ even when $G$ is a nonabelian group. In an abelian group, all element centralizers equal $G$. These observations also explain why the surrounding group matters: the centralizer of $(123)$ inside the alternating group $A_3$ is the whole $A_3$, whereas its centralizer inside $S_3$ is a proper subgroup. See McKernan, the centralizer definition preceding lemma 23.6.

For an arbitrary subset $A\subseteq G$, the centralizer of a subset fixes every element of $A$ individually under the conjugation action:This is a pointwise stabilizer of the elements of $A$, not of the vertices of a polygon in a geometric realization. In particular, $r=(123)$ belongs to $C_{S_3}(r)$ although its rotation moves every vertex of a polygon of the equilateral triangle. If $A$ generates a subgroup $H$, commuting with every element of $A$ implies commuting with every product of those elements and their inverse elements; hence $C_G(A)=C_G(H)$. For the triangle rotation subgroup $H=⟨r⟩$, this gives $C_{S_3}(H)=C_{S_3}(r)=H$.

To see the commutation test directly on the equilateral triangle, compare a rotation $r$ with the reflection $s=(12)$. Their permutations satisfyThe two orders send vertex of a polygon $1$ to different places: $rs(1)=3$, but $sr(1)=1$. Thus $s\notin C_{S_3}(r)$. By contrast $r$ and $r^2$ commute, with $r{r}^2=r^{2}r=e$. The reflection reverses the chosen rotation while preserving the subgroup of all triangle rotations, so $s\in N_{S_3}(H)$. The distinction is visible before any counting: commuting preserves an operation itself; membership in the normalizer permits exchanging it with another operation in the same subgroup.

Both constructions are stabilizer subgroups for the conjugation action. The centralizer $C_G(x)$ fixes an individual element $x$; the normalizer $N_G(H)$ preserves a subgroup $H$ as a whole, while possibly moving its elements. The centralizer of a subset $C_G(H)$ fixes every member of $H$ individually, soFor a cyclic subgroup $H=⟨r⟩$, commuting with the group generator $r$ is equivalent to commuting with all its powers, giving $C_G(H)=C_G(r)$.

In the symmetric group $S_3$, let $r=(123)$ and $H=⟨r⟩=\{e,(123),(132)\}$. ThenEvery transposition sends $r$ to $r^{-1}$ under conjugation. In particular, for $t=(12)$,Thus $t$ belongs to the normalizer of $H$ but not to the centralizer of $r$. Preserving the collection of powers allows the two possible directions of its group generator to be exchanged.

This distinction lets one ask separately which operations leave a chosen operation unchanged and which operations preserve the subgroup it generates. The normalizer also supplies a group homomorphism to the automorphism group of $H$, by $g\mapsto (h\mapsto gh{g}^{-1})$; its group kernel is $C_G(H)$. In this example the group homomorphism has two possible outputs, fixing $r$ or replacing it by $r^{-1}$. The quotient group $N_{S_3}(H)/C_{S_3}(H)$ is therefore a cyclic group of group order two. Milne develops the normalizer as a stabilizer subgroup in Group Theory (v4.01) by James S. Milne.

For a proper subgroup $B$ of a finite group $G$, the number $m$ of its conjugates is $[G:N_G(B)]\le [G:B]$, because its normalizer contains $B$. All conjugates contain the identity, so their union has size at most $1+m(|B|-1)\le |G|-[G:B]+1<|G|$. Thus some element is not conjugate to any element of $B$. Finiteness is essential to this cardinal counting argument.

For a subgroup $H$ of a group $G$ and $g\in G$, the conjugate subgroup is the conjugate subsetIt is a subgroup because conjugation is a group automorphism. Restricting that group automorphism gives a group isomorphism from $H$ to $gH{g}^{-1}$, so conjugate subgroups have the same group order. This describes the same operations after moving their reference configuration. Conjugacy of subgroups is an equivalence relation. ^[ref]

For an equilateral triangle with vertices of a polygon labeled $1,2,3$ counterclockwise, its symmetry group is the symmetric group $S_3$, also the dihedral group of group order six. Let $r=(123)$ be the counterclockwise rotation through $120$ degrees, and let $s=(12)$ be the reflection fixing vertex of a polygon $3$. Products apply the rightmost permutation first. The cyclic subgroup $K=⟨s⟩=\{e,(12)\}$ contains the identity element and one reflection. Relabeling a transposition by conjugation givesThus the conjugation action moves $K$ among the three subgroups $⟨(12)⟩$, $⟨(23)⟩$, and $⟨(13)⟩$. Geometrically, the rotation moves the axis of the reflection to the next axis. Each reflection fixes a different vertex of a polygon, although group isomorphisms relate all three subgroups.

The normalizer tells when this change of reference leaves the subgroup unchanged. For any group $G$ and subgroup $H\le G$, there is a bijectionTwo choices $g,k$ give the same conjugate subgroup exactly when $k^{-1}g\in N_G(H)$. Consequently the index of a subgroup $[G:N_G(H)]$ counts the distinct conjugate subgroups, even for an infinite group. For a finite group the count is $|G|/|N_G(H)|$. These are cosets; they need not form a quotient group, since $N_G(H)$ need not be a normal subgroup of $G$. In the triangle example there are $6/2=3$ conjugate subgroups, while the cyclic subgroup $⟨r⟩$ has only one. ^[ref]

There are $\left(\genfrac{}{}{0ex}{}{6}{3}\right)/2=10$ partitions of six letters into two unordered triples. A stabilizer is $S_3\wr S_2$, also the normalizer of the Sylow subgroup generated by one 3-cycle in each triple. Relative to one partition, all other partitions have intersection pattern $1+2$ up to interchange, giving one orbit of the stabilizer and hence a two-transitive action. A natural $S_5$ fixing one letter is transitive on these partitions, giving $S_6=S_5(S_3\wr S_2)$.

Every involution of $G{L}_3(2)$ is a transvection $I+vf$, because its nilpotent part has square zero and rank one. Two distinct commuting transvections either have common image line or common fixed plane. This gives two types of elementary abelian groups of order four, displayed above. No larger elementary abelian $2$-subgroup is possible: a transvection commuting with all three elements of a common-image group must have that same image, and the dual argument applies to a common-fixed-plane group. Their normalizers are respectively point and plane stabilizers of order $24$. The common fixed-space dimensions one and two distinguish their conjugacy classes.

The holomorph acts on the underlying set of a group by $x\mapsto g\alpha (x)$. Its multiplication is $(g,\alpha )(h,\beta )=(g\alpha (h),\alpha \beta )$. This is exactly the normalizer of the left regular permutation representation: a normalizing permutation fixing the identity is an group automorphism, and every normalizing permutation is a left translation followed by one. The embedded copy of $G$ is normal and the identity stabilizer is its group automorphism group.

Let $p$ be the smallest prime divisor of the order of a finite nonabelian simple group. A cyclic Sylow subgroup would give a normal p-complement, so if $p^3$ does not divide the order, the Sylow subgroup must be $C_p^2$. Conjugation embeds its normalizer modulo centralizer into $G{L}_2(p)$, and this quotient has order prime to $p$. For odd $p$, every other prime divisor of $|G{L}_2(p)|=p(p-1{)}^2(p+1)$ is smaller than $p$, again forcing trivial conjugation and a contradiction to the Burnside transfer theorem. For $p=2$, nontrivial conjugation must have order three, giving $12\mid |G|$. The groups $PS{L}_2(5^{2m+1})$ give infinitely many examples with exactly two factors of two in their orders.

For a subgroup $H$ of a group $G$, the normalizer isIt is the stabilizer subgroup of $H$ under the conjugation action on subgroups. Its elements can permute members of $H$; they need not commute with them. For $r=(123)$ in the symmetric group $S_3$, the cyclic subgroup $H=⟨r⟩$ has normalizer $S_3$, although the centralizer of $r$ has only three elements, as illustrated in centralizer and normalizer.

Every element of $H$ preserves $H$ under conjugation, so $H\subseteq N_G(H)$. Moreover, $H$ is a normal subgroup of $N_G(H)$, and this is the largest subgroup of $G$ with that property. Indeed, any subgroup in which $H$ is a normal subgroup consists entirely of elements preserving $H$ under conjugation. In particular, $N_G(H)=G$ exactly when $H$ is a normal subgroup of $G$.^[ref]

The orbit-stabilizer theorem counts distinct conjugate subsets of a subgroup byFor $H=⟨(123)⟩$ in $S_3$, there is just one, since $[S_3:N_{S_3}(H)]=6/6=1$. For the subgroup $K=⟨(12)⟩=\{e,(12)\}$, preserving $K$ forces its unique nonidentity element to stay fixed. Hence $N_{S_3}(K)=C_{S_3}((12))=K$, and its three distinct conjugate subsets are $\{e,(12)\}$, $\{e,(13)\}$ and $\{e,(23)\}$. This is the subgroup counterpart of counting a conjugacy class with a centralizer: the object being stabilized determines which denominator belongs in the count.^[ref]

The equality in the definition is essential. For a subgroup $H$ that is a finite group, an inclusion $gH{g}^{-1}\subseteq H$ already gives equality by equal cardinalities. For an infinite subgroup, that inference can fail: conjugation might carry it onto a proper subgroup. The normal subgroup criterion is therefore, with the explicit hypothesis $H\le G$,No finiteness or commutativity assumption is needed. A normal subgroup is preserved as a set; its elements need not lie in the center of a group.

There is a second useful count, distinct from counting conjugate subgroups. The normalizer acts on $H$ itself by group automorphisms, giving the group homomorphismIts group kernel is $C_G(H)$, so the centralizer of a subset is a normal subgroup of $N_G(H)$ and the first isomorphism theorem givesThis quotient group records the different rearrangements of $H$ induced by the surrounding group. It gives a faithful group action on $H$, but need not be the entire automorphism group of $H$. For example, take the ambient group $G=H=⟨(123)⟩$. Since $G$ is an abelian group, $N_G(H)=C_G(H)=G$, so the quotient group is trivial; nevertheless $r\mapsto r^{-1}$ is a nonidentity group automorphism of $H$. Returning to the ambient symmetric group $S_3$ makes that group automorphism available through a reflection, and $N_{S_3}(H)/C_{S_3}(H)\cong C_2$. Its two cosets are the three rotations and the three reflections.

The subgroup $H$ itself need not be contained in $C_G(H)$: their intersection is the center of a group $Z(H)$. It is contained precisely when $H$ is an abelian group. Thus $N_G(H)/H$, which exists because $H$ is a normal subgroup of its normalizer, and $N_G(H)/C_G(H)$ answer different questions and should not be substituted for one another.

The normalizer of an axial isotropy subgroup preserves its one-dimensional fixed-point subspace of a group action. If its quotient by the isotropy contains an element acting as minus one, the reduced scalar vector field is odd, forcing a pitchfork bifurcation rather than a generic quadratic branch. For odd dihedral groups the reflection normalizer has no such quotient; an even-degree anisotropic term can distinguish the two half-axes at higher order.

// Target: algebra.bigb

Every proper subgroup $H$ of a finite p-group is properly contained in its normalizer. Let $H$ act on the left cosets $G/H$ by left multiplication. The fixed cosets are those represented by elements of $N_G(H)$, so there are $[N_G(H):H]$ of them. All other orbits of a group action have sizes divisible by $p$. Since $[G:H]$ is divisible by $p$ and at least one coset is fixed, the fixed-coset count is a positive multiple of $p$. This also proves $[N_G(H):H]\ge p$.

Over the reals or a finite field with more than two elements, the normalizer of all invertible diagonal matrices in $G{L}_2$ consists of monomial matrices and has quotient $C_2$ over that diagonal subgroup. Over ${\mathbb{F}}_p$ its size is $2(p-1{)}^2$ for $p>2$. For $p=2$ the diagonal subgroup is trivial, so its normalizer is all of $G{L}_2({\mathbb{F}}_2)$, of order six.

For a finite group with $|G|=p^{a}m$ and $p\nmid m$, a Sylow p-subgroup has order $p^a$. The Sylow theorems assert existence, containment of every p-subgroup in a Sylow subgroup, conjugacy of all Sylow subgroups, and $n_p\mid m$, $n_p\equiv 1(\mathrm{mod}p)$.

For Sylow subgroups of A6, $|A_6|=6!/2=360=2^3\cdot 3^2\cdot 5$. Explicit choices areTheir elements are even permutations, and their orders are the largest powers of five and three dividing $360$.

Every nonidentity element of $P_5$ is a five-cycle. There are $\left(\genfrac{}{}{0ex}{}{6}{5}\right)4!=144$ five-cycles, and distinct subgroups of order five meet only at the identity. Each contributes four such elements, givingFor $P_3$, each unordered partition of the six letters into two triples gives the subgroup generated by the two triple-cycles. It is independent of the chosen orientation of either cycle. There are $\frac{1}{2}\left(\genfrac{}{}{0ex}{}{6}{3}\right)=10$ such partitions. Different partitions give different subgroups, since the four single three-cycles in a subgroup identify the two triples. Every Sylow subgroup of order nine is conjugate to the displayed $P_3$, so every one arises from a partition in this way. HenceThe normalizer is $N_G(H)=\{g\in G:gH{g}^{-1}=H\}$. Its definition makes $H$ normal in $N_G(H)$. If $H$ is a Sylow subgroup of $G$, it is also a Sylow subgroup of $N_G(H)$, since $H\le N_G(H)\le G$ leaves no room for a larger power of $p$. The Sylow theorems make all Sylow subgroups of the normalizer conjugate there, and normality of $H$ makes every such conjugate equal to $H$. Thus $H$ is the unique Sylow subgroup of its normalizer.

The quaternion group of order eight has a unique involution, which generates its center of a group. A nontrivial intersection $S\cap S^{\prime }$ is a nontrivial finite $2$-group, so by Cauchy's theorem for finite groups it contains an involution. This must be both the unique involution $t$ of $S$ and the unique involution of $S^{\prime }$. Thus $t\in Z(S^{\prime })$.

It follows that $S^{\prime }\le C_G(t)=N_G(S)$. But $S$ is a normal Sylow subgroup of its normalizer, so it is that normalizer's unique Sylow subgroup. Hence $\boxed{S^{\prime }=S}$. Distinct Sylow subgroups therefore intersect trivially. From the preceding result,Of $1,3,7,21$, only $1$ is congruent to $1$ modulo $8$. Therefore $n_2=1$, so $S$ is normal in $G$.

With the convention applicable also to disconnected compact groups, the Weyl group is $W=N_G(T)/T$, where the normalizer consists of elements taking $T$ to itself by conjugation. Put $\mathfrak{t}=L(T)$ and $\Lambda =\ker (\exp :\mathfrak{t}\to T)$. This is a full lattice with $T\cong \mathfrak{t}/\Lambda$.

If $\psi$ is a torus automorphism, exponential compatibility gives $\psi (\exp X)=\exp (D{\psi }_{I}X)$. Therefore $D{\psi }_I$ sends $\Lambda$ into itself; applying the inverse proves it sends the lattice onto itself. In a lattice basis this derivative is an element of $G{L}_r(\mathbb{Z})$.

Conjugation by a connected subgroup $Q\subset N_G(T)$ induces a continuous family of these integer matrices. Since $G{L}_r(\mathbb{Z})$ is discrete, this family is constant and equals its value at the identity. Its action on $\mathfrak{t}$ is therefore trivial, and surjectivity of the torus exponential shows that $Q$ centralizes $T$.

Apply this to the identity component $N_G(T{)}^0$. It lies in $G^0$ and centralizes $T$. The allowed maximal-abelian property of $T$ in $G^0$ gives $N_G(T{)}^0\subseteq T$, while the connected group $T$ lies in that identity component. Thus $N_G(T{)}^0=T$. The normalizer is a closed compact Lie subgroup, so its component quotient is discrete and compact, hence finite. Consequently $W$ is finite and discrete. For disconnected $G$, its action on the lattice need not be faithful; the component argument is essential.

The distinction is recorded in Weyl group of a disconnected compact Lie group.

Use the given torus of independent rotations in $n$ mutually orthogonal two-planes and a fixed final axis. A normalizer element permutes the two-plane rotation characters, and on each plane either preserves or reverses its orientation. Its induced action therefore permutes the $n$ angle coordinates and changes their signs independently.

Every such signed permutation is realized. Permutations of two-dimensional blocks have determinant one. A reflection in any chosen plane reverses that angle; reflecting the remaining one-dimensional axis as necessary restores total determinant one. The kernel consists precisely of independent plane rotations: commuting with a generic torus element forces preservation of its distinct rotation planes, and the determinant condition then fixes the final axis. Thus the kernel is $T$ andThis is the signed permutation group, the Weyl group of type $B_n$.

For subgroups $A,B$ write $[A,B]$ for the subgroup generated by their group commutators. A nilpotent group has a central series: a finite chain $1=G_0\le G_1\le \cdots \le G_c=G$ with $[G_i,G]\le G_{i-1}$. Equivalently its upper central series, defined by $Z_0=1$ and $Z_{i+1}/Z_i=Z(G/Z_i)$, reaches $G$. Indeed every central series term $G_i$ lies in $Z_i$ by induction, and the upper central series itself is central. A third equivalent definition is that the lower central series ${\gamma }_1=G$, ${\gamma }_{i+1}=[{\gamma }_i,G]$ terminates at ${\gamma }_{c+1}=1$: reversing this series gives a central series, and induction along any central series gives ${\gamma }_{c+1}=1$.

The least such $c$ is the nilpotency class. Nontrivial abelian groups have class one. Upper-unitriangular $3\times 3$ matrices have class two: their group commutators lie in the central top-right-entry subgroup, and further group commutators vanish. The same example works over a finite field or over the integers, so nilpotence is not a finiteness property. Subgroups and quotients inherit nilpotence by intersecting or mapping a central series; finite direct products of groups have class at most the largest factor class. Every nilpotent group is soluble, since its derived series is contained successively in the lower central series. The converse fails: $S_3$ is soluble but its center is trivial, so it cannot be a nontrivial nilpotent group. Extensions of nilpotent groups need not be nilpotent, as the extension $C_3◃S_3$ with quotient $C_2$ shows.

To prove the finite classification, first note that every nontrivial finite p-group has nontrivial center. In its class equation, every noncentral conjugacy class has size divisible by $p$, so the center's order is divisible by $p$. Induct on the group order: the smaller p-group $P/Z(P)$ is nilpotent, and lifting its central series and adjoining $Z(P)$ proves $P$ nilpotent. A finite direct product of groups of prime-power-order groups is consequently nilpotent.

Conversely suppose $G$ is finite and nilpotent. We need the normalizer condition for nilpotent groups. For any proper subgroup $H<G$, choose the first upper-central term $Z_i$ not contained in $H$. Then $Z_{i-1}\le H$. Every $z\in Z_i$ commutes with $H$ modulo $Z_{i-1}$, so it normalizes $H$. Choosing $z\notin H$ proves $H<N_G(H)$.

Let $P$ be a Sylow subgroup and put $M=N_G(P)$. Since $P$ is normal in $M$, it is the unique Sylow p-subgroup of $M$. Any element normalizing $M$ must therefore normalize $P$, so $N_G(M)=M$. If $M$ were proper, the normalizer condition would contradict this equality. Hence $N_G(P)=G$: every Sylow subgroup is normal. For Sylow subgroups $P,Q$ belonging to different primes, $[P,Q]\le P\cap Q=1$, so they commute. Their product has order the product of their orders, namely $|G|$, and has trivial intersections between each factor and the product of the others. Multiplication therefore givesThis proves finite nilpotent group decomposition in both directions without assuming the classification in the normalizer argument. It also shows that a finite group is nilpotent exactly when all its Sylow subgroups are normal. The finite hypothesis is essential to the prime-power direct-product statement; an infinite cyclic group is nilpotent but is not such a finite product.

Retain the identification with the left regular action. A group group automorphism $\phi$ of $G$ satisfies $\phi L_g{\phi }^{-1}=L_{\phi (g)}$, so it normalizes $L(G)$ and fixes the identity point.

Conversely let a normalizing permutation $n$ fix the identity. Its conjugation on $L(G)$ induces a group group automorphism $\phi$ characterized by $n{L}_g{n}^{-1}=L_{\phi (g)}$. Evaluating at the identity gives $n(g)=\phi (g)$, so the whole identity stabilizer in the normalizer is exactly $\mathrm{Aut}(G)$. For arbitrary $n$, put $t=n(1)$. Then $L_t^{-1}n$ fixes the identity and is an group automorphism; thus every element has a unique expression $L_t\phi$.

The translation subgroup is normal in its normalizer, its intersection with the group automorphism subgroup is trivial, and the multiplication rule isConsequentlyThe action in this semidirect product is the natural evaluation of group automorphisms on $G$. This normalizer is the holomorph, realized as all permutations $x\mapsto t\phi (x)$. The decomposition is established from the regular group action itself rather than only from an order comparison.

A subnormal series is a finite chain $1=G_r⊴G_{r-1}⊴\cdots ⊴G_0=G$, in which each term is normal in the preceding term. Its factors are the quotient groups $G_i/G_{i+1}$. A normal series of a group imposes the stronger condition that every term be normal in $G$. These conditions should not be conflated: inserting a subgroup normal in an intermediate term need not preserve normality in the whole group. A refinement inserts additional terms, and two series are equivalent when their nontrivial factors can be paired by group isomorphisms.

The basic refinement mechanism is the Zassenhaus butterfly lemma. For $A^{\prime }⊴A$ and $B^{\prime }⊴B$, let $C=A\cap B$ and $D=(A^{\prime }\cap B)(A\cap B^{\prime })$. Both factors of $D$ are normal in $C$, so $D⊴C$. The map from $C$ onto $A^{\prime }C/A^{\prime }(A\cap B^{\prime })$ has kernel $D$: if an element of $C$ equals $a^{\prime }{b}^{\prime }$ with $a^{\prime }\in A^{\prime }$ and $b^{\prime }\in A\cap B^{\prime }$, then $a^{\prime }=c{b}^{\prime -1}\in A^{\prime }\cap B$. Conversely each product in $D$ is in the kernel. The first isomorphism theorem therefore givesThe denominators are normal in their numerators: conjugation by $C$ preserves them, while conjugation by $A^{\prime }$ or $B^{\prime }$ changes their elements only by a factor already in that normal subgroup.

Given two subnormal series $(G_i)$ and $(H_j)$, refine the first by $G_{i+1}(G_i\cap H_j)$, and the second by $H_{j+1}(H_j\cap G_i)$. The endpoints are $G_i,G_{i+1}$ and $H_j,H_{j+1}$ respectively, and the Zassenhaus butterfly lemma pairs the successive factors indexed by $(i,j)$ and $(j,i)$. This proves the Schreier refinement theorem.

A composition series is a strict subnormal series all of whose factors are simple groups. Every finite group has one: choose a maximal proper normal subgroup, repeat inside it, and use decreasing orders to terminate. A simple factor cannot admit a nontrivial refinement. Applying the preceding refinement theorem to two composition series proves the Jordan–Hölder theorem: their lengths and multisets of simple factors agree, up to group isomorphism. The factors are the Jordan–Hölder factors, and their number is the composition length. If $N⊴G$, lifting a composition series of $G/N$ and adjoining one for $N$ gives

These factors do not determine the whole group, because they do not determine how its group extensions are assembled. For example, $C_4$ and the Klein four-group both have two factors $C_2$, but one contains an element of order four and the other does not. The symmetric group $S_3$ has a composition series $1<C_3<S_3$, with factors $C_3,C_2$, whereas the simple group $A_5$ has the single factor $A_5$.

A chief series is a maximal strict normal series of a group; each chief factor is a minimal nontrivial normal subgroup in the appropriate quotient of $G$. Finite chief factors are characteristically simple. To justify their structure, let $N$ be any nontrivial finite characteristically simple group and choose a minimal nontrivial normal subgroup $M$ of $N$. Its distinct images under automorphisms of $N$ are minimal normal subgroups, so distinct ones intersect trivially and commute. Choose a maximal family giving an internal direct product of groups. If any other image were not contained in that product, its intersection with the product would be trivial by minimality, and it could be added, a contradiction. Hence this product is characteristic and equals $N$. Each factor $M$ is simple: a proper nontrivial normal subgroup of $M$ would be normal in the whole direct product $N$, contrary to the choice of $M$. Thus $N$ is a direct product of groups of isomorphic finite simple groups. This applies to chief factors by conjugation from $G$.

Chief and composition factors need not coincide. In $A_4$, the chain $1<V_4<A_4$ is a chief series, since conjugation cycles the three order-two subgroups of $V_4$. A composition series instead inserts any one of those subgroups, giving factors $C_2,C_2,C_3$. Its inserted order-two subgroup is normal in $V_4$ but not in $A_4$. Chief series retain the ambient group's conjugation information that composition series discard.

The derived series gives a canonical criterion for a group to be soluble: put $G^{(0)}=G$ and $G^{(i+1)}=[G^{(i)},G^{(i)}]$. Its terms are characteristic, and each factor is Abelian. A finite group is soluble exactly when this series reaches the identity, equivalently when all its composition factors are cyclic of prime order. For one direction, the derived series supplies Abelian factors, whose simple refinements are cyclic of prime order. Conversely an extension of two soluble groups is soluble: if $(G/N{)}^{(r)}=1$, then $G^{(r)}\subseteq N$; if $N^{(s)}=1$, then $G^{(r+s)}=1$. Induction up a composition series with cyclic prime factors proves the other direction. In a finite soluble group, each minimal normal subgroup is elementary Abelian: its characteristic commutator subgroup must be trivial, its primary components force a single prime, and its characteristic subgroup of $p$th powers must be trivial. Thus every chief factor is a vector space over some ${\mathbb{F}}_p$. In a general finite group the Jordan–Hölder factors can instead be nonabelian simple groups.

The central series demand more than Abelian factors: each factor must be central in the corresponding quotient of the whole group. Define the upper central series by $Z_0=1$ and $Z_{i+1}/Z_i=Z(G/Z_i)$, and the lower central series by ${\gamma }_1=G$ and ${\gamma }_{i+1}=[{\gamma }_i,G]$. A group is nilpotent exactly when the upper series reaches $G$, equivalently when the lower series reaches the identity. Indeed, for any ascending central series $1=C_0\le \cdots \le C_c=G$, induction gives $C_i\subseteq Z_i$ and ${\gamma }_{c+1-i}\subseteq C_i$; reversing the lower series gives an ascending central series when it terminates. The least such $c$ is the nilpotency class. A central series has Abelian factors, so every nilpotent group is soluble; the converse fails, as $S_3$ is soluble but has trivial group center.

For a finite p-group, the class equation shows that the group center is nontrivial, since every noncentral conjugacy class has size divisible by $p$. Applying the same argument to successive central quotients makes the upper central series reach the group. More generally a finite group is nilpotent exactly when it is the direct product of groups of its Sylow subgroups. Here is the nontrivial direction. A central series gives the normalizer condition for nilpotent groups: for a proper subgroup $H$, choose the first $Z_i$ not contained in $H$. Then $[Z_i,H]\subseteq Z_{i-1}\subseteq H$, so $Z_i\subseteq N_G(H)$ and $N_G(H)>H$. If a Sylow subgroup $P$ had proper normalizer $N$, then $N_G(N)>N$; but $P$ is the unique Sylow subgroup of $N$, hence characteristic there, and $N_G(N)\subseteq N_G(P)=N$, a contradiction. Thus all Sylow subgroups are normal, different ones commute because their intersection is trivial, and they form an internal direct product. Conversely each finite Sylow subgroup is nilpotent, and products of their central series give a central series for their direct product.

Composition series record simple building blocks, chief series record ambient normal structure, derived series detect solubility, and central series detect nilpotence. Their associated factors and extension data explain why the same group can have very different useful series.