Linear representation

From Groupprops
Revision as of 06:36, 6 September 2007 by Vipul (talk | contribs)

This article describes a notion of representation, or a group action on a certain kind of object.
View a complete list of types of representations


This article gives a basic definition in the following area: linear representation theory
View other basic definitions in linear representation theory |View terms related to linear representation theory |View facts related to linear representation theory

Definition

Definition with symbols

Let G be a group and k be a field. A linear representation of G over k is a homomorphism ρ:GGL(V) where V is a vector space over k and GL(V) denotes the general linear group of V, viz the group of automorphisms of V as a k-vector space.

Equivalently, a linear representation is a group action G×VV such that the permutation of V induced by any element of G is a linear map.

A representation is typically specified by giving the pair (V,ρ) where V is the vector space and ρ is the homomorphism.

Constructs

Direct sum

Let (V1,ρ1) and (V2,ρ2) be two representations of a group G. Then the direct sum of these is defined as follows:

  • The vector space for it is V1V2
  • The action is: g.(v1v2)=g.v1g.v2.

In other words, it acts on each vector space separately.

Tensor product

Let (V1,ρ1) and (V2,ρ2) be two representations of a group G. The tensor product of these is defined as follows:

  • The vector space for it is V1V2
  • The action is such that g.(v1v2)=g.v1g.v2

Dual space

PLACEHOLDER FOR INFORMATION TO BE FILLED IN: [SHOW MORE]

Particular cases

Equivalence of representations

Two representations (V1,ρ1) and (V2,ρ2) of a group G are said to be equivalent representations if there is an isomorphism σ:V1V2 such that ρ2(g)=σρ1(g)σ1.

When V1=V2=V, this is equivalent to demanding that there exists a σGL(V) such that ρ2(g)=σρ1(g)σ1, in other words, that ρ1 and ρ2 differ by an inner automorphism of V.

There are also further (weaker) notions of equivalence of representations. Further information: Conjugacy class-representation duality

Finite-dimensional representations

A representation is termed finite-dimensional if the vector space is finite-dimensional. When the vector space is finite-dimensional, we can choose a basis for the vector space and hence write the image of every element of G as a matrix in that basis.

There are some properties of automorphisms of linear transformations over finite-dimensional vector spaces that are easily computed from the matrix, but are in fact independent of the choice of basis. The most important among these are the coefficients of the characteristic polynomial. In particular, there is a notion of trace (which is the sum of the diagonal entries) and the determinant.

Trace leads to the notion of character of a representation. Given a representation (V,ρ) where V is a finite-dimensional vector space, the character of ρ, denoted as χρ is defined as the map from G to k that sends gG to Trace(ρ(g)). The character is a special kind of class function (a class function being a function on the group that takes the same value within every conjugacy class).

Invariant subspaces and irreducible representations

Given a representation (V,ρ) of a group G, an invariant subspace is a subspace WV such that ρ(g) takes W to W for every gG.

A representation is termed irreducible if it has no proper nontrivial invariant subspace (that is, the only invariant subspace is the zero subspace or the whole space).

A representation is termed completely reducible if it is expressible as a direct sum of irreducible representations.

Decomposition of representations

A direct sum decomposition of a linear representation is an expression of the linear representation as a direct sum of linear representations. A linear representation is said to be direct sum-indecomposable if for any direct sum decomposition of the representation, one of the summands is the zero-dimensional representation.

Note that any irreducible representation is direct sum-indecomposable, but the converse may not be true. In fact, the converse is true provided that every representation is completely reducible.