Commuting probability

From testwiki
Jump to navigation Jump to search

Template:Short description

In mathematics and more precisely in group theory, the commuting probability (also called degree of commutativity or commutativity degree) of a finite group is the probability that two randomly chosen elements commute.[1][2] It can be used to measure how close to abelian a finite group is. It can be generalized to infinite groups equipped with a suitable probability measure,[3] and can also be generalized to other algebraic structures such as rings.[4]

Definition

Let G be a finite group. We define p(G) as the averaged number of pairs of elements of G which commute:

p(G):=1#G2#{(x,y)G2xy=yx}

where #X denotes the cardinality of a finite set X.

If one considers the uniform distribution on G2, p(G) is the probability that two randomly chosen elements of G commute. That is why p(G) is called the commuting probability of G.

Results

p(G)=k(G)#G
where k(G) is the number of conjugacy classes of G.
  • If G is not abelian then p(G)5/8 (this result is sometimes called the 5/8 theorem[5]) and this upper bound is sharp: there are infinitely many finite groups G such that p(G)=5/8, the smallest one being the dihedral group of order 8.
  • There is no uniform lower bound on p(G). In fact, for every positive integer n there exists a finite group G such that p(G)=1/n.
  • If G is not abelian but simple, then p(G)1/12 (this upper bound is attained by 𝔄5, the alternating group of degree 5).
  • The set of commuting probabilities of finite groups is reverse-well-ordered, and the reverse of its order type is known to be either ωω or ωω2.[6]

Generalizations

References

Template:Reflist