Theorems · Theorem · global analysis

ApproximatesLinearOn.surjective

∀ {𝕜 : Type u_1} [inst : NontriviallyNormedField 𝕜] {E : Type u_2} [inst_1 : NormedAddCommGroup E]
  [inst_2 : NormedSpace 𝕜 E] {F : Type u_3} [inst_3 : NormedAddCommGroup F] [inst_4 : NormedSpace 𝕜 F] {f : E → F}
  {f' : E ≃L[𝕜] F} {c : NNReal} [CompleteSpace E],
  ApproximatesLinearOn f (↑f') Set.univ c → Subsingleton E ∨ c < ‖↑f'.symm‖₊⁻¹ → Function.Surjective f

Defined in

Mathlib.Analysis.Calculus.InverseFunctionTheorem.ApproximatesLinearOn

Cited by

0 results in Mathlib

Foundations

Depth 178 from the axioms · uses propext, Classical.choice, Quot.sound

Assumes

NontriviallyNormedFieldNormedAddCommGroupNormedSpaceNormedAddCommGroupNormedSpaceCompleteSpace