Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-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 normalized parabolic Bellman equation has a bounded weak solution

Statement

Assume the Axiom of Choice. Let d≥1, λ>0, and let f:R×Rd→[0,∞) be bounded. Suppose that f is globally Lipschitz with constant Lf and that f(z)+Nf∣z∣2 is convex for some Nf≥0, where z=(t,x). Set n=d+1,V=∥f∥∞nλ,L=Lfnλ,N=Nfnλ. Define C={a∈Sym⁡d:a≥0, tr⁡a≤1},r(a)=1−tr⁡a,k(a)=(r(a)det⁡a)1/n. There is a globally L-Lipschitz function v:Rd+1→[0,V] such that v(z)+N∣z∣2 is convex. Its weak derivatives ∂tv, Div and Dijv, 1≤i,j≤d, exist and are bounded. They satisfy ∣Dzv∣≤L,−2NI≤Dx2v≤λvIalmost everywhere, and, outside one common null set, max⁡a∈C{r(a)∂tv+a:Dx2v−λv+k(a)f}=0. In particular, with S=λv−∂tv and H=λvI−Dx2v, S≥0,H≥0,Sdet⁡H=(fd+1)d+1almost everywhere. For each fixed a∈C, the corresponding linear expression is also nonpositive as a distribution.

The same v can be chosen below every bounded smooth function ψ for which ∂tψ,Dx2ψ are bounded and uniformly continuous and sup⁡a∈C{r(a)∂tψ+a:Dx2ψ−λψ+k(a)f}≤0everywhere.

Facts & Assumptions

Given: The Axiom of Choice; the dimension, discount and nonnegative bounded Lipschitz semiconvex data in the Statement. All integrals below use Euclidean Lebesgue measure.

[A1]

The Axiom of Choice implies Countable Choice. It permits simultaneous choices of eigenbases and the countable subsequence selections below. (The Axiom of Choice, AC implies DC implies countable choice)

[F1]

A locally semiconvex function on an open Euclidean set has a direction-uniform Peano quadratic expansion outside a null set. (Alexandrov second differentiability of locally semiconvex functions)

[F3]

Real L2 duality holds, and compactly supported smooth tests are dense in L2 of every open ball. (For 1<p<∞, the same representation theorem holds on arbitrary measure spaces, Smooth compactly supported functions of an open set are dense in L2)

[F4]

Ball averages recover each locally integrable real function almost everywhere. (Lebesgue differentiation theorem on Rn)

[F5]

Convolution with a compactly supported smooth unit-mass kernel is smooth, differentiates on the kernel, and approximates distributions. (Convolution with a mollifier is smooth, and derivatives pass under the integral sign, Mollifier approximation in distributions)

[F7]

AM–GM holds for finite nonnegative tuples, with equality exactly when all entries agree. (The arithmetic mean, geometric mean inequality)

[F8]

Integral Cauchy–Schwarz gives ∥u∥1≤∣B∣1/2∥u∥2 on a finite-measure ball and bounds mean absolute oscillation by mean-square oscillation. (Cauchy-Schwarz inequality for L2)

[F9]

Weak derivatives satisfy the signed compact-test identity and, when locally integrable, are unique almost everywhere under Countable Choice. (Weak derivative of a locally integrable function, Uniqueness of a weak derivative as an almost-everywhere class)

Proof

technique · positive discounted finite differences, preserved semiconvexity, weak-test bounds, and strict quadratic contacts
1.1A1F2construct

For each a∈C, choose unit eigenvectors ei(a) and eigenvalues si(a)≥0, so a=∑i=1dsi(a)ei(a)ei(a)T. For 0<h<1, define Lhau(t,x)=∑isi(a)h2(u(t,x+hei)−2u(t,x)+u(t,x−hei))+r(a)h(u(t+h,x)−u(t,x)). All off-center coefficients are nonnegative. Their sum is qh(a)=2tr⁡(a)/h2+r(a)/h.

1.2F3F8F9constructalgebra

