If $f circ f = 0 $, show that transformations $f + id_x$ and $f - id_x$ are isomorphisms of $X$
$begingroup$
I have a problem with this task:
The linear transformation $f in L(X,X)$ has property $f circ f = 0 $
Show that transformations $f + id_x$ and $f - id_x$ are isomorphisms of $X$ space with itself
If I need to be honest I have no idea how to prove this. I was tryinging something like that:
If $f + id_x$ is isomorphism it must be both injective and surjective.
Ok, but $id_x$ is injective and surjective.
I thought to show that f is surjective but unfortunately sum of two surjectives can give me something what is not surjective...
Maybe the key is in $f circ f = 0 $?
Thanks for your time!
linear-algebra proof-writing
$endgroup$
add a comment |
$begingroup$
I have a problem with this task:
The linear transformation $f in L(X,X)$ has property $f circ f = 0 $
Show that transformations $f + id_x$ and $f - id_x$ are isomorphisms of $X$ space with itself
If I need to be honest I have no idea how to prove this. I was tryinging something like that:
If $f + id_x$ is isomorphism it must be both injective and surjective.
Ok, but $id_x$ is injective and surjective.
I thought to show that f is surjective but unfortunately sum of two surjectives can give me something what is not surjective...
Maybe the key is in $f circ f = 0 $?
Thanks for your time!
linear-algebra proof-writing
$endgroup$
1
$begingroup$
Is $X$ finite dimensional?
$endgroup$
– SmileyCraft
Jan 4 at 23:19
13
$begingroup$
Try to compose them with each other.
$endgroup$
– Torsten Schoeneberg
Jan 4 at 23:21
2
$begingroup$
As people illustrated, one way to prove something is an isomorphism is to actually find its inverse, quite explicitly! A deeper example is the inverse to $I-A$ where norm of the matrix $A$ is small. The trick is to replace formally the variable $x$ below with $A$ -- quite unsettling I know! $(1-x)^{-1}=frac{1}{1-x} = sum_{i=0}^infty x^i$
$endgroup$
– Behnam Esmayli
Jan 4 at 23:50
add a comment |
$begingroup$
I have a problem with this task:
The linear transformation $f in L(X,X)$ has property $f circ f = 0 $
Show that transformations $f + id_x$ and $f - id_x$ are isomorphisms of $X$ space with itself
If I need to be honest I have no idea how to prove this. I was tryinging something like that:
If $f + id_x$ is isomorphism it must be both injective and surjective.
Ok, but $id_x$ is injective and surjective.
I thought to show that f is surjective but unfortunately sum of two surjectives can give me something what is not surjective...
Maybe the key is in $f circ f = 0 $?
Thanks for your time!
linear-algebra proof-writing
$endgroup$
I have a problem with this task:
The linear transformation $f in L(X,X)$ has property $f circ f = 0 $
Show that transformations $f + id_x$ and $f - id_x$ are isomorphisms of $X$ space with itself
If I need to be honest I have no idea how to prove this. I was tryinging something like that:
If $f + id_x$ is isomorphism it must be both injective and surjective.
Ok, but $id_x$ is injective and surjective.
I thought to show that f is surjective but unfortunately sum of two surjectives can give me something what is not surjective...
Maybe the key is in $f circ f = 0 $?
Thanks for your time!
linear-algebra proof-writing
linear-algebra proof-writing
asked Jan 4 at 23:17
VirtualUserVirtualUser
1,096117
1,096117
1
$begingroup$
Is $X$ finite dimensional?
$endgroup$
– SmileyCraft
Jan 4 at 23:19
13
$begingroup$
Try to compose them with each other.
$endgroup$
– Torsten Schoeneberg
Jan 4 at 23:21
2
$begingroup$
As people illustrated, one way to prove something is an isomorphism is to actually find its inverse, quite explicitly! A deeper example is the inverse to $I-A$ where norm of the matrix $A$ is small. The trick is to replace formally the variable $x$ below with $A$ -- quite unsettling I know! $(1-x)^{-1}=frac{1}{1-x} = sum_{i=0}^infty x^i$
$endgroup$
– Behnam Esmayli
Jan 4 at 23:50
add a comment |
1
$begingroup$
Is $X$ finite dimensional?
$endgroup$
– SmileyCraft
Jan 4 at 23:19
13
$begingroup$
Try to compose them with each other.
$endgroup$
– Torsten Schoeneberg
Jan 4 at 23:21
2
$begingroup$
As people illustrated, one way to prove something is an isomorphism is to actually find its inverse, quite explicitly! A deeper example is the inverse to $I-A$ where norm of the matrix $A$ is small. The trick is to replace formally the variable $x$ below with $A$ -- quite unsettling I know! $(1-x)^{-1}=frac{1}{1-x} = sum_{i=0}^infty x^i$
$endgroup$
– Behnam Esmayli
Jan 4 at 23:50
1
1
$begingroup$
Is $X$ finite dimensional?
$endgroup$
– SmileyCraft
Jan 4 at 23:19
$begingroup$
Is $X$ finite dimensional?
$endgroup$
– SmileyCraft
Jan 4 at 23:19
13
13
$begingroup$
Try to compose them with each other.
$endgroup$
– Torsten Schoeneberg
Jan 4 at 23:21
$begingroup$
Try to compose them with each other.
$endgroup$
– Torsten Schoeneberg
Jan 4 at 23:21
2
2
$begingroup$
As people illustrated, one way to prove something is an isomorphism is to actually find its inverse, quite explicitly! A deeper example is the inverse to $I-A$ where norm of the matrix $A$ is small. The trick is to replace formally the variable $x$ below with $A$ -- quite unsettling I know! $(1-x)^{-1}=frac{1}{1-x} = sum_{i=0}^infty x^i$
$endgroup$
– Behnam Esmayli
Jan 4 at 23:50
$begingroup$
As people illustrated, one way to prove something is an isomorphism is to actually find its inverse, quite explicitly! A deeper example is the inverse to $I-A$ where norm of the matrix $A$ is small. The trick is to replace formally the variable $x$ below with $A$ -- quite unsettling I know! $(1-x)^{-1}=frac{1}{1-x} = sum_{i=0}^infty x^i$
$endgroup$
– Behnam Esmayli
Jan 4 at 23:50
add a comment |
5 Answers
5
active
oldest
votes
$begingroup$
$f - id_X$ is an isomorphism iff $-(f - id_X) = id_X - f$ is an isomorphism.
We have
$$[(f + id_X) circ (id_X - f)](x) = ((f +id_X)((id_X - f)(x))) = (f +id_X)(x - f(x)) = (f + id_X)(x) - (f + id_X)(f(x)) = f(x) + x -f(f(x)) - f(x) = x,$$
i.e. $(f + id_X) circ (id_X - f) = id_X$. Similarly$(id_X - f) circ (f + id_X = id_X$.
This shows that $f + id_X, id_X - f$ are inverse isomorphisms.
$endgroup$
add a comment |
$begingroup$
Since $f in L(X,X)$ and $f circ f = 0 $,
we have
$$(id_x + f )circ (id_x-f)= id_x -f + f - (fcirc f)= id_x$$
and
$$(id_x - f )circ (id_x + f)= id_x + f - f - (fcirc f)= id_x$$
So $id_x + f $ and $id_x - f $ are isomorphisms. Since $f-id_x = -(id_x-f)$, we have that $f-id_x$ is an isomorphism. So, we have that $f+id_x$ and $f-id_x$ are isomorphisms.
$endgroup$
add a comment |
$begingroup$
if $hcirc g=idx$ then, $g$ is injective and $h$ is surjective .
$fcirc f-idx=idx=(f-idx)circ(f+idx)=(f+idx)circ(cf-idx)$ and this means that:
-$f+idx$ is injective and $f-idx$ is surjective
-$f-idx$ is surjective and $f+idx$ is injective
And finally you got the answer..
$endgroup$
add a comment |
$begingroup$
If $X$ is finite-dimensional, it suffices to show that $f pm operatorname{id}_X$ is injective, or that its kernel is trivial.
Assume $0 = (f pm operatorname{id}_X)(x) = f(x)pm x$. Hence $f(x) = mp, x$. Applying $f$ to this yields
$$0 = f^2(x) = mp, f(x)$$
so $x = mp, f(x) = 0$.
Hence $f pm operatorname{id}_X$ is an isomorphism.
If $X$ is not finite-dimensional, we also need to show that $f pm operatorname{id}_X$ is surjective. For this, note that for arbitrary $y in X$ we have
$$(f pm operatorname{id}_X)(pm ,y -f(y)) = pm, f(y)-f^2(y) + y mp,f(y) = y$$
$endgroup$
$begingroup$
I think it should be $[pm y-f(y)]$
$endgroup$
– Shubham Johri
Jan 5 at 7:46
$begingroup$
@ShubhamJohri True, thanks.
$endgroup$
– mechanodroid
Jan 5 at 13:50
add a comment |
$begingroup$
As all the other answers have amended my comment by actually going through the computation, I just want to add two levels of generalisations of the result which I see:
i) We only need the abelian group structure on $X$. In other words, with the same proof we get the more general result:
If $A$ is an abelian group and $f in End(A)$ satisfies $fcirc f =0$, then $pm id_A pm f$ are automorphisms of $A$.
ii) Now the $End(A)$ in part i is a unital (but not necessarily commutative) ring $R$ with addition as addition and composition as multiplication, $id_A =1_R$. From this perspective, the result is just a special case of
If $u in R^times$, $n in R$ is nilpotent, and $u$ and $n$ commute with each other, then $u+n in R^times$.
which is proved by a geometric series argument as suggested in Behnam Esmayli's comment. In our special case $n=pm f$ with $n^2=0$, of course the inverse of $u+n$ is just $u^{-1}(1-n)$. See Units and Nilpotents and its many duplicates for a general discussion.
$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%2f3062226%2fif-f-circ-f-0-show-that-transformations-f-id-x-and-f-id-x-are-iso%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
5 Answers
5
active
oldest
votes
5 Answers
5
active
oldest
votes
active
oldest
votes
active
oldest
votes
$begingroup$
$f - id_X$ is an isomorphism iff $-(f - id_X) = id_X - f$ is an isomorphism.
We have
$$[(f + id_X) circ (id_X - f)](x) = ((f +id_X)((id_X - f)(x))) = (f +id_X)(x - f(x)) = (f + id_X)(x) - (f + id_X)(f(x)) = f(x) + x -f(f(x)) - f(x) = x,$$
i.e. $(f + id_X) circ (id_X - f) = id_X$. Similarly$(id_X - f) circ (f + id_X = id_X$.
This shows that $f + id_X, id_X - f$ are inverse isomorphisms.
$endgroup$
add a comment |
$begingroup$
$f - id_X$ is an isomorphism iff $-(f - id_X) = id_X - f$ is an isomorphism.
We have
$$[(f + id_X) circ (id_X - f)](x) = ((f +id_X)((id_X - f)(x))) = (f +id_X)(x - f(x)) = (f + id_X)(x) - (f + id_X)(f(x)) = f(x) + x -f(f(x)) - f(x) = x,$$
i.e. $(f + id_X) circ (id_X - f) = id_X$. Similarly$(id_X - f) circ (f + id_X = id_X$.
This shows that $f + id_X, id_X - f$ are inverse isomorphisms.
$endgroup$
add a comment |
$begingroup$
$f - id_X$ is an isomorphism iff $-(f - id_X) = id_X - f$ is an isomorphism.
We have
$$[(f + id_X) circ (id_X - f)](x) = ((f +id_X)((id_X - f)(x))) = (f +id_X)(x - f(x)) = (f + id_X)(x) - (f + id_X)(f(x)) = f(x) + x -f(f(x)) - f(x) = x,$$
i.e. $(f + id_X) circ (id_X - f) = id_X$. Similarly$(id_X - f) circ (f + id_X = id_X$.
This shows that $f + id_X, id_X - f$ are inverse isomorphisms.
$endgroup$
$f - id_X$ is an isomorphism iff $-(f - id_X) = id_X - f$ is an isomorphism.
We have
$$[(f + id_X) circ (id_X - f)](x) = ((f +id_X)((id_X - f)(x))) = (f +id_X)(x - f(x)) = (f + id_X)(x) - (f + id_X)(f(x)) = f(x) + x -f(f(x)) - f(x) = x,$$
i.e. $(f + id_X) circ (id_X - f) = id_X$. Similarly$(id_X - f) circ (f + id_X = id_X$.
This shows that $f + id_X, id_X - f$ are inverse isomorphisms.
edited Jan 5 at 10:30
answered Jan 4 at 23:35
Paul FrostPaul Frost
11.6k3934
11.6k3934
add a comment |
add a comment |
$begingroup$
Since $f in L(X,X)$ and $f circ f = 0 $,
we have
$$(id_x + f )circ (id_x-f)= id_x -f + f - (fcirc f)= id_x$$
and
$$(id_x - f )circ (id_x + f)= id_x + f - f - (fcirc f)= id_x$$
So $id_x + f $ and $id_x - f $ are isomorphisms. Since $f-id_x = -(id_x-f)$, we have that $f-id_x$ is an isomorphism. So, we have that $f+id_x$ and $f-id_x$ are isomorphisms.
$endgroup$
add a comment |
$begingroup$
Since $f in L(X,X)$ and $f circ f = 0 $,
we have
$$(id_x + f )circ (id_x-f)= id_x -f + f - (fcirc f)= id_x$$
and
$$(id_x - f )circ (id_x + f)= id_x + f - f - (fcirc f)= id_x$$
So $id_x + f $ and $id_x - f $ are isomorphisms. Since $f-id_x = -(id_x-f)$, we have that $f-id_x$ is an isomorphism. So, we have that $f+id_x$ and $f-id_x$ are isomorphisms.
$endgroup$
add a comment |
$begingroup$
Since $f in L(X,X)$ and $f circ f = 0 $,
we have
$$(id_x + f )circ (id_x-f)= id_x -f + f - (fcirc f)= id_x$$
and
$$(id_x - f )circ (id_x + f)= id_x + f - f - (fcirc f)= id_x$$
So $id_x + f $ and $id_x - f $ are isomorphisms. Since $f-id_x = -(id_x-f)$, we have that $f-id_x$ is an isomorphism. So, we have that $f+id_x$ and $f-id_x$ are isomorphisms.
$endgroup$
Since $f in L(X,X)$ and $f circ f = 0 $,
we have
$$(id_x + f )circ (id_x-f)= id_x -f + f - (fcirc f)= id_x$$
and
$$(id_x - f )circ (id_x + f)= id_x + f - f - (fcirc f)= id_x$$
So $id_x + f $ and $id_x - f $ are isomorphisms. Since $f-id_x = -(id_x-f)$, we have that $f-id_x$ is an isomorphism. So, we have that $f+id_x$ and $f-id_x$ are isomorphisms.
edited Jan 5 at 15:07
answered Jan 4 at 23:34
RamiroRamiro
7,22421334
7,22421334
add a comment |
add a comment |
$begingroup$
if $hcirc g=idx$ then, $g$ is injective and $h$ is surjective .
$fcirc f-idx=idx=(f-idx)circ(f+idx)=(f+idx)circ(cf-idx)$ and this means that:
-$f+idx$ is injective and $f-idx$ is surjective
-$f-idx$ is surjective and $f+idx$ is injective
And finally you got the answer..
$endgroup$
add a comment |
$begingroup$
if $hcirc g=idx$ then, $g$ is injective and $h$ is surjective .
$fcirc f-idx=idx=(f-idx)circ(f+idx)=(f+idx)circ(cf-idx)$ and this means that:
-$f+idx$ is injective and $f-idx$ is surjective
-$f-idx$ is surjective and $f+idx$ is injective
And finally you got the answer..
$endgroup$
add a comment |
$begingroup$
if $hcirc g=idx$ then, $g$ is injective and $h$ is surjective .
$fcirc f-idx=idx=(f-idx)circ(f+idx)=(f+idx)circ(cf-idx)$ and this means that:
-$f+idx$ is injective and $f-idx$ is surjective
-$f-idx$ is surjective and $f+idx$ is injective
And finally you got the answer..
$endgroup$
if $hcirc g=idx$ then, $g$ is injective and $h$ is surjective .
$fcirc f-idx=idx=(f-idx)circ(f+idx)=(f+idx)circ(cf-idx)$ and this means that:
-$f+idx$ is injective and $f-idx$ is surjective
-$f-idx$ is surjective and $f+idx$ is injective
And finally you got the answer..
answered Jan 5 at 0:34
user376171
add a comment |
add a comment |
$begingroup$
If $X$ is finite-dimensional, it suffices to show that $f pm operatorname{id}_X$ is injective, or that its kernel is trivial.
Assume $0 = (f pm operatorname{id}_X)(x) = f(x)pm x$. Hence $f(x) = mp, x$. Applying $f$ to this yields
$$0 = f^2(x) = mp, f(x)$$
so $x = mp, f(x) = 0$.
Hence $f pm operatorname{id}_X$ is an isomorphism.
If $X$ is not finite-dimensional, we also need to show that $f pm operatorname{id}_X$ is surjective. For this, note that for arbitrary $y in X$ we have
$$(f pm operatorname{id}_X)(pm ,y -f(y)) = pm, f(y)-f^2(y) + y mp,f(y) = y$$
$endgroup$
$begingroup$
I think it should be $[pm y-f(y)]$
$endgroup$
– Shubham Johri
Jan 5 at 7:46
$begingroup$
@ShubhamJohri True, thanks.
$endgroup$
– mechanodroid
Jan 5 at 13:50
add a comment |
$begingroup$
If $X$ is finite-dimensional, it suffices to show that $f pm operatorname{id}_X$ is injective, or that its kernel is trivial.
Assume $0 = (f pm operatorname{id}_X)(x) = f(x)pm x$. Hence $f(x) = mp, x$. Applying $f$ to this yields
$$0 = f^2(x) = mp, f(x)$$
so $x = mp, f(x) = 0$.
Hence $f pm operatorname{id}_X$ is an isomorphism.
If $X$ is not finite-dimensional, we also need to show that $f pm operatorname{id}_X$ is surjective. For this, note that for arbitrary $y in X$ we have
$$(f pm operatorname{id}_X)(pm ,y -f(y)) = pm, f(y)-f^2(y) + y mp,f(y) = y$$
$endgroup$
$begingroup$
I think it should be $[pm y-f(y)]$
$endgroup$
– Shubham Johri
Jan 5 at 7:46
$begingroup$
@ShubhamJohri True, thanks.
$endgroup$
– mechanodroid
Jan 5 at 13:50
add a comment |
$begingroup$
If $X$ is finite-dimensional, it suffices to show that $f pm operatorname{id}_X$ is injective, or that its kernel is trivial.
Assume $0 = (f pm operatorname{id}_X)(x) = f(x)pm x$. Hence $f(x) = mp, x$. Applying $f$ to this yields
$$0 = f^2(x) = mp, f(x)$$
so $x = mp, f(x) = 0$.
Hence $f pm operatorname{id}_X$ is an isomorphism.
If $X$ is not finite-dimensional, we also need to show that $f pm operatorname{id}_X$ is surjective. For this, note that for arbitrary $y in X$ we have
$$(f pm operatorname{id}_X)(pm ,y -f(y)) = pm, f(y)-f^2(y) + y mp,f(y) = y$$
$endgroup$
If $X$ is finite-dimensional, it suffices to show that $f pm operatorname{id}_X$ is injective, or that its kernel is trivial.
Assume $0 = (f pm operatorname{id}_X)(x) = f(x)pm x$. Hence $f(x) = mp, x$. Applying $f$ to this yields
$$0 = f^2(x) = mp, f(x)$$
so $x = mp, f(x) = 0$.
Hence $f pm operatorname{id}_X$ is an isomorphism.
If $X$ is not finite-dimensional, we also need to show that $f pm operatorname{id}_X$ is surjective. For this, note that for arbitrary $y in X$ we have
$$(f pm operatorname{id}_X)(pm ,y -f(y)) = pm, f(y)-f^2(y) + y mp,f(y) = y$$
edited Jan 5 at 13:49
answered Jan 4 at 23:48
mechanodroidmechanodroid
28.7k62548
28.7k62548
$begingroup$
I think it should be $[pm y-f(y)]$
$endgroup$
– Shubham Johri
Jan 5 at 7:46
$begingroup$
@ShubhamJohri True, thanks.
$endgroup$
– mechanodroid
Jan 5 at 13:50
add a comment |
$begingroup$
I think it should be $[pm y-f(y)]$
$endgroup$
– Shubham Johri
Jan 5 at 7:46
$begingroup$
@ShubhamJohri True, thanks.
$endgroup$
– mechanodroid
Jan 5 at 13:50
$begingroup$
I think it should be $[pm y-f(y)]$
$endgroup$
– Shubham Johri
Jan 5 at 7:46
$begingroup$
I think it should be $[pm y-f(y)]$
$endgroup$
– Shubham Johri
Jan 5 at 7:46
$begingroup$
@ShubhamJohri True, thanks.
$endgroup$
– mechanodroid
Jan 5 at 13:50
$begingroup$
@ShubhamJohri True, thanks.
$endgroup$
– mechanodroid
Jan 5 at 13:50
add a comment |
$begingroup$
As all the other answers have amended my comment by actually going through the computation, I just want to add two levels of generalisations of the result which I see:
i) We only need the abelian group structure on $X$. In other words, with the same proof we get the more general result:
If $A$ is an abelian group and $f in End(A)$ satisfies $fcirc f =0$, then $pm id_A pm f$ are automorphisms of $A$.
ii) Now the $End(A)$ in part i is a unital (but not necessarily commutative) ring $R$ with addition as addition and composition as multiplication, $id_A =1_R$. From this perspective, the result is just a special case of
If $u in R^times$, $n in R$ is nilpotent, and $u$ and $n$ commute with each other, then $u+n in R^times$.
which is proved by a geometric series argument as suggested in Behnam Esmayli's comment. In our special case $n=pm f$ with $n^2=0$, of course the inverse of $u+n$ is just $u^{-1}(1-n)$. See Units and Nilpotents and its many duplicates for a general discussion.
$endgroup$
add a comment |
$begingroup$
As all the other answers have amended my comment by actually going through the computation, I just want to add two levels of generalisations of the result which I see:
i) We only need the abelian group structure on $X$. In other words, with the same proof we get the more general result:
If $A$ is an abelian group and $f in End(A)$ satisfies $fcirc f =0$, then $pm id_A pm f$ are automorphisms of $A$.
ii) Now the $End(A)$ in part i is a unital (but not necessarily commutative) ring $R$ with addition as addition and composition as multiplication, $id_A =1_R$. From this perspective, the result is just a special case of
If $u in R^times$, $n in R$ is nilpotent, and $u$ and $n$ commute with each other, then $u+n in R^times$.
which is proved by a geometric series argument as suggested in Behnam Esmayli's comment. In our special case $n=pm f$ with $n^2=0$, of course the inverse of $u+n$ is just $u^{-1}(1-n)$. See Units and Nilpotents and its many duplicates for a general discussion.
$endgroup$
add a comment |
$begingroup$
As all the other answers have amended my comment by actually going through the computation, I just want to add two levels of generalisations of the result which I see:
i) We only need the abelian group structure on $X$. In other words, with the same proof we get the more general result:
If $A$ is an abelian group and $f in End(A)$ satisfies $fcirc f =0$, then $pm id_A pm f$ are automorphisms of $A$.
ii) Now the $End(A)$ in part i is a unital (but not necessarily commutative) ring $R$ with addition as addition and composition as multiplication, $id_A =1_R$. From this perspective, the result is just a special case of
If $u in R^times$, $n in R$ is nilpotent, and $u$ and $n$ commute with each other, then $u+n in R^times$.
which is proved by a geometric series argument as suggested in Behnam Esmayli's comment. In our special case $n=pm f$ with $n^2=0$, of course the inverse of $u+n$ is just $u^{-1}(1-n)$. See Units and Nilpotents and its many duplicates for a general discussion.
$endgroup$
As all the other answers have amended my comment by actually going through the computation, I just want to add two levels of generalisations of the result which I see:
i) We only need the abelian group structure on $X$. In other words, with the same proof we get the more general result:
If $A$ is an abelian group and $f in End(A)$ satisfies $fcirc f =0$, then $pm id_A pm f$ are automorphisms of $A$.
ii) Now the $End(A)$ in part i is a unital (but not necessarily commutative) ring $R$ with addition as addition and composition as multiplication, $id_A =1_R$. From this perspective, the result is just a special case of
If $u in R^times$, $n in R$ is nilpotent, and $u$ and $n$ commute with each other, then $u+n in R^times$.
which is proved by a geometric series argument as suggested in Behnam Esmayli's comment. In our special case $n=pm f$ with $n^2=0$, of course the inverse of $u+n$ is just $u^{-1}(1-n)$. See Units and Nilpotents and its many duplicates for a general discussion.
answered Jan 5 at 18:31
Torsten SchoenebergTorsten Schoeneberg
4,3212834
4,3212834
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%2f3062226%2fif-f-circ-f-0-show-that-transformations-f-id-x-and-f-id-x-are-iso%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
1
$begingroup$
Is $X$ finite dimensional?
$endgroup$
– SmileyCraft
Jan 4 at 23:19
13
$begingroup$
Try to compose them with each other.
$endgroup$
– Torsten Schoeneberg
Jan 4 at 23:21
2
$begingroup$
As people illustrated, one way to prove something is an isomorphism is to actually find its inverse, quite explicitly! A deeper example is the inverse to $I-A$ where norm of the matrix $A$ is small. The trick is to replace formally the variable $x$ below with $A$ -- quite unsettling I know! $(1-x)^{-1}=frac{1}{1-x} = sum_{i=0}^infty x^i$
$endgroup$
– Behnam Esmayli
Jan 4 at 23:50