Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck pendingjudge 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 parabolic Bellman barrier with a Lebesgue height bound

Statement

Assume AC. For each dimension d≥1 there is a finite constant Cd such that for every nonnegative f∈Cc∞(R×Rd) there exists a bounded nonnegative globally Lipschitz function v, with bounded weak derivatives vt,Dxv,Dx2v, satisfying ∥v∥∞≤Cd∥f∥Ld+1(Rd+1),∣Dxv∣≤valmost everywhere, and, simultaneously for every constant symmetric positive semidefinite matrix A, vt+A:Dx2v−(1+tr⁡A)v+(det⁡A)1/(d+1)f≤0 as distributions and as bounded-function inequalities almost everywhere. One can choose v to decay exponentially in ∣x∣ uniformly in time and to vanish for all sufficiently large future times. The derivative bounds used in constructing v may depend on derivatives of f; the displayed height constant does not.

Facts & Assumptions

Given: AC, d≥1 and f≥0 smooth compactly supported.

[A1]

Full AC is retained through the normalized Bellman construction. The Axiom of Choice

[F1]

The normalized Bellman construction supplies a bounded nonnegative Lipschitz v with bounded weak vt,Dxv,Dx2v, satisfying max⁡A≥0, tr⁡A≤1{rvt+A:Dx2v−v+(rdet⁡A)1/(d+1)f}=0,r=1−tr⁡A, almost everywhere. It also supplies comparison with bounded smooth global supersolutions having bounded uniformly continuous t derivative and spatial Hessian, and the identity S=v−vt≥0,H=vI−Dx2v≥0,Sdet⁡H=(f/(d+1))d+1. A normalized parabolic Bellman equation has a bounded weak solution

[F2]

Arithmetic–geometric mean applies to the nonnegative eigenvalues of a positive semidefinite matrix and to an additional nonnegative scalar. The arithmetic mean, geometric mean inequality

[F3]

Smooth convolution differentiates its kernel; for every weak derivative used here, the weak test identity applied to a translated kernel gives derivative-convolution commutation. Lebesgue differentiation holds for locally integrable functions. Its absolute Lebesgue-point version follows by also applying it to the countable family ∣g−q∣, q∈Q, and using lim sup⁡Ar∣g−g(z)∣≤2∣q−g(z)∣, then q→g(z). Consequently bounded weak derivatives converge almost everywhere under a bounded compactly supported approximate identity. No second time or mixed derivatives of the unsmoothed v are required. Convolution with a mollifier is smooth, and derivatives pass under the integral sign Lebesgue differentiation theorem on Rn

[F4]

Dominated convergence applies with an integrable absolute majorant, and Fubini applies to absolutely integrable functions. Dominated convergence Fubini's theorem for L^1 functions on a sigma-finite product

Proof

1.1A1F1F2givenconstruct

Take v from [F1]. Put ρ(x)=1+∣x∣2, η=1/4, and U(x)=Cexp⁡(−ηρ(x)). Then Dx2U=U(η2Dρ⊗Dρ−ηD2ρ)≤η2UI. For normalized A,r the Bellman expression of U is at most −[r+(1−η2)tr⁡A]U+f/(d+1)≤−(1−η2)U+f/(d+1) by [F2]. Choose finite C to make this nonpositive on the compact spatial support of f; it is nonpositive elsewhere as well. This bounded smooth U has the bounded uniformly continuous derivatives required for comparison. Hence v(t,x)≤Cexp⁡(−ηρ(x)) uniformly in t.

1.2givenalgebra

For symmetric B let cm(B)=(−1)mem(B), the signed sum of order-m principal minors, with c0=1, and define the matrix differential Cm by dcm(B)[E]=Cm(B):E. Polynomial expansion and homogeneity give det⁡(zI−B)=∑m=0dzd−mcm(B),Cm(B):B=mcm(B). For B≤0, Cm(B)≤0 when m≥1: differentiating each principal minor of −B gives minus an embedded positive semidefinite cofactor matrix, including singular cases by continuity. For smooth w, each row and column of Cm(D2w) has zero divergence. Indeed expand its minors as signed sums over permutations; every differentiated Hessian factor gives a third derivative, canceled by the term with the differentiated row transposed with that factor's row. The signs reverse and the mixed third derivatives coincide; order-one minors have constant differentials. This proves the divergence identity by finite polynomial calculation.

2.1F1F2step 1.1construct

Write F(t)=sup⁡xf(t,x), supported in [a,b]. Choose smooth compactly supported g≥F so that U(t)=∫t∞et−sg(s)ds≥F(t) everywhere: after choosing a smooth compact majorant of F, add a sufficiently large positive smooth bump in (b+1,b+2), whose convolution has positive minimum on [a,b]. Since Ut=U−g, its normalized Bellman expression is −rg−(1−r)U+(rdet⁡A)1/(d+1)f≤−F+f/(d+1)≤0. Comparison applies, so 0≤v≤U and v=0 after the right endpoint of supp⁡g.

2.2step 1.2algebra

Comparing coefficients in det⁡(zI−B)=det⁡((z−h)I−(B−hI)) and differentiating in B at fixed h≥0 gives Cm(B)=∑k=1m(−1)m−k(d−km−k)hm−kCk(B−hI). Thus ∑m=1dwmhd−mCm(B)=∑k=1dβkhd−kCk(B−hI), where βk=∑j=0d−k(−1)j(d−kj)wk+j. If hI−B≥0 and every βk≥0, this matrix is negative semidefinite by step 1.2. Set p=d+2. The two sequences needed below are am=(p−m−1)/(m+1) and bm=1/[m(m+1)]. For n=d−k≥1, the alternating difference of a is p∫01tk(1−t)ndt≥0; for n=0 it is ad>0. That of b is ∫01tk−1(1−t)n+1dt≥0. These integral formulas follow by expanding (1−t)n. Both matrix sums are therefore negative semidefinite whenever hI−B≥0.

2.3F4step 1.2constructalgebra

First let u≥0 be smooth, uI−Dx2u≥0, u−ut≥0, zero for t≥T1, with itself and every derivative used below exponentially decaying in x on finite time intervals. Fix t and put w(s,x)=e−su(s,x), so ws≤0 and wI−Dx2w≥0. For m=0,…,d set Am=−∫tT1 ⁣∫Rdwp−m−1cm(Dx2w)ws dxds. Then A=∑mAm=∫tT1∫wp−d−1(−ws)det⁡(wI−Dx2w). Temporal integration by parts gives the initial term (p−m)−1∫w(t)p−mcm(Dx2w(t)) plus (p−m)−1∫tT1∫wp−mCm(Dx2w):Dx2ws. Two spatial integrations by parts, the divergence identity and Euler identity in step 1.2 yield (m+1)Am=∫w(t)p−mcm(Dx2w(t))dxp−m+(p−m−1)∫tT1 ⁣∫wp−m−2ws(Dxw)TCm(Dx2w)Dxw dxds. These integrations can first use compact spatial cutoffs. Every boundary error vanishes by exponential decay, and all integrals are absolutely convergent on the finite time interval, justifying Fubini. No power is singular since p=d+2.

3.1F4step 2.2step 2.3algebra

Sum the identity in step 2.3. Its final integrals are nonnegative: their matrix is wp−d−2∑mamwd−mCm(Dx2w)≤0 by step 2.2, and ws≤0. Therefore A≥∑m[(p−m)(m+1)]−1∫w(t)p−mcm(Dx2w(t))dx. For m≥1, substitute cm=m−1Cm:Dx2w and integrate once in space. Their sum becomes −∫w(t)p−d−1(Dxw)T[∑m=1dbmw(t)d−mCm(Dx2w)]Dxw dx≥0 by step 2.2. The m=0 term is p−1∫w(t)pdx. Consequently pept∫tT1e−ps ⁣∫up−d−1(u−us)det⁡(uI−Dx2u)dxds≥∫u(t,x)pdx.

3.2step 2.3algebra

Restrict the nonnegative u to any spatial line. The scalar inequality y′′≤y gives y(r)≤y(0)cosh⁡r+y′(0)sinh⁡r by variation of constants for y′′−y. Nonnegativity for all r≥0 implies y′(0)≥−y(0); reversing the direction gives ∣Dxu∣≤u. Integrating the derivative inequality along a segment gives u(t,x)≥u(t,y)e−∣x−y∣ (or first use u+δ and let δ↓0). Therefore ∫u(t,x)pdx≥cdu(t,y)p,cd=∫Rde−p∣x∣dx>0. This constant is finite and depends only on d, since p=d+2.

4.1F1F3F4step 1.1step 2.1step 3.1step 3.2

Convolve the weak solution v from step 1.1 in spacetime with a nonnegative smooth unit-mass kernel of radius ϵ, and write vϵ. It is nonnegative, has vϵ−(vϵ)t≥0 and vϵI−Dx2vϵ≥0 by the linear weak inequalities and [F3]. For each fixed ϵ, all derivatives decay exponentially in x by step 1.1 and kernel differentiation; step 2.1 supplies a finite future cutoff. Hence steps 3.1–3.2 apply to vϵ. At almost every spacetime point [F3] and [F1] give (vϵ−(vϵ)t)det⁡(vϵI−Dx2vϵ)⟶(f/(d+1))d+1. All the weak derivatives occurring here are bounded uniformly after convolution. On any fixed finite time interval [a,T1+1], the integrand in step 3.1 is dominated by a constant times e−η∣x∣: the factor vϵp−d−1 is precisely vϵ, with uniform exponential decay, and the remaining determinant factors are uniformly bounded. Thus [F4] gives the exact needed dominated limit. Also vϵ(t,y)→v(t,y) at every point by Lipschitz continuity. We obtain cdv(t,y)p≤p(d+1)d+1∫t∞e−p(s−t) ⁣∫v(s,x)p−d−1f(s,x)d+1dxds.

5.1F1F3step 1.1step 2.1step 3.2step 4.1algebra∎

Fix finite a and put Va=sup⁡s≥a,xv(s,x)<∞. For t≥a, step 4.1 is bounded above by p(d+1)−d−1Vap−d−1∥f∥d+1d+1. Taking the supremum in (t,y) gives cdVap≤p(d+1)−d−1Vap−d−1∥f∥d+1d+1. If Va=0 there is nothing to prove; otherwise divide to obtain Va≤[p/(cd(d+1)d+1)]1/(d+1)∥f∥d+1. This constant is independent of a, so it bounds v everywhere. Applying the line argument in step 3.2 to the spatially smoothed weak solution and passing to Lebesgue points gives ∣Dxv∣≤v almost everywhere. Finally rescale the normalized control inequalities of [F1] using r=1/(1+tr⁡A) and normalized matrix rA; divide by r>0 to get the asserted inequality for every A≥0. The common null set is obtained first for countably many dense matrices and then by continuity. Steps 1.1 and 2.1 supply the additional decay and future cutoff.

Depends on

Used by

Dependency tree · two levels

66 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