1. Write out a proof of Maschke’s Theorem in the case of representations over along the following lines.
-
Given a representation where is a vector space over , let be any positive definite Hermitian form on . Define a new form on by
-
Show that is a positive definite Hermitian form, preserved under the action of ; that is, always.
-
If is a subrepresentation of , show that as representations.
\begin{proof}
For any , we have
and so is preserved under the action of . Now we check is a positive definite Hermitian form. Firstly, it is easy to verify
because is a Hermitian form on . Also as , and iff for all iff . Furthermore, one can easily check by Hermitian. Therefore, is a positive definite Hermitian form.
Define . Since is positive definite, for any nonzero , and so . It is easy to check is a vector subspace of . Since is a positive definite Hermitian form, there is and so as vector spaces. For any and , we have for all and so . Hence is a subrepresentation of , and then as representations.
\end{proof}
2. Prove the following theorem of Burnside: let be a finite group, an algebraically closed field in which is invertible, and be a representation over . By taking a basis of write each endomorphism as a matrix. Let . Show that the representation is simple if and only if there exist elements of so that the matrices are linearly independent, and that this happens if and only if the algebra homomorphism is surjective. (Note that itself is generally not surjective.)
\begin{proof}
We prove a lemma first.
Lemma
Let be an irreducible finite dimensional representation of algebra , and let be any linearly independent vectors. Then for any there exists an element such that .
Proof of lemma. Assume that . Define where is a set of basis of . Since for all and is a bijection, then and are isomorphic -modules. Let be the corresponding representation. Then is a sub-module of . Since is irreducible, we have that for some . Suppose is an isomorphisms between -modules.
We claim that there exists a matrix such that for all . Now we prove the claim by induction. Consider the map , and it suffices to show for any . When , set with with . By Schur lemma, is a scalar multiple and are not all zero. Suppose with , then
Assume the statement hold for . Write as , where . Consider , by the argument above, there exists such that . Note that there exists such that , so WLOG we can assume . It is easy to check is injective, where is a projective map with . By induction hypothesis, there exists such that , where . Then for any ,
is what we desired, where
determines (the existence of is guaranteed by induction hypothesis). Now we prove the proof of the claim.
Note that there exists a non-zero vector such that . It follows that for any , . Take , then , which contradicts with linearly independent. Thus and so is surjective. For any , there exists such that . Then there is an such that and . Now we finish the proof of the lemma.
\end{proof}
It is clear that are linearly independent iff , i.e. is surjective.
Now we prove that simple iff surjective. Define , which is an algebra. Take any and let be a basis of . Let . Then by ^wha39z, there exists such that . Thus and so is surjective. Conversely, if , then all -submodules of are and so is simple.
\end{proof}
3. Let be a cyclic group of order , and let be a primitive -th root of unity. Then the simple complex characters of are the functions
where .
\begin{proof}
Since is an abelian group, each simple representation over is dimension and so we can assume that all simple complex characters are . Assume that , then yields for some integer . Therefore, set , then we get all simple complex characters, where for .
\end{proof}
4.
- (i) By using characters, show that if and are -modules then we have isomorphisms , and as -modules.
- (ii) If is any field and are -modules, show that there are isomorphisms , and as modules.
\begin{proof}
i) Recall that for a representation , there is . If and are -modules with corresponding representations and , respectively, then
and
Since for matrices . It deduces that values of and are equal, as . Hence .
Assume is the character of , then and for all . Also we can check and , thus as -modules.
ii) Assume and are bases of and , respectively. Then and have bases and , respectively, where . Since is a basis of , we define such that . Define
and we can check is an -bilinear map. Then induces a map , which is an isomorphism between vector spaces. Furthermore, it is easy to verify is a -homomorphism, which yields as -modules.
For -module , it has a set of basis , which are all elements of and . Define such that . Then define
and it is cleat that is an isomorphism as -modules. Therefore, we have as modules.
\end{proof}
5. Let be the non-abelian group of order 21:
Show that has 5 conjugacy classes, and find its character table.
\begin{proof}
We can compute that the conjugacy classes of are
Thus has irreducible characters. By Schur’s orthogonality relations, the character table can be written as
Then we determine values of .
Since is a normal subgroup of and has character table as exercise 3 shows. Recall that
Let be a -module with character , then with the convention that if .
Link to original
then we have
where is the -th root of unity. So the character table is
Now we finish the solution.
\end{proof}
6. Find the character table of the following group of order 36 :
(It follows from these relations that is a normal subgroup of of order 9.)
\begin{proof}
Firstly, we can compute that all conjugacy classes of are
Thus has irreducible representations.
Since and it has irreducible characters , where , and is the -rd root of unity. Thus by ^aizvs9 (which is used in exercise 5), has two characters with , that is,
where is irreducible but is reducible. Since , one can check it only has one solution , . Thus the character table is
Since , . However, if or , there are three distinct irreducible characters of dimension : , and , which is impossible. Hence and so for . Since , now we determine . Then by Schur’s orthogonality relations we get . The character table is as follows.
Now we finish the solution.
\end{proof}
Remark. By magma we can get the character table directly.
G:=Group<a,b,c|a^3,b^3,c^4,(a,b),c*a*c^-1*b^-1,c*b*c^-1*a>;
GroupName(G);
Order(G);
G:=PermutationGroup(G);
NumberOfClasses := #ConjugacyClasses(G);
print "Number of conjugacy classes:", NumberOfClasses;
ConjugacyClasses(G);
CharacterTable(G);