We will use this elementary representation fact on a bounded open ball B: if a linear functional T on compact smooth tests satisfies ∣Tη∣≤C∥η∥1, it is integration against a function of absolute value at most C. Indeed, ∥η∥1≤∣B∣1/2∥η∥2 extends T continuously from the dense test subspace to L2(B). Real L2 duality represents it by g∈L2(B). The original L1 estimate extends to all L2 tests, because their L2 approximations also converge in L1. Test with sgn⁡(g)1{∣g∣>C+ϵ} to obtain a contradiction unless that set is null. Hence ∣g∣≤C. The unique local representatives agree on overlaps.

2.1step 1.1algebra

Write Lhau=Mhau−qh(a)u, where Mha is its off-center positive operator, and define Phu(z)=sup⁡a∈CMhau(z)+k(a)f(z)λ+qh(a). Put Qh=2h−2+h−1 and γh=Qh/(λ+Qh)<1. Positivity and Mha1=qh(a)≤Qh give ∥Phu−Phw∥∞≤γh∥u−w∥∞. The same argument bounds sup⁡(Phu−Phw)+ by γhsup⁡(u−w)+.

3.1step 2.1constructalgebra

Starting with u0=0, iterate uj+1=Phuj. The contraction bounds successive differences by a summable geometric sequence. Their sums converge uniformly to a bounded function vh, since a uniformly Cauchy sequence of bounded real functions has a bounded pointwise limit and converges uniformly. The contraction estimate gives Phvh=vh and uniqueness among bounded fixed points. Multiplying the individual residuals by their denominators, which lie in [λ,λ+Qh], shows that this is equivalent to sup⁡a∈C{Lhavh−λvh+k(a)f}=0.(1).

3.2step 1.1step 2.1givenalgebra

Let ψ be a supersolution as in the Statement. The centered second difference is an average of the corresponding directional second derivative, and the forward time difference is an average of ∂tψ. Bounded uniform continuity gives Eh→0 such that, uniformly in z and a, ∣Lhaψ−r(a)∂tψ−a:Dx2ψ∣≤Eh. For example, the sum of the spatial-Hessian and time-derivative moduli of continuity at scale h suffices, since r(a)+tr⁡a=1. Therefore Ψh=ψ+Eh/λ satisfies PhΨh≤Ψh.

4.1F7step 2.1step 3.1algebra

AM–GM applied to r(a),s1(a),…,sd(a), whose sum is 1, gives 0≤k(a)≤1/n. Hence Ph preserves 0≤u≤V: at the upper bound its numerator is at most qh(a)V+∥f∥∞/n=(λ+qh(a))V. Thus 0≤vh≤V.

5.1step 2.1step 3.1step 4.1given

If u has Lipschitz constant at most L, each affine control expression in Phu has Lipschitz constant at most qh(a)L+Lf/nλ+qh(a)≤L. A supremum preserves this common bound. Iteration and uniform convergence therefore make every vh globally L-Lipschitz.

5.2step 2.1step 3.1step 4.1givenalgebra

If u(z)+N∣z∣2 is convex, every translate of u has the same semiconvexity constant N. The numerator in each affine control expression has semiconvexity constant at most qh(a)N+Nf/n. After division this is at most N, since Nf/n=λN. Adding N∣z∣2 makes each expression convex; the translation corrections to its quadratic term are affine plus constants. Their supremum is convex. Starting from 0 and passing to the uniform limit proves that vh+N∣z∣2 is convex.

6.1A1F6step 4.1step 5.1step 5.2construct

Take a sequence hj↓0. Diagonally select a subsequence along which vhj converges at every rational point. Boundedness gives the successive subsequences, and finite rational nets plus the common Lipschitz constant give uniform convergence on every compact set. Call the limit v. It satisfies 0≤v≤V, the global L-Lipschitz bound, and convexity of v+N∣z∣2.

7.1step 2.1step 3.1step 6.1step 3.2algebra

The one-sided contraction estimate gives sup⁡(vh−Ψh)+≤γhsup⁡(vh−Ψh)+. The supremum is finite, so it vanishes. Pass along the chosen subsequence to obtain v≤ψ. This proves the comparison assertion for the same constructed limit.

7.2F9step 1.1step 3.1step 6.1algebra

Fix a∈C and a nonnegative compactly supported smooth test η. Equation (1) implies Lhavh−λvh+k(a)f≤0. Integrate against η and transfer translations to η. Its adjoint centered differences converge uniformly, on a common compact support, to the spatial second derivatives; its adjoint forward difference converges to −∂tη. Local uniform convergence of vh gives ∫v(a:Dx2η−r(a)∂tη−λη)+∫k(a)fη≤0.(2) Thus each fixed-control inequality holds as a distribution.

7.3F5F9step 6.1step 1.2construct

Choose a nonnegative smooth compactly supported unit-mass kernel ρ and put ρϵ(z)=ϵ−nρ(z/ϵ), vϵ=v∗ρϵ. The common Lipschitz bound gives ∣Dzvϵ∣≤L, and vϵ→v locally uniformly. Integration by parts bounds each distributional directional derivative by L∥η∥1. Step 1.2 represents these by bounded weak derivatives. Using a countable dense set of unit directions gives ∣Dzv∣≤L almost everywhere.

8.1F5step 6.1step 7.2algebra

Semiconvexity gives Dz2vϵ≥−2NI. For a unit spatial vector e, insert the rank-one control a=eeT into (2). It has r(a)=k(a)=0, so Deev−λv≤0 as distributions. Convolution makes this Deevϵ≤λvϵ everywhere. Taking a countable dense set of e and then continuity yields −2NI≤Dx2vϵ≤λvϵI≤λVI.(3).

9.1F9step 7.2step 1.2step 7.3step 8.1

Set C=max⁡(2N,λV). Every spatial Hessian entry in (3) has absolute value at most C. For a compact smooth test η, ∫v ∂xixjη=lim⁡ϵ↓0∫(Dijvϵ)η. Step 1.2 therefore represents this distribution by an actual weak derivative Dijv∈L∞, with norm at most C. Passing the directional bounds through tests gives −2NI≤Dx2v≤λvI almost everywhere. The control a=0 in (2) similarly gives ∂tv≤λv.

10.1F5F9step 7.2step 7.3step 9.1algebra

Each individually existing derivative commutes with convolution by its weak-test identity: if g=Dβv, where β is a first index or two spatial indices, test against y↦ρϵ(z−y) to obtain Dβ(v∗ρϵ)(z)=∫g(y)ρϵ(z−y) dy. The factors (−1)∣β∣ cancel. This argument uses only that particular weak derivative. All expressions in (2) now have bounded-function representatives. Discard the null sets for a countable dense subset of C; continuity in a, including continuity of the determinant at singular matrices, extends the inequalities to every a on one common full-measure set.

10.2A1F1F4F8step 6.1step 7.3step 9.1

By semiconvexity and the local Alexandrov theorem, almost every z0 has a direction-uniform expansion v(z)=q(z)+o(∣z−z0∣2) for a quadratic polynomial q with q(z0)=v(z0). Require also that ball averages recover each bounded weak first and spatial second derivative g, and g2, at z0. These finitely many requirements remove only a null set. Expanding the square gives 1∣B(z0,s)∣∫B(z0,s)∣g−g(z0)∣2⟶0, so Cauchy–Schwarz gives mean absolute convergence as well.

11.1F9step 7.3step 9.1step 10.2algebra

The first-order blowups [v(z0+sy)−v(z0)]/s converge locally uniformly to Dq(z0)⋅y. Their weak derivatives are Dzv(z0+sy), which converge locally in L1 to the weak derivative values at z0 by step 10.2. Distributional limits identify those values with Dq(z0). Similarly the second-order blowups v(z0+sy)−v(z0)−sDq(z0)⋅ys2 converge locally uniformly to 12yTD2q y, while their spatial second weak derivatives are Dx2v(z0+sy) and converge locally in L1 to Dx2v(z0). Thus the spatial block of D2q equals that actual weak Hessian. These scaled weak identities follow directly by changing variables in the compact-test identities.

