Prove that $W$ is the direct sum $text{im}(T) oplus ker (S)$
$begingroup$
The Problem:
Suppose $V,W$ are vector spaces over $F$ and $T:V to W, S:W to V$ are linear transformations. Suppose also that $S circ T$ is an isomorphism. Prove that $W$ is the direct sum $text{im}(T) oplus ker (S)$.
My Approach:
Put $A = text{im}(T)$ and $B = ker (S)$. We need to show that $A cap B = {0}$ and $W = A + B$.
For $A cap B = {0}$ (I think I've got this part): Clearly, ${0} subset A cap B$ (as $A cap B$ is a subspace of $W$). Now, if $x in A cap B subset W$, then $x = T(v)$, for some $v in V$; and so $S(x) = S(T(v)) = 0$, since $x$ is in the kernel of $S$. But since $ST$ is an isomorphism, it must map $0$ to $0$ injectively (right?); and so $T(v)$ must be $0$. Thus, since $T(v) = x$, it follows that $x = 0$; i.e., $A cap B = {0}$.
For $W = A + B$: Let $w in W$, and write $w = w_1 + w_2$ (which is obviously permitted). Then, since $S$ and $T$ are linear, $S(w) = S(w_1 + w_2) = S(w_1) + S(w_2) in V$; and so $T(S(w)) = T(S(w_1)) + T(S(w_2)) in W$. Thus, $S(w_1)$ and $S(w_2)$ are in $A$... I'm not really sure where I'm going with this...
linear-algebra
$endgroup$
add a comment |
$begingroup$
The Problem:
Suppose $V,W$ are vector spaces over $F$ and $T:V to W, S:W to V$ are linear transformations. Suppose also that $S circ T$ is an isomorphism. Prove that $W$ is the direct sum $text{im}(T) oplus ker (S)$.
My Approach:
Put $A = text{im}(T)$ and $B = ker (S)$. We need to show that $A cap B = {0}$ and $W = A + B$.
For $A cap B = {0}$ (I think I've got this part): Clearly, ${0} subset A cap B$ (as $A cap B$ is a subspace of $W$). Now, if $x in A cap B subset W$, then $x = T(v)$, for some $v in V$; and so $S(x) = S(T(v)) = 0$, since $x$ is in the kernel of $S$. But since $ST$ is an isomorphism, it must map $0$ to $0$ injectively (right?); and so $T(v)$ must be $0$. Thus, since $T(v) = x$, it follows that $x = 0$; i.e., $A cap B = {0}$.
For $W = A + B$: Let $w in W$, and write $w = w_1 + w_2$ (which is obviously permitted). Then, since $S$ and $T$ are linear, $S(w) = S(w_1 + w_2) = S(w_1) + S(w_2) in V$; and so $T(S(w)) = T(S(w_1)) + T(S(w_2)) in W$. Thus, $S(w_1)$ and $S(w_2)$ are in $A$... I'm not really sure where I'm going with this...
linear-algebra
$endgroup$
add a comment |
$begingroup$
The Problem:
Suppose $V,W$ are vector spaces over $F$ and $T:V to W, S:W to V$ are linear transformations. Suppose also that $S circ T$ is an isomorphism. Prove that $W$ is the direct sum $text{im}(T) oplus ker (S)$.
My Approach:
Put $A = text{im}(T)$ and $B = ker (S)$. We need to show that $A cap B = {0}$ and $W = A + B$.
For $A cap B = {0}$ (I think I've got this part): Clearly, ${0} subset A cap B$ (as $A cap B$ is a subspace of $W$). Now, if $x in A cap B subset W$, then $x = T(v)$, for some $v in V$; and so $S(x) = S(T(v)) = 0$, since $x$ is in the kernel of $S$. But since $ST$ is an isomorphism, it must map $0$ to $0$ injectively (right?); and so $T(v)$ must be $0$. Thus, since $T(v) = x$, it follows that $x = 0$; i.e., $A cap B = {0}$.
For $W = A + B$: Let $w in W$, and write $w = w_1 + w_2$ (which is obviously permitted). Then, since $S$ and $T$ are linear, $S(w) = S(w_1 + w_2) = S(w_1) + S(w_2) in V$; and so $T(S(w)) = T(S(w_1)) + T(S(w_2)) in W$. Thus, $S(w_1)$ and $S(w_2)$ are in $A$... I'm not really sure where I'm going with this...
linear-algebra
$endgroup$
The Problem:
Suppose $V,W$ are vector spaces over $F$ and $T:V to W, S:W to V$ are linear transformations. Suppose also that $S circ T$ is an isomorphism. Prove that $W$ is the direct sum $text{im}(T) oplus ker (S)$.
My Approach:
Put $A = text{im}(T)$ and $B = ker (S)$. We need to show that $A cap B = {0}$ and $W = A + B$.
For $A cap B = {0}$ (I think I've got this part): Clearly, ${0} subset A cap B$ (as $A cap B$ is a subspace of $W$). Now, if $x in A cap B subset W$, then $x = T(v)$, for some $v in V$; and so $S(x) = S(T(v)) = 0$, since $x$ is in the kernel of $S$. But since $ST$ is an isomorphism, it must map $0$ to $0$ injectively (right?); and so $T(v)$ must be $0$. Thus, since $T(v) = x$, it follows that $x = 0$; i.e., $A cap B = {0}$.
For $W = A + B$: Let $w in W$, and write $w = w_1 + w_2$ (which is obviously permitted). Then, since $S$ and $T$ are linear, $S(w) = S(w_1 + w_2) = S(w_1) + S(w_2) in V$; and so $T(S(w)) = T(S(w_1)) + T(S(w_2)) in W$. Thus, $S(w_1)$ and $S(w_2)$ are in $A$... I'm not really sure where I'm going with this...
linear-algebra
linear-algebra
asked Jan 15 at 1:33
thisisourconcerndudethisisourconcerndude
1,1271022
1,1271022
add a comment |
add a comment |
2 Answers
2
active
oldest
votes
$begingroup$
You have not specified what $w_1$ and $w_2$ are, so it is not clear to me what are you claiming to be obviously permitted. As for the first part, you reasoning is correct.
Here's a hint: take $w in W$. Now, $S(w)$ is an element of $V$, and so by surjectivity of $ST$ we have that $S(w) = ST(y)$ for some $y$ in $V$. Note that if we were indeed successful in writing $w = T(a) + b$ for $a$ in $V$ and $b$ in $ker S$, we should necessarily have that $S(w) = ST(a)$ and $b = w - T(a)$. Can you take it from here? A solution follows:
Via the last observation, since $w = w - T(y) + T(y)$ and $T(y)$ is in the image of $T$, it suffices to see that $w-T(y)$ is in the kernel of $S$, which holds by construction: $S(w-T(y)) = S(w) - ST(y) = 0$.
$endgroup$
add a comment |
$begingroup$
Your proof that $A cap B = {0}$ is correct.
To show $W = A + B$, you'll need to consider the inverse of $ST$, call it $R$. Assuming for the moment that $w = a + b$ where $a in A$ and $b in B$ (only for the moment; keeping this step would make the proof circular!), we have
$$S(w) = S(a) + S(b) = S(a) = ST(x),$$
where $a = T(x)$ for some $x in V$, as $a in operatorname{Im} T$. Solving this, we obtain that
$$x = RS(w) implies a = T(x) = TRS(w).$$
This is the expression we need! So, it leaves us to show that
$$w = TRS(w) + (w - TRS(w))$$
is the decomposition we want. Note, of course, $TRS(w) in operatorname{Im} T$. We also have,
$$S(w - TRS(w)) = S(w) - (ST)RS(w) = S(w) - S(w) = 0$$
so $w - TRS(w) in operatorname{ker}(S)$, as needed.
$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%2f3073975%2fprove-that-w-is-the-direct-sum-textimt-oplus-ker-s%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$
You have not specified what $w_1$ and $w_2$ are, so it is not clear to me what are you claiming to be obviously permitted. As for the first part, you reasoning is correct.
Here's a hint: take $w in W$. Now, $S(w)$ is an element of $V$, and so by surjectivity of $ST$ we have that $S(w) = ST(y)$ for some $y$ in $V$. Note that if we were indeed successful in writing $w = T(a) + b$ for $a$ in $V$ and $b$ in $ker S$, we should necessarily have that $S(w) = ST(a)$ and $b = w - T(a)$. Can you take it from here? A solution follows:
Via the last observation, since $w = w - T(y) + T(y)$ and $T(y)$ is in the image of $T$, it suffices to see that $w-T(y)$ is in the kernel of $S$, which holds by construction: $S(w-T(y)) = S(w) - ST(y) = 0$.
$endgroup$
add a comment |
$begingroup$
You have not specified what $w_1$ and $w_2$ are, so it is not clear to me what are you claiming to be obviously permitted. As for the first part, you reasoning is correct.
Here's a hint: take $w in W$. Now, $S(w)$ is an element of $V$, and so by surjectivity of $ST$ we have that $S(w) = ST(y)$ for some $y$ in $V$. Note that if we were indeed successful in writing $w = T(a) + b$ for $a$ in $V$ and $b$ in $ker S$, we should necessarily have that $S(w) = ST(a)$ and $b = w - T(a)$. Can you take it from here? A solution follows:
Via the last observation, since $w = w - T(y) + T(y)$ and $T(y)$ is in the image of $T$, it suffices to see that $w-T(y)$ is in the kernel of $S$, which holds by construction: $S(w-T(y)) = S(w) - ST(y) = 0$.
$endgroup$
add a comment |
$begingroup$
You have not specified what $w_1$ and $w_2$ are, so it is not clear to me what are you claiming to be obviously permitted. As for the first part, you reasoning is correct.
Here's a hint: take $w in W$. Now, $S(w)$ is an element of $V$, and so by surjectivity of $ST$ we have that $S(w) = ST(y)$ for some $y$ in $V$. Note that if we were indeed successful in writing $w = T(a) + b$ for $a$ in $V$ and $b$ in $ker S$, we should necessarily have that $S(w) = ST(a)$ and $b = w - T(a)$. Can you take it from here? A solution follows:
Via the last observation, since $w = w - T(y) + T(y)$ and $T(y)$ is in the image of $T$, it suffices to see that $w-T(y)$ is in the kernel of $S$, which holds by construction: $S(w-T(y)) = S(w) - ST(y) = 0$.
$endgroup$
You have not specified what $w_1$ and $w_2$ are, so it is not clear to me what are you claiming to be obviously permitted. As for the first part, you reasoning is correct.
Here's a hint: take $w in W$. Now, $S(w)$ is an element of $V$, and so by surjectivity of $ST$ we have that $S(w) = ST(y)$ for some $y$ in $V$. Note that if we were indeed successful in writing $w = T(a) + b$ for $a$ in $V$ and $b$ in $ker S$, we should necessarily have that $S(w) = ST(a)$ and $b = w - T(a)$. Can you take it from here? A solution follows:
Via the last observation, since $w = w - T(y) + T(y)$ and $T(y)$ is in the image of $T$, it suffices to see that $w-T(y)$ is in the kernel of $S$, which holds by construction: $S(w-T(y)) = S(w) - ST(y) = 0$.
edited Jan 15 at 1:53
answered Jan 15 at 1:46


Guido A.Guido A.
7,3821730
7,3821730
add a comment |
add a comment |
$begingroup$
Your proof that $A cap B = {0}$ is correct.
To show $W = A + B$, you'll need to consider the inverse of $ST$, call it $R$. Assuming for the moment that $w = a + b$ where $a in A$ and $b in B$ (only for the moment; keeping this step would make the proof circular!), we have
$$S(w) = S(a) + S(b) = S(a) = ST(x),$$
where $a = T(x)$ for some $x in V$, as $a in operatorname{Im} T$. Solving this, we obtain that
$$x = RS(w) implies a = T(x) = TRS(w).$$
This is the expression we need! So, it leaves us to show that
$$w = TRS(w) + (w - TRS(w))$$
is the decomposition we want. Note, of course, $TRS(w) in operatorname{Im} T$. We also have,
$$S(w - TRS(w)) = S(w) - (ST)RS(w) = S(w) - S(w) = 0$$
so $w - TRS(w) in operatorname{ker}(S)$, as needed.
$endgroup$
add a comment |
$begingroup$
Your proof that $A cap B = {0}$ is correct.
To show $W = A + B$, you'll need to consider the inverse of $ST$, call it $R$. Assuming for the moment that $w = a + b$ where $a in A$ and $b in B$ (only for the moment; keeping this step would make the proof circular!), we have
$$S(w) = S(a) + S(b) = S(a) = ST(x),$$
where $a = T(x)$ for some $x in V$, as $a in operatorname{Im} T$. Solving this, we obtain that
$$x = RS(w) implies a = T(x) = TRS(w).$$
This is the expression we need! So, it leaves us to show that
$$w = TRS(w) + (w - TRS(w))$$
is the decomposition we want. Note, of course, $TRS(w) in operatorname{Im} T$. We also have,
$$S(w - TRS(w)) = S(w) - (ST)RS(w) = S(w) - S(w) = 0$$
so $w - TRS(w) in operatorname{ker}(S)$, as needed.
$endgroup$
add a comment |
$begingroup$
Your proof that $A cap B = {0}$ is correct.
To show $W = A + B$, you'll need to consider the inverse of $ST$, call it $R$. Assuming for the moment that $w = a + b$ where $a in A$ and $b in B$ (only for the moment; keeping this step would make the proof circular!), we have
$$S(w) = S(a) + S(b) = S(a) = ST(x),$$
where $a = T(x)$ for some $x in V$, as $a in operatorname{Im} T$. Solving this, we obtain that
$$x = RS(w) implies a = T(x) = TRS(w).$$
This is the expression we need! So, it leaves us to show that
$$w = TRS(w) + (w - TRS(w))$$
is the decomposition we want. Note, of course, $TRS(w) in operatorname{Im} T$. We also have,
$$S(w - TRS(w)) = S(w) - (ST)RS(w) = S(w) - S(w) = 0$$
so $w - TRS(w) in operatorname{ker}(S)$, as needed.
$endgroup$
Your proof that $A cap B = {0}$ is correct.
To show $W = A + B$, you'll need to consider the inverse of $ST$, call it $R$. Assuming for the moment that $w = a + b$ where $a in A$ and $b in B$ (only for the moment; keeping this step would make the proof circular!), we have
$$S(w) = S(a) + S(b) = S(a) = ST(x),$$
where $a = T(x)$ for some $x in V$, as $a in operatorname{Im} T$. Solving this, we obtain that
$$x = RS(w) implies a = T(x) = TRS(w).$$
This is the expression we need! So, it leaves us to show that
$$w = TRS(w) + (w - TRS(w))$$
is the decomposition we want. Note, of course, $TRS(w) in operatorname{Im} T$. We also have,
$$S(w - TRS(w)) = S(w) - (ST)RS(w) = S(w) - S(w) = 0$$
so $w - TRS(w) in operatorname{ker}(S)$, as needed.
answered Jan 15 at 1:49
Theo BenditTheo Bendit
18.5k12152
18.5k12152
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%2f3073975%2fprove-that-w-is-the-direct-sum-textimt-oplus-ker-s%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