Alphabeta Math
LemmaStatement: 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.

Initial trace for the positive-interpolation and upwind HJB schemes

Statement

Let u0 be continuous and periodic, and let B and L bound the drift and running cost in Periodic first-order controlled Hamilton–Jacobi Cauchy problem. For the semi-Lagrangian scheme, if tn=nτ→0, hmax⁡→0, and hmax⁡2/τ→0, then sup⁡i∣Uin−u0(xi)∣⟶0. For the upwind scheme, the same conclusion holds when tn→0, hmax⁡→0, and its CFL condition holds. Both statements are uniform over all finite control policies and remain true for a finite control discretization.

Facts & Assumptions

Given: The two finite update rules, bounded coefficients, continuous periodic u0, and a time step satisfying the corresponding mesh condition. For each finite transition tree, E denotes the finite sum of path values weighted by the products of their row weights.

[F1]

The semi-Lagrangian transition weights are the nonnegative tensor weights of Periodic Cartesian grids and tensor-product multilinear interpolation; they sum to one and each coordinate node lies within hj of the footpoint (Positive partition of unity and interpolation error for periodic multilinear interpolation).

[F2]

The upwind row weights under the CFL condition are its center weight 1−τ∑j∣bj∣/hj and neighbor weights τbj+/hj, τbj−/hj (CFL-monotone upwind update for first-order HJB equations).

[F3]

The coefficient and reward bounds are ∣ba∣≤B and ∣ℓa∣≤L, and u0 is continuous and periodic (Periodic first-order controlled Hamilton–Jacobi Cauchy problem).

Proof

1.1F1givenalgebra

For a semi-Lagrangian row at a node xi and action a, view its interpolation weights as a finite probability vector on the cell nodes around y=xi+τba(xi,t). In a periodic lift, the weighted mean of each coordinate is (1−θj)xij+θj(xij+hj)=yj, by the product formula in [F1]. The centered interpolation error ξ therefore has weighted mean zero and satisfies ∣ξ∣2≤∑jhj2.

1.2F2givenalgebra

For an upwind row, the weights in [F2] are nonnegative and sum to one by CFL. The weighted mean displacement to the previous-time node is τba: in coordinate j it is τ(bj+/hj)hj−τ(bj−/hj)hj=τbj. Its centered error ξ has mean zero and second moment at most τ∑j∣bj∣hj≤τB∑jhj, since subtracting the squared mean cannot increase the second moment.

1.3F1F2F3algebra

Unroll either update for the finite number n of steps. At each stage the minimum chooses one of finitely many control rows, and each row is a finite weighted average; induction therefore represents the value as the minimum of finite weighted path costs u0(Xn)+∑r<nτℓr. Along any such controlled path the sum of the drift increments has norm at most Bt. The centered increments have conditional mean zero. For r<s, summing the increment ξs over all next-branch weights from each fixed path prefix through time s−1 gives zero; hence the finite weighted cross term E(ξr⋅ξs) is zero. Expanding the square therefore shows that their total second moment is at most n∑jhj2 for the semi-Lagrangian rows and tB∑jhj for the upwind rows. Thus the endpoint displacement obeys E∣Xn−xi∣2≤2B2t2+2n∑jhj2 for the semi-Lagrangian case and E∣Xn−xi∣2≤2B2t2+2tB∑jhj for the upwind case. Every path's accumulated reward has magnitude at most Lt.

2.1F3F4step 1.3algebra∎

Let M0=∥u0∥∞ and let ω0(δ)→0 be the uniform modulus from [F4]. For any 0<δ<1, split the finite weighted endpoint average into paths with ∣Xn−xi∣≤δ and its complement. On the first set, ∣u0(Xn)−u0(xi)∣≤ω0(δ); on the complement, it is at most 2M0. The complement weight is at most E∣Xn−xi∣2/δ2. By step 1.3 this tends to zero as tn→0 under hmax⁡2/τ→0 for the semi-Lagrangian scheme, and under hmax⁡→0 for the upwind scheme. The reward contributes at most Ltn; the same two-sided bound holds after taking a minimum over policies. First let the mesh and tn tend to zero, then let δ↓0. This proves the asserted uniform initial trace.

Depends on

Used by

Dependency tree · two levels

48 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