CAL1_L22

Implicit function theorem

Notation

If $\mathbf{x}\in {\mathbb{R}}^n$ and $\mathbf{y}\in {\mathbb{R}}^m$,

$$(\mathbf{x},\mathbf{y})\equiv (x_1,\dots ,x_n,y_1,\dots ,y_m)\in {\mathbb{R}}^{n+m}.$$

Secondly, Every $A\in \mathcal{L}({\mathbb{R}}^{n+m},{\mathbb{R}}^n)$ can be split into two linear transformations $A_x$ and $A_y$, defined by

$$A_x\mathbf{h}\equiv A(\mathbf{h},0),A_y\mathbf{k}\equiv A(0,\mathbf{k})$$

for any $\mathbf{h}\in {\mathbb{R}}^n$, $\mathbf{k}\in {\mathbb{R}}^m$. Then $A_x\in \mathcal{L}({\mathbb{R}}^n,{\mathbb{R}}^n)$, $A_y\in \mathcal{L}({\mathbb{R}}^m,{\mathbb{R}}^n)$, and

$$A(\mathbf{h},\mathbf{k})=A_x\mathbf{h}+A_y\mathbf{k}.$$

Consider a system of $n$ equations in $n+k$ variables $\mathbf{f}(\mathbf{x},\mathbf{t})=0$, where $\mathbf{f}:{\mathbb{R}}^{n+k}\to {\mathbb{R}}^n$, $\mathbf{x}\in {\mathbb{R}}^n$, and $\mathbf{t}\in {\mathbb{R}}^k$. If $\mathbf{f}$ is the map

$$(\mathbf{x},\mathbf{t})\mapsto \left[\begin{array}{c}{f}_1(\mathbf{x},\mathbf{t})\\ ⋮\\ f_n(\mathbf{x},\mathbf{t})\end{array}\right],$$

then $\mathbf{f}(\mathbf{x},\mathbf{t})=0$ represents the system of equations

$$\begin{array}{c}{f}_1(\mathbf{x},\mathbf{t})=0,\\ ⋮\\ f_n(\mathbf{x},\mathbf{t})=0.\end{array}$$

Clearly, every system of $n$ equations in $n+k$ variables can be expressed in this manner.

Note that every such system of equations always represents a relation on ${\mathbb{R}}^n\times {\mathbb{R}}^k$, namely, the tuples $(\mathbf{x},\mathbf{t})$ which satisfy the system. The implicit function theorem tells us when such a relation is (locally) a function from ${\mathbb{R}}^k$ to ${\mathbb{R}}^n$, that is, when $\mathbf{x}$ can be determined uniquely as a function $\mathbf{\phi }$ of $\mathbf{t}$, in which case $\mathbf{f}$ is said to implicitly define $\mathbf{\phi }$.

The linear version of the implicit function theorem is as follows:

Theorem 1(Theorem).

If $A\in \mathcal{L}({\mathbb{R}}^{n+m},{\mathbb{R}}^n)$ and if $A_x$ is invertible, then there corresponds to every $\mathbf{k}\in {\mathbb{R}}^m$ a unique $\mathbf{h}\in {\mathbb{R}}^n$ such that $A(\mathbf{h},\mathbf{k})=0$. This $\mathbf{h}$ can be computed from $\mathbf{k}$ by the formula

$$\mathbf{h}=-(A_x{)}^{-1}{A}_y\mathbf{k}.$$

Proof
$A(\mathbf{h},\mathbf{k})=0$ iff $A_x\mathbf{h}+A_y\mathbf{k}=0$. Given $\mathbf{k}\in {\mathbb{R}}^m$, this can be solved uniquely for $\mathbf{h}$ iff $A_x$ is invertible, in which case $\mathbf{h}=-(A_x{)}^{-1}{A}_y\mathbf{k}$.

Theorem 2(Theorem).

Let $\mathbf{f}$ be a $C^1$ mapping of an open set $E\subseteq {\mathbb{R}}^{n+m}$ into ${\mathbb{R}}^n$. Let $(\mathbf{a},\mathbf{b})\in E$. Define $A\equiv {\mathbf{f}}^{\prime }(\mathbf{a},\mathbf{b})$. Assume:

• $\mathbf{f}(\mathbf{a},\mathbf{b})=0$;
• $A_x$ is invertible.

Then, there exist open sets $U\subseteq {\mathbb{R}}^{n+m}$ and $W\subseteq {\mathbb{R}}^m$, with $(\mathbf{a},\mathbf{b})\in U$ and $\mathbf{b}\in W$, having the property:

To every $\mathbf{y}\in W$ corresponds a unique $\mathbf{x}$ such that

$$(\mathbf{x},\mathbf{y})\in U\text{ and }\mathbf{f}(\mathbf{x},\mathbf{y})=0.$$

If this $\mathbf{x}$ is defined to be $\mathbf{g}(\mathbf{y})$, then

• $\mathbf{g}$ is a $C^1$ mapping of $W$ into ${\mathbb{R}}^n$;
• $\mathbf{g}(\mathbf{b})=\mathbf{a}$;
• $\mathbf{f}(\mathbf{g}(\mathbf{y}),\mathbf{y})=0$ for all $\mathbf{y}\in W$;
• ${\mathbf{g}}^{\prime }(\mathbf{b})=-(A_x{)}^{-1}{A}_y$.

Proof
Define $\mathbf{F}:E\to {\mathbb{R}}^{n+m}$ by

$$\mathbf{F}(\mathbf{x},\mathbf{y})=(\mathbf{f}(\mathbf{x},\mathbf{y}),\mathbf{y})((\mathbf{x},\mathbf{y})\in E).$$

Then $\mathbf{F}$ is a $C^1$ mapping of $E$ into ${\mathbb{R}}^{n+m}$.