Home On the convexity theory of generating functions
Article Open Access

On the convexity theory of generating functions

  • Grégoire Loeper and Neil S. Trudinger ORCID logo EMAIL logo
Published/Copyright: January 14, 2025

Abstract

In this paper, we extend our convexity theory for C 2 cost functions in optimal transportation to more general generating functions, which were originally introduced by the second author to extend the framework of optimal transportation to embrace near field geometric optics. In particular we provide an alternative geometric treatment to the previous analytic approach using differential inequalities, which also gives a different derivation of the invariance of the fundamental regularity conditions under duality. We also extend our local theory to cover the strict version of these conditions for C 2 cost and generating functions.

2010 Mathematics Subject Classification: 35J60; 49J60; 52A99; 78A05

1 Introduction

Generating functions were introduced by the second author in [1] as nonlinear extensions of affine functions in Euclidean space for the purpose of extending the framework of optimal transportation to embrace near field geometric optics. Regularity and classical existence results depend on an underlying convexity theory which is of interest in its own right. Following our previous treatment in the optimal transportation case [2], we develop in this paper the convexity theory under minimal smoothness assumptions on the generating function. As in [2], the approach is largely geometric, somewhat shadowing that in [3], and as a byproduct we obtain a completely different derivation of the invariance of our conditions under duality, from the complicated analytic calculation in [1].

A generating function can be defined on the product of two Riemannian manifolds and the real line. Here as in [1] we will restrict attention to the Euclidean space case so that our generating functions are defined on domains Γ R n × R n × R , whose projections,

I ( x , y ) = { z R | ( x , y , z ) Γ } ,

are open intervals. Assuming gC 2(Γ), g z ≠ 0 in Γ, normalised so that g z < 0 in Γ, and denoting

(1.1) U = { ( x , g ( x , y , z ) , g x ( x , y , z ) ) | ( x , y , z ) Γ } ,

we then have the following two fundamental conditions from [1],

  • A1: For each ( x , u , p ) U , there exists a unique point (x, y, z) ∈ Γ satisfying

    g ( x , y , z ) = u , g x ( x , y , z ) = p .

  • A2: det E ≠ 0, in Γ, where E is the n × n matrix given by

    E = [ E i , j ] = g x , y ( g z ) 1 g x , z g y .

    In the special case of optimal transportation,

    (1.2) g ( x , y , z ) = c ( x , y ) z , Γ = D × R , g z = 1 , I ( x , y ) = R , E = c x , y ,

    where D is a domain in R n × R n and c C 2 ( D ) is a cost function, satisfying conditions A1 and A2 in [4].

    By defining Y(x, u, p) = y and Z(x, u, p) = z in A1, the mapping Y together with the dual function Z are generated by the equations

    (1.3) g ( x , Y , Z ) = u , g x ( x , Y , Z ) = p .

    Since the Jacobian determinant of the mapping (y, z) → (g x , g)(x, y, z) is g z  det E, ≠ 0 by A2, the functions Y and Z are C 1 smooth. By differentiating (1.3) with respect to p, we also have Y p = E −1.

    Our next fundamental condition is expressed in terms of the matrix function A on U , given by

    (1.4) A ( x , u , p ) = g x x ( x , Y ( x , u , p ) , Z ( x , u , p ) ) ,

    and extends condition G3w in [1] to non differentiable A. For its formulation we use the notation U ( x , u ) to denote the projection { p R n | ( x , u , p ) U } .

  • A3w: The matrix function A is co-dimension one convex in U , with respect to p, in the sense that the function (, ξ)(x, u, ⋅) is convex along line segments in U ( x , u ) orthogonal to ξ, for all ξ R n , ( x , u ) R n × R .

    We also have a strict version of condition A3w, extending condition G3 in [1], namely

  • A3s: The matrix function A is locally uniformly co-dimension one convex in U , with respect to p, in the sense that the function (, ξ)(x, u, ⋅) is uniformly convex along closed line segments in U ( x , u ) orthogonal to ξ, for all ξ R n , ( x , u ) R n × R .

    Note that here we call a function f : I R on a closed interval I uniformly convex if the function, tf(t) − δt 2, is convex on I for some positive constant δ.

    When A is twice differentiable in p then conditions A3w, (A3s), can be expressed as

    (1.5) ( D p k p l A i j ) ξ i ξ j η k η l 0 , ( > 0 ) ,

    in U , for all ξ , η R n such that ξη = 0.

    Historically these conditions arose from condition A3 for local regularity in optimal transportation introduced in [4], with the weak version A3w subsequently introduced in [5], [6] for global regularity. We will express them in the non smooth case more precisely in Section 2 and moreover show that they can also be formulated for generating functions gC 1(Γ) satisfying just condition A1, corresponding to the optimal transportation case in [7], where it is also shown that condition A3w, in the smooth case (1.5), is necessary for the regularity and convexity theories.

    The strict monotonicity property of the generating function g with respect to z, enables us to define a dual generating function g*,

    (1.6) g ( x , y , g * ( x , y , u ) ) = u ,

    with (x, y, u) ∈ Γ* ≔ {(x, y, g(x, y, z))|(x, y, z) ∈ Γ}, g x * = g x / g z , g y * = g y / g z and g u * = 1 / g z , which leads to a dual condition to A1, which is also critical for our convexity theory, namely

  • A1*: The mapping Q: = −g y /g z is one-to-one in x, for all (y, z) such that (x, y, z) ∈ Γ.

    Since the Jacobian matrix of the mapping xQ(x, y, z) is −E t /g z where E t is the transpose of E, its determinant will not vanish when condition A2 holds, that is A2 is self dual. We will prove the invariance of conditions A3w and A3s under duality from the local convexity theory in Section 2, which also provides an alternative proof of the case gC 4(Γ) in [1], which is done there through explicit calculation of D pp A. Note that by setting

    P ( x , y , u ) = g x x , y , g * ( x , y , u ) ,

    we may also express condition A1 in the same form as A1*, namely the mapping P is one-to-one in y, for all (x, u) such that (x, y, u) ∈ Γ*.

