TheoremBase

Proof sketch after Rudin: the functions x ↦ x + A⁻¹(y − f(x)) are contractions of a small ball, which gives injectivity and, by the contraction mapping theorem, openness of the image; a Lipschitz bound for the inverse gives its differentiability, and the formula Dg = (Df∘g)⁻¹ gives Cᵏ regularity by induction.

Proof

Throughout, the arithmetic and order of R\mathbb{R} are used through The Structure of ℝ as a Field and an Ordered Ring (i), The Structure of ℝ as a Field and an Ordered Ring (ii), Arithmetic and Order Rules in the Real Numbers, Stated for ℝ (v), Arithmetic and Order Rules in the Real Numbers, Stated for ℝ (ix), Rules of Arithmetic and Order in an Ordered Field (iii) and The Quotient 1/x, Order Rules for Sums, and Nesting of Closed Intervals in ℝ (i); norms and distances in Rn\mathbb{R}^{n} through Properties of the Euclidean Norm on Rn\mathbb{R}^n: Square, Distance, Vanishing, Coordinate Bounds, Homogeneity, Triangle Inequalities and Expansion of a Square (ii), Properties of the Euclidean Norm on Rn\mathbb{R}^n: Square, Distance, Vanishing, Coordinate Bounds, Homogeneity, Triangle Inequalities and Expansion of a Square (v), Properties of the Euclidean Norm on Rn\mathbb{R}^n: Square, Distance, Vanishing, Coordinate Bounds, Homogeneity, Triangle Inequalities and Expansion of a Square (vi) and Standard Basis Vectors of ℝ^q: Coordinates, Orthonormality and Unit Length (iii); (Rn,dE)(\mathbb{R}^{n},d_{E}) and (R,dR)(\mathbb{R},d_{\mathbb{R}}) are metric spaces by Rn\mathbb{R}^n with the Euclidean Distance Is a Complete Metric Space with Coordinatewise Convergence (i) and The Absolute Value Metric on the Real Numbers (i); and continuity on a set is that of Continuous Map Between Metric Spaces (ii).

We begin with (i). Let A=Df(a)A=Df(a), and let λ>0\lambda>0 be the real number with 2λ∥A−1∥=12\lambda\lVert A^{-1}\rVert=1; it exists because A−1≠0A^{-1}\neq0 (as AA−1=In≠0AA^{-1}=I_{n}\neq0), so that ∥A−1∥>0\lVert A^{-1}\rVert>0. Since ff is of class C1C^{1}, the Jacobian function x↦Df(x)x\mapsto Df(x) is continuous on UU (Basic Properties of Cᵏ Functions (v)). As UU is open, there is therefore a radius r>0r>0 such that the open ball B(a,r)B(a,r) lies in UU (Lines, Scalar Multiples, Basis Directions, Small Balls and Matrix Rows in ℝⁿ (x)) and

∥Df(x)−A∥<λfor every x∈B(a,r).\lVert Df(x)-A\rVert<\lambda\qquad\text{for every }x\in B(a,r).

Put W=B(a,r)W=B(a,r). It is an open set containing aa, and it is convex: for x,x′∈Wx,x'\in W and t∈[0,1]t\in[0,1], by Properties of the Euclidean Norm on Rn\mathbb{R}^n: Square, Distance, Vanishing, Coordinate Bounds, Homogeneity, Triangle Inequalities and Expansion of a Square (vi) and Properties of the Euclidean Norm on Rn\mathbb{R}^n: Square, Distance, Vanishing, Coordinate Bounds, Homogeneity, Triangle Inequalities and Expansion of a Square (v),

∥(1−t)x+tx′−a∥≤(1−t)∥x−a∥+t∥x′−a∥<r.\lVert(1-t)x+tx'-a\rVert\le(1-t)\lVert x-a\rVert+t\lVert x'-a\rVert<r .

