Alphabeta Math
TheoremStatement: 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.

Half-relaxed limits of sub- and supersolutions with vanishing perturbations

Statement

Let O⊆Rn be open, T>0, Z=O×(0,T), let Hε,H:O×[0,T]×Rn→R be continuous for ε∈(0,1), and let (uε) be a locally bounded family of real functions on Z that are upper semicontinuous in the subsolution case. Assume one of the two forms of the Hamiltonian condition: (a) Hε→H uniformly on compact subsets of O×[0,T]×Rn; or (b) the exact limit-inferior condition: for all sequences εj↓0, zj→z∈Z and pj→p one has lim inf⁡jHεj(zj,pj)≥H(z,p). Suppose moreover that for every ϕ∈C1(Z) and every local maximum point zε∈Z of uε−ϕ there holds ϕt(zε)+Hε(zε,Dϕ(zε))≤cε(zε), where cε:Z→[0,∞) is locally bounded with cε→0 locally uniformly. Then the upper half-relaxed limit u‾ (Half-relaxed limits of a locally bounded family) is a viscosity subsolution of ut+H(x,t,Du)=0 in Z. If in addition uε(x,0)≤u0(ε)(x) in the relaxed sense with u0(ε)→u0 locally uniformly on O and the family is locally equicontinuous up to the initial face, then u‾ carries the initial datum u0 in the relaxed sense. The dual statement with lim sup⁡jHεj(zj,pj)≤H(z,p), ≥−cε and the lower half-relaxed limit holds for supersolutions. Choice. Under hypothesis (a) the proof is choice-free. Under hypothesis (b) it extracts a sequence of near-maximisers at the relaxed limit and therefore uses Countable Choice (The Axiom of Countable Choice (ACω)), which is declared as a dependency; the extraction is the only place where the principle is consumed.

Facts & Assumptions

Given: The open sets O⊆Rn, Z=O×(0,T), continuous Hamiltonians Hε,H, a locally bounded family (uε) of real functions on Z, locally bounded perturbations cε≥0 with cε→0 locally uniformly, and the half-relaxed limits u‾,u‾ of Half-relaxed limits of a locally bounded family.

[F1]

u‾(z)=inf⁡δ>0sup⁡{uε(y):0<ε<min⁡{1,δ}, y∈Z, ∣y−z∣<δ} and u‾(z)=sup⁡δ>0inf⁡{uε(y):0<ε<min⁡{1,δ}, y∈Z, ∣y−z∣<δ}; local boundedness makes both real-valued on compact subsets of Z; u‾ is upper semicontinuous and u‾ lower semicontinuous (Half-relaxed limits of a locally bounded family).

[F2]

At every local maximum of uε−ϕ with ϕ∈C1(Z) the assumed inequality ϕt(zε)+Hε(zε,Dϕ(zε))≤cε(zε) holds; a viscosity subsolution of the limit equation is a function that satisfies ϕt(z0)+H(z0,Dϕ(z0))≤0 at every local maximum of the function and test function (Viscosity subsolutions and supersolutions of a first-order equation and of the Cauchy problem).

[F3]

If v−ϕ has a local maximum at z0 and B‾(z0,r)⊆U is a ball on which v−ϕ≤v(z0)−ϕ(z0), then for every ε>0 the perturbed test ϕε=ϕ+ε∣z−z0∣4 has the same value and first jet as ϕ at z0 and makes v−ϕε strictly maximised over B‾(z0,r) at z0 (Strictification of a viscosity test function by a quartic perturbation).

[F4]

Every upper semicontinuous real-valued function on a nonempty compact subset of Rm attains its maximum there (Semicontinuous extreme value theorem on compact Euclidean sets).

[F5]

Countable Choice is the principle that every sequence (Sj)j≥1 of nonempty sets has a sequence of choices (sj) with sj∈Sj (The Axiom of Countable Choice (ACω)).

[F7]

Local equicontinuity up to the initial face gives each uε a continuous trace uε0(x):=lim⁡(y,s)→(x,0), s>0uε(y,s) and a common local modulus there; the relaxed initial inequality implies uε0(x)≤u0(ε)(x).

