Cyclic group of permutations. f_n(x) = x + n

**Problem Statement:**

For each integer , define by

Let

Prove that is cyclic. (Indicate a generator of ).

**Attempt at a solution (brainstorming of where to begin):**

I know that all subsets of can be generated by 1 under modulo addition (except, zero, right?). Also, I believe it is true that the can be generated by under modulo additon (I think I read that on the internet somewhere, so it must be true).

My inclanation is to go the modulo addition route. However, I'm getting hung up on the . If is some arbitrary element, then could very well be irrational, correct? In which case, does modulo addition even work with non-integers? When considering , do I take to be a fixed element?

Is this one one those cases where I'm going to have to make some assumptions about in my proof? For example say something like "Suppose ..."

Or maybe I don't even need to go the modulo addition route at all? Should I be working a different angle?

Any hints on where to start on this, would be awesome!

Thanks!

Re: Cyclic group of permutations. f_n(x) = x + n

Quote:

Originally Posted by

**pirateboy** **Problem Statement:**
For each integer

, define

by

Let

Prove that

is cyclic. (Indicate a generator of

).

My goodness, you left out a great deal of information.

What is the domain of each function

You told us about the *set* part of the group:

BUT NOT anything about the operation defined on that set.

What is the operation?

**Have you even shown that this pair does forms a group?**

Re: Cyclic group of permutations. f_n(x) = x + n

I believe it does not matter what the domain of fn is.

Let's start with the group G.

What is its operation?

What do you get if you combine 2 of its elements? For instance f1 and f1?

Re: Cyclic group of permutations. f_n(x) = x + n

Quote:

Originally Posted by

**ILikeSerena** I believe it does not matter what the domain of fn is.

On the contrary. Surely we are meant to assume that the domain each function has the same domain. But if that is not the case, then the group operation becomes problematic. So domain should be stated.

Re: Cyclic group of permutations. f_n(x) = x + n

Quote:

Originally Posted by

**Plato** On the contrary. Surely we are meant to assume that the domain each function has the same domain. But if that is not the case, then the group operation becomes problematic. So domain should be stated.

The problem statement implies that G is a group (it would have been nice if that was explicit).

Therefore the operation is meaningful.

Therefore each fn has the same domain, which could be anything, as long as its domain supports addition with an integer, after which we have to get the same set.

Either way, these details are not really relevant for the problem at hand.

We can just assume everything is in order and work from there.

Re: Cyclic group of permutations. f_n(x) = x + n

Ah! Sorry! I gave as much information as the book gave! If your curious, the question comes from Charles C. Pinter's "A Book of Abstract Algebra". ...more like "A Book of Abstract Problem Statements"

Anyways, some of the other questions of the section are:

For each integer , define by .

* Prove: For each integer is a permutation of , that is

* Let Prove that is a subgroup of

Soo...from context, I'd assume that the domain is .

Re: Cyclic group of permutations. f_n(x) = x + n

Quote:

Originally Posted by

**pirateboy** Soo...from context, I'd assume that the domain is

.

That seems to be a reasonable assumption. ;)

Actually, to be really proper, the introduction of the book or chapter should state that all functions should be assumed to have domain .

So... any answer to our questions?

Re: Cyclic group of permutations. f_n(x) = x + n

Hmm, well if i combine and I'd get where is some arbitrary operation.

Now I can think of a few operations that would make a group. Addition is one, the identity being 0. In which case, -x would also have to be in the group if x is not an integer.

Multipication would be another one, right? G then have to contain .

But neither of these are cyclic, are they? I don't know that I'm answering the questions.

If the operation were multiplication, would give ...well, I'd have to assume G was abelian for that, though, right?

Re: Cyclic group of permutations. f_n(x) = x + n

How about... function composition?

What is f_{1}(f_{1}(x))?

Re: Cyclic group of permutations. f_n(x) = x + n

oh, wait, do you mean ? That'd be

Re: Cyclic group of permutations. f_n(x) = x + n

Re: Cyclic group of permutations. f_n(x) = x + n

Quote:

Originally Posted by

**pirateboy** Ah! Sorry! I gave as much information as the book gave! If your curious, the question comes from Charles C. Pinter's "A Book of Abstract Algebra". ...more like "A Book of Abstract Problem Statements"

Anyways, some of the other questions of the section are:

For each integer

, define

by

.

* Prove: For each integer

is a permutation of

, that is

* Let

Prove that

is a subgroup of

Soo...from context, I'd assume that the domain is

.

Thank you for answering. I knew Pinter through his work in set theory and logic.

I did not know that he did an algebra text. Frankly, I do not find those examples useful. I hope that someone here has a copy of that textbook.

If I were to guess, I would say that " is a permutation of " means to shift "x to x+n".

So the operation is function composition.

Thus [**That is a guess**]

**What is the identity of this group?**

Then what is .

Can you guess a generator?

Re: Cyclic group of permutations. f_n(x) = x + n

Then consider the inverses?

so

(e is the identity).

Also associative and abelian, since the operation is addition.

Is that it, then? G is cyclic and f_n is the generator?

Re: Cyclic group of permutations. f_n(x) = x + n

I suspect you intended f_{n} and f_{m} to be associative and abelian instead of f_{n} and f_{-n}?

Then yes. Those first parts sound correct!

But... suppose f_n is the generator.

Which elements can you generate then?

Btw, if I start nitpicking, you should really say something like:

Therefore

Note that you either compose functions without their argument, or you should mention the argument consistently.

Re: Cyclic group of permutations. f_n(x) = x + n

Side note: the book is actually quite inexpensive. $11 new on amazon (paperback).