Open Access
Issue
Wuhan Univ. J. Nat. Sci.
Volume 27, Number 4, August 2022
Page(s) 273 - 280
DOI https://doi.org/10.1051/wujns/2022274273
Published online 26 September 2022

© Wuhan University 2022

Licence Creative CommonsThis is an Open Access article distributed under the terms of the Creative Commons Attribution License (https://creativecommons.org/licenses/by/4.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

0 Introduction

In the past two decades, the convexity theory on spherical spaces, emerging almost at the same time as that on Euclidean (linear) spaces and developing relatively slow in the last century (Refs.[1-7]), has attracted much attention in various mathematics areas, such as analysis, geometry and optimization theory etc. (Refs.[8-14]). Encouragingly, some efforts have been made to establish a systematic theory, parallel to that on Euclidean spaces, of convexity on spherical spaces (for details see Refs.[15-17] and the references therein).

Although some progresses have been made in the study on spherical convexity, the task to establish a systematic theory is far away from being completed, simply because many counterparts of concepts and definitions for convex sets in Euclidean spaces have not been found for spherical convexity, due to the lack of suitable compositions and operators on spheres. So, in this paper, we make an effort to study the so-called spherical differentiability of functions defined on spheres and the criterions of spherically convex functions.

The paper is organized as follows. In Section 1, we recall some notations, definitions and basic properties about spherically convex sets and spherically convex functions which will be used throughout the paper. In Section 2, we introduce the spherical Gateaux and spherical Frechet differentiability of functions defined merely on spheres. These differentiabilities are proper extensions of those defined in Ref.[15] where the authors have to assume that the functions are defined on some suitable Euclidean open sets. Section 3 is devoted to studying the criterions of spherical convexity of functions defined on spheres. The results obtained here generalize those in Ref.[15] etc. and will play some roles in the further study.

1 Preliminaries

R n , Sn-1 denote the Euclidean n-space and the unit sphere in Rn, respectively. As usual, <,>,denote the standard inner product and the norm induced by <,> on Rn, respectively. Often we also view Rn as an affine space, so we will not distinguish vectors and points intentionally. The origin (or zero vector) of Rn is always denoted by the letter o.

A set of the form SV:=VSn-1, where V is a (k+1)-dimensional subspace of Rn(0kn-1), is called a k-sphere. If V=<x> is a 1-dimensional subspace generated by a nonzero xRn, we write Sx and Sx simply instead of S<x> and S<x>, respectively, where <x> denotes the orthogonal complementary space of <x>. Sx is a 0-sphere and Sx is an (n-2)-sphere for each nonzero x. In geometric language, u and -u in Sn-1 are called (a pair of) antipodes. So a 0-sphere consists of a pair of antipodes. For the s-convexity of sets or functions on Sn-1, there are several equivalent definitions, among which the one given in Refs.[16, 17] is the only analytic form. So, we follow the approach adopted in Refs.[16, 17].

The spherical addition, denoted by "+s", in Rn (see Refs.[16, 18]) is defined by x+sy:=ρ(x+y), x,yRn, where ρ:RnSn-1{o}, called the radial projection, is defined by

ρ ( x ) : = { x x , x o o , x = o

which is clear of the properties:

i) ρρ=ρ;

ii) ρ(tx)=ρ(x),ρ(-x)=-ρ(x) for xRn and t>0;

iii) ρ(x)=x  if and only if xSn-1 or x=o.

The spherical addition is communicative but not associative, so the following composition is introduced in Refs.[16, 18]: for x1,x2,,xkRn(k2), define

( s ) i = 1 k x i : = ρ ( i = 1 k x i )

Naturally, when k=2, we write x+sy instead of (s)(x+y). In terms of the spherical addition, the so-called spherically convex combination (s-convex combination for brevity) of x1,x2,,xkRn and non-negative λ1,λ2,,λk with i=1kλi=1 is defined as

( s ) i = 1 k λ i x i ( = ρ ( i = 1 k λ i x i ) ) .

Now, we introduce the definition of spherically convex sets given in Ref.[16] (for sets containing no antipodes) and in Ref.[17] (for general cases).

Definition 1   A subset CSn-1 is called spherically convex (s-convex for brevity) if

λ u 1 + s ( 1 - λ ) u 2 C

whenever u1,u2C, λ[0,1] with λu1+s(1-λ)u20.

If further C contains no antipodes, then C is called a proper s-convex set.

Remark 1   It is easy to check that all k-spheres are s-convex(0kn-1), and it was shown in Ref.[17] that if CSn-1 is s-convex, then C is contained in some closed hemisphere.

Denote, for u1,u2Sn-1 ,

[ u 1 , u 2 ] s : = { λ u 1 + s ( 1 - λ ) u 2   | 0 λ 1 }