Proof

technique · separate the uniform case (a) from the sequential case (b); in case (a) the argument uses a single near-maximal pair and one compact maximiser, and in case (b) a sequence of near-maximisers is extracted at the relaxed limit
1.1F1F2F4F6algebra

Case (a): the strict-contact case, choice-free. Let ϕ∈C1(Z) and let u‾−ϕ have a strict local maximum at z0=(x0,t0)∈Z. Choose ρ>0 with B‾(z0,ρ)⊆Z and strict inequality away from z0. Assume for contradiction that θ:=ϕt(z0)+H(z0,Dϕ(z0))>0. By continuity there is r∈(0,ρ/2) such that ϕt(z)+2(t−t0)+H(z,Dϕ(z)+2(x−x0))>3θ/4 for ∣z−z0∣≤r. The compact annulus Ar:={z:r/2≤∣z−z0∣≤r} has a strict gap g:=u‾(z0)−ϕ(z0)−max⁡Ar(u‾−ϕ)>0 by [F1, F4]. Write z=(x,t) and z0=(x0,t0). For each z∈Ar, the defining infimum for u‾(z) gives δz>0 such that uε(y)<u‾(z)+g/8 whenever 0<ε<δz and ∣y−z∣<δz; shrink δz so also ∣ϕ(y)+∣y−z0∣2−ϕ(z)−∣z−z0∣2∣<g/8 there. Use the collection of all pairs (z,δ) satisfying these bounds; their balls B(z,δ/2) cover Ar without choosing one radius at each point. By compactness and [F6], finitely many such balls B(zi,δi/2) cover Ar; let εA:=min⁡iδi. For every 0<ε<εA and y∈Ar, these bounds give uε(y)−ϕ(y)−∣y−z0∣2<u‾(zi)−ϕ(zi)−∣zi−z0∣2+g/4≤u‾(z0)−ϕ(z0)−3g/4 for some i. Uniform convergence Hε→H on compact subsets and local uniform convergence cε→0 provide εH>0 such that for ε<εH and ∣z−z0∣≤r, the corresponding upper-test residual with gradient Dϕ(z)+2(x−x0) is >θ/2 and cε(z)<θ/2. Choose 0<η<g/12 and then δ<min⁡{r/4,εA,εH} so that ∣ϕ(y)−ϕ(z0)∣<η and ∣y−z0∣2<η when ∣y−z0∣<δ. By [F1] there is one pair (ε,y) with 0<ε<δ, ∣y−z0∣<δ and uε(y)>u‾(z0)−η. Let zε maximise the upper semicontinuous function uε(z)−ϕ(z)−∣z−z0∣2 on the compact ball B‾(z0,r), possible by [F4]. Its value is >u‾(z0)−ϕ(z0)−3η, so the uniform annulus bound forces ∣zε−z0∣<r/2. Thus uε−(ϕ+∣z−z0∣2) has a local maximum at zε. Writing z0=(x0,t0) and zε=(xε,tε), the test has time derivative ϕt(zε)+2(tε−t0) and spatial gradient Dϕ(zε)+2(xε−x0); its residual is >θ/2 while cε(zε)<θ/2, contradicting the assumed subsolution inequality. Hence ϕt(z0)+H(z0,Dϕ(z0))≤0 at every strict local maximum.

1.2F1F7algebra

The initial trace. Assume the relaxed initial inequality and data convergence of the statement, and use the traces of [F7]. Fix x∈O and η>0. By local equicontinuity and continuity of u0(ε)→u0 there is a neighbourhood V of (x,0) such that, for all sufficiently small ε and (y,s)∈V∩Z, uε(y,s)≤uε0(x)+η≤u0(ε)(x)+η≤u0(x)+2η. Shrink to a neighbourhood V′ whose closure lies in V. For each z′∈V′∩Z sufficiently close to (x,0), the neighborhoods in the definition of u‾(z′) can be taken inside V, so the same bound gives u‾(z′)≤u0(x)+2η. Therefore lim sup⁡(y,s)→(x,0), s>0u‾(y,s)≤u0(x)+2η; letting η↓0 proves the relaxed subsolution initial condition. The lower-limit argument is the dual one.