For x∈Wx\in W we have ∥A−1∥ ∥Df(x)−A∥<λ∥A−1∥=12<1\lVert A^{-1}\rVert\,\lVert Df(x)-A\rVert<\lambda\lVert A^{-1}\rVert=\tfrac12<1, where the matrix distance is dn(A,Df(x))=∥A−Df(x)∥=∥Df(x)−A∥d_{n}(A,Df(x))=\lVert A-Df(x)\rVert=\lVert Df(x)-A\rVert by Rules for the Operator Norm: Bound, Least Constant, Definiteness, Homogeneity, Triangle Inequality and Products (v). So the perturbation bound Perturbations of an Invertible Matrix: the Invertible Matrices Form an Open Set and Inversion Is Continuous (i), applied to AA and the companion matrix B=Df(x)B=Df(x), shows that Df(x)Df(x) is invertible for every x∈Wx\in W.

The heart of the argument is a family of contractions. For y∈Rny\in\mathbb{R}^{n} define φy:W→Rn\varphi_{y}:W\to\mathbb{R}^{n} by

φy(x)=x+A−1(y−f(x)).\varphi_{y}(x)=x+A^{-1}\bigl(y-f(x)\bigr).

Since A−1A^{-1} is invertible, φy(x)=x\varphi_{y}(x)=x holds exactly when f(x)=yf(x)=y: the fixed points of φy\varphi_{y} are the solutions in WW of the equation f(x)=yf(x)=y. The restriction f∣Wf|_{W} is differentiable at every point of WW, with D(f∣W)=DfD(f|_{W})=Df there (Basic Properties of Cᵏ Functions (v), Restriction of a Cᵏ Function to an Open Subset (i)). For x,x+h∈Wx,x+h\in W, the algebraic rules Algebraic Rules for Matrix Products, Matrix-Vector Products and Transposes (ii), Algebraic Rules for Matrix Products, Matrix-Vector Products and Transposes (iv) and Algebraic Rules for Matrix Products, Matrix-Vector Products and Transposes (v) give

φy(x+h)−φy(x)−A−1(A−Df(x))h=−A−1(f(x+h)−f(x)−Df(x)h),\varphi_{y}(x+h)-\varphi_{y}(x)-A^{-1}\bigl(A-Df(x)\bigr)h=-A^{-1}\bigl(f(x+h)-f(x)-Df(x)h\bigr),

whose norm is at most ∥A−1∥\lVert A^{-1}\rVert times the remainder of ff at xx (Rules for the Operator Norm: Bound, Least Constant, Definiteness, Homogeneity, Triangle Inequality and Products (ii)). Hence φy\varphi_{y} is differentiable on WW with Dφy(x)=A−1(A−Df(x))D\varphi_{y}(x)=A^{-1}\bigl(A-Df(x)\bigr) (The Derivative Is the Jacobian Matrix, and Is Unique (ii)), and by Rules for the Operator Norm: Bound, Least Constant, Definiteness, Homogeneity, Triangle Inequality and Products (vii) and Rules for the Operator Norm: Bound, Least Constant, Definiteness, Homogeneity, Triangle Inequality and Products (v),

∥Dφy(x)∥≤∥A−1∥ ∥Df(x)−A∥<12(x∈W).\lVert D\varphi_{y}(x)\rVert\le\lVert A^{-1}\rVert\,\lVert Df(x)-A\rVert<\tfrac12\qquad(x\in W).

The mean value inequality The Mean Value Theorem and Inequality on Convex Open Sets (ii) on the convex open set WW, with bound M=12M=\tfrac12, now gives

∥φy(x1)−φy(x2)∥≤12∥x1−x2∥(x1,x2∈W).(∗)\lVert\varphi_{y}(x_{1})-\varphi_{y}(x_{2})\rVert\le\tfrac12\lVert x_{1}-x_{2}\rVert\qquad(x_{1},x_{2}\in W).\tag{$*$}

In particular ff is injective on WW: if f(x1)=f(x2)=yf(x_{1})=f(x_{2})=y, then x1x_{1} and x2x_{2} are both fixed points of φy\varphi_{y}, and (∗)(*) gives ∥x1−x2∥≤12∥x1−x2∥\lVert x_{1}-x_{2}\rVert\le\tfrac12\lVert x_{1}-x_{2}\rVert, so x1=x2x_{1}=x_{2}.