2 Local convexity

We recall the definition from [1] that a domain Ω is g-convex, (uniformly g-convex), with respect to ( y 0 , z 0 ) R n × R , if (Ω, y 0, z 0) ⊂ Γ and the image Q 0(Ω) ≔ Q(⋅, y 0, z 0)(Ω) is convex, (uniformly convex), in R n . In this section, we will examine the relationship between local g-convexity at boundary points of g-sections and condition A3w. First we note that we can write condition A3w in the form:

(2.1) ( A ξ , ξ ) ( x 0 , u 0 , p θ ) ( 1 θ ) ( A ξ , ξ ) ( x 0 , u 0 , p 0 ) + θ ( A ξ , ξ ) ( x 0 , u 0 , p 1 ) ,

for any ( x 0 , u 0 , [ p 0 , p 1 ] ) U , p θ = (1 − θ)p 0 + θp 1, 0 ≤ θ ≤ 1 and ξ·(p 1p 0) = 0. Here and throughout we use the notation [p 0, p 1] to denote the closed straight line segment joining points p 0 and p 1 in R n .

Defining now

(2.2) y θ = Y ( x 0 , u 0 , p θ ) , z θ = Z ( x 0 , u 0 , p θ ) = g * ( x 0 , y θ , u 0 ) , h θ ( x ) = g ( x , y θ , z θ ) g ( x , y 0 , z 0 ) ,

for x Ω 0 = U ( u 0 , [ p 0 , p 1 ] ) : = { x | ( x , u 0 , [ p 0 , p 1 ] ) U } , θ ∈ (0, 1], we see that (2.1) can be written as

(2.3) D 2 h θ ξ , ξ ( x 0 ) θ D 2 h 1 ξ , ξ ( x 0 ) ,

for all ξ R n such that ξ·Dh θ (x 0) = 0. This leads to the following geometric interpretation of condition A3w. Namely for the section S θ = {x ∈ Ω0|h θ (x) < 0}, the second fundamental form Π θ of ∂S θ at x = x 0, with respect to an inner normal, is non-decreasing in θ. Clearly (2.3) is equivalent to Π θ ≤ Π1 and the general case follows by replacing p 1 by p θ for any θ′ ∈ (0, 1]. Note that Π θ is well defined at x 0 since ∂S θ C 2 in some neighbourhood N 0 of x 0. By extending the segment [p 0, p 1] beyond p 0, we also have that Π θ is bounded independently of θ. From (2.3), following the optimal transportation case in [2], it also follows that condition A3w can be expressed in terms of g and g x only, using just condition A1, namely:

  • A3v: For any ( x 0 , u 0 , [ p 0 , p 1 ] ) U , we have

g ( x , y θ , z θ ) max { g ( x , y 0 , z 0 ) , g ( x , y 1 , z 1 ) } + o | x x 0 | 2 ,

for x ∈ Ω0, for any θ ∈ (0, 1).

Note that the “o” term in condition A3v may depend on θ.

In this section, we will prove the following further equivalent characterisations of condition A3w, when condition A2 and the dual condition A1* are also satisfied. As well as providing the relationship between condition A3w and the local g-convexity of sections S θ , the result also strengthens condition A3v by removing the “o” dependence.

