proof of implicit function theorem
We state the Theorem with a different notation:
Theorem 1.
Let Ω be an open subset of Rn×Rm and let f∈C1(Ω,Rm). Let (x0,y0)∈Ω⊂Rn×Rm. If the matrix Dyf(x0,y0) defined by
Dyf(x0,y0)=(∂fj∂yk(x0,y0))j,k |
is invertible, then there exists a neighbourhood of ,
a neighbourhood of
and a function
such that
Moreover
Proof.
Consider the function defined by
One finds that
Being invertible, is invertible too.
Applying the inverse function Theorem to
we find that there exist a neighbourhood of and of and
a function such that
for all . Letting
(so that , )
we hence have
and hence and . So we only have to set to obtain
Differentiating with respect to we obtain
which gives the desired formula for the computation of .
∎
Title | proof of implicit function theorem |
---|---|
Canonical name | ProofOfImplicitFunctionTheorem |
Date of creation | 2013-03-22 13:31:23 |
Last modified on | 2013-03-22 13:31:23 |
Owner | paolini (1187) |
Last modified by | paolini (1187) |
Numerical id | 8 |
Author | paolini (1187) |
Entry type | Proof |
Classification | msc 26B10 |