Preprint
Article

This version is not peer-reviewed.

Fixed Point Results and the Ekeland Variational Principle in Vector B-Metric Spaces

A peer-reviewed article of this preprint also exists.

Submitted:

10 February 2025

Posted:

13 February 2025

You are already at the latest version

Abstract

In this paper, we extend the concept of b-metric spaces to the vectorial case, where the distance is vector-valued, and the constant in the triangle inequality axiom is replaced by a matrix. For such spaces, we establish results analogous to those in the b-metric setting: fixed-point theorems, stability results, and a variant of Ekeland’s variational principle. As a consequence, we also derive a variant of Caristi’s fixed-point theorem.

Keywords: 
;  ;  ;  

1. Introduction

The concept of a b-metric space arises as a natural generalization of a metric space, where the triangle inequality axiom is relaxed by introducing a constant b 1 on its right-hand side. Early ideas in this direction can be traced back to the notion of "quasimetric" spaces, as discussed in [1]. However, the formal definition and terminology of b-metric spaces are widely attributed to Bakhtin [3] and Czerwik [4]. Notably, one of the earliest works to introduce a mapping satisfying the properties of a b-metric dates back to 1970 in [5], where such a mapping was referred to as a "distance". A concept related to that of a b-metric is the notion of a quasi-norm, which can be traced back to Hyers [6] and Bourgin [7], who originally used the term "quasi-norm." For a survey on b-metric spaces we send the reader to [8,9].
Various results from the classical theory of metric spaces have been extended to b-metric spaces, including fixed-point theorems (see, e.g., [10,11,12,13,14,15]), estimations (see, e.g.,[16,17]), stability results (see, e.g, [18,19]), and variational principles (see, e.g., [20,21]). In [22], the metric was allowed to take vector values, and results analogous to those for b-metric spaces were established, with matrices converging to zero replacing the contraction constants, but not the constant b from the triangle inequality axiom.
In this paper, we introduce the concept of a vector B-metric space, where the scalar constant b in the triangle inequality is replaced by a matrix B. This generalization introduces new challenges in establishing results analogous to those for classical b-metric spaces. To the best of our knowledge, this concept, along with the corresponding results presented here, is novel. Notably, some of the results appear to be new even in the scalar particular case where the matrix B is reduced to a constant.
Throughout this paper, we consider R n -valued vector metrics ( n 1 ) on a set X, i.e., mappings d : X × X R + n . In the scalar case ( n = 1 ), we use the special notation ρ to denote a standard metric or a b-metric.
The classical definition of a b-metric reads as follows:
Definition 1.
Let X be a set and let b 1 be a given real number. A mapping ρ : X × X R + is said to be a b-metric if for all x , y , z X the following conditions are satisfied: ρ ( x , y ) 0 , ρ ( x , y ) = 0 if and only if x = y , ρ ( x , y ) = ρ ( y , x ) and ρ ( x , z ) b ρ ( x , y ) + ρ ( y , z ) . The pair ( X , ρ ) is called a b-metric space.
In case the mapping ρ is allowed to be vector-valued and one replaces the constant b by a matrix B, we obtain our definition of a vector B-metric space.
Definition 2.
Let X be a set, n 1 and let B M n × n ( R ) be an arbitrary matrix. A mapping d = ( d 1 , d 2 , , d n ) : X × X R + n is called a vector B-metric if for all u , v , w X , one has
  • (positivity): d ( u , v ) 0 and d ( u , v ) = 0 if and only if u = v ;
  • (symmetry): d ( u , v ) = d ( v , u ) ;
  • (triangle inequality): d ( u , w ) B d ( u , v ) + d ( v , w ) .
The pair ( X , d ) is called a vector B-metric space.

2. Preliminaries

