#### Abstract

We consider the problem of best proximity point in locally convex spaces endowed with a weakly convex digraph. For that, we introduce the notions of nonself -contraction and -nonexpansive mappings, and we show that for each seminorm, we have a best proximity point. In addition, we conclude our work with a result showing the existence of best proximity point for every seminorm.

#### 1. Introduction

Fixed point theorems deal with conditions under which maps (single or multivalued) have invariant points. The theory itself is a beautiful mixture of analysis (pure and applied), topology, and geometry. Over the last 50 years or so, the theory of fixed point has been revealed as a very powerful and important tool in the study of nonlinear phenomena. In particular, fixed point techniques have been applied in such diverse fields as biology, chemistry, economics, engineering, game theory, and physics. If the fixed point equation of given mapping does not have a solution, then it is of interest to find an approximate solution for the fixed point equation. In other words, we are searching for an element in the domain of the mapping, whose image is as close to it as possible. This situation motivates the researchers to develop the notion of best proximity point theory. It is worth to note that the best proximity point theorems can be viewed as a generalization of fixed point theorems, since most fixed point theorems can be derived as corollaries of best proximity point results (for more details, see [1–6]).

Fan in [7] gave a common generalization of both theorems of Kakutani and Tychonoff. He proved under compactness of the domain in a locally convex space that every upper semicontinuous set valued mapping has a fixed point in the sense that there is an element which belongs to his image.

In [8] Ling established some properties relating the concepts of normal structure and submeans in a Hausdorff locally convex space and obtained a fixed point theorem for left reversible semigroups of nonexpansive mapping with a compactness of the domain. This extends a result obtained by Lau and Takahashi in Banach space [9] (generalization of Lim’s fixed point) and shows that Lau and Takahashi’s result remains valid in the more general setting of a locally convex space.

Vuong in [10] established a fixed point theorem for nonexpansive mappings in a locally convex space with normal structure and the compactness of the domain.

In this paper, we define the concept of nonself -contraction mappings in locally convex spaces endowed with a digraph . Then, we obtain sufficient conditions for the existence of a best proximity point for such mappings when both the domain and the range satisfy the -property condition. In addition, we discuss some existence results for nonself -nonexpansive mappings.

#### 2. Preliminaries

To start this work, we discuss some of the basic notations and terminologies which we will be using later. Let be a Hausdorff locally convex space and be a family of continuous seminorms which generates the topology of . Let be two subsets of and .

Recall that a mapping is said to be contraction if there is for any :and is said to be nonexpansive if for any ,

Recall that a pair satisfies a property if both and has that property. For example, and .

Let be a pair of sets in a Hausdorff locally convex space . Define

Clearly, we have

A directed graph or digraph is determined by a nonempty set of its vertices and the set of its directed edges. A digraph is reflexive if each vertex has a loop. For more details, one can consult the book [11].

*Definition 1. *Given a digraph . If whenever , then the digraph is called an oriented graph. A digraph *G* is transitive whenever , for any . A dipath of is a sequence , ,…, , …with for each . A finite dipath of length from *x* to *y* is a sequence of vertices with and , . is the set of all vertices which are contained in some path beginning at (i.e., ). A digraph is weakly convex if and only if for any , and in ,We haveThe letter denotes the undirected graph obtained from by ignoring the direction of edges.

Let be a pair such that is nonempty.

*Definition 2. *Let be a locally convex space endowed with a digraph and . A mapping is said to be -contraction mapping if there exists for any such that :(a).(b),

*Definition 3. *Let be a locally convex space endowed with a digraph and . A mapping is said to be -nonexpansive mapping if for any such that :(a).(b),

*Definition 4. *Let be a pair of sets in a Hausdorff locally convex space Define . Then, the pair is said to have the property if and only if.

*Definition 5. *We will say that a nonempty subset of is(1)compact if and only if for every net in such that , there is a subnet which is converging to a point and (2)Sequentially compact if and only if for every sequence in such that , there exists a subsequence of which is converging to a point in and .

#### 3. Main Results

The proof of the next result follows the same pattern of ([12], Theorem 3.2). For the sake of completeness, we give the proof.

Theorem 1. *Let be a locally convex space endowed with a reflexive digraph . Let be a nonempty pair in such that has the -property and is convex complete. Let be a -contraction mapping such that . Assume that*(i)*There exist and in such that and .*(ii)*For any sequence in with and .**Then, there exist such that .*

*Proof. *Let . By (i), there exist two points such that andand a finite sequence of such that and for all .

