Alphabeta Math
LemmaStatement: AI-generatedProof: AI-generated
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.

Conditional gradient inequality gives a length bound

Statement

Let f∈C2(U) on open U⊆Rm, m≥1, and z∈U. Suppose on an open neighborhood W⊂U of z one has f≥f(z) and ∥∇f(y)∥≥c∣f(y)−f(z)∣ρ,c>0,0<ρ<1. For any downward Euclidean gradient trajectory remaining in W on [a,b], its length is at most (f(x(a))−f(z))1−ρ−(f(x(b))−f(z))1−ρc(1−ρ). This statement assumes the displayed inequality; it does not assert it for arbitrary C2 functions.

Facts & Assumptions

[F1]

We use the closed-interval C1 trajectory convention, the Euclidean gradient, and the length integral specified in Energy identity and displacement for Euclidean gradient trajectories. Thus x is continuous on [a,b], differentiable on (a,b), and x′ has a continuous extension to [a,b]. A degenerate interval has length zero.

[F2]

Real powers for positive bases, with the zero-base positive-exponent convention defines sβ=exp⁡(βlog⁡s) for s>0 and 0β=0 for β>0. The exponential is positive and satisfies exp(-x)=1/exp(x) makes every positive-base power positive. Continuity and derivatives of positive-base real powers supplies continuity and the derivative βsβ−1 on (0,∞); The exponent, product, quotient, and iterated-power laws for positive real bases and real exponents supplies the iterated-power law. The extension to zero is proved below, rather than assumed from the positive-base theorem.

[F3]

A continuous function on [a,b] is Riemann integrable, by Heine-Cantor and Riemann's criterion gives boundedness and Riemann integrability for continuous real functions on nondegenerate compact intervals. If f ≤ g on [a,b] and both are integrable then ∫ₐᵇ f ≤ ∫ₐᵇ g; and m(b-a) ≤ ∫ₐᵇ f ≤ M(b-a) gives nonnegativity, comparison, and the two-sided constant bounds for integrals. Integrable functions on [a,b] form a set closed under sums and scalar multiples, and ∫ₐᵇ(λ f+μ g) = λ∫ₐᵇ f + μ∫ₐᵇ g permits scalar factors to be taken outside an integral. Newton–Leibniz needs only continuity on [a,b], differentiability on (a,b), and a Riemann-integrable extension of the interior derivative applies to a continuous function whose interior derivative has an integrable extension.

[F4]

For an integrable speed g on [a,b], The integral function F(x) := ∫ₐˣ f of an integrable f defines L(t)=∫atg(s) ds, including L(a)=0, and gives L(v)−L(u)=∫uvg(s) ds. If ∣g∣≤K, The integral function of a bounded integrable f is Lipschitz, hence uniformly continuous gives ∣L(v)−L(u)∣≤K∣v−u∣, so L is continuous at the endpoints as well.

Proof

Given: The data and hypotheses in the Statement.

Goal: Prove the asserted length bound, including zero energy levels.

1.1F2F6given

For any β>0, the positive-base power has strictly positive derivative by [F2], so the mean value theorem makes s↦sβ strictly increasing on (0,∞). Given ε>0, put δ=ε1/β>0. If 0<s<δ, the iterated-power law gives 0<sβ<δβ=ε; for s=0 the zero-base convention gives the same upper bound. Thus sβ→0 as s↓0, and the defined power is continuous on [0,∞). This applies to both β=ρ and β=1−ρ.

1.2F1F2F6given

If a=b, both the length and the stated numerator are zero. Hence assume a<b. Write h(t)=f(x(t))−f(z)≥0 and g(t)=∥∇f(x(t))∥. The energy identity, or its interior chain-rule calculation, gives h′=−g2 and ∥x′∥=g; h and g are continuous on [a,b]. Where h>0, the power derivative, chain rule, and g≥chρ give −(h1−ρ)′=(1−ρ)h−ρg2≥c(1−ρ)g.

1.3F1F3F4F5F6given

At any q∈W with f(q)=f(z), openness of W and f≥f(z) make q a local minimum. For each coordinate, the positive and negative difference quotients at q have opposite weak signs; existence of the partial derivative forces it to be zero. Thus ∇f(q)=0 and the constant curve through q solves the gradient equation. The gradient is locally Lipschitz: on a small closed ball in U, each continuous second partial derivative is bounded by compactness and extreme values; applying the chain rule and the one-variable mean value estimate along segments bounds each first-partial increment by a constant times the distance. Combining the finitely many coordinate bounds gives a Lipschitz bound for the gradient. ODE uniqueness therefore makes the given trajectory constant for the rest of [a,b] after any time at which h=0. Its speed and all subsequent length increments are zero.

2.1F2F3step 1.2

On a nondegenerate closed subinterval [u,v]⊆[a,b] where h>0, both g and d(t)=(1−ρ)h(t)−ρg(t)2 are continuous, hence integrable. Newton–Leibniz applies to −h1−ρ with derivative extension d. Integral comparison and scalar linearity therefore give c(1−ρ)∫uvg(t) dt≤∫uvd(t) dt=h(u)1−ρ−h(v)1−ρ.

2.2F3F4step 1.2

On the whole interval, continuity of g gives integrability and a finite bound 0≤g≤K. The integral function L(t)=∫atg(s) ds is therefore defined and satisfies ∣L(v)−L(u)∣≤K∣v−u∣. In particular, L(t)→L(τ) as t↑τ, for every a<τ≤b.

3.1F3F4F5step 1.1step 1.2step 2.1step 2.2step 1.3∎

If h(a)=0, step 1.3 gives length zero and h(b)=0, proving the bound. Otherwise h(a)>0. If h has no zero on [a,b], use step 2.1 with u=a and v=b. If it has a zero, its zero set is closed by continuity, bounded, and nonempty; compactness and the minimum of the identity function give its first element τ>a. For a<t<τ, step 2.1 gives c(1−ρ)L(t)≤h(a)1−ρ−h(t)1−ρ. As t↑τ, continuity of h, the zero-endpoint power limit in step 1.1, and step 2.2 give c(1−ρ)L(τ)≤h(a)1−ρ. Step 1.3 gives L(b)=L(τ) and h(b)=0. Dividing by c(1−ρ)>0 proves exactly the asserted estimate in every case.

Depends on

Used by · 1

Dependency tree · 2 levels

Each result is drawn at its shortest distance from this item. Arrows run from prerequisites to the items that use them; this item has a heavier outline. External source nodes link directly to the cited text. The view shows up to two dependency steps; open a prerequisite to continue.