11.2F6step 1.1step 3.1step 6.1step 10.2construct

Fix ϵ>0 and set q±(z)=q(z)±ϵ∣z−z0∣2. On a sufficiently small closed ball centered at z0, the expansion makes q+ a strict upper contact and q− a strict lower contact. Let zj maximize vhj−q+ there. Local uniform convergence implies zj→z0 and mj=(vhj−q+)(zj)→0. For large j, every stencil neighbor of zj remains in that ball. Nonnegative off-center weights then give 0≤sup⁡a{Lhjaq+−λq++k(a)f}(zj)−λmj.

12.1step 1.1step 11.2givenalgebra

Centered spatial differences are exact on a quadratic polynomial; its forward time difference differs from its time derivative by hj∂ttq+/2. This error is uniform in the controls, since 0≤r(a)≤1. Bounded coefficients and uniform Lipschitz continuity of f therefore allow passage in step 11.2 to max⁡a{r(a)∂tq++a:Dx2q+−λq++k(a)f}(z0)≥0.

13.1step 1.1step 3.1step 11.1step 11.2step 12.1algebra

Minimize vhj−q− on the same ball. The identical positive-weight calculation reverses the inequality and gives the corresponding maximum for q− nonpositive in the limit. Let ϵ↓0 in both conclusions. Continuity of the finite-dimensional maximum gives zero for q. By step 11.1 its first and spatial second coefficients are the actual weak derivatives of v at z0. This proves the asserted Bellman equation outside a null set.

14.1step 9.1step 10.1step 13.1algebra

At a point where the equation and derivative bounds hold, put S=λv−∂tv≥0 and H=λvI−Dx2v≥0. The equation becomes max⁡r≥0, a≥0r+tr⁡a=1{−rS−a:H+(rdet⁡a)1/nf}=0.(4) In particular every normalized control satisfies rS+a:H≥(rdet⁡a)1/nf.

15.1F2step 14.1constructalgebra

For δ>0, let Sδ=S+δ, Hδ=H+δI, and cδ=(Sδ−1+tr⁡Hδ−1)−1,rδ=cδ/Sδ,aδ=cδHδ−1. This is a normalized control, and rδS+aδ:H≤ncδ,(rδdet⁡aδ)1/n=cδ(Sδdet⁡Hδ)1/n. Insert it into the inequality from step 14.1 and cancel cδ>0 to get f≤n(Sδdet⁡Hδ)1/n. Sending δ↓0 gives f≤n(Sdet⁡H)1/n, including S=0 or singular H.

16.1F2F6F7step 14.1step 15.1algebra∎

If S>0 and H is positive definite, AM–GM for rS and the eigenvalues of a1/2Ha1/2 gives rS+a:H≥n(rdet⁡a Sdet⁡H)1/n. If f<n(Sdet⁡H)1/n, the expression in (4) is strictly negative for interior controls. It is also strictly negative for boundary controls: there rdet⁡a=0, whereas rS+a:H>0 because r+tr⁡a=1. Compactness of the normalized control set and continuity make its maximum strictly negative, contradicting (4). Thus equality holds. If S=0 or H is singular, step 15.1 already gives f=0 and Sdet⁡H=0. This proves the product identity in all cases, and completes every assertion.

Source notes

The source is Krylov's AMS233, Sections1.1–1.2 and the construction in Theorem2.2.4. The finite-difference contraction is specialized here to normalized parabolic controls. Rank-one controls provide the upper spatial Hessian bound directly; an inline L2 representation argument supplies actual weak derivatives. The proof uses the local Alexandrov theorem only for the final contact argument. The weak time and spatial derivatives are handled individually; no second time or mixed time-space derivatives are asserted.

Depends on

Used by

Dependency tree · two levels

145 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