Irreducible representation

From Wikipedia, the free encyclopedia
(Redirected from Reducible representation)
Jump to navigation Jump to search

Template:Short description Template:Group theory sidebarTemplate:Use American English

In mathematics, specifically in the representation theory of groups and algebras, an irreducible representation (ρ,V) or irrep of an algebraic structure A is a nonzero representation that has no proper nontrivial subrepresentation (ρ|W,W), with WV closed under the action of {ρ(a):aA}.

Every finite-dimensional unitary representation on a Hilbert space V is the direct sum of irreducible representations. Irreducible representations are always indecomposable (i.e. cannot be decomposed further into a direct sum of representations), but the converse may not hold, e.g. the two-dimensional representation of the real numbers acting by upper triangular unipotent matrices is indecomposable but reducible.

History

Group representation theory was generalized by Richard Brauer from the 1940s to give modular representation theory, in which the matrix operators act on a vector space over a field K of arbitrary characteristic, rather than a vector space over the field of real numbers or over the field of complex numbers. The structure analogous to an irreducible representation in the resulting theory is a simple module.Script error: No such module "Unsubst".

Overview

Script error: No such module "labelled list hatnote".

Let ρ be a representation i.e. a homomorphism ρ:GGL(V) of a group G where V is a vector space over a field F. If we pick a basis B for V, ρ can be thought of as a function (a homomorphism) from a group into a set of invertible matrices and in this context is called a matrix representation. However, it simplifies things greatly if we think of the space V without a basis. ρ is d-dimensional if the vector space V it acts over has dimension d.

A linear subspace WV is called G-invariant if ρ(g)wW for all gG and all wW. The co-restriction of ρ to the general linear group of a G-invariant subspace WV is known as a subrepresentation. A representation ρ:GGL(V) is said to be irreducible if it has only trivial subrepresentations (all representations can form a subrepresentation with the trivial G-invariant subspaces, e.g. the whole vector space V, and {0}). If there is a proper nontrivial invariant subspace, ρ is said to be reducible.

Notation and terminology of group representations

Group elements can be represented by matrices, although the term "represented" has a specific and precise meaning in this context. A representation of a group is a mapping from the group elements to the general linear group of matrices. As notation, let Template:Math denote elements of a group Template:Math with group product signified without any symbol, so Template:Math is the group product of Template:Math and Template:Math and is also an element of Template:Math, and let representations be indicated by Template:Math. The representation of a is written as

D(a)=(D(a)11D(a)12D(a)1nD(a)21D(a)22D(a)2nD(a)n1D(a)n2D(a)nn)

By definition of group representations, the representation of a group product is translated into matrix multiplication of the representations:

D(ab)=D(a)D(b)

If Template:Math is the identity element of the group (so that Template:Math, etc.), then Template:Math is an identity matrix, or identically a block matrix of identity matrices, since we must have

D(ea)=D(ae)=D(a)D(e)=D(e)D(a)=D(a)

and similarly for all other group elements. The last two statements correspond to the requirement that Template:Math is a group homomorphism.

Reducible and irreducible representations

A representation is reducible if it contains a nontrivial G-invariant subspace, that is to say, all the matrices D(a) can be put in upper triangular block form by the same invertible matrix P. In other words, if there is a similarity transformation:

D(a)P1D(a)P,

which maps every matrix in the representation into the same pattern upper triangular blocks. Every ordered sequence minor block is a group subrepresentation. That is to say, if the representation is, for example, of dimension 2, then we have: D(a)=P1D(a)P=(D(11)(a)D(12)(a)0D(22)(a)),

where D(11)(a) is a nontrivial subrepresentation. If we are able to find a matrix P that makes D(12)(a)=0 as well, then D(a) is not only reducible but also decomposable.

Notice: Even if a representation is reducible, its matrix representation may still not be the upper triangular block form. It will only have this form if we choose a suitable basis, which can be obtained by applying the matrix P1 above to the standard basis.

Decomposable and indecomposable representations

A representation is decomposable if all the matrices D(a) can be put in block-diagonal form by the same invertible matrix P. In other words, if there is a similarity transformation:[1]

D(a)P1D(a)P,

which diagonalizes every matrix in the representation into the same pattern of diagonal blocks. Each such block is then a group subrepresentation independent from the others. The representations Template:Math and Template:Math are said to be equivalent representations.[2] The (k-dimensional, say) representation can be decomposed into a [[direct sum of matrices|direct sum of Template:Math matrices]]:

D(a)=P1D(a)P=(D(1)(a)000D(2)(a)000D(k)(a))=D(1)(a)D(2)(a)D(k)(a),

so Template:Math is decomposable, and it is customary to label the decomposed matrices by a superscript in brackets, as in Template:Math for Template:Math, although some authors just write the numerical label without parentheses.

The dimension of Template:Math is the sum of the dimensions of the blocks:

dim[D(a)]=dim[D(1)(a)]+dim[D(2)(a)]++dim[D(k)(a)].

If this is not possible, i.e. Template:Math, then the representation is indecomposable.[1][3]