In this paper, the vectors in R n are looked as column matrices and ordering between them and, more generally, between matrices of the same size is understood by components. Likewise, the convergence of a sequence of vectors or matrices is understood componentwise.
The spaces of square matrices of size n with real number entries and nonnegative entries are denoted by M n × n R and M n × n R + , respectively. An element of M n × n R + is refereed as a positive matrix, while a matrix M M n × n R is called inverse-positive if it is invertible and its inverse M 1 is positive.
A positive matrix M is said to be convergent to zero if its power M k tends to the zero matrix 0 n as k .
One has the following characterizations of matrices which are convergent to zero (see, e.g., [23,24]).
Proposition 1.
Let M M n × n R + and let I be the identity matrix of size n . The following statements are equivalent:
(a)
M is convergent to zero.
(b)
The spectral radius r M of matrix M is less than 1 , i.e., r M < 1 .
(c)
I M is invertible and I M 1 = I + M + M 2 + . . . .
(d)
I M is inverse-positive.
The following proposition collects the various properties equivalent to the notion of an inverse-positive matrix (see, e.g., [24,25]).
Proposition 2.
Let M M n × n R . The following statements are equivalent:
(a)
M is inverse-positive.
(b)
M is monotone, i.e., M x 0 x R n implies x 0 .
(c)
There exists a positive matrix M ¯ and a real number s > r M ¯ such that the following representation holds: M = s I M ¯ .
Clearly, if M is inverse-positive, from the representation M = s I M ¯ , we immediately see that all its entries except those from the diagonal are 0 ; also the matrix 1 s M ¯ is convergent to zero. If a matrix M is both positive and inverse-positive, using the representation M = s I M ¯ we deduce that M must be a diagonal matrix with strictly positive diagonal entries.
A mapping N : X X defined on a vector B-metric space X , d is said to be a Perov contraction mapping if there exists a matrix A convergent to zero such that
d N x , N y A d x , y
for all x , y X .
The next proposition is about the relationship between vector B-metrics and both vector and scalar b-metrics.
Proposition 3.(10) Any vector-valued b-metric d can be identified with a vector B b -metric, where B b is the diagonal matrix whose diagonal entries are all equal to b .
(20) If d is a vector B-metric with an inverse-positive matrix B , then d is also a vector B ̲ -metric with respect to the diagonal matrix B ̲ that preserves the diagonal of B , as well as a vector-valued b ˜ -metric with b ˜ = max b i i : 1 i n . Here B = b i j 1 i , j n .
(30) If d is a vector B-metric with a positive matrix B , then to each norm in R n one can associate a scalar b-metric, for example:
ρ 1 ( x , y ) : = i = 1 n d i ( x , y ) , is a b 1 - metric , b 1 : = i = 1 n max 1 j n b i j , ρ ( x , y ) : = max 1 i n d i ( x , y ) , is a b - metric , b : = max 1 i n j = 1 n b i j , ρ 2 ( x , y ) : = i = 1 n d i ( x , y ) 2 1 2 , is a b 2 - metric , b 2 : = i , j = 1 n b i j 2 1 2 .
Thus, to any vector B-metric, one can associate different (scalar) b-metrics, depending on the chosen metric on R n . However, as shown in [23], working in a vector setting with matrices instead of numbers is more accurate especially when a connection with other matrices is necessary. It will also be the case of this work where some conditions or conclusions will connect the matrix B with the matrix A involved in (1).
If Y is a nonempty subset of a vector B-metric space X , d , we define the diameter of the set Y by
diam d ( Y ) : = sup { ρ 1 x , y : x , y Y } = sup i = 1 n d i x , y : x , y Y .
From this definition, it follows immediately that if diam d Y = a , then d x , y a e for all x , y Y , where e = ( 1 , 1 , , 1 ) R n . Conversely, if d x , y a e for all x , y Y , then diam d ( Y ) n a .
Although a b-metric does not generate a topology (see, e.g., [26]), several topological properties can still be defined in terms of sequences (e.g., closed sets, continuous operators, or lower semicontinuous functionals).
We conclude this section by two examples of vector B-metrics.
Example 1.
Let d : R 2 × R 2 R + 2 be given by
d ( x , y ) = | x 1 y 1 | 2 + | x 2 y 2 | | x 2 y 2 | , ,
for x = ( x 1 , x 2 ) , y = ( y 1 , y 2 ) R 2 . Then, R 2 , d is a vector B-metric space, where
B = 2 1 0 1 .
Here, the matrix B is inverse-positive, but not positive.
Example 2.
We present an example of a vector-valued mapping d which is a vector B-metric with respect to a positive matrix, but for which no inverse-positive matrix exists such that d remains a vector B-metric. Let
S = ( t , t ) : t R R 2 ,
and let d : R 2 × R 2 R + 2 be given by
d ( x , y ) = ( 0 , 0 ) if x = y , | x y | 2 , | x y | if x , y S , | x y | , | x y | 2 otherwise ,
where z = | ( z 1 , z 2 ) | = | z 1 | + | z 2 | is a norm on R 2 . Note that d is a vector B 0 -metric, where
B 0 = 2 2 1 1 .
Let us show that B 0 is the smallest matrix for which the triangle inequality holds for d. To this aim, let B = ( b i j ) 1 i , j n be any matrix for which the triangle inequality is satisfied. Then, for x , y S and z S , we have
| x y | 2 | x y | b 11 | x z | + | z y | + b 12 | x z | 2 + | z y | 2 b 21 | x z | + | z y | + b 22 | x z | 2 + | z y | 2 .
Let t , α R 0 , and set x = ( t , t ) S , y = ( 0 , 0 ) S and z = ( α , 0 ) S . The first inequality in (2) yields,
4 t 2 b 11 | t α | + | t | + α + b 12 ( | t α | + | t | ) 2 + α 2 .
Clearly, taking α = t and the limit as t , this inequality holds only if b 12 2 . Similarly, from the second inequality, we obtain
2 t b 21 | t α | + | t | + α + b 22 ( | t α | + | t | ) 2 + α 2 .
Setting α = t 2 , we find that
2 t 2 b 21 t + 5 b 22 t 2 2 , or equivalently , 5 b 22 t 2 2 + 2 t ( b 21 1 ) 0 .
Clearly, this inequality required for all t implies b 21 1 . To determine the values of b 11 and b 22 , we apply the triangle inequality with x , y , z S ( x y z x ) , which gives
| x y | 2 | x y | b 11 | x z | 2 + | z y | 2 + b 12 | x z | + | z y | b 21 | x z | 2 + | z y | 2 + b 22 | x z | + | z y | .
Similar arguments as above imply that b 11 2 and b 22 1 . Thus, B B 0 as claimed.

3. Fixed Point Theorems in Vector b-Metric Spaces

In this section we establish some fixed point results in vector B-metric spaces, analogous to the well-known classical results.

3.1. Perov Type Fixed Point Theorem

