Inverse Function Theorem proof: f is injective












0












$begingroup$


I am trying to prove the Inverse Function Theorem from the Implicit Function Theorem for Banach spaces. My attempt so far is as follows:



Let $f:mathbf{X}to mathbf{Y}$ be a $mathcal{C}^k$ function between Banach spaces, and let $x^*inmathbf{X}$ and $y^*:=f(x^*)$ be such that the Fréchet derivative $mathrm{d},f(x^*):mathbf{X}tomathbf{Y}$ is bounded with bounded inverse.



Consider $F:mathbf{X}timesmathbf{Y}tomathbf{Y}$ given by $F(x,y):=f(x)-y$. Then the partial Fréchet derivative $partial_xF(x^*,y^*)equiv mathrm{d},f(x^*)$ is bounded with a bounded inverse, so $F$ satisfies the hypotheses of the Implicit Function Theorem. Hence, there are open sets $Usubseteqmathbf{X}$ and $Vsubseteqmathbf{Y}$ containing $x^*$ and $y^*$, respectively, and a $mathcal{C}^k$ function $g:V to U$ such that $F(g(y), y) = 0$ for all $yin V$, i.e. $f(g(y)) = y$.



The above shows that $g$ is a right inverse of $f$, but I want to be able to conclude, further, that $g$ is a left inverse of $f$ on $U$, i.e. $g(f(x)) = x$ for all $x in U$. I know this to be equivalent to showing that the restriction $f|_U$ is injective (possibly by choosing a smaller neighbourhood of $x^*$ in $U$), but I am not sure how to do this.



I would greatly appreciate any hints!










share|cite|improve this question











$endgroup$












  • $begingroup$
    Doesn't the classical formulation of the implicit function theorem say $f:Xoplus Y to Z$ etc
    $endgroup$
    – JJR
    May 16 '17 at 11:11










  • $begingroup$
    @JJR Are you referring to my writing '$X times Y$' instead of '$X oplus Y$? The statement of the theorem as I know it has $F$ defined on an open set $W subseteq X times Y$ (I have taken $W = X times Y$ for simplicity).
    $endgroup$
    – ryan221b
    May 16 '17 at 13:10












  • $begingroup$
    Oh sry my mistake I thought you were proving implicit function theorem from inverse function theorem not the other way around
    $endgroup$
    – JJR
    May 16 '17 at 13:15
















0












$begingroup$


I am trying to prove the Inverse Function Theorem from the Implicit Function Theorem for Banach spaces. My attempt so far is as follows:



Let $f:mathbf{X}to mathbf{Y}$ be a $mathcal{C}^k$ function between Banach spaces, and let $x^*inmathbf{X}$ and $y^*:=f(x^*)$ be such that the Fréchet derivative $mathrm{d},f(x^*):mathbf{X}tomathbf{Y}$ is bounded with bounded inverse.



Consider $F:mathbf{X}timesmathbf{Y}tomathbf{Y}$ given by $F(x,y):=f(x)-y$. Then the partial Fréchet derivative $partial_xF(x^*,y^*)equiv mathrm{d},f(x^*)$ is bounded with a bounded inverse, so $F$ satisfies the hypotheses of the Implicit Function Theorem. Hence, there are open sets $Usubseteqmathbf{X}$ and $Vsubseteqmathbf{Y}$ containing $x^*$ and $y^*$, respectively, and a $mathcal{C}^k$ function $g:V to U$ such that $F(g(y), y) = 0$ for all $yin V$, i.e. $f(g(y)) = y$.



The above shows that $g$ is a right inverse of $f$, but I want to be able to conclude, further, that $g$ is a left inverse of $f$ on $U$, i.e. $g(f(x)) = x$ for all $x in U$. I know this to be equivalent to showing that the restriction $f|_U$ is injective (possibly by choosing a smaller neighbourhood of $x^*$ in $U$), but I am not sure how to do this.



I would greatly appreciate any hints!










share|cite|improve this question











$endgroup$












  • $begingroup$
    Doesn't the classical formulation of the implicit function theorem say $f:Xoplus Y to Z$ etc
    $endgroup$
    – JJR
    May 16 '17 at 11:11










  • $begingroup$
    @JJR Are you referring to my writing '$X times Y$' instead of '$X oplus Y$? The statement of the theorem as I know it has $F$ defined on an open set $W subseteq X times Y$ (I have taken $W = X times Y$ for simplicity).
    $endgroup$
    – ryan221b
    May 16 '17 at 13:10












  • $begingroup$
    Oh sry my mistake I thought you were proving implicit function theorem from inverse function theorem not the other way around
    $endgroup$
    – JJR
    May 16 '17 at 13:15














0












0








0





$begingroup$


I am trying to prove the Inverse Function Theorem from the Implicit Function Theorem for Banach spaces. My attempt so far is as follows:



Let $f:mathbf{X}to mathbf{Y}$ be a $mathcal{C}^k$ function between Banach spaces, and let $x^*inmathbf{X}$ and $y^*:=f(x^*)$ be such that the Fréchet derivative $mathrm{d},f(x^*):mathbf{X}tomathbf{Y}$ is bounded with bounded inverse.



Consider $F:mathbf{X}timesmathbf{Y}tomathbf{Y}$ given by $F(x,y):=f(x)-y$. Then the partial Fréchet derivative $partial_xF(x^*,y^*)equiv mathrm{d},f(x^*)$ is bounded with a bounded inverse, so $F$ satisfies the hypotheses of the Implicit Function Theorem. Hence, there are open sets $Usubseteqmathbf{X}$ and $Vsubseteqmathbf{Y}$ containing $x^*$ and $y^*$, respectively, and a $mathcal{C}^k$ function $g:V to U$ such that $F(g(y), y) = 0$ for all $yin V$, i.e. $f(g(y)) = y$.



