- #1
zooxanthellae
- 157
- 1
Homework Statement
For each integer n, define [tex]f_{n}[/tex] by [tex]f_{n}(x) = x + n.[/tex] Let [tex]G = {f_{n} : n \in \mathbb{Z}}.[/tex] Prove that G is cyclic, and indicate a generator of G.
Homework Equations
None as far as I can tell.
The Attempt at a Solution
Doesn't this require us to find one element of [tex]G[/tex] such that, by applying that element over and over again e.g. [tex]f_n(f_n(...)[/tex] we can produce any element of G? My main problem with this is I don't understand how one could find a way to go from positive to negative elements or vice-versa. For example if we let the generator be [tex]f(x) = x + 1[/tex] how could we generate [tex]f_{-1}(x) = x - 1?[/tex] Or do I misinterpret the definition of G/requirements of a cyclic group?