Theorems · Theorem · real analysis

norm_iteratedFDeriv_clm_apply

∀ {𝕜 : Type u_1} [inst : NontriviallyNormedField 𝕜] {E : Type uE} [inst_1 : NormedAddCommGroup E]
  [inst_2 : NormedSpace 𝕜 E] {F : Type uF} [inst_3 : NormedAddCommGroup F] [inst_4 : NormedSpace 𝕜 F] {G : Type uG}
  [inst_5 : NormedAddCommGroup G] [inst_6 : NormedSpace 𝕜 G] {f : E → F →L[𝕜] G} {g : E → F} {N : WithTop ℕ∞} {n : ℕ},
  ContDiff 𝕜 N f →
    ContDiff 𝕜 N g →
      ∀ (x : E),
        ↑n ≤ N →
          ‖iteratedFDeriv 𝕜 n (fun y => (f y) (g y)) x‖ ≤
            ∑ i ∈ Finset.range (n + 1), ↑(n.choose i) * ‖iteratedFDeriv 𝕜 i f x‖ * ‖iteratedFDeriv 𝕜 (n - i) g x‖

Defined in

Mathlib.Analysis.Calculus.ContDiff.Bounds

Cited by

0 results in Mathlib

Foundations

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

Assumes

NontriviallyNormedFieldNormedAddCommGroupNormedSpaceNormedAddCommGroupNormedSpaceNormedAddCommGroupNormedSpace