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

Comparison for periodic diagonal controlled-diffusion HJB equations

Statement

Assume the Axiom of Choice and the exact finite-control coefficient hypotheses of Periodic diagonal controlled-diffusion HJB Cauchy problem, in any dimension d≥1. Let u be bounded upper semicontinuous and v bounded lower semicontinuous on Td×(0,T); assume their interior C1,2-test inequalities are those of Second-order parabolic viscosity subsolutions and supersolutions, using the local maximum/minimum contact convention of Viscosity subsolutions and supersolutions of a first-order equation and of the Cauchy problem. Suppose the raw relaxed initial traces are ordered at every x∈Td: lim sup⁡(y,t)→(x,0)t>0u(y,t)≤lim inf⁡(y,t)→(x,0)t>0v(y,t). Then u≤v on Td×(0,T). In particular this applies to the model's common continuous initial datum and its two relaxed initial inequalities. Defining the values at t=0 by their respective raw upper and lower envelopes gives the same order there. No continuity, spatial Lipschitz bound, or differentiability of u,v is assumed.

Facts & Assumptions

Given: The exact coefficient class, bounded semicontinuous sub- and supersolutions, ordered relaxed traces, and the Axiom of Choice.

[A1]

Every family of nonempty sets has a choice function (The Axiom of Choice).

[F1]

The model has finite nonempty controls, αjc≥α∗>0, and common bounds and a common joint space-time Lipschitz constant L for α,b,f (Periodic diagonal controlled-diffusion HJB Cauchy problem).

[F2]

At a local maximum of w1(z1)+w2(z2)−ϕ(z1,z2) for USC functions on open Euclidean sets and C2 ϕ, for every μ>0 there are closed elliptic superjets with gradients Diϕ and Hessians Hi satisfying diag⁡(H1,H2)≤D2ϕ+μ(D2ϕ)2 (Elliptic theorem of sums with the full block matrix bound).

[F3]

The closed elliptic space-time jets of the subsolution and supersolution satisfy their parabolic HJB inequalities using the time-gradient component and spatial Hessian block (Closed elliptic space-time jets test the parabolic diagonal HJB inequality).

[F4]

USC functions attain maxima on compact Euclidean sets. Closed bounded sets are compact, and bounded sequences have convergent subsequences (Semicontinuous extreme value theorem on compact Euclidean sets, Heine-Borel in Rn: with the Euclidean metric a subset of Rn is compact if and only if it is closed and bounded, and the proof by bisection uses no choice principle; the same holds on the real line, For n≥1 every bounded sequence in Rn has a convergent subsequence). Torus compactness follows by lifting to the compact fundamental cube and taking the quotient. The declared Axiom of Choice permits countable maximizing-point selections (The Axiom of Choice).

[F5]

The flat unit-torus distance is D(x,y)=min⁡k∈Zd∣x~−y~+k∣, where x~,y~ are any lifts to Rd; when D(x,y)<1/2, the minimizing lift is locally unique and D2 is smooth there, as proved in step 1.1 below.

Proof

1.1F5algebraconstruct

For any fixed lifts, a lattice minimizer exists: only finitely many integer vectors can give a norm no larger than the norm at k=0. If a minimizing difference r has ∣r∣=D(x,y)<1/2, then for every nonzero k∈Zd, ∣k∣≥1 and r⋅k≥−∣r∣∣k∣: for r≠0 this follows by expanding ∣∣k∣r+∣r∣k∣2≥0, and for r=0 it is immediate. Consequently ∣r+k∣2−∣r∣2=∣k∣2+2r⋅k≥∣k∣(∣k∣−2∣r∣)>0. Thus that minimizing difference is unique. Choose continuous local lifts near x,y and keep the minimizing lattice vector fixed; their resulting difference r′ stays of norm less than 1/2 in a sufficiently small neighborhood. The same inequality for every nonzero k shows that this difference remains the unique minimizer throughout that neighborhood. Hence there D2=∣r′∣2, a smooth quadratic in the local coordinates, justifying [F5].

1.2A1F4givenchooseassume-contra

Define u(x,0) as the raw upper trace and v(x,0) as the raw lower trace. Boundedness makes them finite. For example, if xk→x and u(xk,0) approaches its limsup, the raw upper-trace definition and [A1] let us select interior (yk,tk) with ∣yk−xk∣+tk<1/k and u(yk,tk)>u(xk,0)−1/k. Thus yk→x, tk→0, and lim sup⁡ku(xk,0)≤u(x,0). The lower-trace argument is dual. For a sequence with positive times tending to zero, the raw trace definition gives the USC/LSC inequalities directly; splitting a mixed sequence into positive-time and initial-edge subsequences proves the extensions are USC/LSC on the closed initial edge. The assumed order gives u(x,0)≤v(x,0). Assume for contradiction that u(x∗,t∗)−v(x∗,t∗)>0 at some 0<t∗<T. Choose S with t∗<S<T, then choose η,γ>0 sufficiently small that m:=u(x∗,t∗)−v(x∗,t∗)−ηt∗−γ/(S−t∗)>0. Put P(t)=ηt+γ/(S−t). If u(x,t)−v(y,s)−P(t)≥0, boundedness bounds P(t) above by ∥u∥∞+∥v∥∞, so t≤S−c for some c>0.