Next we show that V=f(W)V=f(W) is open. Let y0∈Vy_{0}\in V, say y0=f(x0)y_{0}=f(x_{0}) with x0∈Wx_{0}\in W. Since WW is open, there is ρ>0\rho>0 such that the closed ball K=BˉdE(x0,ρ)K=\bar{B}_{d_{E}}(x_{0},\rho) lies in WW (take a radius smaller than the one given by Lines, Scalar Multiples, Basis Directions, Small Balls and Matrix Rows in ℝⁿ (x)). Let ∥y−y0∥<λρ\lVert y-y_{0}\rVert<\lambda\rho. Since φy(x0)−x0=A−1(y−y0)\varphi_{y}(x_{0})-x_{0}=A^{-1}(y-y_{0}), for every x∈Kx\in K the estimate (∗)(*) and Rules for the Operator Norm: Bound, Least Constant, Definiteness, Homogeneity, Triangle Inequality and Products (ii) give

∥φy(x)−x0∥≤∥φy(x)−φy(x0)∥+∥A−1(y−y0)∥<ρ2+ρ2=ρ.\lVert\varphi_{y}(x)-x_{0}\rVert\le\lVert\varphi_{y}(x)-\varphi_{y}(x_{0})\rVert+\lVert A^{-1}(y-y_{0})\rVert<\tfrac{\rho}{2}+\tfrac{\rho}{2}=\rho .

So φy\varphi_{y} maps KK into KK, and by (∗)(*) it is a contraction of KK with constant 12\tfrac12 for the restricted metric, which is a metric on KK by Subsets of a Metric Space: the Restricted Metric, Sequences, Limits in Closed Subsets and Completeness of Closed Subsets (i). The ball KK is compact by The Heine-Borel Theorem in Rn\mathbb{R}^n, and Compactness of Closed Balls and the Unit Sphere (ii), hence closed by The Heine-Borel Theorem in Rn\mathbb{R}^n, and Compactness of Closed Balls and the Unit Sphere (i); since (Rn,dE)(\mathbb{R}^{n},d_{E}) is complete (Rn\mathbb{R}^n with the Euclidean Distance Is a Complete Metric Space with Coordinatewise Convergence (iv)) and a closed subset of a complete metric space is complete (Subsets of a Metric Space: the Restricted Metric, Sequences, Limits in Closed Subsets and Completeness of Closed Subsets (iv)), KK is complete, and it is nonempty, as x0∈Kx_{0}\in K. The contraction mapping theorem Contraction Mapping Theorem on a Nonempty Complete Metric Space (i) therefore provides a fixed point x∈Kx\in K of φy\varphi_{y}, that is, a point x∈Wx\in W with f(x)=yf(x)=y. Hence B(y0,λρ)⊆VB(y_{0},\lambda\rho)\subseteq V, and VV is open.

Let g:V→Wg:V\to W be the inverse function of f∣Wf|_{W}. We show that gg is Lipschitz. For y,y+v∈Vy,y+v\in V put x=g(y)x=g(y) and h=g(y+v)−xh=g(y+v)-x, so that f(x)=yf(x)=y and f(x+h)=y+vf(x+h)=y+v. Then φy(x+h)−φy(x)=h−A−1v\varphi_{y}(x+h)-\varphi_{y}(x)=h-A^{-1}v (Algebraic Rules for Matrix Products, Matrix-Vector Products and Transposes (v)), and (∗)(*) gives ∥h−A−1v∥≤12∥h∥\lVert h-A^{-1}v\rVert\le\tfrac12\lVert h\rVert. Hence ∥h∥≤∥h−A−1v∥+∥A−1v∥≤12∥h∥+∥A−1v∥\lVert h\rVert\le\lVert h-A^{-1}v\rVert+\lVert A^{-1}v\rVert\le\tfrac12\lVert h\rVert+\lVert A^{-1}v\rVert, and by Rules for the Operator Norm: Bound, Least Constant, Definiteness, Homogeneity, Triangle Inequality and Products (ii)

