Lecture 4: The Inverse Function Theorem

KSM3E04: Analysis on Manifolds — Fall 2025   |   August 20, 3:00–4:00 PM

In single-variable calculus, a simple but fundamental fact is the following: if a differentiable function $f:\mathbf{R}\to\mathbf{R}$ has a nonzero derivative at a point $a$, then $f$ is strictly monotone in a neighborhood of $a$, and hence admits a local inverse. This local inverse is differentiable, with derivative given by the reciprocal rule $$(f^{-1})'(f(a)) = \frac{1}{f'(a)}.$$ Thus, the non-vanishing of the derivative at a point guarantees local invertibility.

The Inverse Function Theorem extends this principle to functions between higher-dimensional spaces. For a smooth map $f:\mathbf{R}^n \to \mathbf{R}^n$, the role of the nonzero derivative is played by the condition $\det Df(a) \neq 0$. The theorem asserts that this condition is both necessary and sufficient for $f$ to have a smooth local inverse near $a$. This result is one of the cornerstones of multivariable calculus and analysis on manifolds, providing the precise mechanism by which we can “change coordinates” and study complicated functions through simpler local models.

1. From Single-Variable to Multivariable

Recall from single-variable calculus that if a differentiable function $f:\mathbf{R}\to\mathbf{R}$ has a non-zero derivative at a point $a$, i.e., $f'(a)\neq 0$, then $f$ is locally invertible and its inverse is also differentiable. For example, if $f'(a)>0$, the function is locally strictly increasing, guaranteeing an inverse.

The Inverse Function Theorem generalizes this idea to higher dimensions. The role of the non-zero derivative is taken by the Jacobian determinant, which must be non-zero at the point in question.

Example (Failure of Global Invertibility)

Consider the function $f:\mathbf{R}^2 \to \mathbf{R}^2$ defined by $$ f(x,y) = (e^x \cos y, \; e^x \sin y). $$ Its Jacobian matrix is

$$ f'(x,y) = \begin{pmatrix} e^x \cos y & -e^x \sin y \\[6pt] e^x \sin y & e^x \cos y \end{pmatrix}. $$

The determinant is $\det f'(x,y) = e^{2x} \neq 0$ for all $(x,y)$. The Jacobian is always invertible. However, the function is not one-to-one on all of $\mathbf{R}^2$ because $f(x,y+2\pi) = f(x,y)$. The theorem only guarantees a local inverse, not a global one.

2. The Inverse Function Theorem

The theorem provides the precise conditions under which a differentiable function can be inverted in a neighborhood of a point.

Theorem (Inverse Function Theorem)

Suppose $f:\mathbf{R}^n \to \mathbf{R}^n$ is continuously differentiable in an open set containing $a$, and $Df(a)$ is invertible. Then there exist open sets $U \subset \mathbf{R}^n$ containing $a$ and $V \subset \mathbf{R}^n$ containing $f(a)$ such that

  1. $f: U \to V$ is a bijection.
  2. The inverse function $f^{-1}: V \to U$ is continuously differentiable.
  3. For all $y \in V$, the derivative satisfies $$ Df^{-1}(y) = [Df(f^{-1}(y))]^{-1}. $$
Step 1: Reduction to the Case $Df(a) = I$

Let $A = Df(a)$, which is invertible since $Df(a)$ is invertible. Consider the auxiliary map

$$ g(x) = A^{-1} f(x). $$

Then $g$ is continuously differentiable and $Dg(a) = A^{-1}Df(a) = I$. If we can prove the Inverse Function Theorem for $g$, then the result for $f$ follows immediately (since invertibility of $g$ implies invertibility of $f$ via composition with the linear isomorphism $A$). Thus we may assume without loss of generality that

$$ Df(a) = I. $$
Step 2: Constructing a Neighborhood Avoiding $f(a)$

Since $Df$ is continuous and $Df(a)$ is invertible, we can choose a small closed rectangle $U$ around $a$ such that the following hold:

  1. $f(x) \neq f(a)$ for all $x \in U$, $x \neq a$: This ensures that $f(a)$ has no other preimages in $U$. In other words, within $U$, $f$ is injective at $a$.
  2. $Df(x)$ is invertible for all $x \in U$: Invertibility of $Df(a)$ extends to a small neighborhood by continuity. This guarantees that the function behaves “locally like a linear isomorphism.”
  3. Derivatives are uniformly close to the identity: $$ |D_j f^i(x) - \delta_{ij}| < \frac{1}{2n^2} \quad \text{for all } x \in U. $$ This technical condition ensures that $f$ is a small perturbation of the identity map. It allows us to control the differences $f(x_1)-f(x_2)$ quantitatively in Step 3.

