Added to Favorites

Popular Searches

Definitions

In mathematics, especially group theory, the elements of any group may be partitioned into conjugacy classes; members of the same conjugacy class share many properties, and study of conjugacy classes of non-abelian groups reveals many important features of their structure. In all abelian groups every conjugacy class is a set containing one element (singleton set).## Definition

## Examples

The symmetric group S_{3}, consisting of all 6 permutations of three elements, has three conjugacy classes:## Properties

## Conjugacy class equation

_{i} = C_{G}(x_{i}) for each x_{i} in S. Note that [G : H_{i}] is the number of elements in conjugacy class i, a proper divisor of |G| bigger than one. If the divisors of |G| are known, then this equation can often be used to gain information about the size of the center or of the conjugacy classes.
### Example

## Conjugacy of subgroups and general subsets

## Conjugacy as group action

## Geometric interpretation

Functions that are constant for members of the same conjugacy class are called class functions.

Suppose G is a group. Two elements a and b of G are called conjugate if there exists an element g in G with

- gag
^{−1}= b.

(In linear algebra, for matrices this is called similarity.)

It can be readily shown that conjugacy is an equivalence relation and therefore partitions G into equivalence classes. (This means that every element of the group belongs to precisely one conjugacy class, and the classes Cl(a) and Cl(b) are equal if and only if a and b are conjugate, and disjoint otherwise.) The equivalence class that contains the element a in G is

- Cl(a) = { gag
^{−1}: g ∈ G }

- no change (abc → abc)
- interchanging two (abc → acb, abc → bac, abc → cba)
- a cyclic permutation of all three (abc → bca, abc → cab)

The symmetric group S_{4}, consisting of all 24 permutations of four elements, has five conjugacy classes, listed with their orders:

- no change (1)
- interchanging two (6)
- a cyclic permutation of three (8)
- a cyclic permutation of all four (6)
- interchanging two, and also the other two (3)

In general, the number of conjugacy classes in the symmetric group S_{n} is equal to the number of integer partitions of n. This is because each conjugacy class corresponds to exactly one partition of {1, 2, ..., n} into cycles, up to permutation of the elements of {1, 2, ..., n}.

See also the proper rotations of the cube, which can be characterized by permutations of the body diagonals.

- The identity element is always in its own class, that is Cl(e) = {e}
- If G is abelian, then gag
^{−1}= a for all a and g in G; so Cl(a) = {a} for all a in G; the concept is therefore not very useful in the abelian case. The failure of this thus gives us an idea in what degree the group is abelian. - If two elements a and b of G belong to the same conjugacy class (i.e., if they are conjugate), then they have the same order. More generally, every statement about a can be translated into a statement about b=gag
^{−1}, because the map φ(x) = gxg^{−1}is an automorphism of G. - An element a of G lies in the center Z(G) of G if and only if its conjugacy class has only one element, a itself. More generally, if C
_{G}(a) denotes the centralizer of a in G, i.e., the subgroup consisting of all elements g such that ga = ag, then the index [G : C_{G}(a)] is equal to the number of elements in the conjugacy class of a.

If G is a finite group, then the previous paragraphs, together with the Lagrange's theorem, imply that the number of elements in every conjugacy class divides the order of G. (Note: the identity is its own conjugacy class.)

Furthermore, for any group G, we can define a representative set S = {x_{i}} by picking one element from each conjugacy class of G that has more than one element. Then G is the disjoint union of Z(G) and the conjugacy classes Cl(x_{i}) of the elements of S. One can then formulate the following important class equation:

- |G| = |Z(G)| + ∑
_{i}[G : H_{i}]

Consider a finite p-group G (that is, a group with order p^{n}, where p is a prime number and n > 0). We are going to prove that: every finite p-group has a non-trivial center.

Since the order of any subgroup of G must divide the order of G, it follows that each H_{i} also has order some power of p^{(ki )}, where 0 < k_{i} < n. But then the class equation requires that |G| = p^{n} = |Z(G)| + ∑_{i} (p^{(ki )}). From this we see that p must divide |Z(G)|, so |Z(G)| > 1.

More generally, given any subset S of G (S not necessarily a subgroup), we define a subset T of G to be conjugate to S if and only if there exists some g in G such that T = gSg^{−1}. We can define Cl(S) as the set of all subsets T of G such that T is conjugate to S.

A frequently used theorem is that, given any subset S of G, the index of N(S) (the normalizer of S) in G equals the order of Cl(S):

- |Cl(S)| = [G : N(S)]

This follows since, if g and h are in G, then gSg^{−1} = hSh^{−1} if and only if gh^{ −1} is in N(S), in other words, if and only if g and h are in the same coset of N(S).

Note that this formula generalizes the one given earlier for the number of elements in a conjugacy class (let S = {a}).

The above is particularly useful when talking about subgroups of G. The subgroups can thus be divided into conjugacy classes, with two subgroups belonging to the same class if and only if they are conjugate. Conjugate subgroups are isomorphic, but isomorphic subgroups need not be conjugate (for example, an abelian group may have two different subgroups which are isomorphic, but they are never conjugate).

If we define

- g.x = gxg
^{−1}

Similarly, we can define a group action of G on the set of all subsets of G, by writing

- g.S = gSg
^{−1},

Conjugacy classes in the fundamental group of a path-connected topological space can be thought of as equivalence classes of free loops under free homotopy.

Wikipedia, the free encyclopedia © 2001-2006 Wikipedia contributors (Disclaimer)

This article is licensed under the GNU Free Documentation License.

Last updated on Friday August 29, 2008 at 20:18:00 PDT (GMT -0700)

View this article at Wikipedia.org - Edit this article at Wikipedia.org - Donate to the Wikimedia Foundation

This article is licensed under the GNU Free Documentation License.

Last updated on Friday August 29, 2008 at 20:18:00 PDT (GMT -0700)

View this article at Wikipedia.org - Edit this article at Wikipedia.org - Donate to the Wikimedia Foundation

Copyright © 2015 Dictionary.com, LLC. All rights reserved.