Implicit function theorem

From testwiki
Jump to navigation Jump to search

Template:Short description Script error: No such module "sidebar". In multivariable calculus, the implicit function theoremTemplate:Efn is a theorem that provides sufficient conditions under which a planar curve specified by F(x,y)=0 can also be specified as the graph of a function f, so that for each point (x,y) on part of the curve, one has y=f(x). An example is the unit circle, whose points (x,y) satisfy x2+y2−1=0, which can locally be solved (if y>0) by y=1−x2, expressing the top semicircle as a graph. It is not always possible to solve the equation F(x,y)=0 for y algebraically, and the implicit function theorem gives analytic conditions under which there exists a function f whose graph belongs to the given curve, and, in some formulations, also gives a way of constructing approximations to f.

More generally, given a system of Template:Mvar equations Template:Math (often abbreviated into Template:Math), the theorem states that, under a mild condition on the partial derivatives (with respect to each Template:Math ) at a point, the Template:Mvar variables Template:Math are differentiable functions of the Template:Math in some neighbourhood of the point. As these functions generally cannot be expressed in closed form, they are implicitly defined by the equations, and this motivated the name of the theorem.[1]

In other words, under a mild condition on the partial derivatives, the set of zeros of a system of equations is locally the graph of a function.

History

Augustin-Louis Cauchy (1789–1857) is credited with the first rigorous form of the implicit function theorem. Ulisse Dini (1845–1918) generalized the real-variable version of the implicit function theorem to the context of functions of any number of real variables.[2]

Two variables case

Let f:ℝ2→ℝ be a continuously differentiable function defining the implicit equation of a curve f(x,y)=0. Let (x0,y0) be a point on the curve, that is, a point such that f(x0,y0)=0. In this simple case, the implicit function theorem can be stated as follows: Template:Math theorem

Proof. By differentiating the equation Template:Tmath, one gets ∂f∂x(x,φ(x))+φ′(x)∂f∂y(x,φ(x))=0. and thus φ′(x)=−∂f∂x(x,φ(x))∂f∂y(x,φ(x)). This gives an ordinary differential equation for Template:Tmath, with the initial condition Template:Tmath.

Since ∂f∂y(x0,y0)≠0, the right-hand side of the differential equation is continuous. Hence, the Peano existence theorem applies so there is a (possibly non-unique) solution. To see why φ is unique, note that the function gx(y)=f(x,y) is strictly monotone in a neighbourhood of x0,y0 (as ∂f∂y(x0,y0)≠0), thus it is injective. If φ,ϕ are solutions to the differential equation, then gx(φ(x))=gx(ϕ(x))=0 and by injectivity we get, φ(x)=ϕ(x).

First example

The unit circle of implicit equation Template:Math cannot be represented as the graph of a function. Around the point Template:Math where the tangent is not vertical, the bolded circular arc is the graph of some function of Template:Mvar, while around Template:Math, there is no function of Template:Mvar with the circle as its graph.
This is exactly what the implicit function theorem asserts in this case.

If we define the function Template:Math, then the equation Template:Math cuts out the unit circle as the level set Template:Math. There is no way to represent the unit circle as the graph of a function of one variable Template:Math because for each choice of Template:Math, there are two choices of y, namely ±1−x2.

However, it is possible to represent part of the circle as the graph of a function of one variable. If we let g1(x)=1−x2 for Template:Math, then the graph of Template:Math provides the upper half of the circle. Similarly, if g2(x)=−1−x2, then the graph of Template:Math gives the lower half of the circle.

The implicit function theorem says that under some mild assumptions, functions like Template:Math and Template:Math always exist, even in situations where they cannot be written down by explicit formulas. It guarantees that Template:Math and Template:Math are differentiable, and it even works in situations where we do not have a formula for Template:Math.

General case

Let f:ℝn+m→ℝm be a continuously differentiable function. We think of ℝn+m as the Cartesian product ℝn×ℝm, and we write a point of this product as (𝐱,𝐲)=(x1,…,xn,y1,…ym). Starting from the given function f, our goal is to construct a function g:ℝn→ℝm whose graph (𝐱,g(𝐱)) is precisely the set of all (𝐱,𝐲) such that f(𝐱,𝐲)=𝟎.

