Next Article in Journal
Fixed Point Results in C🟉-Algebra-Valued Partial b-Metric Spaces with Related Application
Next Article in Special Issue
A Large Scale Analysis for Testing a Mathematical Model for the Study of Vascular Pathologies
Previous Article in Journal
Mathematical and Statistical Modelling for Assessing COVID-19 Superspreader Contagion: Analysis of Geographical Heterogeneous Impacts from Public Events
Previous Article in Special Issue
A New Seminorm for d-Tuples of A-Bounded Operators and Their Applications
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

On Some Inequalities Involving Generalized Distance Functions

Department of Mathematics, College of Science, King Saud University, P.O. Box 2455, Riyadh 11451, Saudi Arabia
*
Author to whom correspondence should be addressed.
These authors contributed equally to this work.
Mathematics 2023, 11(5), 1157; https://doi.org/10.3390/math11051157
Submission received: 2 February 2023 / Revised: 18 February 2023 / Accepted: 22 February 2023 / Published: 26 February 2023
(This article belongs to the Special Issue Mathematical Inequalities, Models and Applications)

Abstract

:
In this paper, a new class of generalized distance functions with respect to a pair of mappings is introduced. Next, some inequalities involving such distance functions are established. Our obtained results generalize and cover some recent results from the literature. Moreover, new distance inequalities for self-crossing polygons are obtained.

1. Introduction

In many branches of mathematical analysis, having a metric structure is essential for the study of several problems. For instance, the concept of distance between elements of an abstract set allows us to define many topological properties, such as convergence, Cauchy sequences, continuity and others [1,2,3,4]. One of the important properties of a (standard) distance function D on an abstract set M is the triangle inequality, i.e.,
D ( u , v ) D ( u , w ) + D ( w , v ) for   all u , v . w M .
Many generalizations of the concept of a distance function achieved by relaxing the triangle inequality have been introduced in the literature, and examples can be found in [5,6,7,8,9,10]. For instance, in [5], the triangle inequality was relaxed as
D ( u , v ) k D ( u , w ) + D ( w , v ) for   all u , v . w M ,
where k 1 is a constant.
On the other hand, inequalities involving distance functions are very useful in various areas of mathematics, for instance, in analysis, fixed point theory, operator theory, topology and geometry. Due to this fact, great attention has been paid to the study of inequalities on metric spaces, and examples can be found in [11,12,13,14,15,16,17,18].
Let M be a nonempty set and D : M × M [ 0 , + ) . We say that D is a distance (or metric) on M, if for all u , v . w M ,
D ( u , v ) = 0 u = v ,
D ( u , v ) = D ( v , u ) ,
D ( u , v ) D ( u , w ) + D ( w , v ) .
In this case, we say that ( M , D ) is a metric space.
In [11], Dragomir and Gosa established a polygonal inequality in the setting of metric spaces and provided some applications in normed linear spaces and inner product spaces. Namely, it was proven that if ( M , D ) is a metric space, n 2 is an integer, { u i } i = 1 n M and ι i 0 , with ι 1 + ι 2 + + ι n = 1 , then
1 i < j n ι i ι j D ( u i , u j ) inf u M i = 1 n ι i D ( u i , u ) .
Later, in [15], the above inequality was extended to natural powers of the distance. Namely, it was shown that under the above assumptions, we have
1 i < j n ι i ι j D m ( u i , u j ) 1 2 inf u M 2 i = 1 n ι i D m ( u i , u ) + k = 1 m 1 m k i = 1 n ι i D k ( u i , u ) i = 1 n ι i D m k ( u i , u )
for all integers m 2 . In [19], Dragomir studied sums of the form
1 i < j n ι i ι j D s ( u i , u j ) ,
where s > 0 . He proved the following:
If 0 < s 1 , then
1 i < j n ι i ι j D s ( u i , u j ) inf u M i = 1 n ι i D s ( u i , u ) ,
If s > 1 , then
1 i < j n ι i ι j D s ( u i , u j ) 2 s 1 inf u M i = 1 n , ι i D s ( u i , u ) ,
2 1 i = 1 n ι i 2 s 1 1 i < j n ι i ι j D ( u i , u j ) s 1 i < j n ι i ι j D s ( u i , u j ) .
Some other inequalities of the same type can be found in [12,13]. We also refer to [20], where a continuous version of (1) was obtained.
In this paper, we first introduce the notion of a generalized distance with respect to a pair of mappings and provide some examples of such distance functions (Section 2). Let us provide some motivations for introducing such a notion. Let us observe that some of the above-mentioned inequalities involve the power of a (standard) distance function. Now, if d is a distance function on M, and if we define mapping D : M × M [ 0 , + ) as
D ( u , v ) = d 2 ( u , v ) , u , v M ,
we obtain, by the triangle inequality, that
D ( u , v ) = d 2 ( u , v ) d 2 ( u , w ) + d 2 ( w , v ) + d ( u , w ) d ( w , v ) + d ( w , v ) d ( u , w )
for all u , v , w M , that is,
D ( u , v ) D ( u , w ) + D ( w , v ) + f ( u , w ) g ( w , v ) + f ( w , v ) g ( u , w ) ,
where f = g = d . Hence, a natural question is whether inequalities of Dragomir type can be extended to mappings D : M × M [ 0 , + ) satisfying (2) for arbitrary f , g : M × M [ 0 , + ) . A positive answer is obtained in Section 3, where we establish several inequalities of type (1) involving generalized distance functions (Section 3). Finally, in Section 4, some generalized distance inequalities for self-crossing polygons are proved.

