Multiplication table of a finite group
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 be a finite group of order . Then, the multiplication table of is a matrix described as follows:
- Label the elements of as such that is the identity element.
- Now, in the entry of the matrix, put the element
Note that under this definition, the multiplication table is an matrix with entries drawn from . We can, however, change this to a matrix with entries drawn from by simply replacing by the for which .
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 . 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 as the identity element, the first row and first column are both .
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 be the permutation matrix corresponding to an automorphism of . If denotes the multiplication table matrix for , we have:
This is equivalent to saying that commutes with .
In other words, the centralizer of in contains all permutation matrices arising from automorphisms of .