2.1F1F2F4F5F6algebra

Case (b): the strict-contact case with near-maximiser extraction. Assume the exact limit-inferior condition and let ϕ and z0 be as in step 1.1. For each j≥1, consider triples (ε,y,z) with 0<ε<min⁡{1,1/j}, y∈Z, ∣y−z0∣<min⁡{ρ/2,1/j}, uε(y)>u‾(z0)−1/j, and z a maximiser of uε(⋅)−ϕ(⋅)−∣⋅−z0∣2 on B‾(z0,ρ). This set is nonempty by [F1] and [F4]; Countable Choice [F5] selects triples (εj,yj,zj). Then εj→0, yj→z0 and the maximal values satisfy uεj(zj)−ϕ(zj)−∣zj−z0∣2≥u‾(z0)−ϕ(z0)−o(1). Fix any r∈(0,ρ). The strict maximum of u‾−ϕ gives a positive gap on the compact annulus r/2≤∣z−z0∣≤ρ; the finite-cover argument of step 1.1 then bounds uε(z)−ϕ(z)−∣z−z0∣2 strictly below u‾(z0)−ϕ(z0) on this annulus for all sufficiently small ε. Since εj→0 and the maximizing values are at least that limit minus o(1), eventually ∣zj−z0∣<r/2. As r>0 was arbitrary, zj→z0. By taking the canonical strictly decreasing subsequence of (εj) (at each stage use the least later index with smaller ε, which exists because εj→0) and relabelling, we may assume εj↓0; then zj→z0 still. Eventually zj is interior to B‾(z0,ρ), so ψj:=ϕ+∣z−z0∣2 is a local upper test for uεj there. Thus ϕt(zj)+2(tj−t0)+Hεj(zj,Dϕ(zj)+2(xj−x0))≤cεj(zj). Writing zj=(xj,tj), the extra time derivative 2(tj−t0) tends to zero. Since the gradients converge and cεj(zj)→0, taking the limit inferior of the displayed inequality and using (b) gives ϕt(z0)+H(z0,Dϕ(z0))≤0. Condition (a) implies (b) by uniform convergence on compact sets, so this proves the strict-contact case.

3.1step 1.1step 1.2step 2.1F3∎

General contacts, the dual statement and conclusion. If u‾−ϕ merely has a local maximum at z0, strictify with [F3] and apply the strict-contact conclusion of steps 1.1 or 2.1 to the strictified test; the perturbed test has the same value and first jet at z0, so the resulting inequality is exactly ϕt(z0)+H(z0,Dϕ(z0))≤0. Hence u‾ is a viscosity subsolution of the limit equation, and by step 1.2 it carries the initial datum when the additional hypotheses hold. The dual argument, replacing uε by −uε and local maxima by local minima, shows that u‾ is a viscosity supersolution with the dual initial condition. The half-relaxed limits themselves are computed as infima and suprema over sets, and only step 2.1 involves a countable selection, so under hypothesis (a) no choice principle is used and under hypothesis (b) Countable Choice is used exactly as declared.

Remarks

  • The role of cε. The vanishing perturbation cε is the fixed-test mechanism used for the viscous equation ut+H(x,t,Du)=εΔu, where the extra term εΔϕ is locally bounded and tends to 0 uniformly on compact sets for a fixed C1,2 test. This is not directly the theorem's hypothesis for all C1 tests with one common error function; Vanishing viscosity selects the viscosity solution supplies the fixed-test argument and smooth approximation needed there.
  • Choice ledger. Case (a), which is the case used by the vanishing-viscosity argument of this page, is choice-free: a single near-maximal pair and a single compact maximiser suffice. Case (b) needs Countable Choice to turn the defining infimum-of-suprema at the relaxed limit into a sequence of near-maximisers; this is the use of choice declared in the statement.

Depends on

Used by

Dependency tree · two levels

39 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