Sum of symmetric, positive semidefinite matricesDoes this conic combination generate all $ntimes n$ real symmetric positive-semidefinite matrices?A is symmetric iff A=P-Q, where P,Q are positive definite matricesCriterion for positive semidefinite matricesAnother property of symmetric positive semidefinite matricesSum of rank-$k$ positive semidefinite matrices is at least of rank $k$Simultaneous Diagonalization of Symmetric Positive Semidefinite matricesA question about Hermitian and positive semidefinite matricesIs this matrix product positive semidefinite?Sum of rank 1 positive semidefinite and negative semidefinite matricesPositive semidefinite matrix using Schur Complement
Should I take out a loan for a friend to invest on my behalf?
Doesn't allowing a user mode program to access kernel space memory and execute the IN and OUT instructions defeat the purpose of having CPU modes?
How do spaceships determine each other's mass in space?
School performs periodic password audits. Is my password compromised?
Can I use a violin G string for D?
How to write a chaotic neutral protagonist and prevent my readers from thinking they are evil?
Finitely many repeated replacements
Are small insurances worth it?
Are there historical instances of the capital of a colonising country being temporarily or permanently shifted to one of its colonies?
Windows Server Datacenter Edition - Unlimited Virtual Machines
Does Christianity allow for believing on someone else's behalf?
What can I do if someone tampers with my SSH public key?
Confusion about Complex Continued Fraction
Rationale to prefer local variables over instance variables?
Why couldn't the separatists legally leave the Republic?
Plausibility of Mushroom Buildings
Did Amazon pay $0 in taxes last year?
Which situations would cause a company to ground or recall a aircraft series?
How can I get players to focus on the story aspect of D&D?
How do we create new idioms and use them in a novel?
How can I manipulate the output of Information?
What will happen if my luggage gets delayed?
Shifting between bemols (flats) and diesis (sharps)in the key signature
Was it really inappropriate to write a pull request for the company I interviewed with?
Sum of symmetric, positive semidefinite matrices
Does this conic combination generate all $ntimes n$ real symmetric positive-semidefinite matrices?A is symmetric iff A=P-Q, where P,Q are positive definite matricesCriterion for positive semidefinite matricesAnother property of symmetric positive semidefinite matricesSum of rank-$k$ positive semidefinite matrices is at least of rank $k$Simultaneous Diagonalization of Symmetric Positive Semidefinite matricesA question about Hermitian and positive semidefinite matricesIs this matrix product positive semidefinite?Sum of rank 1 positive semidefinite and negative semidefinite matricesPositive semidefinite matrix using Schur Complement
$begingroup$
Let $A in mathbbR^m times n, B in mathbbR^p times n$. Show that $A^TA+ B^TB$ is invertible if and only if $ker A cap ker B =lbrace 0 rbrace$.
I could show that if it's invertible, then $ker A cap ker B= lbrace 0 rbrace$. Any help for the converse?
linear-algebra matrices symmetric-matrices positive-semidefinite
$endgroup$
add a comment |
$begingroup$
Let $A in mathbbR^m times n, B in mathbbR^p times n$. Show that $A^TA+ B^TB$ is invertible if and only if $ker A cap ker B =lbrace 0 rbrace$.
I could show that if it's invertible, then $ker A cap ker B= lbrace 0 rbrace$. Any help for the converse?
linear-algebra matrices symmetric-matrices positive-semidefinite
$endgroup$
$begingroup$
How did you show the forward direction? Possibly the converse can be shown similarly.
$endgroup$
– Minus One-Twelfth
yesterday
add a comment |
$begingroup$
Let $A in mathbbR^m times n, B in mathbbR^p times n$. Show that $A^TA+ B^TB$ is invertible if and only if $ker A cap ker B =lbrace 0 rbrace$.
I could show that if it's invertible, then $ker A cap ker B= lbrace 0 rbrace$. Any help for the converse?
linear-algebra matrices symmetric-matrices positive-semidefinite
$endgroup$
Let $A in mathbbR^m times n, B in mathbbR^p times n$. Show that $A^TA+ B^TB$ is invertible if and only if $ker A cap ker B =lbrace 0 rbrace$.
I could show that if it's invertible, then $ker A cap ker B= lbrace 0 rbrace$. Any help for the converse?
linear-algebra matrices symmetric-matrices positive-semidefinite
linear-algebra matrices symmetric-matrices positive-semidefinite
edited yesterday
Rodrigo de Azevedo
13k41960
13k41960
asked yesterday
mich95mich95
6,97211126
6,97211126
$begingroup$
How did you show the forward direction? Possibly the converse can be shown similarly.
$endgroup$
– Minus One-Twelfth
yesterday
add a comment |
$begingroup$
How did you show the forward direction? Possibly the converse can be shown similarly.
$endgroup$
– Minus One-Twelfth
yesterday
$begingroup$
How did you show the forward direction? Possibly the converse can be shown similarly.
$endgroup$
– Minus One-Twelfth
yesterday
$begingroup$
How did you show the forward direction? Possibly the converse can be shown similarly.
$endgroup$
– Minus One-Twelfth
yesterday
add a comment |
2 Answers
2
active
oldest
votes
$begingroup$
$newcommandmathbf0newcommandxmathbfx$Hints: Recall or try and show that $colorbluex^T M^T Mx = 0text iff x in ker M$ for any matrix $M$, and recall that for any square matrix, it is invertible iff its kernel is $$. Then to show the converse, your goal is to show that if $ker A cap ker B = $, then $A^T A + B^T B$ has kernel $ $. To show this, suppose that $x in kerleft(A^T A + B^T Bright)$ and try and deduce that $x = $. Note also that $x^T left(A^T A + B^T Bright) x = x^T A^T A x + x^T B^T Bx$.
$endgroup$
add a comment |
$begingroup$
Here's an approach: suppose that $A^TA + B^TB$ is not invertible. Then, there exists a non-zero vector $x$ such that $(A^TA + B^TB)x = 0$. It follows that
$$
0 = x^T(A^TA + B^TB)x = (Ax)^T(Ax) + (Bx)^T(Bx) = |Ax|^2 + |Bx|^2
$$
conclude that $x in ker(A) cap ker(B)$.
$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%2f3140987%2fsum-of-symmetric-positive-semidefinite-matrices%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$
$newcommandmathbf0newcommandxmathbfx$Hints: Recall or try and show that $colorbluex^T M^T Mx = 0text iff x in ker M$ for any matrix $M$, and recall that for any square matrix, it is invertible iff its kernel is $$. Then to show the converse, your goal is to show that if $ker A cap ker B = $, then $A^T A + B^T B$ has kernel $ $. To show this, suppose that $x in kerleft(A^T A + B^T Bright)$ and try and deduce that $x = $. Note also that $x^T left(A^T A + B^T Bright) x = x^T A^T A x + x^T B^T Bx$.
$endgroup$
add a comment |
$begingroup$
$newcommandmathbf0newcommandxmathbfx$Hints: Recall or try and show that $colorbluex^T M^T Mx = 0text iff x in ker M$ for any matrix $M$, and recall that for any square matrix, it is invertible iff its kernel is $$. Then to show the converse, your goal is to show that if $ker A cap ker B = $, then $A^T A + B^T B$ has kernel $ $. To show this, suppose that $x in kerleft(A^T A + B^T Bright)$ and try and deduce that $x = $. Note also that $x^T left(A^T A + B^T Bright) x = x^T A^T A x + x^T B^T Bx$.
$endgroup$
add a comment |
$begingroup$
$newcommandmathbf0newcommandxmathbfx$Hints: Recall or try and show that $colorbluex^T M^T Mx = 0text iff x in ker M$ for any matrix $M$, and recall that for any square matrix, it is invertible iff its kernel is $$. Then to show the converse, your goal is to show that if $ker A cap ker B = $, then $A^T A + B^T B$ has kernel $ $. To show this, suppose that $x in kerleft(A^T A + B^T Bright)$ and try and deduce that $x = $. Note also that $x^T left(A^T A + B^T Bright) x = x^T A^T A x + x^T B^T Bx$.
$endgroup$
$newcommandmathbf0newcommandxmathbfx$Hints: Recall or try and show that $colorbluex^T M^T Mx = 0text iff x in ker M$ for any matrix $M$, and recall that for any square matrix, it is invertible iff its kernel is $$. Then to show the converse, your goal is to show that if $ker A cap ker B = $, then $A^T A + B^T B$ has kernel $ $. To show this, suppose that $x in kerleft(A^T A + B^T Bright)$ and try and deduce that $x = $. Note also that $x^T left(A^T A + B^T Bright) x = x^T A^T A x + x^T B^T Bx$.
edited yesterday
answered yesterday
Minus One-TwelfthMinus One-Twelfth
2,07219
2,07219
add a comment |
add a comment |
$begingroup$
Here's an approach: suppose that $A^TA + B^TB$ is not invertible. Then, there exists a non-zero vector $x$ such that $(A^TA + B^TB)x = 0$. It follows that
$$
0 = x^T(A^TA + B^TB)x = (Ax)^T(Ax) + (Bx)^T(Bx) = |Ax|^2 + |Bx|^2
$$
conclude that $x in ker(A) cap ker(B)$.
$endgroup$
add a comment |
$begingroup$
Here's an approach: suppose that $A^TA + B^TB$ is not invertible. Then, there exists a non-zero vector $x$ such that $(A^TA + B^TB)x = 0$. It follows that
$$
0 = x^T(A^TA + B^TB)x = (Ax)^T(Ax) + (Bx)^T(Bx) = |Ax|^2 + |Bx|^2
$$
conclude that $x in ker(A) cap ker(B)$.
$endgroup$
add a comment |
$begingroup$
Here's an approach: suppose that $A^TA + B^TB$ is not invertible. Then, there exists a non-zero vector $x$ such that $(A^TA + B^TB)x = 0$. It follows that
$$
0 = x^T(A^TA + B^TB)x = (Ax)^T(Ax) + (Bx)^T(Bx) = |Ax|^2 + |Bx|^2
$$
conclude that $x in ker(A) cap ker(B)$.
$endgroup$
Here's an approach: suppose that $A^TA + B^TB$ is not invertible. Then, there exists a non-zero vector $x$ such that $(A^TA + B^TB)x = 0$. It follows that
$$
0 = x^T(A^TA + B^TB)x = (Ax)^T(Ax) + (Bx)^T(Bx) = |Ax|^2 + |Bx|^2
$$
conclude that $x in ker(A) cap ker(B)$.
answered yesterday
OmnomnomnomOmnomnomnom
128k791186
128k791186
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%2f3140987%2fsum-of-symmetric-positive-semidefinite-matrices%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$
How did you show the forward direction? Possibly the converse can be shown similarly.
$endgroup$
– Minus One-Twelfth
yesterday