which is a subset of Sn-1{o}. When u1u2, [u1,u2]s is called the short arc connecting u1 and u2 (it can be checked easily that the short arc defined here coincides with the usual one defined in geometric languages), and [u,-u]s={o,u,-u} for uSn-1. For u1u2, (u1,u2)s, (u1,u2]s and [u1,u2)s are defined in a similar manner. From these notations, we see that the definition here is equivalent to the popular one adopted by other authors recently (see Refs.[16, 17] for the precise proof).

For uSn-1 and vSu, denote

[ u , - u ) s ( v ) : = [ u , v ] s [ v , - u ) s

( u , - u ) s ( v ) : = ( u , v ] s [ v , - u ) s

[ u , - u ] s ( v ) : = [ u , v ] s [ v , - u ] s

which are semicircles of various types passing through v.

Next, we recall the concept of spherically convex functions. In fact, before the "spherical convex combination" composition is introduced, it was not as simple as one may think to define spherically convex functions. Ferreira et al in Ref.[15] proposed a definition in terms of minimal geodesic segment (function): if CSn-1 is an s-convex set and f: CR is a function, then f is called spherically convex if the function fγ: [a,b]R is a univariate convex function for each minimal geodesic segment (function) γ: [a,b]C (see Ref.[15] for more information). This definition is quite intuitive but not very convenient in application. Here, we adopt the one given in Refs.[16, 17] which is equivalent to Ferreira's in Ref.[15].

Definition 2   Let CSn-1 be an s-convex set. A function f: CR is called spherically convex (s-convex for brevity) if

f ( λ u 1 + s ( 1 - λ ) u 2 ) λ f ( u 1 ) + ( 1 - λ ) f ( u 2 )

holds for u1,u2C, λ[0,1] with λu1+s(1-λ)u2C.

For an s-convex function on C, it was shown in Ref.[19] that it is continuous with respect to the both metrics mentioned below, and also that restricted on each k-sphere contained in C(0kn-1), it is a constant, in particular, f(u)=f(-u) if u,-uC.

The intrinsic metric ds(,) in Sn-1, defined by ds(u1,u2):=arccos, for u1,u2Sn-1, will be used in studying the continuity and the differentiability of functions on Sn-1. An elementary geometric argument showsu1-u2=2sinds(u1,u2)2, so the intrinsic metric and Euclidean metric are equivalent on Sn-1.

For given uSn-1 and δ>0, the set

B s ( u , δ ) : = { w S n - 1 | d s ( u , w ) < δ }

is called an s-ball. A set SSn-1 is called s-open if for each uS, there is δ>0 such that Bs(u,δ)S. It is easy to see that S is s-open if and only if there is an open set ΩRn such that S=ΩSn-1.

For u1,u2Sn-1 with u1u2, to describe the points in [u1,u2]s, there are two popular geodesic segment functions connecting u1,u2 considered in Refs.[16, 17, 19] and Ref.[15], respectively:

u λ = γ u 1 , u 2 ( λ ) : = λ u 1 + s ( 1 - λ ) u 2 ,   λ [ 0,1 ]   a n d

u θ * = γ u 1 , u 2 * ( θ ) : = s i n ( α - θ ) s i n α u 1 + s s i n θ s i n α u 2 ,   θ [ 0 , α ]

where α=ds(u1,u2). It can be easily checked that θ=ds(uθ*,u1) (see Ref.[15] for more information).

The following conclusion, cited as a lemma here (a proof is also included for convenience), was confirmed in Ref.[19].

Lemma 1   Let u1,u2Sn-1 with u2±u1. Then uθ*=uλ if and only if

λ = s i n ( α - θ ) s i n θ + s i n ( α - θ )

(or equivalently, 1-λ=sinθsinθ+sin(α-θ)).

Consequently,

s i n ( α - θ ) s i n θ + s i n ( α - θ ) u 1 + s s i n θ s i n θ + s i n ( α - θ ) u 2

= s i n ( α - θ ) s i n α u 1 + s i n θ s i n α u 2

for all θ[0,α].

Proof   Clearly, uθ*=uλ iff ds(uλ,u1)=ds(uθ*,u1)(=θ). For brevity, denote u¯λ=λu1+(1-λ)u2. By an elementary geometric argument, we see that ds(uλ,u1)=θ if and only if (noticingu1-u2=2sinα2),