Theorem 2.1.

Let gC 2(Γ) be a generating function satisfying conditions A1, A2, and A1*. Then condition A3w is invariant under duality and is equivalent to the conditions:

  • A3w(1): For all ( x 0 , u 0 , [ p 0 , p 1 ] ) U , the set S 1 is locally g-convex at x 0, with respect to (y 0, z 0);

  • A3w(2): For all ( x 0 , u 0 , [ p 0 , p 1 ] ) U , there exists a neighbourhood N 0 of x 0 such that

g ( x , y θ , z θ ) max { g ( x , y 0 , z 0 ) , g ( x , y 1 , z 1 ) }

for all x N 0 , θ ∈ [0, 1].

Proof.

We will prove Theorem 2.1 by proving the implications, A3wA3w(1) ⇒ A3w(2)*. The remaining assertions follow automatically, since as remarked above, A3w(2) ⇒ A3vA3w, when gC 2(Γ).

  1. A3wA3w(1).

    This is the main component of the proof. First, in a neighbourhood N 0 of x 0, we represent the level sets ∂S θ as graphs given by x n = η θ (x′), x′ = (x 1, …, x n−1), tangent at x 0 to the hyperplane {x n = 0}, with x n > η θ in N 0 S θ . Accordingly we then have D i η x 0 = D i h ( x 0 ) = 0 , i = 1, …n − 1, D n h(x 0) = −θ|p 1p 0| and for x * = x , x n S θ ,

    (2.4) 1 θ D h θ ( x * ) 1 θ D h θ ( x 0 ) = p 1 p 0

    as x* → x 0, uniformly in θ ∈ (0, 1]. To verify (2.4), we write

    (2.5) 1 θ D h θ ( x * ) = 1 θ g x x * , y θ , z θ g x x * , y 0 , z 0 = E x * , y θ , z θ E 1 x 0 , y θ , z θ ( p 1 p 0 ) ,

    for some θ′ ∈ (0, θ), and then use the continuity of E = g x , y ( g z ) 1 g x , z g y with respect to x. Defining

    y 1 * = Y x * , u 0 * , p 1 * , z 1 * = Z x * , u 0 * , p 1 *

    where

    u 0 * = g x * , y 0 , z 0 , p 0 * = g x x * , y 0 , z 0 , p 1 * = p 0 * + 1 θ D h θ ( x * ) ,

    it then follows that y 1 * and z 1 * also converge respectively to y 1 and z 1 as x* → x 0, uniformly in θ ∈ (0, 1]. Letting ν θ = −Dh θ /|Dh θ | denote the unit inner normal to ∂S θ and setting for τ R n 1 , τ = τ θ = τ τ . ν θ ν θ , tangent to ∂S θ , we now apply condition A3w, or more precisely the monotonicity of Π θ at a point x * = x , x n S θ N 0 , to obtain

    D i j η θ ( x ) τ i τ j 1 + | D η θ | 2 g i j x * , y 1 * , z 1 * g i j x * , y 0 , z 0 τ i τ j | p 1 * p 0 * | .

    Sending x* to x 0 and using also this time the continuity of g xx , as well as the boundedness of Π θ to control the dependence on ν θ , we then conclude for any unit vector τ R n 1 ,

    (2.6) D i j η θ ( x ) τ i τ j D i j η 1 ( x ) τ i τ j + o ( 1 )

    as x x 0 , uniformly for θ ∈ (0, 1]. From (2.6) we now have the uniform lower bound for η 1,

    (2.7) η 1 ( x ) η θ ( x ) + o | x x 0 | 2

    as x x 0 , uniformly for θ ∈ (0, 1]. Writing (2.7) in terms of h θ we then obtain

    (2.8) 1 θ h θ ( x ) max { 0 , h 1 ( x ) } + o | x x 0 | 2

    for x near x 0, independently of θ. Note that by exchanging g 0 and g 1 in (2.8), we obtain a stronger version of condition A3v, without assuming condition A1*, where the “o” dependence is independent of θ, namely

    (2.9) g ( x , y θ , z θ ) max { g ( x , y 0 , z 0 ) , g ( x , y 1 , z 1 ) } + θ ( 1 θ ) o | x x 0 | 2 .

    Letting θ approach 0 in (2.8), we also obtain

    g z ( x , y 0 , z 0 ) h 0 max { h 1 ( x ) , 0 } + o | x x 0 | 2 ,

    where

    (2.10) h 0 = E 1 ( x 0 , y 0 , z 0 ) ( p 1 p 0 ) [ Q ( x , y 0 , z 0 ) Q ( x 0 , y 0 , z 0 ) ]

    is the defining function of the g-hyperplane, S 0 = {h 0 = 0}. Now using condition A1*, making the coordinate transformation xq = Q(x, y 0, z 0) and defining S ̃ 1 = Q ( S 1 ) , h ̃ 1 ( q ) = h 1 ( x ) , so that h ̃ 1 is a defining function for S ̃ 1 near q 0 = Q(x 0, y 0, z 0), we then obtain, using the Lipschitz continuity of Q −1(⋅, y 0, z 0) and the positivity of −g z (⋅, y 0, z 0),

    h ̃ 1 ( q ) l ( q ) o ( | q q 0 | ) 2

    where l is an affine function. It thus follows that the set S ̃ 1 = { h ̃ 1 < 0 } is locally convex at q = q 0 and we complete the proof of assertion (i).

  2. A3w(1) ⇒ A3w(2)*

    First we note that the local g-convexity of S 1 at x 0 means that there exists a neighbourhood N 0 of x 0 such that S 1 N 0 is g-convex with respect to y 0, z 0. Consequently for any point x S 1 N 0 , the g-segment joining x 0 and x also lies in S 1 N 0 . Defining now q 0 = Q(x 0, y 0, z 0), q 1 = Q(x, y 0, z 0) and q θ = (1 − θ)q 0 + θq 1, we thus have

    g ( x θ , y 1 , z 1 ) g ( x θ , y 0 , z 0 ) : = u θ ,

    for x θ = Q −1(q θ , y 0, z 0), which is equivalent to

    g * ( x θ , y 1 , u θ ) z 1 = g * ( x 0 , y 1 , u 0 ) .

    Taking y = y 1, x 1 = x and exchanging x 0 and x 1, we thus obtain for ( y 0 , z 0 , [ q 0 , q 1 ] ) V : = { y , z , Q ( x , y , z ) | ( x , y , z ) Γ } ,

    (2.11) g * ( x θ , y , u θ ) max g * ( x 0 , y , u 0 ) , g * ( x 1 , y , u 1 )

    for y in some neighbourhood N 0 * of y 0 and θ [ 0,1 ] , provided x 1 is sufficiently close to x 0. By expressing the interval [q 0, q 1] as the union of sufficiently small subintervals we then conclude the dual condition A3w(2)*.

    From (i) and (ii) we then have A3wA3w(1) ⇒ A3w* ⇒ A3w(2) ⇒ A3w so that Theorem 2.1 is completely proved.□