∥h∥≤2∥A−1v∥≤∥v∥λ.(∗∗)\lVert h\rVert\le2\lVert A^{-1}v\rVert\le\frac{\lVert v\rVert}{\lambda} .\tag{$**$}

In particular gg is continuous on VV: given ε>0\varepsilon>0, the choice δ=λε\delta=\lambda\varepsilon works at every point.

Now we show that gg is differentiable. Fix y∈Vy\in V, and let x=g(y)x=g(y) and T=Df(x)−1T=Df(x)^{-1}, which exists because x∈Wx\in W. With vv and hh as before, g(y+v)−g(y)=hg(y+v)-g(y)=h and v=f(x+h)−f(x)v=f(x+h)-f(x), so by Algebraic Rules for Matrix Products, Matrix-Vector Products and Transposes (v)

g(y+v)−g(y)−Tv=−T(f(x+h)−f(x)−Df(x)h).g(y+v)-g(y)-Tv=-T\bigl(f(x+h)-f(x)-Df(x)h\bigr).

We choose in this order. Given ε>0\varepsilon>0, the differentiability of ff at xx (Basic Properties of Cᵏ Functions (v)) provides η>0\eta>0 such that ∥f(x+h)−f(x)−Df(x)h∥≤ελ∥h∥/(∥T∥+1)\lVert f(x+h)-f(x)-Df(x)h\rVert\le\varepsilon\lambda\lVert h\rVert/(\lVert T\rVert+1) whenever ∥h∥<η\lVert h\rVert<\eta and x+h∈Ux+h\in U. Then choose δ>0\delta>0 with δ≤λη\delta\le\lambda\eta and B(y,δ)⊆VB(y,\delta)\subseteq V, possible as VV is open (Lines, Scalar Multiples, Basis Directions, Small Balls and Matrix Rows in ℝⁿ (x)). If ∥v∥<δ\lVert v\rVert<\delta, then y+v∈Vy+v\in V, and (∗∗)(**) gives ∥h∥<η\lVert h\rVert<\eta; hence, by Rules for the Operator Norm: Bound, Least Constant, Definiteness, Homogeneity, Triangle Inequality and Products (ii) and (∗∗)(**) again,

∥g(y+v)−g(y)−Tv∥≤∥T∥ ελ∥h∥∥T∥+1≤ε∥v∥.\lVert g(y+v)-g(y)-Tv\rVert\le\lVert T\rVert\,\frac{\varepsilon\lambda\lVert h\rVert}{\lVert T\rVert+1}\le\varepsilon\lVert v\rVert .

So gg is differentiable at yy with derivative matrix TT, and Dg(y)=TDg(y)=T by The Derivative Is the Jacobian Matrix, and Is Unique (ii); that is,

Dg(f(x))=Df(x)−1for every x∈W.Dg\bigl(f(x)\bigr)=Df(x)^{-1}\qquad\text{for every }x\in W .

It remains to see that gg is of class C1C^{1}. The function y↦Dg(y)=Df(g(y))−1y\mapsto Dg(y)=Df(g(y))^{-1} is the composite of g:V→Wg:V\to W, continuous by (∗∗)(**), of the Jacobian function x↦Df(x)x\mapsto Df(x) on WW, continuous by Basic Properties of Cᵏ Functions (v) and with values in GLn(R)\mathrm{GL}_{n}(\mathbb{R}) as shown above, and of the inversion map B↦B−1B\mapsto B^{-1} on GLn(R)\mathrm{GL}_{n}(\mathbb{R}), continuous by Perturbations of an Invertible Matrix: the Invertible Matrices Form an Open Set and Inversion Is Continuous (iv). It is therefore continuous on VV, by Continuity of Identity Maps, Compositions and Reciprocals (ii) applied twice. Its entries are the partial derivatives ∂igl\partial_{i}g_{l}, which exist on VV by The Derivative Is the Jacobian Matrix, and Is Unique (ii), and they are continuous on VV by Continuity of Vector- and Matrix-Valued Maps: the Componentwise Criterion, Norms and Algebraic Operations (ii) and Continuity of Vector- and Matrix-Valued Maps: the Componentwise Criterion, Norms and Algebraic Operations (v). So every partial derivative of every component glg_{l} exists on VV and is of class C0C^{0} there (Basic Properties of Cᵏ Functions (i)); hence each glg_{l} lies in C1(V)\mathcal{C}^{1}(V) by Functions of Class Cᵏ on an Open Subset of ℝⁿ (i), and gg is of class C1C^{1} on VV by Functions of Class Cᵏ on an Open Subset of ℝⁿ (iii). This proves (i).

