can you confirm my solution for the basis
$begingroup$
If S is the subspace spanned by $$
pmatrix{1 \ 2\1} pmatrix{-1 \ 1\-1} $$ then find a basis for the orthogonal complement of S ?
the solution is:
since the null space of any matrix is the orthogonal compliment of the row apace then we solve for the null space $Ax=0$
$$
pmatrix{1&2&1 \ -1&1&-1}X=0 $$
and tha basis will be $$
pmatrix{-1 \ 0\1} $$
is this the right answer ? and thank you
linear-algebra matrices
$endgroup$
add a comment |
$begingroup$
If S is the subspace spanned by $$
pmatrix{1 \ 2\1} pmatrix{-1 \ 1\-1} $$ then find a basis for the orthogonal complement of S ?
the solution is:
since the null space of any matrix is the orthogonal compliment of the row apace then we solve for the null space $Ax=0$
$$
pmatrix{1&2&1 \ -1&1&-1}X=0 $$
and tha basis will be $$
pmatrix{-1 \ 0\1} $$
is this the right answer ? and thank you
linear-algebra matrices
$endgroup$
$begingroup$
You can check to see that you have the right answer by confirming that the vector in your answer is in fact orthogonal to both of the basis vectors in your problem. It is, and therefore your answer is indeed correct.
$endgroup$
– JMoravitz
Dec 12 '18 at 17:28
$begingroup$
@JMoravitz thank you very much for confirming and for that info
$endgroup$
– The Beard
Dec 12 '18 at 17:32
add a comment |
$begingroup$
If S is the subspace spanned by $$
pmatrix{1 \ 2\1} pmatrix{-1 \ 1\-1} $$ then find a basis for the orthogonal complement of S ?
the solution is:
since the null space of any matrix is the orthogonal compliment of the row apace then we solve for the null space $Ax=0$
$$
pmatrix{1&2&1 \ -1&1&-1}X=0 $$
and tha basis will be $$
pmatrix{-1 \ 0\1} $$
is this the right answer ? and thank you
linear-algebra matrices
$endgroup$
If S is the subspace spanned by $$
pmatrix{1 \ 2\1} pmatrix{-1 \ 1\-1} $$ then find a basis for the orthogonal complement of S ?
the solution is:
since the null space of any matrix is the orthogonal compliment of the row apace then we solve for the null space $Ax=0$
$$
pmatrix{1&2&1 \ -1&1&-1}X=0 $$
and tha basis will be $$
pmatrix{-1 \ 0\1} $$
is this the right answer ? and thank you
linear-algebra matrices
linear-algebra matrices
edited Dec 12 '18 at 17:43
Key Flex
7,98461233
7,98461233
asked Dec 12 '18 at 17:18
The BeardThe Beard
54
54
$begingroup$
You can check to see that you have the right answer by confirming that the vector in your answer is in fact orthogonal to both of the basis vectors in your problem. It is, and therefore your answer is indeed correct.
$endgroup$
– JMoravitz
Dec 12 '18 at 17:28
$begingroup$
@JMoravitz thank you very much for confirming and for that info
$endgroup$
– The Beard
Dec 12 '18 at 17:32
add a comment |
$begingroup$
You can check to see that you have the right answer by confirming that the vector in your answer is in fact orthogonal to both of the basis vectors in your problem. It is, and therefore your answer is indeed correct.
$endgroup$
– JMoravitz
Dec 12 '18 at 17:28
$begingroup$
@JMoravitz thank you very much for confirming and for that info
$endgroup$
– The Beard
Dec 12 '18 at 17:32
$begingroup$
You can check to see that you have the right answer by confirming that the vector in your answer is in fact orthogonal to both of the basis vectors in your problem. It is, and therefore your answer is indeed correct.
$endgroup$
– JMoravitz
Dec 12 '18 at 17:28
$begingroup$
You can check to see that you have the right answer by confirming that the vector in your answer is in fact orthogonal to both of the basis vectors in your problem. It is, and therefore your answer is indeed correct.
$endgroup$
– JMoravitz
Dec 12 '18 at 17:28
$begingroup$
@JMoravitz thank you very much for confirming and for that info
$endgroup$
– The Beard
Dec 12 '18 at 17:32
$begingroup$
@JMoravitz thank you very much for confirming and for that info
$endgroup$
– The Beard
Dec 12 '18 at 17:32
add a comment |
2 Answers
2
active
oldest
votes
$begingroup$
Consider the matrix form as $$A=begin{bmatrix} 1 & 2 & 1 \ -1 & 1 & -1 end{bmatrix}$$
By construction, the row space of $A$ is equal to $S$. Therefore, since the nullspace of any matrix is the orthogonal complement of the row space, it must be the case that $S^{⊥}=$ nul$(A)$.
The reduced row echelon form of the above matrix is $$A=begin{bmatrix} 1 & 0 & 1 \ 0 & 1 & 0 end{bmatrix}$$ The matrix $A$ is now in reduced echelon form, so we can see that the homogeneous equation $Ax=0$ is equivalent to $$x_1=-x_3$$
$$x_2=0$$
So, the following is a basis for nul$(A) =S^⊥$
$$begin{bmatrix} -1 \ 0 \ 1 end{bmatrix}$$
So, your answer is correct.
$endgroup$
$begingroup$
thank you very much for confirming and for explaining that
$endgroup$
– The Beard
Dec 12 '18 at 17:35
add a comment |
$begingroup$
You could also take the cross product of the two vectors to get an orthogonal vector: $begin{vmatrix} i&j&k\1&2&1\-1&1&-1end{vmatrix}=begin{vmatrix}2&1\1&-1end{vmatrix}i-begin{vmatrix}1&1\-1&-1end{vmatrix}j+begin{vmatrix}1&2\-1&1end{vmatrix}k=-3i+3k$. Thus we get $begin{pmatrix}-3\0\3end{pmatrix}$.
You could also pull a rabbit out of a hat and guess it, since both have $x$ and $z$ coordinates the same.
$endgroup$
$begingroup$
thanks for explaining other method to solve the problem
$endgroup$
– The Beard
Dec 13 '18 at 21:03
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%2f3036971%2fcan-you-confirm-my-solution-for-the-basis%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$
Consider the matrix form as $$A=begin{bmatrix} 1 & 2 & 1 \ -1 & 1 & -1 end{bmatrix}$$
By construction, the row space of $A$ is equal to $S$. Therefore, since the nullspace of any matrix is the orthogonal complement of the row space, it must be the case that $S^{⊥}=$ nul$(A)$.
The reduced row echelon form of the above matrix is $$A=begin{bmatrix} 1 & 0 & 1 \ 0 & 1 & 0 end{bmatrix}$$ The matrix $A$ is now in reduced echelon form, so we can see that the homogeneous equation $Ax=0$ is equivalent to $$x_1=-x_3$$
$$x_2=0$$
So, the following is a basis for nul$(A) =S^⊥$
$$begin{bmatrix} -1 \ 0 \ 1 end{bmatrix}$$
So, your answer is correct.
$endgroup$
$begingroup$
thank you very much for confirming and for explaining that
$endgroup$
– The Beard
Dec 12 '18 at 17:35
add a comment |
$begingroup$
Consider the matrix form as $$A=begin{bmatrix} 1 & 2 & 1 \ -1 & 1 & -1 end{bmatrix}$$
By construction, the row space of $A$ is equal to $S$. Therefore, since the nullspace of any matrix is the orthogonal complement of the row space, it must be the case that $S^{⊥}=$ nul$(A)$.
The reduced row echelon form of the above matrix is $$A=begin{bmatrix} 1 & 0 & 1 \ 0 & 1 & 0 end{bmatrix}$$ The matrix $A$ is now in reduced echelon form, so we can see that the homogeneous equation $Ax=0$ is equivalent to $$x_1=-x_3$$
$$x_2=0$$
So, the following is a basis for nul$(A) =S^⊥$
$$begin{bmatrix} -1 \ 0 \ 1 end{bmatrix}$$
So, your answer is correct.
$endgroup$
$begingroup$
thank you very much for confirming and for explaining that
$endgroup$
– The Beard
Dec 12 '18 at 17:35
add a comment |
$begingroup$
Consider the matrix form as $$A=begin{bmatrix} 1 & 2 & 1 \ -1 & 1 & -1 end{bmatrix}$$
By construction, the row space of $A$ is equal to $S$. Therefore, since the nullspace of any matrix is the orthogonal complement of the row space, it must be the case that $S^{⊥}=$ nul$(A)$.
The reduced row echelon form of the above matrix is $$A=begin{bmatrix} 1 & 0 & 1 \ 0 & 1 & 0 end{bmatrix}$$ The matrix $A$ is now in reduced echelon form, so we can see that the homogeneous equation $Ax=0$ is equivalent to $$x_1=-x_3$$
$$x_2=0$$
So, the following is a basis for nul$(A) =S^⊥$
$$begin{bmatrix} -1 \ 0 \ 1 end{bmatrix}$$
So, your answer is correct.
$endgroup$
Consider the matrix form as $$A=begin{bmatrix} 1 & 2 & 1 \ -1 & 1 & -1 end{bmatrix}$$
By construction, the row space of $A$ is equal to $S$. Therefore, since the nullspace of any matrix is the orthogonal complement of the row space, it must be the case that $S^{⊥}=$ nul$(A)$.
The reduced row echelon form of the above matrix is $$A=begin{bmatrix} 1 & 0 & 1 \ 0 & 1 & 0 end{bmatrix}$$ The matrix $A$ is now in reduced echelon form, so we can see that the homogeneous equation $Ax=0$ is equivalent to $$x_1=-x_3$$
$$x_2=0$$
So, the following is a basis for nul$(A) =S^⊥$
$$begin{bmatrix} -1 \ 0 \ 1 end{bmatrix}$$
So, your answer is correct.
answered Dec 12 '18 at 17:32
Key FlexKey Flex
7,98461233
7,98461233
$begingroup$
thank you very much for confirming and for explaining that
$endgroup$
– The Beard
Dec 12 '18 at 17:35
add a comment |
$begingroup$
thank you very much for confirming and for explaining that
$endgroup$
– The Beard
Dec 12 '18 at 17:35
$begingroup$
thank you very much for confirming and for explaining that
$endgroup$
– The Beard
Dec 12 '18 at 17:35
$begingroup$
thank you very much for confirming and for explaining that
$endgroup$
– The Beard
Dec 12 '18 at 17:35
add a comment |
$begingroup$
You could also take the cross product of the two vectors to get an orthogonal vector: $begin{vmatrix} i&j&k\1&2&1\-1&1&-1end{vmatrix}=begin{vmatrix}2&1\1&-1end{vmatrix}i-begin{vmatrix}1&1\-1&-1end{vmatrix}j+begin{vmatrix}1&2\-1&1end{vmatrix}k=-3i+3k$. Thus we get $begin{pmatrix}-3\0\3end{pmatrix}$.
You could also pull a rabbit out of a hat and guess it, since both have $x$ and $z$ coordinates the same.
$endgroup$
$begingroup$
thanks for explaining other method to solve the problem
$endgroup$
– The Beard
Dec 13 '18 at 21:03
add a comment |
$begingroup$
You could also take the cross product of the two vectors to get an orthogonal vector: $begin{vmatrix} i&j&k\1&2&1\-1&1&-1end{vmatrix}=begin{vmatrix}2&1\1&-1end{vmatrix}i-begin{vmatrix}1&1\-1&-1end{vmatrix}j+begin{vmatrix}1&2\-1&1end{vmatrix}k=-3i+3k$. Thus we get $begin{pmatrix}-3\0\3end{pmatrix}$.
You could also pull a rabbit out of a hat and guess it, since both have $x$ and $z$ coordinates the same.
$endgroup$
$begingroup$
thanks for explaining other method to solve the problem
$endgroup$
– The Beard
Dec 13 '18 at 21:03
add a comment |
$begingroup$
You could also take the cross product of the two vectors to get an orthogonal vector: $begin{vmatrix} i&j&k\1&2&1\-1&1&-1end{vmatrix}=begin{vmatrix}2&1\1&-1end{vmatrix}i-begin{vmatrix}1&1\-1&-1end{vmatrix}j+begin{vmatrix}1&2\-1&1end{vmatrix}k=-3i+3k$. Thus we get $begin{pmatrix}-3\0\3end{pmatrix}$.
You could also pull a rabbit out of a hat and guess it, since both have $x$ and $z$ coordinates the same.
$endgroup$
You could also take the cross product of the two vectors to get an orthogonal vector: $begin{vmatrix} i&j&k\1&2&1\-1&1&-1end{vmatrix}=begin{vmatrix}2&1\1&-1end{vmatrix}i-begin{vmatrix}1&1\-1&-1end{vmatrix}j+begin{vmatrix}1&2\-1&1end{vmatrix}k=-3i+3k$. Thus we get $begin{pmatrix}-3\0\3end{pmatrix}$.
You could also pull a rabbit out of a hat and guess it, since both have $x$ and $z$ coordinates the same.
answered Dec 12 '18 at 18:11
Chris CusterChris Custer
12.8k3825
12.8k3825
$begingroup$
thanks for explaining other method to solve the problem
$endgroup$
– The Beard
Dec 13 '18 at 21:03
add a comment |
$begingroup$
thanks for explaining other method to solve the problem
$endgroup$
– The Beard
Dec 13 '18 at 21:03
$begingroup$
thanks for explaining other method to solve the problem
$endgroup$
– The Beard
Dec 13 '18 at 21:03
$begingroup$
thanks for explaining other method to solve the problem
$endgroup$
– The Beard
Dec 13 '18 at 21:03
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%2f3036971%2fcan-you-confirm-my-solution-for-the-basis%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$
You can check to see that you have the right answer by confirming that the vector in your answer is in fact orthogonal to both of the basis vectors in your problem. It is, and therefore your answer is indeed correct.
$endgroup$
– JMoravitz
Dec 12 '18 at 17:28
$begingroup$
@JMoravitz thank you very much for confirming and for that info
$endgroup$
– The Beard
Dec 12 '18 at 17:32