u 2 - u ¯ λ = { u 2 - u ¯ 1 2 + u ¯ λ - u ¯ 1 2    = s i n α 2 + c o s α 2 t a n ( α 2 - θ ) , θ [ 0 , α 2 ] u 2 - u ¯ 1 2 - u ¯ λ - u ¯ 1 2    = s i n α 2 - c o s α 2 t a n ( θ - α 2 ) , θ [ α 2 , α ] = s i n α 2 - c o s α 2 t a n ( θ - α 2 )

and in turn if and only if

λ = u 2 - u ¯ λ u - v = s i n α 2 - c o s α 2 t a n ( θ - α 2 ) 2 s i n α 2

= s i n α 2 c o s ( θ - α 2 ) - c o s α 2 s i n ( θ - α 2 ) 2 s i n α 2 c o s ( θ - α 2 )

= s i n ( α - θ ) 2 s i n α 2 ( c o s α 2 c o s θ + s i n α 2 s i n θ )

= s i n ( α - θ ) s i n α c o s θ + 2 s i n 2 α 2 s i n θ

= s i n ( α - θ ) s i n α c o s θ + s i n θ - c o s α s i n θ

= s i n ( α - θ ) s i n θ + s i n ( α - θ )

Finally, another elementary geometric argument (drawing a picture to check) shows that

u ¯ λ ( θ ) = c o s α 2 c o s ( α 2 - θ ) = s i n α 2 s i n α 2 c o s ( α 2 - θ )

= s i n α s i n θ + s i n ( α - θ )

Therefore,

s i n ( α - θ ) s i n θ + s i n ( α - θ ) u 1 + s s i n θ s i n θ + s i n ( α - θ ) u 2

= u λ = u ¯ λ u ¯ λ = s i n ( α - θ ) s i n α u 1 + s i n θ s i n α u 2

2 Differentiability of Functions on Sphere

Ferreira et al in Ref.[15] defined and studied the spherical Frechet differentiability only for the functions differentiable on an open set containing an s-convex set. More precisely, they simply took the orthogonal projection of gradients of the functions (to a suitable subspace) as the spherical gradients. Clearly, such an approach limits the applications of their results. In this section, we will define and study the Gateaux differentiability and Frechet differentiability of functions defined merely on a subset of Sn-1 .

First, we give the concepts of s-directional derivative and s-Gateaux differentiability.

Definition 3   Let Bs(u0,δ)Sn-1 and f: Bs(u0,δ)R be a function. If for some vSu0, the limit

l i m λ 0 + f ( u λ ) - f ( u 0 ) s i n d s ( u λ , u 0 ) = : D s f ( u 0 , v )

exists, where uλ:=λv+s(1-λ)u0, then Dsf(u0,v) is called the s-directional derivative of f at u0 along (direction) v.

If both Dsf(u0,v) and Dsf(u0,-v) exist and Dsf(u0,-v)=-Dsf(u0,v), then Dsf(u0,v) is called the partial derivative of f at u0 along (direction) v, denoted by f(u0)sv.

If Dsf(u0,v) exists for all vSu0, then f is called s-Gateaux differentiable (s-G-differentiable for brevity) at u0.

Remark 2   i) sinds(uλ,u0) in Definition 1 can be replaced by ds(uλ,u0) since limλ0+sinds(uλ,u0)ds(uλ,u0)=1.

ii) Naturally, for each nonzero w<u0>, one may define as well Dsf(u0,w)=limλ0+f(uλ)-f(u0)sinds(uλ,u0)(if exists), where uλ:=λw+s(1-λ)u0. However, we point out that such an extended definition is not essentially necessary: writing w=tv for some vSu0 and t>0, we have by the property of ρ,

λ w + s ( 1 - λ ) u 0 = ρ ( λ t v + ( 1 - λ ) u 0 )

= ρ ( λ t λ ( t - 1 ) + 1 v + 1 - λ λ ( t - 1 ) + 1 u 0 ) = λ w + s ( 1 - λ ) u 0  

where μ=λtλ(t-1)+1, and in turn λ0+ iff μ0+.

Thus,Dsf(u0,w) exists iff Dsf(u0,v) exists, and in such a case Dsf(u0,w)=Dsf(u0,v).

Consider the function f: RnR defined by f(x):=dsf(u0,x)(xSn-1) or 0 (otherwise), where u0Sn-1 is fixed. It is easy to check that, for each vSu0, the (usual) directional derivative

D f ( u 0 , v ) : = l i m λ 0 + f ( u 0 + λ v ) λ = 0

while the s-directional derivative Dsf(u0,v)=1. Also, in a same manner, one may construct a function f such that Dsf(u0,v) (resp.Df(u0,v)) exists, but Df(u0,v) (resp.Dsf(u0,v)) does not. Therefore, the s-directional derivative and the (usual) directional derivative (along direction vSu0) have nothing to do with each other in general. However, we have the following conclusion.

Proposition 1   Let u0Sn-1 and Ω be an open set containing u0. If a function f: ΩR is differentiable at u0, then for each vSu0, Dsf(u0,v) exists and

D s f ( u 0 , v ) = D f ( u 0 , v )

Proof   We have f(x)-f(u0)=<gradf(u0),x-u0>+o(x-u0) for xΩ since f is differentiable at u0, where gradf denotes the usual gradient of f.

Thus, to calculate Dsf(u0,v) for vSu0, we compute limλ0+uλ-u0sinds(uλ,u0) first. Denoting θ:=ds(uλ,u0) (observing that θ0+ iff λ0+), we have

u λ = s i n θ v + c o s θ u 0

and in turn

