Best Impli-Inver Fun
Best Impli-Inver Fun
Best Impli-Inver Fun
RN = RN −M × RM (1)
and denote the first N − M coordinates by vector x and the rest M coordinates by y.
Assume
∂y∂f
∂f1 1
∂y1
∂f
7
M
. (2)
∂y
∂f
∂fM M
∂y1 ∂y M
i. For every x ∈ U the equation f (x, y) = 0 has one unique solution y = Y (x) ∈ V;
ii. Y (x0) = y0 ;
iv. For x ∈ U,
∂y∂f
−1
∂f1 1 ∂f1 ∂f1
−1 ∂y1 ∂x1 ∂xN −M
∂Y ∂f ∂f
M
=− = . (3)
∂x ∂y ∂x
∂f
∂fM M ∂fM ∂fM
∂y1 ∂y M ∂x1 ∂xN −M
Proof. The proof follows exactly the same idea as the R2 case. We only emphsize the difference here. Denote
A7
∂f
(x0, y0). (4)
∂y
1
Now we first try to show the existence of a unique y solving
F (x, y) = 0 (6)
Now we have
Note that the difference now is that we do not have one single ξ such that
∂g
g(yn−1) − g(yn−2) = (ξ) (yn−1 − yn−2). (10)
∂y
x1 y2 − 4 x2 + 2 ey1 + 3 = 0 (12)
2 x1 − x3 − 6 y1 + y2 cos y1 = 0 (13)
2
dz
Example 3. Let z = f (x, y), g(x, y) = 0. Calculate dx
.
Solution. Let
f (x, y) − z
F (x, y, z) = . (18)
g(x, y)
Then we have
∂f ∂f
−1
∂F ∂x ∂F ∂y
= ∂g
, = ∂g
(19)
∂x ∂(y, z) 0
∂x ∂y
which gives
−1 !
∂f ∂f ∂f
−1 0 1
∂(Y , Z)
= − ∂y ∂x = − 1 ∂g ∂f ∂x . (20)
∂x ∂g
0
∂g ∂g − ∂y ∂y
∂g
∂y ∂x ∂y ∂x
Finally we have
dZ 1 ∂(f , g)
= det . (21)
dx ∂g ∂(x, y)
∂y
ii. f (y0) = x0 ;
(y0) 0.
∂f
iii. det ∂y
Then there are two open sets U , V such that x0 ∈ U , y0 ∈ V and there is a function g: U V which is the
inverse of f. Furthermore we have
∂g
h i−1
∂f
(x0, y0) = ∂y
(x0, y0) . (22)
∂x
Proof. Most of the theorem follow directly from implicit function theorem, from which we obtain the
existence of I , J , g such that
f (g(x)) = x (23)
If we set
(grad f1)(ξ 1)T
A7 (25)
,
T
(grad fN )(ξ N )
3
we would have
Problem 1. Let f: RN RN be differentiable with continuous partial derivatives. Assume that det J f (x0) 0. Then
there is r > 0 such that for any open set U ⊆ B(x0, r), f(U ) is open.