Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck pass
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.

Time penalisation moves a doubling-variables maximum away from the terminal boundary

Statement

Let T>0, Z=Rn×(0,T), and let H:Rn×[0,T]×Rn→R be continuous. Suppose u,v:Rn×[0,T)→R, where u is upper semicontinuous and bounded above, v is lower semicontinuous and bounded below, and their restrictions to Z are respectively a viscosity subsolution and a viscosity supersolution of ut+H(x,t,Du)=0. For η,η′>0 put u~η(x,t)=u(x,t)−η/(T−t) and v~η′(x,t)=v(x,t)+η′/(T−t) for t<T. Then: (1) every C1 upper contact ϕ for u~η at z0=(x0,t0)∈Z satisfies ϕt(z0)+H(x0,t0,Dϕ(z0))≤−η(T−t0)2<0; (2) every C1 lower contact ϕ for v~η′ at z0∈Z satisfies ϕt(z0)+H(x0,t0,Dϕ(z0))≥η′(T−t0)2>0; moreover u~η→−∞ and v~η′→+∞ uniformly in x as t↑T; (3) for every α,ρ>0, define on Rn×Rn×[0,T]2 Φα,ρ(x,y,t,s)=u~η(x,t)−v~η′(y,s)−α2∣x−y∣2−α2∣t−s∣2−ρ(∣x∣2+∣y∣2) when t,s<T, and set Φα,ρ=−∞ when t=T or s=T. Then Φα,ρ attains a finite maximum, and every maximiser has t,s<T. A maximum may occur on an initial face (that is, with t=0 or s=0). No choice principle is used.

Facts & Assumptions

Given: T>0, continuous H:Rn×[0,T]×Rn→R, an upper semicontinuous function u:Rn×[0,T)→R bounded above, a lower semicontinuous v bounded below, whose restrictions to Z=Rn×(0,T) are a viscosity subsolution and supersolution of ut+H(x,t,Du)=0, the functions u~η=u−η/(T−t), v~η′=v+η′/(T−t) for η,η′>0, and the functions Φα,ρ of the statement, read in R‾ (The extended real line R‾=R∪{−∞,+∞}, its order, and the arithmetic that is left undefined).

[F1]

A viscosity subsolution w of ut+H(x,t,Du)=0 in Z satisfies ψt(z0)+H(z0,Dψ(z0))≤0 at every local maximum z0∈Z of w−ψ with ψ∈C1(Z); a viscosity supersolution satisfies the reverse inequality ≥0 at every local minimum of w−ψ (Viscosity subsolutions and supersolutions of a first-order equation and of the Cauchy problem).

[F2]

The function t↦η/(T−t) is C1 on (−∞,T) with derivative η/(T−t)2; sums of C1 functions are C1 with the sum of the total derivatives (The total (Fréchet) derivative Df(a) as the linear first-order approximation with o(∥h∥2) remainder), and a local maximum of u~η−ϕ is a local maximum of u−(ϕ+η/(T−t)) because the two differences are the same function.

[F3]

Upper semicontinuity of u and lower semicontinuity of v are the relative notions on the Euclidean set Rn×[0,T) (Upper and lower semicontinuity on subsets of Rn); w is upper semicontinuous exactly when every superlevel set {w≥c} is closed.

[F5]

A metric space is compact if and only if every family of closed subsets with the finite intersection property has nonempty intersection; no choice principle is used (A metric space is compact if and only if every family of closed subsets with the finite intersection property has nonempty intersection).

Proof

technique · add the two explicit time-boundary penalties, then use spatial coercivity and compact superlevel sets
1.1F1F2algebra

The subsolution penalty. Let ϕ∈C1(Z) and suppose u~η−ϕ has a local maximum at z0=(x0,t0)∈Z. Then u−ψ has a local maximum at z0 for ψ(z):=ϕ(z)+η/(T−t), which is C1 on Z with ψt=ϕt+η/(T−t)2 and Dψ=Dϕ by [F2]; the subsolution inequality [F1] gives ϕt(z0)+η/(T−t0)2+H(x0,t0,Dϕ(z0))≤0, that is ϕt+H(x0,t0,Dϕ(z0))≤−η/(T−t0)2<0.

1.2F1F2algebra

The supersolution penalty and the uniform terminal limits. If v~η′−ϕ has a local minimum at z0∈Z, then v−ψ has a local minimum at z0 for ψ:=ϕ−η′/(T−t), C1 with ψt=ϕt−η′/(T−t)2; the supersolution inequality [F1] gives ϕt+H(x0,t0,Dϕ(z0))≥η′/(T−t0)2>0. For the terminal limits, u~η(x,t)≤sup⁡u−η/(T−t) and v~η′(x,t)≥inf⁡v+η′/(T−t) for every x, and the right-hand sides are independent of x and tend to −∞, respectively +∞, as t↑T.

1.3F3F4F5algebra

Existence and finiteness of the maximum of Φα,ρ. On the product space Rn×Rn×[0,T]2 the function Φα,ρ is upper semicontinuous: it is built from the upper semicontinuous u~η, the function −v~η′, which is upper semicontinuous because v is lower semicontinuous, and continuous terms, and at a sequence with t→T or s→T it tends to −∞ uniformly, since u~η(x,t)≤sup⁡u−η/(T−t) and −v~η′(y,s)≤−inf⁡v−η′/(T−s); hence it takes the value −∞ on the terminal faces in the upper-semicontinuous sense fixed in [F3]. It is bounded above by sup⁡u−inf⁡v<∞, and its value at any diagonal point (0,0,τ,τ) with 0<τ<T is finite, so M:=sup⁡Φα,ρ∈R. For each k≥1 the set Ak:={(x,y,t,s):Φα,ρ≥M−1/k} is nonempty by the definition of M, closed by upper semicontinuity [F3], bounded because ρ(∣x∣2+∣y∣2)≤sup⁡u−inf⁡v−M+1/k≤sup⁡u−inf⁡v−M+1 on Ak, and disjoint from the terminal faces because M−1/k is finite there; hence each Ak is a compact subset of A1 by [F4]. The family {Ak}k≥1 is nested, so it has the finite intersection property, and [F5] applied in the compact set A1 gives a point of ⋂kAk, at which Φα,ρ≥M−1/k for every k, hence Φα,ρ≥M; since M is an upper bound, Φα,ρ=M there. Thus the maximum is attained and equals the finite number M, and every maximiser has t,s<T because the terminal faces carry the value −∞.

2.1step 1.1step 1.2step 1.3∎

Conclusion. Parts (1) and (2) of the statement are steps 1.1 and 1.2, and part (3) is step 1.3, whose construction nowhere selects a sequence or a point: the maximiser is obtained from the finite intersection property, which the cited lemma proves choice-free. Nothing in the argument rules out a maximiser with t=0 or s=0, since only the terminal faces t=T, s=T carry the value −∞.

Remarks

  • Why the penalties are the right shape. Each penalty is continuous on [0,T) with derivative diverging at T, so it produces the exact interior residual shift η/(T−t)2, whose magnitude is at least η/T2 (and similarly for η′), and pushes every doubling maximum off the terminal face. The initial faces carry finite values and are deliberately allowed: the comparison theorem treats them separately with the pointwise initial inequality.
  • Choice. The only compactness input is the finite-intersection characterisation [F5], which is choice-free.

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