As and , there exist such thatand since and , by the condition (b) of Definition 2, we getSimilarly, for , there exist such thatfor all .

Now, let . Thus, the finite sequence is a path from to .

Again, since and for each , there exist such thatfor all . Also, we haveContinuing in this manner for all , we obtain a sequence whereProduce a path from to (see Figure 1 for illustration) in such a way thatUsing the -property of and equation (18) for any , we haveNow, for each ,Since for all and , and is a -contraction, it follows that for any ,for some . Repeating the process, it follows that for all ,where . Hence, is a Cauchy sequence. So, . By condition (ii), we get for any . Hence,i.e.,where by continuity of , we getSince , we obtain

Theorem 2. *Let be a locally convex space endowed with a weakly convex and reflexive digraph . Let be a nonempty pair that has the -property in . Let be a -nonexpansive mapping such that is convex complete and . Assume that*(i)*There exist and in such that and .*(ii)*For any sequence in with and , .**Then,*

*Proof. *. Let and define by is -contraction. By Theorem 1, there exists a best proximity point of , i.e.,Hence,Then, we haveSet for each . Hence by equation (31), we getfor all . Thus,

Theorem 3. *Let be a locally convex space endowed with a weakly convex and reflexive digraph . Let be a nonempty pair with the -property in . Let be a -nonexpansive mapping such that is convex complete and sequentially -compact and . Assume that*(i)*There exist and in such that and .* *(ii) For any sequence in with and , .**Then, has a best proximity point in the sense that*

*Proof. *Let and . SetSince is convex and , we get , and since , there exists such thatAs is -contraction, by Theorem 1, has a best point proximity such thatAgain, let with . Set . We haveSo, there exists such thatand by the above construction, we also have . That is,Since is -nonexpansive and is weakly reflexive convex graph, we obtainand as is -contraction, then has a best proximity point that satisfiesContinuing in this manner we construct a sequence of mappings satisfying for all where is a nondecreasing sequence of .

Note that is a -contraction with as its best proximity point. Since for any and is -compact, there exists a subsequence witch converges to in and satisfiesfor any . is -nonexpansive mapping; thus,i.e.,The above yields toand sincefor any , we get

*Example 1. *Let be the space of continuous real functions, i.e.,Let be the family of seminorms generated the topology of such that for every and , a compact of , we haveLetThen, is convex. Moreover, we haveThus,So, has the -property.

Let . We define a digraph on as follows:Then, is weakly convex and reflexive digraph. Obviously, is sequentially -compact. Since , assumption (i) of Theorem 3 holds.

Now, let be the mapping defined by is -nonexpansive since we haveSo, is -nonexpansive and . Then, there exists such thatIndeed the only such point is .

If the digraph is partial order, we get the following interesting consequence.

Corollary 1. *Let be a locally convex space endowed with a partial order . Let be a nonempty pair with the -property in . Let be a -nonexpansive mapping such that is convex complete and sequentially -compact and . Assume that*(i)*There exist and in such that and .*(ii)*For any sequence in with and , we have .**Then, has a best proximity point in the sense that*

*Example 3.6. *Let be the space of real sequences, i.e.,Let be the family of seminorms generated the topology of such that for every ,Suppose that is the canonical basis of and letThen, is weakly compact subset of since it is convex bounded and closed. Moreover, as for each , we have ; thus, for all , we haveThus,So, has -property.

Let . We define a partial order on as follows:where for .

is obviously sequentially -compact.

Now, let be the mapping defined byfor each . is -nonexpansive since for every , we haveSo, is -nonexpansive and . Then, there exists such thatIndeed the only such point is .

In order to get a common best proximity point with respect to every seminorm , we have the next result.

Theorem 4. *Let be a locally convex space endowed with a digraph which is weakly convex and reflexive. Let be a nonempty pair with the -property in . Let be a -nonexpansive mapping such that is convex complete and -compact and . Assume that*(i)*There exist and in such that and for all .*(ii)*For any two elements in , there is a finite path between them.*(iii)*For any net in A with and .**Then, has a best proximity point in the sense that there is such that*

*Proof. *Let . By Theorem 3, there exist such thatApplying (ii) and the fact that is -compact, the net has a converging subnet which is converging to with for any . Moreover, we have for all ,for all . The proof is completed.

#### Data Availability

No data were used to support this study.

#### Conflicts of Interest

The authors declare that there are no conflicts of interest regarding the publication of this paper.