Next Article in Journal
Robust Code Constructions Based on Bent Functions and Spline Wavelet Decomposition
Next Article in Special Issue
Further Inequalities for the Weighted Numerical Radius of Operators
Previous Article in Journal
Algorithmic Trading and Financial Forecasting Using Advanced Artificial Intelligence Methodologies
Previous Article in Special Issue
Convergence of Special Sequences of Semi-Exponential Operators
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

On Several Bounds for Types of Angular Distances

by
Augusta Raţiu
1,*,† and
Nicuşor Minculete
2,†
1
Department of Mathematics and Informatics, Lucian Blaga University of Sibiu, 550012 Sibiu, Romania
2
Department of Mathematics and Computer Science, Transilvania University of Braşov, 500091 Braşov, Romania
*
Author to whom correspondence should be addressed.
These authors contributed equally to this work.
Mathematics 2022, 10(18), 3303; https://doi.org/10.3390/math10183303
Submission received: 5 August 2022 / Revised: 5 September 2022 / Accepted: 10 September 2022 / Published: 12 September 2022
(This article belongs to the Special Issue Mathematical Inequalities, Models and Applications)

Abstract

:
In this study, we introduce the expression d λ ( x , y ) : = λ x + ( 1 λ ) y λ x + ( 1 λ ) y on the real normed space X ( X , · ) , where x , y X and λ R . We characterize this expression and find various estimates of it. We also obtain a generalization and some refinements of Maligranda’s inequality. Finally, we give some relations between d λ ( x , y ) and several types of angular distances between two nonzero vectors in a real normed space.
MSC:
46C05; 26D15; 26D10

1. Introduction

In the literature related to the theory of inequalities, many recently published papers contain studies of certain inequalities in different normed spaces.
An important inequality in a real or complex inner product space is the inequality of Cauchy–Schwarz (see [1,2]), namely:
| x , y |     x y
for all x , y X , where X is a real or complex inner product space. Moreover, equality (1) holds if and only if x and y are linearly dependent. Among those who have studied this inequality, we can mention Aldaz [3] and Dragomir [4].
Let X be a complex normed space. A classical inequality that characterizes a normed space is the triangle inequality, which is given by
x + y     x + y
for all x , y X . Other results about this inequality were given by Pečarić and Rajić in [5]. In [6], a characterization for a generalized triangle inequality in normed spaces was proven, and in [7], we observed some estimates of the triangle inequality using integrals. A recent study of the variational inequalities was given in [8,9].
In [10], Maligranda proved the following interesting inequality:
A · min { x , y }     x + y x + y     A · max { x , y } ,
where A = 2   x x + y y   0 , and x and y are nonzero vectors in the normed space X = ( X , · ) . Applying this inequality deduced by Maligranda [11], a lower bound and an upper bound for the norm-angular distance or Clarkson distance can be found (see e.g., [12]) between nonzero vectors x and y, α [ x , y ] =   x x y y ; thus,
x y | x y | min { x , y } α [ x , y ] x y + | x y | max { x , y } .
The right side of inequality (4) represents an improvement of the Massera–Schäffer inequality proved in [13]:
α [ x , y ] 2 x y max { x , y }
for every nonzero vector x and y in X , which is stronger than the Dunkl–Williams inequality, which was given in [14]. Other results for bounds to the angular distance, named Dunkl–Williams-type theorems (see [14]), were given by Moslehian et al. [15].
In [16], Dehghan presented a refinement of the triangle inequality, and a simple characterization of inner product spaces was obtained by using the skew angular distance between nonzero vectors x and y; thus: β [ x , y ] = x y y x . In [16], we found the following double inequality:
x y min { x , y } | x y | max { x , y } β [ x , y ] x y max { x , y } + | x y | min { x , y }
for any nonzero vectors x and y in a real normed linear space X = ( X , · ) .
Many improvements of bounds for the angular distance and skew angular distance were established in [17,18]. The notion of the norm-angular distance was generalized to the p-angular distance in normed space in [10]; thus,
α p [ x , y ] = x p 1 x y p 1 y ,
where the nonzero vectors x and y are in a normed space X = ( X , · ) and p 0 . In fact, we can take p R . It is easy to see that α 0 [ x , y ] = α [ x , y ] .
The notion of skew p–angular distance between nonzero vectors x and y in a normed space X = ( X , · ) and p R was given by Rooin et al. in [19]; thus,
β p [ x , y ] = y p 1 x x p 1 y .
This notion generalizes the concept of skew angular distance between nonzero vectors x and y, β [ x , y ] = x y y x , which was given by Dehghan in [16], because β 0 [ x , y ] = β [ x , y ] .
On the real normed space X = ( X , · ) , we introduce the following expression:
d λ ( x , y ) : = λ x + ( 1 λ ) y λ x + ( 1 λ ) y ,
where x , y X and λ R . When λ [ 0 , 1 ] , from the triangle inequality, we find that d λ ( x , y ) 0 , for all x , y X , and it easy to see that 2 d 1 / 2 ( x , y ) = x + y x + y 0 . We find the following properties:
d λ ( x , 0 ) = d λ ( 0 , y ) = d λ ( x , x ) = d 0 ( x , y ) = d 1 ( x , y ) = 0 ,     d λ ( x , y ) = d 1 λ ( y , x )
and
d λ x x , y y = 1 λ x x + ( 1 λ ) y y
for every x , y X { 0 } .
The purpose of this article is to characterize the expression d λ ( x , y ) by finding various estimates of it. We will obtain some refinements of some known inequalities. We also give some relations between d λ ( x , y ) and several types of angular distances between two nonzero vectors in a real normed space X .