l i m λ 0 + u λ - u 0 s i n d s ( u λ , u 0 ) = l i m θ 0 + s i n θ v + ( c o s θ - 1 ) u 0 s i n θ = v

Therefore, we obtain

      D s f ( u 0 , v ) = l i m λ 0 + f ( u λ ) - f ( u 0 ) s i n d s ( u λ , u 0 ) = l i m λ 0 + < g r a d f ( u 0 ) , u λ - u 0 > + o ( u λ - u 0 ) s i n d s ( u λ , u 0 ) = < g r a d f ( u 0 ) , l i m λ 0 + u λ - u 0 s i n d s ( u λ , u 0 ) > + l i m λ 0 + o ( u λ - u 0 ) s i n d s ( u λ , u 0 ) = < g r a d f ( u 0 ) , v > = D s f ( u 0 , v )

where we used the fact o(uλ-u0)=o(sinds(uλ,u0)) since limλ0sinds(uλ,u0)uλ-u0=limλ0sinds(uλ,u0)2sin2ds(uλ,u0)2=1. The proof completes.

Next, we define the s-gradient of functions defined on Sn-1.

Definition 4   Let Bs(u0,δ)Sn-1 and f: Bs(u0,δ)R be a function s-G-differentiable at u0. If v*Su0 satisfies Dsf(u0,v*)=max{Dsf(u0,v)|vSu0} ,then |Dsf(u0,v*)|v* is called an s-subgradient of f at u0. If the s-subgradient is unique, then it is called the s-gradient of f at u0, denoted by gradsf(u0).

Examples are easily found to show that, for a function defined in an open neighborhood of u0Sn-1, its s-gradient and its usual gradient have nothing to do with each other in general. However, we have the following proposition.

Proposition 2   Let u0Sn-1 and Ω be an open neighborhood of u0. If a function f: ΩR is differentiable at u0, then gradsf(u0) exists and

g r a d s f ( u 0 ) = P u 0 ( g r a d f ( u 0 ) )

where Pu0 denotes the orthogonal projection from Rn to <u0>. In turn, Dsf(u0,v)=<gradsf(u0),v> for vSu0.

Proof   Writing

g r a d f ( u 0 ) = P u 0 ( g r a d f ( u 0 ) ) + P u 0 ( g r a d f ( u 0 ) )

we have, as shown in the proof of Proposition 1, for each vSu0,

D s f ( u 0 , v ) = < g r a d f ( u 0 ) , v > = < P u 0 ( g r a d f ( u 0 ) ) + P u 0 ( g r a d f ( u 0 ) ) , v > = < P u 0 ( g r a d f ( u 0 ) ) , v >

since v<u0>, which implies clearly gradsf(u0) exists and gradsf(u0)=Pu0(gradf(u0)), and in turn

D s f ( u 0 , v ) = < g r a d s f ( u 0 ) , v >

for all vSu0.

Ferreira et al in Ref.[15] took Pu0(gradf) as the definition of s-gradient directly. Obviously, such a definition may make sense only for functions satisfying the conditions as in Proposition 2. To illustrate our definition as a useful proper extension of Ferreira's, we introduce the following concept.

Definition 5   Let u0Sn-1 and f: UR be a function, where U is an s-open set containing u0. If there is v°<u0>, such that

f ( u ) - f ( u 0 ) = < v ° , s i n d s ( u , u 0 ) > + o ( s i n d s ( u , u 0 ) )

whenever vSu0 and u[u0,-u0)s(v)U, then f is called s-Frechet differentiable (s-F-differentiable for brevity or s-differentiable simply) at u0, and fs'(u0):=v° is called the s-F-derivative of f at u0.

Remark 3   It is easy to check that if f is differentiable at u0, then f is s-differentiable at u0. However, the inverse is not true even if the function is defined in an open neighborhood of u0, as shown by the following example: consider the function f: RnR defined by

f ( x ) : = d s 2 ( u 0 , x ) (xSn-1) or 1 (otherwise),

where u0Sn-1 is fixed. It is easy to see that f is s-differentiable but not differentiable at u0. Also, it is easy to check that the s-differentiability implies the s-G-differentiability (however, the inverse is not true). More precisely, we have the following improvement of Proposition 2.

Theorem 1   If a function f is defined on an s-open set U containing u0Sn-1 and s-differentiable at u0, then gradsf(u0)=fs'(u0) and

D s f ( u 0 , v ) = < g r a d s f ( u 0 ) , v >   f o r   a l l   v S u 0 .

Proof   Since

f ( u λ ) - f ( u 0 ) = < f s ' ( u 0 ) , s i n d s ( u λ , u 0 ) v > + o ( s i n d s ( u λ , u 0 ) )

whenever vSu0 and uλ:=λv+s(1-λ)u0U, we have

D s f ( u 0 , v ) = l i m λ 0 + f ( u λ ) - f ( u 0 ) s i n d s ( u λ , u 0 )

