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 be open, , , let be continuous for , and let be a locally bounded family of real functions on that are upper semicontinuous in the subsolution case. Assume one of the two forms of the Hamiltonian condition: (a) uniformly on compact subsets of ; or (b) the exact limit-inferior condition: for all sequences , and one has . Suppose moreover that for every and every local maximum point of there holds where is locally bounded with locally uniformly. Then the upper half-relaxed limit (Half-relaxed limits of a locally bounded family) is a viscosity subsolution of in . If in addition in the relaxed sense with locally uniformly on and the family is locally equicontinuous up to the initial face, then carries the initial datum in the relaxed sense. The dual statement with , 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 ()), which is declared as a dependency; the extraction is the only place where the principle is consumed.
Facts & Assumptions
Given: The open sets , , continuous Hamiltonians , a locally bounded family of real functions on , locally bounded perturbations with locally uniformly, and the half-relaxed limits of Half-relaxed limits of a locally bounded family.
and ; local boundedness makes both real-valued on compact subsets of ; is upper semicontinuous and lower semicontinuous (Half-relaxed limits of a locally bounded family).
At every local maximum of with the assumed inequality holds; a viscosity subsolution of the limit equation is a function that satisfies at every local maximum of the function and test function (Viscosity subsolutions and supersolutions of a first-order equation and of the Cauchy problem).
If has a local maximum at and is a ball on which , then for every the perturbed test has the same value and first jet as at and makes strictly maximised over at (Strictification of a viscosity test function by a quartic perturbation).
Every upper semicontinuous real-valued function on a nonempty compact subset of attains its maximum there (Semicontinuous extreme value theorem on compact Euclidean sets).
Countable Choice is the principle that every sequence of nonempty sets has a sequence of choices with (The Axiom of Countable Choice ()).
A compact metric space has a finite subcover from every intrinsic open cover (Open cover, subcover, compact metric space, and compact subset of a metric space); for a compact Euclidean subset, every family of ambient open balls covering it has finitely many members covering it, also with their indices retained (A subset of a metric space is open in the subspace metric exactly when it is the trace of an open set of the ambient space, and it is compact as a metric space in its own right exactly when every family of open subsets of the ambient space covering it, indexed or not, has finitely many members covering it, clauses 2--3).
Local equicontinuity up to the initial face gives each a continuous trace and a common local modulus there; the relaxed initial inequality implies .
Proof
Case (a): the strict-contact case, choice-free. Let and let have a strict local maximum at . Choose with and strict inequality away from . Assume for contradiction that . By continuity there is such that for . The compact annulus has a strict gap by [F1, F4]. Write and . For each , the defining infimum for gives such that whenever and ; shrink so also there. Use the collection of all pairs satisfying these bounds; their balls cover without choosing one radius at each point. By compactness and [F6], finitely many such balls cover ; let . For every and , these bounds give for some . Uniform convergence on compact subsets and local uniform convergence provide such that for and , the corresponding upper-test residual with gradient is and . Choose and then so that and when . By [F1] there is one pair with , and . Let maximise the upper semicontinuous function on the compact ball , possible by [F4]. Its value is , so the uniform annulus bound forces . Thus has a local maximum at . Writing and , the test has time derivative and spatial gradient ; its residual is while , contradicting the assumed subsolution inequality. Hence at every strict local maximum.
The initial trace. Assume the relaxed initial inequality and data convergence of the statement, and use the traces of [F7]. Fix and . By local equicontinuity and continuity of there is a neighbourhood of such that, for all sufficiently small and , Shrink to a neighbourhood whose closure lies in . For each sufficiently close to , the neighborhoods in the definition of can be taken inside , so the same bound gives . Therefore ; letting proves the relaxed subsolution initial condition. The lower-limit argument is the dual one.
Case (b): the strict-contact case with near-maximiser extraction. Assume the exact limit-inferior condition and let and be as in step 1.1. For each , consider triples with , , , , and a maximiser of on . This set is nonempty by [F1] and [F4]; Countable Choice [F5] selects triples . Then , and the maximal values satisfy . Fix any . The strict maximum of gives a positive gap on the compact annulus ; the finite-cover argument of step 1.1 then bounds strictly below on this annulus for all sufficiently small . Since and the maximizing values are at least that limit minus , eventually . As was arbitrary, . By taking the canonical strictly decreasing subsequence of (at each stage use the least later index with smaller , which exists because ) and relabelling, we may assume ; then still. Eventually is interior to , so is a local upper test for there. Thus Writing , the extra time derivative tends to zero. Since the gradients converge and , taking the limit inferior of the displayed inequality and using (b) gives . Condition (a) implies (b) by uniform convergence on compact sets, so this proves the strict-contact case.
General contacts, the dual statement and conclusion. If merely has a local maximum at , 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 , so the resulting inequality is exactly . Hence 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 by and local maxima by local minima, shows that 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 . The vanishing perturbation is the fixed-test mechanism used for the viscous equation , where the extra term is locally bounded and tends to uniformly on compact sets for a fixed test. This is not directly the theorem's hypothesis for all 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
- Half-relaxed limits of a locally bounded family
- Viscosity subsolutions and supersolutions of a first-order equation and of the Cauchy problem
- Discontinuous viscosity solutions through the two envelopes
- Strictification of a viscosity test function by a quartic perturbation
- The Hamilton--Jacobi Cauchy problem and its classical solutions
- Semicontinuous extreme value theorem on compact Euclidean sets
- Open cover, subcover, compact metric space, and compact subset of a metric space
- A subset of a metric space is open in the subspace metric exactly when it is the trace of an open set of the ambient space, and it is compact as a metric space in its own right exactly when every family of open subsets of the ambient space covering it, indexed or not, has finitely many members covering it
- The Axiom of Countable Choice ($\mathrm{AC}_\omega$)
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
- Michael G. Crandall, Hitoshi Ishii and Pierre-Louis Lions, User's guide to viscosity solutions of second order partial differential equations, Bulletin of the American Mathematical Society 27 (1992), 1--67 (complete article) (standard reference, not scraped)
- Alberto Bressan, Viscosity Solutions of Hamilton--Jacobi Equations and Optimal Control Problems, complete author lecture notes, Penn State University (PDF records Fall 2019 revision) (standard reference, not scraped)
- Hung Vinh Tran, Hamilton--Jacobi Equations: Theory and Applications, 2020 preliminary author manuscript of AMS Graduate Studies in Mathematics 213 (complete text) (standard reference, not scraped)