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 autonomous convex superlinear Hamiltonians

Statement

Let n≥1 and let H:Rn→R be finite-valued, continuous, convex and superlinear. Let T>0. Suppose u and v are bounded uniformly continuous on Rn×[0,T], their restrictions to Z=Rn×(0,T) are respectively a viscosity subsolution and a viscosity supersolution of ut+H(Du)=0, and their continuous initial traces satisfy u(x,0)≤v(x,0) for every x∈Rn. Then u≤v on Z. No choice principle is used.

Facts & Assumptions

Given: A finite continuous convex superlinear H:Rn→R, T>0, bounded uniformly continuous u,v on Rn×[0,T] whose restrictions to Z are a viscosity subsolution and supersolution of ut+H(Du)=0 with u(⋅,0)≤v(⋅,0), and positive parameters η,η′,ρ,α,P,ε,δ.

[F1]

At every local maximum of w−ϕ with ϕ∈C1(Z) a viscosity subsolution w satisfies ϕt+H(Dϕ)≤0, and at every local minimum a viscosity supersolution satisfies ϕt+H(Dϕ)≥0 (Viscosity subsolutions and supersolutions of a first-order equation and of the Cauchy problem).

[F2]

Uniform continuity of a map on a metric space means: for every σ>0 there is τ>0 such that ∣f(p)−f(q)∣<σ whenever d(p,q)<τ; hence u and v admit bounded time moduli ωu,ωv and their two initial traces admit a bounded common spatial modulus ω0, with ∣u(x,t)−u(x,t′)∣≤ωu(∣t−t′∣), ∣v(y,s)−v(y,s′)∣≤ωv(∣s−s′∣), and both ∣u(x,0)−u(y,0)∣,∣v(x,0)−v(y,0)∣≤ω0(∣x−y∣) (Uniform continuity of a map of metric spaces: one δ serving every point).

[F3]

A nonempty subset of Rn is compact exactly when it is closed and bounded, and a continuous real-valued function on such a set attains its maximum and minimum (For a nonempty subset of Rn with n≥1, compactness, closedness and boundedness, pseudocompactness, and attainment of extrema by every continuous real-valued function are equivalent).

[F4]

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

[F5]

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

Proof

technique · strict time penalties, a bounded-gradient radial spatial penalty with a vanishing coercive weight, and control of the initial faces by the ordered traces and their moduli
1.1F1algebra

Penalisation. Put u~η(x,t)=u(x,t)−η/(T−t) and v~η′(y,s)=v(y,s)+η′/(T−s) for t,s<T. If ϕ is a C1 upper test for u~η at an interior point z0, then ϕ+η/(T−t) is a C1 upper test for u, so ut evaluation and [F1] give ϕt(z0)+η/(T−t0)2+H(Dϕ(z0))≤0, that is ϕt+H(Dϕ)≤−η/(T−t0)2≤−η/T2; dually every C1 lower test ϕ for v~η′ satisfies ϕt+H(Dϕ)≥η′/(T−s0)2≥η′/T2. Moreover u~η(x,t)≤sup⁡u−η/(T−t)→−∞ and v~η′(y,s)≥inf⁡v+η′/(T−s)→+∞ as t↑T, respectively s↑T, uniformly in the space variable.

1.2assume-contraF2F3F4F5algebra

