Prove that for all .
First we prove a lemma.
Lemma: Let . If is not the identity, then there exists such that . Proof: Since , there exist such that . Since , there exists an element distinct from and . Let . Note that while . Hence .
Thus, if is not the identity, . Hence .
Advertisements