Why the dimension of the range of linear map is smaller than the dimension of $W$?
$begingroup$
I am working on the proof of a map to a smaller dimensional space is not injective.
Proof:
Let $T in mathcal{L}(V,W)$. Then
$$text {dim null } T = text {dim } V - text {dim range } T geq text {dim } V - text {dim } W gt 0$$
I don't understand why $text {dim } V - text {dim range } T geq text {dim } V - text {dim } W$. Or why $ text {dim range } T leq text {dim } W$?
I guess it is because as range $T$ is coming from $V$, at most you can get the dimension of $V$. As dim $V$ is less than dim $W$, dim range $T$ is also less than dim $W$. I don't know if it is correct, and some better way to look at it.
linear-algebra linear-transformations
$endgroup$
add a comment |
$begingroup$
I am working on the proof of a map to a smaller dimensional space is not injective.
Proof:
Let $T in mathcal{L}(V,W)$. Then
$$text {dim null } T = text {dim } V - text {dim range } T geq text {dim } V - text {dim } W gt 0$$
I don't understand why $text {dim } V - text {dim range } T geq text {dim } V - text {dim } W$. Or why $ text {dim range } T leq text {dim } W$?
I guess it is because as range $T$ is coming from $V$, at most you can get the dimension of $V$. As dim $V$ is less than dim $W$, dim range $T$ is also less than dim $W$. I don't know if it is correct, and some better way to look at it.
linear-algebra linear-transformations
$endgroup$
add a comment |
$begingroup$
I am working on the proof of a map to a smaller dimensional space is not injective.
Proof:
Let $T in mathcal{L}(V,W)$. Then
$$text {dim null } T = text {dim } V - text {dim range } T geq text {dim } V - text {dim } W gt 0$$
I don't understand why $text {dim } V - text {dim range } T geq text {dim } V - text {dim } W$. Or why $ text {dim range } T leq text {dim } W$?
I guess it is because as range $T$ is coming from $V$, at most you can get the dimension of $V$. As dim $V$ is less than dim $W$, dim range $T$ is also less than dim $W$. I don't know if it is correct, and some better way to look at it.
linear-algebra linear-transformations
$endgroup$
I am working on the proof of a map to a smaller dimensional space is not injective.
Proof:
Let $T in mathcal{L}(V,W)$. Then
$$text {dim null } T = text {dim } V - text {dim range } T geq text {dim } V - text {dim } W gt 0$$
I don't understand why $text {dim } V - text {dim range } T geq text {dim } V - text {dim } W$. Or why $ text {dim range } T leq text {dim } W$?
I guess it is because as range $T$ is coming from $V$, at most you can get the dimension of $V$. As dim $V$ is less than dim $W$, dim range $T$ is also less than dim $W$. I don't know if it is correct, and some better way to look at it.
linear-algebra linear-transformations
linear-algebra linear-transformations
edited Jan 22 at 22:48


José Carlos Santos
166k22132235
166k22132235
asked Jan 22 at 22:43
JOHN JOHN
4209
4209
add a comment |
add a comment |
4 Answers
4
active
oldest
votes
$begingroup$
By definition, $text{range} (T)$ is a subspace of $W$.
$$text{range} (T) le W$$
So,
$$text{dim} ,text{range} (T) le text{dim} W$$
$endgroup$
add a comment |
$begingroup$
It's because $operatorname{range}T$ is a subspace of $W$. Therefore, $dimoperatorname{range}Tleqslantdim W$.
$endgroup$
add a comment |
$begingroup$
If $text{rank}(T) > dim{W}$, then you can find a linearly independent set in $W$ that has more elements than the dimension of $W$!
$endgroup$
add a comment |
$begingroup$
Let me address what I think is giving you more of a problem thinking about this:
In vector spaces we have the notion of a basis; that is a set of vectors which are linearly independent and span the whole space. The smallest cardinality (size) of such a basis, which is invariant to the space, is called the dimension.
Now in your case, once you impose the image of $V$ in $W$ (and get a linear space in itself) and ask what the dimension of this image is, you're asking what is the minimal number of vectors I need to span the image. This is by definition less than the required number to span the space $W$ itself. Is this making the question more intuitive?
$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%2f3083818%2fwhy-the-dimension-of-the-range-of-linear-map-is-smaller-than-the-dimension-of-w%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
4 Answers
4
active
oldest
votes
4 Answers
4
active
oldest
votes
active
oldest
votes
active
oldest
votes
$begingroup$
By definition, $text{range} (T)$ is a subspace of $W$.
$$text{range} (T) le W$$
So,
$$text{dim} ,text{range} (T) le text{dim} W$$
$endgroup$
add a comment |
$begingroup$
By definition, $text{range} (T)$ is a subspace of $W$.
$$text{range} (T) le W$$
So,
$$text{dim} ,text{range} (T) le text{dim} W$$
$endgroup$
add a comment |
$begingroup$
By definition, $text{range} (T)$ is a subspace of $W$.
$$text{range} (T) le W$$
So,
$$text{dim} ,text{range} (T) le text{dim} W$$
$endgroup$
By definition, $text{range} (T)$ is a subspace of $W$.
$$text{range} (T) le W$$
So,
$$text{dim} ,text{range} (T) le text{dim} W$$
answered Jan 22 at 22:47
preferred_anonpreferred_anon
13k11743
13k11743
add a comment |
add a comment |
$begingroup$
It's because $operatorname{range}T$ is a subspace of $W$. Therefore, $dimoperatorname{range}Tleqslantdim W$.
$endgroup$
add a comment |
$begingroup$
It's because $operatorname{range}T$ is a subspace of $W$. Therefore, $dimoperatorname{range}Tleqslantdim W$.
$endgroup$
add a comment |
$begingroup$
It's because $operatorname{range}T$ is a subspace of $W$. Therefore, $dimoperatorname{range}Tleqslantdim W$.
$endgroup$
It's because $operatorname{range}T$ is a subspace of $W$. Therefore, $dimoperatorname{range}Tleqslantdim W$.
answered Jan 22 at 22:47


