Alphabeta Math
TheoremStatement: AI-adaptedProof: 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.

Monotonicity, L-infinity stability, and consistency of the semi-Lagrangian HJB step

Statement

For the update Sh,τ of Positive-interpolation semi-Lagrangian update for first-order HJB equations, if V≤W at all nodes then Sh,τV≤Sh,τW. If ∣ℓa∣≤L, then ∥Sh,τV∥∞≤∥V∥∞+τL. For ϕ∈C2 in space and time with bounded derivatives, on a compact test region with ∣Dϕ∣≤P, ϕ(tn+τ,xi)−Sh,τϕ(tn,⋅)iτ=ϕt(xi,tn)+H(xi,tn,Dϕ(xi,tn))+O(τ+hmax⁡2τ+ηk(P)). The term ηk(P) is zero when the full finite control set is used.

Facts & Assumptions

Given: The positive-interpolation update, coefficient bounds B,L, a periodic smooth test function, and the control-grid error ηk(P).

[F1]

The step is Sh,τVi=min⁡a∈Ak{IhV(xi+τba(xi,tn))+τℓa(xi,tn)} (Positive-interpolation semi-Lagrangian update for first-order HJB equations).

[F2]

The interpolant is order-preserving, contractive in ℓ∞, and approximates a smooth function with error at most 18∑jhj2∥∂jjϕ∥∞ (Positive partition of unity and interpolation error for periodic multilinear interpolation).

[F3]

The Hamiltonian and sign convention satisfy H=max⁡a∈A(−ba⋅p−ℓa)=−min⁡a∈A(ba⋅p+ℓa), and ∣ba∣≤B, ∣ℓa∣≤L (Periodic first-order controlled Hamilton–Jacobi Cauchy problem).

Proof

1.1F1F2F3algebra

If V≤W, [F2] gives IhV≤IhW at every footpoint. Adding the same running cost preserves the inequality for each action, and taking the minimum preserves it again; hence Sh,τV≤Sh,τW. Also ∣IhV∣≤∥V∥∞ by the convex weights in [F2]. Every action value in [F1] therefore has absolute value at most ∥V∥∞+τL, and so does their minimum.

1.2F1F2F3givenalgebra

Let ya=xi+τba(xi,tn) in a periodic lift. By [F2], Ihϕ(tn,⋅)(ya)=ϕ(tn,ya)+O(hmax⁡2∥D2ϕ∥∞). Taylor expansion at (xi,tn) gives ϕ(tn,ya)+τℓa=ϕ(tn,xi)+τ(ba⋅Dϕ+ℓa)(xi,tn)+O(τ2B2∥D2ϕ∥∞). The minimum of finitely many entries changes by at most their largest perturbation. Replacing Ak by A changes the minimum of ba⋅Dϕ+ℓa by at most ηk(P), by [F3]. A time Taylor expansion then yields the normalized residual in the statement, because −min⁡a∈A(ba⋅Dϕ+ℓa)=H.

2.1step 1.1step 1.2∎

Steps 1.1 and 1.2 prove order preservation, the stated sup-norm bound, and the local consistency error. The interpolation term is divided by τ, so convergence of this residual requires the explicit condition hmax⁡2/τ→0. No solution-error rate follows from these one-step estimates.

Depends on

Used by

Dependency tree · two levels

10 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