In mathematics, especially group theory, two elements formula_1 and formula_2 of a group are conjugate if there is an element formula_3 in the group such that formula_4 This is an equivalence relation whose equivalence classes are called conjugacy classes. In other words, each conjugacy class is closed under formula_5 for all elements formula_3 in the group. Members of the same conjugacy class cannot be distinguished by using only the group structure, and therefore share many properties. The study of conjugacy classes of non-abelian groups is fundamental for the study of their structure. For an abelian group, each conjugacy class is a set containing one element (singleton set). Functions that are constant for members of the same conjugacy class are called class functions. Definition. Let formula_7 be a group. Two elements formula_8 are conjugate if there exists an element formula_9 such that formula_10 in which case formula_2 is called of formula_1 and formula_1 is called a conjugate of formula_14 In the case of the general linear group formula_15 of invertible matrices, the conjugacy relation is called matrix similarity. It can be easily shown that conjugacy is an equivalence relation and therefore partitions formula_7 into equivalence classes. (This means that every element of the group belongs to precisely one conjugacy class, and the classes formula_17 and formula_18 are equal if and only if formula_1 and formula_2 are conjugate, and disjoint otherwise.) The equivalence class that contains the element formula_21 is formula_22 and is called the conjugacy class of formula_23 The of formula_7 is the number of distinct (nonequivalent) conjugacy classes. All elements belonging to the same conjugacy class have the same order. Conjugacy classes may be referred to by describing them, or more briefly by abbreviations such as "6A", meaning "a certain conjugacy class with elements of order 6", and "6B" would be a different conjugacy class with elements of order 6; the conjugacy class 1A is the conjugacy class of the identity which has order 1. In some cases, conjugacy classes can be described in a uniform way; for example, in the symmetric group they can be described by cycle type. Examples. The symmetric group formula_25 consisting of the 6 permutations of three elements, has three conjugacy classes: These three classes also correspond to the classification of the isometries of an equilateral triangle. The symmetric group consisting of the 24 permutations of four elements, has five conjugacy classes, listed with their description, cycle type, member order, and members: In general, the number of conjugacy classes in the symmetric group formula_29 is equal to the number of integer partitions of formula_30 This is because each conjugacy class corresponds to exactly one partition of formula_31 into cycles, up to permutation of the elements of formula_32 Conjugacy as group action. For any two elements formula_73 let formula_74 This defines a group action of formula_7 on formula_76 The orbits of this action are the conjugacy classes, and the stabilizer of a given element is the element's centralizer. Similarly, we can define a group action of formula_7 on the set of all subsets of formula_78 by writing formula_79 or on the set of the subgroups of formula_76 Conjugacy class equation. If formula_7 is a finite group, then for any group element formula_82 the elements in the conjugacy class of formula_1 are in one-to-one correspondence with cosets of the centralizer formula_84 This can be seen by observing that any two elements formula_2 and formula_86 belonging to the same coset (and hence, formula_87 for some formula_88 in the centralizer formula_57) give rise to the same element when conjugating formula_1: formula_91 That can also be seen from the orbit-stabilizer theorem, when considering the group as acting on itself through conjugation, so that orbits are conjugacy classes and stabilizer subgroups are centralizers. The converse holds as well. Thus the number of elements in the conjugacy class of formula_1 is the index formula_93 of the centralizer formula_57 in formula_7; hence the size of each conjugacy class divides the order of the group. Furthermore, if we choose a single representative element formula_96 from every conjugacy class, we infer from the disjointness of the conjugacy classes that formula_97 where formula_98 is the centralizer of the element formula_99 Observing that each element of the center formula_54 forms a conjugacy class containing just itself gives rise to the class equation: formula_101 where the sum is over a representative element from each conjugacy class that is not in the center. Knowledge of the divisors of the group order formula_102 can often be used to gain information about the order of the center or of the conjugacy classes. Example. Consider a finite formula_103-group formula_7 (that is, a group with order formula_105 where formula_103 is a prime number and formula_107). We are going to prove that . Since the order of any conjugacy class of formula_7 must divide the order of formula_78 it follows that each conjugacy class formula_110 that is not in the center also has order some power of formula_111 where formula_112 But then the class equation requires that formula_113 From this we see that formula_103 must divide formula_115 so formula_116 In particular, when formula_117 then formula_7 is an abelian group since any non-trivial group element is of order formula_103 or formula_120 If some element formula_1 of formula_7 is of order formula_123 then formula_7 is isomorphic to the cyclic group of order formula_123 hence abelian. On the other hand, if every non-trivial element in formula_7 is of order formula_127 hence by the conclusion above formula_128 then formula_129 or formula_120 We only need to consider the case when formula_131 then there is an element formula_2 of formula_7 which is not in the center of formula_76 Note that formula_135 includes formula_2 and the center which does not contain formula_2 but at least formula_103 elements. Hence the order of formula_135 is strictly larger than formula_127 therefore formula_141 therefore formula_2 is an element of the center of formula_78 a contradiction. Hence formula_7 is abelian and in fact isomorphic to the direct product of two cyclic groups each of order formula_145 Conjugacy of subgroups and general subsets. More generally, given any subset formula_146 (formula_147 not necessarily a subgroup), define a subset formula_148 to be conjugate to formula_147 if there exists some formula_9 such that formula_151 Let formula_152 be the set of all subsets formula_148 such that formula_154 is conjugate to formula_155 A frequently used theorem is that, given any subset formula_156 the index of formula_157 (the normalizer of formula_147) in formula_7 equals the cardinality of formula_152: formula_161 This follows since, if formula_162 then formula_163 if and only if formula_164 in other words, if and only if formula_165 are in the same coset of formula_166 By using formula_167 this formula generalizes the one given earlier for the number of elements in a conjugacy class. The above is particularly useful when talking about subgroups of formula_76 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. Geometric interpretation. 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. Conjugacy class and irreducible representations in finite group. In any finite group, the number of nonisomorphic irreducible representations over the complex numbers is precisely the number of conjugacy classes.