(more info)

Math for the people, by the people.

Main Menu

sections Encyclopædia
Papers
Books
Expositions

meta Requests (194)
Orphanage
Unclass'd
Unproven (498)
Corrections (25)
Classification

talkback Polls
Forums
Feedback
Bug Reports

downloads Snapshots
PM Book

information News
Docs
Wiki
ChangeLog
TODO List
Legalese
About

centralizers in algebra

(Definition)

Abstract definitions and properties

Definition 1 Let be a set with a binary operation . Let be a subset of . Then define the centralizer in of as the subset

$% latex2html id marker 764 $\displaystyle C_S(T)=\{ s\in S : s*t=t*s, \textnormal{ for all } t\in T\}.$$

The center of is defined as . This is commonly denoted where is derived from the German word zentral. Subsets and elements of the center are called central.

If we regard $*:S\times S\to S$ in the language of actions we can perscribe a left action and a right action . The centralizer is thus the set of elements for which the left regular action and the right regular action agree when restricted to .

It is generally possible to have not lie in for $s\in C_S(T)$ and $t\in T$ , and likewise, it is also possible that if $s,s'\in C_S(T)$ that $s*s'\neq s'*s$ . Therefore it should not be presumed that the centralizer is central.

With further axioms on the type of operation we can deduce certain natural properties for the set .

Proposition 2

If $A\subseteq B$ , then $C_S(B)\subseteq C_S(A)$ . In particular, $C_S(\varnothing)=S$ .
If has an identity then is non-empty. In particular, in this case is non-empty. ¹
If is associative and $s,s'\in C_S(T)$ then $s*s'\in C_S(T)$ , we say then that is closed to the binary operation of .
If $s\in C_S(T)$ and has an (strong) inverse $s^{-1}$ , then $s^{-1}\in C_S(T)$ .²
If is commutative then .
If is a subset of the center of then .

Note that it is possible for be a subset closed to the opertaion without the assumption of associativity, as for example, when is commutative.

Centralizers in groups

In the category of groups the centralizer in a group of a subset can be redefined as:

$% latex2html id marker 866 $\displaystyle C_G(H)=\{ g\in G : g^{-1} h g=h, \textnormal{ for all } h\in H\}.$$

If one regards conjugation as a group action $h^g:=g^{-1} hg$ then it follows that the centralizer is the same as the pointwise stabilizer in

, where the action is of

on itself by conjugation. Because of this overlap, in some contexts the term centralizers is applied to the pointwise stabilizer of a set on which a group acts, even though this context no longer refers to the action of conjugation. This is espeically common when there is a need to distinguish between the pointwise stabilizer and the setwise stabilizer.

In this category, the centralizer is always a subgroup of . Furthermore, if is a normal subgroup of , then so too is .

Centralizers in rings and algebras

For uniformity we treat rings as algebras over $\mathbb{Z}$ and now speak only of algebras, which will include nonassociative examples.

In an algebra there is in fact two binary operations on the set in question. Thus the abstract definition of the centralizer is ambiguous. However, the additive operation of rings and algebras is always commutative and so any centralizer with respect to this operation is the entire set . Thus it is generally accepted practice to assume that centralizers in this context always refer to the multiplicative operation. In this way we have the following properties.

Proposition 3 Given an algebra over a commutative unital ring and a subset of , then

is a submodule of .
If is associative then is a subalgebra.
$Z(A)\leq C_A(B)$ , in particular, if has a 1 then $1\in C_A(B)$ and so embeds in .

Remarks.

A centralizer in an algebra is also called a commutant. This terminology is mostly used in algebras of operators in functional analysis.
Let be a ring (or an algebra). For every ordered pair of elements of , we can define the additive commutator of to be the element , written . With this, one may alternatively define the centralizer of a set $S\subseteq R$ in a ring as
$% latex2html id marker 940 $\displaystyle C_R(S):=\{ r\in R\mid [r,s]=0 \textnormal{ for all }s\in S \}.$$
Of course, in this definition, two operations (multiplication and subtraction) are needed instead of one. But the nice aspect about this definition is that one can “measure” commutativity of a ring by the additive commutation operation. For example, one can show that, in a division ring, if every element additively commutes with every additive commutator, then the ring must be a field.

Centralizers in Lie algebras

Suppose $\mathfrak{g}$ is a Lie aglebra over a commutative ring of characteristic not . Given a subset of $\mathfrak{g}$ , then for $s\in \mathfrak{g}$ and $t\in T$ from the axioms of a Lie algebra multiplication. Therefore whenever it follows that so that . This motivates the more common redefinition of the centralizer in a Lie algebra:

$% latex2html id marker 963 $\displaystyle C_{\mathfrak{g}}(T)=\{ s\in \mathfrak{g} : [s,t]=0, \textnormal{ for all } t\in T\}.$$

Despite the incongruety in characteristic 2, this new definition replaces the original definition of centralizers for Lie algebras. The centralizer of a Lie algebra is a subalgebra.

When the Lie multiplication is regarded as a commutator, so , for example it it universal enveloping algebra, then is the same as and so the centralizer of the Lie algebra coincides with the centralizer of the associative envelope.

Centralizers in other nonassociative algebras

The centralizer need not be a subalgebra on account of the lack of associativity. There are instances of non-associative algebras where the centralizer is however a subalgebra nontheless, for example, Lie algebras as seen above. In travial fashion, if an algebra is commutative then and so the centralizer is a subalgebra but without any useful properties. There is a suitable additional constraint to add to centralizers to force them to be subalgebras and carry with them more useful information in the commutative but nonassociative setting.

We write for , called the commutator in of $a,b\in A$ and also write for and call it the associator in of $a,b,c\in A$ .³ Then we can redefine the centralizer in of a subset of as

$% latex2html id marker 1000 $\displaystyle C_{A}(T)=\{ s\in A: [s,t]=0, /s',s,t/=/s',t,s/=/t,s',s/=0\textnormal{ for all } t\in T, s'\in A\}.$$

It follows that

is a subalgebra of

on account of the added associator condition which forces the subset to be closed to the product.

In alternative algebras, if any one of three associators is 0 then the other three are as well and so the definition reduces to . Similar reductions occur of other nonassociative algebras.

Footnotes

... non-empty.¹: An identity of is an element $e\in S$ such that for all $s\in S$ .
....²: We say an inverse is strong if $s^{-1}*(s*t)=t=(t*s)*s^{-1}$ for all $t\in S$ . If the operation is associative then this is given for free. There are natural nonassociative operations with this property, such as alternative algebras.
....³: This notation for associators is non-standard but the standard is likely confusing given the usual commutator notation used already.

"centralizers in algebra" is owned by Algeboy. [ full author list (2) ]

(view preamble)