Abstract algebra: Proving the matrix is a subgroup
$begingroup$
I'm confusing about this specific problem:
Here, $Gamma$ is a group of 2x2 - matrices with integer entries, with respect to the usual matrix multiplication, and $det(Gamma) = 1$.
But will the identity $I = begin{bmatrix}1&0\0&1end{bmatrix}$ fail to prove when $n = 1$ and therefore, $I notin Gamma_n$ ? (Because $1 equiv 0 pmod{1}$)
Please, correct me if I'm mistaken.
abstract-algebra matrices
$endgroup$
|
show 1 more comment
$begingroup$
I'm confusing about this specific problem:
Here, $Gamma$ is a group of 2x2 - matrices with integer entries, with respect to the usual matrix multiplication, and $det(Gamma) = 1$.
But will the identity $I = begin{bmatrix}1&0\0&1end{bmatrix}$ fail to prove when $n = 1$ and therefore, $I notin Gamma_n$ ? (Because $1 equiv 0 pmod{1}$)
Please, correct me if I'm mistaken.
abstract-algebra matrices
$endgroup$
$begingroup$
The set of all $2 times 2$-matrices is not a group with respect to matrix multiplication. You probably want $Gamma$ to be the group of invertible $2 times 2$-matrices over the integers.
$endgroup$
– Matthias Klupsch
Jan 25 at 6:23
2
$begingroup$
@hardmath : It seems to me the set $Gamma_1$ is not the trivial subgroup but the whole $Gamma$, since the conditions are trivially satisfied.
$endgroup$
– Matthias Klupsch
Jan 25 at 6:25
1
$begingroup$
Regarding your problem of proving $I in Gamma_1$, ask yourself: is $1 equiv 1 $ mod $1$ and is $0 equiv 0 $ mod $1$? This is all you need in order to have $I in Gamma_1$.
$endgroup$
– Matthias Klupsch
Jan 25 at 6:28
$begingroup$
@MatthiasKlupsch sorry for missing an important info, but it is invertible since $det(Gamma) = 1$
$endgroup$
– Thai Doan
Jan 25 at 6:29
$begingroup$
@Matthias: Yes, you are right. It's not clear to me what group $Gamma$ is, perhaps an additive group or a multiplicative group of matrices. I guess it doesn't matter as far as case $n=1$ goes.
$endgroup$
– hardmath
Jan 25 at 6:34
|
show 1 more comment
$begingroup$
I'm confusing about this specific problem:
Here, $Gamma$ is a group of 2x2 - matrices with integer entries, with respect to the usual matrix multiplication, and $det(Gamma) = 1$.
But will the identity $I = begin{bmatrix}1&0\0&1end{bmatrix}$ fail to prove when $n = 1$ and therefore, $I notin Gamma_n$ ? (Because $1 equiv 0 pmod{1}$)
Please, correct me if I'm mistaken.
abstract-algebra matrices
$endgroup$
I'm confusing about this specific problem:
Here, $Gamma$ is a group of 2x2 - matrices with integer entries, with respect to the usual matrix multiplication, and $det(Gamma) = 1$.
But will the identity $I = begin{bmatrix}1&0\0&1end{bmatrix}$ fail to prove when $n = 1$ and therefore, $I notin Gamma_n$ ? (Because $1 equiv 0 pmod{1}$)
Please, correct me if I'm mistaken.
abstract-algebra matrices
abstract-algebra matrices
edited Jan 25 at 6:39
Thai Doan
asked Jan 25 at 6:17