José Carlos SantosJosé Carlos Santos
166k22132235
166k22132235
add a comment |
add a comment |
$begingroup$
If $text{rank}(T) > dim{W}$, then you can find a linearly independent set in $W$ that has more elements than the dimension of $W$!
$endgroup$
add a comment |
$begingroup$
If $text{rank}(T) > dim{W}$, then you can find a linearly independent set in $W$ that has more elements than the dimension of $W$!
$endgroup$
add a comment |
$begingroup$
If $text{rank}(T) > dim{W}$, then you can find a linearly independent set in $W$ that has more elements than the dimension of $W$!
$endgroup$
If $text{rank}(T) > dim{W}$, then you can find a linearly independent set in $W$ that has more elements than the dimension of $W$!
edited Jan 23 at 3:12
answered Jan 23 at 0:07
MetricMetric
1,25159
1,25159
add a comment |
add a comment |
$begingroup$
Let me address what I think is giving you more of a problem thinking about this:
In vector spaces we have the notion of a basis; that is a set of vectors which are linearly independent and span the whole space. The smallest cardinality (size) of such a basis, which is invariant to the space, is called the dimension.
Now in your case, once you impose the image of $V$ in $W$ (and get a linear space in itself) and ask what the dimension of this image is, you're asking what is the minimal number of vectors I need to span the image. This is by definition less than the required number to span the space $W$ itself. Is this making the question more intuitive?
$endgroup$
add a comment |
$begingroup$
Let me address what I think is giving you more of a problem thinking about this:
In vector spaces we have the notion of a basis; that is a set of vectors which are linearly independent and span the whole space. The smallest cardinality (size) of such a basis, which is invariant to the space, is called the dimension.
Now in your case, once you impose the image of $V$ in $W$ (and get a linear space in itself) and ask what the dimension of this image is, you're asking what is the minimal number of vectors I need to span the image. This is by definition less than the required number to span the space $W$ itself. Is this making the question more intuitive?
$endgroup$
add a comment |
$begingroup$
Let me address what I think is giving you more of a problem thinking about this:
In vector spaces we have the notion of a basis; that is a set of vectors which are linearly independent and span the whole space. The smallest cardinality (size) of such a basis, which is invariant to the space, is called the dimension.
Now in your case, once you impose the image of $V$ in $W$ (and get a linear space in itself) and ask what the dimension of this image is, you're asking what is the minimal number of vectors I need to span the image. This is by definition less than the required number to span the space $W$ itself. Is this making the question more intuitive?
$endgroup$
Let me address what I think is giving you more of a problem thinking about this:
In vector spaces we have the notion of a basis; that is a set of vectors which are linearly independent and span the whole space. The smallest cardinality (size) of such a basis, which is invariant to the space, is called the dimension.
Now in your case, once you impose the image of $V$ in $W$ (and get a linear space in itself) and ask what the dimension of this image is, you're asking what is the minimal number of vectors I need to span the image. This is by definition less than the required number to span the space $W$ itself. Is this making the question more intuitive?
answered Jan 22 at 22:54
MariahMariah
1,5611718
1,5611718
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%2f3083818%2fwhy-the-dimension-of-the-range-of-linear-map-is-smaller-than-the-dimension-of-w%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