Orthogonal decomposition with a special inner productEigenvalue decomposition under a different inner-product for orthonormalizationIndefinite inner product spaces?What am I doing wrong? inner productInner product in Maschke's TheoremOperator norm of symmetric Matrix in Hilbert Space with Hermitian Inner ProductHow do different inner products give different angles?Is every linear projection orthogonal with respect to some inner product?Non-standard inner product on $mathbbR^n$Is every inner product defined by a matrix? Intuition?Eigendecomposition of Self-Adjoint Operator with Non-Positive Inner Product
Did Amazon pay $0 in taxes last year?
Is it a Cyclops number? "Nobody" knows!
Why restrict private health insurance?
How do you make a gun that shoots melee weapons and/or swords?
What is the orbit and expected lifetime of Crew Dragon trunk?
3.5% Interest Student Loan or use all of my savings on Tuition?
How to make sure I'm assertive enough in contact with subordinates?
Why aren't there more Gauls like Obelix?
Inorganic chemistry handbook with reaction lists
Why is there an extra space when I type "ls" on the Desktop?
Is there a math expression equivalent to the conditional ternary operator?
Sort array by month and year
Precision notation for voltmeters
Why do we say 'Pairwise Disjoint', rather than 'Disjoint'?
Giving a talk in my old university, how prominently should I tell students my salary?
Unfamiliar notation in Diabelli's "Duet in D" for piano
ESPP--any reason not to go all in?
Paper published similar to PhD thesis
A vote on the Brexit backstop
Why does this boat have a landing pad? (SpaceX's GO Searcher) Any plans for propulsive capsule landings?
Vector-transposing function
Will the concrete slab in a partially heated shed conduct a lot of heat to the unconditioned area?
I've given my players a lot of magic items. Is it reasonable for me to give them harder encounters?
How can I have x-axis ticks that show ticks scaled in powers of ten?
Orthogonal decomposition with a special inner product
Eigenvalue decomposition under a different inner-product for orthonormalizationIndefinite inner product spaces?What am I doing wrong? inner productInner product in Maschke's TheoremOperator norm of symmetric Matrix in Hilbert Space with Hermitian Inner ProductHow do different inner products give different angles?Is every linear projection orthogonal with respect to some inner product?Non-standard inner product on $mathbbR^n$Is every inner product defined by a matrix? Intuition?Eigendecomposition of Self-Adjoint Operator with Non-Positive Inner Product
$begingroup$
Assume that we are working on $mathbbR^p$ with an inner product induced by the positive definite matrix $mathbfG$, i.e. for $mathbff, mathbfg in mathbbR^p$ we define $langle mathbff, mathbfg rangle_mathbfG = mathbff^top mathbfG mathbfg$. This is of course a valid inner product in view of the positive-definiteness of $mathbfG$. My question is, given the null-space of another matrix $mathbfA$-let's call it $N(mathbfA)$, can we write
$$mathbff = mathbff_1 + mathbff_2,$$
with $mathbff_2 in N(mathbfA), f_1 in N(mathbfA)^perp$ and $langle mathbff_1, mathbff_2 rangle_mathbfG = 0$? In other words, is this special but important case covered by the projection theorem? Thank you very much for your help.
linear-algebra hilbert-spaces projection
$endgroup$
add a comment |
$begingroup$
Assume that we are working on $mathbbR^p$ with an inner product induced by the positive definite matrix $mathbfG$, i.e. for $mathbff, mathbfg in mathbbR^p$ we define $langle mathbff, mathbfg rangle_mathbfG = mathbff^top mathbfG mathbfg$. This is of course a valid inner product in view of the positive-definiteness of $mathbfG$. My question is, given the null-space of another matrix $mathbfA$-let's call it $N(mathbfA)$, can we write
$$mathbff = mathbff_1 + mathbff_2,$$
with $mathbff_2 in N(mathbfA), f_1 in N(mathbfA)^perp$ and $langle mathbff_1, mathbff_2 rangle_mathbfG = 0$? In other words, is this special but important case covered by the projection theorem? Thank you very much for your help.
linear-algebra hilbert-spaces projection
$endgroup$
$begingroup$
Take $mathbff_1=0$
$endgroup$
– Bertrand
Mar 5 at 13:04
$begingroup$
Will not do.....
$endgroup$
– JohnK
Mar 5 at 14:02
add a comment |
$begingroup$
Assume that we are working on $mathbbR^p$ with an inner product induced by the positive definite matrix $mathbfG$, i.e. for $mathbff, mathbfg in mathbbR^p$ we define $langle mathbff, mathbfg rangle_mathbfG = mathbff^top mathbfG mathbfg$. This is of course a valid inner product in view of the positive-definiteness of $mathbfG$. My question is, given the null-space of another matrix $mathbfA$-let's call it $N(mathbfA)$, can we write
$$mathbff = mathbff_1 + mathbff_2,$$
with $mathbff_2 in N(mathbfA), f_1 in N(mathbfA)^perp$ and $langle mathbff_1, mathbff_2 rangle_mathbfG = 0$? In other words, is this special but important case covered by the projection theorem? Thank you very much for your help.
linear-algebra hilbert-spaces projection
$endgroup$
Assume that we are working on $mathbbR^p$ with an inner product induced by the positive definite matrix $mathbfG$, i.e. for $mathbff, mathbfg in mathbbR^p$ we define $langle mathbff, mathbfg rangle_mathbfG = mathbff^top mathbfG mathbfg$. This is of course a valid inner product in view of the positive-definiteness of $mathbfG$. My question is, given the null-space of another matrix $mathbfA$-let's call it $N(mathbfA)$, can we write
$$mathbff = mathbff_1 + mathbff_2,$$
with $mathbff_2 in N(mathbfA), f_1 in N(mathbfA)^perp$ and $langle mathbff_1, mathbff_2 rangle_mathbfG = 0$? In other words, is this special but important case covered by the projection theorem? Thank you very much for your help.
linear-algebra hilbert-spaces projection
linear-algebra hilbert-spaces projection
edited 2 days ago
JohnK
asked Mar 5 at 11:18
JohnKJohnK
2,84711739
2,84711739
$begingroup$
Take $mathbff_1=0$
$endgroup$
– Bertrand
Mar 5 at 13:04
$begingroup$
Will not do.....
$endgroup$
– JohnK
Mar 5 at 14:02
add a comment |
$begingroup$
Take $mathbff_1=0$
$endgroup$
– Bertrand
Mar 5 at 13:04
$begingroup$
Will not do.....
$endgroup$
– JohnK
Mar 5 at 14:02
$begingroup$
Take $mathbff_1=0$
$endgroup$
– Bertrand
Mar 5 at 13:04
$begingroup$
Take $mathbff_1=0$
$endgroup$
– Bertrand
Mar 5 at 13:04
$begingroup$
Will not do.....
$endgroup$
– JohnK
Mar 5 at 14:02
$begingroup$
Will not do.....
$endgroup$
– JohnK
Mar 5 at 14:02
add a comment |
1 Answer
1
active
oldest
votes
$begingroup$
Yes, there is always such a decomposition, and we don't even need to refer to a particular matrix $bf A$. Every null space of a matrix is a subspace, and every subspace is the null space of some matrix, so we may as well just show the claim for subspaces $S$.
For any inner product $langle ,cdot,,,cdot,rangle$ on $Bbb R^p$, any subspace $S subset Bbb R^p$ defines an orthogonal subspace $$S^perp := bf x in S : langle bf x, bf y rangle = 0 textrm for all $bf y in S$ .$$ Now, nondegeneracy implies that $dim S + dim S^perp = p$, and positive definiteness implies that $S cap S^perp = bf 0$: For any $bf x neq bf 0$ we have $langle bf x, bf x rangle > 0$, so if $bf x in S$, we must have $bf x notin S^perp$.
Thus, $Bbb R^p$ decomposes as an orthogonal direct sum $$boxedBbb R^p = S oplus S^perp .$$
In particular, we can decompose any element $bf x in Bbb R^p$ uniquely as a sum $$bf x = bf x^top + bf x^perp, qquad textrmwhere qquad bf x^top in S, bf x^perp in S^perp ,$$ and by definition $langle bf x^top, bf x^perp rangle = 0$.
$endgroup$
$begingroup$
Thanks a lot for the clarification.
$endgroup$
– JohnK
yesterday
$begingroup$
You're welcome, I hope you found it useful!
$endgroup$
– Travis
yesterday
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%2f3136089%2forthogonal-decomposition-with-a-special-inner-product%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$
Yes, there is always such a decomposition, and we don't even need to refer to a particular matrix $bf A$. Every null space of a matrix is a subspace, and every subspace is the null space of some matrix, so we may as well just show the claim for subspaces $S$.
For any inner product $langle ,cdot,,,cdot,rangle$ on $Bbb R^p$, any subspace $S subset Bbb R^p$ defines an orthogonal subspace $$S^perp := bf x in S : langle bf x, bf y rangle = 0 textrm for all $bf y in S$ .$$ Now, nondegeneracy implies that $dim S + dim S^perp = p$, and positive definiteness implies that $S cap S^perp = bf 0$: For any $bf x neq bf 0$ we have $langle bf x, bf x rangle > 0$, so if $bf x in S$, we must have $bf x notin S^perp$.
Thus, $Bbb R^p$ decomposes as an orthogonal direct sum $$boxedBbb R^p = S oplus S^perp .$$
In particular, we can decompose any element $bf x in Bbb R^p$ uniquely as a sum $$bf x = bf x^top + bf x^perp, qquad textrmwhere qquad bf x^top in S, bf x^perp in S^perp ,$$ and by definition $langle bf x^top, bf x^perp rangle = 0$.
$endgroup$
$begingroup$
Thanks a lot for the clarification.
$endgroup$
– JohnK
yesterday
$begingroup$
You're welcome, I hope you found it useful!
$endgroup$
– Travis
yesterday
add a comment |
$begingroup$
Yes, there is always such a decomposition, and we don't even need to refer to a particular matrix $bf A$. Every null space of a matrix is a subspace, and every subspace is the null space of some matrix, so we may as well just show the claim for subspaces $S$.
For any inner product $langle ,cdot,,,cdot,rangle$ on $Bbb R^p$, any subspace $S subset Bbb R^p$ defines an orthogonal subspace $$S^perp := bf x in S : langle bf x, bf y rangle = 0 textrm for all $bf y in S$ .$$ Now, nondegeneracy implies that $dim S + dim S^perp = p$, and positive definiteness implies that $S cap S^perp = bf 0$: For any $bf x neq bf 0$ we have $langle bf x, bf x rangle > 0$, so if $bf x in S$, we must have $bf x notin S^perp$.
Thus, $Bbb R^p$ decomposes as an orthogonal direct sum $$boxedBbb R^p = S oplus S^perp .$$
In particular, we can decompose any element $bf x in Bbb R^p$ uniquely as a sum $$bf x = bf x^top + bf x^perp, qquad textrmwhere qquad bf x^top in S, bf x^perp in S^perp ,$$ and by definition $langle bf x^top, bf x^perp rangle = 0$.
$endgroup$
$begingroup$
Thanks a lot for the clarification.
$endgroup$
– JohnK
yesterday
$begingroup$
You're welcome, I hope you found it useful!
$endgroup$
– Travis
yesterday
add a comment |
$begingroup$
Yes, there is always such a decomposition, and we don't even need to refer to a particular matrix $bf A$. Every null space of a matrix is a subspace, and every subspace is the null space of some matrix, so we may as well just show the claim for subspaces $S$.
For any inner product $langle ,cdot,,,cdot,rangle$ on $Bbb R^p$, any subspace $S subset Bbb R^p$ defines an orthogonal subspace $$S^perp := bf x in S : langle bf x, bf y rangle = 0 textrm for all $bf y in S$ .$$ Now, nondegeneracy implies that $dim S + dim S^perp = p$, and positive definiteness implies that $S cap S^perp = bf 0$: For any $bf x neq bf 0$ we have $langle bf x, bf x rangle > 0$, so if $bf x in S$, we must have $bf x notin S^perp$.
Thus, $Bbb R^p$ decomposes as an orthogonal direct sum $$boxedBbb R^p = S oplus S^perp .$$
In particular, we can decompose any element $bf x in Bbb R^p$ uniquely as a sum $$bf x = bf x^top + bf x^perp, qquad textrmwhere qquad bf x^top in S, bf x^perp in S^perp ,$$ and by definition $langle bf x^top, bf x^perp rangle = 0$.
$endgroup$
Yes, there is always such a decomposition, and we don't even need to refer to a particular matrix $bf A$. Every null space of a matrix is a subspace, and every subspace is the null space of some matrix, so we may as well just show the claim for subspaces $S$.
For any inner product $langle ,cdot,,,cdot,rangle$ on $Bbb R^p$, any subspace $S subset Bbb R^p$ defines an orthogonal subspace $$S^perp := bf x in S : langle bf x, bf y rangle = 0 textrm for all $bf y in S$ .$$ Now, nondegeneracy implies that $dim S + dim S^perp = p$, and positive definiteness implies that $S cap S^perp = bf 0$: For any $bf x neq bf 0$ we have $langle bf x, bf x rangle > 0$, so if $bf x in S$, we must have $bf x notin S^perp$.
Thus, $Bbb R^p$ decomposes as an orthogonal direct sum $$boxedBbb R^p = S oplus S^perp .$$
In particular, we can decompose any element $bf x in Bbb R^p$ uniquely as a sum $$bf x = bf x^top + bf x^perp, qquad textrmwhere qquad bf x^top in S, bf x^perp in S^perp ,$$ and by definition $langle bf x^top, bf x^perp rangle = 0$.
edited 19 hours ago
Bertrand
45815
45815
answered 2 days ago
TravisTravis
62.6k767149
62.6k767149
$begingroup$
Thanks a lot for the clarification.
$endgroup$
– JohnK
yesterday
$begingroup$
You're welcome, I hope you found it useful!
$endgroup$
– Travis
yesterday
add a comment |
$begingroup$
Thanks a lot for the clarification.
$endgroup$
– JohnK
yesterday
$begingroup$
You're welcome, I hope you found it useful!
$endgroup$
– Travis
yesterday
$begingroup$
Thanks a lot for the clarification.
$endgroup$
– JohnK
yesterday
$begingroup$
Thanks a lot for the clarification.
$endgroup$
– JohnK
yesterday
$begingroup$
You're welcome, I hope you found it useful!
$endgroup$
– Travis
yesterday
$begingroup$
You're welcome, I hope you found it useful!
$endgroup$
– Travis
yesterday
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%2f3136089%2forthogonal-decomposition-with-a-special-inner-product%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$
Take $mathbff_1=0$
$endgroup$
– Bertrand
Mar 5 at 13:04
$begingroup$
Will not do.....
$endgroup$
– JohnK
Mar 5 at 14:02