We remark here that the proof of Theorem 2.1 is somewhat different from that of the corresponding results in the optimal transportation case in Theorem 1.2 of [2] in that it avoids the measure theoretic argument in Lemma 2.3 of [2]. When the third derivatives g xxy and g xxz exist, so that the matrix function A is differentiable with respect to p and u, implication (i) follows directly from Lemma 2.4 in [1], in accordance with the optimal transportation case in Section 2.1 of [2]. Alternatively, in this case the mapping Q will be twice differentiable in x and we can simplify the proof of implication (i) through a C 2 coordinate change to express h 0 as an affine function in the q variable so that the result then follows straight from the monotonicity of Π θ . From the boundedness of Π θ , we at least have as in [2], that the g-hyperplane H 0 is C 1,1 smooth near x 0 so that in the q coordinates we obtain the existence of a local supporting hyperplane almost everywhere near x 0 and may then use the continuity of E, which implies H 0 is C 1 smooth, to obtain the local g-convexity in implication (i). We also note that here the equivalence of A3w and A3w(2) for C 4 cost functions in optimal transportation goes back to [7], where it is proved by approximation from the global regularity in [6] and also plays a fundamental role in showing the sharpness of condition A3w for regularity.

By modification of the preceding arguments we can prove analogous equivalent versions of the strong condition A3s, including its invariance under duality. For this it is convenient to fix a subset U U . Then we can write condition A3s in the form

(2.12) ( A ξ , ξ ) ( x 0 , u 0 , p θ ) ( 1 θ ) ( A ξ , ξ ) ( x 0 , u 0 , p 0 ) + θ ( A ξ , ξ ) ( x 0 , u 0 , p 1 ) δ θ ( 1 θ ) | p 1 p 0 | 2 | ξ | 2 ,

for any ( x 0 , u 0 , [ p 0 , p 1 ] ) U , 0 ≤ θ ≤ 1, ξ·(p 1p 0) = 0 and some positive constant δ, depending on U . In place of (2.3), we then have, for h θ , δ h θ δ 2 | p θ p 0 | 2 | x x 0 | 2 ,

(2.13) 1 θ D 2 h θ , δ ξ , ξ ( x 0 ) D 2 h 1 , δ ξ , ξ ( x 0 )

