MathOverflow is a question and answer site for professional mathematicians. Join them; it only takes a minute:

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

This is not my area of research, but I am curious. Let $G=\left< X|R \right>$ be a finitely presented group, where $X$ and $R$ are finite. There are many questions which are undecidable for all such $G$, for example whether $G$ is trivial or whether a particular word is trivial in $G$. Is there any non-trivial question (by trivial I mean that the answer is always yes or always no) which is decidable? For instance, is there a class $S$ (non-empty and not equal to all the finitely presented groups) such you can always decide whether $G$ is in this class?

share|cite|improve this question
You might like to look at the answers to this question, and the question it refers to:… . – HJRW Mar 31 '11 at 9:06
Thanks. If a question is interesting, then it will come back. – Yiftach Barnea Mar 31 '11 at 9:44
There is active research going on about whether such problems are decidable if we assume the word problem has a solution. For instance, determining whether a group is a 3-manifold group is decidable, given a presentation and a solution to the word problem. – JeremyKun Oct 18 '11 at 2:20
up vote 16 down vote accepted

The problem whether $G$ is perfect, that is $G=[G,G]$ is decidable because you need to abelianize all relations and solve a system of linear equations over $\mathbb Z$.

share|cite|improve this answer
Nice answer! Thanks. – Yiftach Barnea Mar 31 '11 at 9:04

Many of the undecidable properties of finitely presented groups are verifiable i.e. if they are true, then they can be proved true. Such properities include trivial, finite, abelian, nilpotent, free, automatic, hyperbolic, isomorphic to some other specified finitely presented group.

As a follow-up question, are there any properties of finitely presented groups that are known to be neither verifiable nor for there negation to be verifiable? Might solvability be such a property?

share|cite|improve this answer
@Derek: It is not clear even if solvability of class 2 is verifiable. Right? Same for unsolvability of class 2. Residual finiteness and its negation should be non-verifiable, but it is not obvious either. – Mark Sapir Mar 31 '11 at 10:00
@Derek - You could ask that as a separate question. – Sam Nead Mar 31 '11 at 10:02

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.