2. Main Results

Next, we give several relations that are necessary for proving some inequalities of the Maligranda type related to d · ( · , · ) .
Lemma 1.
Let x , y be two vectors in the real normed space X = ( X , · ) . If λ R , then the following equalities hold:
d λ ( x , y ) = d 2 λ 1 2 ( x + y ) , y + 2 λ d 1 / 2 ( x , y )
and
d λ ( x , y ) = d 2 λ 1 x , 1 2 ( x + y ) + 2 ( 1 λ ) d 1 / 2 ( x , y ) .
Proof. 
Using the definition of d λ ( x , y ) , by regrouping the terms, we obtain
d 2 λ 1 2 ( x + y ) , y = 2 λ x + y 2 + ( 1 2 λ ) y 2 λ x + y 2 + ( 1 2 λ ) y = λ x + y + ( 1 2 λ ) y λ x + ( 1 λ ) y = λ x + ( 1 λ ) y λ x + ( 1 λ ) y λ ( x + y x + y ) = d λ ( x , y ) λ ( x + y x + y ) ,
which implies the first relation of the statement. In the same way, we have
d 2 λ 1 x , 1 2 ( x + y ) = ( 2 λ 1 ) x + ( 2 2 λ ) x + y 2 ( 2 λ 1 ) x + ( 2 2 λ ) x + y 2 = ( 2 λ 1 ) x + ( 1 λ ) x + y λ x + ( 1 λ ) y = λ x + ( 1 λ ) y λ x + ( 1 λ ) y ( 1 λ ) ( x + y x + y ) = d λ ( x , y ) ( 1 λ ) ( x + y x + y ) ,
which implies the second relation of the statement. □
For λ [ 0 , 1 ] , it is easy to see that d λ ( x , y ) 0 for every x , y X . Next, we study the case when λ ( 0 , 1 ) .
Lemma 2.
If λ R ( 0 , 1 ) , then the following inequality holds:
d λ ( x , y ) 0
for all x , y X .
Proof. 
We study two cases:
(I) If λ 0 , then, by applying the triangle inequality, we obtain
d λ ( x , y ) = λ x + ( 1 λ ) y λ x + ( 1 λ ) y
= ( λ x + λ x + ( 1 λ ) y ( 1 λ ) y ) 0 ;
(II) If λ 1 , then, by using the triangle inequality, we deduce that
d λ ( x , y ) = λ x + ( 1 λ ) y λ x + ( 1 λ ) y
= ( ( 1 λ ) y + λ x + ( 1 λ ) y λ x ) 0 .
Therefore, the inequality of the statement is true. □
Proposition 1.
If λ [ 0 , 1 ] , then the following inequality holds:
2 min { λ , 1 λ } d 1 / 2 ( x , y ) d λ ( x , y ) 2 max { λ , 1 λ } d 1 / 2 ( x , y )
for all x , y X .
Proof. 
For λ [ 0 , 1 2 ] , we have 2 λ [ 0 , 1 ] and 2 λ 1 [ 1 , 0 ] , so we show that d 2 λ 1 2 x + y , y 0 , and using Lemma 2, we have the inequality d 2 λ 1 x , 1 2 ( x + y ) 0 . From equalities (7) and (8), we obtain
2 λ d 1 / 2 ( x , y ) d λ ( x , y ) 2 ( 1 λ ) d 1 / 2 ( x , y ) .
For λ [ 1 2 , 1 ] , in the same way, we prove that
2 ( 1 λ ) d 1 / 2 ( x , y ) d λ ( x , y ) 2 λ d 1 / 2 ( x , y ) .
Consequently, combining inequalities (11) and (12), the inequality of the statement is true. □
Remark 1.
For λ ( 0 , 1 ) , inequality (10) can be written as
0 d λ ( x , y ) max { λ , 1 λ } x + y x + y d λ ( x , y ) min { λ , 1 λ }
for all x , y X . For λ = y x + y , we obtain Maligranda’s inequality; thus, inequality (10) represents a generalization of Maligranda’s inequality.
In general, for a , b > 0 and using relation (10), for λ = a a + b , we find the following inequality:
2 min { a , b } a + b d 1 / 2 ( x , y ) d a a + b ( x , y ) 2 max { a , b } a + b d 1 / 2 ( x , y )
for all x , y X , which can be rewritten as
min { a , b } ( x + y x + y ) a x + b y a x + b y
max { a , b } ( x + y x + y )
for all vectors x and y in X and a , b R + . This inequality is given in [20]. For the nonzero vectors x , y X , we take a = 1 x and b = 1 y in inequality (15), which prove inequality (3) given by Maligranda [10]. If x = 0 or y = 0 , then, in relation (15), we obtain equality.
Inequality (15) has several results related to the p-angular distance in normed space in [20] and the skew p-angular distance between nonzero vectors x and y in a normed space X . Therefore, our interest is in refining inequality (15), which can be obtained from inequality (10).
Theorem 1.
Let x , y be two vectors in a real normed space X . If λ [ 0 , 1 2 ] ; then, the following inequality holds:
2 λ d 1 / 2 ( x , y ) + 2 min { 2 λ , 1 2 λ } d 1 / 2 1 2 x + y , y d λ ( x , y )
2 λ d 1 / 2 ( x , y ) + 2 max { 2 λ , 1 2 λ } d 1 / 2 1 2 x + y , y
and if λ [ 1 2 , 1 ] , then the inequality
2 ( 1 λ ) d 1 / 2 ( x , y ) + 2 min { 2 λ 1 , 2 2 λ } d 1 / 2 x , 1 2 x + y d λ ( x , y )
2 ( 1 λ ) d 1 / 2 ( x , y ) + 2 max { 2 λ 1 , 2 2 λ } d 1 / 2 x , 1 2 x + y
holds.
Proof. 
For λ [ 0 , 1 2 ] , we have 2 λ [ 0 , 1 ] , and by replacing x with 1 2 x + y in inequality (10), we deduce that
2 min { 2 λ , 1 2 λ } d 1 / 2 1 2 x + y , y d 2 λ 1 2 x + y , y
2 max { 2 λ , 1 2 λ } d 1 / 2 1 2 x + y , y .
Consequently, by combining equality (7) with inequality (18), we show the first inequality of the statement.
For λ [ 1 2 , 1 ] , we have 2 λ 1 [ 0 , 1 ] , and by replacing y with 1 2 x + y in inequality (10), we deduce that
2 min { 2 λ 1 , 2 2 λ } d 1 / 2 x , 1 2 x + y d 2 λ 1 x , 1 2 x + y
2 max { 2 λ 1 , 2 2 λ } d 1 / 2 x , 1 2 x + y .
Consequently, by combining equality (8) with inequality (19), we prove the second inequality of the statement. □
Remark 2.
We are studying the problem of comparing the upper bound from inequality (10) with the upper bounds from inequalities (16) and (17) to see which is better. For λ [ 0 , 1 4 ] , through simple calculations, we prove the inequality
2 λ d 1 / 2 ( x , y ) + 2 max { 2 λ , 1 2 λ } d 1 / 2 1 2 x + y , y 2 ( 1 λ ) d 1 / 2 ( x , y ) .
Therefore, for λ [ 0 , 1 4 ] , the upper bound from inequality (16) is better. However, for λ [ 1 4 , 1 2 ] , inequality (20) becomes
( 1 λ ) x + y + ( 4 λ 1 ) y ( 1 2 λ ) x + λ x + 3 y ,
which is true for y = x and false for y = 1 3 x . For λ [ 3 4 , 1 ] , through simple calculations, we prove the inequality
2 ( 1 λ ) d 1 / 2 ( x , y ) + 2 max { 2 λ 1 , 2 2 λ } d 1 / 2 x , 1 2 x + y 2 λ d 1 / 2 ( x , y ) .
Consequently, for λ [ 3 4 , 1 ] , the upper bound from inequality (17) is better. However, for λ [ 1 2 , 3 4 ] , inequality (21) becomes
λ x + y + ( 3 4 λ ) x ( 2 λ 1 ) y + ( 1 λ ) 3 x + y ,
which is true for y = x and false for y = 3 x .
We choose two real numbers a and b such that 0 < a b ; if we use relation (16) for λ = a a + b 1 2 , then we obtain the following inequality:
2 a a + b d 1 / 2 ( x , y ) + 2 min { 2 a , b a } a + b d 1 / 2 1 2 x + y , y d a a + b ( x , y )
2 a a + b d 1 / 2 ( x , y ) + 2 max { 2 a , b a } a + b d 1 / 2 1 2 x + y , y
for all x , y X , which can be rewritten as
a ( x + y x + y ) + 1 2 min { 2 a , b a } ( x + y + 2 y x + 3 y )
a x + b y a x + b y
a ( x + y x + y ) + 1 2 max { 2 a , b a } ( x + y + 2 y x + 3 y )
for all vectors x and y in X and a , b R + , a b . This inequality refined the first part of inequality (15). Next, if we have y x , then we take a = y and b = x in inequality (23), and we find the inequality
x + y x + y + min { 1 , x y 2 y } ( x + y + 2 y x + 3 y )
x 2 x x + y y
x + y x + y + max { 1 , x y 2 y } ( x + y + 2 y x + 3 y )
for all nonzero vectors x and y in X . Thus, we prove an improvement of the second part of the inequality of Maligranda given in relation (3). Replacing y with y and taking y x , through simple calculations in inequality (24), we obtain a refinement of the second part of inequality (4); thus,
α [ x , y ] x y + x y x E = x y + | x y | max { x , y } E ,
where E = 1 2 x y min { 2 y , x y } ( x y + 2 y x 3 y ) 0 .
A generalization of the equalities from Lemma 1 is given below.
Theorem 2.
Let x , y be two vectors in the real normed space X and a natural number n 1 . If λ R , then the following equalities hold:
d λ ( x , y ) = λ k = 1 n 2 k d 1 / 2 1 2 k 1 x + 1 1 2 k 1 y , y + d 2 n λ 1 2 n x + 1 1 2 n y , y
and
d λ ( x , y ) = ( 1 λ ) k = 1 n 2 k d 1 / 2 x , 1 1 2 k 1 x + 1 2 k 1 y + d 2 n λ + 1 2 n x , 1 1 2 n x + 1 2 n y .
Proof. 
Using Lemma 1 for λ R , we have
d λ ( x , y ) = d 2 λ 1 2 ( x + y ) , y + 2 λ d 1 / 2 ( x , y ) .
Replacing λ with 2 λ and x with 1 2 ( x + y ) in the above equality, we get
d 2 λ 1 2 ( x + y ) , y = d 2 2 λ 1 2 ( 1 2 ( x + y ) + y ) , y + 2 2 λ d 1 / 2 1 2 ( x + y ) , y .
If we inductively repeat the above substitutions, for k 1 , we have
d 2 k 1 λ 1 2 k 1 x + 1 1 2 k 1 y , y = d 2 k λ 1 2 k x + 1 1 2 k y , y
+ 2 k λ d 1 / 2 1 2 k 1 x + 1 1 2 k 1 y , y .
Therefore, summarizing the above relations for k { 1 , , n } , we obtain the relation of the statement. Applying equality (26) and taking into account that d λ ( x , y ) = d 1 λ ( y , x ) , we deduce equality (27). □
These equalities offer the possibility of refining inequalities (16) and (17), giving the following.
Theorem 3.
Let n a natural number, n 1 . If λ 0 , 1 2 n , then the following inequality holds:
λ k = 1 n 2 k d 1 / 2 1 2 k 1 x + 1 1 2 k 1 y , y + 2 min { 2 n λ , 1 2 n λ } d 1 / 2 1 2 n x + 1 1 2 n y , y
d λ ( x , y )
λ k = 1 n 2 k d 1 / 2 1 2 k 1 x + 1 1 2 k 1 y , y + 2 max { 2 n λ , 1 2 n λ } d 1 / 2 1 2 n x + 1 1 2 n y , y
and if λ 1 1 2 n , 1 , then the following inequality holds:
( 1 λ ) k = 1 n 2 k d 1 / 2 x , 1 1 2 k 1 x + 1 2 k 1 y + 2 min { λ , 1 λ } d 1 / 2 x , 1 1 2 n x + 1 2 n y
d λ ( x , y )
( 1 λ ) k = 1 n 2 k d 1 / 2 x , 1 1 2 k 1 x + 1 2 k 1 y + 2 max { λ , 1 λ } d 1 / 2 x , 1 1 2 n x + 1 2 n y ,
where λ = 2 n λ + 1 2 n .
Proof. 
Using the inequalities from Proposition 1 and combining them with equalities (26) and (27), we deduce that the inequalities of the statement are true. □
Finally, we present some applications.
(1) In terms of expression d λ ( x , y ) , we show a relation that involves the p–angular distance:
2 d 1 / 2 x p 1 ( x y ) , ( x p 1 y p 1 ) y
= x p 1 x y + | x p 1 y p 1 | y α p [ x , y ] .
Given that d 1 / 2 x p 1 ( x y ) , ( x p 1 y p 1 ) y 0 , we have the following inequality:
α p [ x , y ] x p 1 x y + | x p 1 y p 1 | y
for all nonzero vectors x , y X and p R .
(2) For p = 0 in relation (30), we deduce the equality:
2 d 1 / 2 1 x ( x y ) , 1 x 1 y y = x y + | x y | x α [ x , y ] .
Because d 1 / 2 1 x ( x y ) , 1 x 1 y y 0 , we prove the inequality
α [ x , y ] x y + | x y | x .
Interchanging the roles of x and y, in (33), we get the second inequality from relation (4).
(3) Next, we show a relation that involves the skew p–angular distance in terms of expression d λ ( x , y ) , namely:
2 d 1 / 2 y p 1 ( x y ) , ( y p 1 x p 1 ) y
= y p 1 x y + | x p 1 y p 1 | y β p [ x , y ] ;
(4) For p = 0 in relation (34), we deduce the equality:
2 d 1 / 2 1 y ( x y ) , 1 y 1 x y = x y y + | x y | x β [ x , y ] .
Given that d 1 / 2 1 y ( x y ) , 1 y 1 x y 0 , we find the inequality
β [ x , y ] x y y + | x y | x .
Interchanging the roles of x and y, in (36), we get the second inequality from relation (6).
(5) From inequality (10), we deduce that
d λ ( x , y ) max { λ , 1 λ } 2 d 1 / 2 ( x , y )
for all x , y X and λ [ 0 , 1 ] , and applying equality (30), we find that
λ x p 1 x y + ( 1 λ ) | x p 1 y p 1 | y F max { λ , 1 λ }
= d λ x p 1 ( x y ) , ( x p 1 y p 1 ) y max { λ , 1 λ }
x p 1 x y + | x p 1 y p 1 | y α p [ x , y ] ,
where F = λ x p 1 ( x y ) + ( 1 λ ) ( x p 1 y p 1 ) y .
(6) From inequality (37) and by applying equality (34), we prove that
λ y p 1 x y + ( 1 λ ) | x p 1 y p 1 | y G max { λ , 1 λ }
= d λ y p 1 ( x y ) , ( y p 1 x p 1 ) y max { λ , 1 λ }
y p 1 x y + | x p 1 y p 1 | y β p [ x , y ] ,
where G = λ y p 1 ( x y ) + ( 1 λ ) ( y p 1 x p 1 ) y .

