Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge 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.

A lower-bounded semiconvex Hilbert energy generates a unique gradient flow

Statement

Assume AC. Let H be a separable real Hilbert space and let E:H→(−∞,+∞] be proper, lower semicontinuous, bounded below, and λ-convex, meaning E((1−t)x+ty)≤(1−t)E(x)+tE(y)−λ2t(1−t)∥x−y∥H2(0≤t≤1). For x∈dom⁡E, define ∂λE(x)={ξ∈H:E(y)≥E(x)+⟨ξ,y−x⟩H+λ2∥y−x∥H2 for every y∈H}. For every x0∈dom⁡E, there is a unique curve x:[0,∞)→H which is absolutely continuous with square-integrable derivative on every bounded interval, satisfies x(0)=x0 and −x˙(t)∈∂λE(x(t)) for almost every t, and obeys E(x(t))−E(x(s))=−∫st∥x˙(r)∥H2 dr(0≤s≤t<∞). For almost every t, −x˙(t) is the unique minimum-norm element of ∂λE(x(t)). For two such curves x,x~ with initial values x0,x~0, ∥x(t)−x~(t)∥H≤e−λt∥x0−x~0∥H.

Facts & Assumptions

Given: AC, a separable real Hilbert space H, a proper lower-semicontinuous bounded-below λ-convex energy E, and x0 with E(x0)<∞.

[F1]

The Bochner space Z=L2((0,T);H) is a separable Hilbert space. Bochner L2 on a finite interval is a separable Hilbert space

[F2]

If a continuous Hilbert-valued path has finite partition energy, it is an AC² path with a Bochner derivative and its squared derivative integral equals that partition energy. Finite partition energy yields Hilbert-valued AC2 paths

[F3]

A bounded linear functional on a Hilbert space has a unique Riesz representative. Riesz representation for Hilbert spaces

[F6]

Fatou's lemma passes lower bounds through pointwise limits of nonnegative measurable functions. Fatou's lemma

[F8]

Scalar locally integrable functions are recovered almost everywhere by centered interval averages. Lebesgue differentiation theorem on Rn

[F9]

The indefinite integral of an integrable real function is absolutely continuous. The indefinite integral of an L1 function is absolutely continuous

[F10]

The indefinite integral of an integrable real function has that function as its derivative almost everywhere. The indefinite integral of an L1 function is differentiable almost everywhere

Given: AC, H,E,λ, and x0 as in the Statement.

Proof

1.1givenF4construct

For 0<τ with 1+λτ>0 and z∈H, set Ψτ,z(y)=E(y)+∥y−z∥H2/(2τ). It is lower semicontinuous and (λ+1/τ)-strongly convex, with positive strong-convexity coefficient. It is bounded below and coercive because E is bounded below. Choose a minimizing sequence (yn) using [F4]. The midpoint inequality Ψτ,z ⁣(yn+ym2)≤Ψτ,z(yn)+Ψτ,z(ym)2−1+λτ8τ∥yn−ym∥H2 and the lower bound by the infimum show that (yn) is Cauchy. Completeness of H and lower semicontinuity give a minimizer, and strong convexity makes it unique. Call it Jτz. For 0<h<1, set yh=(1−h)Jτz+hy. Minimality at yh, the λ-convex inequality, and expansion of the quadratic term give 0≤h(E(y)−E(Jτz))−λ2h(1−h)∥y−Jτz∥H2−hτ⟨z−Jτz,y−Jτz⟩H+h22τ∥y−Jτz∥H2. Divide by h and let h↓0 to obtain E(y)≥E(Jτz)+⟨z−Jτzτ,y−Jτz⟩H+λ2∥y−Jτz∥H2, so (z−Jτz)/τ∈∂λE(Jτz).

2.1givenstep 1.1

Starting at x0, iterate xn=Jτxn−1. Comparison with the admissible point xn−1 gives E(xn)+∥xn−xn−1∥H22τ≤E(xn−1). Thus E(xn) decreases and, for m=inf⁡HE, ∑nτ∥(xn−1−xn)/τ∥H2≤2(E(x0)−m).

3.1F1F5step 2.1