for all ξ R n such that ξ·Dh θ,δ (x 0) = 0. Now, setting S θ,δ = {x ∈ Ω0|h θ,δ (x) < 0}, we can state the following strong version of Theorem 2.1.

Theorem 2.2.

Let gC 2(Γ) be a generating function satisfying conditions A1, A2, and A1*. Then condition A3s is invariant under duality and is equivalent to the conditions:

  • A3s(1): For all ( x 0 , u 0 , [ p 0 , p 1 ] ) U U , the set S 1,δ is locally g-convex at x 0, with respect to (y 0, z 0);

  • A3s(2): For all ( x 0 , u 0 , [ p 0 , p 1 ] ) U U , there exists a neighbourhood N 0 of x 0 and constant δ 0 > 0 such that

(2.14) g ( x , y θ , z θ ) max { g ( x , y 0 , z 0 ) , g ( x , y 1 , z 1 ) } δ 0 [ θ ( 1 θ ) | p 1 p 0 | | x x 0 | ] 2

for all x N 0 , θ ∈ [0, 1].

Proof.

First we may prove that A3s(2) ⇒ A3s by modification of the A3w case, A3v ⇒ A3w. Here though we should restrict the range of θ, a convenient choice being θ = 1/2, which would then imply S 1 , δ N 0 S θ , δ for δ = δ 0/6, if A3s(2) holds, and hence (2.14) for θ = 1/2, which still suffices to obtain A3s in general.

Next, the implication A3sA3s(1) follows by replacing h θ by h θ,δ in the proof of the corresponding case (i) in Theorem 2.1.

To prove A3s(1) ⇒ A3s(2)* we fix a neighbourhood N 0 of x 0 such that S 1 , δ N 0 is g-convex with respect to y 0, z 0 and for x = x 1 S 1 , δ N 0 , we define q θ , x θ and u θ as in the proof of case (ii) of Theorem 2.1. Then we have

g ( x θ , y 1 , z 1 ) + δ 2 | p 1 p 0 | 2 | x θ x 0 | 2 g ( x θ , y 0 , z 0 ) = u θ ,

so that by the mean value theorem,

g * ( x θ , y 1 , u θ ) z 1 + δ 2 | p 1 p 0 | 2 | x θ x 0 | 2 g u * x θ , y 1 , u * ,

for some u*, satisfying

g ( x θ , y 1 , z 1 ) u * g ( x θ , y 1 , z 1 ) + δ 2 | p 1 p 0 | 2 | x θ x 0 | 2 .

Consequently, since g u * < 0 , we obtain for y = y 1 sufficiently close to y 0,

g * ( x θ , y 1 , u θ ) g * ( x 0 , y 1 , u 0 ) κ 0 δ θ 2 | q 1 q 0 | 2 | y y 0 | 2

for some positive constant κ 0, depending on g and U . Exchanging x 0 and x 1, and consequently replacing θ by 1 − θ, we then obtain, in place of (2.11),

(2.15) g * ( x θ , y , u θ ) max g * ( x 0 , y , u 0 ) , g * ( x 1 , y , u 1 ) δ 0 * [ θ ( 1 θ ) | q 1 q 0 | | y y 0 | ] 2

for some constant δ 0 * , for y in some neighbourhood N 0 * of y 0 and θ [ 0,1 ] , provided x 1 is sufficiently close to x 0, and hence infer the dual condition A3s(2)*.

Corresponding to the proof of Theorem 2.1, which also can be viewed as the limit case δ = 0, we then have A3sA3s(1) ⇒ A3s* ⇒ A3s(2) ⇒ A3s, which completes the proof of Theorem 2.2.□

The case A3sA3s(2) in Theorem 2.2 extends to C 2 generating functions the corresponding result in Lemma 4.5 in [8], which is proved there, similarly to the basic convexity results under A3w, by using the differential inequality approach. We may also express the condition A3s(1) in terms of a local uniform g-convexity of S 1. Note also that, without assuming the dual condition A1*, we obtain from the proof of the implication A3sA3s(1), (in particular from the estimate (2.8) applied to h θ,δ ), that condition A3s is equivalent to a strong form of condition A3v, corresponding to (2.9), namely

(2.16) g ( x , y θ , z θ ) max { g ( x , y 0 , z 0 ) , g ( x , y 1 , z 1 ) } θ ( 1 θ ) δ | p 1 p 0 | 2 | x x 0 | 2 + o | x x o | 2 ,

for all ( x 0 , u 0 , [ p 0 , p 1 ] ) U U , x ∈ Ω0 and some positive constant δ, with the “o” dependence independent of θ.

3 Global convexity