Our first result is a version of Perov’s fixed point theorem (see, [27,28]) for such spaces.
Theorem 1.
Let ( X , d ) be a complete vector B-metric space, where B is either a positive or an inverse-positive matrix, and let N : X X be an operator. Assume that there exists a convergent to zero matrix A M n × n ( R + ) such that
d ( N ( x ) , N ( y ) ) A d ( x , y ) , for all x , y X ,
i.e., N is a Perov contraction mapping. Then, N has a unique fixed point.
Proof. 
Let x 0 X , and recursively define
x k = N ( x k 1 ) , for k 1 .
Since the matrix A is convergent to zero, for each α > 0 , there exists k 0 = k 0 α such that
A k 0 Λ ,
where Λ is the square matrix of size n whose entries are all equal to α . Let k , p 0 and k 0 be such that A k 0 Λ , for some α > 0 to be specified later.
Case (a): B is inverse-positive. The triangle inequality yields
B 2 d ( x k , x p ) B 1 d ( x k , x k + k 0 ) + B 1 d ( x p , x k + k 0 ) B 1 A k d ( x 0 , x k 0 ) + d ( x p , x p + k 0 ) + d ( x p + k 0 , x k + k 0 ) B 1 A k d ( x 0 , x k 0 ) + A p d ( x 0 , x k 0 ) + A k 0 d ( x k , x p ) B 1 A k d ( x 0 , x k 0 ) + A p d ( x 0 , x k 0 ) + Λ d ( x k , x p ) ,
which gives
( B 2 Λ ) d ( x k , x p ) B 1 A k d ( x 0 , x k 0 ) + A p d ( x 0 , x k 0 ) .
Given that the right-hand side of (4) is a vector that converges to zero as k , p , our goal is to show that a linear combination of the components of the vector d ( x k , x p ) is bounded above by the corresponding components of the right-hand side of (4). To this aim, we make the following notations
B 2 = ( γ i j ) 1 i , j n , B 1 A k d ( x 0 , x k 0 ) + A p d ( x 0 , x k 0 ) = φ k , p = ( φ k , p i ) 1 i n .
Hence
i = 1 n φ k , p i 0 as k , p .
Under these notations, relation (4) gives
j = 1 n ( γ i j α ) d j x k , x p φ k , p i , i = 1 , 2 , , n .
Summing in (6) over all i 1 , 2 , , n , we obtain
i , j = 1 n ( γ i j α ) d j ( x k , x p ) i = 1 n φ k , p i .
Since B 2 is invertible and positive, the sum of its elements in each column must be positive, i.e.,
i = 1 n γ i j > 0 , j = 1 , 2 , , n .
If we denote
γ = min i = 1 n γ i j : j = 1 , 2 , , n ,
relation (7) implies that
i = 1 n φ k , p i i , j = 1 n γ i j d j ( x k , x p ) n α j = 1 n d j ( x k , x p ) = j = 1 n i = 1 n γ i j d j ( x k , x p ) n α j = 1 n d j ( x k , x p ) ( γ n α ) j = 1 n d j ( x k , x p ) .
Choosing α < γ / n , one has
j = 1 n d j ( x k , x p ) 1 γ n α i = 1 n φ k , p i .
In (8), we observe that the factor 1 γ n α depends only on n and B, whence (5) yields
j = 1 n d j ( x k , x p ) 0 as k , p ,
so the sequence x k is Cauchy.
Case (b): B is positive. One has
d ( x k , x p ) B d ( x k , x k + k 0 ) + B d ( x p , x k + k 0 ) B A k d ( x 0 , x k 0 ) + B 2 d ( x p , x p + k 0 ) + B 2 d ( x p + k 0 , x k + k 0 ) B A k d ( x 0 , x k 0 ) + B 2 A p d ( x 0 , x k 0 ) + B 2 A k 0 d ( x k , x p ) B A k d ( x 0 , x k 0 ) + B 2 A p d ( x 0 , x k 0 ) + B 2 Λ d ( x k , x p ) ,
which gives
( I B 2 Λ ) d ( x k , x p ) B A k d ( x 0 , x k 0 ) + B 2 A p d ( x 0 , x k 0 ) .
Note that since Λ k = ( n α ) k 1 Λ , if α is chosen to be smaller than one divided by the greatest element of B 2 multiplied with n, the matrix B 2 Λ is convergent to zero. Consequently, I B 2 Λ is invertible and I B 2 Λ 1 M n × n R + . Hence, (9) is equivalent to
d ( x k , x p ) I B 2 Λ 1 B A k d ( x 0 , x k 0 ) + B 2 A p d ( x 0 , x k 0 ) .
As the right-hand side of (10) converges to zero when k , p , we conclude that x k is Cauchy.
Therefore, in both cases, the sequence x k is Cauchy and since X is complete, it has a limit x * , that is, d x k , x * 0 as k . Then, from
d N x k , N x * A d x k , x * ,
it follows that N x k N x * as k , while from x k + 1 = N x k , passing to the limit, one obtains x * = N x * . Hence N has a fixed point. To prove uniqueness, suppose that there exists another fixed point x * * . Then, from
d x * , x * * = d N x * , N x * * A d x * , x * * ,
recursively, we obtain that
d x * , x * * A k d x * , x * * ,
for all k 1 . Since A k 0 n as k , we deduce that d x * , x * * = 0 , i.e., x * * = x * .
If we are not interested in the uniqueness of the fixed point for N, the condition (3) can be relaxed and replaced by a weaker assumption on the graph of N.
Theorem 2.
Let ( X , d ) be a complete vector B-metric space, where B is either positive or inverse-positive, and let N : X X be an operator. Assume there exists a convergent to zero matrix A M n × n ( R + ) such that
d N ( x ) , N 2 ( x ) A d ( x , N ( x ) ) , for all x X .
Then, N has at least one fixed point.
Proof. 
Following the proof of Theorem 1, from any initial point x 0 , the sequence x k = N k x 0 is convergent to a fixed point x * of N , which clearly depends on the starting point x 0 , but condition (11) is insufficient to guarantee the uniqueness. □
The next result is a version for vector B-metric spaces of Maia’s fixed point theorem. The contraction condition on the operator is considered with respect to a vector B 1 -metric d 1 , not necessarily complete, while the convergence of the sequence of successive approximations is guaranteed in a complete vector B 2 -metric d 2 in a subordinate relationship to d 1 .
Theorem 3.
Let X be a set equipped with two R n -vector metrics, a B 1 -metric d 1 and a B 2 -metric d 2 , where B 2 is either positive or inverse-positive, and let N : X X be an operator. Assume that the following conditions hold:
(i)
( X , d 1 ) is a complete vector B 1 -metric space;
(ii)
d 1 ( x , y ) C d 2 ( x , y ) for all x , y X and some matrix C M n × n R ;
(iii)
There exists a matrix A convergent to zero such that
d 2 N ( x ) , N ( y ) A d 2 ( x , y ) , for all x , y X ;
(iv)
The operator N is continuous in X , d 1 .
Then, the operator N has a unique fixed point.
Proof. 
Let x 0 X be fixed, and consider the iterative sequence x k + 1 = N ( x k ) for k 0 . For any k , k 0 , p 0 , applying the triangle inequality twice and using condition (iii), we derive either
( B 2 2 A k 0 ) d 2 ( x k , x p ) B 2 1 A k d 2 ( x 0 , x k 0 ) + A p d 2 ( x 0 , x k 0 ) ,
in case that B 2 is inverse-positive, or
( I B 2 2 A k 0 ) d 2 ( x k , x p ) B 2 A k d 2 ( x 0 , x k 0 ) + B 2 2 A p d 2 ( x 0 , x k 0 ) ,
if B 2 is positive. Arguing similarly to the proof of Theorem 1, we deduce that ( x k ) is a Cauchy sequence in ( X , d 2 ) . From (ii), it follows immediately that ( x k ) is also a Cauchy sequence in ( X , d 1 ) , hence ( x k ) is convergent with respect the metric d 1 to some x * , that is,
d 1 ( N ( x k ) , x * ) = d 1 x k + 1 , x * 0 , as k ,
while the continuity of N yields d 1 ( N ( x * ) , x * ) = 0 , i.e., N ( x * ) = x * . To establish uniqueness, suppose that x * * is another fixed point of N , i.e., N ( x * * ) = x * * . Then, by (12), one has
( I A ) d 2 ( x * , x * * ) 0 .
Since A is convergent to zero, we necessarily have d 2 ( x * , x * * ) = 0 , i.e., x * = x * * . □

