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

Explicit monotone diagonal-diffusion Bellman grid update

Definition

Use the model of Periodic diagonal controlled-diffusion HJB Cauchy problem and a periodic grid with integers Nj≥3, hj=1/Nj. Choose an integer M≥1, set τ=T/M, and put tn=nτ for n=0,…,M. For a nodal array V, define DjjhVi=Vi+ej−2Vi+Vi−ejhj2. For a control a, define Dj,aupVi={(Vi−Vi−ej)/hj,bja(xi,tn)≥0,(Vi+ej−Vi)/hj,bja(xi,tn)<0. The recurrence is Uin+1=Uin+τmax⁡a∈A{∑j=1d[αja(xi,tn)DjjhUi+bja(xi,tn)Dj,aupUi]+fa(xi,tn)}. At each time level n=0,…,M−1, admit the update only when, at every node, control, and coordinate, ∣bja(xi,tn)∣hj≤αja(xi,tn), and τmax⁡i,a∑j=1d(2αja(xi,tn)hj2+∣bja(xi,tn)∣hj)≤1. Initialize by Ui0=u0(xi) and perform the updates for n=0,…,M−1, evaluating coefficients at (xi,tn). Return UM. No claim about an arbitrary anisotropic central stencil is included.

Depends on

Used by

Dependency tree · two levels

12 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