Matrix group

From Wikipedia, the free encyclopedia

In mathematics, a matrix group is a group where each element is a matrix, and the binary operation is given by matrix multiplication.

The set MR(n,n) of n × n matrices over a commutative ring R is itself a ring under matrix addition and multiplication. The group of units of MR(n,n) is called the general linear group of n × n matrices over the ring R and is denoted GLn(R) or GL(n,R). All matrix groups are subgroups of some general linear group.

Contents

[edit] Classical groups

Some particularly interesting matrix groups are the so-called classical groups. When the underlying ring of the matrix group is the real numbers, these matrix groups define Lie groups. When the underlying ring is a finite field the matrix groups define groups of Lie type. These groups play an important role in the classification of finite simple groups. Many linear groups have a "special" subgroup, usually consisting of the elements of determinant 1 (though for orthogonal groups in characteristic 2 it consists of the elements of Dickson invariant 0), and most of them have associated "projective" quotients, which are the quotients by the center of the group. The word "general" in front of a group name usually means that the group is allowed to multiply some sort of form by a constant, rather than leaving it fixed.

The subscript n usually indicates the dimension of the module on which the group is acting.

[edit] Finite groups as matrix groups

Every finite group is isomorphic to some matrix group. This is similar to Cayley's theorem which states that every finite group is isomorphic to some permutation group. Since the isomorphism property is transitive one need only consider how to form a matrix group from a permutation group.

Let G be a permutation group on n points (Ω = {1,2,…,n}) and let {g1,...,gk} be a generating set for G. The general linear group GLn(ℂ) of n×n matrices over the complex numbers acts naturally on the vector space ℂn. Let B={b1,…,bn} be the standard basis for ℂn. For each gi let Mi in GLn(ℂ) be the matrix which sends each bj to bgi(j). That is, if the permutation gi sends the point j to k then Mi sends the basis vector bj to bk. Let M be the subgroup of GLn(ℂ) generated by {M1,…,Mk}. The action of G on Ω is then precisely the same as the action of M on B. It can be proved that the function taking each gi to Mi extends to an isomorphism and thus every group is isomorphic to a matrix group.

Note that the field (ℂ in the above case) is irrelevant since M contains elements with entries 0 or 1. One can just as easily perform the construction for an arbitrary field since the elements 0 and 1 exist in every field.

As an example, let G=S3, the symmetric group on 3 points. Let g1 = (1,2,3) and g2 = (1,2). Then

M_1 = \begin{bmatrix} 0 & 1 & 0 \\ 0 & 0 & 1 \\ 1 & 0 & 0 \end{bmatrix}
M_2 = \begin{bmatrix} 0 & 1 & 0 \\ 1 & 0 & 0 \\ 0 & 0 & 1 \end{bmatrix}

Notice that M1b1 = b2, M1b2 = b3 and M1b3 = b1. Likewise, M2b1 = b2, M2b2 = b1 and M2b3 = b3.

[edit] Representation theory and character theory

Linear transformations and matrices are (generally speaking) well-understood objects in mathematics and have been used extensively in the study of groups. In particular representation theory studies homomorphisms from a group into a matrix group and character theory studies homomorphisms from a group into a field given by the trace of a representation.

[edit] Examples

[edit] References