Differentiability
DefinitionDifferentiable function between normed vector spaces#
A function f has the continuous linear map f' as derivative at x if
f x' = f x + f' (x' - x) + o (x' - x) when x' tends to x.
HasFDerivAt.{u_1, u_2, u_3} {𝕜 : Type u_1} [NontriviallyNormedField 𝕜] {E : Type u_2}
[AddCommGroup E] [_root_.Module 𝕜 E] [TopologicalSpace E] {F : Type u_3} [AddCommGroup F]
[_root_.Module 𝕜 F] [TopologicalSpace F] (f : E → F) (f' : E →L[𝕜] F) (x : E) : Prop
Sources
Uses 2 · Used by 29
TheoremDerivative of a composition of functions (Analysis)#
The chain rule.
HasFDerivAt.comp.{u_1, u_2, u_3, u_4} {𝕜 : Type u_1} [NontriviallyNormedField 𝕜] {E : Type u_2}
[NormedAddCommGroup E] [NormedSpace 𝕜 E] {F : Type u_3} [NormedAddCommGroup F] [NormedSpace 𝕜 F]
{G : Type u_4} [AddCommGroup G] [TopologicalSpace G] [_root_.Module 𝕜 G] [ContinuousAdd G]
[ContinuousSMul 𝕜 G] {f : E → F} {f' : E →L[𝕜] F} (x : E) {g : F → G} {g' : F →L[𝕜] G}
(hg : HasFDerivAt g g' (f x)) (hf : HasFDerivAt f f' x) : HasFDerivAt (g ∘ f) (g' ∘SL f') x
Sources
Uses 4 · Used by 7
TheoremDerivative of the inverse of a function (Analysis)#
If f (g x) = x for x in some neighborhood of a, g is continuous at a,
and f has an invertible derivative f' at g a, then g has the derivative f'⁻¹ at a.
This is one of the easy parts of the inverse function theorem: it assumes that we already have an inverse function.
HasFDerivAt.of_local_left_inverse.{u_1, u_2, u_3} {𝕜 : Type u_1} {E : Type u_2} {F : Type u_3}
[NontriviallyNormedField 𝕜] [NormedAddCommGroup E] [NormedSpace 𝕜 E] [NormedAddCommGroup F]
[NormedSpace 𝕜 F] {g : E → F} {f : F → E} {f' : F ≃L[𝕜] E} {a : E} (hg : ContinuousAt g a)
(hf : HasFDerivAt f (↑f') (g a)) (hfg : ∀ᶠ (y : E) in nhds a, f (g y) = y) :
HasFDerivAt g (↑f'.symm) a
Sources
Uses 5
TheoremRolle's theorem#
Rolle's Theorem deriv version
exists_deriv_eq_zero {f : ℝ → ℝ} {a b : ℝ} (hab : a < b) (hfc : ContinuousOn f (Set.Icc a b))
(hfI : f a = f b) : ∃ c ∈ Set.Ioo a b, deriv f c = 0
Sources
- Mathlib documentation:
exists_deriv_eq_zero - Source of
exists_deriv_eq_zeroin Mathlib/Analysis/Calculus/LocalExtr/Rolle.lean - Mathlib overview: Analysis › Differentiability
- Mathlib undergraduate list: Single Variable Real Analysis › Differentiability
- 1000+ theorems list: Q193286
- 1000+ theorems project: Q193286
- Wikipedia: Rolle's theorem
- Wikidata: Q193286
Uses 4 · Used by 1
TheoremMean value theorem (Differentiability)#
Cauchy's Mean Value Theorem, deriv version.
exists_ratio_deriv_eq_ratio_slope (f : ℝ → ℝ) {a b : ℝ} (hab : a < b)
(hfc : ContinuousOn f (Set.Icc a b)) (hfd : DifferentiableOn ℝ f (Set.Ioo a b)) (g : ℝ → ℝ)
(hgc : ContinuousOn g (Set.Icc a b)) (hgd : DifferentiableOn ℝ g (Set.Ioo a b)) :
∃ c ∈ Set.Ioo a b, (g b - g a) * deriv f c = (f b - f a) * deriv g c
Sources
- Mathlib documentation:
exists_ratio_deriv_eq_ratio_slope - Source of
exists_ratio_deriv_eq_ratio_slopein Mathlib/Analysis/Calculus/Deriv/MeanValue.lean - Mathlib overview: Analysis › Differentiability
- Mathlib undergraduate list: Single Variable Real Analysis › Differentiability
- Mathlib undergraduate list: Multivariable calculus › Differential calculus
Uses 9
TheoremTaylor's theorem#
This file defines the Taylor polynomial of a real function f : ℝ → E,
where E is a normed vector space over ℝ and proves Taylor's theorem,
which states that if f is sufficiently smooth, then
f can be approximated by the Taylor polynomial up to an explicit error term.
Mathlib covers this with the module Mathlib.Analysis.Calculus.Taylor rather than a single declaration.
Its 23 documented declarations include taylorCoeffWithin, taylorWithin, taylorWithinEval, taylor_within_zero_eval, taylorWithinEval_self, continuousOn_taylorWithinEval, monomial_has_deriv_aux, hasDerivWithinAt_taylorWithinEval, taylorWithinEval_hasDerivAt_Ioo, hasDerivWithinAt_taylorWithinEval_at_Icc, hasDerivAt_taylorWithinEval_succ, taylor_isLittleO, and 11 more.
Definition\(C^k\) function#
A function is continuously differentiable up to n if it admits derivatives up to
order n, which are continuous. Contrary to the case of definitions in domains (where derivatives
might not be unique) we do not need to localize the definition in space or time.
The parameter n belongs to ℕ∞ω (accessible in the ContDiff scope), i.e. it can be a natural
number, ∞, or ω.
For n = ω, we require the function to be analytic. The precise
definition we give (all the derivatives should be analytic) is more involved to work around issues
when the space is not complete, but it is equivalent when the space is complete.
ContDiff.{u, uE, uF} (𝕜 : Type u) [NontriviallyNormedField 𝕜] {E : Type uE} [NormedAddCommGroup E]
[NormedSpace 𝕜 E] {F : Type uF} [NormedAddCommGroup F] [NormedSpace 𝕜 F] (n : WithTop ℕ∞)
(f : E → F) : Prop
Sources
Uses 3 · Used by 9
TheoremLeibniz formula (Analysis)#
Mathlib states this as fderiv_mul.
fderiv_mul.{u_1, u_2, u_5} {𝕜 : Type u_1} [NontriviallyNormedField 𝕜] {E : Type u_2}
[NormedAddCommGroup E] [NormedSpace 𝕜 E] {x : E} {𝔸' : Type u_5} [NormedCommRing 𝔸']
[NormedAlgebra 𝕜 𝔸'] {c d : E → 𝔸'} (hc : DifferentiableAt 𝕜 c x) (hd : DifferentiableAt 𝕜 d x) :
fderiv 𝕜 (c * d) x = c x • fderiv 𝕜 d x + d x • fderiv 𝕜 c x
Sources
TheoremLocal extrema#
Fermat's Theorem: the derivative of a function at a local minimum equals zero.
IsLocalMin.fderiv_eq_zero.{u} {E : Type u} [NormedAddCommGroup E] [NormedSpace ℝ E] {f : E → ℝ}
{a : E} (h : IsLocalMin f a) : fderiv ℝ f a = 0
Sources
Uses 10 · Used by 1
TheoremInverse function theorem (Differentiability)#
If f has an invertible derivative f' at a in the sense of strict differentiability (hf),
then the inverse function hf.localInverse f has derivative f'.symm at f a.
HasStrictFDerivAt.to_localInverse.{u_1, u_2, u_3} {𝕜 : Type u_1} [NontriviallyNormedField 𝕜]
{E : Type u_2} [NormedAddCommGroup E] [NormedSpace 𝕜 E] {F : Type u_3} [NormedAddCommGroup F]
[NormedSpace 𝕜 F] {f : E → F} {f' : E ≃L[𝕜] F} {a : E} [CompleteSpace E]
(hf : HasStrictFDerivAt f (↑f') a) :
HasStrictFDerivAt (HasStrictFDerivAt.localInverse f f' a hf) (↑f'.symm) (f a)
Sources
- Mathlib documentation:
HasStrictFDerivAt.to_localInverse - Source of
HasStrictFDerivAt.to_localInversein Mathlib/Analysis/Calculus/InverseFunctionTheorem/FDeriv.lean - Mathlib overview: Analysis › Differentiability
- 1000+ theorems list: Q931001
- 1000+ theorems project: Q931001
- Wikipedia: Inverse function theorem
- Wikidata: Q931001
Uses 3 · Used by 1
DefinitionImplicit function theorem#
Implicit function theorem. If f : E → F and g : E → G are two maps strictly differentiable
at a, their derivatives f', g' are surjective, and the kernels of these derivatives are
complementary subspaces of E, then implicitFunction is the unique (germ of a) map
φ : F → G → E such that f (φ y z) = y and g (φ y z) = z.
ImplicitFunctionData.implicitFunction.{u_1, u_2, u_3, u_4} {𝕜 : Type u_1}
[NontriviallyNormedField 𝕜] {E : Type u_2} [NormedAddCommGroup E] [NormedSpace 𝕜 E]
[CompleteSpace E] {F : Type u_3} [NormedAddCommGroup F] [NormedSpace 𝕜 F] [CompleteSpace F]
{G : Type u_4} [NormedAddCommGroup G] [NormedSpace 𝕜 G] [CompleteSpace G]
(φ : ImplicitFunctionData 𝕜 E F G) : F → G → E
Sources
- Mathlib documentation:
ImplicitFunctionData.implicitFunction - Source of
ImplicitFunctionData.implicitFunctionin Mathlib/Analysis/Calculus/Implicit.lean - Mathlib overview: Analysis › Differentiability
- Mathlib undergraduate list: Multivariable calculus › Differential calculus
- 1000+ theorems list: Q848375
- 1000+ theorems project: Q848375
- Wikipedia: Implicit function theorem
- Wikidata: Q848375
Uses 7
DefinitionAnalytic function#
Given a function f : E → F, we say that f is analytic at x if it admits a convergent power
series expansion around x.
AnalyticAt.{u_1, u_2, u_3} (𝕜 : Type u_1) {E : Type u_2} {F : Type u_3} [NontriviallyNormedField 𝕜]
[NormedAddCommGroup E] [NormedSpace 𝕜 E] [NormedAddCommGroup F] [NormedSpace 𝕜 F] (f : E → F)
(x : E) : Prop
Sources
Uses 2 · Used by 8
Loading dependency explorer…
The dependency explorer needs JavaScript and its graph data.