Lemma 9.13.1. Let $L$ be a field. Let $G$ be a monoid, for example a group. Let $\chi _1, \ldots , \chi _ n : G \to L$ be pairwise distinct homomorphisms of monoids where $L$ is regarded as a monoid by multiplication. Then $\chi _1, \ldots , \chi _ n$ are $L$-linearly independent: if $\lambda _1, \ldots , \lambda _ n \in L$ not all zero, then $\sum \lambda _ i\chi _ i(g) \not= 0$ for some $g \in G$.
Proof. If $n = 1$ this is true because $\chi _1(e) = 1$ if $e \in G$ is the neutral (identity) element. We prove the result by induction for $n > 1$. Suppose that $\lambda _1, \ldots , \lambda _ n \in L$ not all zero. If $\lambda _ i = 0$ for some, then we win by induction on $n$. Since we want to show that $\sum \lambda _ i\sigma _ i(g) \not= 0$ for some $g \in G$ we may after dividing by $-\lambda _ n$ assume that $\lambda _ n = -1$. Then the only way we get in trouble is if
for all $g \in G$. Fix $h \in G$. Then we would also get
Multiplying the previous relation by $\chi _ n(h)$ and substracting we obtain
for all $g \in G$. Since $\lambda _ i \not= 0$ we conclude that $\chi _ n(h) = \chi _ i(h)$ for all $i$ by induction. The choice of $h$ above was arbitrary, so we conclude that $\chi _ i = \chi _ n$ for $i \leq n - 1$ which contradicts the assumption that our characters $\chi _ i$ are pairwise distinct. $\square$
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).
All contributions are licensed under the GNU Free Documentation License.