As noted above, this may not always be possible. We will therefore fix a point (𝐚,𝐛)=(a1,…,an,b1,…,bm) which satisfies f(𝐚,𝐛)=𝟎, and we will ask for a g that works near the point (𝐚,𝐛). In other words, we want an open set U⊂ℝn containing 𝐚, an open set V⊂ℝm containing 𝐛, and a function g:U→V such that the graph of g satisfies the relation f=𝟎 on U×V, and that no other points within U×V do so. In symbols,

{(𝐱,g(𝐱))∣𝐱∈U}={(𝐱,𝐲)∈U×V∣f(𝐱,𝐲)=𝟎}.

To state the implicit function theorem, we need the Jacobian matrix of f, which is the matrix of the partial derivatives of f. Abbreviating (a1,…,an,b1,…,bm) to (𝐚,𝐛), the Jacobian matrix is

(Df)(𝐚,𝐛)=[∂f1∂x1(𝐚,𝐛)⋯∂f1∂xn(𝐚,𝐛)∂f1∂y1(𝐚,𝐛)⋯∂f1∂ym(𝐚,𝐛)⋮⋱⋮⋮⋱⋮∂fm∂x1(𝐚,𝐛)⋯∂fm∂xn(𝐚,𝐛)∂fm∂y1(𝐚,𝐛)⋯∂fm∂ym(𝐚,𝐛)]=[XY]

where X is the matrix of partial derivatives in the variables xi and Y is the matrix of partial derivatives in the variables yj. The implicit function theorem says that if Y is an invertible matrix, then there are U, V, and g as desired. Writing all the hypotheses together gives the following statement.

Statement of the theorem

Let f:ℝn+m→ℝm be a continuously differentiable function, and let ℝn+m have coordinates (𝐱,𝐲). Fix a point (𝐚,𝐛)=(a1,…,an,b1,…,bm) with f(𝐚,𝐛)=𝟎, where 𝟎∈ℝm is the zero vector. If the Jacobian matrix (this is the right-hand panel of the Jacobian matrix shown in the previous section): Jf,𝐲(𝐚,𝐛)=[∂fi∂yj(𝐚,𝐛)] is invertible, then there exists an open set U⊂ℝn containing 𝐚 such that there exists a unique function g:U→ℝm such that Template:Nowrap and Template:Nowrap Moreover, g is continuously differentiable and, denoting the left-hand panel of the Jacobian matrix shown in the previous section as: Jf,𝐱(𝐚,𝐛)=[∂fi∂xj(𝐚,𝐛)], the Jacobian matrix of partial derivatives of g in U is given by the matrix product:[3] [∂gi∂xj(𝐱)]m×n=−[Jf,𝐲(𝐱,g(𝐱))]m×m−1[Jf,𝐱(𝐱,g(𝐱))]m×n

A proof may be found in the inverse function theorem article. Here, the two-dimensional case is detailed.

Higher derivatives

If, moreover, f is analytic or continuously differentiable k times in a neighbourhood of (𝐚,𝐛), then one may choose U in order that the same holds true for g inside U. [4] In the analytic case, this is called the analytic implicit function theorem.

The circle example

Let us go back to the example of the unit circle. In this case n = m = 1 and f(x,y)=x2+y2−1. The matrix of partial derivatives is just a 1 × 2 matrix, given by (Df)(a,b)=[∂f∂x(a,b)∂f∂y(a,b)]=[2a2b]

Thus, here, the Template:Math in the statement of the theorem is just the number Template:Math; the linear map defined by it is invertible if and only if Template:Math. By the implicit function theorem we see that we can locally write the circle in the form Template:Math for all points where Template:Math. For Template:Math we run into trouble, as noted before. The implicit function theorem may still be applied to these two points, by writing Template:Mvar as a function of Template:Mvar, that is, x=h(y); now the graph of the function will be (h(y),y), since where Template:Math we have Template:Math, and the conditions to locally express the function in this form are satisfied.

The implicit derivative of y with respect to x, and that of x with respect to y, can be found by totally differentiating the implicit function x2+y2−1 and equating to 0: 2xdx+2ydy=0, giving dydx=−xy and dxdy=−yx.

Application: change of coordinates

Suppose we have an Template:Mvar-dimensional space, parametrised by a set of coordinates (x1,…,xm). We can introduce a new coordinate system (x'1,…,x'm) by supplying m functions h1…hm each being continuously differentiable. These functions allow us to calculate the new coordinates (x'1,…,x'm) of a point, given the point's old coordinates (x1,…,xm) using x'1=h1(x1,…,xm),…,x'm=hm(x1,…,xm). One might want to verify if the opposite is possible: given coordinates (x'1,…,x'm), can we 'go back' and calculate the same point's original coordinates (x1,…,xm)? The implicit function theorem will provide an answer to this question. The (new and old) coordinates (x'1,…,x'm,x1,…,xm) are related by f = 0, with f(x'1,…,x'm,x1,…,xm)=(h1(x1,…,xm)−x'1,…,hm(x1,…,xm)−x'm). Now the Jacobian matrix of f at a certain point (a, b) [ where a=(x'1,…,x'm),b=(x1,…,xm) ] is given by (Df)(a,b)=[−1⋯0⋮⋱⋮0⋯−1|∂h1∂x1(b)⋯∂h1∂xm(b)⋮⋱⋮∂hm∂x1(b)⋯∂hm∂xm(b)]=[−Im|J]. where Im denotes the m × m identity matrix, and Template:Mvar is the Template:Math matrix of partial derivatives, evaluated at (a, b). (In the above, these blocks were denoted by X and Y. As it happens, in this particular application of the theorem, neither matrix depends on a.) The implicit function theorem now states that we can locally express (x1,…,xm) as a function of (x'1,…,x'm) if J is invertible. Demanding J is invertible is equivalent to det J ≠ 0, thus we see that we can go back from the primed to the unprimed coordinates if the determinant of the Jacobian J is non-zero. This statement is also known as the inverse function theorem.

Example: polar coordinates

As a simple application of the above, consider the plane, parametrised by polar coordinates Template:Math. We can go to a new coordinate system (cartesian coordinates) by defining functions Template:Math and Template:Math. This makes it possible given any point Template:Math to find corresponding Cartesian coordinates Template:Math. When can we go back and convert Cartesian into polar coordinates? By the previous example, it is sufficient to have Template:Math, with J=[∂x(R,θ)∂R∂x(R,θ)∂θ∂y(R,θ)∂R∂y(R,θ)∂θ]=[cos⁡θ−Rsin⁡θsin⁡θRcos⁡θ]. Since Template:Math, conversion back to polar coordinates is possible if Template:Math. So it remains to check the case Template:Math. It is easy to see that in case Template:Math, our coordinate transformation is not invertible: at the origin, the value of θ is not well-defined.

Generalizations

Banach space version

Based on the inverse function theorem in Banach spaces, it is possible to extend the implicit function theorem to Banach space valued mappings.[5][6]

Let X, Y, Z be Banach spaces. Let the mapping Template:Math be continuously Fréchet differentiable. If (x0,y0)∈X×Y, f(x0,y0)=0, and y↦Df(x0,y0)(0,y) is a Banach space isomorphism from Y onto Z, then there exist neighbourhoods U of x0 and V of y0 and a Fréchet differentiable function g : U → V such that f(x, g(x)) = 0 and f(x, y) = 0 if and only if y = g(x), for all (x,y)∈U×V.

Implicit functions from non-differentiable functions

Various forms of the implicit function theorem exist for the case when the function f is not differentiable. It is standard that local strict monotonicity suffices in one dimension.[7] The following more general form was proven by Kumagai based on an observation by Jittorntrum.[8][9]

Consider a continuous function f:ℝn×ℝm→ℝn such that f(x0,y0)=0. If there exist open neighbourhoods A⊂ℝn and B⊂ℝm of x0 and y0, respectively, such that, for all y in B, f(⋅,y):A→ℝn is locally one-to-one, then there exist open neighbourhoods A0⊂ℝn and B0⊂ℝm of x0 and y0, such that, for all y∈B0, the equation f(x, y) = 0 has a unique solution x=g(y)∈A0, where g is a continuous function from B0 into A0.

Collapsing manifolds

Perelman’s collapsing theorem for 3-manifolds, the capstone of his proof of Thurston's geometrization conjecture, can be understood as an extension of the implicit function theorem.[10]

See also

Notes

Template:Notelist

References

Template:Reflist 11 Generalized Implicit Function Theorem Journal Of Indonesian Mathematical Society DOI:10.22.342 v3211.1551 License CCBY-NC-ND-4.0 Discusses Implicit function Theorem for X a topological space , Y Banach Space, Z a Topological Vector space

Further reading