= < f s ' ( u 0 ) , v > + l i m λ 0 + o ( s i n d s ( u λ , u 0 ) ) s i n d s ( u λ , u 0 )

= < f s ' ( u 0 ) , v >

from which the conclusions follow.

The following proposition provides the expressions of s-gradients for s-differentiable functions, which has its own significance clearly even if it will not be used in this paper.

Proposition 3   If a function f is defined on an s-open U containing u0Sn-1 and s-differentiable at u0, then for arbitrary pairly orthogonal e1,e2,,en-1Su0(that is, e1,e2,,en-1 form a standard orthogonal basis of <u0>), we have

g r a d s f ( u 0 ) = f ( u 0 ) s e 1 e 1 + f ( u 0 ) s e 2 e 2 + + f ( u 0 ) s e n - 1 e n - 1

Proof   Since f is s-differentiable at u0 , it is easy to check that f(u0)sv exists and f(u0)sv=<fs'(u0),v> for each vSu0, in particular, f(u0)sei=<fs'(u0),ei>. So,

D s f ( u 0 , v ) = f ( u 0 ) s v = < f s ' ( u 0 ) , v > = < f s ' ( u 0 ) , i = 1 n - 1 α i e i >

= i = 1 n - 1 α i < f s ' ( u 0 ) , e i > = i = 1 n - 1 < e i , v > f ( u 0 ) s e i

= < i = 1 n - 1 f ( u 0 ) s e i e i , v >

which implies clearly gradsf(u0)=i=1n-1f(u0)seiei.

3 Criterions of s-Convex Functions

In this section, we discuss the criterions of s-convexity for functions defined on Sn-1 in terms of s-gradients. The results obtained here are improvement of several criterions of s-convexity in Ref.[15] since the functions considered there have to be differentiable on some open set.

The first one is an improvement of Proposition 7 in Ref.[15].

Theorem 2   Let CSn-1 be an s-open s-convex set and f: CR be s-differentiable. Then f is s-convex on C if and only if, for any u0C and vSu0,

f ( u ) f ( u 0 ) + < g r a d s f ( u 0 ) , s i n d s ( u , u 0 ) v >

holds for any uC[u0,-u0)s(v).

Proof   () Suppose f is s-convex on C. By the s-differentiability of f, for any u0C and vSu0, we have

f ( u ) - f ( u 0 ) = < g r a d s f ( u 0 ) , s i n d s ( u , u 0 ) v >

+ o ( s i n d s ( u , u 0 ) )

whenever uC[u0,-u0)s(v).

Denote uλ:=λu+s(1-λ)u0 for uC[u0,-u0)s(v) and 0<λ<1. Then uλC[u0,-u0)s(v) clearly, so by the s-convexity of f, we have

f ( u λ ) λ f ( u ) + ( 1 - λ ) f ( u 0 )

which leads to

λ ( f ( u ) - f ( u 0 ) ) f ( u λ ) - f ( u 0 )

= < g r a d s f ( u 0 ) , s i n d s ( u λ , u 0 ) v > + o ( s i n d s ( u λ , u 0 ) )

that is

f ( u ) - f ( u 0 ) = < g r a d s f ( u 0 ) , λ - 1 s i n d s ( u λ , u 0 ) v >

+ λ - 1 o ( s i n d s ( u λ , u 0 ) ) (1)

Since λ=sinds(uλ,u0)(sinds(uλ,u0)+sinds(u,uλ))-1 by Lemma 1, we have

l i m λ 0 + λ - 1 s i n d s ( u λ , u 0 ) = s i n d s ( u , u 0 ) ;

l i m λ 0 + λ - 1 o ( s i n d s ( u λ , u 0 ) ) = 0

Thus, letting λ0+ in (1), we obtain

f ( u ) f ( u 0 ) + < g r a d s f ( u 0 ) , s i n d s ( u , u 0 ) v >

() Suppose for any u0C and vSu0,

f ( u ) f ( u 0 ) + < g r a d s f ( u 0 ) , s i n d s ( u , u 0 ) v >

hold for all uC[u0,-u0)s(v).

If C contains antipodes, then C=Sn-1 since C is s-open (one may find the argument easily). Thus, for any u,vSn-1 with <u,v>=0, i.e. vSu and uSv, we have

f ( v ) - f ( u ) < g r a d s f ( u ) , s i n d s ( v , u ) v >

= < g r a d s f ( u ) , v >

f ( - v ) - f ( u ) < g r a d s f ( u ) , s i n d s ( - v , u ) ( - v ) >

= - < g r a d s f ( u ) , v >

since vC[u,-u)s(v) and -vC[u,-u)s(-v). Therefore

f ( v ) f ( u )   i f f   f ( u ) f ( - v ) (2)

With the same arguments on the pairs (-v,u),(-u,-v) and (v,-u), respectively, we have as well

f ( u ) f ( - v )   i f f   f ( - v ) f ( - u )

f ( - v ) f ( - u )   i f f   f ( - u ) f ( v ) (3)

