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.

Unconditional convergence and existence for the periodic diagonal-diffusion HJB scheme

Statement

Assume the Axiom of Choice. For the full model of Periodic diagonal controlled-diffusion HJB Cauchy problem, let hk,j=1/Nk,j→0, Nk,j≥3, and τk=T/Mk→0. Assume the explicit scheme Explicit monotone diagonal-diffusion Bellman grid update satisfies its diffusion-dominance and CFL inequalities at every row, and initialize it by Uk,i0=u0(xk,i). Its multilinear-in-space, constant-on-time-interval extensions converge locally uniformly on Td×[0,T) to the unique bounded continuous viscosity solution of the model Cauchy problem. Such admissible mesh sequences exist for every model in this coefficient class, so the conclusion also proves existence of that viscosity solution. Comparison and uniqueness apply among all bounded continuous viscosity solutions with the prescribed initial trace. There is no additional comparison hypothesis and no claimed solution-error rate.

Facts & Assumptions

Given: The exact coefficient class, continuous periodic initial data, and mesh family in the statement; assume the Axiom of Choice.

[A1]

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

[F1]

The existing local discrete half-relaxed proof gives a bounded USC subsolution U‾ and bounded LSC supersolution U‾, ordered as U‾≤U‾, with the prescribed relaxed initial traces. It includes the proven stencil monotonicity, smooth-test consistency, mesh contact localization, smooth-test equivalence and discrete initial estimate (Half-relaxed limits of the monotone diagonal-diffusion HJB scheme, Half-relaxed limits of a locally bounded family).

[F2]

The exact coefficient class has comparison for those bounded semicontinuous functions and ordered relaxed initial traces (Comparison for periodic diagonal controlled-diffusion HJB equations).

[F3]

Under precisely [F1] and a comparison principle of the strength [F2], the existing conditional corollary identifies both envelopes with a bounded continuous viscosity solution and proves locally uniform convergence of the spatial interpolants through every T′<T (Conditional convergence of the diagonal-diffusion scheme under comparison).

[F4]

There are common finite coefficient bounds αja≤A∗, ∣bja∣≤B∗, with αja≥α∗>0. All explicit updates are finite maxima of finite expressions and are defined on any finite admissible grid (Periodic diagonal controlled-diffusion HJB Cauchy problem, Explicit monotone diagonal-diffusion Bellman grid update).

[F5]

For x≥0, max⁡{1,⌈x⌉} is the least positive integer at least x (Ceilings give the least positive integer meeting a real threshold).

Proof

1.1A1F1F2F3givenalgebra

Apply [F1] to the given mesh family. Comparison [F2] applies, because [F1] supplies exactly its bounded USC/LSC functions, interior viscosity inequalities and ordered relaxed initial traces. It gives U‾≤U‾, hence equality by the reverse inequality in [F1]. The conditional implication [F3] now has its premise proved locally, and gives the claimed bounded continuous viscosity solution and convergence on each compact cylinder Td×[0,T′], T′<T. Comparing any two bounded continuous solutions in both orders using [F2] proves uniqueness. Full AC is inherited from [F2], and also supplies the Countable Choice used by [F1].

2.1F4F5step 1.1constructalgebra∎

To ensure the existence conclusion is nonvacuous, choose uniform grids Nk,j=N0+k for every j, where N0=max⁡{3,⌈B∗/α∗⌉} is an integer by [F5]. Put N=N0+k and Mk=max⁡{1,⌈Td(2A∗N2+B∗N)⌉}+k,τk=T/Mk. Then ∣bja∣hj≤B∗/N≤α∗≤αja, while τk∑j(2αja/hj2+∣bja∣/hj)≤(T/Mk)d(2A∗N2+B∗N)≤1. Thus every row is admissible, hk,j→0, and τk≤T/k→0. The finite recurrence in [F4] produces the numerical arrays on this explicit mesh family. Step 1.1 gives their limit and therefore existence for every stated datum and coefficient family.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

60 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