# mathlibdocumentation

analysis.calculus.times_cont_diff

# Higher differentiability #

A function is `C^1` on a domain if it is differentiable there, and its derivative is continuous. By induction, it is `C^n` if it is `C^{n-1}` and its (n-1)-th derivative is `C^1` there or, equivalently, if it is `C^1` and its derivative is `C^{n-1}`. Finally, it is `C^β` if it is `C^n` for all n.

We formalize these notions by defining iteratively the `n+1`-th derivative of a function as the derivative of the `n`-th derivative. It is called `iterated_fderiv π n f x` where `π` is the field, `n` is the number of iterations, `f` is the function and `x` is the point, and it is given as an `n`-multilinear map. We also define a version `iterated_fderiv_within` relative to a domain, as well as predicates `times_cont_diff_within_at`, `times_cont_diff_at`, `times_cont_diff_on` and `times_cont_diff` saying that the function is `C^n` within a set at a point, at a point, on a set and on the whole space respectively.

To avoid the issue of choice when choosing a derivative in sets where the derivative is not necessarily unique, `times_cont_diff_on` is not defined directly in terms of the regularity of the specific choice `iterated_fderiv_within π n f s` inside `s`, but in terms of the existence of a nice sequence of derivatives, expressed with a predicate `has_ftaylor_series_up_to_on`.

We prove basic properties of these notions.

## Main definitions and results #

Let `f : E β F` be a map between normed vector spaces over a nondiscrete normed field `π`.

• `has_ftaylor_series_up_to n f p`: expresses that the formal multilinear series `p` is a sequence of iterated derivatives of `f`, up to the `n`-th term (where `n` is a natural number or `β`).
• `has_ftaylor_series_up_to_on n f p s`: same thing, but inside a set `s`. The notion of derivative is now taken inside `s`. In particular, derivatives don't have to be unique.
• `times_cont_diff π n f`: expresses that `f` is `C^n`, i.e., it admits a Taylor series up to rank `n`.
• `times_cont_diff_on π n f s`: expresses that `f` is `C^n` in `s`.
• `times_cont_diff_at π n f x`: expresses that `f` is `C^n` around `x`.
• `times_cont_diff_within_at π n f s x`: expresses that `f` is `C^n` around `x` within the set `s`.
• `iterated_fderiv_within π n f s x` is an `n`-th derivative of `f` over the field `π` on the set `s` at the point `x`. It is a continuous multilinear map from `E^n` to `F`, defined as a derivative within `s` of `iterated_fderiv_within π (n-1) f s` if one exists, and `0` otherwise.
• `iterated_fderiv π n f x` is the `n`-th derivative of `f` over the field `π` at the point `x`. It is a continuous multilinear map from `E^n` to `F`, defined as a derivative of `iterated_fderiv π (n-1) f` if one exists, and `0` otherwise.

In sets of unique differentiability, `times_cont_diff_on π n f s` can be expressed in terms of the properties of `iterated_fderiv_within π m f s` for `m β€ n`. In the whole space, `times_cont_diff π n f` can be expressed in terms of the properties of `iterated_fderiv π m f` for `m β€ n`.

We also prove that the usual operations (addition, multiplication, difference, composition, and so on) preserve `C^n` functions.

## Implementation notes #

The definitions in this file are designed to work on any field `π`. They are sometimes slightly more complicated than the naive definitions one would guess from the intuition over the real or complex numbers, but they are designed to circumvent the lack of gluing properties and partitions of unity in general. In the usual situations, they coincide with the usual definitions.

### Definition of `C^n` functions in domains #

One could define `C^n` functions in a domain `s` by fixing an arbitrary choice of derivatives (this is what we do with `iterated_fderiv_within`) and requiring that all these derivatives up to `n` are continuous. If the derivative is not unique, this could lead to strange behavior like two `C^n` functions `f` and `g` on `s` whose sum is not `C^n`. A better definition is thus to say that a function is `C^n` inside `s` if it admits a sequence of derivatives up to `n` inside `s`.

This definition still has the problem that a function which is locally `C^n` would not need to be `C^n`, as different choices of sequences of derivatives around different points might possibly not be glued together to give a globally defined sequence of derivatives. (Note that this issue can not happen over reals, thanks to partition of unity, but the behavior over a general field is not so clear, and we want a definition for general fields). Also, there are locality problems for the order parameter: one could image a function which, for each `n`, has a nice sequence of derivatives up to order `n`, but they do not coincide for varying `n` and can therefore not be glued to give rise to an infinite sequence of derivatives. This would give a function which is `C^n` for all `n`, but not `C^β`. We solve this issue by putting locality conditions in space and order in our definition of `times_cont_diff_within_at` and `times_cont_diff_on`. The resulting definition is slightly more complicated to work with (in fact not so much), but it gives rise to completely satisfactory theorems.

For instance, with this definition, a real function which is `C^m` (but not better) on `(-1/m, 1/m)` for each natural `m` is by definition `C^β` at `0`.

There is another issue with the definition of `times_cont_diff_within_at π n f s x`. We can require the existence and good behavior of derivatives up to order `n` on a neighborhood of `x` within `s`. However, this does not imply continuity or differentiability within `s` of the function at `x` when `x` does not belong to `s`. Therefore, we require such existence and good behavior on a neighborhood of `x` within `s βͺ {x}` (which appears as `insert x s` in this file).

### Side of the composition, and universe issues #

With a naΓ―ve direct definition, the `n`-th derivative of a function belongs to the space `E βL[π] (E βL[π] (E ... F)...)))` where there are n iterations of `E βL[π]`. This space may also be seen as the space of continuous multilinear functions on `n` copies of `E` with values in `F`, by uncurrying. This is the point of view that is usually adopted in textbooks, and that we also use. This means that the definition and the first proofs are slightly involved, as one has to keep track of the uncurrying operation. The uncurrying can be done from the left or from the right, amounting to defining the `n+1`-th derivative either as the derivative of the `n`-th derivative, or as the `n`-th derivative of the derivative. For proofs, it would be more convenient to use the latter approach (from the right), as it means to prove things at the `n+1`-th step we only need to understand well enough the derivative in `E βL[π] F` (contrary to the approach from the left, where one would need to know enough on the `n`-th derivative to deduce things on the `n+1`-th derivative).

However, the definition from the right leads to a universe polymorphism problem: if we define `iterated_fderiv π (n + 1) f x = iterated_fderiv π n (fderiv π f) x` by induction, we need to generalize over all spaces (as `f` and `fderiv π f` don't take values in the same space). It is only possible to generalize over all spaces in some fixed universe in an inductive definition. For `f : E β F`, then `fderiv π f` is a map `E β (E βL[π] F)`. Therefore, the definition will only work if `F` and `E βL[π] F` are in the same universe.

This issue does not appear with the definition from the left, where one does not need to generalize over all spaces. Therefore, we use the definition from the left. This means some proofs later on become a little bit more complicated: to prove that a function is `C^n`, the most efficient approach is to exhibit a formula for its `n`-th derivative and prove it is continuous (contrary to the inductive approach where one would prove smoothness statements without giving a formula for the derivative). In the end, this approach is still satisfactory as it is good to have formulas for the iterated derivatives in various constructions.

One point where we depart from this explicit approach is in the proof of smoothness of a composition: there is a formula for the `n`-th derivative of a composition (FaΓ  di Bruno's formula), but it is very complicated and barely usable, while the inductive proof is very simple. Thus, we give the inductive proof. As explained above, it works by generalizing over the target space, hence it only works well if all spaces belong to the same universe. To get the general version, we lift things to a common universe using a trick.

### Variables management #

The textbook definitions and proofs use various identifications and abuse of notations, for instance when saying that the natural space in which the derivative lives, i.e., `E βL[π] (E βL[π] ( ... βL[π] F))`, is the same as a space of multilinear maps. When doing things formally, we need to provide explicit maps for these identifications, and chase some diagrams to see everything is compatible with the identifications. In particular, one needs to check that taking the derivative and then doing the identification, or first doing the identification and then taking the derivative, gives the same result. The key point for this is that taking the derivative commutes with continuous linear equivalences. Therefore, we need to implement all our identifications with continuous linear equivs.

## Notations #

We use the notation `E [Γn]βL[π] F` for the space of continuous multilinear maps on `E^n` with values in `F`. This is the space in which the `n`-th derivative of a function from `E` to `F` lives.

In this file, we denote `β€ : with_top β` with `β`.

## Tags #

derivative, differentiability, higher derivative, `C^n`, multilinear, Taylor series, formal series

### Functions with a Taylor series on a domain #

structure has_ftaylor_series_up_to_on {π : Type u_1} [nondiscrete_normed_field π] {E : Type u_2} [normed_group E] [normed_space π E] {F : Type u_3} [normed_group F] [normed_space π F] (n : with_top β) (f : E β F) (p : E β F) (s : set E) :
Prop

`has_ftaylor_series_up_to_on n f p s` registers the fact that `p 0 = f` and `p (m+1)` is a derivative of `p m` for `m < n`, and is continuous for `m β€ n`. This is a predicate analogous to `has_fderiv_within_at` but for higher order derivatives.

theorem has_ftaylor_series_up_to_on.zero_eq' {π : Type u_1} [nondiscrete_normed_field π] {E : Type u_2} [normed_group E] [normed_space π E] {F : Type u_3} [normed_group F] [normed_space π F] {s : set E} {f : E β F} {p : E β F} {n : with_top β} (h : s) {x : E} (hx : x β s) :
p x 0 = β F).symm) (f x)
theorem has_ftaylor_series_up_to_on.congr {π : Type u_1} [nondiscrete_normed_field π] {E : Type u_2} [normed_group E] [normed_space π E] {F : Type u_3} [normed_group F] [normed_space π F] {s : set E} {f fβ : E β F} {p : E β F} {n : with_top β} (h : s) (hβ : β (x : E), x β s β fβ x = f x) :
p s

If two functions coincide on a set `s`, then a Taylor series for the first one is as well a Taylor series for the second one.

theorem has_ftaylor_series_up_to_on.mono {π : Type u_1} [nondiscrete_normed_field π] {E : Type u_2} [normed_group E] [normed_space π E] {F : Type u_3} [normed_group F] [normed_space π F] {s : set E} {f : E β F} {p : E β F} {n : with_top β} (h : s) {t : set E} (hst : t β s) :
t
theorem has_ftaylor_series_up_to_on.of_le {π : Type u_1} [nondiscrete_normed_field π] {E : Type u_2} [normed_group E] [normed_space π E] {F : Type u_3} [normed_group F] [normed_space π F] {s : set E} {f : E β F} {p : E β F} {m n : with_top β} (h : s) (hmn : m β€ n) :
s
theorem has_ftaylor_series_up_to_on.continuous_on {π : Type u_1} [nondiscrete_normed_field π] {E : Type u_2} [normed_group E] [normed_space π E] {F : Type u_3} [normed_group F] [normed_space π F] {s : set E} {f : E β F} {p : E β F} {n : with_top β} (h : s) :
theorem has_ftaylor_series_up_to_on_zero_iff {π : Type u_1} [nondiscrete_normed_field π] {E : Type u_2} [normed_group E] [normed_space π E] {F : Type u_3} [normed_group F] [normed_space π F] {s : set E} {f : E β F} {p : E β F} :
s β β§ β (x : E), x β s β (p x 0).uncurry0 = f x
theorem has_ftaylor_series_up_to_on_top_iff {π : Type u_1} [nondiscrete_normed_field π] {E : Type u_2} [normed_group E] [normed_space π E] {F : Type u_3} [normed_group F] [normed_space π F] {s : set E} {f : E β F} {p : E β F} :
β β (n : β),
theorem has_ftaylor_series_up_to_on.has_fderiv_within_at {π : Type u_1} [nondiscrete_normed_field π] {E : Type u_2} [normed_group E] [normed_space π E] {F : Type u_3} [normed_group F] [normed_space π F] {s : set E} {f : E β F} {x : E} {p : E β F} {n : with_top β} (h : s) (hn : 1 β€ n) (hx : x β s) :
(β F) (p x 1)) s x

If a function has a Taylor series at order at least `1`, then the term of order `1` of this series is a derivative of `f`.

theorem has_ftaylor_series_up_to_on.differentiable_on {π : Type u_1} [nondiscrete_normed_field π] {E : Type u_2} [normed_group E] [normed_space π E] {F : Type u_3} [normed_group F] [normed_space π F] {s : set E} {f : E β F} {p : E β F} {n : with_top β} (h : s) (hn : 1 β€ n) :
f s
theorem has_ftaylor_series_up_to_on.has_fderiv_at {π : Type u_1} [nondiscrete_normed_field π] {E : Type u_2} [normed_group E] [normed_space π E] {F : Type u_3} [normed_group F] [normed_space π F] {s : set E} {f : E β F} {x : E} {p : E β F} {n : with_top β} (h : s) (hn : 1 β€ n) (hx : s β π x) :
(β F) (p x 1)) x

If a function has a Taylor series at order at least `1` on a neighborhood of `x`, then the term of order `1` of this series is a derivative of `f` at `x`.

theorem has_ftaylor_series_up_to_on.eventually_has_fderiv_at {π : Type u_1} [nondiscrete_normed_field π] {E : Type u_2} [normed_group E] [normed_space π E] {F : Type u_3} [normed_group F] [normed_space π F] {s : set E} {f : E β F} {x : E} {p : E β F} {n : with_top β} (h : s) (hn : 1 β€ n) (hx : s β π x) :
βαΆ  (y : E) in π x, (β F) (p y 1)) y

If a function has a Taylor series at order at least `1` on a neighborhood of `x`, then in a neighborhood of `x`, the term of order `1` of this series is a derivative of `f`.

theorem has_ftaylor_series_up_to_on.differentiable_at {π : Type u_1} [nondiscrete_normed_field π] {E : Type u_2} [normed_group E] [normed_space π E] {F : Type u_3} [normed_group F] [normed_space π F] {s : set E} {f : E β F} {x : E} {p : E β F} {n : with_top β} (h : s) (hn : 1 β€ n) (hx : s β π x) :
f x

If a function has a Taylor series at order at least `1` on a neighborhood of `x`, then it is differentiable at `x`.

theorem has_ftaylor_series_up_to_on_succ_iff_left {π : Type u_1} [nondiscrete_normed_field π] {E : Type u_2} [normed_group E] [normed_space π E] {F : Type u_3} [normed_group F] [normed_space π F] {s : set E} {f : E β F} {p : E β F} {n : β} :
f p s β β§ (β (x : E), x β s β has_fderiv_within_at (Ξ» (y : E), p y n) (p x n.succ).curry_left s x) β§ continuous_on (Ξ» (x : E), p x (n + 1)) s