Notice: Even if a representation is decomposable, its matrix representation may not be the diagonal block form. It will only have this form if we choose a suitable basis, which can be obtained by applying the matrix P1 above to the standard basis.

Connection between irreducible representation and indecomposable representation

An irreducible representation is by nature an indecomposable one. However, the converse may fail.

But under some conditions, we do have an indecomposable representation being an irreducible representation.

  • When group G is finite, and it has a representation over field , then an indecomposable representation is an irreducible representation.[4]
  • When group G is finite, and it has a representation over field K, if we have char(K)|G|, then an indecomposable representation is an irreducible representation.

Examples of irreducible representations

Trivial representation

All groups G have a zero-dimensional, irreducible trivial representation by mapping all group elements to the identity transformation.

One-dimensional representation

Any one-dimensional representation is irreducible since it has no proper nontrivial invariant subspaces.

Irreducible complex representations

The irreducible complex representations of a finite group G can be characterized using results from character theory. In particular, all complex representations decompose as a direct sum of irreps, and the number of irreps of G is equal to the number of conjugacy classes of G.[5]

  • The irreducible complex representations of /n are exactly given by the maps 1γ, where γ is an nth root of unity.
  • Let V be an n-dimensional complex representation of Sn with basis {vi}i=1n. Then V decomposes as a direct sum of the irreps Vtriv=(i=1nvi) and the orthogonal subspace given by Vstd={i=1naivi:ai,i=1nai=0}. The former irrep is one-dimensional and isomorphic to the trivial representation of Sn. The latter is n1 dimensional and is known as the standard representation of Sn.[5]
  • Let G be a group. The regular representation of G is the free complex vector space on the basis {eg}gG with the group action geg=egg, denoted G. All irreducible representations of G appear in the decomposition of G as a direct sum of irreps.

Example of an irreducible representation over Template:Math

  • Let G be a p group and V=𝔽pn be a finite dimensional irreducible representation of G over 𝔽p. By Orbit-stabilizer theorem, the orbit of every V element acted by the p group G has size being power of p. Since the sizes of all these orbits sum up to the size of G, and 0V is in a size 1 orbit only containing itself, there must be other orbits of size 1 for the sum to match. That is, there exists some vV such that gv=v for all gG. This forces every irreducible representation of a p group over 𝔽p to be one dimensional.

Applications in theoretical physics and chemistry

Script error: No such module "Labelled list hatnote".

In quantum physics and quantum chemistry, each set of degenerate eigenstates of the Hamiltonian operator comprises a vector space Template:Mvar for a representation of the symmetry group of the Hamiltonian, a "multiplet", best studied through reduction to its irreducible parts. Identifying the irreducible representations therefore allows one to label the states, predict how they will split under perturbations; or transition to other states in Template:Mvar. Thus, in quantum mechanics, irreducible representations of the symmetry group of the system partially or completely label the energy levels of the system, allowing the selection rules to be determined.[6]

Lie groups

Script error: No such module "Labelled list hatnote".

Lorentz group

Script error: No such module "Labelled list hatnote".

The irreps of Template:Math and Template:Math, where Template:Math is the generator of rotations and Template:Math the generator of boosts, can be used to build to spin representations of the Lorentz group, because they are related to the spin matrices of quantum mechanics. This allows them to derive relativistic wave equations.[7]

See also

Associative algebras

Lie groups

References

Template:Reflist

Books

  • Script error: No such module "citation/CS1".
  • Script error: No such module "citation/CS1".[1]
  • Script error: No such module "citation/CS1".
  • Script error: No such module "citation/CS1".
  • Script error: No such module "citation/CS1".
  • Script error: No such module "citation/CS1".
  • Script error: No such module "citation/CS1".
  • Script error: No such module "citation/CS1".
  • Script error: No such module "citation/CS1".
  • Script error: No such module "citation/CS1".
  • Script error: No such module "citation/CS1".
  • Script error: No such module "citation/CS1".

Articles

  • Script error: No such module "Citation/CS1".
  • Script error: No such module "Citation/CS1".

Further reading

  • Script error: No such module "citation/CS1".

External links

  • Script error: No such module "citation/CS1".
  • Script error: No such module "citation/CS1".
  • Script error: No such module "citation/CS1".
  • Script error: No such module "citation/CS1".
  • Script error: No such module "citation/CS1".
  • Script error: No such module "citation/CS1".
  • Script error: No such module "citation/CS1".
  • Script error: No such module "citation/CS1"., see chapter 40
  • Script error: No such module "citation/CS1".
  • Script error: No such module "citation/CS1".
  • Script error: No such module "citation/CS1".
  • Script error: No such module "citation/CS1".
  1. a b Script error: No such module "citation/CS1".
  2. Script error: No such module "citation/CS1".
  3. Script error: No such module "citation/CS1".
  4. Script error: No such module "citation/CS1".
  5. a b Script error: No such module "citation/CS1".
  6. Script error: No such module "citation/CS1".
  7. Script error: No such module "Citation/CS1".