gradient_coord
theoremverifiedformalizationimported Lean
The gradient of the i-th coordinate functional on Euclidean space is the i-th basis vector.
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 gradient_coord {ι : Type*} [Fintype ι] [DecidableEq ι] (i : ι) (x : EuclideanSpace ℝ ι) : gradient (fun y : EuclideanSpace ℝ ι => y i) x = EuclideanSpace.single i 1
- Formalizes
- Physlib, `gradient_coord`
- 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.gradient_coord← gradient_coord (Physlib/Mathematics/Calculus/Gradient.lean:211): verbatim
- Verified
- 09 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Used by 1
- hasGradientAt_coordThe gradient of the
i-th coordinate functional on Euclidean space is thei-th basis vector.
- hasGradientAt_coordThe gradient of the
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 the `i`-th coordinate functional on Euclidean space is the `i`-th basis vector. -/lemma gradient_coord {ι : Type*} [Fintype ι] [DecidableEq ι] (i : ι) (x : EuclideanSpace ℝ ι) : gradient (fun y : EuclideanSpace ℝ ι => y i) x = EuclideanSpace.single i 1 := by have h : HasFDerivAt (fun y : EuclideanSpace ℝ ι => y i) (innerSL ℝ (EuclideanSpace.single i (1 : ℝ))) x := (EuclideanSpace.proj (𝕜 := ℝ) i).hasFDerivAt.congr_fderiv (by ext y; simp [EuclideanSpace.inner_single_left]) exact h.hasGradientAt.gradient.trans ((toDual ℝ _).symm_apply_apply _)