Recent from talks
Nothing was collected or created yet.
Centralizer and normalizer
View on 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] = xy − yx. 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 S ⊆ G. 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]- ^ Kevin O'Meara; John Clark; Charles Vinsonhaler (2011). Advanced Topics in Linear Algebra: Weaving Matrix Problems Through the Weyr Form. Oxford University Press. p. 65. ISBN 978-0-19-979373-0.
- ^ Karl Heinrich Hofmann; Sidney A. Morris (2007). The Lie Theory of Connected Pro-Lie Groups: A Structure Theory for Pro-Lie Algebras, Pro-Lie Groups, and Connected Locally Compact Groups. European Mathematical Society. p. 30. ISBN 978-3-03719-032-6.
- ^ Jacobson (2009), p. 41
- ^ a b c Jacobson 1979, p. 28.
- ^ Jacobson 1979, p. 57.
- ^ Isaacs 2009, Chapters 1−3.
References
[edit]- Isaacs, I. Martin (2009), Algebra: a graduate course, Graduate Studies in Mathematics, vol. 100 (reprint of the 1994 original ed.), Providence, RI: American Mathematical Society, doi:10.1090/gsm/100, ISBN 978-0-8218-4799-2, MR 2472787
- Jacobson, Nathan (2009), Basic Algebra, vol. 1 (2 ed.), Dover Publications, ISBN 978-0-486-47189-1
- Jacobson, Nathan (1979), Lie Algebras (republication of the 1962 original ed.), Dover Publications, ISBN 0-486-63832-4, MR 0559927
Centralizer and normalizer
View on GrokipediaDefinitions
In groups
In group theory, groups act on themselves by conjugation, where the action is defined by for all .[1] This action provides the foundational framework for understanding centralizers and normalizers as stabilizers under conjugation.[3] The centralizer of an element in a group , denoted , is the set , or equivalently .[1] This set forms a subgroup of , as it is closed under the group operation and inversion: if , then , and similarly for inverses.[3] For a subset , the centralizer is defined as the intersection .[1] As an intersection of subgroups, is itself a subgroup of .[3] The normalizer of a subset , denoted , is the set , consisting of elements that preserve under conjugation.[1] This set forms a subgroup of , verified by closure: if , then , with analogous checks for inverses and the identity.[3] If is a subgroup of , then , since conjugation by elements of leaves invariant.[1] The center of the group , denoted , is the centralizer of the entire group, , or equivalently .[1] This is the kernel of the conjugation action of on itself, comprising elements fixed by all conjugations.[3]In semigroups
In semigroups, the centralizer of an element in a semigroup , denoted , is the set , consisting of elements that commute with .[4] For a subset , the centralizer is defined as the intersection of the centralizers of its individual elements, . This construction does not necessarily yield a subsemigroup of , as the product of two elements in may fail to commute with every element of .[5] The normalizer of a subset in a semigroup extends the notion of preservation. The left normalizer is , the set of elements such that left multiplication by followed by adjustment preserves in a one-sided sense, and analogously the right normalizer is . The two-sided normalizer is their intersection.[6] These definitions highlight how normalizers in semigroups maintain subset structure via one-sided actions, contrasting with conjugation-based normalizers in groups.[6]In rings and algebras over a field
In a ring , the centralizer of an element is defined as the set This set forms a subring of , containing the center and closed under addition and multiplication, as verified by direct computation: if , then and .[7] For a subset , the centralizer is the intersection , which is likewise a subring.[8] In non-commutative rings, the two-sided centralizer as defined above coincides with the intersection of the left centralizer and right centralizer , since the commutation condition is symmetric under the associativity of ring multiplication.[9] The normalizer (or idealizer) of a left ideal in is the set which contains as a two-sided ideal within it and forms a subring of ; if has a multiplicative identity, then so does .[10] The two-sided normalizer is , also a subring under the same conditions.[11] For an algebra over a field , the centralizer of a (left) -module consists of the -linear endomorphisms of that commute with the action of , i.e., If is a simple -module, then by Schur's lemma, is a division ring over .[12] This follows from the fact that any nonzero endomorphism in has trivial kernel and image (as submodules of the simple module ), hence is invertible.[13] In the matrix algebra over a field , the centralizer of a matrix always contains all polynomials in , i.e., , with equality holding if is non-derogatory (i.e., the minimal polynomial has degree ). In general, the dimension of as a -vector space is , where are the degrees of the invariant factors of .[14] This reflects the structure imposed by the rational canonical form of .[15]In Lie algebras
In a Lie algebra over a field , the centralizer of an element is the set , where denotes the Lie bracket; this forms a Lie subalgebra of .[16] For a subset , the centralizer is the intersection , which is also a Lie subalgebra.[16] In particular, the center of is , and is an ideal of since .[16] The normalizer of a subalgebra is defined as ; this set is a Lie subalgebra of containing , as verified using the Jacobi identity.[17] If is an ideal of , then is an ideal of , since for and , both and .[17] These notions relate to the adjoint representation of , which is the Lie algebra homomorphism given by for .[16] The centralizer is precisely the kernel of the linear map , and the center is the kernel of the full adjoint representation .[16] In a semisimple Lie algebra over an algebraically closed field of characteristic zero, the centralizer of any semisimple element is a reductive Lie subalgebra.[18]Examples
Symmetric groups
In the symmetric group , 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 , the symmetric group on three letters. The centralizer of the transposition in consists solely of the identity and itself, forming a subgroup of order 2.[2] Similarly, the normalizer of the subgroup in is the subgroup itself, also of order 2, as conjugation by other elements maps it to distinct order-2 subgroups like .[19] More generally, in , the centralizer of a transposition such as is generated by and the symmetric group acting on the fixed points, yielding a direct product of order .[2] This structure arises because elements commuting with must either fix the set 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 wreath product , but simplifies to the direct product due to the single 2-cycle.[20] For an arbitrary permutation with cycle type , where there are cycles of length for each , the order of the centralizer is given by .[20] This formula accounts for the symmetries within cycles of the same length (via the ) and the rotational freedoms within each cycle (via ). For instance, a single transposition corresponds to and , yielding , consistent with the earlier description.[2] Elements of the same cycle type in lie in the same conjugacy class, and their centralizers are conjugate subgroups, hence isomorphic with the same order.[2] This connection underscores how cycle type determines both the size of conjugacy classes—namely —and the structure of centralizers. Turning to normalizers of subgroups, the alternating group is a normal subgroup of of index 2, so its normalizer is the entire group .[2] In contrast, a Sylow -subgroup of (for prime ) is cyclic of order , generated by a -cycle, and its normalizer in is the holomorph , which has order .[2] This affine structure reflects the action of the multiplicative group on the additive group by conjugation.[21]Matrix algebras
In matrix algebras over fields, centralizers of individual matrices provide concrete illustrations of commutativity in non-commutative rings. Consider , the ring of matrices over the reals. For a diagonalizable matrix with distinct eigenvalues , the centralizer consists precisely of the diagonal matrices, that is, .[22] This follows from the fact that is similar to , and matrices commuting with must preserve its eigenspaces, which are one-dimensional and spanned by the standard basis vectors.[22] When the matrix is not diagonalizable, the centralizer structure reflects the Jordan form more intricately. For a single Jordan block of size with eigenvalue , viewed as an element of over a field , the centralizer comprises all polynomials in . These are matrices that are constant along each superdiagonal (Toeplitz form), forming an algebra isomorphic to , but effectively dimension over since higher powers reduce via the minimal polynomial.[22] For instance, in , take the nilpotent matrix , which is the Jordan block . Its centralizer is , a 2-dimensional commutative subalgebra.[22] The overall structure of centralizers in matrix algebras is governed by a decomposition theorem tied to the Jordan canonical form. For a matrix over an algebraically closed field , the centralizer algebra decomposes into a direct product 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.[22] Specifically, if the Jordan blocks for eigenvalue 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.[22] Normalizers in matrix algebras extend these ideas to subgroups, such as those preserving flags. In , the subgroup of invertible upper triangular matrices (the standard Borel subgroup) has normalizer , meaning is self-normalizing.[23] However, this normalizer includes monomial matrices that conjugate to itself, such as those corresponding to permutations preserving the standard flag ordering (e.g., the identity monomial).[24]Properties
Commutativity and conjugation relations
In group theory, for any subset of a group , the centralizer is always a subgroup of the normalizer , since any element that commutes with every member of necessarily conjugates to itself. Equality holds in this inclusion when is a singleton, as the normalizer condition reduces to commuting with that single element, or when is abelian and the conjugation action induced by on is trivial. The centralizer and normalizer exhibit invariance under conjugation: for any , , reflecting how commutation relations transform under inner automorphisms. Similarly, the normalizer normalizes the centralizer , meaning acts by conjugation to preserve as a subgroup. Elements of , the centralizer of a single element , commute with by definition, which underpins the structure of conjugacy classes and commutator relations within . A key quotient structure arises in groups, where embeds into the automorphism group via the conjugation action; specifically, the homomorphism sends each coset to the automorphism for , with kernel precisely . Extending to algebraic structures, in a ring , the centralizer of an ideal contains the center , as every central element commutes with all of . When considering the multiplicative group of units in a ring, the normalizer of a substructure acts by conjugation within , mirroring the group-theoretic case but restricted to invertible elements.Subgroup structures in groups
In group theory, the centralizer of a subset is a subgroup of . It contains the identity element, which commutes with every element of . For closure under the group operation, if , then for any , , so . For inverses, if , conjugating the relation by yields , confirming .[2] Similarly, the normalizer is a subgroup of . It contains the identity, which fixes by conjugation. For closure, if , then . For inverses, if , conjugating both sides by gives , so . Moreover, is normal in : for and , the conjugate satisfies , and since and commutes with elements of , this simplifies to , confirming normality. The index equals the order of the image of in via conjugation, corresponding to the size of orbits in the conjugation action on .[2] In finite groups, normalizers govern conjugacy of subgroups: the number of distinct conjugates of a subgroup is , the index of the normalizer. For Sylow -subgroups of a finite group , the number of such subgroups satisfies , with and dividing where . These conditions arise from the conjugation action of on the set of Sylow -subgroups, where stabilizers are the normalizers.[2] Solvable groups, defined as finite groups admitting a composition series with abelian factor groups, involve normalizers in their structural analysis. Normalizers of abelian subgroups, especially Hall -subgroups (whose orders are coprime to their indices for a set of primes ), are central to Hall's theorem: a finite group is solvable if and only if it possesses Hall -subgroups for every such , and the normalizers of these abelian Hall subgroups facilitate inductive constructions in the solvability criteria.[2] A subgroup is self-normalizing if ; in this case, coincides with its normalizer, highlighting maximal subgroups under normalization.[2] The Fitting subgroup , the largest normal nilpotent subgroup of a finite group (also called the nilpotent radical), connects to normalizers of Sylow subgroups. For each prime , the -core (largest normal -subgroup) is the intersection of all Sylow -subgroups; then is the direct product of the over all .[2]Centralizers in associative structures
In an associative ring , the centralizer of any element is always a subring of .[8] In commutative rings, every element commutes with all others, so for all .[8] In noncommutative examples, such as the first Weyl algebra over a field of characteristic zero where , the centralizer of is the polynomial subalgebra .[25] Centralizers play a key role in the theory of derivations on rings. A derivation on is an additive map satisfying for all . Inner derivations are those of the form for some , and the set forms a Lie ideal in the Lie algebra of all derivations. The outer derivation group is then .[26] In the context of module theory over algebras, the double centralizer theorem provides structural insights. For a simple algebra over a field acting on a simple faithful module , let ; then the centralizer . If is central simple, this implies is a division algebra.[27] More generally, if is a central simple algebra over and is nonzero, the double centralizer theorem ensures is a central simple subalgebra, and under conditions where it achieves minimal dimension (e.g., when generated by over ), is a division algebra.[27] For prime rings, additional module-theoretic properties hold. A ring is prime if whenever are nonzero ideals with , then or . In such rings, the centralizer for nonzero is a nonzero subring (containing multiples of ).References
- https://groupprops.subwiki.org/wiki/Subgroup_structure_of_symmetric_group:S3