`p` is a Taylor series of `f` up to `n+1` if and only if `p` is a Taylor series up to `n`, and `p (n + 1)` is a derivative of `p n`.

theorem has_ftaylor_series_up_to_on_succ_iff_right {π : Type u_1} [nondiscrete_normed_field π] {E : Type u_2} [normed_group E] [normed_space π E] {F : Type u_3} [normed_group F] [normed_space π F] {s : set E} {f : E β F} {p : E β F} {n : β} :
f p s β (β (x : E), x β s β (p x 0).uncurry0 = f x) β§ (β (x : E), x β s β has_fderiv_within_at (Ξ» (y : E), p y 0) (p x 1).curry_left s x) β§ (Ξ» (x : E), β F) (p x 1)) (Ξ» (x : E), (p x).shift) s

`p` is a Taylor series of `f` up to `n+1` if and only if `p.shift` is a Taylor series up to `n` for `p 1`, which is a derivative of `f`.

### Smooth functions within a set around a point #

def times_cont_diff_within_at (π : Type u_1) [nondiscrete_normed_field π] {E : Type u_2} [normed_group E] [normed_space π E] {F : Type u_3} [normed_group F] [normed_space π F] (n : with_top β) (f : E β F) (s : set E) (x : E) :
Prop

A function is continuously differentiable up to order `n` within a set `s` at a point `x` if it admits continuous derivatives up to order `n` in a neighborhood of `x` in `s βͺ {x}`. For `n = β`, we only require that this holds up to any finite order (where the neighborhood may depend on the finite order we consider).

For instance, a real function which is `C^m` on `(-1/m, 1/m)` for each natural `m`, but not better, is `C^β` at `0` within `univ`.

Equations
theorem times_cont_diff_within_at_nat {π : Type u_1} [nondiscrete_normed_field π] {E : Type u_2} [normed_group E] [normed_space π E] {F : Type u_3} [normed_group F] [normed_space π F] {s : set E} {f : E β F} {x : E} {n : β} :
f s x β β (u : set E) (H : u β π[ s] x) (p : E β F),
theorem times_cont_diff_within_at.of_le {π : Type u_1} [nondiscrete_normed_field π] {E : Type u_2} [normed_group E] [normed_space π E] {F : Type u_3} [normed_group F] [normed_space π F] {s : set E} {f : E β F} {x : E} {m n : with_top β} (h : f s x) (hmn : m β€ n) :
f s x
theorem times_cont_diff_within_at_iff_forall_nat_le {π : Type u_1} [nondiscrete_normed_field π] {E : Type u_2} [normed_group E] [normed_space π E] {F : Type u_3} [normed_group F] [normed_space π F] {s : set E} {f : E β F} {x : E} {n : with_top β} :
f s x β β (m : β), βm β€ n β f s x
theorem times_cont_diff_within_at_top {π : Type u_1} [nondiscrete_normed_field π] {E : Type u_2} [normed_group E] [normed_space π E] {F : Type u_3} [normed_group F] [normed_space π F] {s : set E} {f : E β F} {x : E} :
f s x β β (n : β), f s x
theorem times_cont_diff_within_at.continuous_within_at {π : Type u_1} [nondiscrete_normed_field π] {E : Type u_2} [normed_group E] [normed_space π E] {F : Type u_3} [normed_group F] [normed_space π F] {s : set E} {f : E β F} {x : E} {n : with_top β} (h : f s x) :
x
theorem times_cont_diff_within_at.congr_of_eventually_eq {π : Type u_1} [nondiscrete_normed_field π] {E : Type u_2} [normed_group E] [normed_space π E] {F : Type u_3} [normed_group F] [normed_space π F] {s : set E} {f fβ : E β F} {x : E} {n : with_top β} (h : f s x) (hβ : fβ =αΆ [π[s] x] f) (hx : fβ x = f x) :
fβ s x
theorem times_cont_diff_within_at.congr_of_eventually_eq' {π : Type u_1} [nondiscrete_normed_field π] {E : Type u_2} [normed_group E] [normed_space π E] {F : Type u_3} [normed_group F] [normed_space π F] {s : set E} {f fβ : E β F} {x : E} {n : with_top β} (h : f s x) (hβ : fβ =αΆ [π[s] x] f) (hx : x β s) :
fβ s x
theorem filter.eventually_eq.times_cont_diff_within_at_iff {π : Type u_1} [nondiscrete_normed_field π] {E : Type u_2} [normed_group E] [normed_space π E] {F : Type u_3} [normed_group F] [normed_space π F] {s : set E} {f fβ : E β F} {x : E} {n : with_top β} (hβ : fβ =αΆ [π[s] x] f) (hx : fβ x = f x) :
fβ s x β f s x
theorem times_cont_diff_within_at.congr {π : Type u_1} [nondiscrete_normed_field π] {E : Type u_2} [normed_group E] [normed_space π E] {F : Type u_3} [normed_group F] [normed_space π F] {s : set E} {f fβ : E β F} {x : E} {n : with_top β} (h : f s x) (hβ : β (y : E), y β s β fβ y = f y) (hx : fβ x = f x) :
fβ s x
theorem times_cont_diff_within_at.congr' {π : Type u_1} [nondiscrete_normed_field π] {E : Type u_2} [normed_group E] [normed_space π E] {F : Type u_3} [normed_group F] [normed_space π F] {s : set E} {f fβ : E β F} {x : E} {n : with_top β} (h : f s x) (hβ : β (y : E), y β s β fβ y = f y) (hx : x β s) :
fβ s x
theorem times_cont_diff_within_at.mono_of_mem {π : Type u_1} [nondiscrete_normed_field π] {E : Type u_2} [normed_group E] [normed_space π E] {F : Type u_3} [normed_group F] [normed_space π F] {s : set E} {f : E β F} {x : E} {n : with_top β} (h : f s x) {t : set E} (hst : s β π[t] x) :
f t x
theorem times_cont_diff_within_at.mono {π : Type u_1} [nondiscrete_normed_field π] {E : Type u_2} [normed_group E] [normed_space π E] {F : Type u_3} [normed_group F] [normed_space π F] {s : set E} {f : E β F} {x : E} {n : with_top β} (h : f s x) {t : set E} (hst : t β s) :
f t x
theorem times_cont_diff_within_at.congr_nhds {π : Type u_1} [nondiscrete_normed_field π] {E : Type u_2} [normed_group E] [normed_space π E] {F : Type u_3} [normed_group F] [normed_space π F] {s : set E} {f : E β F} {x : E} {n : with_top β} (h : f s x) {t : set E} (hst : π[s] x = π[t] x) :
f t x
theorem times_cont_diff_within_at_congr_nhds {π : Type u_1} [nondiscrete_normed_field π] {E : Type u_2} [normed_group E] [normed_space π E] {F : Type u_3} [normed_group F] [normed_space π F] {s : set E} {f : E β F} {x : E} {n : with_top β} {t : set E} (hst : π[s] x = π[t] x) :
f s x β f t x
theorem times_cont_diff_within_at_inter' {π : Type u_1} [nondiscrete_normed_field π] {E : Type u_2} [normed_group E] [normed_space π E] {F : Type u_3} [normed_group F] [normed_space π F] {s t : set E} {f : E β F} {x : E} {n : with_top β} (h : t β π[s] x) :
f (s β© t) x β f s x
theorem times_cont_diff_within_at_inter {π : Type u_1} [nondiscrete_normed_field π] {E : Type u_2} [normed_group E] [normed_space π E] {F : Type u_3} [normed_group F] [normed_space π F] {s t : set E} {f : E β F} {x : E} {n : with_top β} (h : t β π x) :
f (s β© t) x β f s x
theorem times_cont_diff_within_at.differentiable_within_at' {π : Type u_1} [nondiscrete_normed_field π] {E : Type u_2} [normed_group E] [normed_space π E] {F : Type u_3} [normed_group F] [normed_space π F] {s : set E} {f : E β F} {x : E} {n : with_top β} (h : f s x) (hn : 1 β€ n) :
f (insert x s) x

If a function is `C^n` within a set at a point, with `n β₯ 1`, then it is differentiable within this set at this point.

theorem times_cont_diff_within_at.differentiable_within_at {π : Type u_1} [nondiscrete_normed_field π] {E : Type u_2} [normed_group E] [normed_space π E] {F : Type u_3} [normed_group F] [normed_space π F] {s : set E} {f : E β F} {x : E} {n : with_top β} (h : f s x) (hn : 1 β€ n) :
f s x
theorem times_cont_diff_within_at_succ_iff_has_fderiv_within_at {π : Type u_1} [nondiscrete_normed_field π] {E : Type u_2} [normed_group E] [normed_space π E] {F : Type u_3} [normed_group F] [normed_space π F] {s : set E} {f : E β F} {x : E} {n : β} :
β(n + 1) f s x β β (u : set E) (H : u β π[ s] x) (f' : E β (E βL[π] F)), (β (x : E), x β u β (f' x) u x) β§ f' u x

A function is `C^(n + 1)` on a domain iff locally, it has a derivative which is `C^n`.

### Smooth functions within a set #

def times_cont_diff_on (π : Type u_1) [nondiscrete_normed_field π] {E : Type u_2} [normed_group E] [normed_space π E] {F : Type u_3} [normed_group F] [normed_space π F] (n : with_top β) (f : E β F) (s : set E) :
Prop

A function is continuously differentiable up to `n` on `s` if, for any point `x` in `s`, it admits continuous derivatives up to order `n` on a neighborhood of `x` in `s`.

For `n = β`, we only require that this holds up to any finite order (where the neighborhood may depend on the finite order we consider).

Equations
• n f s = β (x : E), x β s β f s x
theorem times_cont_diff_on.times_cont_diff_within_at {π : Type u_1} [nondiscrete_normed_field π] {E : Type u_2} [normed_group E] [normed_space π E] {F : Type u_3} [normed_group F] [normed_space π F] {s : set E} {f : E β F} {x : E} {n : with_top β} (h : n f s) (hx : x β s) :
f s x
theorem times_cont_diff_within_at.times_cont_diff_on {π : Type u_1} [nondiscrete_normed_field π] {E : Type u_2} [normed_group E] [normed_space π E] {F : Type u_3} [normed_group F] [normed_space π F] {s : set E} {f : E β F} {x : E} {n : with_top β} {m : β} (hm : βm β€ n) (h : f s x) :
β (u : set E) (H : u β π[ s] x), u β s β§ βm f u
theorem times_cont_diff_on.of_le {π : Type u_1} [nondiscrete_normed_field π] {E : Type u_2} [normed_group E] [normed_space π E] {F : Type u_3} [normed_group F] [normed_space π F] {s : set E} {f : E β F} {m n : with_top β} (h : n f s) (hmn : m β€ n) :
m f s
theorem times_cont_diff_on_iff_forall_nat_le {π : Type u_1} [nondiscrete_normed_field π] {E : Type u_2} [normed_group E] [normed_space π E] {F : Type u_3} [normed_group F] [normed_space π F] {s : set E} {f : E β F} {n : with_top β} :
n f s β β (m : β), βm β€ n β βm f s
theorem times_cont_diff_on_top {π : Type u_1} [nondiscrete_normed_field π] {E : Type u_2} [normed_group E] [normed_space π E] {F : Type u_3} [normed_group F] [normed_space π F] {s : set E} {f : E β F} :
f s β β (n : β), βn f s
theorem times_cont_diff_on_all_iff_nat {π : Type u_1} [nondiscrete_normed_field π] {E : Type u_2} [normed_group E] [normed_space π E] {F : Type u_3} [normed_group F] [normed_space π F] {s : set E} {f : E β F} :
(β (n : , n f s) β β (n : β), βn f s
theorem times_cont_diff_on.continuous_on {π : Type u_1} [nondiscrete_normed_field π] {E : Type u_2} [normed_group E] [normed_space π E] {F : Type u_3} [normed_group F] [normed_space π F] {s : set E} {f : E β F} {n : with_top β} (h : n f s) :
theorem times_cont_diff_on.congr {π : Type u_1} [nondiscrete_normed_field π] {E : Type u_2} [normed_group E] [normed_space π E] {F : Type u_3} [normed_group F] [normed_space π F] {s : set E} {f fβ : E β F} {n : with_top β} (h : n f s) (hβ : β (x : E), x β s β fβ x = f x) :
n fβ s
theorem times_cont_diff_on_congr {π : Type u_1} [nondiscrete_normed_field π] {E : Type u_2} [normed_group E] [normed_space π E] {F : Type u_3} [normed_group F] [normed_space π F] {s : set E} {f fβ : E β F} {n : with_top β} (hβ : β (x : E), x β s β fβ x = f x) :
n fβ s β n f s
theorem times_cont_diff_on.mono {π : Type u_1} [nondiscrete_normed_field π] {E : Type u_2} [normed_group E] [normed_space π E] {F : Type u_3} [normed_group F] [normed_space π F] {s : set E} {f : E β F} {n : with_top β} (h : n f s) {t : set E} (hst : t β s) :
n f t
theorem times_cont_diff_on.congr_mono {π : Type u_1} [nondiscrete_normed_field π] {E : Type u_2} [normed_group E] [normed_space π E] {F : Type u_3} [normed_group F] [normed_space π F] {s sβ : set E} {f fβ : E β F} {n : with_top β} (hf : n f s) (hβ : β (x : E), x β sβ β fβ x = f x) (hs : sβ β s) :
n fβ sβ
theorem times_cont_diff_on.differentiable_on {π : Type u_1} [nondiscrete_normed_field π] {E : Type u_2} [normed_group E] [normed_space π E] {F : Type u_3} [normed_group F] [normed_space π F] {s : set E} {f : E β F} {n : with_top β} (h : n f s) (hn : 1 β€ n) :
f s

If a function is `C^n` on a set with `n β₯ 1`, then it is differentiable there.

theorem times_cont_diff_on_of_locally_times_cont_diff_on {π : Type u_1} [nondiscrete_normed_field π] {E : Type u_2} [normed_group E] [normed_space π E] {F : Type u_3} [normed_group F] [normed_space π F] {s : set E} {f : E β F} {n : with_top β} (h : β (x : E), x β s β (β (u : set E), β§ x β u β§ n f (s β© u))) :
n f s

If a function is `C^n` around each point in a set, then it is `C^n` on the set.

theorem times_cont_diff_on_succ_iff_has_fderiv_within_at {π : Type u_1} [nondiscrete_normed_field π] {E : Type u_2} [normed_group E] [normed_space π E] {F : Type u_3} [normed_group F] [normed_space π F] {s : set E} {f : E β F} {n : β} :
β(n + 1) f s β β (x : E), x β s β (β (u : set E) (H : u β π[ s] x) (f' : E β (E βL[π] F)), (β (x : E), x β u β (f' x) u x) β§ βn f' u)

A function is `C^(n + 1)` on a domain iff locally, it has a derivative which is `C^n`.

### Iterated derivative within a set #

def iterated_fderiv_within (π : Type u_1) [nondiscrete_normed_field π] {E : Type u_2} [normed_group E] [normed_space π E] {F : Type u_3} [normed_group F] [normed_space π F] (n : β) (f : E β F) (s : set E) :
E β (Ξ» (i : fin n), E) F

The `n`-th derivative of a function along a set, defined inductively by saying that the `n+1`-th derivative of `f` is the derivative of the `n`-th derivative of `f` along this set, together with an uncurrying step to see it as a multilinear map in `n+1` variables..

Equations
def ftaylor_series_within (π : Type u_1) [nondiscrete_normed_field π] {E : Type u_2} [normed_group E] [normed_space π E] {F : Type u_3} [normed_group F] [normed_space π F] (f : E β F) (s : set E) (x : E) :
F

Formal Taylor series associated to a function within a set.

Equations
• f s x = Ξ» (n : β), n f s x
@[simp]
theorem iterated_fderiv_within_zero_apply {π : Type u_1} [nondiscrete_normed_field π] {E : Type u_2} [normed_group E] [normed_space π E] {F : Type u_3} [normed_group F] [normed_space π F] {s : set E} {f : E β F} {x : E} (m : fin 0 β E) :
β 0 f s x) m = f x
theorem iterated_fderiv_within_zero_eq_comp {π : Type u_1} [nondiscrete_normed_field π] {E : Type u_2} [normed_group E] [normed_space π E] {F : Type u_3} [normed_group F] [normed_space π F] {s : set E} {f : E β F} :
0 f s = β F).symm) β f
theorem iterated_fderiv_within_succ_apply_left {π : Type u_1} [nondiscrete_normed_field π] {E : Type u_2} [normed_group E] [normed_space π E] {F : Type u_3} [normed_group F] [normed_space π F] {s : set E} {f : E β F} {x : E} {n : β} (m : fin (n + 1) β E) :
β (n + 1) f s x) m = β(β(fderiv_within π n f s) s x) (m 0)) (fin.tail m)
theorem iterated_fderiv_within_succ_eq_comp_left {π : Type u_1} [nondiscrete_normed_field π] {E : Type u_2} [normed_group E] [normed_space π E] {F : Type u_3} [normed_group F] [normed_space π F] {s : set E} {f : E β F} {n : β} :
(n + 1) f s = β (Ξ» (i : fin (n + 1)), E) F) β fderiv_within π n f s) s

