Multiplication table of a finite group

From Groupprops

This article is about a basic definition in group theory. The article text may, however, contain advanced material.
VIEW: Definitions built on this | Facts about this: (facts closely related to Multiplication table of a finite group, all facts related to Multiplication table of a finite group) |Survey articles about this | Survey articles about definitions built on this
VIEW RELATED: Analogues of this | Variations of this | Opposites of this |[SHOW MORE]

Definition

Definition with symbols

Let G be a finite group of order n. Then, the multiplication table of G is a n×n matrix described as follows:

  • Label the elements of G as g1,g2,,gn such that g1 is the identity element.
  • Now, in the (i,j)th entry of the matrix, put the element gigj

Note that under this definition, the multiplication table is an n×n matrix with entries drawn from G. We can, however, change this to a n×n matrix with entries drawn from 1,2,,n by simply replacing gG by the k for which g=gk.

The latter interpretation makes the multiplication table into a purely combinatorial object. We shall use this latter interpretation.

Clearly, the multiplication table determines the group uniquely.

We can also construct the multiplication table of any finite magma in the same way.

Properties

Latin square

The multiplication table of a finite group is a Latin square, when we view it as having entries 1,2,,n. In other words, every row contains each element exactly once and every column contains each element exactly once.

In fact, the multiplication table of a finite magma is a latin square if and only if that magma is a quasigroup. Groups are indeed quasigroups.

Since we chose g1 as the identity element, the first row and first column are both 1,2,,n.

Symmetric Latin square

The multiplication table of a finite group (and more generally, of any finite magma) is a symmetric matrix if and only if the binary operation is commutative. In the case of groups, this boils down to saying that the group is Abelian.

Automorphisms of the group

Let P be the permutation matrix corresponding to an automorphism of G. If M denotes the multiplication table matrix for G, we have:

PMPt=M

This is equivalent to saying that M commutes with P.

In other words, the centralizer of M in GLn(Z) contains all permutation matrices arising from automorphisms of G.