Proof of Thm: For a linear map $f:Vto W$ with $Xsubset V$, $Ysubset W$ with $Xcap f^{-1}[Y]={0}$, we have a...
$begingroup$
I'm reading a chapter in my Linear Algebra book about nilpotent endomorphisms and it contains the following theorem: Let $f:Vto W$ be linear map and $Xsubset V$, $Ysubset W$ such that $Xcap f^{-1}[Y]={0}$. Then $f$ restricted to $X$ is injective and $f[X]cap Y={0}$. The first rule of the proof is: The function $f|_X$ satisfies $ker(f|_X)=Xcapker(f)subset Xcap f^{-1}[Y]={0}$. However I have no clue whatsoever why this inclusion holds. May be there is something I'm missing and I hope someone can help.
linear-algebra
$endgroup$
add a comment |
$begingroup$
I'm reading a chapter in my Linear Algebra book about nilpotent endomorphisms and it contains the following theorem: Let $f:Vto W$ be linear map and $Xsubset V$, $Ysubset W$ such that $Xcap f^{-1}[Y]={0}$. Then $f$ restricted to $X$ is injective and $f[X]cap Y={0}$. The first rule of the proof is: The function $f|_X$ satisfies $ker(f|_X)=Xcapker(f)subset Xcap f^{-1}[Y]={0}$. However I have no clue whatsoever why this inclusion holds. May be there is something I'm missing and I hope someone can help.
linear-algebra
$endgroup$
add a comment |
$begingroup$
I'm reading a chapter in my Linear Algebra book about nilpotent endomorphisms and it contains the following theorem: Let $f:Vto W$ be linear map and $Xsubset V$, $Ysubset W$ such that $Xcap f^{-1}[Y]={0}$. Then $f$ restricted to $X$ is injective and $f[X]cap Y={0}$. The first rule of the proof is: The function $f|_X$ satisfies $ker(f|_X)=Xcapker(f)subset Xcap f^{-1}[Y]={0}$. However I have no clue whatsoever why this inclusion holds. May be there is something I'm missing and I hope someone can help.
linear-algebra
$endgroup$
I'm reading a chapter in my Linear Algebra book about nilpotent endomorphisms and it contains the following theorem: Let $f:Vto W$ be linear map and $Xsubset V$, $Ysubset W$ such that $Xcap f^{-1}[Y]={0}$. Then $f$ restricted to $X$ is injective and $f[X]cap Y={0}$. The first rule of the proof is: The function $f|_X$ satisfies $ker(f|_X)=Xcapker(f)subset Xcap f^{-1}[Y]={0}$. However I have no clue whatsoever why this inclusion holds. May be there is something I'm missing and I hope someone can help.
linear-algebra
linear-algebra
edited Dec 22 '18 at 15:35
Sander Korteweg
asked Dec 22 '18 at 15:28
Sander KortewegSander Korteweg
205
205
add a comment |
add a comment |
3 Answers
3
active
oldest
votes
$begingroup$
Let $x in X capker(f)$. Assume that $x ne 0$. Then $x notin f^{-1}(Y)$ since $X cap f^{-1}(Y) = { 0 }$. Hence $f(x) notin Y$ and therefore $f(x) ne 0$. Thus $x notinker(f)$, a contradiction.
Edited: Although probably $X, Y$ are assumed to be linear subspaces of $V, W$, the proof works for arbitrary subsets $X, Y$. The key is that $f(x) notin Y$ implies $f(x) ne 0$. This follows from $X cap f^{-1}(Y) = { 0 }$: We have $0 in f^{-1}(Y)$ and therefore $0 = f(0) in Y$.
$endgroup$
add a comment |
$begingroup$
$Xcap f^{-1}[Y]={0_V}implies 0_Vin f^{-1}[Y]implies f(0_V)=0_Win Y$
Since $0_W$ belongs to $Y$, the entire null-space of $f,ker(f)subseteq f^{-1}[Y]$.$$therefore Xcapker(f)subseteq Xcap f^{-1}[Y]$$Since $Xcap f^{-1}[Y]$ contains only $0_V$, no other element of $ker(f)$ is contained in $X.$
$$thereforeker(fBig|_X)={0_V}$$
$endgroup$
add a comment |
$begingroup$
The kernel is $ker(f)=f^{-1}[{0}]$ and $f^{-1}[{0}]subseteq f^{-1}[Y]$. More generally, if $S$ and $T$ are subsets of $W$, then $Ssubseteq T$ implies $f^{-1}[S]subseteq f^{-1}[T]$; indeed, if $vin f^{-1}[S]$, then $f(v)in S$, so $f(v)in T$, hence $vin f^{-1}[T]$.
Therefore
$$
Xcapker(f)=Xcap f^{-1}[{0}]subseteq Xcap f^{-1}[Y]
$$
The fact that $ker(f|_X)=Xcapker(f)$ follows immediately from the definition of kernel and of restriction map.
Why is $f[X]cap Y={0}$? Well, if $vin X$, then $f(v)in Y$ implies $vin f^{-1}[Y]$; therefore $vin Xcap f^{-1}[Y]$ and therefore $v=0$, so $f(v)=0$.
$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%2f3049548%2fproof-of-thm-for-a-linear-map-fv-to-w-with-x-subset-v-y-subset-w-with%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
3 Answers
3
active
oldest
votes
3 Answers
3
active
oldest
votes
active
oldest
votes
active
oldest
votes
$begingroup$
Let $x in X capker(f)$. Assume that $x ne 0$. Then $x notin f^{-1}(Y)$ since $X cap f^{-1}(Y) = { 0 }$. Hence $f(x) notin Y$ and therefore $f(x) ne 0$. Thus $x notinker(f)$, a contradiction.
Edited: Although probably $X, Y$ are assumed to be linear subspaces of $V, W$, the proof works for arbitrary subsets $X, Y$. The key is that $f(x) notin Y$ implies $f(x) ne 0$. This follows from $X cap f^{-1}(Y) = { 0 }$: We have $0 in f^{-1}(Y)$ and therefore $0 = f(0) in Y$.
$endgroup$
add a comment |
$begingroup$
Let $x in X capker(f)$. Assume that $x ne 0$. Then $x notin f^{-1}(Y)$ since $X cap f^{-1}(Y) = { 0 }$. Hence $f(x) notin Y$ and therefore $f(x) ne 0$. Thus $x notinker(f)$, a contradiction.
Edited: Although probably $X, Y$ are assumed to be linear subspaces of $V, W$, the proof works for arbitrary subsets $X, Y$. The key is that $f(x) notin Y$ implies $f(x) ne 0$. This follows from $X cap f^{-1}(Y) = { 0 }$: We have $0 in f^{-1}(Y)$ and therefore $0 = f(0) in Y$.
$endgroup$
add a comment |
$begingroup$
Let $x in X capker(f)$. Assume that $x ne 0$. Then $x notin f^{-1}(Y)$ since $X cap f^{-1}(Y) = { 0 }$. Hence $f(x) notin Y$ and therefore $f(x) ne 0$. Thus $x notinker(f)$, a contradiction.
Edited: Although probably $X, Y$ are assumed to be linear subspaces of $V, W$, the proof works for arbitrary subsets $X, Y$. The key is that $f(x) notin Y$ implies $f(x) ne 0$. This follows from $X cap f^{-1}(Y) = { 0 }$: We have $0 in f^{-1}(Y)$ and therefore $0 = f(0) in Y$.
$endgroup$
Let $x in X capker(f)$. Assume that $x ne 0$. Then $x notin f^{-1}(Y)$ since $X cap f^{-1}(Y) = { 0 }$. Hence $f(x) notin Y$ and therefore $f(x) ne 0$. Thus $x notinker(f)$, a contradiction.
Edited: Although probably $X, Y$ are assumed to be linear subspaces of $V, W$, the proof works for arbitrary subsets $X, Y$. The key is that $f(x) notin Y$ implies $f(x) ne 0$. This follows from $X cap f^{-1}(Y) = { 0 }$: We have $0 in f^{-1}(Y)$ and therefore $0 = f(0) in Y$.
edited Dec 22 '18 at 16:02
answered Dec 22 '18 at 15:45
Paul FrostPaul Frost
10.3k3933
10.3k3933
add a comment |
add a comment |
$begingroup$
$Xcap f^{-1}[Y]={0_V}implies 0_Vin f^{-1}[Y]implies f(0_V)=0_Win Y$
Since $0_W$ belongs to $Y$, the entire null-space of $f,ker(f)subseteq f^{-1}[Y]$.$$therefore Xcapker(f)subseteq Xcap f^{-1}[Y]$$Since $Xcap f^{-1}[Y]$ contains only $0_V$, no other element of $ker(f)$ is contained in $X.$
$$thereforeker(fBig|_X)={0_V}$$
$endgroup$
add a comment |
$begingroup$
$Xcap f^{-1}[Y]={0_V}implies 0_Vin f^{-1}[Y]implies f(0_V)=0_Win Y$
Since $0_W$ belongs to $Y$, the entire null-space of $f,ker(f)subseteq f^{-1}[Y]$.$$therefore Xcapker(f)subseteq Xcap f^{-1}[Y]$$Since $Xcap f^{-1}[Y]$ contains only $0_V$, no other element of $ker(f)$ is contained in $X.$
$$thereforeker(fBig|_X)={0_V}$$
$endgroup$
add a comment |
$begingroup$
$Xcap f^{-1}[Y]={0_V}implies 0_Vin f^{-1}[Y]implies f(0_V)=0_Win Y$
Since $0_W$ belongs to $Y$, the entire null-space of $f,ker(f)subseteq f^{-1}[Y]$.$$therefore Xcapker(f)subseteq Xcap f^{-1}[Y]$$Since $Xcap f^{-1}[Y]$ contains only $0_V$, no other element of $ker(f)$ is contained in $X.$
$$thereforeker(fBig|_X)={0_V}$$
$endgroup$
$Xcap f^{-1}[Y]={0_V}implies 0_Vin f^{-1}[Y]implies f(0_V)=0_Win Y$
Since $0_W$ belongs to $Y$, the entire null-space of $f,ker(f)subseteq f^{-1}[Y]$.$$therefore Xcapker(f)subseteq Xcap f^{-1}[Y]$$Since $Xcap f^{-1}[Y]$ contains only $0_V$, no other element of $ker(f)$ is contained in $X.$
$$thereforeker(fBig|_X)={0_V}$$
answered Dec 22 '18 at 15:45
Shubham JohriShubham Johri
5,082717
5,082717
add a comment |
add a comment |
$begingroup$
The kernel is $ker(f)=f^{-1}[{0}]$ and $f^{-1}[{0}]subseteq f^{-1}[Y]$. More generally, if $S$ and $T$ are subsets of $W$, then $Ssubseteq T$ implies $f^{-1}[S]subseteq f^{-1}[T]$; indeed, if $vin f^{-1}[S]$, then $f(v)in S$, so $f(v)in T$, hence $vin f^{-1}[T]$.
Therefore
$$
Xcapker(f)=Xcap f^{-1}[{0}]subseteq Xcap f^{-1}[Y]
$$
The fact that $ker(f|_X)=Xcapker(f)$ follows immediately from the definition of kernel and of restriction map.
Why is $f[X]cap Y={0}$? Well, if $vin X$, then $f(v)in Y$ implies $vin f^{-1}[Y]$; therefore $vin Xcap f^{-1}[Y]$ and therefore $v=0$, so $f(v)=0$.
$endgroup$
add a comment |
$begingroup$
The kernel is $ker(f)=f^{-1}[{0}]$ and $f^{-1}[{0}]subseteq f^{-1}[Y]$. More generally, if $S$ and $T$ are subsets of $W$, then $Ssubseteq T$ implies $f^{-1}[S]subseteq f^{-1}[T]$; indeed, if $vin f^{-1}[S]$, then $f(v)in S$, so $f(v)in T$, hence $vin f^{-1}[T]$.
Therefore
$$
Xcapker(f)=Xcap f^{-1}[{0}]subseteq Xcap f^{-1}[Y]
$$
The fact that $ker(f|_X)=Xcapker(f)$ follows immediately from the definition of kernel and of restriction map.
Why is $f[X]cap Y={0}$? Well, if $vin X$, then $f(v)in Y$ implies $vin f^{-1}[Y]$; therefore $vin Xcap f^{-1}[Y]$ and therefore $v=0$, so $f(v)=0$.
$endgroup$
add a comment |
$begingroup$
The kernel is $ker(f)=f^{-1}[{0}]$ and $f^{-1}[{0}]subseteq f^{-1}[Y]$. More generally, if $S$ and $T$ are subsets of $W$, then $Ssubseteq T$ implies $f^{-1}[S]subseteq f^{-1}[T]$; indeed, if $vin f^{-1}[S]$, then $f(v)in S$, so $f(v)in T$, hence $vin f^{-1}[T]$.
Therefore
$$
Xcapker(f)=Xcap f^{-1}[{0}]subseteq Xcap f^{-1}[Y]
$$
The fact that $ker(f|_X)=Xcapker(f)$ follows immediately from the definition of kernel and of restriction map.
Why is $f[X]cap Y={0}$? Well, if $vin X$, then $f(v)in Y$ implies $vin f^{-1}[Y]$; therefore $vin Xcap f^{-1}[Y]$ and therefore $v=0$, so $f(v)=0$.
$endgroup$
The kernel is $ker(f)=f^{-1}[{0}]$ and $f^{-1}[{0}]subseteq f^{-1}[Y]$. More generally, if $S$ and $T$ are subsets of $W$, then $Ssubseteq T$ implies $f^{-1}[S]subseteq f^{-1}[T]$; indeed, if $vin f^{-1}[S]$, then $f(v)in S$, so $f(v)in T$, hence $vin f^{-1}[T]$.
Therefore
$$
Xcapker(f)=Xcap f^{-1}[{0}]subseteq Xcap f^{-1}[Y]
$$
The fact that $ker(f|_X)=Xcapker(f)$ follows immediately from the definition of kernel and of restriction map.
Why is $f[X]cap Y={0}$? Well, if $vin X$, then $f(v)in Y$ implies $vin f^{-1}[Y]$; therefore $vin Xcap f^{-1}[Y]$ and therefore $v=0$, so $f(v)=0$.
answered Dec 22 '18 at 17:31
egregegreg
181k1485203
181k1485203
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%2f3049548%2fproof-of-thm-for-a-linear-map-fv-to-w-with-x-subset-v-y-subset-w-with%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