Character Group

In mathematics, a character group is the group of representations of a group by complex-valued functions. These functions can be thought of as one-dimensional matrix representations and so are special cases of the group characters that arise in the related context of character theory. Whenever a group is represented by matrices, the function defined by the trace of the matrices is called a character; however, these traces ''do not'' in general form a group. Some important properties of these one-dimensional characters apply to characters in general:
* Characters are invariant on conjugacy classes.
* The characters of irreducible representations are orthogonal.
The primary importance of the character group for finite abelian groups is in number theory, where it is used to construct Dirichlet characters. The character group of the cyclic group also appears in the theory of the discrete Fourier transform. For locally compact abelian groups, the character group (with an assumption of continuity) is central to Fourier analysis.

Preliminaries

Let $G$ be an abelian group. A function $f: G \to \mathbb\setminus\$ mapping the group to the non-zero complex numbers is called a character of $G$ if it is a group homomorphism from $G$ to $\mathbb C^\times$—that is, if $f(g_1 g_2) = f(g_1)f(g_2)$ for all $g_1, g_2 \in G$.

If $f$ is a character of a finite group $G$, then each function value $f(g)$ is a root of unity, since for each $g \in G$ there exists $k \in \mathbb$ such that $g^ = e$, and hence $f(g)^ = f(g^) = f(e) = 1$.

Each character ''f'' is a constant on conjugacy classes of ''G'', that is, ''f''(''hgh''⁻¹) = ''f''(''g''). For this reason, a character is sometimes called a class function.

A finite abelian group of order ''n'' has exactly ''n'' distinct characters. These are denoted by ''f''₁, ..., ''f''_''n''. The function ''f''₁ is the trivial representation, which is given by $f_1(g) = 1$ for all $g \in G$. It is called the principal character of G; the others are called the non-principal characters.

Definition

If ''G'' is an abelian group, then the set of characters ''f_k'' forms an abelian group under pointwise multiplication. That is, the product of characters $f_j$ and $f_k$ is defined by $(f_j f_k)(g)= f_j(g) f_k(g)$ for all $g \in G$. This group is the character group of G and is sometimes denoted as $\hat$. The identity element of $\hat$ is the principal character ''f''₁, and the inverse of a character ''f_k'' is its reciprocal 1/''f_k''. If $G$ is finite of order ''n'', then $\hat$ is also of order ''n''. In this case, since $, f_k(g), = 1$ for all $g \in G$, the inverse of a character is equal to the complex conjugate.

Alternative definition

There is another definition of character group^{pg 29} which uses $U(1) = \$ as the target instead of just $\mathbb^*$. This is useful while studying complex tori because the character group of the lattice in a complex torus $V/\Lambda$ is canonically isomorphic to the dual torus via the Appell-Humbert theorem. That is,

$\text(\Lambda, U(1)) \cong V^\vee/\Lambda^\vee = X^\vee$

We can express explicit elements in the character group as follows: recall that elements in $U(1)$ can be expressed as

$e^$

for $x \in \mathbb$. If we consider the lattice as a subgroup of the underlying real vector space of $V$, then a homomorphism

$\phi: \Lambda \to U(1)$

can be factored as a map

$\phi : \Lambda \to \mathbb \xrightarrow U(1)$

This follows from elementary properties of homomorphisms. Note that

$\begin \phi(x+y) &= \exp(f(x+y)) \\ &= \phi(x) + \phi(y) \\ &= \exp(2\pi i f(x))\exp(2\pi i f(y)) \end$

giving us the desired factorization. As the group

$\text(\Lambda,\mathbb) \cong \text(\mathbb^,\mathbb)$

we have the isomorphism of the character group, as a group, with the group of homomorphisms of $\mathbb^$ to $\mathbb$. Since $\text(\mathbb,G)\cong G$ for any abelian group $G$, we have

$\text(\mathbb^, \mathbb) \cong \mathbb^$

after composing with the complex exponential, we find that

$\text(\mathbb^, U(1)) \cong \mathbb^/\mathbb^$

which is the expected result.

Examples

Finitely generated abelian groups

Since every finitely generated abelian group is isomorphic to

$G \cong \mathbb^\oplus \bigoplus_^m \mathbb/a_i$

the character group can be easily computed in all finitely generated cases. From universal properties, and the isomorphism between finite products and coproducts, we have the character groups of $G$ is isomorphic to

$\text(\mathbb,\mathbb^*)^\oplus\bigoplus_^k\text(\mathbb/n_i,\mathbb^*)$

for the first case, this is isomorphic to $(\mathbb^*)^$, the second is computed by looking at the maps which send the generator $1 \in \mathbb/n_i$ to the various powers of the $n_i$-th roots of unity $\zeta_ = \exp(2\pi i/n_i)$.

Orthogonality of characters

Consider the $n \times n$ matrix ''A'' = ''A''(''G'') whose matrix elements are $A_ = f_j(g_k)$ where $g_k$ is the ''k''th element of ''G''.

The sum of the entries in the ''j''th row of ''A'' is given by
:$\sum_^n A_ = \sum_^n f_j(g_k) = 0$ if $j \neq 1$, and
:$\sum_^n A_ = n$.

The sum of the entries in the ''k''th column of ''A'' is given by
:$\sum_^n A_ = \sum_^n f_j(g_k) = 0$ if $k \neq 1$, and
:$\sum_^n A_ = \sum_^n f_j(e) = n$.

Let $A^\ast$ denote the conjugate transpose of ''A''. Then
:$AA^\ast = A^\ast A = nI$.
This implies the desired orthogonality relationship for the characters: i.e.,

:$\sum_^n ^* (g_i) f_k (g_j) = n \delta_$ ,
where $\delta_$ is the Kronecker delta and $f^*_k (g_i)$ is the complex conjugate of $f_k (g_i)$.

See also

* Pontryagin duality

References

* See chapter 6 of {{Apostol IANT

Number theory
Group theory
Representation theory of groups