6
$\begingroup$

Let $G$ be an infinite group, and $\phi$ an automorphism of it. Let $N$ be a normal subgroup of $G$ such that $G/N$ is finite. Is it true that for any $h$ in $G$, $\phi^n(h)N$ (as a sequence of elements in $G/N$ for $n=1,2,3,...$) is periodic?

On the one hand my intuition tells me that it's false, but on the other I can't find any counter-examples.

  • 1
    There's no reason for $\phi$ to descend to an automorphism of $G/N$. $N$ is normal, not nec. characteristic.2011-05-26
  • 1
    whoops! Hmm.2011-05-26
  • 0
    Given Qiaochu's counterexample (which I'm not sure I understand but I take it as an article of faith that he's right), I wonder if the answer is different for finitely generated $G$. Permuting the generators of an infinitely generated group feels like an easy cop-out :-)2011-05-26
  • 0
    I can't upvote your comment, but I would if I could.2011-05-26
  • 0
    @Alon: what is unclear about my counterexample? I would like to clean up the answer if there's anything that needs elaboration.2011-05-26

1 Answers 1

5

This is false. Let

  • $G$ be the direct sum of countably many copies of $\mathbb{Z}/2\mathbb{Z}$ indexed by $\mathbb{Z}$ with generators $e_i, i \in \mathbb{Z}$.
  • $S \subset \mathbb{Z}$ be an infinite set of non-negative integers such that their indicator function $1_S$ is not periodic.
  • $G \to G/N \cong \mathbb{Z}/2\mathbb{Z}$ be the quotient in which the generators $e_s, s \in S$ are identified and the others are killed.
  • $\phi : G \to G$ act by $\phi(e_i) = e_{i+1}$.
  • $h = e_0$.

Then $\phi^i(h) N = 1_S(i)$ is not periodic; in fact it can be arbitrary.

Perhaps some words about the train of thought behind this counterexample might be helpful. First, $\phi$ descends to an automorphism $G/N \to G/N$ if is inner, so if there is a counterexample, then $\phi$ necessarily has infinite order in $\text{Out}(G)$. The easiest way I know to get a large group of outer automorphisms is to take the direct sum or direct product of copies of some abelian group, and the simplest automorphisms of these are the permutations. The simplest permutation of infinite order is an infinite cycle, and after that it wasn't hard to see how to choose $N$.

  • 0
    Sorry, what do you mean by "the factors $e_s$ are identified"? What is $N$?2011-05-26
  • 0
    @Alon: that was left over from an earlier edit; I meant "generators." $N$ is generated by $e_t, t \not \in S$ and $e_s - e_{s'}, s, s' \in S$.2011-05-26
  • 0
    sorry, my bad, for some reason I had the direct *product* in mind and I couldn't understand how an index-2 subgroup can have "infinite support". Cool construction.2011-05-27
  • 0
    @Alon: yes, in an earlier edit I tried using the direct product before I realized that that didn't work and I really only needed the direct sum.2011-05-27