2. Generalized Distance Function

Definition 1. 
Let M be a nonempty set, and let f , g : M × M [ 0 , + ) . A mapping
D : M × M [ 0 , + )
is said to be a distance with respect to ( f , g ) , if:
(i)
D ( u , v ) = D ( v , u ) for all u , v M .
(ii)
D ( u , u ) = 0 for all u M .
(iii)
There exists k > 0 such that
D ( u , v ) k D ( u , w ) + D ( w , v ) + f ( u , w ) g ( w , v ) + f ( w , v ) g ( u , w )
for all u , v , w M .
Remark 1. 
Let us remark that
D   i s   a   d i s t a n c e   w i t h   r e s p e c t   t o   ( f , g ) D   i s   a   d i s t a n c e   w i t h   r e s p e c t   t o   ( g , f ) .
We provide below some examples of generalized distance functions in the sense of Definition 1.
Example 1. 
Let D be a distance on M. Then, for all f , g : M × M [ 0 , + ) , D is a distance with respect to ( f , g ) . Indeed, for all u , v , w M , we have
D ( u , v ) D ( u , w ) + D ( w , v ) D ( u , w ) + D ( w , v ) + f ( u , w ) g ( w , v ) + f ( w , v ) g ( u , w ) ,
which shows that (iii) holds with k = 1 .
Example 2. 
Let M = C ( [ 0 , 1 ] ; R ) . We consider mapping D : M × M [ 0 , + ) defined as
D ( u , v ) = max 0 s 1 | u ( s ) v ( s ) | 0 1 | u ( t ) v ( t ) | d t , u , v M .
Clearly, mapping D satisfies properties (i)–(ii) in Definition 1. Moreover, for all u , v , w M , we have
max 0 s 1 | u ( s ) v ( s ) | max 0 s 1 | u ( s ) w ( s ) | + max 0 s 1 | w ( s ) v ( s ) |
and
0 1 | u ( t ) v ( t ) | d t 0 1 | u ( t ) w ( t ) | d t + 0 1 | w ( t ) v ( t ) | d t .
By multiplying (3) by (4), we obtain
D ( u , v ) max 0 s 1 | u ( s ) w ( s ) | 0 1 | u ( t ) w ( t ) | d t + max 0 s 1 | u ( s ) w ( s ) | 0 1 | w ( t ) v ( t ) | d t + max 0 s 1 | w ( s ) v ( s ) | 0 1 | u ( t ) w ( t ) | d t + max 0 s 1 | w ( s ) v ( s ) | 0 1 | w ( t ) v ( t ) | d t = D ( u , w ) + D ( w , v ) + f ( u , w ) g ( w , v ) + f ( w , v ) g ( u , w ) ,
where
f ( u 1 , u 2 ) = max 0 s 1 | u 1 ( s ) u 2 ( s ) | , u 1 , u 2 M
and
g ( u 1 , u 2 ) = 0 1 | u 1 ( t ) u 2 ( t ) | d t , u 1 , u 2 M .
Therefore, (iii) holds with k = 1 , and D is a distance with respect to ( f , g ) .
Example 3. 
Let d 1 , d 2 be two distances on M, and let α 1 , α 2 0 , with ( α 1 , α 2 ) ( 0 , 0 ) . We consider mapping D : M × M [ 0 , + ) defined as
D ( u , v ) = d 1 α 1 ( u , v ) d 2 α 2 ( u , v ) , u , v M .
Clearly, mapping D satisfies properties (i)–(ii) in Definition 1. We first consider the following:
The case when α i > 1 , i = 1 , 2 .
Due to the convexity of function [ 0 , + ) t t s , s > 1 , for all u , v , w M and i { 1 , 2 } , we have
d i α i ( u , v ) d i ( u , w ) + d i ( w , v ) α i = 2 d i ( u , w ) + d i ( w , v ) 2 α i = 2 α i d i ( u , w ) + d i ( w , v ) 2 α i 2 α i 1 d i α i ( u , w ) + d i α i ( w , v ) ,
which yields
1 2 α 1 + α 2 2 D ( u , v ) = 1 2 α 1 + α 2 2 i = 1 2 d i α i ( u , v ) d 1 α 1 ( u , w ) d 2 α 2 ( u , w ) + d 1 α 1 ( u , w ) d 2 α 2 ( w , v ) + d 1 α 1 ( w , v ) d 2 α 2 ( u , w ) + d 1 α 1 ( w , v ) d 2 α 2 ( w , v ) = D ( u , w ) + D ( w , v ) + f ( u , w ) g ( w , v ) + f ( w , v ) g ( u , w ) ,
where
f ( u 1 , u 2 ) = d 1 α 1 ( u 1 , u 2 ) , u 1 , u 2 M
and
g ( u 1 , u 2 ) = d 2 α 2 ( u 1 , u 2 ) , u 1 , u 2 M .
Therefore, (iii) holds with k = 2 α 1 + α 2 2 , and D is a distance with respect to ( f , g ) . Next, we consider the following:
The case when 0 < α 2 1 < α 1 .
In this case, for all u , v , w M , we have
d 1 α 1 ( u , v ) 2 α 1 1 d 1 α 1 ( u , w ) + d 1 α 1 ( w , v )
and
d 2 α 2 ( u , v ) d 2 ( u , w ) + d 2 ( w , v ) α 2 d 2 α 2 ( u , w ) + d 2 α 2 ( w , v ) .
By multiplying (7) by (8), we obtain
D ( u , v ) 2 α 1 1 D ( u , w ) + D ( w , v ) + f ( u , w ) g ( w , v ) + f ( w , v ) g ( u , w ) ,
where f and g are defined by (5) and (6). This shows that (iii) holds with k = 2 α 1 1 , and D is a distance with respect to ( f , g ) . Now, we consider the following:
The case when α 2 = 0 < 1 < α 1 .
In this case, by (7), we deduce that (iii) holds with k = 2 α 1 1 and f = g = 0 . Hence, D is a distance with respect to ( 0 , 0 ) .
The case when 0 < α i 1 , i = 1 , 2 .
In this case, for all u , v , w M , we have
D ( u , v ) D ( u , w ) + D ( w , v ) + f ( u , w ) g ( w , v ) + f ( w , v ) g ( u , w ) ,
where f and g are defined in (5) and (6). Then, (iii) holds with k = 1 , and D is a distance with respect to ( f , g ) . Finally, we consider the following:
The case when α 1 = 0 < α 2 1 .
In this case, by (8), we deduce that (iii) holds with k = 1 and f = g = 0 . Hence, D is a distance with respect to ( 0 , 0 ) .