3.2. Error Estimates

The classical Banach and Perov fixed point theorems are accompanied by some error estimates in terms of the contraction constant and matrix, respectively. These estimates allow us to obtain stopping criteria for the iterative approximation process. It is the aim of this subsection to obtain such stopping criteria when working in vector B-metric spaces.
Theorem 4.
Assume that all the conditions of Theorem 1 hold and let x k be a sequence of successive approximations of the fixed point x * .
(10)
If B is inverse-positive, then
B 1 A d x k , x * A k d x 0 , x 1 k 0 .
If in addition the matrix B 1 A is inverse-positive, then
d x k , x * B 1 A 1 A k d x 0 , x 1 k 0 .
(20)
If B is positive, then
I B A d x k , x * B A k d x 0 , x 1 k 0 .
If in addition I B A is inverse-positive, then
d x k , x * I B A 1 B A k d x 0 , x 1 k 0 .
Proof. (10): We have
B 1 d x k , x * d x k , x k + 1 + d x k + 1 , x * A k d x 0 , x 1 + A d x k , x * ,
whence we deduce (13). The second part is obvious.
(20): We have
d x k , x * B d x k , x k + 1 + B d x k + 1 , x * B A k d x 0 , x 1 + B A d x k , x * ,
that is (15). The additional conclusion is obvious. □
Remark 1.
Clearly, since A k tends to the zero matrix as k , formulas (14) and (16) provide stopping criteria for the iterative fixed point approximation algorithm starting from x 0 , when an admissible error is given. It should be emphasized that these estimates are in terms of matrices A and B. In contrast, if we make the transition to (scalar) b-metric spaces, as discussed in Section 2, the resulting estimates will depend on the chosen norm in R n and may vary across different norms. So, from this point of view, the vector approach not only unifies the results that can be obtained with the scalar method, but also provides the best estimates.

3.3. Stability Results

We now present two stability properties of the Perov contraction mappings in vector B-metric spaces.
The first property is in the sense of Reich and Zaslavski and generalizes the one obtained in [19] for b-metric spaces.
Theorem 5.
Let ( X , d ) be a complete vector B-metric space, and let N : X X be an operator such that () holds with a matrix A convergent to zero. In addition assume that either
(a)
B and B 1 A are inverse-positive;
or
(b)
B is positive and I B A is inverse-positive.
Then, N is stable in the sense of Reich and Zaslavski, i.e., N has a unique fixed point x * , and for every sequence ( x k ) X satisfying
d ( x k , N ( x k ) ) 0 as k ,
one has
x k x * as k .
Proof. 
According to Theorem 1 the operator N has a unique fixed point x * . In addition, for any sequence x k satisfying (17), in case (a), we have
B 1 d ( x k , x * ) d ( x k , N ( x k ) ) + d ( N ( x k ) , x * ) = d ( x k , N ( x k ) ) + d ( N ( x k ) , N ( x * ) ) d ( x k , N ( x k ) ) + A d ( x k , x * ) ,
that is,
d ( x k , x * ) ( B 1 A ) 1 d ( x k , N ( x k ) ) ,
while in case (b),
d ( x k , x * ) I B A 1 B d ( x k , N ( x k ) ) .
These estimates immediately yield the conclusion. □
The second stability result is in the sense of Ostrowski and extends to vector B-metric spaces a similar property established in [19] for b-metric spaces.
Theorem 6.
Let ( X , d ) be a complete vector B-metric space, and let N : X X be an operator. Assume N satisfies () with a matrix A convergent to zero. In addition, assume that either
(a)
B and I b ˜ A are inverse-positive, where b ˜ = max { b i i : i = 1 , 2 , , n } ;
or
(b)
B is positive and I B A is inverse-positive.
Then, N has the Ostrowski property, i.e., N has a unique fixed point x * , and for every sequence ( x k ) X satisfying
d ( x k + 1 , N ( x k ) ) 0 as k ,
one has
x k x * as k .
Proof. 
As previously established, the operator N has a unique fixed point x * . In case (a), we have
d ( x k + 1 , x * ) b ˜ d ( x k + 1 , N ( x k ) ) + b ˜ d ( N ( x k ) , N ( x * ) ) b ˜ d ( x k + 1 , N ( x k ) ) + b ˜ A d ( x k , x * ) b ˜ p = 0 k ( b ˜ A ) p d ( x k + 1 p , N ( x k p ) ) + ( b ˜ A ) k + 1 d ( x 0 , x * ) ,
while in case (b), similar estimation gives
d ( x k + 1 , x * ) p = 0 k ( B A ) p B d ( x k + 1 p , N ( x k p ) ) + ( B A ) k B d ( x 0 , x * ) .
Since I b ˜ A is inverse-positive and b ˜ A is positive in the first case, and I B A is inverse-positive and B A is positive in the second case, the series p = 0 k ( b ˜ A ) p and p = 0 k ( B A ) p are convergent. Moreover, ( b ˜ A ) k and ( B A ) k converge to the zero matrix as k . Therefore, using the Cauchy-Toeplitz lemma (see [29]), it follows that d ( x k + 1 , x * ) 0 as k .