f ( - u ) f ( v )   i f f   f ( v ) f ( u )

Clearly,(2) and (3) lead to f(u)=f(-u)=f(v)=f(-v). By the arbitrariness of u and v, f is a constant on Sn-1 (noticing that any two circles have intersection) and so is convex.

If C contains no antipodes, for any distinct u1,u2C and 0<λ<1 (nothing to prove for the case u1=u2), denote uλ:=λu1+s(1-λ)u2, we have

f ( u 1 ) f ( u λ ) + < g r a d s f ( u λ ) , s i n d s ( u 1 , u λ ) v >

f ( u 2 ) f ( u λ ) + < g r a d s f ( u λ ) , s i n d s ( u 2 , u λ ) ( - v ) >

where (unique) vSuλ such that u1C[uλ,-uλ)s(v) (naturally, u2C[uλ,-uλ)s(-v)). Thus

λ f ( u 1 ) + ( 1 - λ ) f ( u 2 )

λ ( f ( u λ ) + < g r a d s f ( u λ ) , s i n d s ( u 1 , u λ ) v > )

+ ( 1 - λ ) ( f ( u λ ) + < g r a d s f ( u λ ) , s i n d s ( u 2 , u λ ) ( - v ) > )

= f ( u λ ) + < g r a d s f ( u λ ) , ( λ s i n d s ( u 1 , u λ )

- ( 1 - λ ) s i n d s ( u 2 , u λ ) ) v > = f ( u λ )

since

λ = s i n d s ( u 2 , u λ ) s i n d s ( u 1 , u λ ) + s i n d s ( u 2 , u λ )

1 - λ = s i n d s ( u 1 , u λ ) s i n d s ( u 1 , u λ ) + s i n d s ( u 2 , u λ )

by Lemma 1 and so

λ s i n d s ( u 1 , u λ ) - ( 1 - λ ) s i n d s ( u 2 , u λ ) = 0

To give another criterion of s-convexity, we introduce the following concept.

Definition 6   Let CSn-1 be an s-open s-convex set and F: CRn be a map. Then, F is called s-monotone on C if for any u1,u2C with u2±u1,

< F ( u 1 ) , v 1 > + < F ( u 2 ) , v 2 > 0

holds, where v1Su1,v2Su2 such that

u 2 C [ u 1 , - u 1 ) s ( v 1 )   a n d   u 1 C [ u 2 , - u 2 ) s ( v 2 ) .

In terms of the s-monotonicity we have the following improvement of Proposition 8 in Ref.[15].

Theorem 3   Let CSn-1 be an s-open s-convex set and f:CRn be s-differentiable. Then f is s-convex if and only if gradsf is s-monotone on C.

Proof   () Suppose f  is s-convex on C. Then for any u1,u2C with u2±u1 and v1Su1,v2Su2 with u2[u1,-u1)s(v1), u1[u2,-u2)s(v2), we have by Theorem 2

f ( u 2 ) - f ( u 1 ) < g r a d s f ( u 1 ) , s i n d s ( u 2 , u 1 ) v 1 >

f ( u 1 ) - f ( u 2 ) < g r a d s f ( u 2 ) , s i n d s ( u 1 , u 2 ) v 2 >

which leads clearly to

< g r a d s f ( u 1 ) , s i n d s ( u 2 , u 1 ) v 1 >

+ < g r a d s f ( u 2 ) , s i n d s ( u 1 , u 2 ) v 2 > 0

and in turn

< g r a d s f ( u 1 ) , v 1 > + < g r a d s f ( u 2 ) , v 2 > 0

since sinds(u2,u1)>0 when u2±u1, i.e.gradsf is s-monotone on C.

() Conversely, suppose gradsf is s-monotone onC. If C contains antipodes, then, as explained in the proof of Theorem 2, C=Sn-1. Thus, for any uSn-1 and vSu, we have

< g r a d s f ( u ) , v > + < g r a d s f ( v ) , u > 0

< g r a d s f ( - u ) , v > + < g r a d s f ( v ) , - u > 0 (4)

which leads to <gradsf(u)+gradsf(-u),v>0. Hence, since gradsf(u)+gradsf(-u)<u> and vSu<u> is arbitrary, we obtain

g r a d s f ( - u ) = - g r a d s f ( u )

Thus, by the s-differentiability of f, for w(u,-u)s(v), we have

f ( w ) - f ( u ) = < g r a d s f ( u ) , s i n d s ( w , u ) v > + o ( s i n d s ( w , u ) ) (5)

f ( w ) - f ( - u )

= < g r a d s f ( - u ) , s i n d s ( w , - u ) v > + o ( s i n d s ( w , - u ) )

= < - g r a d s f ( u ) , s i n d s ( w , u ) v > + o ( s i n d s ( w , u ) ) (6)

where we used the fact that gradsf(-u)=-gradsf(u) and sinds(w,-u)=sinds(w,u). Now, (6) subtracted from (5) gives

