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 , , and let be continuous. Suppose , where is upper semicontinuous and bounded above, is lower semicontinuous and bounded below, and their restrictions to are respectively a viscosity subsolution and a viscosity supersolution of . For put and for . Then: (1) every upper contact for at satisfies (2) every lower contact for at satisfies moreover and uniformly in as ; (3) for every , define on when , and set when or . Then attains a finite maximum, and every maximiser has . A maximum may occur on an initial face (that is, with or ). No choice principle is used.
Facts & Assumptions
Given: , continuous , an upper semicontinuous function bounded above, a lower semicontinuous bounded below, whose restrictions to are a viscosity subsolution and supersolution of , the functions , for , and the functions of the statement, read in (The extended real line , its order, and the arithmetic that is left undefined).
A viscosity subsolution of in satisfies at every local maximum of with ; a viscosity supersolution satisfies the reverse inequality at every local minimum of (Viscosity subsolutions and supersolutions of a first-order equation and of the Cauchy problem).
The function is on with derivative ; sums of functions are with the sum of the total derivatives (The total (Fréchet) derivative as the linear first-order approximation with remainder), and a local maximum of is a local maximum of because the two differences are the same function.
Upper semicontinuity of and lower semicontinuity of are the relative notions on the Euclidean set (Upper and lower semicontinuity on subsets of ); is upper semicontinuous exactly when every superlevel set is closed.
A subset of is compact if and only if it is closed and bounded (Heine-Borel in : with the Euclidean metric a subset of is compact if and only if it is closed and bounded, and the proof by bisection uses no choice principle; the same holds on the real line).
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
The subsolution penalty. Let and suppose has a local maximum at . Then has a local maximum at for , which is on with and by [F2]; the subsolution inequality [F1] gives , that is .
The supersolution penalty and the uniform terminal limits. If has a local minimum at , then has a local minimum at for , with ; the supersolution inequality [F1] gives . For the terminal limits, and for every , and the right-hand sides are independent of and tend to , respectively , as .
Existence and finiteness of the maximum of . On the product space the function is upper semicontinuous: it is built from the upper semicontinuous , the function , which is upper semicontinuous because is lower semicontinuous, and continuous terms, and at a sequence with or it tends to uniformly, since and ; hence it takes the value on the terminal faces in the upper-semicontinuous sense fixed in [F3]. It is bounded above by , and its value at any diagonal point with is finite, so . For each the set is nonempty by the definition of , closed by upper semicontinuity [F3], bounded because on , and disjoint from the terminal faces because is finite there; hence each is a compact subset of by [F4]. The family is nested, so it has the finite intersection property, and [F5] applied in the compact set gives a point of , at which for every , hence ; since is an upper bound, there. Thus the maximum is attained and equals the finite number , and every maximiser has because the terminal faces carry the value .
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 or , since only the terminal faces , carry the value .
Remarks
- Why the penalties are the right shape. Each penalty is continuous on with derivative diverging at , so it produces the exact interior residual shift , whose magnitude is at least (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
- Viscosity subsolutions and supersolutions of a first-order equation and of the Cauchy problem
- The Hamilton--Jacobi Cauchy problem and its classical solutions
- The total (Fréchet) derivative $Df(a)$ as the linear first-order approximation with $o(\|h\|_2)$ remainder
- Upper and lower semicontinuity on subsets of $\mathbb R^n$
- The extended real line $\overline{\mathbb{R}} = \mathbb{R} \cup \{-\infty, +\infty\}$, its order, and the arithmetic that is left undefined
- Heine-Borel in $\mathbb{R}^n$: with the Euclidean metric a subset of $\mathbb{R}^n$ is compact if and only if it is closed and bounded, and the proof by bisection uses no choice principle; the same holds on the real line
- A metric space is compact if and only if every family of closed subsets with the finite intersection property has nonempty intersection
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
- 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)
- 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)