The doubling function and the initial-face bound. Assume for contradiction that u(x0,t0)>v(x0,t0) for some 0<t0<T and put δ:=14(u(x0,t0)−v(x0,t0))>0. Fix η,η′>0 with u~η(x0,t0)−v~η′(x0,t0)>3δ and put B:=η+η′>0. Choose a>0 so small that ω0(a)<B/(8T), and then P>0 with Pa>sup⁡r≥0ω0(r); this gives sup⁡r≥0(ω0(r)−Pr)<B/(8T) by splitting at a. then ε>0 with Pε<B/(8T), and ψ(r):=P(r2+ε2−ε), so that ∣P(x−y)/∣x−y∣2+ε2∣≤P, ψ(r)≥Pr−Pε and ψ(0)=0; put χ(x):=1+∣x∣2. Choose ρ>0 with ρ≤1, 2ρχ(x0)<δ, and such that ∣H(p)−H(q)∣<B/T2 whenever ∣p−q∣≤2ρ and ∣p∣,∣q∣≤P+1: the last requirement is possible because H is uniformly continuous on the compact set {∣p∣≤P+1} by [F3] and [F4]. For α>0 define Φα(x,y,t,s):=u~η(x,t)−v~η′(y,s)−ψ(∣x−y∣)−α2∣t−s∣2−ρ(χ(x)+χ(y)) for 0≤t,s<T, and set Φα:=−∞ if t=T or s=T. At the diagonal point (x0,x0,t0,t0) we have Φα=u~η(x0,t0)−v~η′(x0,t0)−2ρχ(x0)>3δ−δ=2δ for every α, while Φα≤sup⁡u−inf⁡v<∞. The penalty −ρ(χ(x)+χ(y)) makes the superlevel set Sα:={Φα≥2δ} bounded, and Sα is closed because Φα is upper semicontinuous (it is continuous where t,s<T, and tends to −∞ at the terminal faces, where it is −∞) and 2δ>−∞; by [F3] Sα is compact and it is nonempty by the diagonal estimate. On Sα the function Φα is real-valued, and it is upper semicontinuous as a restriction of an upper semicontinuous function, so it attains on Sα a maximum Mα≥2δ by [F5], and by [F3] the value Mα is finite; a maximum on Sα is a global maximum of Φα because every point outside Sα has value <2δ≤Mα, and every maximiser lies in Sα, hence has tα,sα<T. So for every α there is a maximiser (xα,yα,tα,sα) with Φα(xα,yα,tα,sα)≥2δ and tα,sα<T.

2.1step 1.2F2algebra

Initial faces are excluded for large α. Since u~η−v~η′≤sup⁡u−inf⁡v, the inequality Φα≥2δ gives α2∣tα−sα∣2≤sup⁡u−inf⁡v−2δ, so ∣tα−sα∣→0 as α→∞. If tα=0, then using u(xα,0)≤v(xα,0), the initial modulus ω0, the time modulus ωv and ψ(r)≥Pr−Pε we get Φα≤ω0(∣xα−yα∣)−P∣xα−yα∣+Pε+ωv(sα)−BT≤B8T+B8T−BT+ωv(sα)<0 for all large α, because sα→0 by ∣tα−sα∣→0; this contradicts Φα≥2δ. The case sα=0 is identical with ωu in place of ωv. Hence for all sufficiently large α every maximiser has 0<tα,sα<T.

3.1step 1.1step 1.2step 2.1algebradischarge-contradiction∎

Contact inequalities and the contradiction. Fix α large enough that step 2.1 applies and ∣tα−sα∣<T. At the maximiser, fixing (yα,sα) shows that ϕU(x,t):=ψ(∣x−yα∣)+ρχ(x)+α2∣t−sα∣2 is a C1 upper test for u~η at (xα,tα), and fixing (xα,tα) shows that ϕV(y,s):=−ψ(∣xα−y∣)−ρχ(y)−α2∣tα−s∣2 is a C1 lower test for v~η′ at (yα,sα). Their derivatives are p:=P(xα−yα)∣xα−yα∣2+ε2+ρxαχ(xα), q:=P(xα−yα)∣xα−yα∣2+ε2−ρyαχ(yα) and a:=α(tα−sα), with ∣p∣,∣q∣≤P+ρ≤P+1 and ∣p−q∣=ρ∣xαχ(xα)+yαχ(yα)∣≤2ρ because ∣z∣/χ(z)≤1 for every z. Step 1.1 applied to the two tests gives a+H(p)≤−η/T2 and a+H(q)≥η′/T2, hence B/T2=η+η′T2≤H(q)−H(p). But ∣p−q∣≤2ρ and ∣p∣,∣q∣≤P+1, so the choice of ρ in step 1.2 gives ∣H(q)−H(p)∣<B/T2, a contradiction. Therefore no point with u>v exists in Z, that is u≤v on Z.

Remarks

  • Why the radial penalty has bounded gradient. With ψ(r)=P(r2+ε2−ε) one has 0≤ψ′(r)<P, so the spatial doubling contributes gradients of modulus at most P and the difference p−q contains exactly the term ρ(⋅) of the weight. The vanishing of ε is not used as a limit: the estimates hold for a fixed positive ε.
  • Role of each face. The time penalties give the strict margin B/T2 and remove the terminal faces; the weight ρ(χ(x)+χ(y)) makes the superlevel sets compact; the initial faces are handled by the pointwise order of the traces and their moduli, so no value-function or semijet machinery beyond the stated hypotheses is needed. The Hilbert-space semijet theorem is not required, which is why H(p)=∣p∣2/2 is covered.

Depends on

Used by

Dependency tree · two levels

34 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