If [1 0 -1] and [0 1 2] serve as bases for a subspace, could [1 0 -1] and [1 1 1] also serve as a basis?
$begingroup$
Since [1 1 1] is a linear combination of [1 0 -1] and [0 1 2], would it be wrong to say that [1 1 1] and [1 0 -1] can serve as the basis for the subspace (assuming that [1 0 -1] and [0 1 2] are the "correct" bases)? If so, why?
I realize that there are an infinite(?) amount of bases for a given subspace (except the subspace of the zero vector), and this situation seems like it should be an example of that, but it also feels wrong somehow. Can anyone confirm or deny?
I think my main confusion stems from the fact that, when you're finding the basis of a column space for example, you eliminate all the column vectors that don't contribute to the vector space because they're dependent on the other vectors. But how do you choose which columns to eliminate and which ones to keep (since all of them can be written as a combination of the others)?
In my example, why do you prioritize keeping [0 1 2] over [1 1 1], even though they can both be written as combinations of each other (with [1 0 -1])?
linear-algebra vector-spaces
$endgroup$
add a comment |
$begingroup$
Since [1 1 1] is a linear combination of [1 0 -1] and [0 1 2], would it be wrong to say that [1 1 1] and [1 0 -1] can serve as the basis for the subspace (assuming that [1 0 -1] and [0 1 2] are the "correct" bases)? If so, why?
I realize that there are an infinite(?) amount of bases for a given subspace (except the subspace of the zero vector), and this situation seems like it should be an example of that, but it also feels wrong somehow. Can anyone confirm or deny?
I think my main confusion stems from the fact that, when you're finding the basis of a column space for example, you eliminate all the column vectors that don't contribute to the vector space because they're dependent on the other vectors. But how do you choose which columns to eliminate and which ones to keep (since all of them can be written as a combination of the others)?
In my example, why do you prioritize keeping [0 1 2] over [1 1 1], even though they can both be written as combinations of each other (with [1 0 -1])?
linear-algebra vector-spaces
$endgroup$
add a comment |
$begingroup$
Since [1 1 1] is a linear combination of [1 0 -1] and [0 1 2], would it be wrong to say that [1 1 1] and [1 0 -1] can serve as the basis for the subspace (assuming that [1 0 -1] and [0 1 2] are the "correct" bases)? If so, why?
I realize that there are an infinite(?) amount of bases for a given subspace (except the subspace of the zero vector), and this situation seems like it should be an example of that, but it also feels wrong somehow. Can anyone confirm or deny?
I think my main confusion stems from the fact that, when you're finding the basis of a column space for example, you eliminate all the column vectors that don't contribute to the vector space because they're dependent on the other vectors. But how do you choose which columns to eliminate and which ones to keep (since all of them can be written as a combination of the others)?
In my example, why do you prioritize keeping [0 1 2] over [1 1 1], even though they can both be written as combinations of each other (with [1 0 -1])?
linear-algebra vector-spaces
$endgroup$
Since [1 1 1] is a linear combination of [1 0 -1] and [0 1 2], would it be wrong to say that [1 1 1] and [1 0 -1] can serve as the basis for the subspace (assuming that [1 0 -1] and [0 1 2] are the "correct" bases)? If so, why?
I realize that there are an infinite(?) amount of bases for a given subspace (except the subspace of the zero vector), and this situation seems like it should be an example of that, but it also feels wrong somehow. Can anyone confirm or deny?
I think my main confusion stems from the fact that, when you're finding the basis of a column space for example, you eliminate all the column vectors that don't contribute to the vector space because they're dependent on the other vectors. But how do you choose which columns to eliminate and which ones to keep (since all of them can be written as a combination of the others)?
In my example, why do you prioritize keeping [0 1 2] over [1 1 1], even though they can both be written as combinations of each other (with [1 0 -1])?
linear-algebra vector-spaces
linear-algebra vector-spaces
edited Dec 7 '18 at 17:02
James Ronald
asked Dec 7 '18 at 16:56
James RonaldJames Ronald
1807
1807
add a comment |
add a comment |
2 Answers
2
active
oldest
votes
$begingroup$
Basis is not unique.
Yes, you are right, it works. The subspace has dimension $2$. Any two non-zero vectors in the subspace that are not multiples of each other do form a basis.
There are some results that help us to find a basis. For example, if you want to find a basis for a row space, one common strategy is to reduce it to RREF, then we know that the non-zero rows form a basis. If we want to find a basis for the column space, then the columns of the corresponding pivot columns of the RREF is a basis. That gives us a procedure to always being able to find a basis for row space and column space.
Remark:
If we are given two basis, to say that a basis is better than another basis require justification in the sense of what does one mean by "better". Perhaps, by a measure of how other vectors can be expressed as linear combination of them? or by sparseness? If you look at the first set, given a vector in the subspace, we can easily write
$$(x_1, x_2, x_3) = x_1(1,0,-1)+x_2(0,1,2)$$
very quickly.
$$(x_1, x_2, x_3)=(x_1-x_2)(1,0,-1)+x_2(1,1,1)$$
You can see that you still have to compute $x_1-x_2.$
Another possible consideration is perhaps you know that you are collecting data and you know that your data lies inside a subspace. We might purposely want to choose a basis and perhaps even arrange the vector inside the basis as some "directions"
can tell us more information. Your data might tend to lie along a few directions and the other directions are behaving like noise.
If the question is asking us to find a basis, any basis will do. I am just giving you a glimpse of possible applications of linear algebra.
$endgroup$
add a comment |
$begingroup$
The linear combination of the two vectors will fill different subspaces of $R^3$.
In fact, because the vectors are two, the subspaces will be planes.
Thus, we can say that, for these choice of vectors, the subspaces that are originated will be different.
Let's take another example and analyze the vector space $R^2$.
If we consider the vectors [1,0] and [0,1], their linear combination will fill the whole space $R^2$. Now consider another pair of vectors [1,2] and [2,9]; being the vectors linear indipendent, they will fill the whole space $R^2$.
The vectors both originate the same subspace $R^2$, thus, it does not matter which 'bases' we use to originate the same subspace.
If we repeat this process, we will soon realize that there are infinite set of vectors that fill $R^2$. The only condition is that the two vectors are linear indipendent from each others.
$endgroup$
1
$begingroup$
But in the given example of OP the spaces spanned by $v,w$ and $v,v+w$ are the same!
$endgroup$
– Christoph
Dec 7 '18 at 17:58
$begingroup$
Indeed, there’s a theorem that guarantees that the two pairs have the same span (although it’s almost trivial for a two-vector set).
$endgroup$
– amd
Dec 7 '18 at 20:52
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%2f3030122%2fif-1-0-1-and-0-1-2-serve-as-bases-for-a-subspace-could-1-0-1-and-1-1-1%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$
Basis is not unique.
Yes, you are right, it works. The subspace has dimension $2$. Any two non-zero vectors in the subspace that are not multiples of each other do form a basis.
There are some results that help us to find a basis. For example, if you want to find a basis for a row space, one common strategy is to reduce it to RREF, then we know that the non-zero rows form a basis. If we want to find a basis for the column space, then the columns of the corresponding pivot columns of the RREF is a basis. That gives us a procedure to always being able to find a basis for row space and column space.
Remark:
If we are given two basis, to say that a basis is better than another basis require justification in the sense of what does one mean by "better". Perhaps, by a measure of how other vectors can be expressed as linear combination of them? or by sparseness? If you look at the first set, given a vector in the subspace, we can easily write
$$(x_1, x_2, x_3) = x_1(1,0,-1)+x_2(0,1,2)$$
very quickly.
$$(x_1, x_2, x_3)=(x_1-x_2)(1,0,-1)+x_2(1,1,1)$$
You can see that you still have to compute $x_1-x_2.$
Another possible consideration is perhaps you know that you are collecting data and you know that your data lies inside a subspace. We might purposely want to choose a basis and perhaps even arrange the vector inside the basis as some "directions"
can tell us more information. Your data might tend to lie along a few directions and the other directions are behaving like noise.
If the question is asking us to find a basis, any basis will do. I am just giving you a glimpse of possible applications of linear algebra.
$endgroup$
add a comment |
$begingroup$
Basis is not unique.
Yes, you are right, it works. The subspace has dimension $2$. Any two non-zero vectors in the subspace that are not multiples of each other do form a basis.
There are some results that help us to find a basis. For example, if you want to find a basis for a row space, one common strategy is to reduce it to RREF, then we know that the non-zero rows form a basis. If we want to find a basis for the column space, then the columns of the corresponding pivot columns of the RREF is a basis. That gives us a procedure to always being able to find a basis for row space and column space.
Remark:
If we are given two basis, to say that a basis is better than another basis require justification in the sense of what does one mean by "better". Perhaps, by a measure of how other vectors can be expressed as linear combination of them? or by sparseness? If you look at the first set, given a vector in the subspace, we can easily write
$$(x_1, x_2, x_3) = x_1(1,0,-1)+x_2(0,1,2)$$
very quickly.
$$(x_1, x_2, x_3)=(x_1-x_2)(1,0,-1)+x_2(1,1,1)$$
You can see that you still have to compute $x_1-x_2.$
Another possible consideration is perhaps you know that you are collecting data and you know that your data lies inside a subspace. We might purposely want to choose a basis and perhaps even arrange the vector inside the basis as some "directions"
can tell us more information. Your data might tend to lie along a few directions and the other directions are behaving like noise.
If the question is asking us to find a basis, any basis will do. I am just giving you a glimpse of possible applications of linear algebra.
$endgroup$
add a comment |
$begingroup$
Basis is not unique.
Yes, you are right, it works. The subspace has dimension $2$. Any two non-zero vectors in the subspace that are not multiples of each other do form a basis.
There are some results that help us to find a basis. For example, if you want to find a basis for a row space, one common strategy is to reduce it to RREF, then we know that the non-zero rows form a basis. If we want to find a basis for the column space, then the columns of the corresponding pivot columns of the RREF is a basis. That gives us a procedure to always being able to find a basis for row space and column space.
Remark:
If we are given two basis, to say that a basis is better than another basis require justification in the sense of what does one mean by "better". Perhaps, by a measure of how other vectors can be expressed as linear combination of them? or by sparseness? If you look at the first set, given a vector in the subspace, we can easily write
$$(x_1, x_2, x_3) = x_1(1,0,-1)+x_2(0,1,2)$$
very quickly.
$$(x_1, x_2, x_3)=(x_1-x_2)(1,0,-1)+x_2(1,1,1)$$
You can see that you still have to compute $x_1-x_2.$
Another possible consideration is perhaps you know that you are collecting data and you know that your data lies inside a subspace. We might purposely want to choose a basis and perhaps even arrange the vector inside the basis as some "directions"
can tell us more information. Your data might tend to lie along a few directions and the other directions are behaving like noise.
If the question is asking us to find a basis, any basis will do. I am just giving you a glimpse of possible applications of linear algebra.
$endgroup$
Basis is not unique.
Yes, you are right, it works. The subspace has dimension $2$. Any two non-zero vectors in the subspace that are not multiples of each other do form a basis.
There are some results that help us to find a basis. For example, if you want to find a basis for a row space, one common strategy is to reduce it to RREF, then we know that the non-zero rows form a basis. If we want to find a basis for the column space, then the columns of the corresponding pivot columns of the RREF is a basis. That gives us a procedure to always being able to find a basis for row space and column space.
Remark:
If we are given two basis, to say that a basis is better than another basis require justification in the sense of what does one mean by "better". Perhaps, by a measure of how other vectors can be expressed as linear combination of them? or by sparseness? If you look at the first set, given a vector in the subspace, we can easily write
$$(x_1, x_2, x_3) = x_1(1,0,-1)+x_2(0,1,2)$$
very quickly.
$$(x_1, x_2, x_3)=(x_1-x_2)(1,0,-1)+x_2(1,1,1)$$
You can see that you still have to compute $x_1-x_2.$
Another possible consideration is perhaps you know that you are collecting data and you know that your data lies inside a subspace. We might purposely want to choose a basis and perhaps even arrange the vector inside the basis as some "directions"
can tell us more information. Your data might tend to lie along a few directions and the other directions are behaving like noise.
If the question is asking us to find a basis, any basis will do. I am just giving you a glimpse of possible applications of linear algebra.
edited Dec 7 '18 at 17:44
Christoph
12.5k1642
12.5k1642
answered Dec 7 '18 at 16:59
Siong Thye GohSiong Thye Goh
102k1468119
102k1468119
add a comment |
add a comment |
$begingroup$
The linear combination of the two vectors will fill different subspaces of $R^3$.
In fact, because the vectors are two, the subspaces will be planes.
Thus, we can say that, for these choice of vectors, the subspaces that are originated will be different.
Let's take another example and analyze the vector space $R^2$.
If we consider the vectors [1,0] and [0,1], their linear combination will fill the whole space $R^2$. Now consider another pair of vectors [1,2] and [2,9]; being the vectors linear indipendent, they will fill the whole space $R^2$.
The vectors both originate the same subspace $R^2$, thus, it does not matter which 'bases' we use to originate the same subspace.
If we repeat this process, we will soon realize that there are infinite set of vectors that fill $R^2$. The only condition is that the two vectors are linear indipendent from each others.
$endgroup$
1
$begingroup$
But in the given example of OP the spaces spanned by $v,w$ and $v,v+w$ are the same!
$endgroup$
– Christoph
Dec 7 '18 at 17:58
$begingroup$
Indeed, there’s a theorem that guarantees that the two pairs have the same span (although it’s almost trivial for a two-vector set).
$endgroup$
– amd
Dec 7 '18 at 20:52
add a comment |
$begingroup$
The linear combination of the two vectors will fill different subspaces of $R^3$.
In fact, because the vectors are two, the subspaces will be planes.
Thus, we can say that, for these choice of vectors, the subspaces that are originated will be different.
Let's take another example and analyze the vector space $R^2$.
If we consider the vectors [1,0] and [0,1], their linear combination will fill the whole space $R^2$. Now consider another pair of vectors [1,2] and [2,9]; being the vectors linear indipendent, they will fill the whole space $R^2$.
The vectors both originate the same subspace $R^2$, thus, it does not matter which 'bases' we use to originate the same subspace.
If we repeat this process, we will soon realize that there are infinite set of vectors that fill $R^2$. The only condition is that the two vectors are linear indipendent from each others.
$endgroup$
1
$begingroup$
But in the given example of OP the spaces spanned by $v,w$ and $v,v+w$ are the same!
$endgroup$
– Christoph
Dec 7 '18 at 17:58
$begingroup$
Indeed, there’s a theorem that guarantees that the two pairs have the same span (although it’s almost trivial for a two-vector set).
$endgroup$
– amd
Dec 7 '18 at 20:52
add a comment |
$begingroup$
The linear combination of the two vectors will fill different subspaces of $R^3$.
In fact, because the vectors are two, the subspaces will be planes.
Thus, we can say that, for these choice of vectors, the subspaces that are originated will be different.
Let's take another example and analyze the vector space $R^2$.
If we consider the vectors [1,0] and [0,1], their linear combination will fill the whole space $R^2$. Now consider another pair of vectors [1,2] and [2,9]; being the vectors linear indipendent, they will fill the whole space $R^2$.
The vectors both originate the same subspace $R^2$, thus, it does not matter which 'bases' we use to originate the same subspace.
If we repeat this process, we will soon realize that there are infinite set of vectors that fill $R^2$. The only condition is that the two vectors are linear indipendent from each others.
$endgroup$
The linear combination of the two vectors will fill different subspaces of $R^3$.
In fact, because the vectors are two, the subspaces will be planes.
Thus, we can say that, for these choice of vectors, the subspaces that are originated will be different.
Let's take another example and analyze the vector space $R^2$.
If we consider the vectors [1,0] and [0,1], their linear combination will fill the whole space $R^2$. Now consider another pair of vectors [1,2] and [2,9]; being the vectors linear indipendent, they will fill the whole space $R^2$.
The vectors both originate the same subspace $R^2$, thus, it does not matter which 'bases' we use to originate the same subspace.
If we repeat this process, we will soon realize that there are infinite set of vectors that fill $R^2$. The only condition is that the two vectors are linear indipendent from each others.
answered Dec 7 '18 at 17:33
Alessandro CapriatiAlessandro Capriati
112
112
1
$begingroup$
But in the given example of OP the spaces spanned by $v,w$ and $v,v+w$ are the same!
$endgroup$
– Christoph
Dec 7 '18 at 17:58
$begingroup$
Indeed, there’s a theorem that guarantees that the two pairs have the same span (although it’s almost trivial for a two-vector set).
$endgroup$
– amd
Dec 7 '18 at 20:52
add a comment |
1
$begingroup$
But in the given example of OP the spaces spanned by $v,w$ and $v,v+w$ are the same!
$endgroup$
– Christoph
Dec 7 '18 at 17:58
$begingroup$
Indeed, there’s a theorem that guarantees that the two pairs have the same span (although it’s almost trivial for a two-vector set).
$endgroup$
– amd
Dec 7 '18 at 20:52
1
1
$begingroup$
But in the given example of OP the spaces spanned by $v,w$ and $v,v+w$ are the same!
$endgroup$
– Christoph
Dec 7 '18 at 17:58
$begingroup$
But in the given example of OP the spaces spanned by $v,w$ and $v,v+w$ are the same!
$endgroup$
– Christoph
Dec 7 '18 at 17:58
$begingroup$
Indeed, there’s a theorem that guarantees that the two pairs have the same span (although it’s almost trivial for a two-vector set).
$endgroup$
– amd
Dec 7 '18 at 20:52
$begingroup$
Indeed, there’s a theorem that guarantees that the two pairs have the same span (although it’s almost trivial for a two-vector set).
$endgroup$
– amd
Dec 7 '18 at 20:52
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%2f3030122%2fif-1-0-1-and-0-1-2-serve-as-bases-for-a-subspace-could-1-0-1-and-1-1-1%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