3.4. Avramescu Type Fixed Point Theorem

Our next result is a variant of Avramescu’s fixed point theorem (see [30]) in vector B-metric spaces.
Theorem 7.
(Avramescu theorem in vector B-metric spaces). Let ( X , d ) be a complete vector B-metric space, D a nonempty closed convex subset of a normed space Y , N 1 : X × D X and N 2 : X × D D be two mappings. Assume that the following conditions are satisfied:
(i)
N 1 x , . is continuous for every x X and there is a matrix A convergent to zero such that
d ( N 1 ( x , y ) , N 1 ( x ¯ , y ) ) A d ( x , x ¯ ) ,
for all x , x ¯ X and y D ;
(ii)
Either
(a)
B and B 1 A is inverse-positive;
or
(b)
B is positive and I B A is inverse-positive.
(iii)
N 2 is continuous and N 2 ( X × D ) is a relatively compact subset of Y .
Then, there exists ( x * , y * ) X × D such that
N 1 ( x * , y * ) = x * , N 2 ( x * , y * ) = y * .
Proof. 
For each y D , Theorem 1 applies to the operator N 1 . , y and gives a unique S ( y ) X such that
N 1 ( S ( y ) , y ) = S ( y ) .
We claim that the mapping S : D X is continuous. To prove this, let y , y ¯ D . In case (a), we have
B 1 d ( S ( y ) , S ( y ¯ ) ) = B 1 d N 1 S ( y ) , y , N 1 S ( y ¯ ) , y ¯ d N 1 S ( y ) , y , N 1 S ( y ¯ ) , y + d N 1 S ( y ¯ ) , y , N 1 S ( y ¯ ) , y ¯ A d S ( y ) , S ( y ¯ ) + d N 1 S ( y ¯ ) , y , N 1 S ( y ¯ ) , y ¯ ,
which implies
B 1 A d ( S ( y ) , S ( y ¯ ) ) d N 1 S ( y ¯ ) , y , N 1 S ( y ¯ ) , y ¯ ,
while in case (b), one has
I B A d ( S ( y ) , S ( y ¯ ) ) B d N 1 S ( y ¯ ) , y , N 1 S ( y ¯ ) , y ¯ .
Since B 1 A and I B A are inverse-positive, respectively, in case (a), we deduce that
d ( S ( y ) , S ( y ¯ ) ) B 1 A 1 d N 1 S ( y ¯ ) , y , N 1 S ( y ¯ ) , y ¯ ,
and in case (b),
d ( S ( y ) , S ( y ¯ ) ) I B A 1 B d N 1 S ( y ¯ ) , y , N 1 S ( y ¯ ) , y ¯ .
Then, for any convergent sequence y k D , y k y * as k , the continuity of N 1 S y * , . together with relations (19) and (20) implies that d ( S ( y k ) , S ( y * ) ) 0 as k . Thus, S is continuous, and since N 2 is continuous, the composed mapping
N 2 ( S ( . ) , . ) : D D
is continuous too. Since its range is relatively compact by condition (iii), Schauder’s fixed point theorem applies and guarantees the existence of a point y * D such that
N 2 S ( y * ) , y * = y * .
Finally, denoting x * : = S ( y * ) , from (18) and (21) we have the conclusion. □
Remark 2.
Without the invariance condition N 2 X × D D , a similar result holds if D is a closed ball B R centered at the origin and of radius R in the space Y , . , provided that Schaefer’s fixed point theorem is used instead of Schauder’s theorem. In this case, in addition to conditions (i) and (ii), we need the Leray-Schauder condition
y λ N 2 x , y ,
for all x X , y Y with y = R , and λ 0 , 1 .
In particular, for scalar b-metric spaces, conditions (a) and (b) from hypothesis (ii) of Theorem 7 are the same and reduce to the unique requirement that the product of b and the Lipschitz constant a of N is less than one. More exactly, Theorem 7 reads as follows.
Theorem 8.
(Avramescu theorem in b-metric spaces). Let ( X , ρ ) be a complete b-metric space b 1 , D a nonempty closed convex subset of a normed space Y , N 1 : X × D X and N 2 : X × D D be two mappings. Assume that the following conditions are satisfied:
(i)
N 1 x , . is continuous for every x X and there is a constant a 0 such that
ρ ( N 1 ( x , y ) , N 2 ( x ¯ , y ) ) a ρ ( x , x ¯ ) ,
for all x , x ¯ X and y D ;
(ii)
a b < 1 ;
(iii)
N 2 is continuous and N 2 ( X × D ) is a relatively compact subset of Y .
Then, there exists ( x * , y * ) X × D such that N 1 ( x * , y * ) = x * and N 2 ( x * , y * ) = y * .

4. Ekeland’s Principle and Caristi’s Fixed Point Theorem in Vector b-Metric Spaces

4.1. Classical Results