Writing explicitly the `n+1`-th derivative as the composition of a currying linear equiv, and the derivative of the `n`-th derivative.

theorem iterated_fderiv_within_succ_apply_right {π : Type u_1} [nondiscrete_normed_field π] {E : Type u_2} [normed_group E] [normed_space π E] {F : Type u_3} [normed_group F] [normed_space π F] {s : set E} {f : E β F} {x : E} {n : β} (hs : unique_diff_on π s) (hx : x β s) (m : fin (n + 1) β E) :
β (n + 1) f s x) m = β(β n (Ξ» (y : E), fderiv_within π f s y) s x) (fin.init m)) (m (fin.last n))
theorem iterated_fderiv_within_succ_eq_comp_right {π : Type u_1} [nondiscrete_normed_field π] {E : Type u_2} [normed_group E] [normed_space π E] {F : Type u_3} [normed_group F] [normed_space π F] {s : set E} {f : E β F} {x : E} {n : β} (hs : unique_diff_on π s) (hx : x β s) :
(n + 1) f s x = (β F) β n (Ξ» (y : E), fderiv_within π f s y) s) x

Writing explicitly the `n+1`-th derivative as the composition of a currying linear equiv, and the `n`-th derivative of the derivative.

@[simp]
theorem iterated_fderiv_within_one_apply {π : Type u_1} [nondiscrete_normed_field π] {E : Type u_2} [normed_group E] [normed_space π E] {F : Type u_3} [normed_group F] [normed_space π F] {s : set E} {f : E β F} {x : E} (hs : unique_diff_on π s) (hx : x β s) (m : fin 1 β E) :
β 1 f s x) m = β(fderiv_within π f s x) (m 0)
theorem iterated_fderiv_within_congr {π : Type u_1} [nondiscrete_normed_field π] {E : Type u_2} [normed_group E] [normed_space π E] {F : Type u_3} [normed_group F] [normed_space π F] {s : set E} {f fβ : E β F} {x : E} {n : β} (hs : unique_diff_on π s) (hL : β (y : E), y β s β fβ y = f y) (hx : x β s) :
n fβ s x = n f s x

If two functions coincide on a set `s` of unique differentiability, then their iterated differentials within this set coincide.

theorem iterated_fderiv_within_inter_open {π : Type u_1} [nondiscrete_normed_field π] {E : Type u_2} [normed_group E] [normed_space π E] {F : Type u_3} [normed_group F] [normed_space π F] {s u : set E} {f : E β F} {x : E} {n : β} (hu : is_open u) (hs : unique_diff_on π (s β© u)) (hx : x β s β© u) :
n f (s β© u) x = n f s x

The iterated differential within a set `s` at a point `x` is not modified if one intersects `s` with an open set containing `x`.

theorem iterated_fderiv_within_inter' {π : Type u_1} [nondiscrete_normed_field π] {E : Type u_2} [normed_group E] [normed_space π E] {F : Type u_3} [normed_group F] [normed_space π F] {s u : set E} {f : E β F} {x : E} {n : β} (hu : u β π[s] x) (hs : unique_diff_on π s) (xs : x β s) :
n f (s β© u) x = n f s x

The iterated differential within a set `s` at a point `x` is not modified if one intersects `s` with a neighborhood of `x` within `s`.

theorem iterated_fderiv_within_inter {π : Type u_1} [nondiscrete_normed_field π] {E : Type u_2} [normed_group E] [normed_space π E] {F : Type u_3} [normed_group F] [normed_space π F] {s u : set E} {f : E β F} {x : E} {n : β} (hu : u β π x) (hs : unique_diff_on π s) (xs : x β s) :
n f (s β© u) x = n f s x

The iterated differential within a set `s` at a point `x` is not modified if one intersects `s` with a neighborhood of `x`.

@[simp]
theorem times_cont_diff_on_zero {π : Type u_1} [nondiscrete_normed_field π] {E : Type u_2} [normed_group E] [normed_space π E] {F : Type u_3} [normed_group F] [normed_space π F] {s : set E} {f : E β F} :
0 f s β
theorem times_cont_diff_within_at_zero {π : Type u_1} [nondiscrete_normed_field π] {E : Type u_2} [normed_group E] [normed_space π E] {F : Type u_3} [normed_group F] [normed_space π F] {s : set E} {f : E β F} {x : E} (hx : x β s) :
f s x β β (u : set E) (H : u β π[s] x), (s β© u)
theorem has_ftaylor_series_up_to_on.eq_ftaylor_series_of_unique_diff_on {π : Type u_1} [nondiscrete_normed_field π] {E : Type u_2} [normed_group E] [normed_space π E] {F : Type u_3} [normed_group F] [normed_space π F] {s : set E} {f : E β F} {x : E} {p : E β F} {n : with_top β} (h : s) {m : β} (hmn : βm β€ n) (hs : unique_diff_on π s) (hx : x β s) :
p x m = m f s x

On a set with unique differentiability, any choice of iterated differential has to coincide with the one we have chosen in `iterated_fderiv_within π m f s`.

theorem times_cont_diff_on.ftaylor_series_within {π : Type u_1} [nondiscrete_normed_field π] {E : Type u_2} [normed_group E] [normed_space π E] {F : Type u_3} [normed_group F] [normed_space π F] {s : set E} {f : E β F} {n : with_top β} (h : n f s) (hs : unique_diff_on π s) :
f s) s

When a function is `C^n` in a set `s` of unique differentiability, it admits `ftaylor_series_within π f s` as a Taylor series up to order `n` in `s`.

theorem times_cont_diff_on_of_continuous_on_differentiable_on {π : Type u_1} [nondiscrete_normed_field π] {E : Type u_2} [normed_group E] [normed_space π E] {F : Type u_3} [normed_group F] [normed_space π F] {s : set E} {f : E β F} {n : with_top β} (Hcont : β (m : β), βm β€ n β continuous_on (Ξ» (x : E), m f s x) s) (Hdiff : β (m : β), βm < n β (Ξ» (x : E), m f s x) s) :
n f s
theorem times_cont_diff_on_of_differentiable_on {π : Type u_1} [nondiscrete_normed_field π] {E : Type u_2} [normed_group E] [normed_space π E] {F : Type u_3} [normed_group F] [normed_space π F] {s : set E} {f : E β F} {n : with_top β} (h : β (m : β), βm β€ n β m f s) s) :
n f s
theorem times_cont_diff_on.continuous_on_iterated_fderiv_within {π : Type u_1} [nondiscrete_normed_field π] {E : Type u_2} [normed_group E] [normed_space π E] {F : Type u_3} [normed_group F] [normed_space π F] {s : set E} {f : E β F} {n : with_top β} {m : β} (h : n f s) (hmn : βm β€ n) (hs : unique_diff_on π s) :
continuous_on m f s) s
theorem times_cont_diff_on.differentiable_on_iterated_fderiv_within {π : Type u_1} [nondiscrete_normed_field π] {E : Type u_2} [normed_group E] [normed_space π E] {F : Type u_3} [normed_group F] [normed_space π F] {s : set E} {f : E β F} {n : with_top β} {m : β} (h : n f s) (hmn : βm < n) (hs : unique_diff_on π s) :
m f s) s
theorem times_cont_diff_on_iff_continuous_on_differentiable_on {π : Type u_1} [nondiscrete_normed_field π] {E : Type u_2} [normed_group E] [normed_space π E] {F : Type u_3} [normed_group F] [normed_space π F] {s : set E} {f : E β F} {n : with_top β} (hs : unique_diff_on π s) :
n f s β (β (m : β), βm β€ n β continuous_on (Ξ» (x : E), m f s x) s) β§ β (m : β), βm < n β (Ξ» (x : E), m f s x) s
theorem times_cont_diff_on_succ_iff_fderiv_within {π : Type u_1} [nondiscrete_normed_field π] {E : Type u_2} [normed_group E] [normed_space π E] {F : Type u_3} [normed_group F] [normed_space π F] {s : set E} {f : E β F} {n : β} (hs : unique_diff_on π s) :
β(n + 1) f s β f s β§ βn (Ξ» (y : E), fderiv_within π f s y) s

A function is `C^(n + 1)` on a domain with unique derivatives if and only if it is differentiable there, and its derivative (expressed with `fderiv_within`) is `C^n`.

theorem times_cont_diff_on_succ_iff_fderiv_of_open {π : Type u_1} [nondiscrete_normed_field π] {E : Type u_2} [normed_group E] [normed_space π E] {F : Type u_3} [normed_group F] [normed_space π F] {s : set E} {f : E β F} {n : β} (hs : is_open s) :
β(n + 1) f s β f s β§ βn (Ξ» (y : E), fderiv π f y) s

A function is `C^(n + 1)` on an open domain if and only if it is differentiable there, and its derivative (expressed with `fderiv`) is `C^n`.

theorem times_cont_diff_on_top_iff_fderiv_within {π : Type u_1} [nondiscrete_normed_field π] {E : Type u_2} [normed_group E] [normed_space π E] {F : Type u_3} [normed_group F] [normed_space π F] {s : set E} {f : E β F} (hs : unique_diff_on π s) :
f s β f s β§ (Ξ» (y : E), fderiv_within π f s y) s

A function is `C^β` on a domain with unique derivatives if and only if it is differentiable there, and its derivative (expressed with `fderiv_within`) is `C^β`.

theorem times_cont_diff_on_top_iff_fderiv_of_open {π : Type u_1} [nondiscrete_normed_field π] {E : Type u_2} [normed_group E] [normed_space π E] {F : Type u_3} [normed_group F] [normed_space π F] {s : set E} {f : E β F} (hs : is_open s) :
f s β f s β§ (Ξ» (y : E), fderiv π f y) s

A function is `C^β` on an open domain if and only if it is differentiable there, and its derivative (expressed with `fderiv`) is `C^β`.

theorem times_cont_diff_on.fderiv_within {π : Type u_1} [nondiscrete_normed_field π] {E : Type u_2} [normed_group E] [normed_space π E] {F : Type u_3} [normed_group F] [normed_space π F] {s : set E} {f : E β F} {m n : with_top β} (hf : n f s) (hs : unique_diff_on π s) (hmn : m + 1 β€ n) :
m (Ξ» (y : E), fderiv_within π f s y) s
theorem times_cont_diff_on.fderiv_of_open {π : Type u_1} [nondiscrete_normed_field π] {E : Type u_2} [normed_group E] [normed_space π E] {F : Type u_3} [normed_group F] [normed_space π F] {s : set E} {f : E β F} {m n : with_top β} (hf : n f s) (hs : is_open s) (hmn : m + 1 β€ n) :
m (Ξ» (y : E), fderiv π f y) s
theorem times_cont_diff_on.continuous_on_fderiv_within {π : Type u_1} [nondiscrete_normed_field π] {E : Type u_2} [normed_group E] [normed_space π E] {F : Type u_3} [normed_group F] [normed_space π F] {s : set E} {f : E β F} {n : with_top β} (h : n f s) (hs : unique_diff_on π s) (hn : 1 β€ n) :
continuous_on (Ξ» (x : E), fderiv_within π f s x) s
theorem times_cont_diff_on.continuous_on_fderiv_of_open {π : Type u_1} [nondiscrete_normed_field π] {E : Type u_2} [normed_group E] [normed_space π E] {F : Type u_3} [normed_group F] [normed_space π F] {s : set E} {f : E β F} {n : with_top β} (h : n f s) (hs : is_open s) (hn : 1 β€ n) :
continuous_on (Ξ» (x : E), fderiv π f x) s
theorem times_cont_diff_on.continuous_on_fderiv_within_apply {π : Type u_1} [nondiscrete_normed_field π] {E : Type u_2} [normed_group E] [normed_space π E] {F : Type u_3} [normed_group F] [normed_space π F] {s : set E} {f : E β F} {n : with_top β} (h : n f s) (hs : unique_diff_on π s) (hn : 1 β€ n) :
continuous_on (Ξ» (p : E Γ E), β(fderiv_within π f s p.fst) p.snd) (s.prod set.univ)

