Chapter 7

Implicit Function TheoremThe implicit function theorem is one of the greatest theorems in mathematics. There aremany versions of this theorem which are of far greater generality than the one given here.The proof given here is like one found in one of Caratheodory’s books on the calculusof variations. It is not as elegant as some of the others which are based on a contractionmapping principle but it may be shorter and is based on more elementary ideas. For a moreelegant proof which generalizes better see my book Real and Abstract Analysis. The proofgiven here is based on a mean value theorem in the following lemma.

Lemma 7.0.1 Let U be an open set in Rp which contains the line segment t → y+t (z−y) for t ∈ [0,1] and let f : U → R be differentiable at y+ t (z−y) for t ∈ (0,1) andcontinuous for t ∈ [0,1]. Then there exists x on this line segment such that f (z)− f (y) =D f (x)(z−y) .

Proof: Let h(t)≡ f (y+ t (z−y)) for t ∈ [0,1] . Then h is continuous on [0,1] and hasa derivative, h′ (t) = D f (y+ t (z−y))(z−y), this by the chain rule. Then by the meanvalue theorem of one variable calculus, there exists t ∈ (0,1) such that

f (z)− f (y) = h(1)−h(0) = h′ (t) = D f (y+ t (z−y))(z−y)

and we let x= y+ t (z−y) for this t. ■Also of use is the following lemma.

Lemma 7.0.2 Let A be an m×n matrix and suppose that for all i, j,∣∣Ai j∣∣≤C. Then the

operator norm satisfies ∥A∥ ≤Cmn.

Proof: Note that if z is a vector, |z| = sup|y|≤1 (z,y) . Indeed, for |y| ≤ 1, the rightside is no more than |z| thanks to the Cauchy Schwarz inequality and this can be achievedby letting y = z/ |z|.

∥A∥ ≡ sup|x|≤1|Ax|= sup

|x|≤1sup|y|≤1|(Ax,y)|= sup

|x|≤1sup|y|≤1

∣∣∣∣∣∑i∑

jAi jx jyi

∣∣∣∣∣≤ sup

|x|≤1sup|y|≤1

∑i

∑j

C∣∣x j∣∣ |yi| ≤C∑

i∑

j|x| |y|=Cmn. ■

Definition 7.0.3 Suppose U is an open set in Rn ×Rm and (x,y) will denote atypical point of Rn×Rm with x ∈ Rn and y ∈ Rm. Let f : U → Rp be in C1 (U) meaningthat all partial derivatives exist and are continuous. Then define

D1f (x,y) ≡

 f1,x1 (x,y) · · · f1,xn (x,y)...

...fp,x1 (x,y) · · · fp,xn (x,y)

 ,

D2f (x,y) ≡

 f1,y1 (x,y) · · · f1,ym (x,y)...

...fp,y1 (x,y) · · · fp,ym (x,y)

 .

163

Chapter 7Implicit Function TheoremThe implicit function theorem is one of the greatest theorems in mathematics. There aremany versions of this theorem which are of far greater generality than the one given here.The proof given here is like one found in one of Caratheodory’s books on the calculusof variations. It is not as elegant as some of the others which are based on a contractionmapping principle but it may be shorter and is based on more elementary ideas. For a moreelegant proof which generalizes better see my book Real and Abstract Analysis. The proofgiven here is based on a mean value theorem in the following lemma.Lemma 7.0.1 Let U be an open set in R? which contains the line segment t > y+t(z—y) fort € [0,1] and let f :U > R be differentiable at y +t (z—y) fort € (0,1) andcontinuous for t € [0,1]. Then there exists x on this line segment such that f (z) — f (y) =Df (a) (z—y)-Proof: Let h(t) = f (y+t(z—y)) fort € [0,1]. Then / is continuous on [0, 1] and hasa derivative, h’ (t) = Df (y+t(z—y))(z—y), this by the chain rule. Then by the meanvalue theorem of one variable calculus, there exists ¢ € (0,1) such thatf(2)-f(y) =A) -h(0) =h'(t) = Df (y+t(z—y)) (2-9)and we let x = y+t(z—y) for thist. IAlso of use is the following lemma.Lemma 7.0.2 Let A be anm xn matrix and suppose that for alli, j,operator norm satisfies ||A|| <Cmn.Aij| <C. Then theProof: Note that if z is a vector, |z| = sup)y|<; (z,y)- Indeed, for |y| < 1, the rightside is no more than |z| thanks to the Cauchy Schwarz inequality and this can be achievedby letting y = z/|z|.\||A|| = sup |Aav|= sup sup |(Axv,y)|= sup sup VY Aijxiyi|e|<1 |e|<1 |y|<1 je|<tlylstpi j< sup sup YY Cx) lyi| < cy) |z| |y| =Cmn.lel<Ilyl<l ij ijDefinition 7.0.3 Suppose U is an open set in R" x R™ and (x,y) will denote atypical point of R" x R” with x € R” and y € R”. Let f :U — R? be inC! (U) meaningthat all partial derivatives exist and are continuous. Then definefix (@Y) + fin (BY)Dif (x,y)Sox (@Y) 0 Spain (BY)Fiy (@Y) + fim (@Y)Dof (x,y) = : :Soy (@Y) + fpym (LY)163