Let xτ be the linear interpolation between the iterates and xˉτ(t)=xn on (tn−1,tn]; then x˙τ=−ξτ and ξτ(t)∈∂λE(xˉτ(t)). The action bound in step 2.1 gives ∥ξτ∥L2(0,T;H)2≤2(E(x0)−m) and ∥xτ−xˉτ∥L∞(0,T;H)≤τ∥ξτ∥L2(0,T;H). For two uniform meshes τ,σ, put δτ=xτ−xˉτ and q(t)=∥xτ(t)−xσ(t)∥H2. The subgradient monotonicity obtained by adding the defining inequalities for ∂λE gives 12q′(t)≤−λ∥xˉτ(t)−xˉσ(t)∥H2+(∥ξτ(t)∥H+∥ξσ(t)∥H)(∥δτ(t)∥H+∥δσ(t)∥H). Using ∥δτ(t)∥H≤τ∥ξτ(t)∥H on each step and Cauchy–Schwarz in time, the interpolation-error terms obey ∫0T(∥ξτ∥+∥ξσ∥)(∥δτ∥+∥δσ∥)dt≤2(τ+σ)(∥ξτ∥L22+∥ξσ∥L22),∫0T∥δτ−δσ∥2dt≤2τ2∥ξτ∥L22+2σ2∥ξσ∥L22. When λ≥0 its term in the differential inequality is nonpositive; when λ<0, ∥xˉτ−xˉσ∥2≤2q+2∥δτ−δσ∥2 bounds it by 2∣λ∣q+2∣λ∣∥δτ−δσ∥2. Since the action norms are uniformly bounded by step 2.1, for 0<τ,σ≤1 the differential inequality has the form q′(t)≤4∣λ∣q(t)+r(t), q(0)=0, with ∫0Tr(t)dt≤C(τ+σ) and C depending only on T,λ,E(x0)−m. Multiplying by e−4∣λ∣t and integrating yields sup⁡t≤Tq(t)≤CT(τ+σ), so the interpolants converge uniformly on every bounded time interval.

4.1F1F2F3F7step 3.1

Let x be the uniform limit. Every finite partition P satisfies ∑[a,b]∈P∥x(b)−x(a)∥H2/(b−a)≤lim inf⁡τ↓0∫0T∥x˙τ∥H2≤2(E(x0)−m), by Cauchy–Schwarz on each mesh interval and uniform convergence. [F2] gives x∈AC2 and a derivative. The step functions ξτ are bounded in the separable Hilbert space [F1]; apply [F7] successively to their inner products with a countable dense family and take a diagonal subsequence. The limits define a bounded linear functional on the dense span, hence on the whole space, and [F3] represents its extension by ξ∈L2(0,T;H). Thus ξτ⇀ξ. Since xτ(t)−x0=−∫0tξτ(r)dr and the Bochner integral on (0,t) is a bounded linear map, weak convergence and uniform convergence imply x˙=−ξ. Also xˉτ→x uniformly.

5.1givenF6step 1.1step 4.1

For each fixed y with E(y)<∞, integrate the discrete inequality from step 1.1 over any measurable A⊂(0,T). Weak convergence of ξτ and uniform convergence of xˉτ pass the linear term to its limit; lower semicontinuity of E and Fatou's lemma [F6], applied to E(xˉτ)−m≥0, pass the energy term. Thus the subgradient inequality holds for almost every t, first for a countable dense subset of the graph (choose one graph point from each nonempty member of a countable base of H×R, using [F4]) {(y,E(y)):E(y)<∞} and then for every such y by continuity in the graph variables. Hence ξ(t)∈∂λE(x(t)) almost everywhere.

5.2F1F5step 2.1step 4.1

Work on [0,T], choosing the construction on [0,T+1] to allow small time translations. Put u=x˙=−ξ and e(t)=E(x(t)). The discrete bound E(xˉτ(t))≤E(x0), uniform convergence and lower semicontinuity give m≤e(t)≤E(x0) for every t, where m=inf⁡HE. As a lower-semicontinuous function of time, e is measurable and bounded. Extend u and ξ by zero outside (0,T+1). Time translations are continuous in L2(R;H): this is immediate for interval step functions because the measure of the symmetric difference of an interval with its translate tends to zero, and holds for every L2 function by the density in [F1] and the isometry of translations. For 0<a<b<T and sufficiently small h>0, put qh(r)=(x(r+h)−x(r−h))/(2h)=(2h)−1∫−hhu(r+s)ds for a<r<b. Cauchy–Schwarz in the averaging variable and translation continuity give qh→u in L2(a,b;H) and sup⁡h∥qh∥L2(a,b;H)<∞. Indeed, ∫ab∥qh−u∥H2dr≤(2h)−1∫−hh∫ab∥u(r+s)−u(r)∥H2drds→0.