Thai DoanThai Doan
487
487
$begingroup$
The set of all $2 times 2$-matrices is not a group with respect to matrix multiplication. You probably want $Gamma$ to be the group of invertible $2 times 2$-matrices over the integers.
$endgroup$
– Matthias Klupsch
Jan 25 at 6:23
2
$begingroup$
@hardmath : It seems to me the set $Gamma_1$ is not the trivial subgroup but the whole $Gamma$, since the conditions are trivially satisfied.
$endgroup$
– Matthias Klupsch
Jan 25 at 6:25
1
$begingroup$
Regarding your problem of proving $I in Gamma_1$, ask yourself: is $1 equiv 1 $ mod $1$ and is $0 equiv 0 $ mod $1$? This is all you need in order to have $I in Gamma_1$.
$endgroup$
– Matthias Klupsch
Jan 25 at 6:28
$begingroup$
@MatthiasKlupsch sorry for missing an important info, but it is invertible since $det(Gamma) = 1$
$endgroup$
– Thai Doan
Jan 25 at 6:29
$begingroup$
@Matthias: Yes, you are right. It's not clear to me what group $Gamma$ is, perhaps an additive group or a multiplicative group of matrices. I guess it doesn't matter as far as case $n=1$ goes.
$endgroup$
– hardmath
Jan 25 at 6:34
|
show 1 more comment
$begingroup$
The set of all $2 times 2$-matrices is not a group with respect to matrix multiplication. You probably want $Gamma$ to be the group of invertible $2 times 2$-matrices over the integers.
$endgroup$
– Matthias Klupsch
Jan 25 at 6:23
2
$begingroup$
@hardmath : It seems to me the set $Gamma_1$ is not the trivial subgroup but the whole $Gamma$, since the conditions are trivially satisfied.
$endgroup$
– Matthias Klupsch
Jan 25 at 6:25
1
$begingroup$
Regarding your problem of proving $I in Gamma_1$, ask yourself: is $1 equiv 1 $ mod $1$ and is $0 equiv 0 $ mod $1$? This is all you need in order to have $I in Gamma_1$.
$endgroup$
– Matthias Klupsch
Jan 25 at 6:28
$begingroup$
@MatthiasKlupsch sorry for missing an important info, but it is invertible since $det(Gamma) = 1$
$endgroup$
– Thai Doan
Jan 25 at 6:29
$begingroup$
@Matthias: Yes, you are right. It's not clear to me what group $Gamma$ is, perhaps an additive group or a multiplicative group of matrices. I guess it doesn't matter as far as case $n=1$ goes.
$endgroup$
– hardmath
Jan 25 at 6:34
$begingroup$
The set of all $2 times 2$-matrices is not a group with respect to matrix multiplication. You probably want $Gamma$ to be the group of invertible $2 times 2$-matrices over the integers.
$endgroup$
– Matthias Klupsch
Jan 25 at 6:23
$begingroup$
The set of all $2 times 2$-matrices is not a group with respect to matrix multiplication. You probably want $Gamma$ to be the group of invertible $2 times 2$-matrices over the integers.
$endgroup$
– Matthias Klupsch
Jan 25 at 6:23
2
2
$begingroup$
@hardmath : It seems to me the set $Gamma_1$ is not the trivial subgroup but the whole $Gamma$, since the conditions are trivially satisfied.
$endgroup$
– Matthias Klupsch
Jan 25 at 6:25
$begingroup$
@hardmath : It seems to me the set $Gamma_1$ is not the trivial subgroup but the whole $Gamma$, since the conditions are trivially satisfied.
$endgroup$
– Matthias Klupsch
Jan 25 at 6:25
1
1
$begingroup$
Regarding your problem of proving $I in Gamma_1$, ask yourself: is $1 equiv 1 $ mod $1$ and is $0 equiv 0 $ mod $1$? This is all you need in order to have $I in Gamma_1$.
$endgroup$
– Matthias Klupsch
Jan 25 at 6:28
$begingroup$
Regarding your problem of proving $I in Gamma_1$, ask yourself: is $1 equiv 1 $ mod $1$ and is $0 equiv 0 $ mod $1$? This is all you need in order to have $I in Gamma_1$.
$endgroup$
– Matthias Klupsch
Jan 25 at 6:28
$begingroup$
@MatthiasKlupsch sorry for missing an important info, but it is invertible since $det(Gamma) = 1$
$endgroup$
– Thai Doan
Jan 25 at 6:29
$begingroup$
@MatthiasKlupsch sorry for missing an important info, but it is invertible since $det(Gamma) = 1$
$endgroup$
– Thai Doan
Jan 25 at 6:29
$begingroup$
@Matthias: Yes, you are right. It's not clear to me what group $Gamma$ is, perhaps an additive group or a multiplicative group of matrices. I guess it doesn't matter as far as case $n=1$ goes.
$endgroup$
– hardmath
Jan 25 at 6:34
$begingroup$
@Matthias: Yes, you are right. It's not clear to me what group $Gamma$ is, perhaps an additive group or a multiplicative group of matrices. I guess it doesn't matter as far as case $n=1$ goes.
$endgroup$
– hardmath
Jan 25 at 6:34
|
show 1 more comment
2 Answers
2
active
oldest
votes
$begingroup$
The excerpt explains for you that $Gamma_2 $ will be the matrices with main diagonal entries odd and minor diagonal entries even. ( This is another way of saying $aequiv dequiv1pmod2$ and $bequiv cequiv 0pmod2$).
Thus the identity, $I=begin{pmatrix} 1&0\0&1end{pmatrix}$ is an element of $Gamma_2 $.
$endgroup$
$begingroup$
Thanks for your help, but it doesn't follow that $I in Gamma_n$ for any positive integers $n$
$endgroup$
– Thai Doan
Jan 25 at 7:11
1
$begingroup$
It actually does. For any $n$ , we have $1equiv 1pmod n$ and $0equiv0pmod n$.
$endgroup$
– Chris Custer
Jan 25 at 7:17
$begingroup$
Nice! I have upvoted your post and thank you for pointing out $1 equiv 1 pmod{n}$.
$endgroup$
– Thai Doan
Jan 25 at 7:29
add a comment |
$begingroup$
My problem is I was mistaken about the "congruence": $1 equiv 1 pmod{1}$. They are both in the same equivalence class for 0.
$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%2f3086781%2fabstract-algebra-proving-the-matrix-is-a-subgroup%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
2 Answers
2
active
oldest
votes
2 Answers
2
active
oldest
votes
active
oldest
votes
active
oldest
votes
$begingroup$
The excerpt explains for you that $Gamma_2 $ will be the matrices with main diagonal entries odd and minor diagonal entries even. ( This is another way of saying $aequiv dequiv1pmod2$ and $bequiv cequiv 0pmod2$).
Thus the identity, $I=begin{pmatrix} 1&0\0&1end{pmatrix}$ is an element of $Gamma_2 $.
$endgroup$
$begingroup$
Thanks for your help, but it doesn't follow that $I in Gamma_n$ for any positive integers $n$
$endgroup$
– Thai Doan
Jan 25 at 7:11
1
$begingroup$
It actually does. For any $n$ , we have $1equiv 1pmod n$ and $0equiv0pmod n$.
$endgroup$
– Chris Custer
Jan 25 at 7:17
$begingroup$
Nice! I have upvoted your post and thank you for pointing out $1 equiv 1 pmod{n}$.
$endgroup$
– Thai Doan
Jan 25 at 7:29
add a comment |
$begingroup$
The excerpt explains for you that $Gamma_2 $ will be the matrices with main diagonal entries odd and minor diagonal entries even. ( This is another way of saying $aequiv dequiv1pmod2$ and $bequiv cequiv 0pmod2$).
Thus the identity, $I=begin{pmatrix} 1&0\0&1end{pmatrix}$ is an element of $Gamma_2 $.
$endgroup$
$begingroup$
Thanks for your help, but it doesn't follow that $I in Gamma_n$ for any positive integers $n$
$endgroup$
– Thai Doan
Jan 25 at 7:11
1
$begingroup$
It actually does. For any $n$ , we have $1equiv 1pmod n$ and $0equiv0pmod n$.
$endgroup$
– Chris Custer
Jan 25 at 7:17
$begingroup$
Nice! I have upvoted your post and thank you for pointing out $1 equiv 1 pmod{n}$.
$endgroup$
– Thai Doan
Jan 25 at 7:29
add a comment |
$begingroup$
The excerpt explains for you that $Gamma_2 $ will be the matrices with main diagonal entries odd and minor diagonal entries even. ( This is another way of saying $aequiv dequiv1pmod2$ and $bequiv cequiv 0pmod2$).
Thus the identity, $I=begin{pmatrix} 1&0\0&1end{pmatrix}$ is an element of $Gamma_2 $.
$endgroup$
The excerpt explains for you that $Gamma_2 $ will be the matrices with main diagonal entries odd and minor diagonal entries even. ( This is another way of saying $aequiv dequiv1pmod2$ and $bequiv cequiv 0pmod2$).
Thus the identity, $I=begin{pmatrix} 1&0\0&1end{pmatrix}$ is an element of $Gamma_2 $.
answered Jan 25 at 7:05
Chris CusterChris Custer
14.2k3827
14.2k3827
$begingroup$
Thanks for your help, but it doesn't follow that $I in Gamma_n$ for any positive integers $n$
$endgroup$
– Thai Doan
Jan 25 at 7:11
1
$begingroup$
It actually does. For any $n$ , we have $1equiv 1pmod n$ and $0equiv0pmod n$.
$endgroup$
– Chris Custer
Jan 25 at 7:17
$begingroup$
Nice! I have upvoted your post and thank you for pointing out $1 equiv 1 pmod{n}$.
$endgroup$
– Thai Doan
Jan 25 at 7:29
add a comment |
$begingroup$
Thanks for your help, but it doesn't follow that $I in Gamma_n$ for any positive integers $n$
$endgroup$
– Thai Doan
Jan 25 at 7:11
1
$begingroup$
It actually does. For any $n$ , we have $1equiv 1pmod n$ and $0equiv0pmod n$.
$endgroup$
– Chris Custer
Jan 25 at 7:17
$begingroup$
Nice! I have upvoted your post and thank you for pointing out $1 equiv 1 pmod{n}$.
$endgroup$
– Thai Doan
Jan 25 at 7:29
$begingroup$
Thanks for your help, but it doesn't follow that $I in Gamma_n$ for any positive integers $n$
$endgroup$
– Thai Doan
Jan 25 at 7:11
$begingroup$
Thanks for your help, but it doesn't follow that $I in Gamma_n$ for any positive integers $n$
$endgroup$
– Thai Doan
Jan 25 at 7:11
1
1
$begingroup$
It actually does. For any $n$ , we have $1equiv 1pmod n$ and $0equiv0pmod n$.
$endgroup$
– Chris Custer
Jan 25 at 7:17
$begingroup$
It actually does. For any $n$ , we have $1equiv 1pmod n$ and $0equiv0pmod n$.
$endgroup$
– Chris Custer
Jan 25 at 7:17
$begingroup$
Nice! I have upvoted your post and thank you for pointing out $1 equiv 1 pmod{n}$.
$endgroup$
– Thai Doan
Jan 25 at 7:29
$begingroup$
Nice! I have upvoted your post and thank you for pointing out $1 equiv 1 pmod{n}$.
$endgroup$
– Thai Doan
Jan 25 at 7:29
add a comment |
$begingroup$
My problem is I was mistaken about the "congruence": $1 equiv 1 pmod{1}$. They are both in the same equivalence class for 0.
$endgroup$
add a comment |
$begingroup$
My problem is I was mistaken about the "congruence": $1 equiv 1 pmod{1}$. They are both in the same equivalence class for 0.
$endgroup$
add a comment |
$begingroup$
My problem is I was mistaken about the "congruence": $1 equiv 1 pmod{1}$. They are both in the same equivalence class for 0.
$endgroup$
My problem is I was mistaken about the "congruence": $1 equiv 1 pmod{1}$. They are both in the same equivalence class for 0.
answered Jan 25 at 7:26