f ( - u ) - f ( u ) = 2 < g r a d s f ( u ) , s i n d s ( w , u ) v > + o ( s i n d s ( w , u ) )

which implies f(-u)=f(u)(letting wu), and in turn, for any w(u,-u)s(v),

2 < g r a d s f ( u ) , s i n d s ( w , u ) v > + o ( s i n d s ( w , u ) ) = 0

Dividing both sides by sinds(w,u) and then letting wu, we have

< g r a d s f ( u ) , v > = 0

By the arbitrariness of vSu, we have gradsf(u)=o. Hence gradsfo on Sn-1 by the arbitrariness of u. Now, for any distinct u1,u2Sn-1 with u2-u1, denoting φ(λ):=f(uλ) where uλ:=λu2+s(1-λ)u1, 0λ1, we have

d d λ φ ( λ ) = < g r a d s f ( u λ ) , d u λ d λ > = 0

Therefore φ is a constant on [0,1], in particular, f(u1)=φ(0)=φ(1)=f(u2). By the arbitrariness of u1 and u2, f is a constant and in turn s-convex on Sn-1.

If C contains no antipodes, then for any distinct u1,u2C and 0<λ<1, denote uλ:=λu2+s(1-λ)u1, α:=ds(u1,u2), θ:=ds(uλ,u1) for brevity first.

Then, define φ(λ):=f(uλ)=f(λu2+s(1-λ)u1), 0λ1, and λ=λ(θ)=sinθsinθ+sin(α-θ),0θα. Thus, by Lemma 1,

φ ( λ ( θ ) ) = f ( s i n ( α - θ ) s i n α u 1 + s i n θ s i n α u 2 ) , 0 θ α

Therefore,

d d θ φ ( λ ( θ ) ) = < g r a d s f ( u λ ( θ ) ) , d d θ ( s i n ( α - θ ) s i n α u 1 + s i n θ s i n α u 2 ) > = < g r a d s f ( u λ ( θ ) ) , - c o s ( α - θ ) s i n α u 1 + c o s θ s i n α u 2 >

Let (unique) v1Suλ(θ) such that u2[uλ(θ),-uλ(θ))s(v1),then clearly,

P u λ ( θ ) ( u 1 ) = s i n θ ( - v 1 )   a n d   P u λ ( θ ) ( u 2 ) = s i n ( α - θ ) v 1

where Puλ(θ) denotes the orthogonal projection from Rn to <uλ(θ)>. Observing gradsf(uλ(θ))<uλ(θ)> which implies <gradsf(uλ(θ)),ui>=<gradsf(uλ(θ)),Puλ(θ)(ui)>, i=1,2,

we obtain

d d θ φ ( λ ( θ ) )

= < g r a d s f ( u λ ( θ ) ) , - c o s ( α - θ ) s i n α P u λ ( θ ) ( u 1 ) + c o s θ s i n α P u λ ( θ ) ( u 2 ) >

= < g r a d s f ( u λ ( θ ) ) , - c o s ( α - θ ) s i n α s i n θ ( - v 1 )

+ c o s θ s i n α s i n ( α - θ ) v 1 >

= < g r a d s f ( u λ ( θ ) ) , v 1 >

Now, for any 0θ1<θ2α (observing

u λ ( θ 1 ) C [ u 1 , u λ ( θ 2 ) ) s   , u λ ( θ 2 ) C [ u 2 , u λ ( θ 1 ) ) s

in such a case), choosing v1Suλ(θ1) such that u2[uλ(θ1),-uλ(θ1))s(v1) and v2Suλ(θ2) such that u1[uλ(θ2),-uλ(θ2))s(v2), we have, by the monotonicity of gradsf,

d d θ φ ( λ ( θ 1 ) ) - d d θ φ ( λ ( θ 2 ) )

= < g r a d s f ( u λ ( θ 1 ) ) , v 1 > - < g r a d s f ( u λ ( θ 2 ) ) , - v 2 >

= < g r a d s f ( u λ ( θ 1 ) ) , v 1 > + < g r a d s f ( u λ ( θ 2 ) ) , v 2 > 0

where ddθφ(λ(θ2))=<gradsf(uλ(θ2)),-v2> simply because uλ(θ)[uλ(θ2),-uλ(θ2))s(-v2) when θθ2.

So, ddθφ(λ(θ)) is increasing and in turn φ(λ(θ)) is convex on [0,α], in particular,

f ( 1 2 u 1 + s 1 2 u 2 ) = φ ( λ ( α 2 ) ) = φ ( λ ( 1 2 0 + 1 2 α ) )

1 2 φ ( λ ( 0 ) ) + 1 2 φ ( λ ( α ) )

= 1 2 f ( u 1 ) + 1 2 f ( u 2 )

