Hubbry Logo
Centralizer and normalizerCentralizer and normalizerMain
Open search
Centralizer and normalizer
Community hub
Centralizer and normalizer
logo
7 pages, 0 posts
0 subscribers
Be the first to start a discussion here.
Be the first to start a discussion here.
Centralizer and normalizer
Centralizer and normalizer
from Wikipedia

In mathematics, especially group theory, the centralizer (also called commutant[1][2]) of a subset S in a group G is the set of elements of G that commute with every element of S, or equivalently, the set of elements such that conjugation by leaves each element of S fixed. The normalizer of S in G is the set of elements of G that satisfy the weaker condition of leaving the set fixed under conjugation. The centralizer and normalizer of S are subgroups of G. Many techniques in group theory are based on studying the centralizers and normalizers of suitable subsets S.

Suitably formulated, the definitions also apply to semigroups.

In ring theory, the centralizer of a subset of a ring is defined with respect to the multiplication of the ring (a semigroup operation). The centralizer of a subset of a ring R is a subring of R. This article also deals with centralizers and normalizers in a Lie algebra.

The idealizer in a semigroup or ring is another construction that is in the same vein as the centralizer and normalizer.

Definitions

[edit]

Group and semigroup

[edit]

The centralizer of a subset of group (or semigroup) G is defined as[3]

where only the first definition applies to semigroups. If there is no ambiguity about the group in question, the G can be suppressed from the notation. When is a singleton set, we write CG(a) instead of CG({a}). Another less common notation for the centralizer is Z(a), which parallels the notation for the center. With this latter notation, one must be careful to avoid confusion between the center of a group G, Z(G), and the centralizer of an element g in G, Z(g).

The normalizer of S in the group (or semigroup) G is defined as

where again only the first definition applies to semigroups. If the set is a subgroup of , then the normalizer is the largest subgroup where is a normal subgroup of . The definitions of centralizer and normalizer are similar but not identical. If g is in the centralizer of and s is in , then it must be that gs = sg, but if g is in the normalizer, then gs = tg for some t in , with t possibly different from s. That is, elements of the centralizer of must commute pointwise with , but elements of the normalizer of S need only commute with S as a set. The same notational conventions mentioned above for centralizers also apply to normalizers. The normalizer should not be confused with the normal closure.

Clearly and both are subgroups of .

Ring, algebra over a field, Lie ring, and Lie algebra

[edit]

If R is a ring or an algebra over a field, and is a subset of R, then the centralizer of is exactly as defined for groups, with R in the place of G.

If is a Lie algebra (or Lie ring) with Lie product [x, y], then the centralizer of a subset of is defined to be[4]

The definition of centralizers for Lie rings is linked to the definition for rings in the following way. If R is an associative ring, then R can be given the bracket product [x, y] = xyyx. Of course then xy = yx if and only if [x, y] = 0. If we denote the set R with the bracket product as LR, then clearly the ring centralizer of in R is equal to the Lie ring centralizer of in LR.

The Lie bracket can also be viewed as an operation of the set on itself, because . The Lie bracket makes a group and its centralizer would then be all elements However, since the Lie bracket is alternating, this condition is equivalent to Thus, the centralizer is defined in the same way for Lie algebras as for groups.

The normalizer of a subset of a Lie algebra (or Lie ring) is given by[4]

While this is the standard usage of the term "normalizer" in Lie algebra, this construction is actually the idealizer of the set in . If is an additive subgroup of , then is the largest Lie subring (or Lie subalgebra, as the case may be) in which is a Lie ideal.[5]

Example

[edit]

Consider the group

(the symmetric group of permutations of 3 elements).

Take a subset of the group :

Note that is the identity permutation in and retains the order of each element and is the permutation that fixes the first element and swaps the second and third element.

The normalizer of with respect to the group are all elements of that yield the set (potentially permuted) when the element conjugates . Working out the example for each element of :