We turn to (ii). Let kk, WW and gg be as there, and let V=f(W)V=f(W). For x∈Wx\in W, f∣Wf|_{W} is differentiable at xx with derivative Df(x)Df(x) (Basic Properties of Cᵏ Functions (ii), Basic Properties of Cᵏ Functions (v), Restriction of a Cᵏ Function to an Open Subset (i)), and gg is differentiable at f(x)f(x) because it is of class C1C^{1} on VV (Basic Properties of Cᵏ Functions (v)). The chain rule Chain Rule for Differentiable Functions Between Euclidean Spaces (i), applied to g∘f∣W=idWg\circ f|_{W}=\mathrm{id}_{W}, whose derivative is InI_{n} at every point (Rules for Derivatives of Functions on Open Subsets of ℝⁿ (ii) with B=InB=I_{n} and c=0c=0, as Inx=xI_{n}x=x by Algebraic Rules for Matrix Products, Matrix-Vector Products and Transposes (v)), gives Dg(f(x)) Df(x)=InDg(f(x))\,Df(x)=I_{n}. So Df(x)Df(x) is invertible (a square matrix with a left inverse is invertible) and

Dg(f(x))=Df(x)−1(x∈W).Dg\bigl(f(x)\bigr)=Df(x)^{-1}\qquad(x\in W).

We first show, by induction on j∈N0j\in\mathbb{N}_{0}, the following claim about the inverse of a matrix-valued function.

Claim. If V′⊆RnV'\subseteq\mathbb{R}^{n} is open and B:V′→Mn(R)B:V'\to\mathcal{M}_{n}(\mathbb{R}) has all entries of class CjC^{j} on V′V' and B(y)B(y) invertible for every y∈V′y\in V', then all entries of y↦B(y)−1y\mapsto B(y)^{-1} are of class CjC^{j} on V′V'.

For j=0j=0 the entries of BB are continuous, so BB is continuous on V′V' (Continuity of Vector- and Matrix-Valued Maps: the Componentwise Criterion, Norms and Algebraic Operations (ii), Continuity of Vector- and Matrix-Valued Maps: the Componentwise Criterion, Norms and Algebraic Operations (v)); then y↦B(y)−1y\mapsto B(y)^{-1}, the composite of BB with inversion, is continuous by Perturbations of an Invertible Matrix: the Invertible Matrices Form an Open Set and Inversion Is Continuous (iv) and Continuity of Identity Maps, Compositions and Reciprocals (ii), and so are its entries. For the step from jj to j+1j+1, suppose the entries of BB are of class Cj+1C^{j+1}, and let y∈V′y\in V' and i∈[n]i\in[n]. On a small interval around 00 (Lines, Scalar Multiples, Basis Directions, Small Balls and Matrix Rows in ℝⁿ (xi), The Line t ↦ x+th and Values of a Function along a Line in ℝⁿ, as Functions (ii)), the matrix function u↦B(y+uei)u\mapsto B(y+ue_{i}) is differentiable at 00, with derivative the matrix ∂iB(y)\partial_{i}B(y) of the partial derivatives ∂iBpq(y)\partial_{i}B_{pq}(y) (Partial Derivative of a Real-Valued Function on an Open Subset of Rn\mathbb{R}^n (i), Derivatives along Lines in ℝⁿ: the Line t ↦ x+th, and Partial Derivatives as Derivatives along Coordinate Axes (ii)). By the derivative of the inverse Continuity and Derivative of the Inverse of a Matrix-Valued Map (iii), read entrywise through Derivatives along Lines in ℝⁿ: the Line t ↦ x+th, and Partial Derivatives as Derivatives along Coordinate Axes (iii), the partial derivatives of the entries of B−1B^{-1} exist and

