A gradient flow reaches a small gradient
AutoSamplingTheory.TechnicalLemmas.Analysis.GradientFlowStationarity.exists_min_norm_le · theorem · Teaching coverage
Statement
Let E be a complete real inner-product space and f:E→R be C1. Supply a global minimizer z, a time T>0, and a curve X:R→E continuous on [0,T] whose right derivative equals minus the actual gradient of f at X(u), for each 0<=u<T. Then some s in [0,T] attains the smallest gradient norm on that entire interval and satisfies the displayed bound.
All objects and hypotheses
- Complete real inner-product space E; f is continuously Frechet differentiable (ContDiff R 1 f).
- A supplied z satisfies f(z)<=f(x) for every x:E; elapsed time T is strictly positive.
- X is continuous on [0,T]; for every u in [0,T), HasDerivWithinAt X (-gradient f(X(u))) (Ici u) u.
Mathematical proof
1. Attain the smallest gradient norm
The C1 assumption makes the Frechet derivative continuous. The Riesz inverse is continuous, so the actual gradient, and hence its norm along X, is continuous. The nonempty compact time interval therefore contains a minimizing time s. Put m=norm(gradient f(X(s))).
Corresponding Lean step
ContDiff.continuous_fderiv, continuity of InnerProductSpace.toDual.symm, and IsCompact.exists_isMinOn.
2. Derive the actual energy dissipation
Compose the Frechet derivative of f with the supplied right derivative of X. The gradient ODE makes the resulting inner product minus the squared gradient norm. Minimality of m bounds that derivative above by -m squared.
Corresponding Lean step
DifferentiableAt.hasGradientAt and HasFDerivAt.comp_hasDerivWithinAt derive the identity; sq_le_sq₀ compares nonnegative norms.
3. Use the available energy budget
Integrating this constant derivative bound gives f(X(T))<=f(X(0))-T m squared. In Lean the existing scalar right-slope Gronwall theorem with coefficient zero and forcing -m squared performs this comparison. The supplied minimum gives f(z)<=f(X(T)), so T m squared cannot exceed the initial objective gap.
Corresponding Lean step
le_gronwallBound_of_liminf_deriv_right_le with K=0, epsilon=-m²; gronwallBound_K0 and IsMinOn.
4. Convert to the gradient-norm rate
Divide by the strictly positive T, then take the nonnegative square root. Because s was chosen as a minimizer, this bounds the attained minimum over the whole time interval, not necessarily the gradient at its final time.
Corresponding Lean step
le_div_iff₀ and Real.le_sqrt; the global minimum supplies nonnegativity of the initial gap.
Lean statement · exists_min_norm_le
An attained time-interval minimum of gradient norm with the exact square-root objective-gap rate.
Braces mark parameters Lean can infer; square brackets request structures such as a measurable space or probability measure. Named hypotheses are mathematical premises, not facts established by this declaration. Section parameters are described in the mathematical hypotheses above; the module link retains their exact source context.
theorem exists_min_norm_le {f : E → ℝ} {X : ℝ → E} {z : E} {T : ℝ}
(hT : 0 < T) (hf : ContDiff ℝ 1 f) (hz : IsMinOn f univ z)
(hX : ContinuousOn X (Icc 0 T))
(hflow : ∀ t ∈ Ico 0 T, HasDerivWithinAt X (-gradient f (X t)) (Ici t) t) :
∃ s ∈ Icc 0 T, IsMinOn (fun u => ‖gradient f (X u)‖) (Icc 0 T) s ∧
‖gradient f (X s)‖ ≤ Real.sqrt ((f (X 0) - f z) / T)Lean proof · exists_min_norm_le
The C1 assumption makes the Frechet derivative continuous. The Riesz inverse is continuous, so the actual gradient, and hence its norm along X, is continuous. The nonempty compact time interval therefore contains a minimizing time s. Put m=norm(gradient f(X(s))). Compose the Frechet derivative of f with the supplied right derivative of X. The gradient ODE makes the resulting inner product minus the squared gradient norm. Minimality of m bounds that derivative above by -m squared. Integrating this constant derivative bound gives f(X(T))<=f(X(0))-T m squared. In Lean the existing scalar right-slope Gronwall theorem with coefficient zero and forcing -m squared performs this comparison. The supplied minimum gives f(z)<=f(X(T)), so T m squared cannot exceed the initial objective gap. Divide by the strictly positive T, then take the nonnegative square root. Because s was chosen as a minimizer, this bounds the attained minimum over the whole time interval, not necessarily the gradient at its final time.
Braces mark parameters Lean can infer; square brackets request structures such as a measurable space or probability measure. Named hypotheses are mathematical premises, not facts established by this declaration. Section parameters are described in the mathematical hypotheses above; the module link retains their exact source context.
theorem exists_min_norm_le {f : E → ℝ} {X : ℝ → E} {z : E} {T : ℝ}
(hT : 0 < T) (hf : ContDiff ℝ 1 f) (hz : IsMinOn f univ z)
(hX : ContinuousOn X (Icc 0 T))
(hflow : ∀ t ∈ Ico 0 T, HasDerivWithinAt X (-gradient f (X t)) (Ici t) t) :
∃ s ∈ Icc 0 T, IsMinOn (fun u => ‖gradient f (X u)‖) (Icc 0 T) s ∧
‖gradient f (X s)‖ ≤ Real.sqrt ((f (X 0) - f z) / T) := by
have hdf : Differentiable ℝ f := hf.differentiable (by norm_num)
have hcg : Continuous (gradient f) :=
(InnerProductSpace.toDual ℝ E).symm.continuous.comp (hf.continuous_fderiv (by norm_num))
obtain ⟨s, hs, hmin⟩ := isCompact_Icc.exists_isMinOn
(nonempty_Icc.mpr hT.le) (hcg.comp_continuousOn hX).norm
refine ⟨s, hs, hmin, ?_⟩
have hd (u : ℝ) (hu : u ∈ Ico 0 T) :
HasDerivWithinAt (fun v => f (X v)) (-‖gradient f (X u)‖ ^ 2) (Ici u) u := by
have hg : HasFDerivAt f (InnerProductSpace.toDual ℝ E (gradient f (X u))) (X u) :=
(hdf (X u)).hasGradientAt
simpa only [Function.comp_def, InnerProductSpace.toDual_apply_apply,
inner_neg_right, real_inner_self_eq_norm_sq] using
hg.comp_hasDerivWithinAt u (hflow u hu)
have hb := le_gronwallBound_of_liminf_deriv_right_le
(f' := fun u => -‖gradient f (X u)‖ ^ 2) (δ := f (X 0))
(K := 0) (ε := -‖gradient f (X s)‖ ^ 2)
(hf.continuous.comp_continuousOn hX)
(fun u hu r hr => by simpa [slope] using (hd u hu).liminf_right_slope_le hr)
le_rfl (fun u hu => by
have hm := hmin (show u ∈ Icc 0 T from ⟨hu.1, hu.2.le⟩)
have hsq := sq_le_sq₀ (norm_nonneg (gradient f (X s))) (norm_nonneg (gradient f (X u)))
simpa using (neg_le_neg (hsq.mpr hm))) T ⟨hT.le, le_rfl⟩
simp only [gronwallBound_K0, sub_zero] at hb
apply (Real.le_sqrt (norm_nonneg _) (div_nonneg
(sub_nonneg.mpr (hz (mem_univ _))) hT.le)).mpr
apply (le_div_iff₀ hT).mpr
have hzT : f z ≤ f (X T) := hz (mem_univ (X T))
change f (X T) ≤ _ at hb
nlinarith
end AutoSamplingTheory.TechnicalLemmas.Analysis.GradientFlowStationarityScope and omitted-condition boundaries
- Only positive elapsed time T is used in the finite normalized bound. The source 1/t formula implicitly requires t>0; no finite t=0 coefficient is assigned.
- The source C2 Euclidean setting is generalized to C1 on a complete real Hilbert space. A global minimizer z is retained, rather than replaced by a terminal lower bound. The supplied continuous trajectory satisfies only right derivatives on [0,T); no derivative at the final endpoint or negative time is needed.
- No convexity, smoothness constant, PL inequality, flow or minimizer existence theorem, last-time gradient estimate, infinite-time subsequence or convergence of the trajectory is asserted. The conclusion explicitly supplies an attained minimum of the actual gradient norm.
Source and reuse
ASTIS parents called
Mathlib API called (external library)
- ContDiff.continuous_fderiv
- IsCompact.exists_isMinOn
- HasFDerivAt.comp_hasDerivWithinAt
- HasDerivWithinAt.liminf_right_slope_le
- le_gronwallBound_of_liminf_deriv_right_le
- gronwallBound_K0
- Real.le_sqrt
Mathematical sources
- Chewi Corollary2.8 — Nonconvex gradient-norm rate; standing C2, attained-minimum and actual-flow conventions of Section2.
- Actual quadratic and constant trajectories — Nonstationary positive-gap and stationary zero-gap examples invoke the public theorem and retain the minimum witness.
ASTIS prose is not a quotation or a source-equivalence certificate. Definitions and aliases are explained as constructions, not counted as new mathematical proofs.