If I have a positive definite matrix X. How do i show that X$^2$ and X$^{-1}$ are also positive definite?
$begingroup$
To my understanding a positive definite matrix is a real symmetric square matrix where all eigenvalues are positive.
Therefore for a matrix A and vector v
$Av = {lambda}v$ where $lambda$ is an eigenvalue of A
so $det({lambda}{I_n} - A)=0$.
My next thought would trying to see how the formula changes when A is now A$^2$ and A$^{-1}$, but I'm getting nowhere.
linear-algebra matrices eigenvalues-eigenvectors positive-definite symmetric-matrices
$endgroup$
add a comment |
$begingroup$
To my understanding a positive definite matrix is a real symmetric square matrix where all eigenvalues are positive.
Therefore for a matrix A and vector v
$Av = {lambda}v$ where $lambda$ is an eigenvalue of A
so $det({lambda}{I_n} - A)=0$.
My next thought would trying to see how the formula changes when A is now A$^2$ and A$^{-1}$, but I'm getting nowhere.
linear-algebra matrices eigenvalues-eigenvectors positive-definite symmetric-matrices
$endgroup$
add a comment |
$begingroup$
To my understanding a positive definite matrix is a real symmetric square matrix where all eigenvalues are positive.
Therefore for a matrix A and vector v
$Av = {lambda}v$ where $lambda$ is an eigenvalue of A
so $det({lambda}{I_n} - A)=0$.
My next thought would trying to see how the formula changes when A is now A$^2$ and A$^{-1}$, but I'm getting nowhere.
linear-algebra matrices eigenvalues-eigenvectors positive-definite symmetric-matrices
$endgroup$
To my understanding a positive definite matrix is a real symmetric square matrix where all eigenvalues are positive.
Therefore for a matrix A and vector v
$Av = {lambda}v$ where $lambda$ is an eigenvalue of A
so $det({lambda}{I_n} - A)=0$.
My next thought would trying to see how the formula changes when A is now A$^2$ and A$^{-1}$, but I'm getting nowhere.
linear-algebra matrices eigenvalues-eigenvectors positive-definite symmetric-matrices
linear-algebra matrices eigenvalues-eigenvectors positive-definite symmetric-matrices
asked Jan 8 at 16:03
L GL G
248
248
add a comment |
add a comment |
3 Answers
3
active
oldest
votes
$begingroup$
Another definition is that a symmetric matrix $M in mathbb R^{n times n}$ is positive definite if and only if $v^T M v > 0$ for all nonzero vectors $v in mathbb R^n$.
Notice that
begin{align}
v^T A^2 v &= v^T A^T A v \
&= u^T u \
&= |u|^2
end{align}
where $u = Av$.
If $v neq 0$ then $u neq 0$, so $|u|^2 > 0$. This shows that $A^2$ is positive definite.
We can show that $A^{-1}$ is positive definite by noting that
$$
v^T A^{-1} v = v^T A^{-1} A A^{-1} v = u^T A u
$$
where $u = A^{-1}v$. If $v neq 0$ then $u neq 0$, so $u^T A u > 0$.
$endgroup$
$begingroup$
Thanks a lot this really clears it up, i forgot about that definition but it makes perfect sense
$endgroup$
– L G
Jan 8 at 16:33
add a comment |
$begingroup$
For a pos.def. matrix $A$, you have (necessary and sufficient) that for any real vector $v$, that $v A v ge 0$.
Now $ v A^{-1} A v = v (A^{-1} A A^{-1}) v =(v A^{-1}) A (A^{-1} v ) = u A u > 0 $.
$A^2$ is even easier: $v A^2 v = v A A v = (v A) (A v) = u^2> 0$
$endgroup$
add a comment |
$begingroup$
Suppose that the eigenvalues of $A$ are $lambda_1,ldots,lambda_n$ with eigenvectors $v_1,ldots,v_n$. Note that $$A^2 v_i = lambda_i A v_i$ = lambda_i^2 v_i$$ and that $$Av_i = lambda_i v_i Rightarrow A^{-1}v_i = lambda^{-1}v_i$$ Therefore the eigenvalues of $A^2$ are $lambda_1^2,ldots,lambda_n^2$ and the eigenvalues of $A^{-1}$ are $lambda_1^{-1},ldots,lambda_n^{-1}$. This should be enough to prove that $A^2$ and $A^{-1}$ are positive definite.
$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%2f3066353%2fif-i-have-a-positive-definite-matrix-x-how-do-i-show-that-x2-and-x-1-ar%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
$begingroup$
Another definition is that a symmetric matrix $M in mathbb R^{n times n}$ is positive definite if and only if $v^T M v > 0$ for all nonzero vectors $v in mathbb R^n$.
Notice that
begin{align}
v^T A^2 v &= v^T A^T A v \
&= u^T u \
&= |u|^2
end{align}
where $u = Av$.
If $v neq 0$ then $u neq 0$, so $|u|^2 > 0$. This shows that $A^2$ is positive definite.
We can show that $A^{-1}$ is positive definite by noting that
$$
v^T A^{-1} v = v^T A^{-1} A A^{-1} v = u^T A u
$$
where $u = A^{-1}v$. If $v neq 0$ then $u neq 0$, so $u^T A u > 0$.
$endgroup$
$begingroup$
Thanks a lot this really clears it up, i forgot about that definition but it makes perfect sense
$endgroup$
– L G
Jan 8 at 16:33
add a comment |
$begingroup$
Another definition is that a symmetric matrix $M in mathbb R^{n times n}$ is positive definite if and only if $v^T M v > 0$ for all nonzero vectors $v in mathbb R^n$.
Notice that
begin{align}
v^T A^2 v &= v^T A^T A v \
&= u^T u \
&= |u|^2
end{align}
where $u = Av$.
If $v neq 0$ then $u neq 0$, so $|u|^2 > 0$. This shows that $A^2$ is positive definite.
We can show that $A^{-1}$ is positive definite by noting that
$$
v^T A^{-1} v = v^T A^{-1} A A^{-1} v = u^T A u
$$
where $u = A^{-1}v$. If $v neq 0$ then $u neq 0$, so $u^T A u > 0$.
$endgroup$
$begingroup$
Thanks a lot this really clears it up, i forgot about that definition but it makes perfect sense
$endgroup$
– L G
Jan 8 at 16:33
add a comment |
$begingroup$
Another definition is that a symmetric matrix $M in mathbb R^{n times n}$ is positive definite if and only if $v^T M v > 0$ for all nonzero vectors $v in mathbb R^n$.
Notice that
begin{align}
v^T A^2 v &= v^T A^T A v \
&= u^T u \
&= |u|^2
end{align}
where $u = Av$.
If $v neq 0$ then $u neq 0$, so $|u|^2 > 0$. This shows that $A^2$ is positive definite.
We can show that $A^{-1}$ is positive definite by noting that
$$
v^T A^{-1} v = v^T A^{-1} A A^{-1} v = u^T A u
$$
where $u = A^{-1}v$. If $v neq 0$ then $u neq 0$, so $u^T A u > 0$.
$endgroup$
Another definition is that a symmetric matrix $M in mathbb R^{n times n}$ is positive definite if and only if $v^T M v > 0$ for all nonzero vectors $v in mathbb R^n$.
Notice that
begin{align}
v^T A^2 v &= v^T A^T A v \
&= u^T u \
&= |u|^2
end{align}
where $u = Av$.
If $v neq 0$ then $u neq 0$, so $|u|^2 > 0$. This shows that $A^2$ is positive definite.
We can show that $A^{-1}$ is positive definite by noting that
$$
v^T A^{-1} v = v^T A^{-1} A A^{-1} v = u^T A u
$$
where $u = A^{-1}v$. If $v neq 0$ then $u neq 0$, so $u^T A u > 0$.
edited Jan 8 at 16:49
answered Jan 8 at 16:15
littleOlittleO
29.6k646109
29.6k646109
$begingroup$
Thanks a lot this really clears it up, i forgot about that definition but it makes perfect sense
$endgroup$
– L G
Jan 8 at 16:33
add a comment |
$begingroup$
Thanks a lot this really clears it up, i forgot about that definition but it makes perfect sense
$endgroup$
– L G
Jan 8 at 16:33
$begingroup$
Thanks a lot this really clears it up, i forgot about that definition but it makes perfect sense
$endgroup$
– L G
Jan 8 at 16:33
$begingroup$
Thanks a lot this really clears it up, i forgot about that definition but it makes perfect sense
$endgroup$
– L G
Jan 8 at 16:33
add a comment |
$begingroup$
For a pos.def. matrix $A$, you have (necessary and sufficient) that for any real vector $v$, that $v A v ge 0$.
Now $ v A^{-1} A v = v (A^{-1} A A^{-1}) v =(v A^{-1}) A (A^{-1} v ) = u A u > 0 $.
$A^2$ is even easier: $v A^2 v = v A A v = (v A) (A v) = u^2> 0$
$endgroup$
add a comment |
$begingroup$
For a pos.def. matrix $A$, you have (necessary and sufficient) that for any real vector $v$, that $v A v ge 0$.
Now $ v A^{-1} A v = v (A^{-1} A A^{-1}) v =(v A^{-1}) A (A^{-1} v ) = u A u > 0 $.
$A^2$ is even easier: $v A^2 v = v A A v = (v A) (A v) = u^2> 0$
$endgroup$
add a comment |
$begingroup$
For a pos.def. matrix $A$, you have (necessary and sufficient) that for any real vector $v$, that $v A v ge 0$.
Now $ v A^{-1} A v = v (A^{-1} A A^{-1}) v =(v A^{-1}) A (A^{-1} v ) = u A u > 0 $.
$A^2$ is even easier: $v A^2 v = v A A v = (v A) (A v) = u^2> 0$
$endgroup$
For a pos.def. matrix $A$, you have (necessary and sufficient) that for any real vector $v$, that $v A v ge 0$.
Now $ v A^{-1} A v = v (A^{-1} A A^{-1}) v =(v A^{-1}) A (A^{-1} v ) = u A u > 0 $.
$A^2$ is even easier: $v A^2 v = v A A v = (v A) (A v) = u^2> 0$
answered Jan 8 at 16:18
AndreasAndreas
7,8661037
7,8661037
add a comment |
add a comment |
$begingroup$
Suppose that the eigenvalues of $A$ are $lambda_1,ldots,lambda_n$ with eigenvectors $v_1,ldots,v_n$. Note that $$A^2 v_i = lambda_i A v_i$ = lambda_i^2 v_i$$ and that $$Av_i = lambda_i v_i Rightarrow A^{-1}v_i = lambda^{-1}v_i$$ Therefore the eigenvalues of $A^2$ are $lambda_1^2,ldots,lambda_n^2$ and the eigenvalues of $A^{-1}$ are $lambda_1^{-1},ldots,lambda_n^{-1}$. This should be enough to prove that $A^2$ and $A^{-1}$ are positive definite.
$endgroup$
add a comment |
$begingroup$
Suppose that the eigenvalues of $A$ are $lambda_1,ldots,lambda_n$ with eigenvectors $v_1,ldots,v_n$. Note that $$A^2 v_i = lambda_i A v_i$ = lambda_i^2 v_i$$ and that $$Av_i = lambda_i v_i Rightarrow A^{-1}v_i = lambda^{-1}v_i$$ Therefore the eigenvalues of $A^2$ are $lambda_1^2,ldots,lambda_n^2$ and the eigenvalues of $A^{-1}$ are $lambda_1^{-1},ldots,lambda_n^{-1}$. This should be enough to prove that $A^2$ and $A^{-1}$ are positive definite.
$endgroup$
add a comment |
$begingroup$
Suppose that the eigenvalues of $A$ are $lambda_1,ldots,lambda_n$ with eigenvectors $v_1,ldots,v_n$. Note that $$A^2 v_i = lambda_i A v_i$ = lambda_i^2 v_i$$ and that $$Av_i = lambda_i v_i Rightarrow A^{-1}v_i = lambda^{-1}v_i$$ Therefore the eigenvalues of $A^2$ are $lambda_1^2,ldots,lambda_n^2$ and the eigenvalues of $A^{-1}$ are $lambda_1^{-1},ldots,lambda_n^{-1}$. This should be enough to prove that $A^2$ and $A^{-1}$ are positive definite.
$endgroup$
Suppose that the eigenvalues of $A$ are $lambda_1,ldots,lambda_n$ with eigenvectors $v_1,ldots,v_n$. Note that $$A^2 v_i = lambda_i A v_i$ = lambda_i^2 v_i$$ and that $$Av_i = lambda_i v_i Rightarrow A^{-1}v_i = lambda^{-1}v_i$$ Therefore the eigenvalues of $A^2$ are $lambda_1^2,ldots,lambda_n^2$ and the eigenvalues of $A^{-1}$ are $lambda_1^{-1},ldots,lambda_n^{-1}$. This should be enough to prove that $A^2$ and $A^{-1}$ are positive definite.
answered Jan 8 at 16:16
ODFODF
1,461510
1,461510
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%2f3066353%2fif-i-have-a-positive-definite-matrix-x-how-do-i-show-that-x2-and-x-1-ar%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