Alphabeta Math
DefinitionDefinition: AI-adaptedProof: Not applicablePipeline-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.

Periodic diagonal controlled-diffusion HJB Cauchy problem

Definition

Let d≥1, T>0, and let A be a nonempty finite ordered control set. For each a∈A and j=1,…,d, let αja,bja,fa:Td×[0,T]→R be bounded and periodic, jointly continuous in (x,t), and uniformly Lipschitz in (x,t). Assume a common constant α∗>0 satisfies αja(x,t)≥α∗for every a,j,x,t. The diagonal controlled-diffusion HJB Cauchy problem is ut−max⁡a∈A{∑j=1d(αja(x,t)uxjxj+bja(x,t)uxj)+fa(x,t)}=0on Td×(0,T), with continuous periodic initial data u(x,0)=u0(x). In the convention ut+F(x,t,Du,D2u)=0, this has F(x,t,p,X)=−max⁡a∈A{∑j(αjaXjj+bjapj)+fa}, which is nonincreasing in each diagonal Hessian entry. No off-diagonal diffusion or arbitrary anisotropic central stencil is covered.

Remarks

The lower bound α∗>0 is part of this selected coefficient branch; the monotonicity proof below only needs the separate mesh diffusion-dominance and time-step inequalities. The definition itself asserts no solution existence or uniqueness. Local draft items now prove comparison for the full stated coefficient class and use it to prove unconditional convergence and existence along an admissible mesh family. Those new arguments remain subject to the native independent reviews and gates and have not received workflow acceptance.

Depends on

Used by

Dependency tree · two levels

16 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