3. Inequalities Involving Generalized Distance Functions

The below inequality involving generalized distance functions holds.
Theorem 1. 
Let D be a distance function on M with respect to ( f , g ) , in the sense of Definition 1, where f , g : M × M [ 0 , + ) . Let n 2 be an integer, { u i } i = 1 n M and ι i 0 , with ι 1 + ι 2 + + ι n = 1 . Then,
inf u M 2 i = 1 n ι i D ( u i , u ) + i = 1 n ι i f ( u i , u ) i = 1 n ι i g ( u , u i ) + i = 1 n ι i g ( u i , u ) i = 1 n ι i f ( u , u i ) 2 k 1 i < j n ι i ι j D ( u i , u j ) .
Proof. 
Let u M . By property (iii) in Definition 1, we have
D ( u i , u j ) k D ( u i , u ) + D ( u , u j ) + f ( u i , u ) g ( u , u j ) + f ( u , u j ) g ( u i , u ) , i , j I n ,
where I n = 1 , 2 , , n . By multiplying the above inequality by ι i ι j and summing over i and j, we obtain
1 k i , j I n ι i ι j D ( u i , u j ) i , j I n ι i ι j D ( u i , u ) + i , j I n ι i ι j D ( u , u j ) + i , j I n ι i ι j f ( u i , u ) g ( u , u j ) + i , j I n ι i ι j f ( u , u j ) g ( u i , u ) .
On the other hand, by properties (i)–(ii) in Definition 1, we have
i , j I n ι i ι j D ( u i , u j ) = 2 1 i < j n ι i ι j D ( u i , u j ) .
Moreover, we have
i , j I n ι i ι j D ( u i , u ) = j = 1 n ι j i = 1 n ι i D ( u i , u ) = i = 1 n ι i D ( u i , u ) ,
i , j I n ι i ι j D ( u , u j ) = i , j I n ι i ι j D ( u i , u ) ,
i , j I n ι i ι j f ( u i , u ) g ( u , u j ) = i = 1 n ι i f ( u i , u ) i = 1 n ι i g ( u , u i )
and
i , j I n ι i ι j f ( u , u j ) g ( u i , u ) = i = 1 n ι i g ( u i , u ) i = 1 n ι i f ( u , u i )
Hence, it follows from (10)–(15) that
2 k 1 i < j n ι i ι j D ( u i , u j ) 2 i = 1 n ι i D ( u i , u ) + i = 1 n ι i f ( u i , u ) i = 1 n ι i g ( u , u i ) + i = 1 n ι i g ( u i , u ) i = 1 n ι i f ( u , u i ) .
Finally, by taking the infimum over u in (16), we obtain (9). □
Now, let us study some special cases of Theorem 1. We first consider the case when f and g are symmetric, that is,
f ( u , v ) = f ( v , u ) , g ( u , v ) = g ( v , u ) , u , v M .
In this case, from Theorem 1, we deduce the below result.
Corollary 1. 
Let D be a distance function on M with respect to ( f , g ) , in the sense of Definition 1, where f , g : M × M [ 0 , + ) are symmetric. Let n 2 be an integer, { u i } i = 1 n M and ι i 0 , with ι 1 + ι 2 + + ι n = 1 . Then,
1 i < j n ι i ι j D ( u i , u j ) k inf u M i = 1 n ι i D ( u i , u ) + i = 1 n ι i f ( u i , u ) i = 1 n ι i g ( u i , u ) .
By taking f = g in Corollary 1, we deduce the below result.
Corollary 2. 
Let D be a distance function on M with respect to ( f , f ) , in the sense of Definition 1, where f : M × M [ 0 , + ) is symmetric. Let n 2 be an integer, { u i } i = 1 n M and ι i 0 , with ι 1 + ι 2 + + ι n = 1 . Then,
1 i < j n ι i ι j D ( u i , u j ) k inf u M i = 1 n ι i D ( u i , u ) + i = 1 n ι i f ( u i , u ) 2 .
By taking
ι 1 = ι 2 = = ι n = 1 n
in Theorem 1, we obtain the below result.
Corollary 3. 
Let D be a distance function on M with respect to ( f , g ) , in the sense of Definition 1, where f , g : M × M [ 0 , + ) . Let n 2 be an integer and { u i } i = 1 n M . Then,
inf u M 2 n i = 1 n D ( u i , u ) + i = 1 n f ( u i , u ) i = 1 n g ( u , u i ) + i = 1 n g ( u i , u ) i = 1 n f ( u , u i ) 2 k 1 i < j n D ( u i , u j ) .
If f and g are symmetric, we deduce, by Corollary 3, the below result.
Corollary 4. 
Let D be a distance function on M with respect to ( f , g ) , in the sense of Definition 1, where f , g : M × M [ 0 , + ) are symmetric. Let n 2 be an integer and { u i } i = 1 n M . Then,
1 i < j n D ( u i , u j ) k inf u M n i = 1 n D ( u i , u ) + i = 1 n f ( u i , u ) i = 1 n g ( u i , u ) .
If f = g in Corollary 4, then we deduce the below result.
Corollary 5. 
Let D be a distance function on M with respect to ( f , f ) , in the sense of Definition 1, where f : M × M [ 0 , + ) is symmetric. Let n 2 be an integer and { u i } i = 1 n M . Then,
1 i < j n D ( u i , u j ) k inf u M n i = 1 n D ( u i , u ) + i = 1 n f ( u i , u ) 2 .
Next, using the above results, we provide below some upper bounds for the following sum:
1 i < j n ι i ι j d 1 α 1 ( u i , u j ) d 2 α 2 ( u i , u j ) ,
where α 1 , α 2 0 and d 1 , d 2 are two distances on M.
We first consider the case when α i > 1 , i = 1 , 2 .
Corollary 6. 
For all j { 1 , 2 } , let d j be a distance on M and α j > 1 . Let n 2 be an integer, { u i } i = 1 n M and ι i 0 , with ι 1 + ι 2 + + ι n = 1 . Then,
1 i < j n ι i ι j d 1 α 1 ( u i , u j ) d 2 α 2 ( u i , u j ) 2 α 1 + α 2 2 inf u M i = 1 n ι i d 1 α 1 ( u i , u ) d 2 α 2 ( u i , u ) + i = 1 n ι i d 1 α 1 ( u i , u ) i = 1 n ι i d 2 α 2 ( u i , u ) .
Proof. 
By Example 3, since α i > 1 , i = 1 , 2 , we know that mapping D : M × M [ 0 , + ) defined as
D ( u , v ) = d 1 α 1 ( u , v ) d 2 α 2 ( u , v ) , u , v M
is a distance with respect to ( d 1 α 1 , d 2 α 2 ) , in the sense of Definition 1, where (iii) holds with constant k = 2 α 1 + α 2 2 . Since d i α i , i = 1 , 2 , are symmetric, (17) follows from Corollary 1 by taking f = d 1 α 1 , g = d 2 α 2 and k = 2 α 1 + α 2 2 . □
Next, we consider the case when 0 < α 2 1 < α 1 .
Corollary 7. 
For all j { 1 , 2 } , let d j be a distance on M and 0 < α 2 1 < α 1 . Let n 2 be an integer, { u i } i = 1 n M and ι i 0 , with ι 1 + ι 2 + + ι n = 1 . Then,
1 i < j n ι i ι j d 1 α 1 ( u i , u j ) d 2 α 2 ( u i , u j ) 2 α 1 1 inf u M i = 1 n ι i d 1 α 1 ( u i , u ) d 2 α 2 ( u i , u ) + i = 1 n ι i d 1 α 1 ( u i , u ) i = 1 n ι i d 2 α 2 ( u i , u ) .
Proof. 
By Example 3, since 0 < α 2 1 < α 1 , we know that mapping D = d 1 α 1 d 2 α 2 is a distance with respect to ( d 1 α 1 , d 2 α 2 ) , in the sense of Definition 1, where (iii) holds with constant k = 2 α 1 1 . Since d i α i , i = 1 , 2 , are symmetric, (18) follows from Corollary 1 by taking f = d 1 α 1 , g = d 2 α 2 and k = 2 α 1 1 . □
We now consider the case when α 2 = 0 < 1 < α 1 . In this case, we deduce the below result obtained in [19].
Corollary 8. 
Let d be a metric on M and α 1 > 1 . Let n 2 be an integer, { u i } i = 1 n M and ι i 0 , with ι 1 + ι 2 + + ι n = 1 . Then,
1 i < j n ι i ι j d α 1 ( u i , u j ) 2 α 1 1 inf u M i = 1 n ι i d α 1 ( u i , u ) .
Proof. 
By Example 3, since α 2 = 0 < 1 < α 1 , we know that D = d 1 α 1 d 2 α 2 = d α 1 is a distance with respect to ( 0 , 0 ) , in the sense of Definition 1, where (iii) holds with constant k = 2 α 1 1 . Then, (19) follows from Corollary 1 by taking f = g = 0 and k = 2 α 1 1 . □
Next, we consider the case when 0 < α i 1 , i = 1 , 2 .
Corollary 9. 
For all j { 1 , 2 } , let d j be a distance on M and 0 < α i 1 . Let n 2 be an integer, { u i } i = 1 n M and ι i 0 , with ι 1 + ι 2 + + ι n = 1 . Then,
1 i < j n ι i ι j d 1 α 1 ( u i , u j ) d 2 α 2 ( u i , u j ) inf u M i = 1 n ι i d 1 α 1 ( u i , u ) d 2 α 2 ( u i , u ) + i = 1 n ι i d 1 α 1 ( u i , u ) i = 1 n ι i d 2 α 2 ( u i , u ) .
Proof. 
By Example 3, since 0 < α i 1 , i = 1 , 2 , we know that mapping D = d 1 α 1 d 2 α 2 is a distance with respect to ( d 1 α 1 , d 2 α 2 ) , in the sense of Definition 1, where (iii) holds with constant k = 1 . Since d i α i , i = 1 , 2 , are symmetric, (20) follows from Corollary 1 by taking f = d 1 α 1 , g = d 2 α 2 and k = 1 . □
Finally, we consider the case when α 1 = 0 < α 2 1 . In this case, we deduce the below result obtained in [19].
Corollary 10. 
Let d be a distance on M and α 1 = 0 < α 2 1 . Let n 2 be an integer, { u i } i = 1 n M and ι i 0 , with ι 1 + ι 2 + + ι n = 1 . Then,
1 i < j n ι i ι j d α 2 ( u i , u j ) inf u M i = 1 n ι i d α 2 ( u i , u ) .
Proof. 
By Example 3, since α 1 = 0 < α 2 1 , we know that D = d 1 α 1 d 2 α 2 = d α 2 is a distance with respect to ( 0 , 0 ) , in the sense of Definition 1, where (iii) holds with constant k = 1 . Then, (21) follows from Corollary 1 by taking f = g = 0 and k = 1 . □