We first recall for comparison the classical results in metric spaces (see, [31,32,33,34]).
Theorem 9.
(Weak Ekeland variational principle). Let X , ρ be a complete metric space and let f : X R be a lower semicontinuous function bounded from below. Then, for given ε > 0 and x 0 X , there exists a point x * X such that
f x * f x 0 ε ρ x * , x 0
and
f x * < f x + ε ρ x * , x for all x X , x x * .
Theorem 10.
(Strong Ekeland variational principle). Let ( X , ρ ) be a complete metric space, and let f : X R be a lower semicontinuous function that is bounded from below. For given ε > 0 , δ > 0 , and x 0 X satisfying
f ( x 0 ) inf x X f ( x ) + ε ,
there exists a point x * X such that the following hold:
f ( x * ) f ( x 0 ) , ρ ( x * , x 0 ) δ , f ( x * ) < f ( x ) + ε δ ρ ( x * , x ) for all x X , x x * .
Below, we have a version of Ekeland’s variational principle for scalar b-metric spaces (see, [20]).
Theorem 11.
([20]). Let ( X , ρ ) be a complete b-metric space with b > 1 , where the b-metric ρ is continuous. Let f : X R be a lower semicontinuous function bounded from below. For a given ε > 0 and x 0 X satisfying
f ( x 0 ) inf x X f ( x ) + ε ,
there exists a sequence ( x k ) X and a point x * X such that:
x k x * as k , ρ ( x * , x k ) ε 2 k , k N , f ( x * ) f ( x 0 ) k = 0 1 b k ρ ( x * , x k ) , f ( x * ) + k = 0 1 b k ρ ( x * , x k ) < f ( x ) + k = 0 1 b k ρ ( x , x k ) , for x x * .
The proof of Theorem 11 in [20] is based on the version for scalar b-metric spaces of Cantor’s intersection lemma.
Lemma 1.
([20]). Let X , ρ be a complete b-metric space. For every descending sequence F k k 1 of nonempty closed subsets of X with diamρ F k 0 as k , the intersection k = 1 F k contains one and only one element.
Let us first note that a version of Cantor’s intersection lemma remains true in complete vector B-metric spaces.
Lemma 2.
Let X , d be a complete vector B-metric space, and let F k k 1 be a descending sequence of nonempty closed subsets of X. Assume that for every ε > 0 , there exists k 0 1 such that
d ( x , y ) ε e for all x , y F k and k k 0 ,
where e = ( 1 , 1 , , 1 ) . Then, the intersection k = 1 F k contains exactly one element.
Proof. 
As stated in the Preliminaries, condition (22) implies that the diameter of F k with respect to the scalar b-metric ρ 1 tends to zero. Since ( X , d ) is complete, it follows that ( X , ρ 1 ) is also complete. From Cantor’s lemma in scalar b-metric spaces (Lemma 1), we conclude that the intersection k = 1 F k has exactly one element. □

4.2. Ekeland Variational Principle In Vector B-metric Spaces

First we state and prove a version of the weak form of Ekeland’s variational principle in vector B-metric spaces.
Theorem 12.
(Weak Ekeland variational principle in vector B-metric spaces). Let X , d be a complete vector B-metric space such that the B-metric d is continuous, and let f : X R n be a lower semicontinuous function bounded from below. Assume that f satisfies the following condition:
(H)
For every nonempty closed subset F X and every ε > 0 , there exists a point x ε , F F such that
f ( x ε , F ) f ( x ) + ε e , for all x F ,
where e = ( 1 , 1 , , 1 ) R n .
Then, for a given x 0 X , there exists a sequence { x k } X and a point x * X such that x k x * as k ,
f ( x * ) f ( x 0 ) d ( x * , x 0 ) ,
and
f ( x * ) + d ( x * , x k ) f ( x ) + d ( x , x k ) for all k 0 implies x = x * .
Moreover,
f ( x * ) f ( x ) + B d ( x * , x ) + ( B I ) d ( x * , x k ) for all k 0 implies x = x * .
Proof. 
Let us fix a sequence ε k of positive numbers satisfying ε k 0 as k . We now proceed to construct the sequence x k . Let
F x 0 : = x X : f x + d x , x 0 f x 0 .
Clearly, x 0 F x 0 and F x 0 is closed because d is continuous and f is lower semicontinuous. Then, by assumption (23), there exists a point x 1 F x 0 with
f x 1 f x + ε 1 e for all x F x 0 .
Define
F x 1 : = x F x 0 : f x + d x , x 1 f x 1 ,
and recursively, having x k F x k 1 with
f x k f x + ε k e for all x F x k 1 ,
we define
F x k : = x F x k 1 : f x + d x , x k f x k .
The sets F x k are nonempty and closed, and by their definition form a descending sequence. To apply Cantor’s intersection lemma, we verify that their diameters tend to zero as k . Indeed, for any y F x k F x k 1 , one has
f y + d y , x k f x k .
Also, from the definition of x k ,
f x k f y + ε k e .
Consequently, using the definition of F ( x k ) , we deduce
d y , x k f x k f y ε k e ,
whence, for every y 1 , y 2 F x k , we have
d y 1 , y 2 B d y 1 , x k + d y 2 , x k .
As a result, diamd F x k 0 as k . Thus, by Cantor’s lemma,
k = 0 F x k = x * .
From x * F x 0 , one has (24).
Next, we prove (25). To this end, we show the equivalent statement: if x x * , then there exists k = k x 0 such that
f x * + d x * , x k f x + d x , x k ,
that is
f i x * + d i x * , x k < f i x + d i x , x k
for at least one index i 1 , 2 , . . . , n .
Let x X , x x * be arbitrary. Then x k = 0 F x k . We distinguish two cases:
( a ) x F x 0 ; ( b ) x F x k 1 and x F x k for some k = k x 1 .
In case (a), we have f x + d x , x 0 f x 0 . In case (b), we have f x + d x , x k f x k . Thus, in both cases, there exists k = k x 0 such that f x + d x , x k f x k . This implies that there is some i 1 , 2 , . . . , n with
f i x + d i x , x k > f i x k .
On the other hand, since x * F x k , one has f x * + d x * , x k f x k . In particular, for the index i identified above, it holds that
f i ( x k ) f i ( x * ) + d i ( x * , x k ) .
Then, from these two ineqialities we obtain
f i x * + d i x * , x k < f i x + d i x , x k ,
which equivalently proves (25).
In order to establish (26), we apply the triangle inequality for d on the right hand side of (27), which gives,
f i x * + d i x * , x k < f i x + d i x , x k f i x + B d x * , x k i + B d x * , x i .
Hence
f i x * + d i x * , x k < f i x + B d x * , x k i + B d x * , x i ,
that is,
f x * f x + B d x * , x + B I d x * , x k .
Thus, (26) holds. □
A version of the strong form of Ekeland’s variational principle in vector B-metric spaces is the following one.
Theorem 13.
(Strong Ekeland variational principle in vector B-metric spaces). Let X , d be a complete B-metric space such that the B-metric d is continuous, and let f : X R n be a lower semicontinuous function bounded from below and satisfying condition (H). Then, for given ε , δ > 0 and x 0 X with
f x 0 f x + ε e for all x X ,
there exists a sequence x k X and x * X such that x k x * as k ,
f x * f x 0 ,
d x * , x 0 δ e ,
f x * + ε δ d x * , x k f x + ε δ d x , x k for all k 0 implies x = x * .
Moreover,
f x * f x + ε δ B d x * , x + ε δ B I d x * , x k for all k 0 implies x = x * .
Proof. 
We apply the weak form of Ekeland’s variational principle, Theorem 12, to the vector B-metric ε δ d . From (24), we immediately obtain (29), while from x * F x 0 and (28), we deduce
ε δ d x * , x 0 f x 0 f x * ε e ,
whence (30). The remaining conclusions follow directly. □
A consequence of the weak form of Ekeland’s variational principle is the following version of Caristi’s fixed point theorem (see [35]) in vector B-metric spaces.
Theorem 14..
Let X , d be a complete vector B-metric space such that the B-metric d is continuous, and let f : X R n be a lower semicontinuous function bounded from below and satisfying condition (H). Assume that for an operator N : X X , the following conditions are satisfied:
d N x , y d x , y + B d N x , x , x , y X
and
B d N x , x f x f N x , x X .
Then, N has at least one fixed point.
Proof. 
Assume that N has no fixed points. Then, applying Ekeland’s variational principle to f (Theorem 12), from (25), one has
f x * + d x * , x k f N x * + d N x * , x k
for some k . Therefore, there is an index i with
f i x * + d i x * , x k < f i N x * + d i N x * , x k .
Using (32) gives
B d N x * , x * i f i x * f i N x * < d i N x * , x k d i x * , x k ,
that is
d i x * , x k + B d N x * , x * i < d i N x * , x k ,
which contradicts (31). Consequently, N has a fixed point. □

