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 first-order controlled Hamilton–Jacobi Cauchy problem

Definition

Let d,q≥1, T>0, and let A be a nonempty compact subset of Rq (a finite action set is included). For each a∈A, let ba:Td×[0,T]→Rd and ℓa:Td×[0,T]→R be bounded and jointly continuous in (x,t,a). Write ba,ℓa also for their periodic lifts to Rd×[0,T]. Assume there are constants B,L<∞ such that ∣ba(x,t)∣≤B,∣ℓa(x,t)∣≤L, and for all a∈A, x,y∈Rd, and t,s∈[0,T], ∣ba(x,t)−ba(y,s)∣+∣ℓa(x,t)−ℓa(y,s)∣≤L(∣x−y∣+∣t−s∣). Given continuous periodic initial data u0:Td→R, define H(x,t,p)=max⁡a∈A{−ba(x,t)⋅p−ℓa(x,t)}. The periodic first-order controlled Hamilton–Jacobi Cauchy problem is ut+H(x,t,Du)=0on Td×(0,T),u(x,0)=u0(x). The signs are fixed by ut=min⁡a∈A{ba⋅Du+ℓa}. Whenever the controls are discretized, use a sequence of finite nonempty sets Ak⊆A and define Hk(x,t,p):=max⁡a∈Ak(−ba⋅p−ℓa). Define the Hamiltonian error by ηk(R):=sup⁡x,t,∣p∣≤R∣Hk(x,t,p)−H(x,t,p)∣. The sequence is admissible when ηk(R)→0 for every R<∞. Exact minimization over A corresponds to ηk=0. Scheme convergence below uses this explicit control-grid error whenever the controls are discretized.

Remarks

The compact action set and continuity make each displayed maximum attained. The coefficient assumptions imply the exact first-order comparison bounds on the periodic extension to Rd: ∣H(x,t,p)−H(y,s,p)∣≤L(1+∣p∣)(∣x−y∣+∣t−s∣),∣H(x,t,p)−H(x,t,p′)∣≤B∣p−p′∣. Thus the published whole-space comparison theorem applies once bounded upper semicontinuous subsolutions and bounded lower semicontinuous supersolutions with the same pointwise initial ordering have been established.

Depends on

Used by

Dependency tree · two levels

23 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