AFTD Auto-Formalizing Theoretical Domains

hasGradientAt_norm

theoremverifiedformalizationimported Lean

Away from the origin, the gradient of the norm is the unit vector ‖x‖⁻¹ • x.

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_norm (hx : x ≠ 0) : HasGradientAt (fun y : F => ‖y‖) (‖x‖⁻¹ • x) x
Formalizes
Physlib, `hasGradientAt_norm`
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.
Verified
09 Oct 2026
Axioms
Classical.choiceQuot.soundpropext
Built on 2

Lean source view module on GitHub

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/-- Away from the origin, the gradient of the norm is the unit vector `‖x‖⁻¹ • x`. -/lemma hasGradientAt_norm (hx : x ≠ 0) : HasGradientAt (fun y : F => ‖y‖) (‖x‖⁻¹ • x) x := by  have hs : ⟪x, x⟫_ℝ ≠ 0 := by simpa using hx  have h := (Real.hasDerivAt_sqrt hs).comp_hasGradientAt (hasGradientAt_inner_self x)  simp only [← norm_eq_sqrt_real_inner] at h  convert h using 1  rw [smul_smul]  congr 1  field_simp
See it in the graphDiscuss this resultChallenge it