In this section we deduce from Theorem 1.1, fundamental properties of g-convex functions when g is only assumed C 2. First we recall from [1] that a function uC 0(Ω) is called g-convex in Ω, if for each x 0 ∈ Ω, there exists ( y 0 , z 0 ) R n × R such that (Ω, y 0, z 0) ⊂ Γ and

(3.1) u ( x 0 ) = g ( x 0 , y 0 , z 0 ) , u ( x ) g ( x , y 0 , z 0 )

for all x ∈ Ω. If u is differentiable at x 0, then y 0 = Tu(x 0): = Y(x 0, u(x 0), Du(x 0)), while if u is twice differentiable at x 0, then

(3.2) D 2 u ( x 0 ) g x x ( x 0 , y 0 , z 0 ) = A ( , u , D u ) ( x 0 )

We also refer to functions of the form g(⋅, y 0, z 0) as g -affine and as a g -support at x 0 in Ω if (3.1) is satisfied. Note also that the g-convexity of a function u in Ω implies its local semi-convexity.

If u is a g-convex function on Ω, extending the differentiable case, we define the g -normal mapping of u at x 0 ∈ Ω to be the set:

T u ( x 0 ) = y 0 R n Ω Γ y 0 , z 0  and  u ( x ) g ( x , y 0 , z 0 )  for all  x Ω ,

where z 0 = g*(x 0, y 0, u 0), u 0 = u(x 0). Note that if u = g(⋅, y, z) is g-affine, then Tu = y, while in general

T u ( x 0 ) Σ 0 = Σ u ( x 0 ) Y ( x 0 , u ( x 0 ) , u ( x 0 ) ) ,

where ∂u denotes the sub differential of u, provided the extended one jet, J 1 [ u ] ( x 0 ) = [ x 0 , u ( x 0 ) , u ( x 0 ) ] U

Next if g 0 = g(⋅, y 0, z 0) is a g-affine function, we define the section of a g-convex function u with respect to g 0 by

S ( u , g 0 ) = x Ω u ( x ) < g ( x , y 0 , z 0 )

We can also have a notion of closed sections, (as used in [2]), given by

S ̃ ( u , g 0 ) = x Ω u ( x ) g ( x , y 0 , z 0 ) ,

which includes, as a special case, the contact set of u with respect to g 0,

S 0 ( u , g 0 ) = S ̃ ( u , g 0 ) = x Ω u ( x ) = g ( x , y 0 , z 0 ) ,

when g 0 is a g-support of u.

Our approach here will be based on the following global extension of Theorem 2.1(i), which extends result (ii) in Theorem 1.2 in [2] to the generating function case.

Theorem 3.1.

Assume g satisfies A1, A2, A1* and A3w, uC 0(Ω) is g-convex and g 0 = g(⋅, y 0, z 0) is g-affine in a domain Ω. Assume also:

  1. Ω is g-convex with respect to (y 0, z 0);

  2. ( , g 0 , D g 0 , g x ( , y , g * ( , y , g 0 ) ) ) ( Ω ) U for all yTu(Ω).

Then the sections S = S(u, g 0) and S ̃ = S ̃ ( u , g 0 ) are also g-convex with respect with respect to (y 0, z 0).

Proof.

To prove Theorem 3.1 we follow the corresponding argument in the optimal transportation case [2], modified in accordance with the proof of Lemma 2.3 in [8]. First we replace Ω by a C 1 subdomain Ω′ ⊂ ⊂Ω, which is also g-convex with respect to (y 0, z 0) and consider the special case, u = g 1 for some fixed g-affine function g 1 = g(⋅, y 1, z 1). From condition (ii) we then have (x, y 1, z) ∈ Γ for all x ∈ Ω′, zz 1 and g(x, y 1, z) ≥ g 0(x) − ϵ, for some constant ϵ > 0. Now suppose that the set S 1 = S(g 1, g 0) has two disjoint components. By increasing z 1 and writing g 1,δ = g(⋅, y 1, z 1 + δ), S 1,δ = S(g 1,δ , g 0) for δ ≥ 0, we then obtain, from the g-convexity of Ω′, that the section S 1,δ has two distinct components for some δ ≥ 0, touching in Ω ̄ . From the local convexity, A3w(1) in Theorem 2.1, this can only happen at a point x ̂ Ω . For sufficiently small ρ, we then have that g 1,δ < g 0 in B ρ Ω { x ̂ } while g 1,δ (x) > g 0(x) for x = x ̂ + t ν , 0 < t < ρ, where ν denotes the unit inner normal to Ω′ at x ̂ , which contradicts the local g-convexity of Ω′ at x ̂ . Consequently S 1 is connected and since it is locally g-convex with respect to (y 0, z 0), it is also globally g-convex with respect to (y 0, z 0). Replacing S 1 by S 1,δ and letting δ → 0, we also obtain the g-convexity of S ̃ 1 = S ̃ ( g 1 , g 0 ) .

