Proof $dim(text{im}(f)capker(g)) = dim(text{im}(f))-dim(text{im}(gf))$
$begingroup$
In one of the exercises in my textbook we had to prove the following:
Consider $3$ $K$-vectorspaces $U$, $V$ and $W$ and $2$ maps:
- $fintext{Hom}_K(U,V)$
- $gintext{Hom}_K(V,W)$
then :
begin{equation}
dim(text{im}(f)capker(g)) = dim(text{im}(f))-dim(text{im}(gf))
end{equation}
This proof wasn't addressed during the lectures so I tried to understand it at home but I don't understand most of the steps. The proof is as follows:
We consider the map $g|_{f(U)}:f(U)rightarrow W$ which is the restriction of $g$ to the image $text{im}(f)leqslant V$.
begin{equation}
begin{split}
dim(text{im}(f)) & = dim(ker(g|_{f(U)})) + dim(text{im}(g|_{f(U)})) \
& = dim({vintext{im}(f);|;g(v) = 0}) + dim({g(v);|; vintext{im}(f)}) \
& = dim(text{im}(f)capker(g)) + dim({(gf)(w);|;win U}) \
& = dim(text{im}(f)capker(g)) + dim(text{im}(gf))
end{split}
end{equation}
And then the formula follows from this.
My guess is that in the firs step they use the following:
begin{equation}
dim(V) = dim(ker(f))+dim(text{im}(f))
end{equation}
But I don't quite get why they use $g|_{f(U)}$ as the function in this equation and where it comes from. I also need some help understanding the transition between step 1 and 2 and between 2 and 3. The last step I do understand. Would someone be able to explain this?
linear-algebra functions vector-spaces
$endgroup$
add a comment |
$begingroup$
In one of the exercises in my textbook we had to prove the following:
Consider $3$ $K$-vectorspaces $U$, $V$ and $W$ and $2$ maps:
- $fintext{Hom}_K(U,V)$
- $gintext{Hom}_K(V,W)$
then :
begin{equation}
dim(text{im}(f)capker(g)) = dim(text{im}(f))-dim(text{im}(gf))
end{equation}
This proof wasn't addressed during the lectures so I tried to understand it at home but I don't understand most of the steps. The proof is as follows:
We consider the map $g|_{f(U)}:f(U)rightarrow W$ which is the restriction of $g$ to the image $text{im}(f)leqslant V$.
begin{equation}
begin{split}
dim(text{im}(f)) & = dim(ker(g|_{f(U)})) + dim(text{im}(g|_{f(U)})) \
& = dim({vintext{im}(f);|;g(v) = 0}) + dim({g(v);|; vintext{im}(f)}) \
& = dim(text{im}(f)capker(g)) + dim({(gf)(w);|;win U}) \
& = dim(text{im}(f)capker(g)) + dim(text{im}(gf))
end{split}
end{equation}
And then the formula follows from this.
My guess is that in the firs step they use the following:
begin{equation}
dim(V) = dim(ker(f))+dim(text{im}(f))
end{equation}
But I don't quite get why they use $g|_{f(U)}$ as the function in this equation and where it comes from. I also need some help understanding the transition between step 1 and 2 and between 2 and 3. The last step I do understand. Would someone be able to explain this?
linear-algebra functions vector-spaces
$endgroup$
$begingroup$
yes, the definition of kernel is: $ker(f) := {vin V;|;f(v) = 0}$ so you could say that after the function the kernel is all the vectors that do not have an image so their image is the nullspace, and the image is: $text{im}(f) := {f(v);|; vin V}$ if $f:Vrightarrow W$ is a linear map between $2$ $K$-vectorspaces so i guess the image is what isn't in the kernel en vice versa.
$endgroup$
– Viktor
Jan 12 at 15:31
add a comment |
$begingroup$
In one of the exercises in my textbook we had to prove the following:
Consider $3$ $K$-vectorspaces $U$, $V$ and $W$ and $2$ maps:
- $fintext{Hom}_K(U,V)$
- $gintext{Hom}_K(V,W)$
then :
begin{equation}
dim(text{im}(f)capker(g)) = dim(text{im}(f))-dim(text{im}(gf))
end{equation}
This proof wasn't addressed during the lectures so I tried to understand it at home but I don't understand most of the steps. The proof is as follows:
We consider the map $g|_{f(U)}:f(U)rightarrow W$ which is the restriction of $g$ to the image $text{im}(f)leqslant V$.
begin{equation}
begin{split}
dim(text{im}(f)) & = dim(ker(g|_{f(U)})) + dim(text{im}(g|_{f(U)})) \
& = dim({vintext{im}(f);|;g(v) = 0}) + dim({g(v);|; vintext{im}(f)}) \
& = dim(text{im}(f)capker(g)) + dim({(gf)(w);|;win U}) \
& = dim(text{im}(f)capker(g)) + dim(text{im}(gf))
end{split}
end{equation}
And then the formula follows from this.
My guess is that in the firs step they use the following:
begin{equation}
dim(V) = dim(ker(f))+dim(text{im}(f))
end{equation}
But I don't quite get why they use $g|_{f(U)}$ as the function in this equation and where it comes from. I also need some help understanding the transition between step 1 and 2 and between 2 and 3. The last step I do understand. Would someone be able to explain this?
linear-algebra functions vector-spaces
$endgroup$
In one of the exercises in my textbook we had to prove the following:
Consider $3$ $K$-vectorspaces $U$, $V$ and $W$ and $2$ maps:
- $fintext{Hom}_K(U,V)$
- $gintext{Hom}_K(V,W)$
then :
begin{equation}
dim(text{im}(f)capker(g)) = dim(text{im}(f))-dim(text{im}(gf))
end{equation}
This proof wasn't addressed during the lectures so I tried to understand it at home but I don't understand most of the steps. The proof is as follows:
We consider the map $g|_{f(U)}:f(U)rightarrow W$ which is the restriction of $g$ to the image $text{im}(f)leqslant V$.
begin{equation}
begin{split}
dim(text{im}(f)) & = dim(ker(g|_{f(U)})) + dim(text{im}(g|_{f(U)})) \
& = dim({vintext{im}(f);|;g(v) = 0}) + dim({g(v);|; vintext{im}(f)}) \
& = dim(text{im}(f)capker(g)) + dim({(gf)(w);|;win U}) \
& = dim(text{im}(f)capker(g)) + dim(text{im}(gf))
end{split}
end{equation}
And then the formula follows from this.
My guess is that in the firs step they use the following:
begin{equation}
dim(V) = dim(ker(f))+dim(text{im}(f))
end{equation}
But I don't quite get why they use $g|_{f(U)}$ as the function in this equation and where it comes from. I also need some help understanding the transition between step 1 and 2 and between 2 and 3. The last step I do understand. Would someone be able to explain this?
linear-algebra functions vector-spaces
linear-algebra functions vector-spaces
asked Jan 12 at 15:11
ViktorViktor
1389
1389
$begingroup$
yes, the definition of kernel is: $ker(f) := {vin V;|;f(v) = 0}$ so you could say that after the function the kernel is all the vectors that do not have an image so their image is the nullspace, and the image is: $text{im}(f) := {f(v);|; vin V}$ if $f:Vrightarrow W$ is a linear map between $2$ $K$-vectorspaces so i guess the image is what isn't in the kernel en vice versa.
$endgroup$
– Viktor
Jan 12 at 15:31
add a comment |
$begingroup$
yes, the definition of kernel is: $ker(f) := {vin V;|;f(v) = 0}$ so you could say that after the function the kernel is all the vectors that do not have an image so their image is the nullspace, and the image is: $text{im}(f) := {f(v);|; vin V}$ if $f:Vrightarrow W$ is a linear map between $2$ $K$-vectorspaces so i guess the image is what isn't in the kernel en vice versa.
$endgroup$
– Viktor
Jan 12 at 15:31
$begingroup$
yes, the definition of kernel is: $ker(f) := {vin V;|;f(v) = 0}$ so you could say that after the function the kernel is all the vectors that do not have an image so their image is the nullspace, and the image is: $text{im}(f) := {f(v);|; vin V}$ if $f:Vrightarrow W$ is a linear map between $2$ $K$-vectorspaces so i guess the image is what isn't in the kernel en vice versa.
$endgroup$
– Viktor
Jan 12 at 15:31
$begingroup$
yes, the definition of kernel is: $ker(f) := {vin V;|;f(v) = 0}$ so you could say that after the function the kernel is all the vectors that do not have an image so their image is the nullspace, and the image is: $text{im}(f) := {f(v);|; vin V}$ if $f:Vrightarrow W$ is a linear map between $2$ $K$-vectorspaces so i guess the image is what isn't in the kernel en vice versa.
$endgroup$
– Viktor
Jan 12 at 15:31
add a comment |
1 Answer
1
active
oldest
votes
$begingroup$
Before the first step in your proof, the well known consequence is used:
$$ (*) space dim(V) = dim(Ker(g)) + dim(Im(g)) $$
Notice that we have used $g$ above, and $V$ is nothing but its domain. Notice also that we introduced a trick by showing $Im(f) subseteq Dom(g) = V$ therefore, if we study only in the restriction $gmid _{f(U)=Im(f)}$ we can inject it in $(*)$ to obtain the first line in your argument.
$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%2f3070998%2fproof-dim-textimf-cap-kerg-dim-textimf-dim-textimgf%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$
Before the first step in your proof, the well known consequence is used:
$$ (*) space dim(V) = dim(Ker(g)) + dim(Im(g)) $$
Notice that we have used $g$ above, and $V$ is nothing but its domain. Notice also that we introduced a trick by showing $Im(f) subseteq Dom(g) = V$ therefore, if we study only in the restriction $gmid _{f(U)=Im(f)}$ we can inject it in $(*)$ to obtain the first line in your argument.
$endgroup$
add a comment |
$begingroup$
Before the first step in your proof, the well known consequence is used:
$$ (*) space dim(V) = dim(Ker(g)) + dim(Im(g)) $$
Notice that we have used $g$ above, and $V$ is nothing but its domain. Notice also that we introduced a trick by showing $Im(f) subseteq Dom(g) = V$ therefore, if we study only in the restriction $gmid _{f(U)=Im(f)}$ we can inject it in $(*)$ to obtain the first line in your argument.
$endgroup$
add a comment |
$begingroup$
Before the first step in your proof, the well known consequence is used:
$$ (*) space dim(V) = dim(Ker(g)) + dim(Im(g)) $$
Notice that we have used $g$ above, and $V$ is nothing but its domain. Notice also that we introduced a trick by showing $Im(f) subseteq Dom(g) = V$ therefore, if we study only in the restriction $gmid _{f(U)=Im(f)}$ we can inject it in $(*)$ to obtain the first line in your argument.
$endgroup$
Before the first step in your proof, the well known consequence is used:
$$ (*) space dim(V) = dim(Ker(g)) + dim(Im(g)) $$
Notice that we have used $g$ above, and $V$ is nothing but its domain. Notice also that we introduced a trick by showing $Im(f) subseteq Dom(g) = V$ therefore, if we study only in the restriction $gmid _{f(U)=Im(f)}$ we can inject it in $(*)$ to obtain the first line in your argument.
answered Jan 29 at 19:05


freehumoristfreehumorist
351214
351214
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%2f3070998%2fproof-dim-textimf-cap-kerg-dim-textimf-dim-textimgf%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$
yes, the definition of kernel is: $ker(f) := {vin V;|;f(v) = 0}$ so you could say that after the function the kernel is all the vectors that do not have an image so their image is the nullspace, and the image is: $text{im}(f) := {f(v);|; vin V}$ if $f:Vrightarrow W$ is a linear map between $2$ $K$-vectorspaces so i guess the image is what isn't in the kernel en vice versa.
$endgroup$
– Viktor
Jan 12 at 15:31