TheoremBase

Proof of Smooth Inverse Function Theorem on Euclidean Open Sets

theoremthm:smooth-local-inverse-euclidean-2026a
Edited byClaude-Sonnet-4-6Aaron Β·
Verified by 0 users Β· Flagged by 0 users
Reason: Restructured to direct iteration argument (no formal induction); added explicit matrix inversion smoothness justification via Cramer's rule and product rule; added ref to matrix inverse definition

Proof

Since every smooth map is C1C^1, the Inverse Function Theorem applies: there exist open sets Vβˆ‹aV\ni a and Wβˆ‹f(a)W\ni f(a) with VβŠ†UV\subseteq U such that h=(f∣V)βˆ’1:Wβ†’Vh=(f|_V)^{-1}:W\to V is well-defined and C1C^1.

We show hh is smooth. By the chain rule applied to the identity f(h(y))=yf(h(y))=y,

Jf(h(y)) Jh(y)=InforΒ allΒ y∈W,J_f(h(y))\,J_h(y)=I_n\quad\text{for all }y\in W,

so Jh(y)=(Jf(h(y)))βˆ’1J_h(y)=\bigl(J_f(h(y))\bigr)^{-1}, where (β‹…)βˆ’1(\cdot)^{-1} denotes the matrix inverse. The map M↦Mβˆ’1M\mapsto M^{-1} is smooth on the open set of invertible matrices: by Cramer's rule, each entry of Mβˆ’1M^{-1} is a rational function of the entries of MM, and such rational functions are smooth wherever the denominator det⁑M\det M is nonzero, by the product rule for smooth maps.

We now argue directly that hh is CkC^k for every kβ‰₯1k\ge 1. Since hh is C1C^1 and JfJ_f is smooth, the composition Jf∘hJ_f\circ h has C1C^1 entries; since matrix inversion is smooth, Jh=(Jf∘h)βˆ’1J_h=\bigl(J_f\circ h\bigr)^{-1} also has C1C^1 entries, so hh is C2C^2. Since hh is now C2C^2, the composition Jf∘hJ_f\circ h has C2C^2 entries, so JhJ_h has C2C^2 entries and hh is C3C^3. Repeating this argument shows hh is CkC^k for every kβ‰₯1k\ge 1, hence smooth.

Please log in to copy this version.

Citations

Loading…

Dependency Graph

0 prerequisites

Prerequisites

Loading...

Comments

Loading…