Implicit function theorem

Template:Short description In multivariable calculus, the implicit function theoremTemplate:Efn is a tool that allows relations to be converted to functions of several real variables. It does so by representing the relation as the graph of a function. There may not be a single function whose graph can represent the entire relation, but there may be such a function on a restriction of the domain of the relation. The implicit function theorem gives a sufficient condition to ensure that there is such a function.

More precisely, 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 neighborhood 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.

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.

Two variables case

Let $f:{\mathbb{ℝ}}^2\to \mathbb{ℝ}$ be a continuously differentiable function defining the implicit equation of a curve $f(x,y)=0$. Let $(x_0,y_0)$ be a point on the curve, that is, a point such that $f(x_0,y_0)=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 $$\frac{\partial f}{\partial x}(x,\phi (x))+{\phi }^{\prime }(x)\frac{\partial f}{\partial y}(x,\phi (x))=0.$$ and thus $${\phi }^{\prime }(x)=-\frac{\frac{\partial f}{\partial x}(x,\phi (x))}{\frac{\partial f}{\partial y}(x,\phi (x))}.$$ This gives an ordinary differential equation for Template:Tmath, with the initial condition Template:Tmath.

Since $\frac{\partial f}{\partial y}(x_0,y_0)\ne 0,$ the right-hand side of the differential equation is continuous, upper bounded and lower bounded on some closed interval around Template:Tmath. It is therefore Lipschitz continuous, and the Cauchy-Lipschitz theorem applies for proving the existence of a unique solution.

First example

File:Implicit circle.svg

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 $\pm \sqrt{1-x^2}$.

However, it is possible to represent part of the circle as the graph of a function of one variable. If we let $g_1(x)=\sqrt{1-x^2}$ for Template:Math, then the graph of Template:Math provides the upper half of the circle. Similarly, if $g_2(x)=-\sqrt{1-x^2}$, then the graph of Template:Math gives the lower half of the circle.

The purpose of the implicit function theorem is to tell us that functions like Template:Math and Template:Math almost always exist, even in situations where we cannot write down 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.

Definitions

Let $f:{\mathbb{ℝ}}^{n+m}\to {\mathbb{ℝ}}^m$ be a continuously differentiable function. We think of ${\mathbb{ℝ}}^{n+m}$ as the Cartesian product ${\mathbb{ℝ}}^n\times {\mathbb{ℝ}}^m,$ and we write a point of this product as $(\mathbf{𝐱},\mathbf{𝐲})=(x_1,\dots ,x_n,y_1,\dots y_m).$ Starting from the given function $f$, our goal is to construct a function $g:{\mathbb{ℝ}}^n\to {\mathbb{ℝ}}^m$ whose graph $(\text{x},g(\text{x}))$ is precisely the set of all $(\text{x},\text{y})$ such that $f(\text{x},\text{y})=\text{<mn>0</mn>}$.

As noted above, this may not always be possible. We will therefore fix a point $(\text{a},\text{b})=(a_1,\dots ,a_n,b_1,\dots ,b_m)$ which satisfies $f(\text{a},\text{b})=\text{<mn>0</mn>}$, and we will ask for a $g$ that works near the point $(\text{a},\text{b})$. In other words, we want an open set $U\subset {\mathbb{ℝ}}^n$ containing $\text{a}$, an open set $V\subset {\mathbb{ℝ}}^m$ containing $\text{b}$, and a function $g:U\to V$ such that the graph of $g$ satisfies the relation $f=\text{<mn>0</mn>}$ on $U\times V$, and that no other points within $U\times V$ do so. In symbols,

$$\{(\mathbf{𝐱},g(\mathbf{𝐱}))\mid \mathbf{𝐱}\in U\}=\{(\mathbf{𝐱},\mathbf{𝐲})\in U\times V\mid f(\mathbf{𝐱},\mathbf{𝐲})=\mathbf{𝟎}\}.$$

To state the implicit function theorem, we need the Jacobian matrix of $f$, which is the matrix of the partial derivatives of $f$. Abbreviating $(a_1,\dots ,a_n,b_1,\dots ,b_m)$ to $(\text{a},\text{b})$, the Jacobian matrix is