4.3. New Versions Of The Ekeland Variational Principle In b-Metric Spaces

We emphasize that in the scalar case, that is, when n = 1 , B = b 1 and d = ρ is a b-metric, our theorems from the previous subsection offer more natural versions in b-metric spaces to the classical results, as follows.
Theorem 15.
(Weak Ekeland variational principle in b-metric spaces). Let X , ρ be a complete b-metric space ( b 1 ) such that the b-metric ρ is continuous, and let f : X R be a lower semicontinuous function bounded from below. Then, for given x 0 X , there exists a sequence x k X and x * X such that x k x * as k ,
f x * f x 0 ρ x * , x 0 ,
and for each x X , x x * , there exists an index k = k x with
f x * + ρ x * , x k < f x + ρ x , x k .
Moreover, for each x X , x x * , there exists an index k = k x with
f x * < f x + b ρ x * , x + b 1 ρ x * , x k .
Theorem 16.
(Strong Ekeland variational principle in b-metric spaces). Let X , ρ be a complete b-metric space ( b 1 ) such that the b-metric ρ is continuous, and let f : X R be a lower semicontinuous function bounded from below. Then, for given ε , δ > 0 and x 0 X with
f x 0 inf x X f x + ε ,
there exists a sequence x k X and x * X such that x k x * as k ,
f x * f x 0 ,
ρ x * , x 0 δ ,
and for each x X , x x * , there exists an index k = k x with
f x * + ε δ ρ x * , x k < f x + ε δ ρ x , x k .
Moreover, for each x X , x x * , there exists an index k = k x with
f x * < f x + b ε δ ρ x * , x + b 1 ε δ ρ x * , x k .
Theorem 17.
(Caristi fixed point theorem in b-metric spaces). Let X , ρ be a complete b-metric space ( b 1 ) such that the b-metric ρ is continuous, and let f : X R be a lower semicontinuous function bounded from below. If for an operator N : X X , one has
ρ N x , y ρ x , y + b ρ N x , x , x , y X
and
b ρ N x , x f x f N x , x X ,
then N has at least one fixed point.
The last three results reduce to the classical ones in ordinary metric spaces, i.e., if b = 1 . Thus, (33) reduces to
f x * < f x + ρ x * , x , x x * ;
(34) reduces to
f x * < f x + ε δ ρ x * , x , x x * ;
assumption (35) trivially holds, while (36) becomes the classical Caristi’s inequality
ρ N x , x f x f N x , x X .

5. Conclusion and Further Research

In this paper, we introduced the concept of a vector B-metric space. Several fixed-point theorems, analogous to those in scalar b-metric spaces as well as their classical counterparts, were presented. Additionally, we discussed some stability results. Finally, we provided a variant of Ekeland’s variational principle alongside a version of Caristi’s theorem. It remains an open question whether the assumption that B 1 A or I B A is inverse-positive can be omitted in Theorems 7, 5 and 6. Additionally, one may explore a variant of Ekeland’s variational principle where Caristi’s theorem holds without requiring the additional assumption (31). Lastly, it would be interesting to study the case where the matrix B is neither positive nor inverse-positive; for instance, when it has positive diagonal elements but contains both positive and negative entries elsewhere.

Acknowledgments

The authors wish to mention that the notion of a vector B-metric space was suggested by Professor Ioan A. Rus in the Seminar of Nonlinear Operators and Differential Equations at Babeş-Bolyai University.

Conflicts of Interest

The authors declare that they have no conflicts of interest.

