Prove that $G_2=B_1,B_2,…,B_p$ is a multiplicative group isomorphic with $G_1=A_1,A_2,…,A_p$How to compute in $BbbZ_6 rtimes BbbZ_2$?Prove that $f$ is a group isomorphism, where $f$ interchanges the primes.The central product of two cyclic subgroups of prime power order for one $p$ is isomorphic to direct product of two cyclic groups of prime power orderIs this a feasible way to show that a group $G$ is isomorphic to its opposite group $G^op$?Are these subgroups?Where is the error in this proof? (possibly bad surjection assumption)$mathbbC^3$ as a pointwise alegbra has only one simple module: true or false?Isomorphic subgroups of $S_n$ and bijection of setsOn a certain bijection of the multiplicative group modulo prime $p=2^k+1$.Problem : Normal form of product of matrices over a PID
A three room house but a three headED dog
Offered promotion but I'm leaving. Should I tell?
How do you like my writing?
Why is Beresheet doing a only a one-way trip?
Built-In Shelves/Bookcases - IKEA vs Built
How much stiffer are 23c tires over 28c?
Low budget alien movie about the Earth being cooked
Are babies of evil humanoid species inherently evil?
How did the power source of Mar-Vell's aircraft end up with her?
Is it possible to have an Abelian group under two different binary operations but the binary operations are not distributive?
Time travel short story where dinosaur doesn't taste like chicken
Moving plot label
infinitive telling the purpose
Why would one plane in this picture not have gear down yet?
Is there an elementary proof that there are infinitely many primes that are *not* completely split in an abelian extension?
Examples of a statistic that is not independent of sample's distribution?
Is there a window switcher for GNOME that shows the actual window?
Force user to remove USB token
Solving "Resistance between two nodes on a grid" problem in Mathematica
In the late 1940’s to early 1950’s what technology was available that could melt a LOT of ice?
Does "variables should live in the smallest scope as possible" include the case "variables should not exist if possible"?
How much attack damage does the AC boost from a shield prevent on average?
How to create a hard link to an inode (ext4)?
Replacing Windows 7 security updates with anti-virus?
Prove that $G_2=B_1,B_2,…,B_p$ is a multiplicative group isomorphic with $G_1=A_1,A_2,…,A_p$
How to compute in $BbbZ_6 rtimes BbbZ_2$?Prove that $f$ is a group isomorphism, where $f$ interchanges the primes.The central product of two cyclic subgroups of prime power order for one $p$ is isomorphic to direct product of two cyclic groups of prime power orderIs this a feasible way to show that a group $G$ is isomorphic to its opposite group $G^op$?Are these subgroups?Where is the error in this proof? (possibly bad surjection assumption)$mathbbC^3$ as a pointwise alegbra has only one simple module: true or false?Isomorphic subgroups of $S_n$ and bijection of setsOn a certain bijection of the multiplicative group modulo prime $p=2^k+1$.Problem : Normal form of product of matrices over a PID
$begingroup$
Let $m,n,pgeq3$ be natural numbers and $G_1=A_1,A_2,...,A_p$ a multiplicative group of order $p$ with elements from $M_2(mathbbZ)$. For every $A_i$ from $G$ we attach $B_i$ such that if $A=(a_ij), i,j=1,n$, then $B=(a_ij) pmod m$. Prove that the set $G_2=B_1,B_2,...,B_p$ is a multiplicative group isomorphic with $G_1$, where the multiplication is that of $M_n(mathbbZ_m)$.
I think $f:G_1rightarrow G_2$, $f(A_i)=B_i$ is an isomorphism and thus the problem can be easily solved, but I am unsure it's so basic. Any help to finish it?
abstract-algebra group-theory finite-groups group-isomorphism
New contributor
user651754 is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
$endgroup$
add a comment |
$begingroup$
Let $m,n,pgeq3$ be natural numbers and $G_1=A_1,A_2,...,A_p$ a multiplicative group of order $p$ with elements from $M_2(mathbbZ)$. For every $A_i$ from $G$ we attach $B_i$ such that if $A=(a_ij), i,j=1,n$, then $B=(a_ij) pmod m$. Prove that the set $G_2=B_1,B_2,...,B_p$ is a multiplicative group isomorphic with $G_1$, where the multiplication is that of $M_n(mathbbZ_m)$.
I think $f:G_1rightarrow G_2$, $f(A_i)=B_i$ is an isomorphism and thus the problem can be easily solved, but I am unsure it's so basic. Any help to finish it?
abstract-algebra group-theory finite-groups group-isomorphism
New contributor
user651754 is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
$endgroup$
add a comment |
$begingroup$
Let $m,n,pgeq3$ be natural numbers and $G_1=A_1,A_2,...,A_p$ a multiplicative group of order $p$ with elements from $M_2(mathbbZ)$. For every $A_i$ from $G$ we attach $B_i$ such that if $A=(a_ij), i,j=1,n$, then $B=(a_ij) pmod m$. Prove that the set $G_2=B_1,B_2,...,B_p$ is a multiplicative group isomorphic with $G_1$, where the multiplication is that of $M_n(mathbbZ_m)$.
I think $f:G_1rightarrow G_2$, $f(A_i)=B_i$ is an isomorphism and thus the problem can be easily solved, but I am unsure it's so basic. Any help to finish it?
abstract-algebra group-theory finite-groups group-isomorphism
New contributor
user651754 is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
$endgroup$
Let $m,n,pgeq3$ be natural numbers and $G_1=A_1,A_2,...,A_p$ a multiplicative group of order $p$ with elements from $M_2(mathbbZ)$. For every $A_i$ from $G$ we attach $B_i$ such that if $A=(a_ij), i,j=1,n$, then $B=(a_ij) pmod m$. Prove that the set $G_2=B_1,B_2,...,B_p$ is a multiplicative group isomorphic with $G_1$, where the multiplication is that of $M_n(mathbbZ_m)$.
I think $f:G_1rightarrow G_2$, $f(A_i)=B_i$ is an isomorphism and thus the problem can be easily solved, but I am unsure it's so basic. Any help to finish it?
abstract-algebra group-theory finite-groups group-isomorphism
abstract-algebra group-theory finite-groups group-isomorphism
New contributor
user651754 is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
New contributor
user651754 is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
edited yesterday
user26857
39.4k124183
39.4k124183
New contributor
user651754 is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
asked 2 days ago
user651754user651754
454
454
New contributor
user651754 is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
New contributor
user651754 is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
user651754 is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
add a comment |
add a comment |
1 Answer
1
active
oldest
votes
$begingroup$
This is not completely trivial. The map $f$ is certainly a homomorphism, but to show that it is an isomorphism, you need to show that its kernel is trivial.
This follows from the fact that the kernel of the reduction modulo $m$ map $rm SL(n,mathbb Z) to rm SL(n,mathbb Z/mmathbb Z)$ is torsion-free for $m ge 3$. You can find a proof of this in Lemma 2.6 here, for example.
$endgroup$
$begingroup$
Thanks! I am not familiar with the notion of torsion, so is there an easier way to show that the map $f$ is an isomorphism?
$endgroup$
– user651754
2 days ago
$begingroup$
A torsion-free group is one in which every non-identity element has infinite order. I am afraid that there is no easier way to do this, because if the kernel of the reduction mod $m$ had elements of finite order, then the result that you are trying to prove would not be true.
$endgroup$
– Derek Holt
2 days ago
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
);
);
user651754 is a new contributor. Be nice, and check out our Code of Conduct.
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%2f3142116%2fprove-that-g-2-b-1-b-2-b-p-is-a-multiplicative-group-isomorphic-with%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$
This is not completely trivial. The map $f$ is certainly a homomorphism, but to show that it is an isomorphism, you need to show that its kernel is trivial.
This follows from the fact that the kernel of the reduction modulo $m$ map $rm SL(n,mathbb Z) to rm SL(n,mathbb Z/mmathbb Z)$ is torsion-free for $m ge 3$. You can find a proof of this in Lemma 2.6 here, for example.
$endgroup$
$begingroup$
Thanks! I am not familiar with the notion of torsion, so is there an easier way to show that the map $f$ is an isomorphism?
$endgroup$
– user651754
2 days ago
$begingroup$
A torsion-free group is one in which every non-identity element has infinite order. I am afraid that there is no easier way to do this, because if the kernel of the reduction mod $m$ had elements of finite order, then the result that you are trying to prove would not be true.
$endgroup$
– Derek Holt
2 days ago
add a comment |
$begingroup$
This is not completely trivial. The map $f$ is certainly a homomorphism, but to show that it is an isomorphism, you need to show that its kernel is trivial.
This follows from the fact that the kernel of the reduction modulo $m$ map $rm SL(n,mathbb Z) to rm SL(n,mathbb Z/mmathbb Z)$ is torsion-free for $m ge 3$. You can find a proof of this in Lemma 2.6 here, for example.
$endgroup$
$begingroup$
Thanks! I am not familiar with the notion of torsion, so is there an easier way to show that the map $f$ is an isomorphism?
$endgroup$
– user651754
2 days ago
$begingroup$
A torsion-free group is one in which every non-identity element has infinite order. I am afraid that there is no easier way to do this, because if the kernel of the reduction mod $m$ had elements of finite order, then the result that you are trying to prove would not be true.
$endgroup$
– Derek Holt
2 days ago
add a comment |
$begingroup$
This is not completely trivial. The map $f$ is certainly a homomorphism, but to show that it is an isomorphism, you need to show that its kernel is trivial.
This follows from the fact that the kernel of the reduction modulo $m$ map $rm SL(n,mathbb Z) to rm SL(n,mathbb Z/mmathbb Z)$ is torsion-free for $m ge 3$. You can find a proof of this in Lemma 2.6 here, for example.
$endgroup$
This is not completely trivial. The map $f$ is certainly a homomorphism, but to show that it is an isomorphism, you need to show that its kernel is trivial.
This follows from the fact that the kernel of the reduction modulo $m$ map $rm SL(n,mathbb Z) to rm SL(n,mathbb Z/mmathbb Z)$ is torsion-free for $m ge 3$. You can find a proof of this in Lemma 2.6 here, for example.
answered 2 days ago
Derek HoltDerek Holt
54.2k53571
54.2k53571
$begingroup$
Thanks! I am not familiar with the notion of torsion, so is there an easier way to show that the map $f$ is an isomorphism?
$endgroup$
– user651754
2 days ago
$begingroup$
A torsion-free group is one in which every non-identity element has infinite order. I am afraid that there is no easier way to do this, because if the kernel of the reduction mod $m$ had elements of finite order, then the result that you are trying to prove would not be true.
$endgroup$
– Derek Holt
2 days ago
add a comment |
$begingroup$
Thanks! I am not familiar with the notion of torsion, so is there an easier way to show that the map $f$ is an isomorphism?
$endgroup$
– user651754
2 days ago
$begingroup$
A torsion-free group is one in which every non-identity element has infinite order. I am afraid that there is no easier way to do this, because if the kernel of the reduction mod $m$ had elements of finite order, then the result that you are trying to prove would not be true.
$endgroup$
– Derek Holt
2 days ago
$begingroup$
Thanks! I am not familiar with the notion of torsion, so is there an easier way to show that the map $f$ is an isomorphism?
$endgroup$
– user651754
2 days ago
$begingroup$
Thanks! I am not familiar with the notion of torsion, so is there an easier way to show that the map $f$ is an isomorphism?
$endgroup$
– user651754
2 days ago
$begingroup$
A torsion-free group is one in which every non-identity element has infinite order. I am afraid that there is no easier way to do this, because if the kernel of the reduction mod $m$ had elements of finite order, then the result that you are trying to prove would not be true.
$endgroup$
– Derek Holt
2 days ago
$begingroup$
A torsion-free group is one in which every non-identity element has infinite order. I am afraid that there is no easier way to do this, because if the kernel of the reduction mod $m$ had elements of finite order, then the result that you are trying to prove would not be true.
$endgroup$
– Derek Holt
2 days ago
add a comment |
user651754 is a new contributor. Be nice, and check out our Code of Conduct.
user651754 is a new contributor. Be nice, and check out our Code of Conduct.
user651754 is a new contributor. Be nice, and check out our Code of Conduct.
user651754 is a new contributor. Be nice, and check out our Code of Conduct.
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%2f3142116%2fprove-that-g-2-b-1-b-2-b-p-is-a-multiplicative-group-isomorphic-with%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