TheoremBase

Domination, Monotonicity and Semiconvexity of the Sup-Convolution

Statement

Let MM, R\mathbb{R}, RM\mathbb{R}^{M} and ∥ ⋅ ∥\lVert\,\cdot\,\rVert be as in Sup-Convolution of a Function on RM\mathbb{R}^M, and let x⋅yx\cdot y denote the dot product of points of RM\mathbb{R}^{M}. The set RM\mathbb{R}^{M} is a convex subset of itself, directly from that definition.

Let v:RM→Rv:\mathbb{R}^{M}\to\mathbb{R}, let C∈RC\in\mathbb{R} be an upper bound for the set of values of vv, let λ∈R\lambda\in\mathbb{R} satisfy 0<λ0<\lambda, and let vλv^{\lambda} be the sup-convolution of vv with parameter λ\lambda. Then the following hold for every ξ∈RM\xi\in\mathbb{R}^{M}.

1. (Domination and upper bound) v(ξ)≤vλ(ξ)v(\xi)\le v^{\lambda}(\xi) and vλ(ξ)≤Cv^{\lambda}(\xi)\le C.

2. (Monotonicity in the parameter) If λ′∈R\lambda'\in\mathbb{R} satisfies λ≤λ′\lambda\le\lambda' and vλ′v^{\lambda'} is the sup-convolution of vv with parameter λ′\lambda', then vλ′(ξ)≤vλ(ξ)v^{\lambda'}(\xi)\le v^{\lambda}(\xi).

3. (Semiconvexity) vλv^{\lambda} is semiconvex on RM\mathbb{R}^{M} with constant λ\lambda.

Proofs

Log in to submit a proof.

Loading...

Citations

Loading…

Dependencies

Loading…

Related

0 relations

Curated associations between results. These are editable and subjective — they do not replace the dependency graph, which is derived from the references in the text.

No relations recorded yet.

Comments

Log in to comment.

Loading…