Intuition: Inside this rectangle, $f$ behaves like the identity plus a small correction. This setup is crucial to establish injectivity and to eventually construct the local inverse.

Step 3: Establishing the Key Inequality (Injectivity)

To control the differences $f(x_1) - f(x_2)$, we first prove the following standard inequality for rectangles in $\mathbf{R}^n$:

Lemma (Inequality for continuously differentiable maps)

Let $A \subset \mathbf{R}^n$ be a rectangle and $f:A \to \mathbf{R}^n$ be continuously differentiable. Suppose there is a number $M$ such that $|D_j f^i(x)| \le M$ for all $x \in A$ and all $i,j$. Then for any $x, y \in A$:

$$ |f(x) - f(y)| \le n^2 M |x - y|. $$

Proof:

For each component $f^i$, write

$$ f^i(y) - f^i(x) = \sum_{j=1}^{n} \Big[ f^i(y^1, \dots, y^j, x^{j+1}, \dots, x^n) - f^i(y^1, \dots, y^{j-1}, x^j, \dots, x^n) \Big]. $$

By the mean value theorem in one variable, for each term in the sum there exists some $z_{ij}$ such that

$$ f^i(y^1, \dots, y^j, x^{j+1}, \dots, x^n) - f^i(y^1, \dots, y^{j-1}, x^j, \dots, x^n) = (y^j - x^j) D_j f^i(z_{ij}). $$

Taking absolute values and using $|D_j f^i(z_{ij})| \le M$:

$$ |f^i(y) - f^i(x)| \le \sum_{j=1}^{n} |y^j - x^j| \cdot M \le n M |y - x|. $$

Finally, summing over $i = 1, \dots, n$, we get

$$ |f(y) - f(x)| \le \sum_{i=1}^{n} |f^i(y) - f^i(x)| \le n^2 M |y - x|. \quad \square $$

Now apply this lemma to $g(x) = f(x) - x$ on the rectangle $U$ from Step 2. Since $|D_j g^i(x)| = |D_j f^i(x) - \delta_{ij}| < 1/(2n^2)$ for all $i,j$, the lemma implies:

$$ |g(x_1) - g(x_2)| = |(f(x_1) - x_1) - (f(x_2) - x_2)| \le \frac{1}{2} |x_1 - x_2|. $$

Using the triangle inequality,

$$ |x_1 - x_2| \le |f(x_1) - f(x_2)| + |g(x_1) - g(x_2)| \le |f(x_1) - f(x_2)| + \frac{1}{2}|x_1 - x_2|. $$

Rearranging, we obtain the key injectivity inequality:

$$ |f(x_1) - f(x_2)| \ge \frac{1}{2} |x_1 - x_2|. $$

This shows that $f$ is injective on $U$. Intuitively, $f$ is a small perturbation of the identity, so points cannot collapse together.

Step 4: Surjectivity onto a Neighborhood

By injectivity and continuity, $f$ maps $U$ homeomorphically onto its image. To show that $f(U)$ actually contains a neighborhood of $f(a)$, we proceed as follows.

Let $\partial U$ denote the boundary of $U$. Recall that by construction, $f(x) \neq f(a)$ for all $x \in \partial U$. Therefore, the distance from $f(a)$ to the boundary image is positive:

$$ d = \min_{x \in \partial U} |f(x) - f(a)| > 0. $$

Define the open ball

$$ W = \{ y \in \mathbf{R}^n : |y - f(a)| < d/2 \}. $$

For any $y \in W$ and any $x \in \partial U$, we have

$$ |y - f(a)| < d/2 < |y - f(x)|, $$

ensuring that the function

$$ g(x) = |y - f(x)|^2 $$

attains its minimum inside the interior of $U$. At the minimum point $x \in \text{interior } U$, the derivative vanishes:

$$ D_j g(x) = -2 \sum_{i=1}^n (y^i - f^i(x)) D_j f^i(x) = 0 \quad \text{for all } j. $$