when applied to : ; therefore is in the normalizer .
when applied to : ; therefore is in the normalizer .
when applied to : ; therefore is not in the normalizer .
when applied to : ; therefore is not in the normalizer .
when applied to : ; therefore is not in the normalizer .
when applied to : ; therefore is not in the normalizer .

Therefore, the normalizer of in is since both these group elements preserve the set under conjugation.

The centralizer of the group is the set of elements that leave each element of unchanged by conjugation; that is, the set of elements that commutes with every element in . It's clear in this example that the only such element in S3 is itself ([1, 2, 3], [1, 3, 2]).

Properties

[edit]

Semigroups

[edit]

Let denote the centralizer of in the semigroup ; i.e. Then forms a subsemigroup and ; i.e. a commutant is its own bicommutant.

Groups

[edit]

Source:[6]

  • The centralizer and normalizer of are both subgroups of G.
  • Clearly, CG(S) ⊆ NG(S). In fact, CG(S) is always a normal subgroup of NG(S), being the kernel of the homomorphism NG(S) → Bij(S) and the group NG(S)/CG(S) acts by conjugation as a group of bijections on S. E.g. the Weyl group of a compact Lie group G with a torus T is defined as W(G,T) = NG(T)/CG(T), and especially if the torus is maximal (i.e. CG(T) = T) it is a central tool in the theory of Lie groups.
  • CG(CG(S)) contains , but CG(S) need not contain . Containment occurs exactly when is abelian.
  • If H is a subgroup of G, then NG(H) contains H.
  • If H is a subgroup of G, then the largest subgroup of G in which H is normal is the subgroup NG(H).
  • If is a subset of G such that all elements of S commute with each other, then the largest subgroup of G whose center contains is the subgroup CG(S).
  • A subgroup H of a group G is called a self-normalizing subgroup of G if NG(H) = H.
  • The center of G is exactly CG(G) and G is an abelian group if and only if CG(G) = Z(G) = G.
  • For singleton sets, CG(a) = NG(a).
  • By symmetry, if and T are two subsets of G, T ⊆ CG(S) if and only if S ⊆ CG(T).
  • For a subgroup H of group G, the N/C theorem states that the factor group NG(H)/CG(H) is isomorphic to a subgroup of Aut(H), the group of automorphisms of H. Since NG(G) = G and CG(G) = Z(G), the N/C theorem also implies that G/Z(G) is isomorphic to Inn(G), the subgroup of Aut(G) consisting of all inner automorphisms of G.
  • If we define a group homomorphism T : G → Inn(G) by T(x)(g) = Tx(g) = xgx−1, then we can describe NG(S) and CG(S) in terms of the group action of Inn(G) on G: the stabilizer of in Inn(G) is T(NG(S)), and the subgroup of Inn(G) fixing pointwise is T(CG(S)).
  • A subgroup H of a group G is said to be C-closed or self-bicommutant if H = CG(S) for some subset SG. If so, then in fact, H = CG(CG(H)).

Rings and algebras over a field

[edit]

Source:[4]

  • Centralizers in rings and in algebras over a field are subrings and subalgebras over a field, respectively; centralizers in Lie rings and in Lie algebras are Lie subrings and Lie subalgebras, respectively.
  • The normalizer of in a Lie ring contains the centralizer of .
  • CR(CR(S)) contains but is not necessarily equal. The double centralizer theorem deals with situations where equality occurs.
  • If is an additive subgroup of a Lie ring A, then NA(S) is the largest Lie subring of A in which is a Lie ideal.
  • If is a Lie subring of a Lie ring A, then S ⊆ NA(S).

See also

[edit]

Notes

[edit]

References