For the general case we write for u, g-convex in Ω,

S ̃ ( u , g 0 ) = { S ̃ ( g 1 , g 0 ) | g 1 is a  g support to u }

which gives the g-convexity of S ̃ and consequently S in general.□

For further results we will use the sub-convexity notion introduced in Section 2 of [8] so that, for example, condition (ii) in Theorem 3.1 can be written equivalently as {y 0, y} is sub g*-convex with respect to g 0 on Ω for all yTu(Ω) or that the g*-segment, with respect to (x, g 0(x)), joining y 0 and y is well defined for all x ∈ Ω, yTu(Ω).

For convenience we recall here that a set S R n is sub g-convex, with respect to (y 0, z 0), if (S, y 0, z 0) ⊂ Γ and the convex hull of Q 0 ( S ) Q ( , y 0 , z 0 ) ( S ) Q ( Γ ) . Analogously, a set S * R n is sub g*-convex, with respect to (x 0, u 0), if x 0 , S * , u 0 Γ * and the convex hull of P 0 ( S ) P ( x 0 , , u 0 ) ( S ) P ( Γ * ) . We then have that S is sub g-convex with respect to a function v : S * R if S is sub g-convex with respect to each point on the graph of v and S* is sub g*-convex with respect to a function u : S R if S* is sub g*-convex with respect to each point on the graph of u.

Recall also that the g-transform of a g-convex function u, on a domain Ω, is defined by

(3.3) v ( y ) = u g * ( y ) = sup Ω g * ( , y , u )

for yTu(Ω), so that from (3.1), v(y 0) = z 0, if g 0 = g(⋅, y 0, z 0) is a g-support to u.

From Theorem 3.1 and the invariance of A3w under duality, we then have the following global extension of Theorem 2.1(ii).

Corollary 3.1.

Assume g satisfies A1, A2, A1* and A3w and uC 0(Ω) is g-convex in a domain Ω. Then, if for some x 0 ∈ Ω and all x ∈ Ω, the pair {x 0, x} is sub g-convex with respect to v = u g * on Σ0, we have Tu(x 0) = Σ0 is g*-convex, with respect to x 0 and u 0 = u(x 0).

Note that by the semi-convexity of u, P(x 0, u 0, Σ0) is the convex hull of P(x 0, u 0, Tu(x 0)) so Corollary 3.1 follows from the g*- convexity of Tu(x 0), which in turn follows directly using duality with domain Ω* a neighbourhood of Σ0, which is also g*-convex with respect to x 0, u 0. But we may also proceed slightly differently as in [8] by proving first a special case when u is replaced by max{g 0, g 1} where g 0 and g 1 are two g-affine functions satisfying g 1(x 0) = g 0(x 0) = u 0. Then using the notation in Theorem 3.2, if {x 0, x} is sub g-convex with respect to (y θ , z θ ), for all θ ∈ (0, 1), we have the inequality,

(3.4) g ( x , y θ , z θ ) max { g 0 ( x ) , g 1 ( x ) }

which is the global version of A3w(2) in Theorem 2.1.

Finally we consider the global g-convexity of locally g-convex functions thereby extending Lemmas 2.1 in [1], [8] to the non-smooth case and part (iv) of Theorem 1.2 in [2] to the generating function case. Here we will define a function uC 0(Ω) to be locally g-convex in Ω, at any point x 0 ∈ Ω, u has a g-support in some neighbourhood N 0 of x 0.

Theorem 3.2.

Assume g satisfies A1, A2, A1* and A3w and u C 0 ( Ω ̄ ) is locally g-convex in a domain Ω. Assume also:

  1. Ω is g-convex with respect to (y, z) for all y ∈ Σ u (Ω), z g * ( , y , u ) ( Ω ̄ )

  2. Σ u (Ω) is sub g*-convex with respect to u on Ω.

Then u is g-convex in Ω.

Note that in [1], [8], we have defined local g-convexity for a C 2 function u by the degenerate ellipticity condition (3.2). Clearly if u is elliptic in Ω, that is inequality (3.2) is strict in Ω, then u is locally g-convex as above. From this it follows by approximation, u u + ϵ ( x x 0 ) 2 , for small ϵ > 0 and Theorem 3.2, that our definitions are equivalent if A is Lipschitz continuous with respect to the u and p variables.

Corresponding to [2], the proof of Theorem 3.2 is just a modification of that of Theorem 3.1.