If a function is at least `C^1`, its bundled derivative (mapping `(x, v)` to `Df(x) v`) is continuous.

### Functions with a Taylor series on the whole space #

structure has_ftaylor_series_up_to {π : Type u_1} [nondiscrete_normed_field π] {E : Type u_2} [normed_group E] [normed_space π E] {F : Type u_3} [normed_group F] [normed_space π F] (n : with_top β) (f : E β F) (p : E β F) :
Prop

`has_ftaylor_series_up_to n f p` registers the fact that `p 0 = f` and `p (m+1)` is a derivative of `p m` for `m < n`, and is continuous for `m β€ n`. This is a predicate analogous to `has_fderiv_at` but for higher order derivatives.

theorem has_ftaylor_series_up_to.zero_eq' {π : Type u_1} [nondiscrete_normed_field π] {E : Type u_2} [normed_group E] [normed_space π E] {F : Type u_3} [normed_group F] [normed_space π F] {f : E β F} {p : E β F} {n : with_top β} (h : p) (x : E) :
p x 0 = β F).symm) (f x)
theorem has_ftaylor_series_up_to_on_univ_iff {π : Type u_1} [nondiscrete_normed_field π] {E : Type u_2} [normed_group E] [normed_space π E] {F : Type u_3} [normed_group F] [normed_space π F] {f : E β F} {p : E β F} {n : with_top β} :
theorem has_ftaylor_series_up_to.has_ftaylor_series_up_to_on {π : Type u_1} [nondiscrete_normed_field π] {E : Type u_2} [normed_group E] [normed_space π E] {F : Type u_3} [normed_group F] [normed_space π F] {f : E β F} {p : E β F} {n : with_top β} (h : p) (s : set E) :
s
theorem has_ftaylor_series_up_to.of_le {π : Type u_1} [nondiscrete_normed_field π] {E : Type u_2} [normed_group E] [normed_space π E] {F : Type u_3} [normed_group F] [normed_space π F] {f : E β F} {p : E β F} {m n : with_top β} (h : p) (hmn : m β€ n) :
theorem has_ftaylor_series_up_to.continuous {π : Type u_1} [nondiscrete_normed_field π] {E : Type u_2} [normed_group E] [normed_space π E] {F : Type u_3} [normed_group F] [normed_space π F] {f : E β F} {p : E β F} {n : with_top β} (h : p) :
theorem has_ftaylor_series_up_to_zero_iff {π : Type u_1} [nondiscrete_normed_field π] {E : Type u_2} [normed_group E] [normed_space π E] {F : Type u_3} [normed_group F] [normed_space π F] {f : E β F} {p : E β F} :
β β§ β (x : E), (p x 0).uncurry0 = f x
theorem has_ftaylor_series_up_to.has_fderiv_at {π : Type u_1} [nondiscrete_normed_field π] {E : Type u_2} [normed_group E] [normed_space π E] {F : Type u_3} [normed_group F] [normed_space π F] {f : E β F} {p : E β F} {n : with_top β} (h : p) (hn : 1 β€ n) (x : E) :
(β F) (p x 1)) x

If a function has a Taylor series at order at least `1`, then the term of order `1` of this series is a derivative of `f`.

theorem has_ftaylor_series_up_to.differentiable {π : Type u_1} [nondiscrete_normed_field π] {E : Type u_2} [normed_group E] [normed_space π E] {F : Type u_3} [normed_group F] [normed_space π F] {f : E β F} {p : E β F} {n : with_top β} (h : p) (hn : 1 β€ n) :
differentiable π f
theorem has_ftaylor_series_up_to_succ_iff_right {π : Type u_1} [nondiscrete_normed_field π] {E : Type u_2} [normed_group E] [normed_space π E] {F : Type u_3} [normed_group F] [normed_space π F] {f : E β F} {p : E β F} {n : β} :
f p β (β (x : E), (p x 0).uncurry0 = f x) β§ (β (x : E), has_fderiv_at (Ξ» (y : E), p y 0) (p x 1).curry_left x) β§ (Ξ» (x : E), β F) (p x 1)) (Ξ» (x : E), (p x).shift)

`p` is a Taylor series of `f` up to `n+1` if and only if `p.shift` is a Taylor series up to `n` for `p 1`, which is a derivative of `f`.

### Smooth functions at a point #

def times_cont_diff_at (π : Type u_1) [nondiscrete_normed_field π] {E : Type u_2} [normed_group E] [normed_space π E] {F : Type u_3} [normed_group F] [normed_space π F] (n : with_top β) (f : E β F) (x : E) :
Prop

A function is continuously differentiable up to `n` at a point `x` if, for any integer `k β€ n`, there is a neighborhood of `x` where `f` admits derivatives up to order `n`, which are continuous.

Equations
theorem times_cont_diff_within_at_univ {π : Type u_1} [nondiscrete_normed_field π] {E : Type u_2} [normed_group E] [normed_space π E] {F : Type u_3} [normed_group F] [normed_space π F] {f : E β F} {x : E} {n : with_top β} :
f set.univ x β n f x
theorem times_cont_diff_at_top {π : Type u_1} [nondiscrete_normed_field π] {E : Type u_2} [normed_group E] [normed_space π E] {F : Type u_3} [normed_group F] [normed_space π F] {f : E β F} {x : E} :
f x β β (n : β), βn f x
theorem times_cont_diff_at.times_cont_diff_within_at {π : Type u_1} [nondiscrete_normed_field π] {E : Type u_2} [normed_group E] [normed_space π E] {F : Type u_3} [normed_group F] [normed_space π F] {s : set E} {f : E β F} {x : E} {n : with_top β} (h : n f x) :
f s x
theorem times_cont_diff_within_at.times_cont_diff_at {π : Type u_1} [nondiscrete_normed_field π] {E : Type u_2} [normed_group E] [normed_space π E] {F : Type u_3} [normed_group F] [normed_space π F] {s : set E} {f : E β F} {x : E} {n : with_top β} (h : f s x) (hx : s β π x) :
n f x
theorem times_cont_diff_at.congr_of_eventually_eq {π : Type u_1} [nondiscrete_normed_field π] {E : Type u_2} [normed_group E] [normed_space π E] {F : Type u_3} [normed_group F] [normed_space π F] {f fβ : E β F} {x : E} {n : with_top β} (h : n f x) (hg : fβ =αΆ [π x] f) :
n fβ x
theorem times_cont_diff_at.of_le {π : Type u_1} [nondiscrete_normed_field π] {E : Type u_2} [normed_group E] [normed_space π E] {F : Type u_3} [normed_group F] [normed_space π F] {f : E β F} {x : E} {m n : with_top β} (h : n f x) (hmn : m β€ n) :
m f x
theorem times_cont_diff_at.continuous_at {π : Type u_1} [nondiscrete_normed_field π] {E : Type u_2} [normed_group E] [normed_space π E] {F : Type u_3} [normed_group F] [normed_space π F] {f : E β F} {x : E} {n : with_top β} (h : n f x) :
theorem times_cont_diff_at.differentiable_at {π : Type u_1} [nondiscrete_normed_field π] {E : Type u_2} [normed_group E] [normed_space π E] {F : Type u_3} [normed_group F] [normed_space π F] {f : E β F} {x : E} {n : with_top β} (h : n f x) (hn : 1 β€ n) :
f x

If a function is `C^n` with `n β₯ 1` at a point, then it is differentiable there.

theorem times_cont_diff_at_succ_iff_has_fderiv_at {π : Type u_1} [nondiscrete_normed_field π] {E : Type u_2} [normed_group E] [normed_space π E] {F : Type u_3} [normed_group F] [normed_space π F] {f : E β F} {x : E} {n : β} :
β(n + 1) f x β β (f' : E β (E βL[π] F)), (β (u : set E) (H : u β π x), β (x : E), x β u β (f' x) x) β§ βn f' x

A function is `C^(n + 1)` at a point iff locally, it has a derivative which is `C^n`.

### Smooth functions #

def times_cont_diff (π : Type u_1) [nondiscrete_normed_field π] {E : Type u_2} [normed_group E] [normed_space π E] {F : Type u_3} [normed_group F] [normed_space π F] (n : with_top β) (f : E β F) :
Prop

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.

Equations
theorem times_cont_diff_on_univ {π : Type u_1} [nondiscrete_normed_field π] {E : Type u_2} [normed_group E] [normed_space π E] {F : Type u_3} [normed_group F] [normed_space π F] {f : E β F} {n : with_top β} :
n f set.univ β times_cont_diff π n f
theorem times_cont_diff_iff_times_cont_diff_at {π : Type u_1} [nondiscrete_normed_field π] {E : Type u_2} [normed_group E] [normed_space π E] {F : Type u_3} [normed_group F] [normed_space π F] {f : E β F} {n : with_top β} :
times_cont_diff π n f β β (x : E), n f x
theorem times_cont_diff.times_cont_diff_at {π : Type u_1} [nondiscrete_normed_field π] {E : Type u_2} [normed_group E] [normed_space π E] {F : Type u_3} [normed_group F] [normed_space π F] {f : E β F} {x : E} {n : with_top β} (h : times_cont_diff π n f) :
n f x
theorem times_cont_diff.times_cont_diff_within_at {π : Type u_1} [nondiscrete_normed_field π] {E : Type u_2} [normed_group E] [normed_space π E] {F : Type u_3} [normed_group F] [normed_space π F] {s : set E} {f : E β F} {x : E} {n : with_top β} (h : times_cont_diff π n f) :
f s x
theorem times_cont_diff_top {π : Type u_1} [nondiscrete_normed_field π] {E : Type u_2} [normed_group E] [normed_space π E] {F : Type u_3} [normed_group F] [normed_space π F] {f : E β F} :
times_cont_diff π β€ f β β (n : β), times_cont_diff π βn f
theorem times_cont_diff_all_iff_nat {π : Type u_1} [nondiscrete_normed_field π] {E : Type u_2} [normed_group E] [normed_space π E] {F : Type u_3} [normed_group F] [normed_space π F] {f : E β F} :
(β (n : , times_cont_diff π n f) β β (n : β), times_cont_diff π βn f
theorem times_cont_diff.times_cont_diff_on {π : Type u_1} [nondiscrete_normed_field π] {E : Type u_2} [normed_group E] [normed_space π E] {F : Type u_3} [normed_group F] [normed_space π F] {s : set E} {f : E β F} {n : with_top β} (h : times_cont_diff π n f) :
n f s
@[simp]
theorem times_cont_diff_zero {π : Type u_1} [nondiscrete_normed_field π] {E : Type u_2} [normed_group E] [normed_space π E] {F : Type u_3} [normed_group F] [normed_space π F] {f : E β F} :
times_cont_diff π 0 f β
theorem times_cont_diff_at_zero {π : Type u_1} [nondiscrete_normed_field π] {E : Type u_2} [normed_group E] [normed_space π E] {F : Type u_3} [normed_group F] [normed_space π F] {f : E β F} {x : E} :
0 f x β β (u : set E) (H : u β π x),
theorem times_cont_diff.of_le {π : Type u_1} [nondiscrete_normed_field π] {E : Type u_2} [normed_group E] [normed_space π E] {F : Type u_3} [normed_group F] [normed_space π F] {f : E β F} {m n : with_top β} (h : times_cont_diff π n f) (hmn : m β€ n) :
times_cont_diff π m f
theorem times_cont_diff.continuous {π : Type u_1} [nondiscrete_normed_field π] {E : Type u_2} [normed_group E] [normed_space π E] {F : Type u_3} [normed_group F] [normed_space π F] {f : E β F} {n : with_top β} (h : times_cont_diff π n f) :
theorem times_cont_diff.differentiable {π : Type u_1} [nondiscrete_normed_field π] {E : Type u_2} [normed_group E] [normed_space π E] {F : Type u_3} [normed_group F] [normed_space π F] {f : E β F} {n : with_top β} (h : times_cont_diff π n f) (hn : 1 β€ n) :
differentiable π f

If a function is `C^n` with `n β₯ 1`, then it is differentiable.

### Iterated derivative #

def iterated_fderiv (π : Type u_1) [nondiscrete_normed_field π] {E : Type u_2} [normed_group E] [normed_space π E] {F : Type u_3} [normed_group F] [normed_space π F] (n : β) (f : E β F) :
E β (Ξ» (i : fin n), E) F

The `n`-th derivative of a function, as a multilinear map, defined inductively.

Equations
def ftaylor_series (π : Type u_1) [nondiscrete_normed_field π] {E : Type u_2} [normed_group E] [normed_space π E] {F : Type u_3} [normed_group F] [normed_space π F] (f : E β F) (x : E) :
F

Formal Taylor series associated to a function within a set.

Equations
@[simp]
theorem iterated_fderiv_zero_apply {π : Type u_1} [nondiscrete_normed_field π] {E : Type u_2} [normed_group E] [normed_space π E] {F : Type u_3} [normed_group F] [normed_space π F] {f : E β F} {x : E} (m : fin 0 β E) :
β(iterated_fderiv π 0 f x) m = f x
theorem iterated_fderiv_zero_eq_comp {π : Type u_1} [nondiscrete_normed_field π] {E : Type u_2} [normed_group E] [normed_space π E] {F : Type u_3} [normed_group F] [normed_space π F] {f : E β F} :
iterated_fderiv π 0 f = β F).symm) β f
theorem iterated_fderiv_succ_apply_left {π : Type u_1} [nondiscrete_normed_field π] {E : Type u_2} [normed_group E] [normed_space π E] {F : Type u_3} [normed_group F] [normed_space π F] {f : E β F} {x : E} {n : β} (m : fin (n + 1) β E) :
β(iterated_fderiv π (n + 1) f x) m = β(β(fderiv π (iterated_fderiv π n f) x) (m 0)) (fin.tail m)
theorem iterated_fderiv_succ_eq_comp_left {π : Type u_1} [nondiscrete_normed_field π] {E : Type u_2} [normed_group E] [normed_space π E] {F : Type u_3} [normed_group F] [normed_space π F] {f : E β F} {n : β} :
iterated_fderiv π (n + 1) f = β (Ξ» (i : fin (n + 1)), E) F) β fderiv π (iterated_fderiv π n f)