[edit]
Revisions and contributorsEdit on WikipediaRead on Wikipedia
from Grokipedia
In group theory, the centralizer of a subset SS of a group GG, denoted CG(S)C_G(S), is the consisting of all elements gGg \in G that commute with every element of SS, formally defined as CG(S)={gGgs=sg for all sS}C_G(S) = \{ g \in G \mid gs = sg \text{ for all } s \in S \}. Similarly, the normalizer of SS in GG, denoted NG(S)N_G(S), is the of elements gGg \in G such that conjugation by gg preserves SS, given by NG(S)={gGgSg1=S}N_G(S) = \{ g \in G \mid gSg^{-1} = S \}. These concepts arise naturally in the study of group actions, particularly the conjugation action of GG on itself or its subsets, where the centralizer CG(S)C_G(S) serves as the stabilizer of elements under commutation and the normalizer NG(S)N_G(S) as the stabilizer of SS under conjugation. For a single element xGx \in G, the centralizer CG(x)={gGgx=xg}C_G(x) = \{ g \in G \mid gx = xg \} is a containing the center Z(G)Z(G) of GG, and its index equals the size of the of xx. When S=GS = G, CG(G)=Z(G)C_G(G) = Z(G), the center, comprising elements that commute with everything in GG. The normalizer always contains the centralizer, since commutation implies conjugation preservation for subsets, and HGH \leq G is normal in GG NG(H)=GN_G(H) = G. The index [G:NG(H)][G : N_G(H)] gives the number of distinct conjugates of a HH, playing a key role in Sylow theory and classification of finite groups. Both structures are of GG, with the normalizer being the largest in which SS (if a ) is normal.

Definitions

In groups

In group theory, groups act on themselves by conjugation, where the action is defined by gx=gxg1g \cdot x = g x g^{-1} for all g,xGg, x \in G. This action provides the foundational framework for understanding centralizers and normalizers as stabilizers under conjugation. The centralizer of an element gg in a group GG, denoted CG(g)C_G(g), is the set {hGhg=gh}\{ h \in G \mid h g = g h \}, or equivalently {hGhgh1=g}\{ h \in G \mid h g h^{-1} = g \}. This set forms a subgroup of GG, as it is closed under the group operation and inversion: if h1,h2CG(g)h_1, h_2 \in C_G(g), then h1h2g(h1h2)1=h1(h2gh21)h11=h1gh11=gh_1 h_2 g (h_1 h_2)^{-1} = h_1 (h_2 g h_2^{-1}) h_1^{-1} = h_1 g h_1^{-1} = g, and similarly for inverses. For a subset SGS \subseteq G, the centralizer CG(S)C_G(S) is defined as the sSCG(s)={hGhs=sh for all sS}\bigcap_{s \in S} C_G(s) = \{ h \in G \mid h s = s h \text{ for all } s \in S \}. As an of subgroups, CG(S)C_G(S) is itself a of GG. The normalizer of a subset SGS \subseteq G, denoted NG(S)N_G(S), is the set {hGhSh1=S}\{ h \in G \mid h S h^{-1} = S \}, consisting of elements that preserve SS under conjugation. This set forms a of GG, verified by closure: if h1,h2NG(S)h_1, h_2 \in N_G(S), then h1h2S(h1h2)1=h1(h2Sh21)h11=h1Sh11=Sh_1 h_2 S (h_1 h_2)^{-1} = h_1 (h_2 S h_2^{-1}) h_1^{-1} = h_1 S h_1^{-1} = S, with analogous checks for inverses and the identity. If SS is a of GG, then SNG(S)S \subseteq N_G(S), since conjugation by elements of SS leaves SS invariant. The center of the group GG, denoted Z(G)Z(G), is the centralizer of the entire group, Z(G)=CG(G)={zGzg=gz for all gG}Z(G) = C_G(G) = \{ z \in G \mid z g = g z \text{ for all } g \in G \}, or equivalently gGCG(g)\bigcap_{g \in G} C_G(g). This is the kernel of the conjugation action of GG on itself, comprising elements fixed by all conjugations.

In semigroups

