HasGradientAt.mul
theoremverifiedformalizationimported Lean
The gradient of a product is given by the Leibniz rule.
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in open InnerProductSpace in variable {F : Type*} [NormedAddCommGroup F] [InnerProductSpace ℝ F] [CompleteSpace F] {f g : F → ℝ} {f' g' : F} {x : F} in lemma HasGradientAt.mul (hf : HasGradientAt f f' x) (hg : HasGradientAt g g' x) : HasGradientAt (fun y => f y * g y) (f x • g' + g x • f') x
- Formalizes
- Physlib, `HasGradientAt.mul`
- Lean proof
- By Aadarsh Agarwal, Rithwik Ranganathan, from github.com/leanprover-community/physlib at
e411c6e89692(Copyright (c) 2026 Aadarsh Agarwal. All rights reserved, Apache-2.0). Compiled here against leanprover/lean4:v4.33.1, Mathlib v4.33.1; written for leanprover/lean4:v4.34.1.HasGradientAt.mul← HasGradientAt.mul (Physlib/Mathematics/Calculus/Gradient.lean:101): verbatim
- Verified
- 09 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext
Lean source view module on GitHub
Choose a tactic — a marked line — to see the goals Lean had before and after it, as in Lean’s infoview. Step with ← → or j k.
set_option autoImplicit true inset_option relaxedAutoImplicit true inopen InnerProductSpace invariable {F : Type*} [NormedAddCommGroup F] [InnerProductSpace ℝ F] [CompleteSpace F] {f g : F → ℝ} {f' g' : F} {x : F} in/-- The gradient of a product is given by the Leibniz rule. -/lemma HasGradientAt.mul (hf : HasGradientAt f f' x) (hg : HasGradientAt g g' x) : HasGradientAt (fun y => f y * g y) (f x • g' + g x • f') x := by rw [hasGradientAt_iff_hasFDerivAt] at * simp only [map_add, map_smul] exact hf.mul hg