which, together with the arbitrariness of u1 and u2, implies clearly that φ() is middle-point convex (i.e.φ(λ1+λ22)12φ(λ1)+12φ(λ2)) and in turn convex since it is clearly continuous on [0,1]. Thus, for any 0λ1, we have

f ( λ u 2 + s ( 1 - λ ) u 1 ) = φ ( λ ) = φ ( ( 1 - λ ) 0 + λ 1 )

( 1 - λ ) φ ( 0 ) + λ φ ( 1 ) = ( 1 - λ ) f ( u 1 ) + λ f ( u 2 )

By the arbitrariness of u1 and u2 , f is s-convex.

Final Remark In this paper, we introduce first the concepts of s-directional derivative, s-gradient and s-Gateaux differentiability and s-Frechet differentiability of functions defined on subsets of the unit sphere, which are different from the usual ones for functions defined on subsets of Euclidean spaces. Then, as applications, we provide some criterions of s-convexity for functions on spheres which are improvements of results in Ref.[15]. Also, compared with the work in Ref.[15], our work has some advantages in applications since the functions considered here are defined merely on subsets of spheres.

Acknowledgments

The authors thank the referees very much for their carefully reading the first version of the manuscript and pointing out typos and mistakes.

References

  1. Robinson C V. Spherical theorems of Helly type and congruence indices of spherical caps[J]. Amer J Math, 1942, 64: 260-272. [CrossRef] [MathSciNet] [Google Scholar]
  2. Horn A. Some generalizations of Helly's theorem on convex sets[J]. Bull Amer Math Soc, 1949, 55: 923-929. [CrossRef] [MathSciNet] [Google Scholar]
  3. Katchalski M. A Helly type theorem on the sphere[J]. Proc of Amer Math Soc, 1977, 66(1) :119-122. [CrossRef] [MathSciNet] [Google Scholar]
  4. Baker M J C. A spherical Helly-type theorem[J]. Pacific J of Math, 1967, 23(1): 1-3. [CrossRef] [MathSciNet] [Google Scholar]
  5. Danzer L, Grünbaum B, Klee V. Helly's theorem and its relatives convexity[J]. Proc of Symp in Pure Math, 1963, 7: 99-180. [CrossRef] [Google Scholar]
  6. Cattle R W, Randow R, Stone R E. On spherically convex sets and Q-matrices[J]. Lin Alg and Its Appl, 1981, 41: 73-80. [CrossRef] [Google Scholar]
  7. Drezner Z, Wesolowsky G O. Minimax and maximin facility location problems on a sphere[J]. Naval Res Logist Quart, 1983, 30: 305-312. [CrossRef] [MathSciNet] [Google Scholar]
  8. Besau F, Schuster F E. Binary operations in spherical convex geometry[J]. India Univ Math J, 2016, 65(4): 1263-1288 [CrossRef] [Google Scholar]
  9. Das P, Chakraborti N R, Chaudhuri P K. Spherical minimax location problem[J]. Comput Optim Appl, 2001, 18: 311-326. [CrossRef] [MathSciNet] [Google Scholar]
  10. Lassak M. Width of spherical convex bodies[J]. Aequationes Math, 2015, 89: 555-567. [CrossRef] [MathSciNet] [Google Scholar]
  11. Ferreira O P, Iusem A N, Nemeth S Z. Projections on to convex sets on the sphere[J]. J Glob Optim, 2013, 57: 663-676. [CrossRef] [Google Scholar]
  12. Ferreira O P, Nemeth S Z. On the spherical convexity of quadratic functions[J]. J Glob Optim, 2019, 73: 537-545. [CrossRef] [Google Scholar]
  13. Gao F, Hug D, Schneider R. Intrinsic volumes and polar sets in spherical space[J]. Math Notae, 2003, 41:159-176. [Google Scholar]
  14. Zhou X, Guo Q. Compositions and transformations on compositions and transformations on spherical convex sets[J]. Wuhan Univ J of Nat Sci, 2020, 25(4): 277-285. [Google Scholar]
  15. Ferreira O P, Iusem A N, Nemeth S Z. Concepts and techniques of optimization on the sphere[J]. TOP, 2014 , 22(3):1148-1170. [CrossRef] [MathSciNet] [Google Scholar]
  16. Guo Q, Peng Y L. Spherically convex sets and spherically convex functions[J]. J of Conv Anal, 2021, 28(1): 103-122. [Google Scholar]
  17. Guo Q. Convexity theory on spherical spaces(I) [J]. Sci China: Math(A), 2020, 50(12): 1745- 1772(Ch). [Google Scholar]
  18. Shao Y C, Guo Q. An analytic approach to spherically convex sets in Formula [J]. J of Math (China), 2018, 38 : 473-480(Ch). [Google Scholar]
  19. Zhang Y, Guo Q. Properties and criterions of spherically convex functions[J]. J Suzhou Univ of Sci and Tech (Nat Sci), 2022, 39(1): 21-26+46(Ch). [Google Scholar]

Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.

Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.

Initial download of the metrics may take a while.