In semigroups, the centralizer of an element ss in a SS, denoted CS(s)C_S(s), is the set {tSts=st}\{ t \in S \mid ts = st \}, consisting of elements that commute with ss. For a TST \subseteq S, the centralizer CS(T)C_S(T) is defined as the of the centralizers of its individual elements, CS(T)=tTCS(t)C_S(T) = \bigcap_{t \in T} C_S(t). This construction does not necessarily yield a subsemigroup of SS, as the product of two elements in CS(T)C_S(T) may fail to commute with every element of TT. The normalizer of a TST \subseteq S in a extends the notion of preservation. The left normalizer is {uSuTTu}\{ u \in S \mid uT \subseteq Tu \}, the set of elements such that left multiplication by uu followed by adjustment preserves TT in a one-sided sense, and analogously the right normalizer is {uSTuuT}\{ u \in S \mid Tu \subseteq uT \}. The two-sided normalizer is their . These definitions highlight how normalizers in semigroups maintain structure via one-sided actions, contrasting with conjugation-based normalizers in groups.

In rings and algebras over a field

In a ring RR, the centralizer of an element aRa \in R is defined as the set CR(a)={rRra=ar}.C_R(a) = \{ r \in R \mid ra = ar \}. This set forms a of RR, containing the center Z(R)Z(R) and closed under addition and multiplication, as verified by direct computation: if r,sCR(a)r, s \in C_R(a), then (r+s)a=ra+sa=ar+as=a(r+s)(r + s)a = ra + sa = ar + as = a(r + s) and (rs)a=r(sa)=r(as)=(ra)s=(ar)s=a(rs)(rs)a = r(sa) = r(as) = (ra)s = (ar)s = a(rs). For a SRS \subseteq R, the centralizer CR(S)C_R(S) is the intersection sSCR(s)\bigcap_{s \in S} C_R(s), which is likewise a . In non-commutative rings, the two-sided centralizer as defined above coincides with the of the left centralizer {rRra=ar}\{ r \in R \mid ra = ar \} and right centralizer {rRar=ra}\{ r \in R \mid ar = ra \}, since the commutation condition is symmetric under the associativity of ring multiplication. The normalizer (or idealizer) of a left ideal II in RR is the set NR(I)={rRrII},N_R(I) = \{ r \in R \mid rI \subseteq I \}, which contains II as a two-sided ideal within it and forms a of RR; if RR has a multiplicative identity, then so does NR(I)N_R(I). The two-sided normalizer is {rRrII and IrI}\{ r \in R \mid rI \subseteq I \text{ and } Ir \subseteq I \}, also a under the same conditions. For an AA over a field KK, the centralizer CA(m)C_A(m) of a (left) AA-module mm consists of the KK-linear s of mm that commute with the action of AA, i.e., CA(m)={f\EndK(m)f(am)=af(m) aA,mm}\EndA(m).C_A(m) = \{ f \in \End_K(m) \mid f(am) = a f(m) \ \forall a \in A, m \in m \} \cong \End_A(m). If mm is a simple AA-module, then by , CA(m)C_A(m) is a over KK. This follows from the fact that any nonzero endomorphism in \EndA(m)\End_A(m) has trivial kernel and (as submodules of the simple module mm), hence is invertible. In the matrix algebra Mn(K)M_n(K) over a field KK, the centralizer of a matrix AMn(K)A \in M_n(K) always contains all polynomials in AA, i.e., K[A]CMn(K)(A)K[A] \subseteq C_{M_n(K)}(A), with equality holding if AA is non-derogatory (i.e., the minimal polynomial has degree nn). In general, the dimension of CMn(K)(A)C_{M_n(K)}(A) as a KK-vector space is i=1rdi2\sum_{i=1}^r d_i^2, where d1drd_1 \geq \cdots \geq d_r are the degrees of the invariant factors of AA. This reflects the structure imposed by the rational canonical form of AA.

In Lie algebras

In a Lie algebra LL over a field FF, the centralizer of an element xLx \in L is the set CL(x)={yL[x,y]=0}C_L(x) = \{ y \in L \mid [x, y] = 0 \}, where [,][\cdot, \cdot] denotes the Lie bracket; this forms a Lie subalgebra of LL. For a subset SLS \subseteq L, the centralizer is the intersection CL(S)=sSCL(s)C_L(S) = \bigcap_{s \in S} C_L(s), which is also a Lie subalgebra. In particular, the center of LL is Z(L)=CL(L)={zL[z,y]=0 yL}Z(L) = C_L(L) = \{ z \in L \mid [z, y] = 0 \ \forall y \in L \}, and Z(L)Z(L) is an ideal of LL since [Z(L),L]=0Z(L)[Z(L), L] = 0 \subseteq Z(L). The normalizer of a HLH \subseteq L is defined as NL(H)={xL[x,H]H}N_L(H) = \{ x \in L \mid [x, H] \subseteq H \}; this set is a of LL containing HH, as verified using the . If HH is an ideal of LL, then HH is an ideal of NL(H)N_L(H), since for xNL(H)x \in N_L(H) and hHh \in H, both [x,h]H[x, h] \in H and [h,x]=[x,h]H[h, x] = -[x, h] \in H. These notions relate to the adjoint representation of LL, which is the Lie algebra homomorphism ad:Lgl(L)\mathrm{ad}: L \to \mathfrak{gl}(L) given by adx(y)=[x,y]\mathrm{ad}_x(y) = [x, y] for x,yLx, y \in L. The centralizer CL(x)C_L(x) is precisely the kernel of the linear map adx:LL\mathrm{ad}_x: L \to L, and the center Z(L)Z(L) is the kernel of the full adjoint representation ad\mathrm{ad}. In a over an of characteristic zero, the centralizer of any semisimple element is a reductive Lie .

Examples

Symmetric groups

In the SnS_n, the centralizer and normalizer of permutations and subgroups provide concrete illustrations of these concepts, particularly through the lens of cycle structures and conjugacy. For a basic example, consider S3S_3, the on three letters. The centralizer of the transposition (1 2)(1\ 2) in S3S_3 consists solely of the identity and (1 2)(1\ 2) itself, forming a of order 2. Similarly, the normalizer of the subgroup (1 2)\langle (1\ 2) \rangle in S3S_3 is the subgroup itself, also of order 2, as conjugation by other elements maps it to distinct order-2 subgroups like (1 3)\langle (1\ 3) \rangle. More generally, in SnS_n, the centralizer of a transposition such as (1 2)(1\ 2) is generated by (1 2)(1\ 2) and S{3,,n}S_{\{3,\dots,n\}} acting on the fixed points, yielding a (1 2)×Sn2\langle (1\ 2) \rangle \times S_{n-2} of order 2(n2)!2(n-2)!. This structure arises because elements commuting with (1 2)(1\ 2) must either fix the set {1,2}\{1,2\} setwise while powering the transposition or permute the remaining points freely, without mixing them into the support of the transposition. The full centralizer can be viewed as a Z2S1×Sn2\mathbb{Z}_2 \wr S_1 \times S_{n-2}, but simplifies to the direct product due to the single 2-cycle. For an arbitrary permutation σSn\sigma \in S_n with cycle type λ\lambda, where there are mim_i cycles of length ii for each ii, the order of the centralizer CSn(σ)C_{S_n}(\sigma) is given by iimimi!\prod_i i^{m_i} m_i!. This formula accounts for the symmetries within cycles of the same length (via the mi!m_i!) and the rotational freedoms within each cycle (via imii^{m_i}). For instance, a single transposition corresponds to m2=1m_2 = 1 and m1=n2m_1 = n-2, yielding 211!1n2(n2)!=2(n2)!2^1 \cdot 1! \cdot 1^{n-2} \cdot (n-2)! = 2(n-2)!, consistent with the earlier description. Elements of the same cycle type in SnS_n lie in the same , and their centralizers are conjugate subgroups, hence isomorphic with the same order. This connection underscores how cycle type determines both the size of conjugacy classes—namely n!/CSn(σ)n! / |C_{S_n}(\sigma)|—and the structure of centralizers. Turning to normalizers of subgroups, the AnA_n is a of SnS_n of index 2, so its normalizer NSn(An)N_{S_n}(A_n) is the entire group SnS_n. In contrast, a Sylow pp-subgroup of SpS_p (for prime pp) is cyclic of order pp, generated by a pp-cycle, and its normalizer in SpS_p is the holomorph Hol(Zp)CpCp1\mathrm{Hol}(\mathbb{Z}_p) \cong C_p \rtimes C_{p-1}, which has order p(p1)p(p-1). This affine structure reflects the action of the (Z/pZ)×(\mathbb{Z}/p\mathbb{Z})^\times on the additive group by conjugation.

Matrix algebras

In matrix algebras over fields, centralizers of individual matrices provide concrete illustrations of commutativity in non-commutative rings. Consider Mn(R)M_n(\mathbb{R}), the ring of n×nn \times n matrices over the reals. For a diagonalizable matrix AMn(R)A \in M_n(\mathbb{R}) with distinct eigenvalues λ1,,λn\lambda_1, \dots, \lambda_n, the centralizer CMn(R)(A)C_{M_n(\mathbb{R})}(A) consists precisely of the diagonal matrices, that is, CMn(R)(A)={diag(μ1,,μn)μiR}C_{M_n(\mathbb{R})}(A) = \{ \operatorname{diag}(\mu_1, \dots, \mu_n) \mid \mu_i \in \mathbb{R} \}. This follows from the fact that AA is similar to D=diag(λ1,,λn)D = \operatorname{diag}(\lambda_1, \dots, \lambda_n), and matrices commuting with DD must preserve its eigenspaces, which are one-dimensional and spanned by the standard basis vectors. When the matrix is not diagonalizable, the centralizer structure reflects the Jordan form more intricately. For a single Jordan block Jk(λ)J_k(\lambda) of size kk with eigenvalue λ\lambda, viewed as an element of Mk(F)M_k(F) over a field FF, the centralizer CMk(F)(Jk(λ))C_{M_k(F)}(J_k(\lambda)) comprises all polynomials in Jk(λ)J_k(\lambda). These are matrices that are constant along each superdiagonal (Toeplitz form), forming an isomorphic to F/(xk(λλ)k)F/(x^k - (\lambda - \lambda)^k), but effectively dimension kk over FF since higher powers reduce via the minimal polynomial. For instance, in M2(Q)M_2(\mathbb{Q}), take the N=(0100)N = \begin{pmatrix} 0 & 1 \\ 0 & 0 \end{pmatrix}, which is the Jordan block J2(0)J_2(0). Its centralizer is CM2(Q)(N)=spanQ{I2,N}={aI2+bNa,bQ}C_{M_2(\mathbb{Q})}(N) = \operatorname{span}_\mathbb{Q} \{ I_2, N \} = \left\{ a I_2 + b N \mid a, b \in \mathbb{Q} \right\}, a 2-dimensional commutative . The overall structure of centralizers in matrix algebras is governed by a decomposition theorem tied to the Jordan canonical form. For a matrix cMn(F)c \in M_n(F) over an FF, the centralizer algebra CMn(F)(c)C_{M_n(F)}(c) decomposes into a of full matrix subalgebras over the generalized eigenspaces, with each component further breaking down into blocks corresponding to the partitions defined by the sizes of the Jordan chains (blocks) for that eigenvalue. Specifically, if the Jordan blocks for eigenvalue λi\lambda_i have sizes given by a partition, the centralizer restricted to that eigenspace is a cellular algebra whose primitive idempotents align with the chain lengths, enabling explicit computation of dimensions and representations. Normalizers in matrix algebras extend these ideas to subgroups, such as those preserving flags. In GLn(C)\mathrm{GL}_n(\mathbb{C}), the subgroup BB of invertible upper triangular matrices (the standard ) has normalizer NGLn(C)(B)=BN_{\mathrm{GL}_n(\mathbb{C})}(B) = B, meaning BB is self-normalizing. However, this normalizer includes matrices that conjugate BB to itself, such as those corresponding to permutations preserving the standard ordering (e.g., the identity monomial).