The above shows that $g$ is a right inverse of $f$, but I want to be able to conclude, further, that $g$ is a left inverse of $f$ on $U$, i.e. $g(f(x)) = x$ for all $x in U$. I know this to be equivalent to showing that the restriction $f|_U$ is injective (possibly by choosing a smaller neighbourhood of $x^*$ in $U$), but I am not sure how to do this.



I would greatly appreciate any hints!










share|cite|improve this question











$endgroup$




I am trying to prove the Inverse Function Theorem from the Implicit Function Theorem for Banach spaces. My attempt so far is as follows:



Let $f:mathbf{X}to mathbf{Y}$ be a $mathcal{C}^k$ function between Banach spaces, and let $x^*inmathbf{X}$ and $y^*:=f(x^*)$ be such that the Fréchet derivative $mathrm{d},f(x^*):mathbf{X}tomathbf{Y}$ is bounded with bounded inverse.



Consider $F:mathbf{X}timesmathbf{Y}tomathbf{Y}$ given by $F(x,y):=f(x)-y$. Then the partial Fréchet derivative $partial_xF(x^*,y^*)equiv mathrm{d},f(x^*)$ is bounded with a bounded inverse, so $F$ satisfies the hypotheses of the Implicit Function Theorem. Hence, there are open sets $Usubseteqmathbf{X}$ and $Vsubseteqmathbf{Y}$ containing $x^*$ and $y^*$, respectively, and a $mathcal{C}^k$ function $g:V to U$ such that $F(g(y), y) = 0$ for all $yin V$, i.e. $f(g(y)) = y$.



The above shows that $g$ is a right inverse of $f$, but I want to be able to conclude, further, that $g$ is a left inverse of $f$ on $U$, i.e. $g(f(x)) = x$ for all $x in U$. I know this to be equivalent to showing that the restriction $f|_U$ is injective (possibly by choosing a smaller neighbourhood of $x^*$ in $U$), but I am not sure how to do this.



I would greatly appreciate any hints!







functional-analysis multivariable-calculus implicit-function-theorem frechet-derivative inverse-function-theorem






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited Dec 3 '18 at 17:59







ryan221b

















asked May 16 '17 at 10:38









ryan221bryan221b

9510




9510












  • $begingroup$
    Doesn't the classical formulation of the implicit function theorem say $f:Xoplus Y to Z$ etc
    $endgroup$
    – JJR
    May 16 '17 at 11:11










  • $begingroup$
    @JJR Are you referring to my writing '$X times Y$' instead of '$X oplus Y$? The statement of the theorem as I know it has $F$ defined on an open set $W subseteq X times Y$ (I have taken $W = X times Y$ for simplicity).
    $endgroup$
    – ryan221b
    May 16 '17 at 13:10












  • $begingroup$
    Oh sry my mistake I thought you were proving implicit function theorem from inverse function theorem not the other way around
    $endgroup$
    – JJR
    May 16 '17 at 13:15


















  • $begingroup$
    Doesn't the classical formulation of the implicit function theorem say $f:Xoplus Y to Z$ etc
    $endgroup$
    – JJR
    May 16 '17 at 11:11










  • $begingroup$
    @JJR Are you referring to my writing '$X times Y$' instead of '$X oplus Y$? The statement of the theorem as I know it has $F$ defined on an open set $W subseteq X times Y$ (I have taken $W = X times Y$ for simplicity).
    $endgroup$
    – ryan221b
    May 16 '17 at 13:10












  • $begingroup$
    Oh sry my mistake I thought you were proving implicit function theorem from inverse function theorem not the other way around
    $endgroup$
    – JJR
    May 16 '17 at 13:15
















$begingroup$
Doesn't the classical formulation of the implicit function theorem say $f:Xoplus Y to Z$ etc
$endgroup$
– JJR
May 16 '17 at 11:11




$begingroup$
Doesn't the classical formulation of the implicit function theorem say $f:Xoplus Y to Z$ etc
$endgroup$
– JJR
May 16 '17 at 11:11












$begingroup$
@JJR Are you referring to my writing '$X times Y$' instead of '$X oplus Y$? The statement of the theorem as I know it has $F$ defined on an open set $W subseteq X times Y$ (I have taken $W = X times Y$ for simplicity).
$endgroup$
– ryan221b
May 16 '17 at 13:10






$begingroup$
@JJR Are you referring to my writing '$X times Y$' instead of '$X oplus Y$? The statement of the theorem as I know it has $F$ defined on an open set $W subseteq X times Y$ (I have taken $W = X times Y$ for simplicity).
$endgroup$
– ryan221b
May 16 '17 at 13:10














$begingroup$
Oh sry my mistake I thought you were proving implicit function theorem from inverse function theorem not the other way around
$endgroup$
– JJR
May 16 '17 at 13:15




$begingroup$
Oh sry my mistake I thought you were proving implicit function theorem from inverse function theorem not the other way around
$endgroup$
– JJR
May 16 '17 at 13:15










0






active

oldest

votes











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
});


}
});














draft saved

draft discarded


















StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f2283274%2finverse-function-theorem-proof-f-is-injective%23new-answer', 'question_page');
}
);

Post as a guest















Required, but never shown

























0






active

oldest

votes








0






active

oldest

votes









active

oldest

votes






active

oldest

votes
















draft saved

draft discarded




















































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.




draft saved


draft discarded














StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f2283274%2finverse-function-theorem-proof-f-is-injective%23new-answer', 'question_page');
}
);

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







Popular posts from this blog

Plaza Victoria

Puebla de Zaragoza

Musa