4. Generalized Distance Inequalities for Self-Crossing Polygons

Let D be a distance on M with respect to ( f , g ) , in the sense of Definition 1, where f , g : M × M [ 0 , + ) . Let B 1 , B 2 , , B n M , n 3 , be the vertices of a possibly self-crossing polygon with unit perimeter with respect to D. The perimeter with respect to D is defined as
P ( B 1 , B 2 , , B n ) = i = 1 n D ( B i , B i + 1 ) , B n + 1 = B 1 .
Let
ρ n = inf P ( B 1 , B 2 , , B n ) = 1 1 i < j n D ( B i , B j ) ,
under the assumption of
{ B i } i = 1 n M : P ( B 1 , B 2 , , B n ) = 1 .
The below result holds.
Theorem 2. 
Let n 3 . Let D be a distance on M with respect to ( f , g ) , in the sense of Definition 1, where f , g : M × M [ 0 , + ) . We have
ρ n 1 4 n k 1 i , j n f ( B i , B j ) g ( B j , B i + 1 ) + f ( B j , B i + 1 ) g ( B i , B j ) ,
where ρ n is defined in (22).
Proof. 
Let B 1 , B 2 , , B n M be such that
P ( B 1 , B 2 , , B n ) = 1 .
Let S be the sum of pair-wise distances, that is,
S = 1 i < j n D ( B i , B j ) .
Then,
2 S = 1 i , j n D ( B i , B j ) .
On the other hand, by property (iii) in Definition 1, we have
D ( B i , B i + 1 ) k D ( B i , B j ) + D ( B j , B i + 1 ) + f ( B i , B j ) g ( B j , B i + 1 ) + f ( B j , B i + 1 ) g ( B i , B j ) .
By summing over i, we obtain
1 = P ( B 1 , B 2 , , B n ) k i = 1 n D ( B i , B j ) + i = 1 n D ( B j , B i + 1 ) + i = 1 n f ( B i , B j ) g ( B j , B i + 1 ) + f ( B j , B i + 1 ) g ( B i , B j ) .
On the other hand, we have
i = 1 n D ( B i , B j ) = i = 1 n D ( B j , B i + 1 ) .
Hence, the following holds:
1 k 2 i = 1 n D ( B i , B j ) + i = 1 n f ( B i , B j ) g ( B j , B i + 1 ) + f ( B j , B i + 1 ) g ( B i , B j ) .
Next, by summing over j and using (24), we obtain
n k 4 S + 1 i , j n f ( B i , B j ) g ( B j , B i + 1 ) + f ( B j , B i + 1 ) g ( B i , B j ) ,
which yields (23). □
Let us consider the special case of Theorem 2 when
D ( u , v ) = d α ( u , v ) , u , v M ,
where α > 0 and d is a distance on M. Notice that by Example 3, we know that D is a distance with respect to ( 0 , 0 ) , in the sense of Definition 1, where (iii) holds with
k = 1 if 0 < α 1 , 2 α 1 if α > 1 .
Hence, by Theorem 2, we deduce the below result.
Corollary 11. 
Let D be the generalized distance defined in (25). Then, for all n 3 , the following holds:
ρ n n 4 i f 0 < α 1 , n 2 α + 1 i f α > 1 .
In the case when α > 1 , we have the below additional result.
Theorem 3. 
Let D be the generalized distance defined in (25) with α > 1 . Then, for all 3 n < 2 α + 1 and { B i } i = 1 n M , with P ( B 1 , B 2 , , B n ) = 1 , we have
1 i < j n D ( B i , B j ) > n 2 α + 1 .
Proof. 
Let 3 n < 2 α + 1 be fixed. Then, by (26), for all { B i } i = 1 n M , with
P ( B 1 , B 2 , , B n ) = 1 ,
we have
1 i < j n D ( B i , B j ) n 2 α + 1 .
Let us suppose that (27) is not true. Then, there exist { B i } i = 1 n M with
P ( B 1 , B 2 , , B n ) = 1 ,
such that
1 i < j n D ( B i , B j ) = n 2 α + 1 .
On the other hand, we have
1 i < j n D ( B i , B j ) = i = 1 n 1 j = i + 1 n D ( B i , B j ) = D ( B n 1 , B n ) + i = 1 n 2 D ( B i , B i + 1 ) + j = i + 2 n D ( B i , B j ) = i = 1 n 1 D ( B i , B i + 1 ) + D ( B n , B 1 ) + i = 1 n 2 j = i + 2 n D ( B i , B j ) D ( B n , B 1 ) = P ( B 1 , B 2 , , B n ) + i = 1 n 2 j = i + 2 n D ( B i , B j ) D ( B n , B 1 ) = 1 + i = 1 n 2 j = i + 2 n D ( B i , B j ) D ( B n , B 1 ) .
Hence, by (28) and due to the assumption on n, we obtain
i = 1 n 2 j = i + 2 n D ( B i , B j ) D ( B n , B 1 ) = n 2 α + 1 2 α + 1 < 0 .
On the other hand,
i = 1 n 2 j = i + 2 n D ( B i , B j ) D ( B n , B 1 ) 0 .
Thus, we reach a contradiction. □
We next consider the case when M = R 2 and
D ( u , v ) = u v R 2 α , u , v R 2 ,
where α > 0 and · R 2 is the Euclidean norm on R 2 . In this case, we obtain the below result.
Theorem 4. 
Let D be the generalized distance defined in (29). Then, for all n 3 :
(i)
(26) holds,
(ii)
If n is even and 0 < α 1 , then
ρ n = n 4 ,
(iii)
If n is odd and 0 < α 1 , then
ρ n n + 1 4 ,
where ρ n is defined in (22).
Proof. 
(i) It immediately follows from Corollary 11 that by taking
M = R 2 , d ( u , v ) = u v R 2 .
(ii) Let n be even and 0 < α 1 . Let us consider the self-crossing polygon, where the vertices are defined as follows:
B i = ( 0 , 0 ) if i is odd n 1 α , 0 if i is even , i { 1 , 2 , , n } .
Then,
P ( B 1 , B 2 , , B n ) = B 1 B 2 R 2 α + + B n 1 B n R 2 α + B n B 1 R 2 α = n n 1 α α = 1 .
Furthermore, by (24), we have
2 S = 1 i , j n D ( B i , B j ) = i = 1 n j = 1 n D ( B i , B j ) = i = 1 n 2 j = 1 n D ( B 2 i , B j ) + i = 0 n 2 2 j = 1 n D ( B 2 i + 1 , B j ) = i = 1 n 2 j = 0 n 2 2 D ( B 2 i , B 2 j + 1 ) + i = 0 n 2 2 j = 1 n 2 D ( B 2 i + 1 , B 2 j ) = 2 n 4 ,
which yields S = n 4 . Then, by (26), we deduce that ρ n = n 4 .
(iii) Let n be even and 0 < α 1 . Let us consider the self-crossing polygon, where the vertices are defined as follows:
B i = ( 0 , 0 ) if i is odd ( n 1 ) 1 α , 0 if i is even , i { 1 , 2 , , n } .
Then,
P ( B 1 , B 2 , , B n ) = B 1 B 2 R 2 α + + B n 1 B n R 2 α = ( n 1 ) ( n 1 ) 1 α α = 1 .
Furthermore, by (24), we have
2 S = i = 2 n 1 D ( B i , B n ) + i = 1 n 1 j = 1 n 1 D ( B i , B j ) + j = 2 n 1 D ( B n , B j ) = 2 i = 2 n 1 D ( B i , B n ) + i = 1 n 1 j = 1 n 1 D ( B i , B j ) = 2 i = 1 n 1 2 D ( B 2 i , B n ) + i = 1 n 1 2 j = 1 n 1 D ( B 2 i , B j ) + i = 0 n 3 2 j = 1 n 1 D ( B 2 i + 1 , B j ) = 2 i = 1 n 1 2 D ( B 2 i , B n ) + i = 1 n 1 2 j = 0 n 3 2 D ( B 2 i , B 2 j + 1 ) + i = 0 n 3 2 j = 1 n 1 2 D ( B 2 i + 1 , B 2 j ) = 2 i = 1 n 1 2 D ( B 2 i , B n ) + i = 1 n 1 2 j = 0 n 3 2 D ( B 2 i , B 2 j + 1 ) = 2 ( n 1 ) 1 α α n 1 2 + ( n 1 ) 1 α α n 1 2 2 = 2 n + 1 4 .
This shows that S = n + 1 4 . Since ρ n S , we obtain ρ n n + 1 4 . □

