Suppose $a, bin G$ such that $lvert arvert$ is odd and $aba^{-1}=b^{-1}$. Show that $b^2=e$.
$begingroup$
I'm reading "Contemporary Abstract Algebra," by Gallian.
This is Exercise 4.30.
Suppose $a$ and $b$ belong to a group, $a$ has odd order, and $aba^{-1}=b^{-1}$. Show that $b^2=e$.
My Attempt:
Let $lvert arvert=2n+1$, $ninBbb Ncup{0}$.
We have $$begin{align}
b&=(b^{-1})^{-1} \
&=(aba^{-1})^{-1} \
&=ab^{-1}a^{-1},
end{align}$$
so, by induction, $b=a(underbrace{aba^{-1}}_{=b^{-1}})a^{-1}=dots =a^{2n}ba^{-2n}$, so that
$$begin{align}
b&=a^{2n}ba^{-2n} \
&=a^{2n}(ab^{-1}a^{-1})a^{-2n} \
&=a^{2n+1}b^{-1}a^{-(2n+1)} \
&=b^{-1},
end{align}$$
so $b=b^{-1}$, i.e., $b^2=e$.$square$
Is the above proof okay? I think it is.
However, I'd be interested to see how properties of Baumslag-Solitar groups could be used here, since $aba^{-1}=b^{-1}$ brings them to mind.
group-theory proof-verification alternative-proof
$endgroup$
add a comment |
$begingroup$
I'm reading "Contemporary Abstract Algebra," by Gallian.
This is Exercise 4.30.
Suppose $a$ and $b$ belong to a group, $a$ has odd order, and $aba^{-1}=b^{-1}$. Show that $b^2=e$.
My Attempt:
Let $lvert arvert=2n+1$, $ninBbb Ncup{0}$.
We have $$begin{align}
b&=(b^{-1})^{-1} \
&=(aba^{-1})^{-1} \
&=ab^{-1}a^{-1},
end{align}$$
so, by induction, $b=a(underbrace{aba^{-1}}_{=b^{-1}})a^{-1}=dots =a^{2n}ba^{-2n}$, so that
$$begin{align}
b&=a^{2n}ba^{-2n} \
&=a^{2n}(ab^{-1}a^{-1})a^{-2n} \
&=a^{2n+1}b^{-1}a^{-(2n+1)} \
&=b^{-1},
end{align}$$
so $b=b^{-1}$, i.e., $b^2=e$.$square$
Is the above proof okay? I think it is.
However, I'd be interested to see how properties of Baumslag-Solitar groups could be used here, since $aba^{-1}=b^{-1}$ brings them to mind.
group-theory proof-verification alternative-proof
$endgroup$
3
$begingroup$
Yes the proof is OK.
$endgroup$
– Derek Holt
Jan 14 at 16:37
2
$begingroup$
Yes it is perfect
$endgroup$
– greedoid
Jan 14 at 16:38
add a comment |
$begingroup$
I'm reading "Contemporary Abstract Algebra," by Gallian.
This is Exercise 4.30.
Suppose $a$ and $b$ belong to a group, $a$ has odd order, and $aba^{-1}=b^{-1}$. Show that $b^2=e$.
My Attempt:
Let $lvert arvert=2n+1$, $ninBbb Ncup{0}$.
We have $$begin{align}
b&=(b^{-1})^{-1} \
&=(aba^{-1})^{-1} \
&=ab^{-1}a^{-1},
end{align}$$
so, by induction, $b=a(underbrace{aba^{-1}}_{=b^{-1}})a^{-1}=dots =a^{2n}ba^{-2n}$, so that
$$begin{align}
b&=a^{2n}ba^{-2n} \
&=a^{2n}(ab^{-1}a^{-1})a^{-2n} \
&=a^{2n+1}b^{-1}a^{-(2n+1)} \
&=b^{-1},
end{align}$$
so $b=b^{-1}$, i.e., $b^2=e$.$square$
Is the above proof okay? I think it is.
However, I'd be interested to see how properties of Baumslag-Solitar groups could be used here, since $aba^{-1}=b^{-1}$ brings them to mind.
group-theory proof-verification alternative-proof
$endgroup$
I'm reading "Contemporary Abstract Algebra," by Gallian.
This is Exercise 4.30.
Suppose $a$ and $b$ belong to a group, $a$ has odd order, and $aba^{-1}=b^{-1}$. Show that $b^2=e$.
My Attempt:
Let $lvert arvert=2n+1$, $ninBbb Ncup{0}$.
We have $$begin{align}
b&=(b^{-1})^{-1} \
&=(aba^{-1})^{-1} \
&=ab^{-1}a^{-1},
end{align}$$
so, by induction, $b=a(underbrace{aba^{-1}}_{=b^{-1}})a^{-1}=dots =a^{2n}ba^{-2n}$, so that
$$begin{align}
b&=a^{2n}ba^{-2n} \
&=a^{2n}(ab^{-1}a^{-1})a^{-2n} \
&=a^{2n+1}b^{-1}a^{-(2n+1)} \
&=b^{-1},
end{align}$$
so $b=b^{-1}$, i.e., $b^2=e$.$square$
Is the above proof okay? I think it is.
However, I'd be interested to see how properties of Baumslag-Solitar groups could be used here, since $aba^{-1}=b^{-1}$ brings them to mind.
group-theory proof-verification alternative-proof
group-theory proof-verification alternative-proof
edited Jan 14 at 17:00
Shaun
asked Jan 14 at 16:33
ShaunShaun
9,221113684
9,221113684
3
$begingroup$
Yes the proof is OK.
$endgroup$
– Derek Holt
Jan 14 at 16:37
2
$begingroup$
Yes it is perfect
$endgroup$
– greedoid
Jan 14 at 16:38
add a comment |
3
$begingroup$
Yes the proof is OK.
$endgroup$
– Derek Holt
Jan 14 at 16:37
2
$begingroup$
Yes it is perfect
$endgroup$
– greedoid
Jan 14 at 16:38
3
3
$begingroup$
Yes the proof is OK.
$endgroup$
– Derek Holt
Jan 14 at 16:37
$begingroup$
Yes the proof is OK.
$endgroup$
– Derek Holt
Jan 14 at 16:37
2
2
$begingroup$
Yes it is perfect
$endgroup$
– greedoid
Jan 14 at 16:38
$begingroup$
Yes it is perfect
$endgroup$
– greedoid
Jan 14 at 16:38
add a comment |
1 Answer
1
active
oldest
votes
$begingroup$
Your proof is fine. Here is an alternative one using a bit more group theory.
Let $G$ denote the subgroup generated by $a$ and $b$. Let $H cong mathbb{Z}_n$ be the subgroup of $G$ generated by $b$. Since $aba^{-1}=b^{-1}$, it follows that $H$ is normal $G$. The quotient $G/H$ must be isomorphic to $mathbb{Z}_m$ for some odd $m$, since the image of $a$ under the map $G rightarrow G/H$ maps to a generator of $G/H$ and $a$ has odd order. The conjugation action of $a$ on $H$ hence gives rise to a homomorphism
$$ mathbb{Z}_m rightarrow mathrm{Aut}(H): 1 mapsto varphi=( b mapsto aba^{-1}=b^{-1}) $$
Note that $varphi$ is either trivial or of order two. Since $mvarphi =0$ for $m$ odd, it follows that $varphi$ is trivial. Hence $b=b^{-1}$, i.e. $b^2=e$.
$endgroup$
add a comment |
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
});
}
});
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3073414%2fsuppose-a-b-in-g-such-that-lvert-a-rvert-is-odd-and-aba-1-b-1-sho%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
1 Answer
1
active
oldest
votes
1 Answer
1
active
oldest
votes
active
oldest
votes
active
oldest
votes
$begingroup$
Your proof is fine. Here is an alternative one using a bit more group theory.
Let $G$ denote the subgroup generated by $a$ and $b$. Let $H cong mathbb{Z}_n$ be the subgroup of $G$ generated by $b$. Since $aba^{-1}=b^{-1}$, it follows that $H$ is normal $G$. The quotient $G/H$ must be isomorphic to $mathbb{Z}_m$ for some odd $m$, since the image of $a$ under the map $G rightarrow G/H$ maps to a generator of $G/H$ and $a$ has odd order. The conjugation action of $a$ on $H$ hence gives rise to a homomorphism
$$ mathbb{Z}_m rightarrow mathrm{Aut}(H): 1 mapsto varphi=( b mapsto aba^{-1}=b^{-1}) $$
Note that $varphi$ is either trivial or of order two. Since $mvarphi =0$ for $m$ odd, it follows that $varphi$ is trivial. Hence $b=b^{-1}$, i.e. $b^2=e$.
$endgroup$
add a comment |
$begingroup$
Your proof is fine. Here is an alternative one using a bit more group theory.
Let $G$ denote the subgroup generated by $a$ and $b$. Let $H cong mathbb{Z}_n$ be the subgroup of $G$ generated by $b$. Since $aba^{-1}=b^{-1}$, it follows that $H$ is normal $G$. The quotient $G/H$ must be isomorphic to $mathbb{Z}_m$ for some odd $m$, since the image of $a$ under the map $G rightarrow G/H$ maps to a generator of $G/H$ and $a$ has odd order. The conjugation action of $a$ on $H$ hence gives rise to a homomorphism
$$ mathbb{Z}_m rightarrow mathrm{Aut}(H): 1 mapsto varphi=( b mapsto aba^{-1}=b^{-1}) $$
Note that $varphi$ is either trivial or of order two. Since $mvarphi =0$ for $m$ odd, it follows that $varphi$ is trivial. Hence $b=b^{-1}$, i.e. $b^2=e$.
$endgroup$
add a comment |
$begingroup$
Your proof is fine. Here is an alternative one using a bit more group theory.
Let $G$ denote the subgroup generated by $a$ and $b$. Let $H cong mathbb{Z}_n$ be the subgroup of $G$ generated by $b$. Since $aba^{-1}=b^{-1}$, it follows that $H$ is normal $G$. The quotient $G/H$ must be isomorphic to $mathbb{Z}_m$ for some odd $m$, since the image of $a$ under the map $G rightarrow G/H$ maps to a generator of $G/H$ and $a$ has odd order. The conjugation action of $a$ on $H$ hence gives rise to a homomorphism
$$ mathbb{Z}_m rightarrow mathrm{Aut}(H): 1 mapsto varphi=( b mapsto aba^{-1}=b^{-1}) $$
Note that $varphi$ is either trivial or of order two. Since $mvarphi =0$ for $m$ odd, it follows that $varphi$ is trivial. Hence $b=b^{-1}$, i.e. $b^2=e$.
$endgroup$
Your proof is fine. Here is an alternative one using a bit more group theory.
Let $G$ denote the subgroup generated by $a$ and $b$. Let $H cong mathbb{Z}_n$ be the subgroup of $G$ generated by $b$. Since $aba^{-1}=b^{-1}$, it follows that $H$ is normal $G$. The quotient $G/H$ must be isomorphic to $mathbb{Z}_m$ for some odd $m$, since the image of $a$ under the map $G rightarrow G/H$ maps to a generator of $G/H$ and $a$ has odd order. The conjugation action of $a$ on $H$ hence gives rise to a homomorphism
$$ mathbb{Z}_m rightarrow mathrm{Aut}(H): 1 mapsto varphi=( b mapsto aba^{-1}=b^{-1}) $$
Note that $varphi$ is either trivial or of order two. Since $mvarphi =0$ for $m$ odd, it follows that $varphi$ is trivial. Hence $b=b^{-1}$, i.e. $b^2=e$.
edited Jan 14 at 19:21
Shaun
9,221113684
9,221113684
answered Jan 14 at 19:20
MortenMorten
605
605
add a comment |
add a comment |
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.
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3073414%2fsuppose-a-b-in-g-such-that-lvert-a-rvert-is-odd-and-aba-1-b-1-sho%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
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
3
$begingroup$
Yes the proof is OK.
$endgroup$
– Derek Holt
Jan 14 at 16:37
2
$begingroup$
Yes it is perfect
$endgroup$
– greedoid
Jan 14 at 16:38