$$(Df)(\mathbf{𝐚},\mathbf{𝐛})=\left[\begin{array}{cccccc}\frac{\partial f_1}{\partial x_1}(\mathbf{𝐚},\mathbf{𝐛})& \cdots & \frac{\partial f_1}{\partial x_n}(\mathbf{𝐚},\mathbf{𝐛})& \frac{\partial f_1}{\partial y_1}(\mathbf{𝐚},\mathbf{𝐛})& \cdots & \frac{\partial f_1}{\partial y_m}(\mathbf{𝐚},\mathbf{𝐛})\\ ⋮& \ddots & ⋮& ⋮& \ddots & ⋮\\ \frac{\partial f_m}{\partial x_1}(\mathbf{𝐚},\mathbf{𝐛})& \cdots & \frac{\partial f_m}{\partial x_n}(\mathbf{𝐚},\mathbf{𝐛})& \frac{\partial f_m}{\partial y_1}(\mathbf{𝐚},\mathbf{𝐛})& \cdots & \frac{\partial f_m}{\partial y_m}(\mathbf{𝐚},\mathbf{𝐛})\end{array}\right]=\left[\begin{array}{cc}X& Y\end{array}\right]$$

where $X$ is the matrix of partial derivatives in the variables $x_i$ and $Y$ is the matrix of partial derivatives in the variables $y_j$. 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:{\mathbb{ℝ}}^{n+m}\to {\mathbb{ℝ}}^m$ be a continuously differentiable function, and let ${\mathbb{ℝ}}^{n+m}$ have coordinates $(\text{x},\text{y})$. Fix a point $(\text{a},\text{b})=(a_1,\dots ,a_n,b_1,\dots ,b_m)$ with $f(\text{a},\text{b})=\mathbf{𝟎}$, where $\mathbf{𝟎}\in {\mathbb{ℝ}}^m$ is the zero vector. If the Jacobian matrix (this is the right-hand panel of the Jacobian matrix shown in the previous section): $$J_{f,\mathbf{𝐲}}(\mathbf{𝐚},\mathbf{𝐛})=[\frac{\partial f_i}{\partial y_j}(\mathbf{𝐚},\mathbf{𝐛})]$$ is invertible, then there exists an open set $U\subset {\mathbb{ℝ}}^n$ containing $\text{a}$ such that there exists a unique function $g:U\to {\mathbb{ℝ}}^m$ such that $g(\mathbf{𝐚})=\mathbf{𝐛}$, and $f(\mathbf{𝐱},g(\mathbf{𝐱}))=\mathbf{𝟎}\text{for all}\mathbf{𝐱}\in U$. Moreover, $g$ is continuously differentiable and, denoting the left-hand panel of the Jacobian matrix shown in the previous section as: $$J_{f,\mathbf{𝐱}}(\mathbf{𝐚},\mathbf{𝐛})=[\frac{\partial f_i}{\partial x_j}(\mathbf{𝐚},\mathbf{𝐛})],$$ the Jacobian matrix of partial derivatives of $g$ in $U$ is given by the matrix product: $${[\frac{\partial g_i}{\partial x_j}(\mathbf{𝐱})]}_{m\times n}=-{[J_{f,\mathbf{𝐲}}(\mathbf{𝐱},g(\mathbf{𝐱}))]}_{m\times m}^{-1}{[J_{f,\mathbf{𝐱}}(\mathbf{𝐱},g(\mathbf{𝐱}))]}_{m\times n}$$

For a proof, see Inverse function theorem#Implicit_function_theorem. Here, the two-dimensional case is detailed.

Higher derivatives

If, moreover, $f$ is analytic or continuously differentiable $k$ times in a neighborhood of $(\text{a},\text{b})$, then one may choose $U$ in order that the same holds true for $g$ inside $U$. 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)=x^2+y^2-1$. The matrix of partial derivatives is just a 1 × 2 matrix, given by $$(Df)(a,b)=\left[\begin{array}{cc}\frac{\partial f}{\partial x}(a,b)& \frac{\partial f}{\partial y}(a,b)\end{array}\right]=\left[\begin{array}{cc}2a& 2b\end{array}\right]$$

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 $x^2+y^2-1$ and equating to 0: $$2xdx+2ydy=0,$$ giving $$\frac{dy}{dx}=-\frac{x}{y}$$ and $$\frac{dx}{dy}=-\frac{y}{x}.$$

Application: change of coordinates

Suppose we have an Template:Mvar-dimensional space, parametrised by a set of coordinates $(x_1,\dots ,x_m)$. We can introduce a new coordinate system $(x{\text{'}}_1,\dots ,x{\text{'}}_m)$ by supplying m functions $h_1\dots h_m$ each being continuously differentiable. These functions allow us to calculate the new coordinates $(x{\text{'}}_1,\dots ,x{\text{'}}_m)$ of a point, given the point's old coordinates $(x_1,\dots ,x_m)$ using $x{\text{'}}_1=h_1(x_1,\dots ,x_m),\dots ,x{\text{'}}_m=h_m(x_1,\dots ,x_m)$. One might want to verify if the opposite is possible: given coordinates $(x{\text{'}}_1,\dots ,x{\text{'}}_m)$, can we 'go back' and calculate the same point's original coordinates $(x_1,\dots ,x_m)$? The implicit function theorem will provide an answer to this question. The (new and old) coordinates $(x{\text{'}}_1,\dots ,x{\text{'}}_m,x_1,\dots ,x_m)$ are related by f = 0, with $$f(x{\text{'}}_1,\dots ,x{\text{'}}_m,x_1,\dots ,x_m)=(h_1(x_1,\dots ,x_m)-x{\text{'}}_1,\dots ,h_m(x_1,\dots ,x_m)-x{\text{'}}_m).$$ Now the Jacobian matrix of f at a certain point (a, b) [ where $a=(x{\text{'}}_1,\dots ,x{\text{'}}_m),b=(x_1,\dots ,x_m)$ ] is given by $$(Df)(a,b)=\left[\begin{array}{ccc}-1& \cdots & 0\\ ⋮& \ddots & ⋮\\ 0& \cdots & -1\end{array}|\begin{array}{ccc}\frac{\partial h_1}{\partial x_1}(b)& \cdots & \frac{\partial h_1}{\partial x_m}(b)\\ ⋮& \ddots & ⋮\\ \frac{\partial h_m}{\partial x_1}(b)& \cdots & \frac{\partial h_m}{\partial x_m}(b)\\ \end{array}\right]=[-I_m|J].$$ where I_m 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 $(x_1,\dots ,x_m)$ as a function of $(x{\text{'}}_1,\dots ,x{\text{'}}_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=\left[\begin{array}{cc}\frac{\partial x(R,\theta )}{\partial R}& \frac{\partial x(R,\theta )}{\partial \theta }\\ \frac{\partial y(R,\theta )}{\partial R}& \frac{\partial y(R,\theta )}{\partial \theta }\\ \end{array}\right]=\left[\begin{array}{cc}\cos \theta & -R\sin \theta \\ \sin \theta & R\cos \theta \end{array}\right].$$ 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.

Let X, Y, Z be Banach spaces. Let the mapping Template:Math be continuously Fréchet differentiable. If $(x_0,y_0)\in X\times Y$, $f(x_0,y_0)=0$, and $y\mapsto Df(x_0,y_0)(0,y)$ is a Banach space isomorphism from Y onto Z, then there exist neighbourhoods U of x₀ and V of y₀ 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)\in U\times 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. The following more general form was proven by Kumagai based on an observation by Jittorntrum.

Consider a continuous function $f:{\mathbb{ℝ}}^n\times {\mathbb{ℝ}}^m\to {\mathbb{ℝ}}^n$ such that $f(x_0,y_0)=0$. If there exist open neighbourhoods $A\subset {\mathbb{ℝ}}^n$ and $B\subset {\mathbb{ℝ}}^m$ of x₀ and y₀, respectively, such that, for all y in B, $f(\cdot ,y):A\to {\mathbb{ℝ}}^n$ is locally one-to-one, then there exist open neighbourhoods $A_0\subset {\mathbb{ℝ}}^n$ and $B_0\subset {\mathbb{ℝ}}^m$ of x₀ and y₀, such that, for all $y\in B_0$, the equation f(x, y) = 0 has a unique solution $$x=g(y)\in A_0,$$ where g is a continuous function from B₀ into A₀.

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.

See also

• Inverse function theorem
• Constant rank theorem: Both the implicit function theorem and the inverse function theorem can be seen as special cases of the constant rank theorem.