Writing explicitly the `n+1`-th derivative as the composition of a currying linear equiv, and the derivative of the `n`-th derivative.

theorem iterated_fderiv_within_univ {π : Type u_1} [nondiscrete_normed_field π] {E : Type u_2} [normed_group E] [normed_space π E] {F : Type u_3} [normed_group F] [normed_space π F] {f : E β F} {n : β} :
n f set.univ = iterated_fderiv π n f
theorem ftaylor_series_within_univ {π : Type u_1} [nondiscrete_normed_field π] {E : Type u_2} [normed_group E] [normed_space π E] {F : Type u_3} [normed_group F] [normed_space π F] {f : E β F} :
= ftaylor_series π f
theorem iterated_fderiv_succ_apply_right {π : Type u_1} [nondiscrete_normed_field π] {E : Type u_2} [normed_group E] [normed_space π E] {F : Type u_3} [normed_group F] [normed_space π F] {f : E β F} {x : E} {n : β} (m : fin (n + 1) β E) :
β(iterated_fderiv π (n + 1) f x) m = β(β(iterated_fderiv π n (Ξ» (y : E), fderiv π f y) x) (fin.init m)) (m (fin.last n))
theorem iterated_fderiv_succ_eq_comp_right {π : Type u_1} [nondiscrete_normed_field π] {E : Type u_2} [normed_group E] [normed_space π E] {F : Type u_3} [normed_group F] [normed_space π F] {f : E β F} {x : E} {n : β} :
iterated_fderiv π (n + 1) f x = (β F) β iterated_fderiv π n (Ξ» (y : E), fderiv π f y)) x

Writing explicitly the `n+1`-th derivative as the composition of a currying linear equiv, and the `n`-th derivative of the derivative.

@[simp]
theorem iterated_fderiv_one_apply {π : Type u_1} [nondiscrete_normed_field π] {E : Type u_2} [normed_group E] [normed_space π E] {F : Type u_3} [normed_group F] [normed_space π F] {f : E β F} {x : E} (m : fin 1 β E) :
β(iterated_fderiv π 1 f x) m = β(fderiv π f x) (m 0)
theorem times_cont_diff_on_iff_ftaylor_series {π : Type u_1} [nondiscrete_normed_field π] {E : Type u_2} [normed_group E] [normed_space π E] {F : Type u_3} [normed_group F] [normed_space π F] {f : E β F} {n : with_top β} :
times_cont_diff π n f β (ftaylor_series π f)

When a function is `C^n` in a set `s` of unique differentiability, it admits `ftaylor_series_within π f s` as a Taylor series up to order `n` in `s`.

theorem times_cont_diff_iff_continuous_differentiable {π : Type u_1} [nondiscrete_normed_field π] {E : Type u_2} [normed_group E] [normed_space π E] {F : Type u_3} [normed_group F] [normed_space π F] {f : E β F} {n : with_top β} :
times_cont_diff π n f β (β (m : β), βm β€ n β continuous (Ξ» (x : E), iterated_fderiv π m f x)) β§ β (m : β), βm < n β differentiable π (Ξ» (x : E), iterated_fderiv π m f x)
theorem times_cont_diff_of_differentiable_iterated_fderiv {π : Type u_1} [nondiscrete_normed_field π] {E : Type u_2} [normed_group E] [normed_space π E] {F : Type u_3} [normed_group F] [normed_space π F] {f : E β F} {n : with_top β} (h : β (m : β), βm β€ n β differentiable π (iterated_fderiv π m f)) :
times_cont_diff π n f
theorem times_cont_diff_succ_iff_fderiv {π : Type u_1} [nondiscrete_normed_field π] {E : Type u_2} [normed_group E] [normed_space π E] {F : Type u_3} [normed_group F] [normed_space π F] {f : E β F} {n : β} :
times_cont_diff π β(n + 1) f β differentiable π f β§ times_cont_diff π βn (Ξ» (y : E), fderiv π f y)

A function is `C^(n + 1)` on a domain with unique derivatives if and only if it is differentiable there, and its derivative is `C^n`.

theorem times_cont_diff_top_iff_fderiv {π : Type u_1} [nondiscrete_normed_field π] {E : Type u_2} [normed_group E] [normed_space π E] {F : Type u_3} [normed_group F] [normed_space π F] {f : E β F} :
times_cont_diff π β€ f β differentiable π f β§ times_cont_diff π β€ (Ξ» (y : E), fderiv π f y)

A function is `C^β` on a domain with unique derivatives if and only if it is differentiable there, and its derivative is `C^β`.

theorem times_cont_diff.continuous_fderiv {π : Type u_1} [nondiscrete_normed_field π] {E : Type u_2} [normed_group E] [normed_space π E] {F : Type u_3} [normed_group F] [normed_space π F] {f : E β F} {n : with_top β} (h : times_cont_diff π n f) (hn : 1 β€ n) :
continuous (Ξ» (x : E), fderiv π f x)
theorem times_cont_diff.continuous_fderiv_apply {π : Type u_1} [nondiscrete_normed_field π] {E : Type u_2} [normed_group E] [normed_space π E] {F : Type u_3} [normed_group F] [normed_space π F] {f : E β F} {n : with_top β} (h : times_cont_diff π n f) (hn : 1 β€ n) :
continuous (Ξ» (p : E Γ E), β(fderiv π f p.fst) p.snd)

If a function is at least `C^1`, its bundled derivative (mapping `(x, v)` to `Df(x) v`) is continuous.

### Constants #

theorem iterated_fderiv_within_zero_fun {π : Type u_1} [nondiscrete_normed_field π] {E : Type u_2} [normed_group E] [normed_space π E] {F : Type u_3} [normed_group F] [normed_space π F] {n : β} :
iterated_fderiv π n (Ξ» (x : E), 0) = 0
theorem times_cont_diff_zero_fun {π : Type u_1} [nondiscrete_normed_field π] {E : Type u_2} [normed_group E] [normed_space π E] {F : Type u_3} [normed_group F] [normed_space π F] {n : with_top β} :
times_cont_diff π n (Ξ» (x : E), 0)
theorem times_cont_diff_const {π : Type u_1} [nondiscrete_normed_field π] {E : Type u_2} [normed_group E] [normed_space π E] {F : Type u_3} [normed_group F] [normed_space π F] {n : with_top β} {c : F} :
times_cont_diff π n (Ξ» (x : E), c)

Constants are `C^β`.

theorem times_cont_diff_on_const {π : Type u_1} [nondiscrete_normed_field π] {E : Type u_2} [normed_group E] [normed_space π E] {F : Type u_3} [normed_group F] [normed_space π F] {n : with_top β} {c : F} {s : set E} :
n (Ξ» (x : E), c) s
theorem times_cont_diff_at_const {π : Type u_1} [nondiscrete_normed_field π] {E : Type u_2} [normed_group E] [normed_space π E] {F : Type u_3} [normed_group F] [normed_space π F] {x : E} {n : with_top β} {c : F} :
n (Ξ» (x : E), c) x
theorem times_cont_diff_within_at_const {π : Type u_1} [nondiscrete_normed_field π] {E : Type u_2} [normed_group E] [normed_space π E] {F : Type u_3} [normed_group F] [normed_space π F] {s : set E} {x : E} {n : with_top β} {c : F} :
(Ξ» (x : E), c) s x
theorem times_cont_diff_of_subsingleton {π : Type u_1} [nondiscrete_normed_field π] {E : Type u_2} [normed_group E] [normed_space π E] {F : Type u_3} [normed_group F] [normed_space π F] {f : E β F} [subsingleton F] {n : with_top β} :
times_cont_diff π n f
theorem times_cont_diff_at_of_subsingleton {π : Type u_1} [nondiscrete_normed_field π] {E : Type u_2} [normed_group E] [normed_space π E] {F : Type u_3} [normed_group F] [normed_space π F] {f : E β F} {x : E} [subsingleton F] {n : with_top β} :
n f x
theorem times_cont_diff_within_at_of_subsingleton {π : Type u_1} [nondiscrete_normed_field π] {E : Type u_2} [normed_group E] [normed_space π E] {F : Type u_3} [normed_group F] [normed_space π F] {s : set E} {f : E β F} {x : E} [subsingleton F] {n : with_top β} :
f s x
theorem times_cont_diff_on_of_subsingleton {π : Type u_1} [nondiscrete_normed_field π] {E : Type u_2} [normed_group E] [normed_space π E] {F : Type u_3} [normed_group F] [normed_space π F] {s : set E} {f : E β F} [subsingleton F] {n : with_top β} :
n f s

### Linear functions #

theorem is_bounded_linear_map.times_cont_diff {π : Type u_1} [nondiscrete_normed_field π] {E : Type u_2} [normed_group E] [normed_space π E] {F : Type u_3} [normed_group F] [normed_space π F] {f : E β F} {n : with_top β} (hf : f) :
times_cont_diff π n f

Unbundled bounded linear functions are `C^β`.

theorem continuous_linear_map.times_cont_diff {π : Type u_1} [nondiscrete_normed_field π] {E : Type u_2} [normed_group E] [normed_space π E] {F : Type u_3} [normed_group F] [normed_space π F] {n : with_top β} (f : E βL[π] F) :
theorem continuous_linear_equiv.times_cont_diff {π : Type u_1} [nondiscrete_normed_field π] {E : Type u_2} [normed_group E] [normed_space π E] {F : Type u_3} [normed_group F] [normed_space π F] {n : with_top β} (f : E βL[π] F) :
theorem linear_isometry_map.times_cont_diff {π : Type u_1} [nondiscrete_normed_field π] {E : Type u_2} [normed_group E] [normed_space π E] {F : Type u_3} [normed_group F] [normed_space π F] {n : with_top β} (f : E ββα΅’[π] F) :
theorem linear_isometry_equiv.times_cont_diff {π : Type u_1} [nondiscrete_normed_field π] {E : Type u_2} [normed_group E] [normed_space π E] {F : Type u_3} [normed_group F] [normed_space π F] {n : with_top β} (f : E ββα΅’[π] F) :
theorem times_cont_diff_fst {π : Type u_1} [nondiscrete_normed_field π] {E : Type u_2} [normed_group E] [normed_space π E] {F : Type u_3} [normed_group F] [normed_space π F] {n : with_top β} :

The first projection in a product is `C^β`.

theorem times_cont_diff_on_fst {π : Type u_1} [nondiscrete_normed_field π] {E : Type u_2} [normed_group E] [normed_space π E] {F : Type u_3} [normed_group F] [normed_space π F] {s : set (E Γ F)} {n : with_top β} :

The first projection on a domain in a product is `C^β`.

theorem times_cont_diff_at_fst {π : Type u_1} [nondiscrete_normed_field π] {E : Type u_2} [normed_group E] [normed_space π E] {F : Type u_3} [normed_group F] [normed_space π F] {p : E Γ F} {n : with_top β} :

The first projection at a point in a product is `C^β`.

theorem times_cont_diff_within_at_fst {π : Type u_1} [nondiscrete_normed_field π] {E : Type u_2} [normed_group E] [normed_space π E] {F : Type u_3} [normed_group F] [normed_space π F] {s : set (E Γ F)} {p : E Γ F} {n : with_top β} :
s p

The first projection within a domain at a point in a product is `C^β`.

theorem times_cont_diff_snd {π : Type u_1} [nondiscrete_normed_field π] {E : Type u_2} [normed_group E] [normed_space π E] {F : Type u_3} [normed_group F] [normed_space π F] {n : with_top β} :

The second projection in a product is `C^β`.

theorem times_cont_diff_on_snd {π : Type u_1} [nondiscrete_normed_field π] {E : Type u_2} [normed_group E] [normed_space π E] {F : Type u_3} [normed_group F] [normed_space π F] {s : set (E Γ F)} {n : with_top β} :

The second projection on a domain in a product is `C^β`.

theorem times_cont_diff_at_snd {π : Type u_1} [nondiscrete_normed_field π] {E : Type u_2} [normed_group E] [normed_space π E] {F : Type u_3} [normed_group F] [normed_space π F] {p : E Γ F} {n : with_top β} :

The second projection at a point in a product is `C^β`.

theorem times_cont_diff_within_at_snd {π : Type u_1} [nondiscrete_normed_field π] {E : Type u_2} [normed_group E] [normed_space π E] {F : Type u_3} [normed_group F] [normed_space π F] {s : set (E Γ F)} {p : E Γ F} {n : with_top β} :
s p

The second projection within a domain at a point in a product is `C^β`.

theorem times_cont_diff_id {π : Type u_1} [nondiscrete_normed_field π] {E : Type u_2} [normed_group E] [normed_space π E] {n : with_top β} :
times_cont_diff π n id

The identity is `C^β`.

theorem times_cont_diff_within_at_id {π : Type u_1} [nondiscrete_normed_field π] {E : Type u_2} [normed_group E] [normed_space π E] {n : with_top β} {s : set E} {x : E} :
id s x
theorem times_cont_diff_at_id {π : Type u_1} [nondiscrete_normed_field π] {E : Type u_2} [normed_group E] [normed_space π E] {n : with_top β} {x : E} :
n id x
theorem times_cont_diff_on_id {π : Type u_1} [nondiscrete_normed_field π] {E : Type u_2} [normed_group E] [normed_space π E] {n : with_top β} {s : set E} :
n id s
theorem is_bounded_bilinear_map.times_cont_diff {π : Type u_1} [nondiscrete_normed_field π] {E : Type u_2} [normed_group E] [normed_space π E] {F : Type u_3} [normed_group F] [normed_space π F] {G : Type u_4} [normed_group G] [normed_space π G] {b : E Γ F β G} {n : with_top β} (hb : b) :
times_cont_diff π n b

Bilinear functions are `C^β`.

theorem has_ftaylor_series_up_to_on.continuous_linear_map_comp {π : Type u_1} [nondiscrete_normed_field π] {E : Type u_2} [normed_group E] [normed_space π E] {F : Type u_3} [normed_group F] [normed_space π F] {G : Type u_4} [normed_group G] [normed_space π G] {s : set E} {f : E β F} {p : E β F} {n : with_top β} (g : F βL[π] G) (hf : s) :
(Ξ» (x : E) (k : β), g.comp_continuous_multilinear_map (p x k)) s

If `f` admits a Taylor series `p` in a set `s`, and `g` is linear, then `g β f` admits a Taylor series whose `k`-th term is given by `g β (p k)`.