Since $Df(x)$ is invertible for $x \in U$, the only solution is $y - f(x) = 0$, i.e., $y = f(x)$. Uniqueness follows from the injectivity inequality in Step 3. Therefore, each $y \in W$ has a unique preimage in $U$.

We conclude that

$$ f: (\text{interior } U) \cap f^{-1}(W) \to W $$

is a bijection, giving a local inverse around $a$.

Step 5: Differentiability of the Inverse

Let $g = f^{-1}$ on $W$ (constructed in Step 4). To show that $g$ is differentiable, take any $x \in V = (\text{interior } U) \cap f^{-1}(W)$. Let $\mu = Df(x)$, which is invertible by Step 2. For $x_1 \in V$ close to $x$, we can write

$$ f(x_1) = f(x) + \mu (x_1 - x) + \phi(x_1 - x), $$

where the remainder $\phi(h)$ satisfies

$$ \lim_{h \to 0} \frac{|\phi(h)|}{|h|} = 0. $$

Solving for $x_1$ in terms of $y_1 = f(x_1)$ gives

$$ x_1 = x + \mu^{-1} (y_1 - f(x)) - \mu^{-1}(\phi(x_1 - x)). $$

Since $x_1 = g(y_1)$ and $x = g(y)$ with $y = f(x)$, we can write

$$ g(y_1) = g(y) + \mu^{-1} (y_1 - y) - \mu^{-1}(\phi(g(y_1) - g(y))). $$

To check differentiability, consider the limit

$$ \lim_{y_1 \to y} \frac{|g(y_1) - g(y) - \mu^{-1}(y_1 - y)|}{|y_1 - y|} = \lim_{y_1 \to y} \frac{|\mu^{-1}(\phi(g(y_1) - g(y)))|}{|y_1 - y|}. $$

Using the inequality from Step 3, $g$ is Lipschitz continuous:

$$ |g(y_1) - g(y)| \le 2 |y_1 - y|, $$

and by the property of $\phi$, the numerator approaches zero faster than the denominator. Therefore, the limit is zero, proving that $g$ is differentiable at $y$ with

$$ Dg(y) = [Df(g(y))]^{-1}. $$

3. Problems for Practice

To deepen your understanding of the Inverse Function Theorem, try the following problems. They range from simple verifications in one variable to applications in higher dimensions.

Exercise 1: Global Invertibility in One Dimension

Let $f:\mathbf{R}\to\mathbf{R}$ be a continuously differentiable function.

  1. Prove that if $f'(x) \neq 0$ for all $x \in \mathbf{R}$, then $f$ is globally one-to-one (injective) and thus globally invertible. (Hint: Use the Intermediate Value Theorem on $f'$).
  2. Explain why this result fails in higher dimensions by considering the function $f(x,y) = (e^x \cos y, e^x \sin y)$ on $\mathbf{R}^2$.

Exercise 2: Single-variable warm-up

Let $f:\mathbf{R}\to\mathbf{R}$ be defined by $f(x) = x^3$. Verify that $f'(0) = 0$, and explain why the Inverse Function Theorem does not apply at $0$. Contrast this with $f(x) = x^3 + x$, where $f'(0)\neq 0$.

Exercise 3: Jacobian check

Consider the map $F:\mathbf{R}^2 \to \mathbf{R}^2$ given by $$ F(x,y) = (x+y, \; x-y). $$

  1. Compute the Jacobian matrix $DF(x,y)$.
  2. Show that it is invertible everywhere.
  3. Find the inverse map explicitly.

Exercise 4: Local vs. global invertibility

Revisit the example $$ f(x,y) = (e^x \cos y, \; e^x \sin y). $$ Explain why the Jacobian is invertible everywhere, but $f$ is not globally invertible. Find an open set $U \subset \mathbf{R}^2$ where $f$ is injective and thus admits a differentiable inverse.

Exercise 5: A 3D example

Let $f:\mathbf{R}^3 \to \mathbf{R}^3$ be defined by $$ f(x,y,z) = (x + y, \; y + z, \; z + x). $$

  1. Compute the Jacobian $Df(x,y,z)$.
  2. Determine at which points $Df$ is invertible.
  3. For those points, explain why the Inverse Function Theorem guarantees local invertibility.

Exercise 6: Conceptual

Why is the condition $\det Df(a) \neq 0$ only a local guarantee of invertibility, not a global one? Illustrate with an example in $\mathbf{R}$ or $\mathbf{R}^2$.

← Lecture 3 Lecture 5 →