How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
Descent inequality for a Lipschitz gradient
Statement
Let be continuously differentiable and suppose is Lipschitz with constant in the Euclidean norm. Then
Facts & Assumptions
Given: The continuously differentiable function and Lipschitz-gradient bound in the Statement.
The mean value theorem, as the case of Cauchy's: for continuous on with and differentiable on there is with : a scalar function continuous on a closed interval and differentiable in its interior has an interior point where its derivative is the endpoint difference divided by the interval length.
The chain rule for total derivatives: : along a differentiable line , the derivative of is .
Lipschitz map, -Hölder map for rational , and contraction: Lipschitz constant means for every .
For every in a complete ordered field there is a natural with : for every there is with .
Laws of finite sums and finite products: finite sums obey recursion, additivity and scaling.
The principle of mathematical induction: a property true at and inherited by successors holds for every natural.
Proof
Put . If the inequality is equality. Otherwise define on . By [F2] and continuity of , is continuous on , differentiable on , and .
For an arbitrary natural , partition at . Applying [F1] on each subinterval gives with . Telescoping and subtracting yields because [F3] and [F4] give and . To evaluate the finite sum for every natural , its value is : at both sides are zero, and the recursion [F6] adds when is increased by one, giving . [F7] proves this identity by induction. Only finitely many mean-value points are used for each fixed .
The left side of the bound in step 1.2 is independent of . Suppose it exceeded by . For , [F5] lets us choose with , making the right side in step 1.2 strictly smaller than the left side, a contradiction. If , step 1.2 already gives the desired bound.
Depends on
- Lipschitz map, $\alpha$-Hölder map for rational $0 < \alpha \le 1$, and contraction
- The Euclidean inner product $\langle x,y\rangle = \sum_{k<n} x_k y_k$ on $\mathbb{R}^n$
- The chain rule for total derivatives: $D(g\circ f)(a)=Dg(f(a))\circ Df(a)$
- Cauchy-Schwarz $\lvert\langle x,y\rangle\rvert \le \lVert x\rVert_2\lVert y\rVert_2$ with its equality case, the triangle inequality for $\lVert\cdot\rVert_2$, the parallelogram law and polarisation
- The mean value theorem, as the case $g(x) = x$ of Cauchy's: for $f$ continuous on $[a,b]$ with $a < b$ and differentiable on $(a,b)$ there is $c \in (a,b)$ with $f(b) - f(a) = f'(c)(b-a)$
- For every $\varepsilon > 0$ in a complete ordered field there is a natural $n \ge 1$ with $1/n < \varepsilon$
- Laws of finite sums and finite products
- The principle of mathematical induction
Used by
- Cocoercive gradient bound for a convex smooth finite sum Lemma
- One-step estimate for a certified inexact proximal call Lemma
- One-step proximal-gradient estimate Lemma
- Biased SGD has an explicit weighted stationarity floor Theorem
- Expected linear contraction of an SVRG epoch Theorem
- Last-iterate SGD rate for smooth strongly convex objectives Theorem
- Nonconvex SGD stationarity bound for a uniform randomized iterate Theorem
- SAGA constant-step linear contraction with a memory-capped factor Theorem
- SAGA expected linear contraction with a memory-scaled step size Theorem
- Summably biased SPSA has convergent objective values and zero gradient liminf Theorem
Dependency tree · two levels
57 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.
Sources
- Neal Parikh and Stephen Boyd, Proximal Algorithms, §4.2 (standard reference, not scraped)
- Stephen Boyd and Lieven Vandenberghe, Convex Optimization, §9.3.1 (standard reference, not scraped)