5. Conclusions

In this paper, we first introduce the notion of a generalized distance function with respect to a pair of mappings. Namely, given a nonempty set M, we say that
D : M × M [ 0 , + )
is a distance with respect to ( f , g ) , where f , g : M × M [ 0 , + ) , if:
(i)
D ( u , v ) = D ( v , u ) for all u , v M .
(ii)
D ( u , u ) = 0 for all u M .
(iii)
There exists k > 0 such that
D ( u , v ) k D ( u , w ) + D ( w , v ) + f ( u , w ) g ( w , v ) + f ( w , v ) g ( u , w )
for all u , v , w M .
In Section 2, we provide several examples of generalized distance functions with respect to a pair of mappings. Moreover, motivated by the recent obtained results obtained by Dragomir [19], several inequalities involving sums of the form
1 i < j n ι i ι j D ( u i , u j ) ,
where { u i } i = 1 n M and ι i 0 , with ι 1 + ι 2 + + ι n = 1 , are established in Section 3. In Section 4, we provide new distance inequalities for self-crossing polygons.
It would be interesting to study the topological properties of distance functions with respect to a pair of mappings, for instance, convergence, Cauchy criterion and completeness. An interesting problem in this direction is to extend the Banach contraction principle [21] to a set M equipped with a distance function with respect to a pair of mappings.

