Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passjudge pass (gpt-6.1-sol)
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.

Comparison for first-order Hamilton--Jacobi equations

Statement

Comparison for first-order Hamilton--Jacobi equations, in the two settings of the design. (a) The case O=Rn. Let T>0 and let H:Rn×[0,T]×Rn→R be continuous for which there is C>0 with ∣H(x,t,p)−H(y,s,p)∣≤C(1+∣p∣) (∣x−y∣+∣t−s∣),∣H(x,t,p)−H(x,t,q)∣≤C∣p−q∣ for all x,y,p,q∈Rn and t,s∈[0,T]. Let u be a bounded upper semicontinuous viscosity subsolution and v a bounded lower semicontinuous viscosity supersolution of the Cauchy problem in Z=Rn×(0,T), each defined on the closed slab Rn×[0,T) and satisfying the pointwise initial inequality u(x,0)≤v(x,0) for every x∈Rn. Then u≤v on Z. (b) The compact-cylinder case. Let O⊆Rn be bounded and open, T>0, and let H:O‾×[0,T]×Rn→R be continuous and uniformly continuous in (x,t) uniformly on bounded p-sets: there is a nondecreasing modulus ω:[0,∞)→[0,∞) with ω(0+)=0 such that ∣H(x,t,p)−H(y,s,p)∣≤ω((1+∣p∣) (∣x−y∣+∣t−s∣)) for all (x,t),(y,s)∈O‾×[0,T] and all p∈Rn. Let u,v be continuous on Z‾=O‾×[0,T], u a viscosity subsolution and v a viscosity supersolution of ut+H(x,t,Du)=0 in Z, with u≤v on the parabolic boundary Γ=(O×{0})∪(∂O×[0,T]). Then u≤v on Z‾. No growth hypothesis on H in the momentum variable is imposed in this case; the modulus condition replaces it. For an x-independent autonomous Hamiltonian H(p), it holds with the zero modulus. No choice principle is used.

Facts & Assumptions

Given: The two settings of the statement; parameters η,η′,ρ,α>0; the time penalties u~η=u−η/(T−t) and v~η′=v+η′/(T−t) (case (a)) or v~η′=v+η′/(T−s) read at the respective time variable; the doubling functions Φα(x,y,t,s):=u~η(x,t)−v~η′(y,s)−α2∣x−y∣2−α2∣t−s∣2 in case (b) and the same with the additional weight −ρ(∣x∣2+∣y∣2) in case (a); their suprema Mα.

[F1]

Every C1 upper contact ϕ of u~η at an interior point satisfies ϕt+H(x,t,Dϕ)≤−η/(T−t)2≤−η/T2, and every C1 lower contact of v~η′ satisfies the reverse with η′; moreover u~η(x,t)≤sup⁡u−η/(T−t)→−∞ and v~η′(x,t)≥inf⁡v+η′/(T−t)→+∞ uniformly at the terminal time (Time penalisation moves a doubling-variables maximum away from the terminal boundary).

[F2]

At every maximiser of the doubling function, the two test functions displayed in Doubling variables: existence, relative contacts at the maximiser and localisation are C1 contacts for u~η and v~η′ with the jets p=α(x−y)+2ρx (case (a)) or p=α(x−y) (case (b)), q=α(x−y)−2ρy or q=α(x−y), and common time derivative p0=α(t−s); and the weight bound α2(∣x−y∣2+∣t−s∣2)+ρ(∣x∣2+∣y∣2)≤sup⁡u~η−inf⁡v~η′−Mα holds at every maximiser, a bound that in case (a) restricts every maximiser by ρ(∣x∣2+∣y∣2)≤sup⁡u−inf⁡v−Mα (Doubling variables: existence, relative contacts at the maximiser and localisation).

[F3]

In case (a), u is upper semicontinuous and v lower semicontinuous on the closed slab, so u(x,0)−v(y,s) and u(x,t)−v(y,0) are upper semicontinuous in their variables. In case (b), u,v are continuous on the compact set Z‾, hence uniformly continuous by Heine--Cantor; choose a common space-time modulus ϖ with ∣u(x,t)−u(y,s)∣,∣v(x,t)−v(y,s)∣≤ϖ(∣x−y∣+∣t−s∣) (Viscosity subsolutions and supersolutions of a first-order equation and of the Cauchy problem, Upper and lower semicontinuity on subsets of Rn, Uniform continuity of a map of metric spaces: one δ serving every point, Heine-Cantor: a continuous map from a compact metric space to any metric space is uniformly continuous).

[F5]

A finite-valued upper semicontinuous function has closed superlevel sets; if f is upper semicontinuous and g lower semicontinuous, then f−g is upper semicontinuous, by applying their local one-sided bounds with half the tolerance (Upper and lower semicontinuity on subsets of Rn).

[F6]

An upper semicontinuous real-valued function on a nonempty compact Euclidean set is bounded above and attains a maximum (Semicontinuous extreme value theorem on compact Euclidean sets).

[F7]

A continuous function on a compact metric space is uniformly continuous (Heine-Cantor: a continuous map from a compact metric space to any metric space is uniformly continuous).

Proof

technique · doubling with terminal-time penalisation; all localisation estimates are proved for every maximiser, so that no sequence of maximisers and no choice principle is used
1.1F1F2F4algebra

Case (a): setup and uniform localisation estimates. Assume σ:=sup⁡Z(u−v)>0 and fix (x1,t1)∈Z with u(x1,t1)−v(x1,t1)>3σ/4. Choose η,η′>0 with (η+η′)/(T−t1)<σ/4 and put B:=η+η′; then u~η(x1,t1)−v~η′(x1,t1)>σ/2. Fix ρ>0 with 2ρ∣x1∣2<σ/8; then for the doubling function of case (a) with these penalties, Mα≥Φα(x1,x1,t1,t1)>σ/2−σ/8=3σ/8 for every α. Every maximiser (x,y,t,s) of Φα has t,s<T, and by [F2] the weight bound gives ρ(∣x∣2+∣y∣2)≤sup⁡u−inf⁡v−3σ/8=:Kρ, so ∣x∣,∣y∣≤Cρ:=Kρ/ρ. Writing d2:=∣x−y∣2+∣t−s∣2 and evaluating Φα/2 at any maximiser of Φα (the penalty difference is α4d2) gives Mα/2≥Mα+α4d2, hence d≤δα:=(4(Mα/2−Mα)/α)1/2 for every maximiser; since Mα↓M∞ boundedly as α→∞, δα→0. With p=α(x−y)+2ρx as in [F2] we get ∣p∣≤αd+2ρCρ and therefore (1+∣p∣)d≤d+αd2+2ρCρd≤δα+4(Mα/2−Mα)+2ρCρδα→0 and ∣q−p∣=2ρ∣x+y∣≤4ρCρ uniformly over all maximisers, both limits being as α→∞ with ρ fixed.

1.2F1F2F4F6algebra

Case (b): setup and uniform localisation estimates. Let σ:=max⁡Z‾(u−v)>0; the maximum is attained by compactness and continuity, and if it were attained on Γ it would be ≤0, then continuity supplies a point (x1,t1)∈Z with u(x1,t1)−v(x1,t1)>3σ/4, even if the maximum occurs at t=T. Choose η,η′>0 with B:=η+η′<σ(T−t1)/4; then u~η(x1,t1)−v~η′(x1,t1)>σ/2, and the doubling function of case (b) satisfies Mα≥σ/2 for every α. It is upper semicontinuous on the compact box O‾×O‾×[0,T]2 (the penalties tend to −∞ at the terminal faces, where the value is declared −∞); a nonempty compact superlevel set and [F6] give a finite attained maximum, and every maximiser has t,s<T. Evaluating Φα/2 at a maximiser of Φα again gives α4d2≤Mα/2−Mα, hence d≤δα→0 uniformly over maximisers, and with p=q=α(x−y) in case (b) one has (1+∣p∣)d≤d+αd2≤δα+4(Mα/2−Mα)→0. Since ∣x−y∣+∣t−s∣≤2d, it follows that (1+∣p∣)(∣x−y∣+∣t−s∣)≤2δα+8(Mα/2−Mα)→0.

2.1step 1.2F1F2F3F6F7algebra

Case (b): exclusion of the parabolic boundary and the contradiction. Let α be large enough that ϖ(2δα)<B/T. If a maximiser had t=0, then (x,0)∈Γ gives u(x,0)≤v(x,0) and ∣x−y∣+s≤2d≤2δα, so Φα≤u(x,0)−v(y,s)−BT≤ϖ(2δα)−BT<0, contradicting Mα≥σ/2. If x∈∂O with t,s>0, then (x,t)∈Γ gives u(x,t)≤v(x,t) and ∣x−y∣+∣t−s∣≤2d≤2δα, so Φα≤ϖ(2δα)−B/T<0; the case y∈∂O is symmetric, as is s=0 using the initial inequality at (y,0) and the modulus of u. Thus all maximisers for large α have 0<t,s<T and x,y∈O. At such a maximiser the penalty inequalities of [F1] hold at the jets p=q, p0 of case (b), and subtracting them gives BT2≤H(y,s,p)−H(x,t,p)≤ω((1+∣p∣)(∣x−y∣+∣t−s∣))≤ω(2δα+8(Mα/2−Mα)), which tends to 0 as α→∞ by step 1.2 and ω(0+)=0; this contradicts B/T2>0. Hence σ≤0, that is u≤v on Z‾.

2.2step 1.1F1F2F3F4F5F6algebra

Case (a): exclusion of the initial faces and the contradiction. Fix the ρ of step 1.1 and let K be the closed ball containing every spatial coordinate of every maximiser. On the compact set K×K×[0,T/2], the functions f0(x,y,s):=u(x,0)−v(y,s) and f1(x,y,t):=u(x,t)−v(y,0) are upper semicontinuous by [F3, F5], and both are nonpositive on the diagonal sets (z,z,0) by the initial inequality. There is δ0>0 such that f0(x,y,s)<3σ/8 whenever ∣x−y∣+s<δ0, and likewise δ1>0 for f1 whenever ∣x−y∣+t<δ1: otherwise the closed superlevel sets {fi≥3σ/8} intersected with the nested closed sets where the corresponding distance is at most 1/m would be nonempty compact sets with the finite-intersection property, so [F4] would give a point (z,z,0) in the superlevel set, a contradiction. For α large enough that 2δα<min⁡{δ0,δ1,T/2}, if a maximiser had t=0, then Φα≤f0(x,y,s) because all remaining penalties are nonpositive, while ∣x−y∣+s≤2d≤2δα; this contradicts Φα=Mα≥3σ/8. If s=0, similarly Φα≤f1(x,y,t) and ∣x−y∣+t≤2δα, again a contradiction. Hence for all sufficiently large α every maximiser has 0<t,s<T. At such a maximiser the contact inequalities of [F1] apply at the jets p,q,p0 of [F2]: p0+H(x,t,p)≤−η/T2 and p0+H(y,s,q)≥η′/T2. Subtracting and using the two Lipschitz conditions of case (a) gives B/T2≤H(y,s,q)−H(x,t,p)≤C∣q−p∣+C(1+∣p∣)(∣x−y∣+∣t−s∣), and by step 1.1 the right-hand side is at most 4ρCCρ+2C(δα+4(Mα/2−Mα)+2ρCρδα), using ∣x−y∣+∣t−s∣≤2d for every maximiser with α large. Letting α→∞ gives B/T2≤4ρCCρ=4C(ρ(sup⁡u−inf⁡v−3σ/8))1/2, and then letting ρ↓0 gives B/T2≤0, a contradiction. Thus σ≤0 and u≤v on Z.

3.1step 2.1step 2.2∎

Conclusion. Case (a) is step 2.2 and case (b) is step 2.1; in both cases the contradiction is obtained by uniform estimates over the maximiser sets, so no maximiser, subsequence or index is selected and no choice principle is used.

Remarks

  • Autonomy. In case (b) an x-independent autonomous Hamiltonian H(p) satisfies the modulus condition with ω≡0. A general autonomous H(x,p) still needs the stated spatial modulus condition; in case (a) the two Lipschitz conditions are exactly what the subtracted inequality consumes.
  • What each hypothesis is for. The terminal-time penalties give the strict margin B/T2; the localisation αd2→0 makes the momentum gap q−p=2ρ(x+y) and the space-time displacement disappear after α→∞ and ρ↓0; the pointwise initial inequality (case (a)) or the boundary inequality (case (b)) excludes the initial and lateral faces.

Depends on

Used by

Dependency tree · two levels

52 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