Semi-Simple

Example. For any algebra , is the opposite algebra of , where . Let , then . Define . It follows that .

Definition

An algebra is called semi-simple if .

Theorem

Let be a finite-dimensional associative algebra. Then the followings are equivalent:

  • is semi-simple.
  • , where are all pairwise non-isomorphic irreducible -modules.
  • Any finite dimensional representation of is completely reducible, that is, the representation is a direct sum of irreducible representation.
  • is completely reducible as a -module.

\begin{proof}

(i)>(ii). Note that is semi-simple iff by ^b8akty iff by .

(i)(iii). Note that .

(iii)(i). Any representation is a direct sum of copies of irreducible modules , where is unique for . Thus and so is semi-simple.

(iii)(iv). By ^i6fgf3, any module is direct sum of irreducible. Then we get (iv).

(iv)(v) is trivial.

(v)(iii). Let , where are pairwise non-isomorphic. By Schur lemma, . It follows that and . Take , then satisfies that for any . Since , then is a multiplication by and so . Therefore, and we get (iii). \end{proof}

Remark.

  • and have the same representation. Let be a finite group. Then is semi-simple By ^7b841b, any representation for , or for , is completely reducible .
  • Completely reducible is composable, but not vice versa. See here.

Characters

Definition

For any group representation , its character is mapping .

Remarks.

  • If , then is just scalar .
  • is in fact in (dual group)
  • , so is not a group homomorphism.
  • is the same on conjugacy class of in G.
  • If as -modules, then as .

Definition

Define the vector space of class function on to be the set of functions from to which are constant on conjugacy classes, denoted by . In particular, .

Lemma

Let be a -module. Then .

Example. Consider the permutation representation of . Then . Note that where and . Then and .

Definition

The irreducible characters are characters of irreducible -modules.

Lemma

Suppose that is a linear map with for all . Then .

\begin{proof} For any , we have that and . Therefore, for some . \end{proof}

Theorem

Irreducible characters form a basis of .

\begin{proof} Note that . Since is semi-simple, by ^7b841b, . By ^230d2b, any can be written as

Thus is a set of generators of .

Assume that , where . Note that

and similarly each . Therefore, are linear independent, and so irreducible characters form a basis of . \end{proof}

Corollary

The number of irreducible characters is equal to the number of conjugacy classes of .

\begin{proof} Since , then by ^c62c01 we have that

Now we finish the proof. \end{proof}

Proposition

iff .

\begin{proof} Assume that where are pairwise non-isomorphic irreducible modules and . Then and . Therefore, iff iff . \end{proof}