Prove that finite and infinite presentations of Thompson group $F$ are isomorphic.












4












$begingroup$


Let $$
G=langle x_0,x_1,dotsmid x_jx_i=x_ix_{j+1}text{ for }i<jrangle,
$$

$$
H=langle a,bmid [ab^{-1},a^{-1}ba],[ab^{-1},a^{-2}ba^2]rangle,
$$

where $[x,y]$ is commutator.



These are both presentations of Thompson group $F$ and I want to show that they are indeed isomorphic. I can prove that $phi:Hto G$ when $phi(a)=x_0$ and $phi(b)=x_1$ is homomorphism. I define inverse as



$$psi(x_0)=a,psi(x_1)=b,psi(x_n)=a^{1-n}ba^{n-1}.$$



And here I have problem.



It is easy to show that it works for $i=0$. Having that we can always assume that $i=1$, so all we need is to check that homomorphism works for all $j$.



It is easy to check that it works for $j=2,3$ because $$psi(x_1^{-1})psi(x_j)psi(x_1)(psi(x_{j+1}))^{-1}$$ is one of the relators of $H$.




But I do not know how to work out induction for any larger $j$.




I would be thankful for help or recommending some source where it is proved.










share|cite|improve this question











$endgroup$








  • 1




    $begingroup$
    The presentations are not really isomorphic, rather they define isomorphic groups.
    $endgroup$
    – YCor
    May 1 '18 at 17:38






  • 1




    $begingroup$
    This honours thesis has a moderately detailed proof in Section 2.1, although it has a few typos.
    $endgroup$
    – Derek Holt
    May 2 '18 at 9:22
















4












$begingroup$


Let $$
G=langle x_0,x_1,dotsmid x_jx_i=x_ix_{j+1}text{ for }i<jrangle,
$$

$$
H=langle a,bmid [ab^{-1},a^{-1}ba],[ab^{-1},a^{-2}ba^2]rangle,
$$

where $[x,y]$ is commutator.



These are both presentations of Thompson group $F$ and I want to show that they are indeed isomorphic. I can prove that $phi:Hto G$ when $phi(a)=x_0$ and $phi(b)=x_1$ is homomorphism. I define inverse as



$$psi(x_0)=a,psi(x_1)=b,psi(x_n)=a^{1-n}ba^{n-1}.$$



And here I have problem.



It is easy to show that it works for $i=0$. Having that we can always assume that $i=1$, so all we need is to check that homomorphism works for all $j$.



It is easy to check that it works for $j=2,3$ because $$psi(x_1^{-1})psi(x_j)psi(x_1)(psi(x_{j+1}))^{-1}$$ is one of the relators of $H$.




But I do not know how to work out induction for any larger $j$.




I would be thankful for help or recommending some source where it is proved.










share|cite|improve this question











$endgroup$








  • 1




    $begingroup$
    The presentations are not really isomorphic, rather they define isomorphic groups.
    $endgroup$
    – YCor
    May 1 '18 at 17:38






  • 1




    $begingroup$
    This honours thesis has a moderately detailed proof in Section 2.1, although it has a few typos.
    $endgroup$
    – Derek Holt
    May 2 '18 at 9:22














4












4








4


1



$begingroup$


Let $$
G=langle x_0,x_1,dotsmid x_jx_i=x_ix_{j+1}text{ for }i<jrangle,
$$

$$
H=langle a,bmid [ab^{-1},a^{-1}ba],[ab^{-1},a^{-2}ba^2]rangle,
$$

where $[x,y]$ is commutator.



These are both presentations of Thompson group $F$ and I want to show that they are indeed isomorphic. I can prove that $phi:Hto G$ when $phi(a)=x_0$ and $phi(b)=x_1$ is homomorphism. I define inverse as



$$psi(x_0)=a,psi(x_1)=b,psi(x_n)=a^{1-n}ba^{n-1}.$$



And here I have problem.



It is easy to show that it works for $i=0$. Having that we can always assume that $i=1$, so all we need is to check that homomorphism works for all $j$.



It is easy to check that it works for $j=2,3$ because $$psi(x_1^{-1})psi(x_j)psi(x_1)(psi(x_{j+1}))^{-1}$$ is one of the relators of $H$.




But I do not know how to work out induction for any larger $j$.




I would be thankful for help or recommending some source where it is proved.










share|cite|improve this question











$endgroup$




Let $$
G=langle x_0,x_1,dotsmid x_jx_i=x_ix_{j+1}text{ for }i<jrangle,
$$

$$
H=langle a,bmid [ab^{-1},a^{-1}ba],[ab^{-1},a^{-2}ba^2]rangle,
$$

where $[x,y]$ is commutator.



These are both presentations of Thompson group $F$ and I want to show that they are indeed isomorphic. I can prove that $phi:Hto G$ when $phi(a)=x_0$ and $phi(b)=x_1$ is homomorphism. I define inverse as



$$psi(x_0)=a,psi(x_1)=b,psi(x_n)=a^{1-n}ba^{n-1}.$$



And here I have problem.



It is easy to show that it works for $i=0$. Having that we can always assume that $i=1$, so all we need is to check that homomorphism works for all $j$.



It is easy to check that it works for $j=2,3$ because $$psi(x_1^{-1})psi(x_j)psi(x_1)(psi(x_{j+1}))^{-1}$$ is one of the relators of $H$.




But I do not know how to work out induction for any larger $j$.




I would be thankful for help or recommending some source where it is proved.







group-theory group-isomorphism group-presentation combinatorial-group-theory






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited Dec 3 '18 at 0:48









Shaun

8,893113681




8,893113681










asked May 1 '18 at 16:40









SekstusEmpirykSekstusEmpiryk

1,176416




1,176416








  • 1




    $begingroup$
    The presentations are not really isomorphic, rather they define isomorphic groups.
    $endgroup$
    – YCor
    May 1 '18 at 17:38






  • 1




    $begingroup$
    This honours thesis has a moderately detailed proof in Section 2.1, although it has a few typos.
    $endgroup$
    – Derek Holt
    May 2 '18 at 9:22














  • 1




    $begingroup$
    The presentations are not really isomorphic, rather they define isomorphic groups.
    $endgroup$
    – YCor
    May 1 '18 at 17:38






  • 1




    $begingroup$
    This honours thesis has a moderately detailed proof in Section 2.1, although it has a few typos.
    $endgroup$
    – Derek Holt
    May 2 '18 at 9:22








1




1




$begingroup$
The presentations are not really isomorphic, rather they define isomorphic groups.
$endgroup$
– YCor
May 1 '18 at 17:38




$begingroup$
The presentations are not really isomorphic, rather they define isomorphic groups.
$endgroup$
– YCor
May 1 '18 at 17:38




1




1




$begingroup$
This honours thesis has a moderately detailed proof in Section 2.1, although it has a few typos.
$endgroup$
– Derek Holt
May 2 '18 at 9:22




$begingroup$
This honours thesis has a moderately detailed proof in Section 2.1, although it has a few typos.
$endgroup$
– Derek Holt
May 2 '18 at 9:22










0






active

oldest

votes











Your Answer





StackExchange.ifUsing("editor", function () {
return StackExchange.using("mathjaxEditing", function () {
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
});
});
}, "mathjax-editing");

StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "69"
};
initTagRenderer("".split(" "), "".split(" "), channelOptions);

StackExchange.using("externalEditor", function() {
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled) {
StackExchange.using("snippets", function() {
createEditor();
});
}
else {
createEditor();
}
});

function createEditor() {
StackExchange.prepareEditor({
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: true,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
bindNavPrevention: true,
postfix: "",
imageUploader: {
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
},
noCode: true, onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
});


}
});














draft saved

draft discarded


















StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f2762096%2fprove-that-finite-and-infinite-presentations-of-thompson-group-f-are-isomorphi%23new-answer', 'question_page');
}
);

Post as a guest















Required, but never shown

























0






active

oldest

votes








0






active

oldest

votes









active

oldest

votes






active

oldest

votes
















draft saved

draft discarded




















































Thanks for contributing an answer to Mathematics Stack Exchange!


  • Please be sure to answer the question. Provide details and share your research!

But avoid



  • Asking for help, clarification, or responding to other answers.

  • Making statements based on opinion; back them up with references or personal experience.


Use MathJax to format equations. MathJax reference.


To learn more, see our tips on writing great answers.




draft saved


draft discarded














StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f2762096%2fprove-that-finite-and-infinite-presentations-of-thompson-group-f-are-isomorphi%23new-answer', 'question_page');
}
);

Post as a guest















Required, but never shown





















































Required, but never shown














Required, but never shown












Required, but never shown







Required, but never shown

































Required, but never shown














Required, but never shown












Required, but never shown







Required, but never shown







Popular posts from this blog

Quarter-circle Tiles

build a pushdown automaton that recognizes the reverse language of a given pushdown automaton?

Mont Emei