Finally we remark that from Theorem 2.2, by adapting the approach in [7], we can obtain the C 1 and C 1,α regularity of generalized solutions of the second boundary value for generated Jacobian equations for C 2 generating functions satisfying A1,A2, A1* and A3s under appropriate integrability or boundedness conditions on the initial and target densities, f and f*, and convexity conditions on the initial and target domains, Ω and Ω*. In particular, the corresponding regularity results in the optimal transportation case, in Theorems 3.4 and 3.7 of [7], may be extended to C 2 cost functions while their extensions to generated Jacobian equations, proved recently in Theorem 2.14 of [9], may be extended to C 2 generating functions. In fact these extensions do not need the full strength of the implication A3sA3s(2) in Theorem 2.2 and the estimate (2.16), which already is a refinement of Proposition 5.1 in [7] and Lemma 3.3 in [9], is sufficient. For this we also need the characterisation of the g-normal mapping in Corollary 3.1.

For a formulation of the generalized second boundary value problem for generated Jacobian equations we may refer, for example, to Section 4 in [1] or Section 3 in [8].


Corresponding author: Neil S. Trudinger, Mathematical Sciences Institute, The Australian National University, Canberra, ACT 0200, Australia, E-mail: 

  1. Research ethics: Not applicable.

  2. Informed consent: Not applicable.

  3. Author contributions: All authors have accepted responsibility for the entire content of this manuscript and approved its submission.

  4. Use of Large Language Models, AI and Machine Learning Tools: Not applicable.

  5. Conflict of interest: N.S. Trudinger is a current Editorial Board member of Advanced Nonlinear Studies, and this did not affect the peer review process. Both authors declare no other possible conflict of interest.

  6. Research funding: The research of the author N.S. Trudinger was partially supported by Australian Research Council Grants DP170100929 and DP180100431.

  7. Data availability: Not applicable.

References

[1] N. S. Trudinger, “On the local theory of prescribed Jacobian equations,” Discrete Contin. Dyn. Syst., vol. 34, no. 4, pp. 1663–1681, 2014.10.3934/dcds.2014.34.1663Search in Google Scholar

[2] G. Loeper and N. S. Trudinger, “Weak formulation of the MTW condition and convexity properties of potentials,” Methods Appl. Anal., vol. 28, no. 1, pp. 53–60, 2021. https://doi.org/10.4310/maa.2021.v28.n1.a4.Search in Google Scholar

[3] N. S. Trudinger and X.-J. Wang, “On strict convexity and continuous differentiability of potential functions in optimal transportation,” Arch. Ration. Mech. Anal., vol. 192, no. 3, pp. 403–418, 2009. https://doi.org/10.1007/s00205-008-0147-z.Search in Google Scholar

[4] X.-N. Ma, N. S. Trudinger, and X.-J. Wang, “Regularity of potential functions of the optimal transportation problem,” Arch. Ration. Mech. Anal., vol. 177, no. 2, pp. 151–183, 2005. https://doi.org/10.1007/s00205-005-0362-9.Search in Google Scholar

[5] N. S. Trudinger, “Recent developments in elliptic partial differential equations of Monge-Ampère type,” in International Congress of Mathematicians, vol. III, Zürich, European Mathematical Society, 2006, pp. 291–301.10.4171/022-3/15Search in Google Scholar

[6] N. S. Trudinger and X.-J. Wang, “On the second boundary value problem for Monge-Ampère type equations and optimal transportation,” Ann. Sc. Norm. Super. Pisa Cl. Sci., vol. 8, no. 1, pp. 143–174, 2009.10.2422/2036-2145.2009.1.07Search in Google Scholar

[7] G. Loeper, “On the regularity of solutions of optimal transportation problems,” Acta Math., vol. 202, no. 2, pp. 241–283, 2009. https://doi.org/10.1007/s11511-009-0037-8.Search in Google Scholar

[8] N. S. Trudinger, “On the local theory of prescribed Jacobian equations revisited,” Math. Eng., vol. 3, no. 048, p. 17, 2021. https://doi.org/10.3934/mine.2021048.Search in Google Scholar

[9] S. Jeong, “Local Hölder regularity of solutions to generated Jacobian equations,” Pure Appl. Anal., vol. 3, no. 1, pp. 163–188, 2021. https://doi.org/10.2140/paa.2021.3.163.Search in Google Scholar

Received: 2024-08-20
Accepted: 2024-11-24
Published Online: 2025-01-14

© 2024 the author(s), published by De Gruyter, Berlin/Boston

This work is licensed under the Creative Commons Attribution 4.0 International License.

Downloaded on 26.9.2025 from https://www.degruyterbrill.com/document/doi/10.1515/ans-2023-0160/html
Scroll to top button