Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passjudge pass (gpt-6-luna)
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 f:Rn→R be continuously differentiable and suppose ∇f is Lipschitz with constant L≥0 in the Euclidean norm. Then f(y)≤f(x)+⟨∇f(x),y−x⟩+L2∥y−x∥22(x,y∈Rn).

Facts & Assumptions

Given: The continuously differentiable function and Lipschitz-gradient bound in the Statement.

[F1]

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∈(a,b) with f(b)−f(a)=f′(c)(b−a): 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.

[F2]

The chain rule for total derivatives: D(g∘f)(a)=Dg(f(a))∘Df(a): along a differentiable line s↦x+sd, the derivative of f(x+sd) is ⟨∇f(x+sd),d⟩.

[F3]

Lipschitz map, α-Hölder map for rational 0<α≤1, and contraction: Lipschitz constant L means ∥∇f(u)−∇f(v)∥2≤L∥u−v∥2 for every u,v.

[F5]
[F6]

Laws of finite sums and finite products: finite sums obey recursion, additivity and scaling.

[F7]

The principle of mathematical induction: a property true at 0 and inherited by successors holds for every natural.

Proof

1.1givenF2

Put d=y−x. If d=0 the inequality is equality. Otherwise define ϕ(s)=f(x+sd) on [0,1]. By [F2] and continuity of ∇f, ϕ is continuous on [0,1], differentiable on (0,1), and ϕ′(s)=⟨∇f(x+sd),d⟩.

1.2givenF1F2F3F4F6F7algebrainduction

For an arbitrary natural N≥1, partition [0,1] at j/N. Applying [F1] on each subinterval gives ξj∈(j/N,(j+1)/N) with ϕ((j+1)/N)−ϕ(j/N)=ϕ′(ξj)/N. Telescoping and subtracting ϕ′(0) yields f(y)−f(x)−⟨∇f(x),d⟩=1N∑j=0N−1(ϕ′(ξj)−ϕ′(0))≤L∥d∥22N2∑j=0N−1(j+1)=L2(1+1/N)∥d∥22, because [F3] and [F4] give ∣ϕ′(s)−ϕ′(0)∣≤Ls∥d∥22 and ξj<(j+1)/N. To evaluate the finite sum for every natural N, its value is N(N+1)/2: at N=0 both sides are zero, and the recursion [F6] adds N+1 when N is increased by one, giving (N+1)(N+2)/2. [F7] proves this identity by induction. Only finitely many mean-value points are used for each fixed N.

2.1F5step 1.2assume-hypalgebra∎

The left side of the bound in step 1.2 is independent of N. Suppose it exceeded L∥d∥22/2 by δ>0. For L∥d∥22>0, [F5] lets us choose N with 1/N<2δ/(L∥d∥22), making the right side in step 1.2 strictly smaller than the left side, a contradiction. If L∥d∥22=0, step 1.2 already gives the desired bound.

Depends on

Used by

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