References

  1. Wilson, W. A. On Quasi-Metric Spaces. Amer. J. Math. 1931, 675–684. [Google Scholar] [CrossRef]
  2. Bourbaki, N. Topologie Generale; Herman: Paris, France, 1974. [Google Scholar]
  3. Bakhtin, I.A. Contracting mapping principle in an almost metric space. Funktsionalnyi Analiz 1989, 30, 26–37. [Google Scholar]
  4. Czerwik, S. Contraction mappings in b-metric spaces. Acta Math. Inform. Univ. Ostrav. 1993, 1, 5–11. [Google Scholar]
  5. Coifman, R.R.; de Guzman, M. Singular integrals and multipliers on homogeneous spaces. Rev. Un. Mat. Argentina 1970/71, 25, 137–143. [Google Scholar]
  6. Hyers, D.H. A note on linear topological spaces. Bull. Amer. Math. Soc. 1938, 44, 76–80. [Google Scholar] [CrossRef]
  7. Bourgin, D.G. Linear topological spaces. Amer. J. Math. 1943, 65, 637–659. [Google Scholar] [CrossRef]
  8. Berinde, V.; Păcurar, M. The early developments in fixed point theory on b-metric spaces: A brief survey and some important related aspects. Carpathian J. Math. 2022, 38, 523–538. [Google Scholar] [CrossRef]
  9. An, T.V.; Van Dung, N.; Kadelburg, Z.; Radenović, S. Various generalizations of metric spaces and fixed point theorems. RACSAM 2013, 109, 175–198 Generalized distancesandtheirassociatemetrics:Impactonfixedpointtheory. Creat.Math.Inform. 2013, 22(1), 23–32. [Google Scholar] [CrossRef]
  10. Mitrović, Z.D. Fixed point results in b-metric spaces. Fixed Point Theory 2019, 20, 559–566. [Google Scholar] [CrossRef]
  11. Boriceanu, M.; Petruşel, A.; Rus, I.A. Fixed point theorems for some multivalued generalized contractions in b-metric spaces. Int. J. Math. Stat. 2010, 6, 65–76. [Google Scholar]
  12. Aydi, H.; Czerwik, S. Modern Discrete Mathematics and Analysis; Springer: Cham, Switzerland, 2018. [Google Scholar]
  13. Kirk, W.; Shahzad, N. Fixed Point Theory in Distance Spaces; Springer: Cham, Switzerland, 2014. [Google Scholar]
  14. Reich, S.; Zaslavski, A.J. Well-posedness of fixed point problems. Far East J. Math. Sci. 2001, Special Volume (Functional Analysis and its Applications), Part III, 393–401. [Google Scholar] [CrossRef]
  15. Berinde, V. Generalized contractions in quasimetric spaces. Seminar on Fixed Point Theory Preprint no. 3. 1993, 3–9. [Google Scholar]
  16. Miculescu, R.; Mihail, A. New fixed point theorems for set-valued contractions in b-metric spaces. J. Fixed Point Theory Appl. 2017, 19, 2153–2163. [Google Scholar] [CrossRef]
  17. Suzuki, T. Basic inequality on a b-metric space and its applications. J. Inequal. Appl. 2017, 2017, 256. [Google Scholar] [CrossRef]
  18. Bota, M.-F.; Micula, S. Ulam–Hyers stability via fixed point results for special contractions in b-metric spaces. Symmetry 2022, 14, 2461. [Google Scholar] [CrossRef]
  19. Petrușel, A.; Petrușel, G. Graphical contractions and common fixed points in b-metric spaces. Arab. J. Math. 2023, 12, 423–430. [Google Scholar] [CrossRef]
  20. Bota, M.; Molnar, A.; Varga, C. On Ekeland’s variational principle in b-metric spaces. Fixed Point Theory 2011, 12, 21–28. [Google Scholar]
  21. Farkas, C.; Molnár, A.; Nagy, S. A generalized variational principle in b-metric spaces. Le Matematiche 2014, 69, 205–221. [Google Scholar]
  22. Boriceanu, M. Fixed point theory on spaces with vector-valued b-metrics. Demonstr. Math. 2009, 42, 831–841. [Google Scholar]
  23. Precup, R. The role of matrices that are convergent to zero in the study of semilinear operator systems. Math. Comput. Model. 2009, 49, 703–708. [Google Scholar] [CrossRef]
  24. Berman, A.; Plemmons, R.J. Nonnegative matrices in the mathematical sciences; Academic Press: New York, USA, 1997. [Google Scholar]
  25. Collatz, L. Aufgaben monotoner Art. Arch. Math. (Basel) 1952, 3, 366–376. [Google Scholar] [CrossRef]
  26. Cobzaș, Ș.; Czerwik, S. The completion of generalized b-metric spaces and fixed points. Fixed Point Theory 2020, 21, 133–150. [Google Scholar] [CrossRef]
  27. Perov, A.I. On the Cauchy problem for a system of ordinary differential equations (Russian). Priblizhen. Metody Reshen. Differ. Uravn. 1964, 2, 115–134. [Google Scholar]
  28. Perov, A.I. Generalized principle of contraction mappings (Russian). Vestn. Voronezh. Gos. Univ., Ser. Fiz. Mat. 2005, 1, 196–207. [Google Scholar]
  29. Ortega, J.M.; Rheinboldt, W.C. Iterative Solutions of Nonlinear Equations in Several Variables; Academic Press: New York, USA, 1970. [Google Scholar]
  30. Avramescu, C. Asupra unei teoreme de punct fix. St. Cerc. Mat. 1970, 22, 215–221. [Google Scholar]
  31. Ekeland, I. On the variational principle. J. Math. Anal. Appl. 1974, 47, 324–353. [Google Scholar] [CrossRef]
  32. Mawhin, J.; Willem, M. Critical Point Theory And Hamiltonian Systems; Applied Mathematical Sciences; Springer: New York, USA, 1989. [Google Scholar]
  33. De Figueiredo, D.G. Lectures on the Ekeland Variational Principle with Applications and Detours; Tata Institute of Fundamental Research: Bombay, India, 1989. [Google Scholar]
  34. Meghea, I. Ekeland Variational Principle with Generalizations and Variants; Old City Publishing: Philadelphia, USA, 2009. [Google Scholar]
  35. Caristi, J. Fixed point theorems for mappings satisfying inwardness conditions. Trans. Amer. Math. Soc. 1976, 215, 241–251. [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.
Copyright: This open access article is published under a Creative Commons CC BY 4.0 license, which permit the free download, distribution, and reuse, provided that the author and preprint are cited in any reuse.
Prerpints.org logo

Preprints.org is a free preprint server supported by MDPI in Basel, Switzerland.

Subscribe

Disclaimer

Terms of Use

Privacy Policy

Privacy Settings

© 2025 MDPI (Basel, Switzerland) unless otherwise stated