theorem times_cont_diff_within_at.continuous_linear_map_comp {π : Type u_1} [nondiscrete_normed_field π] {E : Type u_2} [normed_group E] [normed_space π E] {F : Type u_3} [normed_group F] [normed_space π F] {G : Type u_4} [normed_group G] [normed_space π G] {s : set E} {f : E β F} {x : E} {n : with_top β} (g : F βL[π] G) (hf : f s x) :
(βg β f) s x

Composition by continuous linear maps on the left preserves `C^n` functions in a domain at a point.

theorem times_cont_diff_at.continuous_linear_map_comp {π : Type u_1} [nondiscrete_normed_field π] {E : Type u_2} [normed_group E] [normed_space π E] {F : Type u_3} [normed_group F] [normed_space π F] {G : Type u_4} [normed_group G] [normed_space π G] {f : E β F} {x : E} {n : with_top β} (g : F βL[π] G) (hf : n f x) :
n (βg β f) x

Composition by continuous linear maps on the left preserves `C^n` functions in a domain at a point.

theorem times_cont_diff_on.continuous_linear_map_comp {π : Type u_1} [nondiscrete_normed_field π] {E : Type u_2} [normed_group E] [normed_space π E] {F : Type u_3} [normed_group F] [normed_space π F] {G : Type u_4} [normed_group G] [normed_space π G] {s : set E} {f : E β F} {n : with_top β} (g : F βL[π] G) (hf : n f s) :
n (βg β f) s

Composition by continuous linear maps on the left preserves `C^n` functions on domains.

theorem times_cont_diff.continuous_linear_map_comp {π : Type u_1} [nondiscrete_normed_field π] {E : Type u_2} [normed_group E] [normed_space π E] {F : Type u_3} [normed_group F] [normed_space π F] {G : Type u_4} [normed_group G] [normed_space π G] {n : with_top β} {f : E β F} (g : F βL[π] G) (hf : times_cont_diff π n f) :
times_cont_diff π n (Ξ» (x : E), βg (f x))

Composition by continuous linear maps on the left preserves `C^n` functions.

theorem continuous_linear_equiv.comp_times_cont_diff_within_at_iff {π : Type u_1} [nondiscrete_normed_field π] {E : Type u_2} [normed_group E] [normed_space π E] {F : Type u_3} [normed_group F] [normed_space π F] {G : Type u_4} [normed_group G] [normed_space π G] {s : set E} {f : E β F} {x : E} {n : with_top β} (e : F βL[π] G) :
(βe β f) s x β f s x

Composition by continuous linear equivs on the left respects higher differentiability on domains.

theorem continuous_linear_equiv.comp_times_cont_diff_on_iff {π : Type u_1} [nondiscrete_normed_field π] {E : Type u_2} [normed_group E] [normed_space π E] {F : Type u_3} [normed_group F] [normed_space π F] {G : Type u_4} [normed_group G] [normed_space π G] {s : set E} {f : E β F} {n : with_top β} (e : F βL[π] G) :
n (βe β f) s β n f s

Composition by continuous linear equivs on the left respects higher differentiability on domains.

