Theorem 9.24 — inverse function theorem
ProvedRudin.ch09_inverse_functionanalysiscalculus
Let be a -mapping of an open set into and suppose is invertible for some . Then there exist open sets and with and such that is one-to-one on and ; moreover the inverse mapping , defined on by , is a -mapping on .
Preamble
import Mathlib open Filter Topology
Formal statement
namespace Rudin
/-- Rudin, Theorem 9.24 (inverse function theorem): let `f` be a `C'`-mapping of an open set
`E ⊆ ℝⁿ` into `ℝⁿ` whose derivative at `a ∈ E` is invertible. Then there are open sets
`U ∋ a` and `V ∋ f a` such that `f` is one-to-one on `U` with `f(U) = V`, and the inverse
mapping `g` of `f` restricted to `U` is a `C'`-mapping on `V`. -/
theorem ch09_inverse_function (n : ℕ) (E : Set (EuclideanSpace ℝ (Fin n))) (hE : IsOpen E)
(f : EuclideanSpace ℝ (Fin n) → EuclideanSpace ℝ (Fin n)) (hf : ContDiffOn ℝ 1 f E)
(a : EuclideanSpace ℝ (Fin n)) (ha : a ∈ E)
(A : EuclideanSpace ℝ (Fin n) →L[ℝ] EuclideanSpace ℝ (Fin n)) (hA : HasFDerivAt f A a)
(hAinv : Function.Bijective A) :
∃ (U V : Set (EuclideanSpace ℝ (Fin n)))
(g : EuclideanSpace ℝ (Fin n) → EuclideanSpace ℝ (Fin n)),
IsOpen U ∧ IsOpen V ∧ a ∈ U ∧ U ⊆ E ∧ f a ∈ V ∧ Set.InjOn f U ∧ f '' U = V ∧
(∀ x ∈ U, g (f x) = x) ∧ (∀ y ∈ V, f (g y) = y) ∧ ContDiffOn ℝ 1 g V := by sorry
end RudinSource
Walter Rudin, Principles of Mathematical Analysis, 3rd edition, McGraw-Hill, 1976, Chapter 9, p. 221, Theorem 9.24
Read-back
What the Lean code literally says, in plain math · Aristotle (Harmonic)
Let , let be open, let be continuously differentiable of order on , let , and let be a continuous linear map which is the Fréchet derivative of at and is bijective.
Then there exist open sets and a map such that all of the following hold:
- and ; ;
- is injective on , and the image equals ;
- for every , and for every ;
- is continuously differentiable of order on .
Nothing is asserted about the derivative of (in particular no formula ), and is unconstrained outside .
Human review
Confirmed by the mission captain (proposal self-audit).