2.1A1F4F5step 1.2algebra

Using [F5], define Mε=max⁡x,y∈Td, 0≤t<S{u(x,t)−v(y,t)−P(t)−D(x,y)2/(2ε)}. The maximum exists by step 1.2 and [F4]: the expression is USC, and its positive superlevel sets stay in a compact time interval bounded away from S. Also Mε≥m. Write M0=max⁡x, 0≤t<S(u(x,t)−v(x,t)−P(t))≥m, also attained. At any maximizing triple (xε,yε,tε), boundedness gives D(xε,yε)2=O(ε). Compactness and semicontinuity imply Mε→M0: for every sequence ε↓0, a subsequence of maximizers tends to (x,x,t), and the limsup of the unpenalized expression is at most M0, whereas Mε≥M0. Moreover 0≤D(xε,yε)2/(4ε)≤M2ε−Mε⟶0, by evaluating the 2ε maximum at an ε maximizer. These conclusions hold uniformly over maximizing triples, by the same sequential compactness argument. No sequence of these maximizers can have tε→0: then xε,yε→x along a subsequence and semicontinuity and the initial order give limsup of their maximum values at most −P(0)<0, contradicting Mε≥m.

3.1A1F4F5step 1.2step 2.1algebra

For fixed sufficiently small ε, introduce independent times and maximize Φε,δ(x,t,y,s)=u(x,t)−v(y,s)−P(t)−D(x,y)2/(2ε)−(t−s)2/(2δ) over x,y∈Td, 0≤t<S, 0≤s≤S. Maxima exist by step 1.2 and [F4] and are at least Mε≥m. Boundedness gives ∣t−s∣=O(δ) and t≤S−c uniformly. For fixed ε, compactness shows that as δ↓0 every limit of maximizing quadruples is a synchronized maximizer of Mε: the limsup of the expression without the temporal penalty is at most Mε, while the maximum is at least Mε. Hence the temporal penalty tends to zero too. By step 2.1 and [F5], for all sufficiently small ε these limiting times are positive and the spatial distance is less than 1/2. Consequently for each such ε and all sufficiently small δ, both times are strictly in (0,S) and D(x,y)2=∣r∣2 is smooth near the maximizer in local lifts with r=x−y and ∣r∣=D(x,y). Thus all contacts used next are interior in the original cylinder.

4.1F2F5step 3.1algebra

At such a maximizer apply [F2] to u(t,x) and −v(s,y) with ϕ(t,x,s,y)=∣x−y∣2/(2ε)+(t−s)2/(2δ)+P(t),μ=ε. It gives a closed upper jet of u with gradient (a,p) and Hessian H, and a closed lower jet of v with gradient (b,p) and Hessian K, where p=r/ε,a=(t−s)/δ+P′(t),b=(t−s)/δ,a−b=P′(t)≥η. Negating the jet of −v gives the lower jet of v directly from its defining expansion and witnessing sequence. Let X,Y be the spatial principal blocks of H,K. The full Hessian of ϕ has no space-time mixed entries. Its spatial block is ε−1B with B=(I−I−II) and B2=2B. Restricting the upper matrix inequality in [F2] to vectors with zero temporal components therefore gives (X00−Y)≤(3/ε)B. The temporal Hessian, including P′′(t) and the potentially large 1/δ, contributes nothing to this spatial restriction.

5.1F1F3step 4.1algebra

For each control c write Gc(x,t,p,X)=∑j(αjc(x,t)Xjj+bjc(x,t)pj)+fc(x,t). By [F3], a≤max⁡cGc(x,t,p,X) and b≥max⁡cGc(y,s,p,Y). Finiteness gives η≤a−b≤max⁡c{Gc(x,t,p,X)−Gc(y,s,p,Y)}. For σjc=αjc, rationalization and [F1] give ∣σjc(x,t)−σjc(y,s)∣≤L2α∗(∣r∣+∣t−s∣). Evaluate the spatial matrix inequality of step 4.1 on each vector (σjc(x,t)ej,σjc(y,s)ej) and sum over j to obtain ∑j(αjc(x,t)Xjj−αjc(y,s)Yjj)≤3ε∑j∣σjc(x,t)−σjc(y,s)∣2≤3dL24α∗ε(∣r∣+∣t−s∣)2. The drift difference is bounded by C(∣r∣+∣t−s∣)∣r∣/ε, and the forcing difference by L(∣r∣+∣t−s∣), uniformly over the finite controls, using [F1]. Hence a constant C independent of ε,δ satisfies η≤C{(∣r∣+∣t−s∣)2ε+(∣r∣+∣t−s∣)∣r∣ε+∣r∣+∣t−s∣}.

6.1A1F4step 2.1step 3.1step 5.1discharge-contradiction∎

First let δ↓0 for fixed ε, selecting a convergent subsequence of maximizing quadruples by [A1] and [F4]. Since ε is fixed, every term containing ∣t−s∣/ε vanishes. The remaining spatial pair is a maximizer of Mε, so step 5.1 gives η≤C′(D(xε,yε)2/ε+D(xε,yε)). Now let ε↓0. Both terms vanish by step 2.1, contradicting η>0. The assumed positive gap is impossible, so u≤v at every interior point. The initial-edge assertion is its assumed order.

Depends on

Used by

Dependency tree · two levels

70 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