3. Conclusions

Maligranda’s inequality is an important inequality in real normed spaces. This is used to estimate the angular distance, the p–angular distance, the skew angular distance, and the skew p–angular distance between two nonzero vectors in a real normed space. Therefore, the study of some refinements of this inequality helps with a better estimation of the mentioned previously angular distances. In addition, in this paper, we obtained other inequalities of the Maligranda type. Using equality (7), we proved two inequalities in Theorem 1, which improved the second part of Maligranda’s inequality. These results can be used to obtain better estimates of angular distances. In Theorem 3, we also presented a result that refined the inequalities obtained in Theorem 1. By replacing the parameter λ with various values or by replacing the vectors x , y with linear combinations of these vectors, we obtained other applications for d λ ( x , y ) , where x , y X . It remains for the reader to find other estimates of the expression d λ ( x , y ) , where x , y X and λ R .

Author Contributions

The work presented here was carried out as a collaboration between both authors. Both authors contributed equally and significantly to the writing of this article. Both authors contributed to the manuscript. All authors have read and agreed to the published version of the manuscript.

Funding

Project financed by Lucian Blaga University of Sibiu & Hasso Plattner Foundation research grants LBUS-IRG-2021-07.

Acknowledgments

The authors want to thank the anonymous reviewers and editor for their careful reading of the manuscript and for the many valuable remarks and suggestions.