Properties

Commutativity and conjugation relations

In group theory, for any SS of a group GG, the centralizer CG(S)C_G(S) is always a of the normalizer NG(S)N_G(S), since any element that commutes with every member of SS necessarily conjugates SS to itself. Equality holds in this inclusion when SS is a singleton, as the normalizer condition reduces to commuting with that single element, or when SS is abelian and the conjugation action induced by NG(S)N_G(S) on SS is trivial. The centralizer and normalizer exhibit invariance under conjugation: for any gGg \in G, gCG(S)g1=CG(gSg1)g C_G(S) g^{-1} = C_G(g S g^{-1}), reflecting how commutation relations transform under inner automorphisms. Similarly, the normalizer NG(S)N_G(S) normalizes the centralizer CG(S)C_G(S), meaning NG(S)N_G(S) acts by conjugation to preserve CG(S)C_G(S) as a . Elements of CG(g)C_G(g), the centralizer of a single element gGg \in G, commute with gg by definition, which underpins the structure of conjugacy classes and relations within GG. A key quotient structure arises in groups, where NG(S)/CG(S)N_G(S)/C_G(S) embeds into the Aut(S)\operatorname{Aut}(S) via the conjugation action; specifically, the homomorphism sends each coset nCG(S)n C_G(S) to the automorphism snsn1s \mapsto n s n^{-1} for sSs \in S, with kernel precisely CG(S)C_G(S). Extending to algebraic structures, in a ring RR, the centralizer CR(I)C_R(I) of an ideal II contains the Z(R)Z(R), as every central element commutes with all of II. When considering the of units U(R)U(R) in a ring, the normalizer of a substructure acts by conjugation within U(R)U(R), mirroring the group-theoretic case but restricted to invertible elements.

Subgroup structures in groups

In group theory, the centralizer CG(S)C_G(S) of a SGS \subseteq G is a of GG. It contains the , which commutes with every element of SS. For closure under the group operation, if g,hCG(S)g, h \in C_G(S), then for any sSs \in S, (gh)s(gh)1=g(hsh1)g1=gsg1=s(gh)s(gh)^{-1} = g(hsh^{-1})g^{-1} = gs g^{-1} = s, so ghCG(S)gh \in C_G(S). For inverses, if gCG(S)g \in C_G(S), conjugating the relation gsg1=sg s g^{-1} = s by g1g^{-1} yields s=g1sgs = g^{-1} s g, confirming g1CG(S)g^{-1} \in C_G(S). Similarly, the normalizer NG(S)N_G(S) is a of GG. It contains the identity, which fixes SS by conjugation. For closure, if g,hNG(S)g, h \in N_G(S), then (gh)S(gh)1=g(hSh1)g1=gSg1=S(gh) S (gh)^{-1} = g (h S h^{-1}) g^{-1} = g S g^{-1} = S. For inverses, if gSg1=Sg S g^{-1} = S, conjugating both sides by g1g^{-1} gives S=g1SgS = g^{-1} S g, so g1NG(S)g^{-1} \in N_G(S). Moreover, CG(S)C_G(S) is normal in NG(S)N_G(S): for nNG(S)n \in N_G(S) and cCG(S)c \in C_G(S), the conjugate ncn1n c n^{-1} satisfies (ncn1)s(ncn1)1=nc(n1sn)c1n1(n c n^{-1}) s (n c n^{-1})^{-1} = n c (n^{-1} s n) c^{-1} n^{-1}, and since n1snSn^{-1} s n \in S and cc commutes with elements of SS, this simplifies to ss, confirming normality. The index [NG(S):CG(S)][N_G(S) : C_G(S)] equals the order of the image of NG(S)N_G(S) in Aut(S)\mathrm{Aut}(S) via conjugation, corresponding to the size of orbits in the conjugation action on SS. In finite groups, normalizers govern conjugacy of subgroups: the number of distinct conjugates of a subgroup HGH \leq G is [G:NG(H)][G : N_G(H)], the index of the normalizer. For Sylow pp-subgroups PP of a finite group GG, the number npn_p of such subgroups satisfies np=[G:NG(P)]n_p = [G : N_G(P)], with np1(modp)n_p \equiv 1 \pmod{p} and npn_p dividing G/pk|G|/p^k where pk=Pp^k = |P|. These conditions arise from the conjugation action of GG on the set of Sylow pp-subgroups, where stabilizers are the normalizers. Solvable groups, defined as finite groups GG admitting a with abelian factor groups, involve normalizers in their . Normalizers of abelian subgroups, especially Hall π\pi-subgroups (whose orders are coprime to their indices for a set of primes π\pi), are central to Hall's theorem: a is solvable if and only if it possesses Hall π\pi-subgroups for every such π\pi, and the normalizers of these abelian Hall subgroups facilitate inductive constructions in the solvability criteria. A subgroup HGH \leq G is self-normalizing if NG(H)=HN_G(H) = H; in this case, HH coincides with its normalizer, highlighting maximal subgroups under normalization. The Fitting subgroup F(G)F(G), the largest normal nilpotent subgroup of a finite group GG (also called the nilpotent radical), connects to normalizers of Sylow subgroups. For each prime pp, the pp-core Op(G)O_p(G) (largest normal pp-subgroup) is the intersection of all Sylow pp-subgroups; then F(G)F(G) is the direct product of the Op(G)O_p(G) over all pp.

Centralizers in associative structures

In an associative ring RR, the centralizer CR(a)={rRra=ar}C_R(a) = \{ r \in R \mid ra = ar \} of any element aRa \in R is always a of RR. In commutative rings, every element commutes with all others, so CR(a)=RC_R(a) = R for all aRa \in R. In noncommutative examples, such as the first Weyl algebra W1(k)=kx,W_1(k) = k\langle x, \partial \rangle over a field kk of characteristic zero where [,x]=1[\partial, x] = 1, the centralizer of xx is the subalgebra kk. Centralizers play a key role in the theory of derivations on rings. A derivation on RR is an additive map d:RRd: R \to R satisfying d(rs)=d(r)s+rd(s)d(rs) = d(r)s + r d(s) for all r,sRr, s \in R. Inner derivations are those of the form adr(s)=[r,s]=rssr\mathrm{ad}_r(s) = [r, s] = rs - sr for some rRr \in R, and the set Inn(R)={adrrR}\mathrm{Inn}(R) = \{ \mathrm{ad}_r \mid r \in R \} forms a Lie ideal in the Lie algebra Der(R)\mathrm{Der}(R) of all derivations. The outer derivation group is then Out(R)=Der(R)/Inn(R)\mathrm{Out}(R) = \mathrm{Der}(R) / \mathrm{Inn}(R). In the context of module theory over algebras, the double centralizer theorem provides structural insights. For a simple algebra AA over a field kk acting on a simple faithful module MM, let E=EndA(M)E = \mathrm{End}_A(M); then the centralizer CEndk(M)(E)=AC_{\mathrm{End}_k(M)}(E) = A. If AA is central simple, this implies EE is a . More generally, if RR is a over kk and aRa \in R is nonzero, the double centralizer theorem ensures CR(a)C_R(a) is a central simple , and under conditions where it achieves minimal dimension (e.g., when generated by aa over kk), CR(a)C_R(a) is a . For prime rings, additional module-theoretic properties hold. A ring RR is prime if whenever I,JI, J are nonzero ideals with IRJ=0I R J = 0, then I=0I = 0 or J=0J = 0. In such rings, the centralizer CR(a)C_R(a) for nonzero aRa \in R is a nonzero (containing multiples of aa).

References

  1. https://groupprops.subwiki.org/wiki/Subgroup_structure_of_symmetric_group:S3
Add your contribution
Related Hubs
User Avatar
No comments yet.