The Stacks project

63.4 Traces

We now explain how to take the trace of an endomorphism of a module over a noncommutative ring. Fix a finite ring $\Lambda $ with cardinality prime to $p$. Typically, $\Lambda $ is the group ring $(\mathbf{Z}/\ell ^ n\mathbf{Z})[G]$ for some finite group $G$. By convention, all the $\Lambda $-modules considered will be left $\Lambda $-modules.

We introduce the following notation: We set $\Lambda ^\natural $ to be the quotient of $\Lambda $ by its additive subgroup generated by the commutators (i.e., the elements of the form $ab-ba$, $a, b \in \Lambda $). Note that $\Lambda ^\natural $ is not a ring.

For instance, the module $(\mathbf{Z}/\ell ^ n\mathbf{Z})[G]^\natural $ is the dual of the class functions, so

\[ (\mathbf{Z}/\ell ^ n\mathbf{Z})[G]^\natural = \bigoplus \nolimits _{\text{conjugacy classes of }G} \mathbf{Z}/\ell ^ n\mathbf{Z}. \]

For a free $\Lambda $-module, we have $\text{End}_\Lambda (\Lambda ^{\oplus m}) = \text{Mat}_ n(\Lambda )$. Note that since the modules are left modules, representation of endomorphism by matrices is a right action: if $a \in \text{End}(\Lambda ^{\oplus m})$ has matrix $A$ and $v \in \Lambda $, then $a(v) = v A$.

Definition 63.4.1. The trace of the endomorphism $a$ is the sum of the diagonal entries of a matrix representing it. This defines an additive map $\text{Tr} : \text{End}_\Lambda (\Lambda ^{\oplus m}) \to \Lambda ^\natural $.

Exercise 63.4.2. Given maps

\[ \Lambda ^{\oplus m} \xrightarrow {a} \Lambda ^{\oplus n} \quad \text{and}\quad \Lambda ^{\oplus n} \xrightarrow {b} \Lambda ^{\oplus m} \]

show that $\text{Tr}(ab) = \text{Tr}(ba)$.

We extend the definition of the trace to a finite projective $\Lambda $-module $P$ and an endomorphism $\varphi $ of $P$ as follows. Write $P$ as the summand of a free $\Lambda $-module, i.e., consider maps $P \xrightarrow {a} \Lambda ^{\oplus n} \xrightarrow {b} P$ with

  1. $\Lambda ^{\oplus n} = \mathop{\mathrm{Im}}(a) \oplus \mathop{\mathrm{Ker}}(b)$; and

  2. $b\circ a = \text{id}_ P$.

Then we set $\text{Tr}(\varphi ) = \text{Tr}(a\varphi b)$. It is easy to check that this is well-defined, using the previous exercise.


Comments (0)


Post a comment

Your email address will not be published. Required fields are marked.

In your comment you can use Markdown and LaTeX style mathematics (enclose it like $\pi$). A preview option is available if you wish to see how it works out (just click on the eye in the toolbar).

Unfortunately JavaScript is disabled in your browser, so the comment preview function will not work.

All contributions are licensed under the GNU Free Documentation License.




In order to prevent bots from posting comments, we would like you to prove that you are human. You can do this by filling in the name of the current tag in the following input field. As a reminder, this is tag 03SZ. Beware of the difference between the letter 'O' and the digit '0'.