Conflicts of Interest

The authors declare no conflict of interest. The funders had no role in the design of the study; in the collection, analyses, or interpretation of data; in the writing of the manuscript, or in the decision to publish the results.

References

  1. Cauchy, A.-L. Cours d’ Analyse de l’ École Royale Polytechnique; Premiére Partie, Analyse Algébrique: Paris, France, 1821; reprinted in Editions Jacques Gabay: Paris, France, 1989. [Google Scholar]
  2. Mitrinović, D.S.; Pečarić, J.; Fink, A.M. Classical and New Inequalities in Analysis; Kluwer Academic: Dordrecht, The Netherlands, 1992. [Google Scholar]
  3. Aldaz, J.M. Strengthened Cauchy-Schwarz and Hölder inequalities. J. Inequal. Pure Appl. Math. 2009, 10, 116. [Google Scholar]
  4. Dragomir, S.S. A potpourri of Schwarz related inequalities in inner product spaces (II). J. Inequal. Pure Appl. Math. 2006, 7, 14. [Google Scholar]
  5. Pečarić, J.; Rajić, R. On some generalized norm triangle inequalities. Rad HAZU 2013, 515, 43–52. [Google Scholar]
  6. Dadipour, F.; Moslehian, M.S.; Rassias, J.M.; Takahasi, S.E. Characterization of a generalized triangle inequality in normed spaces. Nonlinear Anal. 2012, 75, 735–741. [Google Scholar] [CrossRef]
  7. Minculete, N.; Păltănea, R. Improved estimates for the triangle inequality. J. Inequal. Appl. 2017, 2017, 17. [Google Scholar] [CrossRef] [PubMed]
  8. Chadli, O.; Yao, J.C. On variational–hemivariational inequalities with nonconvex constraints. J. Nonlinear Var. Anal. 2021, 5, 893–907. [Google Scholar]
  9. Wang, H. Certain integral inequalities related to (φ,ϱα)–Lipschitzian mappings and generalized h–convexity on fractal sets. J. Nonlinear Funct. Anal. 2021, 12. [Google Scholar] [CrossRef]
  10. Maligranda, L. Simple Norm Inequalities. Am. Math. Mon. 2006, 113, 256–260. [Google Scholar] [CrossRef]
  11. Maligranda, L. Some remarks on the triangle inequality for norms. Banach J. Math. Anal. 2008, 2, 31–41. [Google Scholar] [CrossRef]
  12. Clarkson, J.A. Uniformly convex spaces. Trans. Am. Math. Soc. 1936, 40, 396–414. [Google Scholar] [CrossRef]
  13. Massera, J.L.; Schäffer, J.J. Linear differential equations and functional analysis I. Ann. Math. 1958, 67, 517–573. [Google Scholar] [CrossRef]
  14. Dunkl, C.F.; Wiliams, K.S. A simple norm inequality. Am. Math. Mon. 1964, 71, 53–54. [Google Scholar] [CrossRef]
  15. Moslehian, M.S.; Dadipour, F.; Rajić, R.; Marić, A. A glimpse at the Dunkl-Williams inequality. Banach J. Math. Anal. 2011, 5, 138–151. [Google Scholar] [CrossRef]
  16. Dehghan, H. A characterization of inner product spaces related to the skew-angular distance. Math. Notes 2013, 93, 556–560. [Google Scholar] [CrossRef] [Green Version]
  17. Krnić, M.; Minculete, N. Characterizations of inner product spaces via angular distances and Cauchy-Schwarz inequality. Aequat. Math. 2021, 95, 147–166. [Google Scholar] [CrossRef]
  18. Krnić, M.; Minculete, N. Bounds for the p-Angular Distance and Characterizations of Inner Product Spaces. Mediterr. J. Math. 2021, 18, 1–22. [Google Scholar] [CrossRef]
  19. Rooin, J.; Habibzadeh, S.; Moslehian, M.S. Geometric aspects of p-angular skew p-angular distances. Tokyo J. Math. 2018, 41, 1–20. [Google Scholar]
  20. Minculete, N.; Moradi, H.R. Some improvements of the Cauchy-Schwarz inequality using the Tapia semi-inner-product. Mathematics 2020, 8, 2112. [Google Scholar] [CrossRef]
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Share and Cite

MDPI and ACS Style

Raţiu, A.; Minculete, N. On Several Bounds for Types of Angular Distances. Mathematics 2022, 10, 3303. https://doi.org/10.3390/math10183303

AMA Style

Raţiu A, Minculete N. On Several Bounds for Types of Angular Distances. Mathematics. 2022; 10(18):3303. https://doi.org/10.3390/math10183303

Chicago/Turabian Style

Raţiu, Augusta, and Nicuşor Minculete. 2022. "On Several Bounds for Types of Angular Distances" Mathematics 10, no. 18: 3303. https://doi.org/10.3390/math10183303

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