Is a square zero matrix positive semidefinite?
$begingroup$
Does the fact that a square zero matrix contains non-negative eigenvalues (zeros) make it proper to say it is positive semidefinite?
linear-algebra matrices positive-semidefinite
$endgroup$
add a comment |
$begingroup$
Does the fact that a square zero matrix contains non-negative eigenvalues (zeros) make it proper to say it is positive semidefinite?
linear-algebra matrices positive-semidefinite
$endgroup$
add a comment |
$begingroup$
Does the fact that a square zero matrix contains non-negative eigenvalues (zeros) make it proper to say it is positive semidefinite?
linear-algebra matrices positive-semidefinite
$endgroup$
Does the fact that a square zero matrix contains non-negative eigenvalues (zeros) make it proper to say it is positive semidefinite?
linear-algebra matrices positive-semidefinite
linear-algebra matrices positive-semidefinite
edited Mar 18 at 19:25
Kay
asked Mar 18 at 19:11
KayKay
647
647
add a comment |
add a comment |
2 Answers
2
active
oldest
votes
$begingroup$
The $n times n$ zero matrix is positive semidefinite and negative semidefinite.
$endgroup$
add a comment |
$begingroup$
"When in doubt, go back to the basic definitions"! The definition of "positive semi-definite" is "all eigen-values are non-negative". The eigenvalues or the zero matrix are all 0 so, yes, the zero matrix is positive semi-definite. And, as Gary Moon said, it is also negative semi-definite.
$endgroup$
2
$begingroup$
Nitpicking, the definition of "positive-semidefinite" is "a symmetric matrix $A$ with $vec x^{mathsf T}!Avec x ge 0$ for all $vec x in mathbb R^n$." The eigenvalue test is equivalent to this, but is not the definition.
$endgroup$
– Misha Lavrov
Mar 19 at 3:56
$begingroup$
@Misha Lavrov Nitpicking the nitpicking. Because both are equivalent, either can be taken as the definition, so some authors could choose the nonnegative eigenvalue criterion as the definition of positive-semidefinite. Anyhow, this is so presuming attention is restricted to symmetric matrices.
$endgroup$
– Mark L. Stone
Mar 24 at 11:41
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%2f3153187%2fis-a-square-zero-matrix-positive-semidefinite%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 $n times n$ zero matrix is positive semidefinite and negative semidefinite.
$endgroup$
add a comment |
$begingroup$
The $n times n$ zero matrix is positive semidefinite and negative semidefinite.
$endgroup$
add a comment |
$begingroup$
The $n times n$ zero matrix is positive semidefinite and negative semidefinite.
$endgroup$
The $n times n$ zero matrix is positive semidefinite and negative semidefinite.
answered Mar 18 at 19:23
Gary MoonGary Moon
89616
89616
add a comment |
add a comment |
$begingroup$
"When in doubt, go back to the basic definitions"! The definition of "positive semi-definite" is "all eigen-values are non-negative". The eigenvalues or the zero matrix are all 0 so, yes, the zero matrix is positive semi-definite. And, as Gary Moon said, it is also negative semi-definite.
$endgroup$
2
$begingroup$
Nitpicking, the definition of "positive-semidefinite" is "a symmetric matrix $A$ with $vec x^{mathsf T}!Avec x ge 0$ for all $vec x in mathbb R^n$." The eigenvalue test is equivalent to this, but is not the definition.
$endgroup$
– Misha Lavrov
Mar 19 at 3:56
$begingroup$
@Misha Lavrov Nitpicking the nitpicking. Because both are equivalent, either can be taken as the definition, so some authors could choose the nonnegative eigenvalue criterion as the definition of positive-semidefinite. Anyhow, this is so presuming attention is restricted to symmetric matrices.
$endgroup$
– Mark L. Stone
Mar 24 at 11:41
add a comment |
$begingroup$
"When in doubt, go back to the basic definitions"! The definition of "positive semi-definite" is "all eigen-values are non-negative". The eigenvalues or the zero matrix are all 0 so, yes, the zero matrix is positive semi-definite. And, as Gary Moon said, it is also negative semi-definite.
$endgroup$
2
$begingroup$
Nitpicking, the definition of "positive-semidefinite" is "a symmetric matrix $A$ with $vec x^{mathsf T}!Avec x ge 0$ for all $vec x in mathbb R^n$." The eigenvalue test is equivalent to this, but is not the definition.
$endgroup$
– Misha Lavrov
Mar 19 at 3:56
$begingroup$
@Misha Lavrov Nitpicking the nitpicking. Because both are equivalent, either can be taken as the definition, so some authors could choose the nonnegative eigenvalue criterion as the definition of positive-semidefinite. Anyhow, this is so presuming attention is restricted to symmetric matrices.
$endgroup$
– Mark L. Stone
Mar 24 at 11:41
add a comment |
$begingroup$
"When in doubt, go back to the basic definitions"! The definition of "positive semi-definite" is "all eigen-values are non-negative". The eigenvalues or the zero matrix are all 0 so, yes, the zero matrix is positive semi-definite. And, as Gary Moon said, it is also negative semi-definite.
$endgroup$
"When in doubt, go back to the basic definitions"! The definition of "positive semi-definite" is "all eigen-values are non-negative". The eigenvalues or the zero matrix are all 0 so, yes, the zero matrix is positive semi-definite. And, as Gary Moon said, it is also negative semi-definite.
answered Mar 18 at 19:35
user247327user247327
11.6k1516
11.6k1516
2
$begingroup$
Nitpicking, the definition of "positive-semidefinite" is "a symmetric matrix $A$ with $vec x^{mathsf T}!Avec x ge 0$ for all $vec x in mathbb R^n$." The eigenvalue test is equivalent to this, but is not the definition.
$endgroup$
– Misha Lavrov
Mar 19 at 3:56
$begingroup$
@Misha Lavrov Nitpicking the nitpicking. Because both are equivalent, either can be taken as the definition, so some authors could choose the nonnegative eigenvalue criterion as the definition of positive-semidefinite. Anyhow, this is so presuming attention is restricted to symmetric matrices.
$endgroup$
– Mark L. Stone
Mar 24 at 11:41
add a comment |
2
$begingroup$
Nitpicking, the definition of "positive-semidefinite" is "a symmetric matrix $A$ with $vec x^{mathsf T}!Avec x ge 0$ for all $vec x in mathbb R^n$." The eigenvalue test is equivalent to this, but is not the definition.
$endgroup$
– Misha Lavrov
Mar 19 at 3:56
$begingroup$
@Misha Lavrov Nitpicking the nitpicking. Because both are equivalent, either can be taken as the definition, so some authors could choose the nonnegative eigenvalue criterion as the definition of positive-semidefinite. Anyhow, this is so presuming attention is restricted to symmetric matrices.
$endgroup$
– Mark L. Stone
Mar 24 at 11:41
2
2
$begingroup$
Nitpicking, the definition of "positive-semidefinite" is "a symmetric matrix $A$ with $vec x^{mathsf T}!Avec x ge 0$ for all $vec x in mathbb R^n$." The eigenvalue test is equivalent to this, but is not the definition.
$endgroup$
– Misha Lavrov
Mar 19 at 3:56
$begingroup$
Nitpicking, the definition of "positive-semidefinite" is "a symmetric matrix $A$ with $vec x^{mathsf T}!Avec x ge 0$ for all $vec x in mathbb R^n$." The eigenvalue test is equivalent to this, but is not the definition.
$endgroup$
– Misha Lavrov
Mar 19 at 3:56
$begingroup$
@Misha Lavrov Nitpicking the nitpicking. Because both are equivalent, either can be taken as the definition, so some authors could choose the nonnegative eigenvalue criterion as the definition of positive-semidefinite. Anyhow, this is so presuming attention is restricted to symmetric matrices.
$endgroup$
– Mark L. Stone
Mar 24 at 11:41
$begingroup$
@Misha Lavrov Nitpicking the nitpicking. Because both are equivalent, either can be taken as the definition, so some authors could choose the nonnegative eigenvalue criterion as the definition of positive-semidefinite. Anyhow, this is so presuming attention is restricted to symmetric matrices.
$endgroup$
– Mark L. Stone
Mar 24 at 11:41
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%2f3153187%2fis-a-square-zero-matrix-positive-semidefinite%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