Author Contributions

All authors equally contributed to this paper. All authors have read and agreed to the published version of the manuscript.

Funding

The second author was supported by Researchers Supporting Project number (RSP2023R4), King Saud University, Riyadh, Saudi Arabia.

Data Availability Statement

Not applicable.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Ramaswamy, R.; Mani, G.; Gnanaprakasam, A.; Abdelnaby, O.; Radenović, S. An application of Urysohn integral equation via complex partial metric Space. Mathematics 2022, 10, 2019. [Google Scholar] [CrossRef]
  2. Aslam, M.S.; Bota, M.F.; Chowdhury, M.S.R.; Guran, L.; Saleem, N. Common fixed points technique for existence of a solution of Urysohn type integral equations system in complex valued b-metric spaces. Mathematics 2021, 9, 400. [Google Scholar] [CrossRef]
  3. Şahin, M.; Kargin, A. Neutrosophic triplet v-generalized metric space. Axioms 2018, 7, 67. [Google Scholar] [CrossRef] [Green Version]
  4. Alsaadi, A.; Singh, B.; Singh, V.; Uddin, I. Meir-Keeler type contraction in orthogonal M-metric spaces. Symmetry 2022, 14, 1856. [Google Scholar] [CrossRef]
  5. Bakhtin, I.A. The contraction mapping principle in quasimetric spaces. J. Funct. Anal. 1989, 30, 26–37. [Google Scholar]
  6. Czerwik, S. Fixed point theorems and special solutions of functional equations. Uniw. Śląski 1980, 428, 1–83. [Google Scholar]
  7. Czerwik, S. Nonlinear set-valued contraction mappings in b-metric spaces. tti Sem. Mat. Fis. Univ. Modena 1998, 46, 263–276. [Google Scholar]
  8. Branciari, A. A fixed point theorem of Banach-Caccioppoli type on a class of generalized metric spaces. Publ. Math. Debr. 2000, 57, 31–37. [Google Scholar] [CrossRef]
  9. Jleli, M.; Samet, B. A generalized metric space and related fixed point theorems. Fixed Point Theory Appl. 2015, 2015, 61. [Google Scholar] [CrossRef] [Green Version]
  10. Wilson, W.A. On quasi-metric spaces. Am. J. Math. 1931, 53, 675–684. [Google Scholar] [CrossRef]
  11. Dragomir, S.S.; Gosa, A.C. An inequality in metric spaces. J. Indones. Math. Soc. 2005, 11, 33–38. [Google Scholar]
  12. Dragomir, S.S. Refined inequalities for the distance in metric spaces. Prepr. RGMIA Res. Rep. Coll. 2020, 23, 119. [Google Scholar] [CrossRef]
  13. Dragomir, S.S. Inequalities for the forward distance in metric spaces. Repr. RGMIA Res. Rep. Coll. 2020, 23, 122. [Google Scholar]
  14. Suzuki, T. Basic inequality on a b-metric space and its applications. J. Inequal. Appl. 2017, 2017, 256. [Google Scholar] [CrossRef] [PubMed] [Green Version]
  15. Aydi, H.; Samet, B. On some metric inequalities and applications. J. Funct. Space 2020, 2020, 3842879. [Google Scholar] [CrossRef]
  16. Gromov, M. Metric inequalities with scalar curvature. Geom. Funct. Anal. 2018, 28, 645–726. [Google Scholar] [CrossRef] [Green Version]
  17. Simić, S.; Radenović, S. A functional inequality. J. Math. Anal. Appl. 1996, 117, 489–494. [Google Scholar] [CrossRef] [Green Version]
  18. Lángi, Z. On the perimeters of simple polygons contained in a disk. Monatsh. Math. 2011, 162, 61–67. [Google Scholar] [CrossRef] [Green Version]
  19. Dragomir, S.S. Some power inequalities for the distance in metric spaces. Prepr. RGMIA Res. Rep. Coll. 2020, 23, 115. [Google Scholar]
  20. Agarwal, R.P.; Jleli, M.; Samet, B. Some integral inequalities involving metrics. Entropy 2021, 23, 871. [Google Scholar] [CrossRef]
  21. Banach, S. Sur les opérations dans les ensembles abstraits et leur application aux équations intégrales. Fund. Math. 1922, 3, 133–181. [Google Scholar] [CrossRef]
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Share and Cite

MDPI and ACS Style

Jleli, M.; Samet, B. On Some Inequalities Involving Generalized Distance Functions. Mathematics 2023, 11, 1157. https://doi.org/10.3390/math11051157

AMA Style

Jleli M, Samet B. On Some Inequalities Involving Generalized Distance Functions. Mathematics. 2023; 11(5):1157. https://doi.org/10.3390/math11051157

Chicago/Turabian Style

Jleli, Mohamed, and Bessem Samet. 2023. "On Some Inequalities Involving Generalized Distance Functions" Mathematics 11, no. 5: 1157. https://doi.org/10.3390/math11051157

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop