· 31,477 chars · 42 deps · depth 22 Reason: Proof of the sup/inf-convolution lemma for the penalty-drift equation with a convex penalty.
All structural properties are proved once for the sup-convolution of an arbitrary bounded upper semicontinuous function (attainment by compactness of penalty sublevel sets, semiconvexity as a supremum of affine functions, gradient identification at the maximiser); the inf-convolution case follows by negation. The viscosity inequalities come from transferring a perturbed second-order Taylor majorant of the test function to the maximiser, then using monotonicity of DP, the dissipation inequality, a weighted Young inequality and the modulus of g, and finally letting the perturbation vanish.
Proof
Each result cited below is universally quantified over the data in its own statement, and is applied to the data named at the point of use.
Elementary order and arithmetic manipulations of real numbers (rearranging finite sums, adding inequalities, multiplying an inequality by a nonnegative or by a positive number, reversing an inequality by negation, and the rules for the absolute value) are justified by Elementary Order Arithmetic in an Ordered Field, Elementary Arithmetic in an Ordered Field and Properties of the Absolute Value in an Ordered Field and are not cited individually; the same applies to the vector-space identities in Rn, such as (x+h)−y=(x−y)+h. By clause 2 of the setting the Euclidean distance is dE(x,y)=∥x−y∥, so local extrema relative to D and semicontinuity on D are expressed below through ∥x−y∥. We keep the notation p0, r, θ1, θ2, g1, g2, F, F1, F2 of the statement; in particular p0≤P(y) for every y∈D.
(0.2) Squares. Let s,s′∈R with 0≤s and 0≤s′. Then s≤s′ if and only if s2≤s′2. Indeed, if s≤s′ then s2≤ss′≤s′2; if instead s′<s, then 0<s, and s′2≤s′s<ss (the strict step by claim 10 of Elementary Order Arithmetic in an Ordered Field), so s2≤s′2 fails.
(0.4) A limiting fact. If a,c∈R with 0≤c satisfy a≤cσ for every positive σ∈R, then a≤0. Indeed, suppose 0<a. If c=0 then a≤0, a contradiction; if 0<c, then σ=2ca is positive and gives a≤2a<a, again a contradiction.
Step 1 (A general construction). In Steps 1 to 7, ω:D→R denotes a function that is upper semicontinuous on D and satisfies ∣ω(y)∣≤M, that is −M≤ω(y)≤M, for every y∈D. Put W(y)=ω(y)−ηP(y) for y∈D, and for x,y∈D put
fx(y)=W(y)−2τ1∥x−y∥2.
Since p0≤P(y) and ω(y)≤M,
−M−ηP(y)≤W(y)≤M−ηp0(y∈D),(1.1)
and fx(y)≤W(y) because 0≤2τ1∥x−y∥2. Hence, exactly as in the statement, for each x∈D the set {fx(y):y∈D} is nonempty and bounded above by M−ηp0, and we let wω(x) be its least upper bound, which exists because the real numbers are Dedekind complete. We call y∈D an ω-maximiser at x if wω(x)=fx(y). For ω=u these are the function w and the maximisers of Part A. By the definition of a least upper bound, and by (0.3),
fx(y)≤wω(x)for all x,y∈D,fx(x)=W(x)for all x∈D.(1.2)
Step 2 (Existence and location of ω-maximisers). Fix x∈D and put t=P(x)+η2M and L={y∈D:P(y)≤t}, which is compact by the sublevel property of the penalty P. Let K={y∈D:fx(x)≤fx(y)}. If y∈K, then by (1.2) W(x)=fx(x)≤fx(y)≤W(y), that is ω(x)−ηP(x)≤ω(y)−ηP(y), so ηP(y)≤ω(y)−ω(x)+ηP(x)≤2M+ηP(x) and, dividing by η>0, P(y)≤t. Hence K⊆L and K={y∈L:fx(x)≤fx(y)}.
Multiplying by 2τ>0 gives ∥x−z∥2≤r(x)2, and (0.2) gives
∥x−z∥≤r(x)for every ω-maximiser z at x.(2.1)
Step 3 (Bounds). For x∈D let z be an ω-maximiser at x (Step 2). By (1.2) and (1.1), W(x)=fx(x)≤wω(x)=fx(z)≤W(z)≤M−ηp0, that is
ω(x)−ηP(x)≤wω(x)≤M−ηp0.(3.1)
Step 4 (Semiconvexity and continuity). Let G:D→R, G(x)=wω(x)+2τ1∥x∥2; since 2τ−1=2τ1, it suffices by Semiconvex Function on a Convex Subset of Rn to show that G is convex on D. For y∈D let Ay:Rn→R, Ay(x)=W(y)−2τ1∥y∥2+τ−1(x⋅y). By (0.3), ∥x−y∥2=∥x∥2−2(x⋅y)+∥y∥2, whence
fx(y)+2τ1∥x∥2=Ay(x)(x,y∈D).(4.1)
By claims 1, 2 and 4 of Bilinearity and Symmetry of the Dot Product on Rn, Ay(tx1+(1−t)x2)=tAy(x1)+(1−t)Ay(x2) for all x1,x2∈Rn and t∈R. Now let x1,x2∈D and t∈R with 0≤t≤1; the point xt=tx1+(1−t)x2 lies in D because D is convex. Choose an ω-maximiser zt at xt (Step 2). By (4.1) and (1.2), G(xt)=fxt(zt)+2τ1∥xt∥2=Azt(xt) and Azt(xi)=fxi(zt)+2τ1∥xi∥2≤G(xi) for i=1,2. As 0≤t and 0≤1−t,
Hence wω is semiconvex on D with constant τ−1. Since D is convex and open, the continuity clause for semiconvex functions (with U=S=D) shows: for every x∈D and every positive e∈R there is a positive δ∈R such that every y∈D with ∥y−x∥<δ satisfies ∣wω(y)−wω(x)∣<e. We refer to this continuity property as (4.2).
Step 5 (Gradient). Let x∈D be such that the partial derivative of wω with respect to every variable exists at x, and let z be an ω-maximiser at x. Let ψ:D→R, ψ(x′)=−2τ1∥x′−z∥2=cdE(x′,z)2 with c=−2τ1. By claim 1 of A Scaled Squared Distance to a Point is of Class C2, with Gradient and Hessian (with U=D, a=z), for each i the partial derivative of ψ with respect to the ith variable exists at x and equals 2c(xi−zi)=τ−1(zi−xi). Let χ=wω−ψ on D; by claim 1 of Constants, Coordinate Functions, Sums and Products of Ck Functions on a Euclidean Open Set (applied to the multiple (−1)ψ and then to the sum), ∂iχ(x) exists and ∂iχ(x)=∂iwω(x)−τ−1(zi−xi). For every x′∈D, (1.2) gives W(z)+ψ(x′)=fx′(z)≤wω(x′), that is χ(x′)≥W(z), while χ(x)=wω(x)−ψ(x)=fx(z)−ψ(x)=W(z) because z is an ω-maximiser at x. Hence χ(x′)−χ(x)≥0 for every x′∈D.
We claim ℓ:=∂iχ(x)=0. For real s write x(s)=(x1,…,xi−1,xi+s,xi+1,…,xn). Suppose 0<ℓ. By Partial Derivative on a Euclidean Open Set, applied with the tolerance ℓ, there is a positive δ such that every real s with 0<∣s∣<δ satisfies x(s)∈D and sχ(x(s))−χ(x)−ℓ<ℓ; taking s=−2δ gives 0<sχ(x(s))−χ(x), whereas the numerator is nonnegative and s<0, so this quotient is at most 0: a contradiction. Suppose ℓ<0. With the tolerance −ℓ we obtain δ as before, and s=2δ gives sχ(x(s))−χ(x)<0, whereas the quotient is nonnegative: a contradiction. As the order is total, ℓ=0. Therefore ∂iwω(x)=τ−1(zi−xi) for every i, and by Gradient of a Real-Valued Function on a Euclidean Open Set together with the coordinatewise definitions of the difference and the scalar multiple,
Dwω(x)=τ−1(z−x),∥Dwω(x)∥=τ−1∥x−z∥≤τ−1r(x),(5.1)
the equality by (0.3) and the inequality by (2.1).
Step 6 (Transfer between points). Let x,y∈D and let z be an ω-maximiser at x. By (1.2), W(z)−2τ1∥y−z∥2=fy(z)≤wω(y), and wω(x)=W(z)−2τ1∥x−z∥2, so
Indeed, let β1 be positive such that every x′∈D with ∥x−x′∥<β1 satisfies wω(x′)−φ(x′)≤wω(x)−φ(x). Let ψ be as in Step 5 (with this z); it is of class C2 on D with Dψ(x)=(2c)(x−z)=τ−1(z−x), by claims 2 and 3 of A Scaled Squared Distance to a Point is of Class C2, with Gradient and Hessian. For x′∈D with ∥x−x′∥<β1, (1.2) gives
Let β1 be as in (7a) and let β be the lesser of β1 and β2 (claim 9 of Elementary Order Arithmetic in an Ordered Field). Let y∈D with ∥y−z∥<β, and put h=y−z and x′=x+h. Then ∥h∥<β2, so x′∈D and (7.2) holds; and ∥x−x′∥=∥h∥<β1, so wω(x′)≤wω(x)+φ(x′)−φ(x). Since x′−y=x−z, (1.2) gives W(y)−2τ1∥x−z∥2=fx′(y)≤wω(x′). Together with wω(x)=fx(z)=W(z)−2τ1∥x−z∥2 and (7.2) this yields
Step 8 (Part A, clauses A1 to A5). By Viscosity Subsolution and Supersolution of a Second-Order Equation, u is upper semicontinuous on D, and ∣u(y)∣≤M for y∈D; so Steps 1 to 7 apply with ω=u, for which wu=w and the u-maximisers at x are the maximisers at x of Part A. Clause A1 is Step 2 with (2.1); clause A2 is (3.1); clause A3 is Step 4; clause A4 is (5.1), the parenthetical remark in A4 being claim 1 of A Derivative Matrix is the Jacobian Matrix, and is Unique applied to the single coordinate function w; clause A5 is (6.2).
Step 9 (Part A, clause A6).Semicontinuity. Let x∈D and let e be positive; by (4.2) with ω=u there is a positive δ such that every y∈D with ∥x−y∥<δ satisfies ∣w(y)−w(x)∣<e, hence w(y)<w(x)+e. So w is upper semicontinuous on D.
The subsolution inequality. Let φ:D→R be of class C2 on D and let x∈D be such that w−φ has a local maximum at x relative to D. Choose, in this order: a maximiser z at x (clause A1); put p=Dφ(x), X=D2φ(x), ξ=DP(z) and H=D2P(z); fix a positive σ∈R; and let β be given by (7b) for this σ (with ω=u, so W=u−ηP). By (7a), p=τ−1(z−x). Let Ψ be the function of (7c) with B=X+σIn and μ=η. For y∈D with ∥y−z∥<β, (7.1) reads u(y)−Ψ(y)≤u(z)−ηP(z)=u(z)−Ψ(z); thus u−Ψ has a local maximum at z relative to D. Since u is a viscosity subsolution of F on D and Ψ is of class C2 on D with DΨ(z)=p+ηξ and D2Ψ(z)=X+σIn+ηH, Viscosity Subsolution and Supersolution of a Second-Order Equation and the formula for F give
We bound three of these terms from below. First, the dissipation inequality at z, multiplied by η>0, gives 2κηtrH≤η(1−ε)∥ξ∥2+ηλP(z)+ηC. Second, 0≤2θη2∥ξ∥2. Third, the weighted Young inequality, applied to the points −θp and ξ with the positive number t=(2ε)−1 (its remaining data B and ε play no role in that clause and may be taken to be In and 1), gives 2((−θp)⋅ξ)≤2ε1∥−θp∥2+2ε∥ξ∥2=2εθ2∥p∥2+2ε∥ξ∥2 (using ∥−θp∥=θ∥p∥ from (0.3)); since (−θp)⋅ξ=−θ(p⋅ξ) by claim 4 of Bilinearity and Symmetry of the Dot Product on Rn, halving and multiplying by η gives θη(p⋅ξ)≥−4εθ2η∥p∥2−ηε∥ξ∥2. Inserting the three bounds into (9.1), and using η∥ξ∥2−η(1−ε)∥ξ∥2−ηε∥ξ∥2=0 and 2θ−4εθ2η=2θ1,
Now we compare with the point x. (i) Since z is a maximiser at x, w(x)=u(z)−ηP(z)−2τ1∥x−z∥2≤u(z)−ηP(z), so λw(x)≤λ(u(z)−ηP(z)). (ii) The monotonicity hypothesis with the points x and z gives 0≤(DP(x)−ξ)⋅(x−z); as p=−τ−1(x−z), Bilinearity and Symmetry of the Dot Product on Rn gives ξ⋅p−DP(x)⋅p=τ−1((DP(x)−ξ)⋅(x−z))≥0, so DP(x)⋅p≤ξ⋅p. (iii) By the hypothesis on g, g(z)−g(x)≤∣g(x)−g(z)∣≤ρ(∥x−z∥)≤ρ(r(x)), the last step because ∥x−z∥≤r(x) by clause A1 and ρ is nondecreasing; so g(z)+ηC≤g1(x). Combining (i), (ii), (iii) with (9.2),
The left-hand side does not depend on σ, and 0≤2κn; as σ was an arbitrary positive number, (0.4) gives F1(x,w(x),Dφ(x),D2φ(x))≤0. Since φ and x were arbitrary and w is upper semicontinuous, w is a viscosity subsolution of F1 on D by Viscosity Subsolution and Supersolution of a Second-Order Equation; this is clause A6.
Step 10 (Part B, clauses B1 to B5). By Viscosity Subsolution and Supersolution of a Second-Order Equation, v is lower semicontinuous on D, so −v is upper semicontinuous on D by claim 1 of Semicontinuity Under Negation and Characterization of Continuity; and ∣−v(y)∣=∣v(y)∣≤M. Hence Steps 1 to 7 apply with ω=−v; then W(y)=−v(y)−ηP(y) and fx(y)=−(v(y)+ηP(y)+2τ1∥x−y∥2). For x∈D, the set of additive inverses of the elements of the set displayed in Part B is therefore {fx(y):y∈D}, whose least upper bound is w−v(x); by the definition of w in the statement,
w(x)=−w−v(x)(x∈D),(10.1)
and (by reversing inequalities under negation) this number is indeed the greatest lower bound of the set displayed in Part B. Moreover y∈D is a minimiser at x if and only if it is a (−v)-maximiser at x. Clause B1 is therefore Step 2 with (2.1). Clause B2 follows from (3.1), which reads −v(x)−ηP(x)≤−w(x)≤M−ηp0, by negation. Clause B3 is Step 4, since −w=w−v. For clause B4: since w−v=(−1)w and w=(−1)w−v, claim 1 of Constants, Coordinate Functions, Sums and Products of Ck Functions on a Euclidean Open Set shows that the partial derivatives of w at x exist exactly when those of w−v do, with ∂iw(x)=−∂iw−v(x); so by (5.1) Dw(x)=−τ−1(y−x)=τ−1(x−y) for every minimiser y at x, and ∥Dw(x)∥=∥Dw−v(x)∥≤τ−1r(x) by (0.3); the parenthetical remark is again claim 1 of A Derivative Matrix is the Jacobian Matrix, and is Unique. Clause B5 follows from (6.2) with ω=−v, which reads −w(x)≤−w(y)+2τ1∥x−y∥(3∥x−y∥+2r(y)), by negation.
Step 11 (Part B, clause B6).Semicontinuity. Let x∈D and let e be positive; by (4.2) with ω=−v there is a positive δ such that every y∈D with ∥x−y∥<δ satisfies ∣w(y)−w(x)∣=∣w−v(y)−w−v(x)∣<e, hence w(x)−e<w(y). So w is lower semicontinuous on D.
The supersolution inequality. Let φ:D→R be of class C2 on D and let x∈D be such that w−φ has a local minimum at x relative to D. By (10.1), w−v−(−φ)=−(w−φ) has a local maximum at x relative to D (with the same radius), and −φ=(−1)φ is of class C2 on D with D(−φ)(x)=−Dφ(x) and D2(−φ)(x)=−D2φ(x), by claims 1 and 3 of Constants, Coordinate Functions, Sums and Products of Ck Functions on a Euclidean Open Set. Choose, in this order: a minimiser z at x (clause B1), which is a (−v)-maximiser at x; put p=Dφ(x), X=D2φ(x), ξ=DP(z) and H=D2P(z); fix a positive σ∈R; and let β be given by (7b) for ω=−v, the test function −φ (whose gradient and Hessian at x are −p and −X) and this σ. By (7a), −p=τ−1(z−x), that is p=τ−1(x−z). For y∈D with ∥y−z∥<β, (7.1) reads
Let Ψ be the function of (7c) with B=X−σIn and μ=−η. The last inequality says v(y)−Ψ(y)≥v(z)+ηP(z)=v(z)−Ψ(z) for y∈D with ∥y−z∥<β, so v−Ψ has a local minimum at z relative to D. Since v is a viscosity supersolution of F on D and DΨ(z)=p−ηξ, D2Ψ(z)=X−σIn−ηH, we obtain, with claim 1 of Basic Properties of the Trace and trIn=n as in Step 9, and with (0.3),
We bound two terms from above. First, as in Step 9, 2κηtrH≤η(1−ε)∥ξ∥2+ηλP(z)+ηC. Second, by (0.3), 2θ∥p−ηξ∥2=2θ∥p∥2−θη(p⋅ξ)+2θη2∥ξ∥2; here 2θη2∥ξ∥2=2η(θη)∥ξ∥2≤2ηε∥ξ∥2 because θη≤ε; and the weighted Young inequality, applied to the points −θp and ξ with t=ε−1, gives 2((−θp)⋅ξ)≤εθ2∥p∥2+ε∥ξ∥2, whence, as (−θp)⋅ξ=−θ(p⋅ξ), −θη(p⋅ξ)≤2εθ2η∥p∥2+2ηε∥ξ∥2. Since 2θ+2εθ2η=2θ2, this gives 2θ∥p−ηξ∥2≤2θ2∥p∥2+ηε∥ξ∥2. Inserting both bounds into (11.1) and using −η∥ξ∥2+η(1−ε)∥ξ∥2+ηε∥ξ∥2=0,
Now we compare with the point x. (i) Since z is a minimiser at x, w(x)=v(z)+ηP(z)+2τ1∥x−z∥2≥v(z)+ηP(z), so λ(v(z)+ηP(z))≤λw(x). (ii) As p=τ−1(x−z), the monotonicity hypothesis and Bilinearity and Symmetry of the Dot Product on Rn give DP(x)⋅p−ξ⋅p=τ−1((DP(x)−ξ)⋅(x−z))≥0, so ξ⋅p≤DP(x)⋅p. (iii) g(x)−g(z)≤∣g(x)−g(z)∣≤ρ(∥x−z∥)≤ρ(r(x)) by clause B1 and the monotonicity of ρ, so g2(x)=g(x)−ηC−ρ(r(x))≤g(z)−ηC. Combining (i), (ii), (iii) with (11.2),
As σ was an arbitrary positive number, (0.4) gives 0≤F2(x,w(x),Dφ(x),D2φ(x)). Since φ and x were arbitrary and w is lower semicontinuous, w is a viscosity supersolution of F2 on D by Viscosity Subsolution and Supersolution of a Second-Order Equation; this is clause B6.