Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

Why group of computable permutations of natural numbers is not finitely generated?

It is obvious for all permutations but why it is also true for computable permutations?

share|cite|improve this question

If $\{\pi_1,\pi_2,\dots,\pi_n\}$ is a finite set of computable permutations of $\mathbb N$, then the group $G=\langle\pi_1,\pi_2,\dots,\pi_n\rangle$ that they generate is recursively enumerable. Then it's a straightforward diagonalization to construct a computable permutation $\alpha$ (an involution, say) which is not in $G$. At each stage of the construction, you look at the first natural $x$ for which $\alpha(x)$ has not yet been defined, and the first permutation $\gamma\in G$ which has not yet been "spoiled", and you extend $\alpha$ so that $\alpha(x)\ne\gamma(x)$.

share|cite|improve this answer

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.