Let $A$ be complex matrices and $x$ be eigenvalue of $Aoverline{A}$.
$begingroup$
Let $A$ be non-singular $ntimes n$ complex matrices and $x$ be negative eigenvalue of $Aoverline{A}$. Show that algebraic multiplicity of $x$ is even number.
I show that the $det(Aoverline{A})>0$ so numbers of negative eigenvalue is even
. But I stuck to prove algebraic multiplicity of $x$ is even number.
linear-algebra matrices
edited Jan 20 at 15:43
i707107
12.6k21647
asked Jan 18 at 13:34
liolio
20516
$endgroup$
add a comment |
$begingroup$
Let $A$ be non-singular $ntimes n$ complex matrices and $x$ be negative eigenvalue of $Aoverline{A}$. Show that algebraic multiplicity of $x$ is even number.
I show that the $det(Aoverline{A})>0$ so numbers of negative eigenvalue is even
. But I stuck to prove algebraic multiplicity of $x$ is even number.
linear-algebra matrices
edited Jan 20 at 15:43
i707107
12.6k21647
asked Jan 18 at 13:34
liolio
20516
$endgroup$
$begingroup$
What happens if $A$ is $1times 1$?
$endgroup$
– kimchi lover
Jan 18 at 13:57
$begingroup$
@i707107: Perhaps $(A^*)^T$ means $overline A$.?
$endgroup$
– hardmath
Jan 18 at 17:25
$begingroup$
Properties like this usually appearance in the discussion of "consimilarity". For the current problem, see exercise 7(c) in chapter 4.6 on p.253 of the first edition of Horn and Johnson's Matrix Analysis. Their proof makes use of eigenvectors. I believe there is a proof without eigenvectors, but I haven't time to delve into it.
$endgroup$
– user1551
Jan 18 at 18:30
1
$begingroup$
@hardmath yes, because I don’t know how to write like that
$endgroup$
– lio
Jan 19 at 1:18
$begingroup$
@lio. It's best to explain in words. Is it the transpose of the conjugate transpose (so just the conjugate?) or is it just the conjugate transpose of $A$?
$endgroup$
– hardmath
Jan 19 at 1:56
add a comment |
$begingroup$
Let $A$ be non-singular $ntimes n$ complex matrices and $x$ be negative eigenvalue of $Aoverline{A}$. Show that algebraic multiplicity of $x$ is even number.
I show that the $det(Aoverline{A})>0$ so numbers of negative eigenvalue is even
. But I stuck to prove algebraic multiplicity of $x$ is even number.
linear-algebra matrices
edited Jan 20 at 15:43
i707107
12.6k21647
asked Jan 18 at 13:34
liolio
20516
$endgroup$
Let $A$ be non-singular $ntimes n$ complex matrices and $x$ be negative eigenvalue of $Aoverline{A}$. Show that algebraic multiplicity of $x$ is even number.
I show that the $det(Aoverline{A})>0$ so numbers of negative eigenvalue is even
. But I stuck to prove algebraic multiplicity of $x$ is even number.
linear-algebra matrices
linear-algebra matrices
edited Jan 20 at 15:43
i707107
12.6k21647
asked Jan 18 at 13:34
liolio
20516
edited Jan 20 at 15:43
i707107
12.6k21647
asked Jan 18 at 13:34
liolio
20516
edited Jan 20 at 15:43
i707107
12.6k21647
edited Jan 20 at 15:43
i707107
12.6k21647
edited Jan 20 at 15:43
i707107
12.6k21647
12.6k21647
asked Jan 18 at 13:34
liolio
20516
asked Jan 18 at 13:34
liolio
20516
asked Jan 18 at 13:34
liolio
20516
20516
$begingroup$
What happens if $A$ is $1times 1$?
$endgroup$
– kimchi lover
Jan 18 at 13:57
$begingroup$
@i707107: Perhaps $(A^*)^T$ means $overline A$.?
$endgroup$
– hardmath
Jan 18 at 17:25
$begingroup$
Properties like this usually appearance in the discussion of "consimilarity". For the current problem, see exercise 7(c) in chapter 4.6 on p.253 of the first edition of Horn and Johnson's Matrix Analysis. Their proof makes use of eigenvectors. I believe there is a proof without eigenvectors, but I haven't time to delve into it.
$endgroup$
– user1551
Jan 18 at 18:30
1
$begingroup$
@hardmath yes, because I don’t know how to write like that
$endgroup$
– lio
Jan 19 at 1:18
$begingroup$
@lio. It's best to explain in words. Is it the transpose of the conjugate transpose (so just the conjugate?) or is it just the conjugate transpose of $A$?
$endgroup$
– hardmath
Jan 19 at 1:56
add a comment |
$begingroup$
What happens if $A$ is $1times 1$?
$endgroup$
– kimchi lover
Jan 18 at 13:57
$begingroup$
@i707107: Perhaps $(A^*)^T$ means $overline A$.?
$endgroup$
– hardmath
Jan 18 at 17:25
$begingroup$
Properties like this usually appearance in the discussion of "consimilarity". For the current problem, see exercise 7(c) in chapter 4.6 on p.253 of the first edition of Horn and Johnson's Matrix Analysis. Their proof makes use of eigenvectors. I believe there is a proof without eigenvectors, but I haven't time to delve into it.
$endgroup$
– user1551
Jan 18 at 18:30
1
$begingroup$
@hardmath yes, because I don’t know how to write like that
$endgroup$
– lio
Jan 19 at 1:18
$begingroup$
@lio. It's best to explain in words. Is it the transpose of the conjugate transpose (so just the conjugate?) or is it just the conjugate transpose of $A$?
$endgroup$
– hardmath
Jan 19 at 1:56
$begingroup$
What happens if $A$ is $1times 1$?
$endgroup$
– kimchi lover
Jan 18 at 13:57
$begingroup$
What happens if $A$ is $1times 1$?
$endgroup$
– kimchi lover
Jan 18 at 13:57
$begingroup$
@i707107: Perhaps $(A^*)^T$ means $overline A$.?
$endgroup$
– hardmath
Jan 18 at 17:25
$begingroup$
@i707107: Perhaps $(A^*)^T$ means $overline A$.?
$endgroup$
– hardmath
Jan 18 at 17:25
$begingroup$
Properties like this usually appearance in the discussion of "consimilarity". For the current problem, see exercise 7(c) in chapter 4.6 on p.253 of the first edition of Horn and Johnson's Matrix Analysis. Their proof makes use of eigenvectors. I believe there is a proof without eigenvectors, but I haven't time to delve into it.
$endgroup$
– user1551
Jan 18 at 18:30
$begingroup$
Properties like this usually appearance in the discussion of "consimilarity". For the current problem, see exercise 7(c) in chapter 4.6 on p.253 of the first edition of Horn and Johnson's Matrix Analysis. Their proof makes use of eigenvectors. I believe there is a proof without eigenvectors, but I haven't time to delve into it.
$endgroup$
– user1551
Jan 18 at 18:30
1
1
$begingroup$
@hardmath yes, because I don’t know how to write like that
$endgroup$
– lio
Jan 19 at 1:18
$begingroup$
@hardmath yes, because I don’t know how to write like that
$endgroup$
– lio
Jan 19 at 1:18
$begingroup$
@lio. It's best to explain in words. Is it the transpose of the conjugate transpose (so just the conjugate?) or is it just the conjugate transpose of $A$?
$endgroup$
– hardmath
Jan 19 at 1:56
$begingroup$
@lio. It's best to explain in words. Is it the transpose of the conjugate transpose (so just the conjugate?) or is it just the conjugate transpose of $A$?
$endgroup$
– hardmath
Jan 19 at 1:56
add a comment |
1 Answer
1
active
oldest
votes
$begingroup$
$textbf{Proposition.}$ If $Ain M_n(mathbb{C})$ and $lambdain spectrum(Aoverline{A})cap (-infty,0)$, then $lambda$ has an even algebraic multiplicity.
$textbf{Proof}.$ The key is: "there are $Sin GL_n(mathbb{C}),Rin M_n(mathbb{R})$ s.t. $A=S{Roverline{S}};^{-1}$" (Corollary 4.6.15 in Matrix Analysis by Horn,Johnson, cited by user1551 -who has good readings-).
Then $Aoverline{A}=SR^2S^{-1}$ and $spectrum(Aoverline{A})={mu^2;muin spectrum(R)}$ (equality of lists).
Thus $pm isqrt{-lambda}$ are eigenvalues of the real matrix $R$; since they have same multiplicity, $lambda$ has even algebraic multiplicity. $square$
$textbf{Remark}.$ That implies the famous result $det(I+Aoverline{A})geq 0$.
Indeed, $det(I+Aoverline{A})=det(I+R^2)=det((I+iR)(I-iR))$.
answered Jan 19 at 11:40
loup blancloup blanc
24k21852
$endgroup$
add a comment |
Your Answer
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%2f3078251%2flet-a-be-complex-matrices-and-x-be-eigenvalue-of-a-overlinea%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$
$textbf{Proposition.}$ If $Ain M_n(mathbb{C})$ and $lambdain spectrum(Aoverline{A})cap (-infty,0)$, then $lambda$ has an even algebraic multiplicity.
$textbf{Proof}.$ The key is: "there are $Sin GL_n(mathbb{C}),Rin M_n(mathbb{R})$ s.t. $A=S{Roverline{S}};^{-1}$" (Corollary 4.6.15 in Matrix Analysis by Horn,Johnson, cited by user1551 -who has good readings-).
Then $Aoverline{A}=SR^2S^{-1}$ and $spectrum(Aoverline{A})={mu^2;muin spectrum(R)}$ (equality of lists).
Thus $pm isqrt{-lambda}$ are eigenvalues of the real matrix $R$; since they have same multiplicity, $lambda$ has even algebraic multiplicity. $square$
$textbf{Remark}.$ That implies the famous result $det(I+Aoverline{A})geq 0$.
Indeed, $det(I+Aoverline{A})=det(I+R^2)=det((I+iR)(I-iR))$.
answered Jan 19 at 11:40
loup blancloup blanc
24k21852
$endgroup$
add a comment |
$begingroup$
$textbf{Proposition.}$ If $Ain M_n(mathbb{C})$ and $lambdain spectrum(Aoverline{A})cap (-infty,0)$, then $lambda$ has an even algebraic multiplicity.
$textbf{Proof}.$ The key is: "there are $Sin GL_n(mathbb{C}),Rin M_n(mathbb{R})$ s.t. $A=S{Roverline{S}};^{-1}$" (Corollary 4.6.15 in Matrix Analysis by Horn,Johnson, cited by user1551 -who has good readings-).
Then $Aoverline{A}=SR^2S^{-1}$ and $spectrum(Aoverline{A})={mu^2;muin spectrum(R)}$ (equality of lists).
Thus $pm isqrt{-lambda}$ are eigenvalues of the real matrix $R$; since they have same multiplicity, $lambda$ has even algebraic multiplicity. $square$
$textbf{Remark}.$ That implies the famous result $det(I+Aoverline{A})geq 0$.
Indeed, $det(I+Aoverline{A})=det(I+R^2)=det((I+iR)(I-iR))$.
answered Jan 19 at 11:40
loup blancloup blanc
24k21852
$endgroup$
add a comment |
$begingroup$
$textbf{Proposition.}$ If $Ain M_n(mathbb{C})$ and $lambdain spectrum(Aoverline{A})cap (-infty,0)$, then $lambda$ has an even algebraic multiplicity.
$textbf{Proof}.$ The key is: "there are $Sin GL_n(mathbb{C}),Rin M_n(mathbb{R})$ s.t. $A=S{Roverline{S}};^{-1}$" (Corollary 4.6.15 in Matrix Analysis by Horn,Johnson, cited by user1551 -who has good readings-).
Then $Aoverline{A}=SR^2S^{-1}$ and $spectrum(Aoverline{A})={mu^2;muin spectrum(R)}$ (equality of lists).
Thus $pm isqrt{-lambda}$ are eigenvalues of the real matrix $R$; since they have same multiplicity, $lambda$ has even algebraic multiplicity. $square$
$textbf{Remark}.$ That implies the famous result $det(I+Aoverline{A})geq 0$.
Indeed, $det(I+Aoverline{A})=det(I+R^2)=det((I+iR)(I-iR))$.
answered Jan 19 at 11:40
loup blancloup blanc
24k21852
$endgroup$
$textbf{Proposition.}$ If $Ain M_n(mathbb{C})$ and $lambdain spectrum(Aoverline{A})cap (-infty,0)$, then $lambda$ has an even algebraic multiplicity.
$textbf{Proof}.$ The key is: "there are $Sin GL_n(mathbb{C}),Rin M_n(mathbb{R})$ s.t. $A=S{Roverline{S}};^{-1}$" (Corollary 4.6.15 in Matrix Analysis by Horn,Johnson, cited by user1551 -who has good readings-).
Then $Aoverline{A}=SR^2S^{-1}$ and $spectrum(Aoverline{A})={mu^2;muin spectrum(R)}$ (equality of lists).
Thus $pm isqrt{-lambda}$ are eigenvalues of the real matrix $R$; since they have same multiplicity, $lambda$ has even algebraic multiplicity. $square$
$textbf{Remark}.$ That implies the famous result $det(I+Aoverline{A})geq 0$.
Indeed, $det(I+Aoverline{A})=det(I+R^2)=det((I+iR)(I-iR))$.
answered Jan 19 at 11:40
loup blancloup blanc
24k21852
edited Jan 19 at 11:52
answered Jan 19 at 11:40
loup blancloup blanc
24k21852
answered Jan 19 at 11:40
loup blancloup blanc
24k21852
answered Jan 19 at 11:40
loup blancloup blanc
24k21852
24k21852
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%2f3078251%2flet-a-be-complex-matrices-and-x-be-eigenvalue-of-a-overlinea%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$
What happens if $A$ is $1times 1$?
$endgroup$
– kimchi lover
Jan 18 at 13:57
$begingroup$
@i707107: Perhaps $(A^*)^T$ means $overline A$.?
$endgroup$
– hardmath
Jan 18 at 17:25
$begingroup$
Properties like this usually appearance in the discussion of "consimilarity". For the current problem, see exercise 7(c) in chapter 4.6 on p.253 of the first edition of Horn and Johnson's Matrix Analysis. Their proof makes use of eigenvectors. I believe there is a proof without eigenvectors, but I haven't time to delve into it.
$endgroup$
– user1551
Jan 18 at 18:30
1
$begingroup$
@hardmath yes, because I don’t know how to write like that
$endgroup$
– lio
Jan 19 at 1:18
$begingroup$
@lio. It's best to explain in words. Is it the transpose of the conjugate transpose (so just the conjugate?) or is it just the conjugate transpose of $A$?
$endgroup$
– hardmath
Jan 19 at 1:56