Thai DoanThai Doan
487
487
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%2f3086781%2fabstract-algebra-proving-the-matrix-is-a-subgroup%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
$begingroup$
The set of all $2 times 2$-matrices is not a group with respect to matrix multiplication. You probably want $Gamma$ to be the group of invertible $2 times 2$-matrices over the integers.
$endgroup$
– Matthias Klupsch
Jan 25 at 6:23
2
$begingroup$
@hardmath : It seems to me the set $Gamma_1$ is not the trivial subgroup but the whole $Gamma$, since the conditions are trivially satisfied.
$endgroup$
– Matthias Klupsch
Jan 25 at 6:25
1
$begingroup$
Regarding your problem of proving $I in Gamma_1$, ask yourself: is $1 equiv 1 $ mod $1$ and is $0 equiv 0 $ mod $1$? This is all you need in order to have $I in Gamma_1$.
$endgroup$
– Matthias Klupsch
Jan 25 at 6:28
$begingroup$
@MatthiasKlupsch sorry for missing an important info, but it is invertible since $det(Gamma) = 1$
$endgroup$
– Thai Doan
Jan 25 at 6:29
$begingroup$
@Matthias: Yes, you are right. It's not clear to me what group $Gamma$ is, perhaps an additive group or a multiplicative group of matrices. I guess it doesn't matter as far as case $n=1$ goes.
$endgroup$
– hardmath
Jan 25 at 6:34