The Convex (δ, L) Weak Contraction Mapping Theorem and its Non Self Counterpart in Graphic Language

  • Clement Boateng Ampadu 31 Carrolton Road, Boston, MA 02132-6303, USA
Keywords: (δ, L) weak contraction, convex contraction, non-self map, graph, fixed point theorem, best proximity point theorem

Abstract

Let 16.jpg be a metric space. A map 21.jpg is said to be a 31.jpg weak contraction [1] if there exists 41.jpg and 51.jpg such that the following inequality holds for all 61.jpg

71.jpg

On the other hand, the idea of convex contractions appeared in [2] and [3]. In the first part of this paper, motivated by [1]-[3], we introduce a concept of convex 32.jpg weak contraction, and obtain a fixed point theorem associated with this mapping. In the second part of this paper, we consider the map is a non-self map, and obtain a best proximity point theorem. Finally, we leave the reader with some open problems.

Published
2019-02-26
How to Cite
Ampadu, C. B. (2019). The Convex (δ, L) Weak Contraction Mapping Theorem and its Non Self Counterpart in Graphic Language . Earthline Journal of Mathematical Sciences, 1(2), 157-169. https://doi.org/10.34198/ejms.1219.157169
Section
Articles

Most read articles by the same author(s)

1 2 3 > >>