∂i(B−1)(y)=−B(y)−1 ∂iB(y) B(y)−1.\partial_{i}\bigl(B^{-1}\bigr)(y)=-B(y)^{-1}\,\partial_{i}B(y)\,B(y)^{-1}.

Each entry of the right-hand side is the negative of a sum, over finitely many index pairs, of products of an entry of B−1B^{-1}, an entry of ∂iB\partial_{i}B and an entry of B−1B^{-1}. The entries of B−1B^{-1} are of class CjC^{j} by the induction hypothesis, which applies because the entries of BB are of class CjC^{j} (Basic Properties of Cᵏ Functions (ii)); the entries ∂iBpq\partial_{i}B_{pq} are of class CjC^{j} by Basic Properties of Cᵏ Functions (iii). Products, sums of finitely many terms and negatives of functions of class CjC^{j} are of class CjC^{j} (Constants, Affine Functions, Sums, Products and Quotients of Cᵏ Functions (v), Finite Sums of Cᵏ Functions Are of Class Cᵏ (i), Constants, Affine Functions, Sums, Products and Quotients of Cᵏ Functions (iv)); the sum over index pairs is handled by applying Finite Sums of Cᵏ Functions Are of Class Cᵏ (i) twice, first to the sum over one index and then to the sum over the other. So every partial derivative of every entry of B−1B^{-1} is of class CjC^{j}, and the entries of B−1B^{-1} are of class Cj+1C^{j+1} by Functions of Class Cᵏ on an Open Subset of ℝⁿ (i). This proves the claim.

Now we show by induction that gg is of class CjC^{j} on VV for every j∈[k]j\in[k]; the case j=1j=1 is the hypothesis. Suppose gg is of class CjC^{j} with j<kj<k, and let B=Df∘gB=Df\circ g on VV, whose entries are the functions ∂ifl∘g\partial_{i}f_{l}\circ g. Each ∂ifl\partial_{i}f_{l} is of class Ck−1C^{k-1} on UU (Basic Properties of Cᵏ Functions (iii)), hence on WW (Restriction of a Cᵏ Function to an Open Subset (ii)), hence of class CjC^{j} there, as j≤k−1j\le k-1 (Basic Properties of Cᵏ Functions (ii)); so ∂ifl∘g\partial_{i}f_{l}\circ g is of class CjC^{j} on VV by Composites of Cᵏ Functions Are of Class Cᵏ (ii). By the claim, applied to BB on VV, the entries ∂igl\partial_{i}g_{l} of Dg=B−1Dg=B^{-1} are of class CjC^{j}, so gg is of class Cj+1C^{j+1} on VV (Functions of Class Cᵏ on an Open Subset of ℝⁿ (i), Functions of Class Cᵏ on an Open Subset of ℝⁿ (iii)). Hence gg is of class CkC^{k} on VV.

As f∣Wf|_{W} is of class CkC^{k} on WW (Restriction of a Cᵏ Function to an Open Subset (ii)) and is a bijection of WW onto VV whose inverse gg is of class CkC^{k} on VV, f∣Wf|_{W} is a CkC^{k} diffeomorphism of WW onto VV (Cᵏ Diffeomorphisms Between Open Subsets of ℝⁿ (i)). Finally, since Df(a)Df(a) is invertible, (i) provides such a set WW with a∈Wa\in W; applying the above to it, ff is a local CkC^{k} diffeomorphism at aa (Local Cᵏ Diffeomorphisms (i)).

Citations

Loading…

Dependencies

Uses0

Loading…

Comments

Log in to comment.

Loading…