6.1F5step 5.1step 5.2

For each sufficiently small fixed h, the subgradient inequalities at x(r−h) and x(r+h) hold for almost every r∈(a,b) and imply ⟨ξ(r−h),qh(r)⟩H+λh∥qh(r)∥H2≤(e(r+h)−e(r−h))/(2h)≤⟨ξ(r+h),qh(r)⟩H−λh∥qh(r)∥H2. Both pairings converge in L1(a,b) to g(r)=⟨ξ(r),u(r)⟩H, since translations of ξ and qh converge in L2 and Cauchy–Schwarz bounds their products. The quadratic remainder has L1 norm at most ∣λ∣h∥qh∥L2(a,b;H)2→0. The sandwich therefore implies convergence of the entire centered energy quotient to g in L1(a,b): if Lh≤dh≤Uh, then ∣dh−g∣≤∣Lh−g∣+∣Uh−g∣ almost everywhere.

7.1F5F8F9F10step 6.1

For every 0<a<b<T the exact integral identity is ∫ab(e(r+h)−e(r−h))/(2h)dr=(2h)−1(∫b−hb+he(r)dr−∫a−ha+he(r)dr). By [F8] there is a full-measure set B⊂(0,T) on which centered averages recover e. For any a,b∈B with a<b, Step 6.1 and this exact identity give e(b)−e(a)=∫abg(r)dr. Fix a∗∈B and define e~(t)=e(a∗)+∫a∗tg(r)dr on [0,T]. Here g∈L1(0,T) by Cauchy–Schwarz. Thus [F9] makes e~ absolutely continuous and [F10] gives e~′=g almost everywhere, while the preceding equality implies e=e~ on B. This proves an absolutely continuous representative by an integral identity, without inferring it from an almost-everywhere derivative.

8.1F4F5step 5.1step 5.2step 7.1

Lower semicontinuity of e and continuity of e~ give e(t)≤e~(t) for every t∈[0,T] by approaching t through B. Fix t∈(0,T]. For sufficiently large n, put In=(t−2−n,t−2−n−1)⊂(0,T) and choose sn∈In∩B where the subgradient inclusion holds and ∥ξ(sn)∥H2≤2∣In∣−1∫In∥ξ(r)∥H2dr. Such points exist since the excluded set is null and the upper threshold exceeds the mean, with the zero-integral case treated by choosing a point where ξ=0. Since (t−sn)/∣In∣≤2, one has (t−sn)∥ξ(sn)∥H2≤4∫In∥ξ∥H2→0. Consequently ∣⟨ξ(sn),x(t)−x(sn)⟩H∣≤((t−sn)∥ξ(sn)∥H2)1/2(∫snt∥u∥H2)1/2→0. The subgradient inequality at sn gives e(t)≥e(sn)+⟨ξ(sn),x(t)−x(sn)⟩H+(λ/2)∥x(t)−x(sn)∥H2; using e(sn)=e~(sn) and continuity of x,e~ yields e(t)≥e~(t). At t=0, the bound e(r)≤E(x0) for all r and equality on B give e~(0)≤E(x0)=e(0), proving equality there too. Thus e=e~ on [0,T] and, for every 0≤s≤t≤T, E(x(t))−E(x(s))=∫st⟨ξ(r),u(r)⟩Hdr=−∫st∥x˙(r)∥H2dr. Since T is arbitrary this holds for all finite endpoints.

9.1step 8.1step 5.1

At almost every t, let ζ∈∂λE(x(t)). Applying its defining inequality to x(t+h) for positive and negative h, then using differentiability of x and e, gives ⟨ζ,x˙(t)⟩H=−∥x˙(t)∥H2. Since ξ=−x˙∈∂λE(x(t)), this says ⟨ζ−ξ,ξ⟩H=0 and hence ∥ζ∥H2=∥ξ∥H2+∥ζ−ξ∥H2. Thus ξ is the unique minimum-norm subgradient almost everywhere.

10.1step 5.1step 9.1∎

For two solutions, λ-semiconvexity implies ⟨ξ−ξ~,x−x~⟩H≥λ∥x−x~∥H2. Therefore 12ddt∥x−x~∥H2=−⟨ξ−ξ~,x−x~⟩H≤−λ∥x−x~∥H2 almost everywhere. Grönwall proves the stated estimate and uniqueness.

Depends on

Used by

Dependency tree · two levels

85 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