Math 2.0

statement theorem

Implicit function theorem

Statement

Let Ω⊆Rn×Rm\Omega \subseteq \mathbb{R}^n \times \mathbb{R}^m be open, and let F ⁣:Ω→RmF \colon \Omega \to \mathbb{R}^m be of class C^1, written F(x,y)F(x, y) with x∈Rnx \in \mathbb{R}^n and y∈Rmy \in \mathbb{R}^m. Let (a,b)∈Ω(a, b) \in \Omega with F(a,b)=0F(a, b) = 0. Suppose that the m×mm \times m matrix DyF(a,b)=(∂Fi/∂yj(a,b))i,jD_y F(a, b) = \left( \partial F_i / \partial y_j (a, b) \right)_{i, j} is invertible. Then there are open sets U⊆RnU \subseteq \mathbb{R}^n and V⊆RmV \subseteq \mathbb{R}^m with a∈Ua \in U and b∈Vb \in V, and a unique function g ⁣:U→Vg \colon U \to V with the following property. For (x,y)∈U×V(x, y) \in U \times V, F(x,y)=0F(x, y) = 0 if and only if y=g(x)y = g(x). The function gg is of class C1C^1, and Dg(x)=−(DyF(x,g(x)))−1DxF(x,g(x))Dg(x) = -\big( D_y F(x, g(x)) \big)^{-1} D_x F(x, g(x)) for each x∈Ux \in U.

Remarks

Here DxFD_x F is the m×nm \times n matrix of partial derivatives with respect to xx. Together, DxFD_x F and DyFD_y F form the Jacobian matrix of FF. For F(x,y)=x2+y2−1F(x, y) = x^2 + y^2 - 1 and (a,b)(a, b) with b≠0b \ne 0, the solution near (a,b)(a, b) is y=±1−x2y = \pm \sqrt{1 - x^2}. At (±1,0)(\pm 1, 0), ∂F/∂y=0\partial F / \partial y = 0, and no such function exists. One proof applies the inverse function theorem to (x,y)↦(x,F(x,y))(x, y) \mapsto (x, F(x, y)). If FF is of class CkC^k, then gg is of class CkC^k. The theorem has a long history. Cauchy gave the first rigorous form, and Dini extended the real version to any number of variables.

Explanations

L1 human

An equation F(x,y)=0F(x, y) = 0 often defines yy as a function of xx, even when you cannot solve it with a formula. The theorem says this works near a solution, provided FF really depends on yy there, in the sense that DyFD_y F is invertible.

What this node needs for W2
  • edge about out: the concepts that the statement is about (0 of 1)
  • edge proves in: at least one proof node (0 of 1)
  • edge instance_of or illustrates in: one example that shows the statement at work (0 of 1)
  • explanation L2 (0 of 1)

The writing levels say how complete the text of a node is. They do not measure its truth.

What depends on this

4 nodes use this node, directly or through other nodes.

Sources

  1. Web https://en.wikipedia.org/wiki/Implicit_function_theorem, Statement of the theorem
  2. Web https://en.wikipedia.org/wiki/Implicit_function_theorem, History