Algebraic integers
Definition
A complex number is an algebraic integer if and only if is an eigenvalue of some matrix, all of whose entries are integers.
All algebraic intergers form a ring:
Theorem
If and are algebraic integers, then and are also algebraic integers.
\begin{proof}Consider the matrix of the tensor product. We can define an endomorphism of by . Then and are eigenvalues of and respectively.
\end{proof}
Remark that is a sum of roots of unity, and each root of unity is an algebraic integer. So we have the following corollary.
Corollary
is an algebraic integer.
Proposition
If is both a rational number and an algebraic integer, then is an integer.
The degree of every irreducible character divides
It is the most important conclusion of this section.
Theorem
If is an irreducible character of , then divides .
To describe an irreducible character , consider the corresponding irreducible module . Recall is a -map if and . Then by Schur lemma, since irreducible, we know
for some .
Computation of
Suppose that is a representation of . Then yields
where . So . Therefore,
is an algebraic integer
Since , one can say is an eigenvalue of whose entries are algebraic integers and so is an algebraic integer. Since is also an algebraic integer, we know
is an algebraic integer. Since and is a rational number and algebraic integer, is an integer and so divides . Now we finish the proof.
Corollaries
Corollary
No simple group has an irreducible character of degree .
\begin{proof}
Let be a simple group. If for some prime , then all irreducible characters of are of degree . Now we assume that is a non-abelian simple group. Recall that is even, by Cauchy’s theorem there exists such that .
Assume that is an irreducible character of degree 2 and its corresponding representation is . Then
Since , has no non-trivial linear character and so . For any non-trivial irreducible representation , and so is faithful. Hence and so . However, as , is impossible.
\end{proof}
Corollary
Suppose that is a prime and the degree of every irreducible character of is a power of . Then has an abelian normal -complement , whose order is coprime to and is a power of .
\begin{proof}
See here. Use induction and ^a33a1v.
\end{proof}
Properties of for general element of group
A condition which ensures is an integer
In number theory, we know for a -th root of unity, is an algebraic integer. By this conclusion, we get the following theorem:
Theorem
Let be an element of order in . Suppose that is conjugate to for all with and . Then is an integer for all characters of .
Corollary
All the character values of symmetric groups are integers.
The -part of group elements
By Bézout Lemma, we can prove the following lemma:
Lemma
Let be a prime number and let . Then there exist such that
- the order of is a power of
- the order of is coprime to
Moreover, both and are unique. We call the -part of .
Consider and . Let be the maximal ideal of containing , then is also a prime ideal of and . Thus, we can get the following conclusions:
Theorem
Let and let be the -part of . If is any character of , then
\begin{proof}
Suppose that order of is and for some . Let . By freshman’s dream we can prove . Then
Now we finish the proof.
\end{proof}
Remarks.
- If and are both integers, then .
- If and , then .