theorem has_ftaylor_series_up_to_on.comp_continuous_linear_map {π : Type u_1} [nondiscrete_normed_field π] {E : Type u_2} [normed_group E] [normed_space π E] {F : Type u_3} [normed_group F] [normed_space π F] {G : Type u_4} [normed_group G] [normed_space π G] {s : set E} {f : E β F} {p : E β F} {n : with_top β} (hf : s) (g : G βL[π] E) :
(Ξ» (x : G) (k : β), (p (βg x) k).comp_continuous_linear_map (Ξ» (_x : fin k), g)) (βg β»ΒΉ' s)

If `f` admits a Taylor series `p` in a set `s`, and `g` is linear, then `f β g` admits a Taylor series in `g β»ΒΉ' s`, whose `k`-th term is given by `p k (g vβ, ..., g vβ)` .

theorem times_cont_diff_within_at.comp_continuous_linear_map {π : Type u_1} [nondiscrete_normed_field π] {E : Type u_2} [normed_group E] [normed_space π E] {F : Type u_3} [normed_group F] [normed_space π F] {G : Type u_4} [normed_group G] [normed_space π G] {s : set E} {f : E β F} {n : with_top β} {x : G} (g : G βL[π] E) (hf : f s (βg x)) :

Composition by continuous linear maps on the right preserves `C^n` functions at a point on a domain.

theorem times_cont_diff_on.comp_continuous_linear_map {π : Type u_1} [nondiscrete_normed_field π] {E : Type u_2} [normed_group E] [normed_space π E] {F : Type u_3} [normed_group F] [normed_space π F] {G : Type u_4} [normed_group G] [normed_space π G] {s : set E} {f : E β F} {n : with_top β} (hf : n f s) (g : G βL[π] E) :

Composition by continuous linear maps on the right preserves `C^n` functions on domains.

theorem times_cont_diff.comp_continuous_linear_map {π : Type u_1} [nondiscrete_normed_field π] {E : Type u_2} [normed_group E] [normed_space π E] {F : Type u_3} [normed_group F] [normed_space π F] {G : Type u_4} [normed_group G] [normed_space π G] {n : with_top β} {f : E β F} {g : G βL[π] E} (hf : times_cont_diff π n f) :
times_cont_diff π n (f β βg)

Composition by continuous linear maps on the right preserves `C^n` functions.

theorem continuous_linear_equiv.times_cont_diff_within_at_comp_iff {π : Type u_1} [nondiscrete_normed_field π] {E : Type u_2} [normed_group E] [normed_space π E] {F : Type u_3} [normed_group F] [normed_space π F] {G : Type u_4} [normed_group G] [normed_space π G] {s : set E} {f : E β F} {x : E} {n : with_top β} (e : G βL[π] E) :
(f β βe) (βe β»ΒΉ' s) (β(e.symm) x) β f s x

Composition by continuous linear equivs on the right respects higher differentiability at a point in a domain.

theorem continuous_linear_equiv.times_cont_diff_on_comp_iff {π : Type u_1} [nondiscrete_normed_field π] {E : Type u_2} [normed_group E] [normed_space π E] {F : Type u_3} [normed_group F] [normed_space π F] {G : Type u_4} [normed_group G] [normed_space π G] {s : set E} {f : E β F} {n : with_top β} (e : G βL[π] E) :

Composition by continuous linear equivs on the right respects higher differentiability on domains.

theorem has_ftaylor_series_up_to_on.prod {π : Type u_1} [nondiscrete_normed_field π] {E : Type u_2} [normed_group E] [normed_space π E] {F : Type u_3} [normed_group F] [normed_space π F] {G : Type u_4} [normed_group G] [normed_space π G] {s : set E} {f : E β F} {p : E β F} {n : with_top β} (hf : s) {g : E β G} {q : E β G} (hg : s) :
(Ξ» (y : E), (f y, g y)) (Ξ» (y : E) (k : β), (p y k).prod (q y k)) s

If two functions `f` and `g` admit Taylor series `p` and `q` in a set `s`, then the cartesian product of `f` and `g` admits the cartesian product of `p` and `q` as a Taylor series.

theorem times_cont_diff_within_at.prod {π : Type u_1} [nondiscrete_normed_field π] {E : Type u_2} [normed_group E] [normed_space π E] {F : Type u_3} [normed_group F] [normed_space π F] {G : Type u_4} [normed_group G] [normed_space π G] {x : E} {n : with_top β} {s : set E} {f : E β F} {g : E β G} (hf : f s x) (hg : g s x) :
(Ξ» (x : E), (f x, g x)) s x

The cartesian product of `C^n` functions at a point in a domain is `C^n`.

theorem times_cont_diff_on.prod {π : Type u_1} [nondiscrete_normed_field π] {E : Type u_2} [normed_group E] [normed_space π E] {F : Type u_3} [normed_group F] [normed_space π F] {G : Type u_4} [normed_group G] [normed_space π G] {n : with_top β} {s : set E} {f : E β F} {g : E β G} (hf : n f s) (hg : n g s) :
n (Ξ» (x : E), (f x, g x)) s

The cartesian product of `C^n` functions on domains is `C^n`.

theorem times_cont_diff_at.prod {π : Type u_1} [nondiscrete_normed_field π] {E : Type u_2} [normed_group E] [normed_space π E] {F : Type u_3} [normed_group F] [normed_space π F] {G : Type u_4} [normed_group G] [normed_space π G] {x : E} {n : with_top β} {f : E β F} {g : E β G} (hf : n f x) (hg : n g x) :
n (Ξ» (x : E), (f x, g x)) x

The cartesian product of `C^n` functions at a point is `C^n`.

theorem times_cont_diff.prod {π : Type u_1} [nondiscrete_normed_field π] {E : Type u_2} [normed_group E] [normed_space π E] {F : Type u_3} [normed_group F] [normed_space π F] {G : Type u_4} [normed_group G] [normed_space π G] {n : with_top β} {f : E β F} {g : E β G} (hf : times_cont_diff π n f) (hg : times_cont_diff π n g) :
times_cont_diff π n (Ξ» (x : E), (f x, g x))

The cartesian product of `C^n` functions is `C^n`.

### Smoothness of functions `f : E β Ξ  i, F' i`#

theorem has_ftaylor_series_up_to_on_pi {π : Type u_1} [nondiscrete_normed_field π] {E : Type u_2} [normed_group E] [normed_space π E] {s : set E} {ΞΉ : Type u_5} [fintype ΞΉ] {F' : ΞΉ β Type u_6} [Ξ  (i : ΞΉ), normed_group (F' i)] [Ξ  (i : ΞΉ), normed_space π (F' i)] {Ο : Ξ  (i : ΞΉ), E β F' i} {p' : Ξ  (i : ΞΉ), E β (F' i)} {n : with_top β} :
(Ξ» (x : E) (i : ΞΉ), Ο i x) (Ξ» (x : E) (m : β), continuous_multilinear_map.pi (Ξ» (i : ΞΉ), p' i x m)) s β β (i : ΞΉ), (Ο i) (p' i) s
@[simp]
theorem has_ftaylor_series_up_to_on_pi' {π : Type u_1} [nondiscrete_normed_field π] {E : Type u_2} [normed_group E] [normed_space π E] {s : set E} {ΞΉ : Type u_5} [fintype ΞΉ] {F' : ΞΉ β Type u_6} [Ξ  (i : ΞΉ), normed_group (F' i)] [Ξ  (i : ΞΉ), normed_space π (F' i)] {Ξ¦ : E β Ξ  (i : ΞΉ), F' i} {P' : E β (Ξ  (i : ΞΉ), F' i)} {n : with_top β} :
P' s β β (i : ΞΉ), (Ξ» (x : E), Ξ¦ x i) (Ξ» (x : E) (m : β), s
theorem times_cont_diff_within_at_pi {π : Type u_1} [nondiscrete_normed_field π] {E : Type u_2} [normed_group E] [normed_space π E] {s : set E} {x : E} {ΞΉ : Type u_5} [fintype ΞΉ] {F' : ΞΉ β Type u_6} [Ξ  (i : ΞΉ), normed_group (F' i)] [Ξ  (i : ΞΉ), normed_space π (F' i)] {Ξ¦ : E β Ξ  (i : ΞΉ), F' i} {n : with_top β} :
Ξ¦ s x β β (i : ΞΉ), (Ξ» (x : E), Ξ¦ x i) s x
theorem times_cont_diff_on_pi {π : Type u_1} [nondiscrete_normed_field π] {E : Type u_2} [normed_group E] [normed_space π E] {s : set E} {ΞΉ : Type u_5} [fintype ΞΉ] {F' : ΞΉ β Type u_6} [Ξ  (i : ΞΉ), normed_group (F' i)] [Ξ  (i : ΞΉ), normed_space π (F' i)] {Ξ¦ : E β Ξ  (i : ΞΉ), F' i} {n : with_top β} :
n Ξ¦ s β β (i : ΞΉ), n (Ξ» (x : E), Ξ¦ x i) s
theorem times_cont_diff_at_pi {π : Type u_1} [nondiscrete_normed_field π] {E : Type u_2} [normed_group E] [normed_space π E] {x : E} {ΞΉ : Type u_5} [fintype ΞΉ] {F' : ΞΉ β Type u_6} [Ξ  (i : ΞΉ), normed_group (F' i)] [Ξ  (i : ΞΉ), normed_space π (F' i)] {Ξ¦ : E β Ξ  (i : ΞΉ), F' i} {n : with_top β} :
n Ξ¦ x β β (i : ΞΉ), n (Ξ» (x : E), Ξ¦ x i) x
theorem times_cont_diff_pi {π : Type u_1} [nondiscrete_normed_field π] {E : Type u_2} [normed_group E] [normed_space π E] {ΞΉ : Type u_5} [fintype ΞΉ] {F' : ΞΉ β Type u_6} [Ξ  (i : ΞΉ), normed_group (F' i)] [Ξ  (i : ΞΉ), normed_space π (F' i)] {Ξ¦ : E β Ξ  (i : ΞΉ), F' i} {n : with_top β} :
times_cont_diff π n Ξ¦ β β (i : ΞΉ), times_cont_diff π n (Ξ» (x : E), Ξ¦ x i)

### Composition of `C^n` functions #

We show that the composition of `C^n` functions is `C^n`. One way to prove it would be to write the `n`-th derivative of the composition (this is FaΓ  di Bruno's formula) and check its continuity, but this is very painful. Instead, we go for a simple inductive proof. Assume it is done for `n`. Then, to check it for `n+1`, one needs to check that the derivative of `g β f` is `C^n`, i.e., that `Dg(f x) β¬ Df(x)` is `C^n`. The term `Dg (f x)` is the composition of two `C^n` functions, so it is `C^n` by the inductive assumption. The term `Df(x)` is also `C^n`. Then, the matrix multiplication is the application of a bilinear map (which is `C^β`, and therefore `C^n`) to `x β¦ (Dg(f x), Df x)`. As the composition of two `C^n` maps, it is again `C^n`, and we are done.

There is a subtlety in this argument: we apply the inductive assumption to functions on other Banach spaces. In maths, one would say: prove by induction over `n` that, for all `C^n` maps between all pairs of Banach spaces, their composition is `C^n`. In Lean, this is fine as long as the spaces stay in the same universe. This is not the case in the above argument: if `E` lives in universe `u` and `F` lives in universe `v`, then linear maps from `E` to `F` (to which the derivative of `f` belongs) is in universe `max u v`. If one could quantify over finitely many universes, the above proof would work fine, but this is not the case. One could still write the proof considering spaces in any universe in `u, v, w, max u v, max v w, max u v w`, but it would be extremely tedious and lead to a lot of duplication. Instead, we formulate the above proof when all spaces live in the same universe (where everything is fine), and then we deduce the general result by lifting all our spaces to a common universe. We use the trick that any space `H` is isomorphic through a continuous linear equiv to `continuous_multilinear_map (Ξ» (i : fin 0), E Γ F Γ G) H` to change the universe level, and then argue that composing with such a linear equiv does not change the fact of being `C^n`, which we have already proved previously.

theorem times_cont_diff_on.comp {π : Type u_1} [nondiscrete_normed_field π] {E : Type u_2} [normed_group E] [normed_space π E] {F : Type u_3} [normed_group F] [normed_space π F] {G : Type u_4} [normed_group G] [normed_space π G] {n : with_top β} {s : set E} {t : set F} {g : F β G} {f : E β F} (hg : n g t) (hf : n f s) (st : s β f β»ΒΉ' t) :
n (g β f) s

The composition of `C^n` functions on domains is `C^n`.

theorem times_cont_diff_on.comp' {π : Type u_1} [nondiscrete_normed_field π] {E : Type u_2} [normed_group E] [normed_space π E] {F : Type u_3} [normed_group F] [normed_space π F] {G : Type u_4} [normed_group G] [normed_space π G] {n : with_top β} {s : set E} {t : set F} {g : F β G} {f : E β F} (hg : n g t) (hf : n f s) :
n (g β f) (s β© f β»ΒΉ' t)

The composition of `C^n` functions on domains is `C^n`.

theorem times_cont_diff.comp_times_cont_diff_on {π : Type u_1} [nondiscrete_normed_field π] {E : Type u_2} [normed_group E] [normed_space π E] {F : Type u_3} [normed_group F] [normed_space π F] {G : Type u_4} [normed_group G] [normed_space π G] {n : with_top β} {s : set E} {g : F β G} {f : E β F} (hg : times_cont_diff π n g) (hf : n f s) :
n (g β f) s

The composition of a `C^n` function on a domain with a `C^n` function is `C^n`.

theorem times_cont_diff.comp {π : Type u_1} [nondiscrete_normed_field π] {E : Type u_2} [normed_group E] [normed_space π E] {F : Type u_3} [normed_group F] [normed_space π F] {G : Type u_4} [normed_group G] [normed_space π G] {n : with_top β} {g : F β G} {f : E β F} (hg : times_cont_diff π n g) (hf : times_cont_diff π n f) :
times_cont_diff π n (g β f)

The composition of `C^n` functions is `C^n`.

theorem times_cont_diff_within_at.comp {π : Type u_1} [nondiscrete_normed_field π] {E : Type u_2} [normed_group E] [normed_space π E] {F : Type u_3} [normed_group F] [normed_space π F] {G : Type u_4} [normed_group G] [normed_space π G] {n : with_top β} {s : set E} {t : set F} {g : F β G} {f : E β F} (x : E) (hg : g t (f x)) (hf : f s x) (st : s β f β»ΒΉ' t) :
(g β f) s x

The composition of `C^n` functions at points in domains is `C^n`.

theorem times_cont_diff_within_at.comp' {π : Type u_1} [nondiscrete_normed_field π] {E : Type u_2} [normed_group E] [normed_space π E] {F : Type u_3} [normed_group F] [normed_space π F] {G : Type u_4} [normed_group G] [normed_space π G] {n : with_top β} {s : set E} {t : set F} {g : F β G} {f : E β F} (x : E) (hg : g t (f x)) (hf : f s x) :
(g β f) (s β© f β»ΒΉ' t) x

The composition of `C^n` functions at points in domains is `C^n`.

theorem times_cont_diff_at.comp_times_cont_diff_within_at {π : Type u_1} [nondiscrete_normed_field π] {E : Type u_2} [normed_group E] [normed_space π E] {F : Type u_3} [normed_group F] [normed_space π F] {G : Type u_4} [normed_group G] [normed_space π G] {s : set E} {f : E β F} {g : F β G} {n : with_top β} (x : E) (hg : n g (f x)) (hf : f s x) :
(g β f) s x
theorem times_cont_diff_at.comp {π : Type u_1} [nondiscrete_normed_field π] {E : Type u_2} [normed_group E] [normed_space π E] {F : Type u_3} [normed_group F] [normed_space π F] {G : Type u_4} [normed_group G] [normed_space π G] {f : E β F} {g : F β G} {n : with_top β} (x : E) (hg : n g (f x)) (hf : n f x) :
n (g β f) x

The composition of `C^n` functions at points is `C^n`.

theorem times_cont_diff.comp_times_cont_diff_within_at {π : Type u_1} [nondiscrete_normed_field π] {E : Type u_2} [normed_group E] [normed_space π E] {F : Type u_3} [normed_group F] [normed_space π F] {G : Type u_4} [normed_group G] [normed_space π G] {t : set E} {x : E} {n : with_top β} {g : F β G} {f : E β F} (h : times_cont_diff π n g) (hf : f t x) :
(g β f) t x
theorem times_cont_diff.comp_times_cont_diff_at {π : Type u_1} [nondiscrete_normed_field π] {E : Type u_2} [normed_group E] [normed_space π E] {F : Type u_3} [normed_group F] [normed_space π F] {G : Type u_4} [normed_group G] [normed_space π G] {n : with_top β} {g : F β G} {f : E β F} (x : E) (hg : times_cont_diff π n g) (hf : n f x) :
n (g β f) x
theorem times_cont_diff_on_fderiv_within_apply {π : Type u_1} [nondiscrete_normed_field π] {E : Type u_2} [normed_group E] [normed_space π E] {F : Type u_3} [normed_group F] [normed_space π F] {m n : with_top β} {s : set E} {f : E β F} (hf : n f s) (hs : unique_diff_on π s) (hmn : m + 1 β€ n) :
m (Ξ» (p : E Γ E), β(fderiv_within π f s p.fst) p.snd) (s.prod set.univ)

The bundled derivative of a `C^{n+1}` function is `C^n`.

theorem times_cont_diff.times_cont_diff_fderiv_apply {π : Type u_1} [nondiscrete_normed_field π] {E : Type u_2} [normed_group E] [normed_space π E] {F : Type u_3} [normed_group F] [normed_space π F] {n m : with_top β} {f : E β F} (hf : times_cont_diff π n f) (hmn : m + 1 β€ n) :
times_cont_diff π m (Ξ» (p : E Γ E), β(fderiv π f p.fst) p.snd)

The bundled derivative of a `C^{n+1}` function is `C^n`.

### Sum of two functions #

theorem times_cont_diff_add {π : Type u_1} [nondiscrete_normed_field π] {F : Type u_3} [normed_group F] [normed_space π F] {n : with_top β} :
times_cont_diff π n (Ξ» (p : F Γ F), p.fst + p.snd)
theorem times_cont_diff_within_at.add {π : Type u_1} [nondiscrete_normed_field π] {E : Type u_2} [normed_group E] [normed_space π E] {F : Type u_3} [normed_group F] [normed_space π F] {x : E} {n : with_top β} {s : set E} {f g : E β F} (hf : f s x) (hg : g s x) :
(Ξ» (x : E), f x + g x) s x

The sum of two `C^n` functions within a set at a point is `C^n` within this set at this point.

theorem times_cont_diff_at.add {π : Type u_1} [nondiscrete_normed_field π] {E : Type u_2} [normed_group E] [normed_space π E] {F : Type u_3} [normed_group F] [normed_space π F] {x : E} {n : with_top β} {f g : E β F} (hf : n f x) (hg : n g x) :
n (Ξ» (x : E), f x + g x) x

The sum of two `C^n` functions at a point is `C^n` at this point.

theorem times_cont_diff.add {π : Type u_1} [nondiscrete_normed_field π] {E : Type u_2} [normed_group E] [normed_space π E] {F : Type u_3} [normed_group F] [normed_space π F] {n : with_top β} {f g : E β F} (hf : times_cont_diff π n f) (hg : times_cont_diff π n g) :
times_cont_diff π n (Ξ» (x : E), f x + g x)

The sum of two `C^n`functions is `C^n`.

theorem times_cont_diff_on.add {π : Type u_1} [nondiscrete_normed_field π] {E : Type u_2} [normed_group E] [normed_space π E] {F : Type u_3} [normed_group F] [normed_space π F] {n : with_top β} {s : set E} {f g : E β F} (hf : n f s) (hg : n g s) :
n (Ξ» (x : E), f x + g x) s

The sum of two `C^n` functions on a domain is `C^n`.

### Negative #

theorem times_cont_diff_neg {π : Type u_1} [nondiscrete_normed_field π] {F : Type u_3} [normed_group F] [normed_space π F] {n : with_top β} :
times_cont_diff π n (Ξ» (p : F), -p)
theorem times_cont_diff_within_at.neg {π : Type u_1} [nondiscrete_normed_field π] {E : Type u_2} [normed_group E] [normed_space π E] {F : Type u_3} [normed_group F] [normed_space π F] {x : E} {n : with_top β} {s : set E} {f : E β F} (hf : f s x) :
(Ξ» (x : E), -f x) s x

The negative of a `C^n` function within a domain at a point is `C^n` within this domain at this point.

theorem times_cont_diff_at.neg {π : Type u_1} [nondiscrete_normed_field π] {E : Type u_2} [normed_group E] [normed_space π E] {F : Type u_3} [normed_group F] [normed_space π F] {x : E} {n : with_top β} {f : E β F} (hf : n f x) :
n (Ξ» (x : E), -f x) x

The negative of a `C^n` function at a point is `C^n` at this point.

theorem times_cont_diff.neg {π : Type u_1} [nondiscrete_normed_field π] {E : Type u_2} [normed_group E] [normed_space π E] {F : Type u_3} [normed_group F] [normed_space π F] {n : with_top β} {f : E β F} (hf : times_cont_diff π n f) :
times_cont_diff π n (Ξ» (x : E), -f x)

The negative of a `C^n`function is `C^n`.

theorem times_cont_diff_on.neg {π : Type u_1} [nondiscrete_normed_field π] {E : Type u_2} [normed_group E] [normed_space π E] {F : Type u_3} [normed_group F] [normed_space π F] {n : with_top β} {s : set E} {f : E β F} (hf : n f s) :
n (Ξ» (x : E), -f x) s

The negative of a `C^n` function on a domain is `C^n`.

### Subtraction #

theorem times_cont_diff_within_at.sub {π : Type u_1} [nondiscrete_normed_field π] {E : Type u_2} [normed_group E] [normed_space π E] {F : Type u_3} [normed_group F] [normed_space π F] {x : E} {n : with_top β} {s : set E} {f g : E β F} (hf : f s x) (hg : g s x) :
(Ξ» (x : E), f x - g x) s x

The difference of two `C^n` functions within a set at a point is `C^n` within this set at this point.

theorem times_cont_diff_at.sub {π : Type u_1} [nondiscrete_normed_field π] {E : Type u_2} [normed_group E] [normed_space π E] {F : Type u_3} [normed_group F] [normed_space π F] {x : E} {n : with_top β} {f g : E β F} (hf : n f x) (hg : n g x) :
n (Ξ» (x : E), f x - g x) x

The difference of two `C^n` functions at a point is `C^n` at this point.

theorem times_cont_diff_on.sub {π : Type u_1} [nondiscrete_normed_field π] {E : Type u_2} [normed_group E] [normed_space π E] {F : Type u_3} [normed_group F] [normed_space π F] {n : with_top β} {s : set E} {f g : E β F} (hf : n f s) (hg : n g s) :
n (Ξ» (x : E), f x - g x) s

The difference of two `C^n` functions on a domain is `C^n`.

theorem times_cont_diff.sub {π : Type u_1} [nondiscrete_normed_field π] {E : Type u_2} [normed_group E] [normed_space π E] {F : Type u_3} [normed_group F] [normed_space π F] {n : with_top β} {f g : E β F} (hf : times_cont_diff π n f) (hg : times_cont_diff π n g) :
times_cont_diff π n (Ξ» (x : E), f x - g x)

The difference of two `C^n` functions is `C^n`.

### Sum of finitely many functions #

theorem times_cont_diff_within_at.sum {π : Type u_1} [nondiscrete_normed_field π] {E : Type u_2} [normed_group E] [normed_space π E] {F : Type u_3} [normed_group F] [normed_space π F] {ΞΉ : Type u_4} {f : ΞΉ β E β F} {s : finset ΞΉ} {n : with_top β} {t : set E} {x : E} (h : β (i : ΞΉ), i β s β (Ξ» (x : E), f i x) t x) :
(Ξ» (x : E), β (i : ΞΉ) in s, f i x) t x
theorem times_cont_diff_at.sum {π : Type u_1} [nondiscrete_normed_field π] {E : Type u_2} [normed_group E] [normed_space π E] {F : Type u_3} [normed_group F] [normed_space π F] {ΞΉ : Type u_4} {f : ΞΉ β E β F} {s : finset ΞΉ} {n : with_top β} {x : E} (h : β (i : ΞΉ), i β s β n (Ξ» (x : E), f i x) x) :
n (Ξ» (x : E), β (i : ΞΉ) in s, f i x) x
theorem times_cont_diff_on.sum {π : Type u_1} [nondiscrete_normed_field π] {E : Type u_2} [normed_group E] [normed_space π E] {F : Type u_3} [normed_group F] [normed_space π F] {ΞΉ : Type u_4} {f : ΞΉ β E β F} {s : finset ΞΉ} {n : with_top β} {t : set E} (h : β (i : ΞΉ), i β s β n (Ξ» (x : E), f i x) t) :
n (Ξ» (x : E), β (i : ΞΉ) in s, f i x) t
theorem times_cont_diff.sum {π : Type u_1} [nondiscrete_normed_field π] {E : Type u_2} [normed_group E] [normed_space π E] {F : Type u_3} [normed_group F] [normed_space π F] {ΞΉ : Type u_4} {f : ΞΉ β E β F} {s : finset ΞΉ} {n : with_top β} (h : β (i : ΞΉ), i β s β times_cont_diff π n (Ξ» (x : E), f i x)) :
times_cont_diff π n (Ξ» (x : E), β (i : ΞΉ) in s, f i x)

### Product of two functions #

theorem times_cont_diff_mul {π : Type u_1} [nondiscrete_normed_field π] {n : with_top β} :
times_cont_diff π n (Ξ» (p : π Γ π), (p.fst) * p.snd)
theorem times_cont_diff_within_at.mul {π : Type u_1} [nondiscrete_normed_field π] {E : Type u_2} [normed_group E] [normed_space π E] {x : E} {n : with_top β} {s : set E} {f g : E β π} (hf : f s x) (hg : g s x) :
(Ξ» (x : E), (f x) * g x) s x

The product of two `C^n` functions within a set at a point is `C^n` within this set at this point.

theorem times_cont_diff_at.mul {π : Type u_1} [nondiscrete_normed_field π] {E : Type u_2} [normed_group E] [normed_space π E] {x : E} {n : with_top β} {f g : E β π} (hf : n f x) (hg : n g x) :
n (Ξ» (x : E), (f x) * g x) x

The product of two `C^n` functions at a point is `C^n` at this point.

theorem times_cont_diff_on.mul {π : Type u_1} [nondiscrete_normed_field π] {E : Type u_2} [normed_group E] [normed_space π E] {n : with_top β} {s : set E} {f g : E β π} (hf : n f s) (hg : n g s) :
n (Ξ» (x : E), (f x) * g x) s

The product of two `C^n` functions on a domain is `C^n`.

theorem times_cont_diff.mul {π : Type u_1} [nondiscrete_normed_field π] {E : Type u_2} [normed_group E] [normed_space π E] {n : with_top β} {f g : E β π} (hf : times_cont_diff π n f) (hg : times_cont_diff π n g) :
times_cont_diff π n (Ξ» (x : E), (f x) * g x)

The product of two `C^n`functions is `C^n`.

theorem times_cont_diff_within_at.div_const {π : Type u_1} [nondiscrete_normed_field π] {E : Type u_2} [normed_group E] [normed_space π E] {s : set E} {x : E} {f : E β π} {n : with_top β} {c : π} (hf : f s x) :
(Ξ» (x : E), f x / c) s x
theorem times_cont_diff_at.div_const {π : Type u_1} [nondiscrete_normed_field π] {E : Type u_2} [normed_group E] [normed_space π E] {x : E} {f : E β π} {n : with_top β} {c : π} (hf : n f x) :
n (Ξ» (x : E), f x / c) x
theorem times_cont_diff_on.div_const {π : Type u_1} [nondiscrete_normed_field π] {E : Type u_2} [normed_group E] [normed_space π E] {s : set E} {f : E β π} {n : with_top β} {c : π} (hf : n f s) :
n (Ξ» (x : E), f x / c) s
theorem times_cont_diff.div_const {π : Type u_1} [nondiscrete_normed_field π] {E : Type u_2} [normed_group E] [normed_space π E] {f : E β π} {n : with_top β} {c : π} (hf : times_cont_diff π n f) :
times_cont_diff π n (Ξ» (x : E), f x / c)
theorem times_cont_diff.pow {π : Type u_1} [nondiscrete_normed_field π] {E : Type u_2} [normed_group E] [normed_space π E] {n : with_top β} {f : E β π} (hf : times_cont_diff π n f) (m : β) :
times_cont_diff π n (Ξ» (x : E), f x ^ m)
theorem times_cont_diff_at.pow {π : Type u_1} [nondiscrete_normed_field π] {E : Type u_2} [normed_group E] [normed_space π E] {x : E} {n : with_top β} {f : E β π} (hf : n f x) (m : β) :
n (Ξ» (y : E), f y ^ m) x
theorem times_cont_diff_within_at.pow {π : Type u_1} [nondiscrete_normed_field π] {E : Type u_2} [normed_group E] [normed_space π E] {s : set E} {x : E} {n : with_top β} {f : E β π} (hf : f s x) (m : β) :
(Ξ» (y : E), f y ^ m) s x
theorem times_cont_diff_on.pow {π : Type u_1} [nondiscrete_normed_field π] {E : Type u_2} [normed_group E] [normed_space π E] {s : set E} {n : with_top β} {f : E β π} (hf : n f s) (m : β) :
n (Ξ» (y : E), f y ^ m) s

### Scalar multiplication #

theorem times_cont_diff_smul {π : Type u_1} [nondiscrete_normed_field π] {F : Type u_3} [normed_group F] [normed_space π F] {n : with_top β} :
times_cont_diff π n (Ξ» (p : π Γ F), p.fst β’ p.snd)
theorem times_cont_diff_within_at.smul {π : Type u_1} [nondiscrete_normed_field π] {E : Type u_2} [normed_group E] [normed_space π E] {F : Type u_3} [normed_group F] [normed_space π F] {x : E} {n : with_top β} {s : set E} {f : E β π} {g : E β F} (hf : f s x) (hg : g s x) :
(Ξ» (x : E), f x β’ g x) s x

The scalar multiplication of two `C^n` functions within a set at a point is `C^n` within this set at this point.

theorem times_cont_diff_at.smul {π : Type u_1} [nondiscrete_normed_field π] {E : Type u_2} [normed_group E] [normed_space π E] {F : Type u_3} [normed_group F] [normed_space π F] {x : E} {n : with_top β} {f : E β π} {g : E β F} (hf : n f x) (hg : n g x) :
n (Ξ» (x : E), f x β’ g x) x

The scalar multiplication of two `C^n` functions at a point is `C^n` at this point.

theorem times_cont_diff.smul {π : Type u_1} [nondiscrete_normed_field π] {E : Type u_2} [normed_group E] [normed_space π E] {F : Type u_3} [normed_group F] [normed_space π F] {n : with_top β} {f : E β π} {g : E β F} (hf : times_cont_diff π n f) (hg : times_cont_diff π n g) :
times_cont_diff π n (Ξ» (x : E), f x β’ g x)

The scalar multiplication of two `C^n` functions is `C^n`.

theorem times_cont_diff_on.smul {π : Type u_1} [nondiscrete_normed_field π] {E : Type u_2} [normed_group E] [normed_space π E] {F : Type u_3} [normed_group F] [normed_space π F] {n : with_top β} {s : set E} {f : E β π} {g : E β F} (hf : n f s) (hg : n g s) :
n (Ξ» (x : E), f x β’ g x) s

The scalar multiplication of two `C^n` functions on a domain is `C^n`.

### Cartesian product of two functions #

theorem times_cont_diff_within_at.prod_map' {π : Type u_1} [nondiscrete_normed_field π] {E : Type u_2} [normed_group E] [normed_space π E] {F : Type u_3} [normed_group F] [normed_space π F] {E' : Type u_5} [normed_group E'] [normed_space π E'] {F' : Type u_6} [normed_group F'] [normed_space π F'] {n : with_top β} {s : set E} {t : set E'} {f : E β F} {g : E' β F'} {p : E Γ E'} (hf : f s p.fst) (hg : g t p.snd) :
(prod.map f g) (s.prod t) p

The product map of two `C^n` functions within a set at a point is `C^n` within the product set at the product point.

theorem times_cont_diff_within_at.prod_map {π : Type u_1} [nondiscrete_normed_field π] {E : Type u_2} [normed_group E] [normed_space π E] {F : Type u_3} [normed_group F] [normed_space π F] {E' : Type u_5} [normed_group E'] [normed_space π E'] {F' : Type u_6} [normed_group F'] [normed_space π F'] {n : with_top β} {s : set E} {t : set E'} {f : E β F} {g : E' β F'} {x : E} {y : E'} (hf : f s x) (hg : g t y) :
(prod.map f g) (s.prod t) (x, y)
theorem times_cont_diff_on.prod_map {π : Type u_1} [nondiscrete_normed_field π] {E : Type u_2} [normed_group E] [normed_space π E] {F : Type u_3} [normed_group F] [normed_space π F] {E' : Type u_4} [normed_group E'] [normed_space π E'] {F' : Type u_5} [normed_group F'] [normed_space π F'] {s : set E} {t : set E'} {n : with_top β} {f : E β F} {g : E' β F'} (hf : n f s) (hg : n g t) :
n (prod.map f g) (s.prod t)

The product map of two `C^n` functions on a set is `C^n` on the product set.

theorem times_cont_diff_at.prod_map {π : Type u_1} [nondiscrete_normed_field π] {E : Type u_2} [normed_group E] [normed_space π E] {F : Type u_3} [normed_group F] [normed_space π F] {E' : Type u_5} [normed_group E'] [normed_space π E'] {F' : Type u_6} [normed_group F'] [normed_space π F'] {n : with_top β} {f : E β F} {g : E' β F'} {x : E} {y : E'} (hf : n f x) (hg : n g y) :
n (prod.map f g) (x, y)

The product map of two `C^n` functions within a set at a point is `C^n` within the product set at the product point.

theorem times_cont_diff_at.prod_map' {π : Type u_1} [nondiscrete_normed_field π] {E : Type u_2} [normed_group E] [normed_space π E] {F : Type u_3} [normed_group F] [normed_space π F] {E' : Type u_5} [normed_group E'] [normed_space π E'] {F' : Type u_6} [normed_group F'] [normed_space π F'] {n : with_top β} {f : E β F} {g : E' β F'} {p : E Γ E'} (hf : n f p.fst) (hg : n g p.snd) :
n (prod.map f g) p

The product map of two `C^n` functions within a set at a point is `C^n` within the product set at the product point.

theorem times_cont_diff.prod_map {π : Type u_1} [nondiscrete_normed_field π] {E : Type u_2} [normed_group E] [normed_space π E] {F : Type u_3} [normed_group F] [normed_space π F] {E' : Type u_5} [normed_group E'] [normed_space π E'] {F' : Type u_6} [normed_group F'] [normed_space π F'] {n : with_top β} {f : E β F} {g : E' β F'} (hf : times_cont_diff π n f) (hg : times_cont_diff π n g) :
times_cont_diff π n (prod.map f g)

The product map of two `C^n` functions is `C^n`.

### Inversion in a complete normed algebra #

theorem times_cont_diff_at_ring_inverse (π : Type u_1) [nondiscrete_normed_field π] {R : Type u_5} [normed_ring R] [normed_algebra π R] {n : with_top β} (x : units R) :

In a complete normed algebra, the operation of inversion is `C^n`, for all `n`, at each invertible element. The proof is by induction, bootstrapping using an identity expressing the derivative of inversion as a bilinear map of inversion itself.

theorem times_cont_diff_at_inv (π : Type u_1) [nondiscrete_normed_field π] {π' : Type u_6} [normed_field π'] [normed_algebra π π'] [complete_space π'] {x : π'} (hx : x β  0) {n : with_top β} :
x
theorem times_cont_diff_on_inv (π : Type u_1) [nondiscrete_normed_field π] {π' : Type u_6} [normed_field π'] [normed_algebra π π'] [complete_space π'] {n : with_top β} :
{0}αΆ
theorem times_cont_diff_within_at.inv {π : Type u_1} [nondiscrete_normed_field π] {E : Type u_2} [normed_group E] [normed_space π E] {s : set E} {x : E} {π' : Type u_6} [normed_field π'] [normed_algebra π π'] [complete_space π'] {f : E β π'} {n : with_top β} (hf : f s x) (hx : f x β  0) :
(Ξ» (x : E), (f x)β»ΒΉ) s x
theorem times_cont_diff_on.inv {π : Type u_1} [nondiscrete_normed_field π] {E : Type u_2} [normed_group E] [normed_space π E] {s : set E} {π' : Type u_6} [normed_field π'] [normed_algebra π π'] [complete_space π'] {f : E β π'} {n : with_top β} (hf : n f s) (h : β (x : E), x β s β f x β  0) :
n (Ξ» (x : E), (f x)β»ΒΉ) s
theorem times_cont_diff_at.inv {π : Type u_1} [nondiscrete_normed_field π] {E : Type u_2} [normed_group E] [normed_space π E] {x : E} {π' : Type u_6} [normed_field π'] [normed_algebra π π'] [complete_space π'] {f : E β π'} {n : with_top β} (hf : n f x) (hx : f x β  0) :
n (Ξ» (x : E), (f x)β»ΒΉ) x
theorem times_cont_diff.inv {π : Type u_1} [nondiscrete_normed_field π] {E : Type u_2} [normed_group E] [normed_space π E] {π' : Type u_6} [normed_field π'] [normed_algebra π π'] [complete_space π'] {f : E β π'} {n : with_top β} (hf : times_cont_diff π n f) (h : β (x : E), f x β  0) :
times_cont_diff π n (Ξ» (x : E), (f x)β»ΒΉ)
theorem times_cont_diff_within_at.div {π : Type u_1} [nondiscrete_normed_field π] {E : Type u_2} [normed_group E] [normed_space π E] {s : set E} {x : E} [complete_space π] {f g : E β π} {n : with_top β} (hf : f s x) (hg : g s x) (hx : g x β  0) :
(Ξ» (x : E), f x / g x) s x
theorem times_cont_diff_on.div {π : Type u_1} [nondiscrete_normed_field π] {E : Type u_2} [normed_group E] [normed_space π E] {s : set E} [complete_space π] {f g : E β π} {n : with_top β} (hf : n f s) (hg : n g s) (hβ : β (x : E), x β s β g x β  0) :
n (f / g) s
theorem times_cont_diff_at.div {π : Type u_1} [nondiscrete_normed_field π] {E : Type u_2} [normed_group E] [normed_space π E] {x : E} [complete_space π] {f g : E β π} {n : with_top β} (hf : n f x) (hg : n g x) (hx : g x β  0) :
n (Ξ» (x : E), f x / g x) x
theorem times_cont_diff.div {π : Type u_1} [nondiscrete_normed_field π] {E : Type u_2} [normed_group E] [normed_space π E] [complete_space π] {f g : E β π} {n : with_top β} (hf : times_cont_diff π n f) (hg : times_cont_diff π n g) (h0 : β (x : E), g x β  0) :
times_cont_diff π n (Ξ» (x : E), f x / g x)

### Inversion of continuous linear maps between Banach spaces #

theorem times_cont_diff_at_map_inverse {π : Type u_1} [nondiscrete_normed_field π] {E : Type u_2} [normed_group E] [normed_space π E] {F : Type u_3} [normed_group F] [normed_space π F] {n : with_top β} (e : E βL[π] F) :

At a continuous linear equivalence `e : E βL[π] F` between Banach spaces, the operation of inversion is `C^n`, for all `n`.

theorem local_homeomorph.times_cont_diff_at_symm {π : Type u_1} [nondiscrete_normed_field π] {E : Type u_2} [normed_group E] [normed_space π E] {F : Type u_3} [