Eigenvalues of a real orthogonal matrix.
$begingroup$
Let $A$ be a real orthogonal matrix. Then $A^{text T} A = I.$ Let $lambda in Bbb C$ be an eigenvalue of $A$ corresponding to the eigenvector $X in Bbb C^n.$ Then we have
$$begin{align*} X^{text T} A^{text T} A X = X^{text T} X. \ implies (AX)^{text T} AX & = X^{text T} X. \ implies (lambda X)^{text T} lambda X & = X^{text T} X. \ implies {lambda}^2 X^{text T} X & = X^{text T} X. \ implies ({lambda}^2 - 1) X^{text T} X & = 0. end{align*}$$
Since $X$ is an eigenvector $X neq 0.$ Therefore ${|X|_2}^2 = X^{text T} X neq 0.$ Hence we must have ${lambda}^2 - 1 = 0$ i.e. ${lambda}^2 = 1.$ So $lambda = pm 1.$
So according to my argument above it follows that eigenvalues of a real orthogonal matrix are $pm 1.$ But I think that I am wrong as I know that the eigenvalues of an orthogonal matrix are unit modulus i.e. they lie on the unit circle.
What's going wrong in my argument above. Please help me in this regard.
Thank you very much for your valuable time.
linear-algebra eigenvalues-eigenvectors orthogonal-matrices
$endgroup$
add a comment |
$begingroup$
Let $A$ be a real orthogonal matrix. Then $A^{text T} A = I.$ Let $lambda in Bbb C$ be an eigenvalue of $A$ corresponding to the eigenvector $X in Bbb C^n.$ Then we have
$$begin{align*} X^{text T} A^{text T} A X = X^{text T} X. \ implies (AX)^{text T} AX & = X^{text T} X. \ implies (lambda X)^{text T} lambda X & = X^{text T} X. \ implies {lambda}^2 X^{text T} X & = X^{text T} X. \ implies ({lambda}^2 - 1) X^{text T} X & = 0. end{align*}$$
Since $X$ is an eigenvector $X neq 0.$ Therefore ${|X|_2}^2 = X^{text T} X neq 0.$ Hence we must have ${lambda}^2 - 1 = 0$ i.e. ${lambda}^2 = 1.$ So $lambda = pm 1.$
So according to my argument above it follows that eigenvalues of a real orthogonal matrix are $pm 1.$ But I think that I am wrong as I know that the eigenvalues of an orthogonal matrix are unit modulus i.e. they lie on the unit circle.
What's going wrong in my argument above. Please help me in this regard.
Thank you very much for your valuable time.
linear-algebra eigenvalues-eigenvectors orthogonal-matrices
$endgroup$
add a comment |
$begingroup$
Let $A$ be a real orthogonal matrix. Then $A^{text T} A = I.$ Let $lambda in Bbb C$ be an eigenvalue of $A$ corresponding to the eigenvector $X in Bbb C^n.$ Then we have
$$begin{align*} X^{text T} A^{text T} A X = X^{text T} X. \ implies (AX)^{text T} AX & = X^{text T} X. \ implies (lambda X)^{text T} lambda X & = X^{text T} X. \ implies {lambda}^2 X^{text T} X & = X^{text T} X. \ implies ({lambda}^2 - 1) X^{text T} X & = 0. end{align*}$$
Since $X$ is an eigenvector $X neq 0.$ Therefore ${|X|_2}^2 = X^{text T} X neq 0.$ Hence we must have ${lambda}^2 - 1 = 0$ i.e. ${lambda}^2 = 1.$ So $lambda = pm 1.$
So according to my argument above it follows that eigenvalues of a real orthogonal matrix are $pm 1.$ But I think that I am wrong as I know that the eigenvalues of an orthogonal matrix are unit modulus i.e. they lie on the unit circle.
What's going wrong in my argument above. Please help me in this regard.
Thank you very much for your valuable time.
linear-algebra eigenvalues-eigenvectors orthogonal-matrices
$endgroup$
Let $A$ be a real orthogonal matrix. Then $A^{text T} A = I.$ Let $lambda in Bbb C$ be an eigenvalue of $A$ corresponding to the eigenvector $X in Bbb C^n.$ Then we have
$$begin{align*} X^{text T} A^{text T} A X = X^{text T} X. \ implies (AX)^{text T} AX & = X^{text T} X. \ implies (lambda X)^{text T} lambda X & = X^{text T} X. \ implies {lambda}^2 X^{text T} X & = X^{text T} X. \ implies ({lambda}^2 - 1) X^{text T} X & = 0. end{align*}$$
Since $X$ is an eigenvector $X neq 0.$ Therefore ${|X|_2}^2 = X^{text T} X neq 0.$ Hence we must have ${lambda}^2 - 1 = 0$ i.e. ${lambda}^2 = 1.$ So $lambda = pm 1.$
So according to my argument above it follows that eigenvalues of a real orthogonal matrix are $pm 1.$ But I think that I am wrong as I know that the eigenvalues of an orthogonal matrix are unit modulus i.e. they lie on the unit circle.
What's going wrong in my argument above. Please help me in this regard.
Thank you very much for your valuable time.
linear-algebra eigenvalues-eigenvectors orthogonal-matrices
linear-algebra eigenvalues-eigenvectors orthogonal-matrices
edited Mar 31 at 11:14
Yanko
8,4692830
8,4692830
asked Mar 31 at 5:00
math maniac.math maniac.
1647
1647
add a comment |
add a comment |
1 Answer
1
active
oldest
votes
$begingroup$
The mistake is your assumption that $X^TXne0$. Consider a simple example:
$$A=pmatrix{0&1\-1&0}.$$
It is orthogonal, and its eigenvalues are $pm i$. One eigenvector is
$$X=pmatrix{1\i}.$$
It satisfies $X^TX=0$.
However, replacing $X^T$ in your argument by $X^H$ (complex conjugate
of transpose) will give you the correct conclusion that $|lambda|^2=1$.
$endgroup$
$begingroup$
how can Euclidean norm of non zero vector be zero?
$endgroup$
– math maniac.
Mar 31 at 5:08
2
$begingroup$
@mathmaniac. How can $1^2+i^2$ equal zero?
$endgroup$
– Lord Shark the Unknown
Mar 31 at 5:12
$begingroup$
I think the Euclidean norm of $X in Bbb C^n$ is $sqrt {X^{text T} overline X} text {or} sqrt {{overline X}^{text T} X},$ not $sqrt {X^{text T} X}.$ Am I right?
$endgroup$
– math maniac.
Mar 31 at 5:13
1
$begingroup$
Which is same as $sqrt {X^{text H}X},$ as you have rightly pointed out.
$endgroup$
– math maniac.
Mar 31 at 5:19
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%2f3169070%2feigenvalues-of-a-real-orthogonal-matrix%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$
The mistake is your assumption that $X^TXne0$. Consider a simple example:
$$A=pmatrix{0&1\-1&0}.$$
It is orthogonal, and its eigenvalues are $pm i$. One eigenvector is
$$X=pmatrix{1\i}.$$
It satisfies $X^TX=0$.
However, replacing $X^T$ in your argument by $X^H$ (complex conjugate
of transpose) will give you the correct conclusion that $|lambda|^2=1$.
$endgroup$
$begingroup$
how can Euclidean norm of non zero vector be zero?
$endgroup$
– math maniac.
Mar 31 at 5:08
2
$begingroup$
@mathmaniac. How can $1^2+i^2$ equal zero?
$endgroup$
– Lord Shark the Unknown
Mar 31 at 5:12
$begingroup$
I think the Euclidean norm of $X in Bbb C^n$ is $sqrt {X^{text T} overline X} text {or} sqrt {{overline X}^{text T} X},$ not $sqrt {X^{text T} X}.$ Am I right?
$endgroup$
– math maniac.
Mar 31 at 5:13
1
$begingroup$
Which is same as $sqrt {X^{text H}X},$ as you have rightly pointed out.
$endgroup$
– math maniac.
Mar 31 at 5:19
add a comment |
$begingroup$
The mistake is your assumption that $X^TXne0$. Consider a simple example:
$$A=pmatrix{0&1\-1&0}.$$
It is orthogonal, and its eigenvalues are $pm i$. One eigenvector is
$$X=pmatrix{1\i}.$$
It satisfies $X^TX=0$.
However, replacing $X^T$ in your argument by $X^H$ (complex conjugate
of transpose) will give you the correct conclusion that $|lambda|^2=1$.
$endgroup$
$begingroup$
how can Euclidean norm of non zero vector be zero?
$endgroup$
– math maniac.
Mar 31 at 5:08
2
$begingroup$
@mathmaniac. How can $1^2+i^2$ equal zero?
$endgroup$
– Lord Shark the Unknown
Mar 31 at 5:12
$begingroup$
I think the Euclidean norm of $X in Bbb C^n$ is $sqrt {X^{text T} overline X} text {or} sqrt {{overline X}^{text T} X},$ not $sqrt {X^{text T} X}.$ Am I right?
$endgroup$
– math maniac.
Mar 31 at 5:13
1
$begingroup$
Which is same as $sqrt {X^{text H}X},$ as you have rightly pointed out.
$endgroup$
– math maniac.
Mar 31 at 5:19
add a comment |
$begingroup$
The mistake is your assumption that $X^TXne0$. Consider a simple example:
$$A=pmatrix{0&1\-1&0}.$$
It is orthogonal, and its eigenvalues are $pm i$. One eigenvector is
$$X=pmatrix{1\i}.$$
It satisfies $X^TX=0$.
However, replacing $X^T$ in your argument by $X^H$ (complex conjugate
of transpose) will give you the correct conclusion that $|lambda|^2=1$.
$endgroup$
The mistake is your assumption that $X^TXne0$. Consider a simple example:
$$A=pmatrix{0&1\-1&0}.$$
It is orthogonal, and its eigenvalues are $pm i$. One eigenvector is
$$X=pmatrix{1\i}.$$
It satisfies $X^TX=0$.
However, replacing $X^T$ in your argument by $X^H$ (complex conjugate
of transpose) will give you the correct conclusion that $|lambda|^2=1$.
answered Mar 31 at 5:04
Lord Shark the UnknownLord Shark the Unknown
108k1162136
108k1162136
$begingroup$
how can Euclidean norm of non zero vector be zero?
$endgroup$
– math maniac.
Mar 31 at 5:08
2
$begingroup$
@mathmaniac. How can $1^2+i^2$ equal zero?
$endgroup$
– Lord Shark the Unknown
Mar 31 at 5:12
$begingroup$
I think the Euclidean norm of $X in Bbb C^n$ is $sqrt {X^{text T} overline X} text {or} sqrt {{overline X}^{text T} X},$ not $sqrt {X^{text T} X}.$ Am I right?
$endgroup$
– math maniac.
Mar 31 at 5:13
1
$begingroup$
Which is same as $sqrt {X^{text H}X},$ as you have rightly pointed out.
$endgroup$
– math maniac.
Mar 31 at 5:19
add a comment |
$begingroup$
how can Euclidean norm of non zero vector be zero?
$endgroup$
– math maniac.
Mar 31 at 5:08
2
$begingroup$
@mathmaniac. How can $1^2+i^2$ equal zero?
$endgroup$
– Lord Shark the Unknown
Mar 31 at 5:12
$begingroup$
I think the Euclidean norm of $X in Bbb C^n$ is $sqrt {X^{text T} overline X} text {or} sqrt {{overline X}^{text T} X},$ not $sqrt {X^{text T} X}.$ Am I right?
$endgroup$
– math maniac.
Mar 31 at 5:13
1
$begingroup$
Which is same as $sqrt {X^{text H}X},$ as you have rightly pointed out.
$endgroup$
– math maniac.
Mar 31 at 5:19
$begingroup$
how can Euclidean norm of non zero vector be zero?
$endgroup$
– math maniac.
Mar 31 at 5:08
$begingroup$
how can Euclidean norm of non zero vector be zero?
$endgroup$
– math maniac.
Mar 31 at 5:08
2
2
$begingroup$
@mathmaniac. How can $1^2+i^2$ equal zero?
$endgroup$
– Lord Shark the Unknown
Mar 31 at 5:12
$begingroup$
@mathmaniac. How can $1^2+i^2$ equal zero?
$endgroup$
– Lord Shark the Unknown
Mar 31 at 5:12
$begingroup$
I think the Euclidean norm of $X in Bbb C^n$ is $sqrt {X^{text T} overline X} text {or} sqrt {{overline X}^{text T} X},$ not $sqrt {X^{text T} X}.$ Am I right?
$endgroup$
– math maniac.
Mar 31 at 5:13
$begingroup$
I think the Euclidean norm of $X in Bbb C^n$ is $sqrt {X^{text T} overline X} text {or} sqrt {{overline X}^{text T} X},$ not $sqrt {X^{text T} X}.$ Am I right?
$endgroup$
– math maniac.
Mar 31 at 5:13
1
1
$begingroup$
Which is same as $sqrt {X^{text H}X},$ as you have rightly pointed out.
$endgroup$
– math maniac.
Mar 31 at 5:19
$begingroup$
Which is same as $sqrt {X^{text H}X},$ as you have rightly pointed out.
$endgroup$
– math maniac.
Mar 31 at 5:19
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%2f3169070%2feigenvalues-of-a-real-orthogonal-matrix%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