Is it possible to find a $nxn$-matrix $M$ such that $M^2 =- I_n$, where $-I_n$ is the identity matrix?
up vote
1
down vote
favorite
Is it possible to find a $nxn$-matrix $M$ such that $M^2 = -I_n$, where $I_n$ is the identity matrix?
For odd $n$, this cannot hold, since $(-1)^n = det(-I_n) = det (M^2) = det(M)^2$ but what can one say about even $n$?
linear-algebra matrices
add a comment |
up vote
1
down vote
favorite
Is it possible to find a $nxn$-matrix $M$ such that $M^2 = -I_n$, where $I_n$ is the identity matrix?
For odd $n$, this cannot hold, since $(-1)^n = det(-I_n) = det (M^2) = det(M)^2$ but what can one say about even $n$?
linear-algebra matrices
I think you're looking for $M^2=-I_n$, right?
– Carl Schildkraut
Nov 28 at 21:47
For the case where $n$ is even, you can start by solving the case for $n=2$. By Block matrix multiplication, it's not difficult to find an example in generals cases. en.wikipedia.org/wiki/Block_matrix
– 曾靖國
Nov 28 at 21:53
@CarlSchildkraut yeah right.
– MPB94
Nov 28 at 22:04
1
Take any $mathbb{R}$-basis for $mathbb{C}^n$, and then consider what multiplication by $i$ in $mathbb{C}^n$ does to the basis...
– Joppy
Nov 28 at 22:18
add a comment |
up vote
1
down vote
favorite
up vote
1
down vote
favorite
Is it possible to find a $nxn$-matrix $M$ such that $M^2 = -I_n$, where $I_n$ is the identity matrix?
For odd $n$, this cannot hold, since $(-1)^n = det(-I_n) = det (M^2) = det(M)^2$ but what can one say about even $n$?
linear-algebra matrices
Is it possible to find a $nxn$-matrix $M$ such that $M^2 = -I_n$, where $I_n$ is the identity matrix?
For odd $n$, this cannot hold, since $(-1)^n = det(-I_n) = det (M^2) = det(M)^2$ but what can one say about even $n$?
linear-algebra matrices
linear-algebra matrices
edited Nov 28 at 22:04
asked Nov 28 at 21:46
MPB94
23816
23816
I think you're looking for $M^2=-I_n$, right?
– Carl Schildkraut
Nov 28 at 21:47
For the case where $n$ is even, you can start by solving the case for $n=2$. By Block matrix multiplication, it's not difficult to find an example in generals cases. en.wikipedia.org/wiki/Block_matrix
– 曾靖國
Nov 28 at 21:53
@CarlSchildkraut yeah right.
– MPB94
Nov 28 at 22:04
1
Take any $mathbb{R}$-basis for $mathbb{C}^n$, and then consider what multiplication by $i$ in $mathbb{C}^n$ does to the basis...
– Joppy
Nov 28 at 22:18
add a comment |
I think you're looking for $M^2=-I_n$, right?
– Carl Schildkraut
Nov 28 at 21:47
For the case where $n$ is even, you can start by solving the case for $n=2$. By Block matrix multiplication, it's not difficult to find an example in generals cases. en.wikipedia.org/wiki/Block_matrix
– 曾靖國
Nov 28 at 21:53
@CarlSchildkraut yeah right.
– MPB94
Nov 28 at 22:04
1
Take any $mathbb{R}$-basis for $mathbb{C}^n$, and then consider what multiplication by $i$ in $mathbb{C}^n$ does to the basis...
– Joppy
Nov 28 at 22:18
I think you're looking for $M^2=-I_n$, right?
– Carl Schildkraut
Nov 28 at 21:47
I think you're looking for $M^2=-I_n$, right?
– Carl Schildkraut
Nov 28 at 21:47
For the case where $n$ is even, you can start by solving the case for $n=2$. By Block matrix multiplication, it's not difficult to find an example in generals cases. en.wikipedia.org/wiki/Block_matrix
– 曾靖國
Nov 28 at 21:53
For the case where $n$ is even, you can start by solving the case for $n=2$. By Block matrix multiplication, it's not difficult to find an example in generals cases. en.wikipedia.org/wiki/Block_matrix
– 曾靖國
Nov 28 at 21:53
@CarlSchildkraut yeah right.
– MPB94
Nov 28 at 22:04
@CarlSchildkraut yeah right.
– MPB94
Nov 28 at 22:04
1
1
Take any $mathbb{R}$-basis for $mathbb{C}^n$, and then consider what multiplication by $i$ in $mathbb{C}^n$ does to the basis...
– Joppy
Nov 28 at 22:18
Take any $mathbb{R}$-basis for $mathbb{C}^n$, and then consider what multiplication by $i$ in $mathbb{C}^n$ does to the basis...
– Joppy
Nov 28 at 22:18
add a comment |
3 Answers
3
active
oldest
votes
up vote
2
down vote
accepted
Consider the $2 times 2$ matrix
$J = begin{bmatrix} 0 & -1 \ 1 & 0 end{bmatrix}; tag 1$
we have
$J^2 = begin{bmatrix} 0 & -1 \ 1 & 0 end{bmatrix} begin{bmatrix} 0 & -1 \ 1 & 0 end{bmatrix} = -I_2, tag 2$
as may be readily verified by an easy calculation. We may then construct a $2n times 2n$ matrix $M_0$ by placing $n$ copies of $J$ along the (block) diagonal:
$M_0 = begin{bmatrix} J & 0 & ldots & 0 \ 0 & J & ldots & 0 \ dots & vdots & J & 0 \ 0 & 0 & ldots & Jend{bmatrix}; tag 3$
it is equally easy to see that
$M_0^2 = -I_{2n}; tag 4$
this establishes the existence of a desired $2n times 2n$ matrix. An entire family of such matrices may be had by taking matrices $M$ similar to $M_0$:
$M = SM_0S^{-1}; tag 5$
then
$M^2 = SM_0S^{-1} SM_0S^{-1} = SM_0 M_0S^{-1} = S(-I_{2n}) S^{-1} = -I_{2n}. tag 6$
We see there are many matrices of the requisite form.
add a comment |
up vote
1
down vote
$begin{pmatrix}
1 & 2\
-1 & -1
end{pmatrix}$
add a comment |
up vote
0
down vote
A classical example is
$$
M=left(begin{array}{cc}0 & -1 \ 1 & 0end{array}right)
$$
This is a classical example as it allows to mimic (or represent) complex number computations using real arithmetic.
$$
z=a+ib leftrightarrow aleft(begin{array}{cc}1 & 0 \ 0 & 1end{array}right) + bleft(begin{array}{cc}0 & -1 \ 1 & 0end{array}right)=left(begin{array}{cc}a & -b \ b & aend{array}right)
$$
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%2f3017763%2fis-it-possible-to-find-a-nxn-matrix-m-such-that-m2-i-n-where-i-n-i%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
3 Answers
3
active
oldest
votes
3 Answers
3
active
oldest
votes
active
oldest
votes
active
oldest
votes
up vote
2
down vote
accepted
Consider the $2 times 2$ matrix
$J = begin{bmatrix} 0 & -1 \ 1 & 0 end{bmatrix}; tag 1$
we have
$J^2 = begin{bmatrix} 0 & -1 \ 1 & 0 end{bmatrix} begin{bmatrix} 0 & -1 \ 1 & 0 end{bmatrix} = -I_2, tag 2$
as may be readily verified by an easy calculation. We may then construct a $2n times 2n$ matrix $M_0$ by placing $n$ copies of $J$ along the (block) diagonal:
$M_0 = begin{bmatrix} J & 0 & ldots & 0 \ 0 & J & ldots & 0 \ dots & vdots & J & 0 \ 0 & 0 & ldots & Jend{bmatrix}; tag 3$
it is equally easy to see that
$M_0^2 = -I_{2n}; tag 4$
this establishes the existence of a desired $2n times 2n$ matrix. An entire family of such matrices may be had by taking matrices $M$ similar to $M_0$:
$M = SM_0S^{-1}; tag 5$
then
$M^2 = SM_0S^{-1} SM_0S^{-1} = SM_0 M_0S^{-1} = S(-I_{2n}) S^{-1} = -I_{2n}. tag 6$
We see there are many matrices of the requisite form.
add a comment |
up vote
2
down vote
accepted
Consider the $2 times 2$ matrix
$J = begin{bmatrix} 0 & -1 \ 1 & 0 end{bmatrix}; tag 1$
we have
$J^2 = begin{bmatrix} 0 & -1 \ 1 & 0 end{bmatrix} begin{bmatrix} 0 & -1 \ 1 & 0 end{bmatrix} = -I_2, tag 2$
as may be readily verified by an easy calculation. We may then construct a $2n times 2n$ matrix $M_0$ by placing $n$ copies of $J$ along the (block) diagonal:
$M_0 = begin{bmatrix} J & 0 & ldots & 0 \ 0 & J & ldots & 0 \ dots & vdots & J & 0 \ 0 & 0 & ldots & Jend{bmatrix}; tag 3$
it is equally easy to see that
$M_0^2 = -I_{2n}; tag 4$
this establishes the existence of a desired $2n times 2n$ matrix. An entire family of such matrices may be had by taking matrices $M$ similar to $M_0$:
$M = SM_0S^{-1}; tag 5$
then
$M^2 = SM_0S^{-1} SM_0S^{-1} = SM_0 M_0S^{-1} = S(-I_{2n}) S^{-1} = -I_{2n}. tag 6$
We see there are many matrices of the requisite form.
add a comment |
up vote
2
down vote
accepted
up vote
2
down vote
accepted
Consider the $2 times 2$ matrix
$J = begin{bmatrix} 0 & -1 \ 1 & 0 end{bmatrix}; tag 1$
we have
$J^2 = begin{bmatrix} 0 & -1 \ 1 & 0 end{bmatrix} begin{bmatrix} 0 & -1 \ 1 & 0 end{bmatrix} = -I_2, tag 2$
as may be readily verified by an easy calculation. We may then construct a $2n times 2n$ matrix $M_0$ by placing $n$ copies of $J$ along the (block) diagonal:
$M_0 = begin{bmatrix} J & 0 & ldots & 0 \ 0 & J & ldots & 0 \ dots & vdots & J & 0 \ 0 & 0 & ldots & Jend{bmatrix}; tag 3$
it is equally easy to see that
$M_0^2 = -I_{2n}; tag 4$
this establishes the existence of a desired $2n times 2n$ matrix. An entire family of such matrices may be had by taking matrices $M$ similar to $M_0$:
$M = SM_0S^{-1}; tag 5$
then
$M^2 = SM_0S^{-1} SM_0S^{-1} = SM_0 M_0S^{-1} = S(-I_{2n}) S^{-1} = -I_{2n}. tag 6$
We see there are many matrices of the requisite form.
Consider the $2 times 2$ matrix
$J = begin{bmatrix} 0 & -1 \ 1 & 0 end{bmatrix}; tag 1$
we have
$J^2 = begin{bmatrix} 0 & -1 \ 1 & 0 end{bmatrix} begin{bmatrix} 0 & -1 \ 1 & 0 end{bmatrix} = -I_2, tag 2$
as may be readily verified by an easy calculation. We may then construct a $2n times 2n$ matrix $M_0$ by placing $n$ copies of $J$ along the (block) diagonal:
$M_0 = begin{bmatrix} J & 0 & ldots & 0 \ 0 & J & ldots & 0 \ dots & vdots & J & 0 \ 0 & 0 & ldots & Jend{bmatrix}; tag 3$
it is equally easy to see that
$M_0^2 = -I_{2n}; tag 4$
this establishes the existence of a desired $2n times 2n$ matrix. An entire family of such matrices may be had by taking matrices $M$ similar to $M_0$:
$M = SM_0S^{-1}; tag 5$
then
$M^2 = SM_0S^{-1} SM_0S^{-1} = SM_0 M_0S^{-1} = S(-I_{2n}) S^{-1} = -I_{2n}. tag 6$
We see there are many matrices of the requisite form.
answered Nov 28 at 22:26
Robert Lewis
43k22863
43k22863
add a comment |
add a comment |
up vote
1
down vote
$begin{pmatrix}
1 & 2\
-1 & -1
end{pmatrix}$
add a comment |
up vote
1
down vote
$begin{pmatrix}
1 & 2\
-1 & -1
end{pmatrix}$
add a comment |
up vote
1
down vote
up vote
1
down vote
$begin{pmatrix}
1 & 2\
-1 & -1
end{pmatrix}$
$begin{pmatrix}
1 & 2\
-1 & -1
end{pmatrix}$
answered Nov 28 at 22:23
Fat ninja
634
634
add a comment |
add a comment |
up vote
0
down vote
A classical example is
$$
M=left(begin{array}{cc}0 & -1 \ 1 & 0end{array}right)
$$
This is a classical example as it allows to mimic (or represent) complex number computations using real arithmetic.
$$
z=a+ib leftrightarrow aleft(begin{array}{cc}1 & 0 \ 0 & 1end{array}right) + bleft(begin{array}{cc}0 & -1 \ 1 & 0end{array}right)=left(begin{array}{cc}a & -b \ b & aend{array}right)
$$
add a comment |
up vote
0
down vote
A classical example is
$$
M=left(begin{array}{cc}0 & -1 \ 1 & 0end{array}right)
$$
This is a classical example as it allows to mimic (or represent) complex number computations using real arithmetic.
$$
z=a+ib leftrightarrow aleft(begin{array}{cc}1 & 0 \ 0 & 1end{array}right) + bleft(begin{array}{cc}0 & -1 \ 1 & 0end{array}right)=left(begin{array}{cc}a & -b \ b & aend{array}right)
$$
add a comment |
up vote
0
down vote
up vote
0
down vote
A classical example is
$$
M=left(begin{array}{cc}0 & -1 \ 1 & 0end{array}right)
$$
This is a classical example as it allows to mimic (or represent) complex number computations using real arithmetic.
$$
z=a+ib leftrightarrow aleft(begin{array}{cc}1 & 0 \ 0 & 1end{array}right) + bleft(begin{array}{cc}0 & -1 \ 1 & 0end{array}right)=left(begin{array}{cc}a & -b \ b & aend{array}right)
$$
A classical example is
$$
M=left(begin{array}{cc}0 & -1 \ 1 & 0end{array}right)
$$
This is a classical example as it allows to mimic (or represent) complex number computations using real arithmetic.
$$
z=a+ib leftrightarrow aleft(begin{array}{cc}1 & 0 \ 0 & 1end{array}right) + bleft(begin{array}{cc}0 & -1 \ 1 & 0end{array}right)=left(begin{array}{cc}a & -b \ b & aend{array}right)
$$
answered Nov 28 at 22:25
Picaud Vincent
1,10036
1,10036
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.
Some of your past answers have not been well-received, and you're in danger of being blocked from answering.
Please pay close attention to the following guidance:
- 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.
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%2f3017763%2fis-it-possible-to-find-a-nxn-matrix-m-such-that-m2-i-n-where-i-n-i%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
I think you're looking for $M^2=-I_n$, right?
– Carl Schildkraut
Nov 28 at 21:47
For the case where $n$ is even, you can start by solving the case for $n=2$. By Block matrix multiplication, it's not difficult to find an example in generals cases. en.wikipedia.org/wiki/Block_matrix
– 曾靖國
Nov 28 at 21:53
@CarlSchildkraut yeah right.
– MPB94
Nov 28 at 22:04
1
Take any $mathbb{R}$-basis for $mathbb{C}^n$, and then consider what multiplication by $i$ in $mathbb{C}^n$ does to the basis...
– Joppy
Nov 28 at 22:18