Load forecasting of microgrid based on an adaptive cuckoo search optimization improved neural network

1.   Introduction

The first significant result in metric fixed point theory about contractive mappings, the Banach contraction principle (BCP) was established by S. Banach ^[1] in 1922. Due to its simplicity, this theorem vest as a conventional research tool in many different fields of mathematics. Then, several researchers proposed various types of fixed point theorems concerning different kinds of contractive mappings, see ^[2,3,4] and references therein. In 1968, R. Kannan ^[5] introduced the concept of K-contractions, and then in 1972, S. K Chatterjea ^[6] initiated the idea of C-contractions.

Definition 1.1. ^[5,6] Let $(X, d)$ be a metric space and $f$ a self-mapping on $X$. Then,

(i) A mapping $f$ is said to be K-contraction if there exists $\beta \in [0, \frac{1}{2})$ such that

(ii) A mapping $f$ is said to be C-contraction if there exists $\beta \in [0, \frac{1}{2})$ such that

Kannan ^[5] proved that every K-contraction mapping in a complete metric space has a unique fixed point. Chatterjea ^[6] proved a similar fixed theorem using C-contraction mappings.

Further, generalizations of C-contraction and K-contraction mappings were introduced by B. S. Choudhury ^[7] and Razani and Parvaneh ^[8] respectively as follows:

Definition 1.2. ^[7,8] Let $(X, d)$ be a metric space, $f: X \rightarrow X$ a self-mapping and $\phi: [0, \infty)^{2}\rightarrow [0, \infty)$ a continuous mapping with $\phi(x, y) = 0$ if and only if $x = y = 0$. Then,

(i) $f$ is said to be a weak C-contraction if

(ii) $f$ is said to be a weak K-contraction if

In 2009, Choudhury ^[7] established a fixed point theorem using weak C-contraction as follows:

Theorem 1.3. ^[7] Every weak C-contraction in a complete metric space has a unique fixed point.

On the other hand, in 2015, Alam and Imdad ^[9] established another generalization of the classical Banach contraction principle using an amorphous (arbitrary) binary relation. In this context, many relation-theoretic variants of existing fixed point results have been reported for both linear and nonlinear contractions, see ^[10,11,12] and references therein. For nonlinear contractions, the underlying binary relation should be transitive. To make the transitivity condition weaker, Alam and Imdad ^[13] introduced the concept of locally $f$-transitivity.

Fixed point theory is used as a requisite tool in investigating the existence and uniqueness of solutions of differential and integral equations, see ^[14,15,16] and references therein. Also, the fixed point theorems for contractive mappings are used in economics, game theory, and many branches of mathematics. For instance, consider the following integral equation

where $g: [0, 1] \rightarrow \mathbb{R},$ $k: [0, 1] \times [0, 1] \rightarrow [0, \infty)$ and $u : [0, 1] \times \mathbb{R} \rightarrow \mathbb{R}$ are three continuous functions. The Eq (1.1) can be studied by means of fixed point theory in view of the fact that $f(x)$ is a solution of (1.1) if and only if $f(x)$ is a fixed point of $T$ where $T$ is defined by

This paper aims to establish some coincidence point theorems for weak C-contraction and K-contraction mappings involving a new auxiliary function in a metric space endowed with a locally $f$-transitive binary relation. We also deduce related fixed point theorems. As a consequence, these results improve and sharpen some existing fixed point results. Further, we give an example that shows the effectiveness of our results.

2.   Preliminaries

In this section, we recall some basic definitions which will be required in proving our main results. We denote $\mathbb{N}$ $\cup$ $\{0\}$ as $\mathbb{N}_{0}$ throughout the paper.

Definition 2.1. ^[17,18] Let $X$ be a nonempty set and $(f, g)$ be a pair of self-mappings on $X$. Then

(i) an element $x\in X$ is called a coincidence point of $f$ and $g$ if

(ii) if $x\in X$ is a coincidence point of $f$ and $g$ and $\bar{x}\in X$ such that $\bar{x} = g(x) = f(x)$, then $\bar{x}$ is called a point of coincidence of $f$ and $g$,

(iii) if $x\in X$ is a coincidence point of $f$ and $g$ such that $x = f(x) = g(x)$, then $x$ is called a common fixed point of $f$ and $g$,

(iv) the pair $(f, g)$ is said to be commuting if

(v) the pair $(f, g)$ is said to be weakly compatible (or partially commuting or coincidentally commuting) if $f$ and $g$ commute at their coincidence points, i.e.,

Definition 2.2. ^[19] Let $X$ be a nonempty set. A subset $\mathcal{R}$ of $X^2$ is called a binary relation on $X$. The subsets, $X^{2}$ and $\emptyset$ of $X^{2}$ are called the universal relation and empty relation respectively.

Definition 2.3. ^[9] Let $\mathcal{R}$ be a binary relation on a nonempty set $X$. For $x, y\in X$, we say that $x$ and $y$ are $\mathcal{R}$-comparative if either $(x, y)\in \mathcal{R}$ or $(y, x)\in \mathcal{R}$. We denote it by $[x, y]\in \mathcal{R}$.

Definition 2.4. ^{[19,20,21,22,23,24]} A binary relation $\mathcal{R}$ defined on a nonempty set $X$ is called

(i) amorphous if $\mathcal{R}$ has no specific property at all,

(ii) reflexive if $(x, x)\in \mathcal{R}\; \forall\; x\in X$,

(iii) symmetric if $(x, y)\in \mathcal{R}$ $\implies$ $(y, x)\in \mathcal{R}$,

(iv) anti-symmetric if $(x, y)\in \mathcal{R}$ and $(y, x)\in \mathcal{R}$ $\implies$ $x = y$,

(v) transitive if $(x, y)\in \mathcal{R}$ and $(y, w)\in \mathcal{R}$ $\implies$ $(x, w)\in \mathcal{R}$,

(vi) complete, connected or dichotomous if $[x, y]$ $\in$ $\mathcal{R}$ $\forall$ $x, y$ $\in$ $X$,

(vii) a partial order if $\mathcal{R}$ is reflexive, anti-symmetric and transitive.

Definition 2.5. ^[19] Let $X$ be a nonempty set and $\mathcal{R}$ be a binary relation on $X$.

(i) The inverse, transpose or dual relation of $\mathcal{R}$, denoted by $\mathcal{R}^{-1}$ is defined by,

(ii) Symmetric closure of $\mathcal{R}$, denoted by $\mathcal{R}^{s}$, is defined to be the set $\mathcal{R}$ $\cup$ $\mathcal{R}^{-1}$(i.e., $\mathcal{R}^{s} = \mathcal{R} \cup \mathcal{R}^{-1}$).

Proposition 2.6. ^[9] For a binary relation $\mathcal{R}$ defined on a nonempty set $X$,

Definition 2.7. ^[25] Let $X$ be a nonempty set, $E \subseteq X$ and $\mathcal{R}$ be a binary relation on $X$. Then, the restriction of $\mathcal{R}$ to $E$, denoted by $\mathcal{R}|_{E}$, is defined to be the set $\mathcal{R} \cap E^{2}$ (i.e. $\mathcal{R}|_{E} = \mathcal{R} \cap E^{2}$). Indeed, $\mathcal{R}|_{E}$ is a relation on $E$ induced by $\mathcal{R}$.

Definition 2.8. ^[9] Let $X$ be a nonempty set and $\mathcal{R}$ be a binary relation on $X$. A sequence $\{x_{n}\}$ $\subset$ $X$ is called $\mathcal{R}$-preserving if

Definition 2.9. ^[9] Let $X$ be a nonempty set and $f$ be a self-mapping on $X$. A binary relation $\mathcal{R}$ on $X$ is called $f$-closed if $\forall$ $x, y\in X$,

Definition 2.10. ^[26] Let $X$ be a nonempty set and $f$ and $g$ be two self-mappings in $X$. A binary relation $\mathcal{R}$ defined on $X$ is called $(f, g)$-closed if $\forall$ $x, y\in X$

Note that under the restriction $g = I$, the identity mapping on $X$, Definition 2.10 reduces to the notion of $f$-closedness of $\mathcal{R}$ defined in Definition 2.9.

Definition 2.11. ^[26] Let $(X, d)$ be a metric space and $\mathcal{R}$ be a binary relation on $X$. We say that $(X, d)$ is $\mathcal{R}$-complete if every $\mathcal{R}$-preserving Cauchy sequence in $X$ converges.

Clearly, every complete metric space is $\mathcal{R}$-complete with respect to a binary relation $\mathcal{R}$ but not conversely. For instance, Suppose $X = (-1, 1]$ together with the usual metric $d$. Notice that $(X, d)$ is not complete. Now endow $X$ with the following relation:

Then, $(X, d)$ is a $\mathcal{R}$-complete metric space. Particularly, under the universal relation, the notion of $\mathcal{R}$-completeness coincides with usual completeness.

Definition 2.12. ^[26] Let $(X, d)$ be a metric space and $\mathcal{R}$ be a binary relation on $X$ with $x\in X$. A mapping $f:X\rightarrow X$ is called $\mathcal{R}$-continuous at $x$ if for any $\mathcal{R}$-preserving sequence $\{x_{n}\}$ such that $x_{n} \xrightarrow{d} x,$ we have $f(x_{n}) \xrightarrow{d} f(x).$ Moreover, $f$ is called $\mathcal{R}$-continuous if it is $\mathcal{R}$-continuous at each point of $X$.

Clearly, every continuous mapping is $\mathcal{R}$-continuous under any binary relation $\mathcal{R}$. Particularly, under the universal, relation the notion of $\mathcal{R}$-continuity coincides with usual continuity.

Definition 2.13. ^[27,28] Let $(X, d)$ be a metric space and $(f, g)$ be a pair of self-mappings on $X$. The the pair $(f, g)$ is said to be compatible if

whenever $\{x_{n}\}$ is a sequence in $X$ such that

Definition 2.14. ^[26] Let $(X, d)$ be a metric space and $\mathcal{R}$ be a binary relation on $X$ and let $f$ and $g$ be two self-mappings on $X$. Then the mappings $f$ and $g$ are $\mathcal{R}$-compatible if for any sequence $\{x_{n}\} \subset X$ such that $\{fx_{n}\}$ and $\{gx_{n}\}$ are $\mathcal{R}$-preserving and $\lim\limits_{n\to\infty}gx_{n} = \lim\limits_{n\to\infty}fx_{n}$, we have

Remark 2.15. ^[26] In a metric space $(X, d)$ endowed with a binary elation $\mathcal{R}$,

In particular, under the universal relation, the notion of $\mathcal{R}$-compatibility coincides with usual compatibility.

Definition 2.16. ^[9] Let $(X, d)$ be a metric space. A binary relation $\mathcal{R}$ defined on $X$ is called $d$-self-closed if whenever $\{x_{n}\}$ is an $\mathcal{R}$-preserving sequence and

then there exists a subsequence $\{x_{n_{k}}\}$ of $\{x_{n}\}$ with $[x_{n_{k}}, x]$ $\in$ $\mathcal{R}$ $\forall$ $k$ $\in$ $\mathbb{N}_{0}.$

Definition 2.17. ^[26] Let $(X, d)$ be a metric space, and let $g$ be a self-mapping on $X$. A binary relation $\mathcal{R}$ defined on $X$ is called $(g, d)$-self-closed if for any $\mathcal{R}$-preserving sequence $\{x_{n}\}$ such that $\{x_{n}\} \rightarrow x$, there exists a subsequence $\{x_{n_{k}}\}$ of $\{x_{n}\}$ with $[gx_{n_{k}}, gx] \in \mathcal{R}$ $\forall$ $k\in \mathbb{N}_{0}$.

Note that under the restriction $g = I$, the identity mapping on $X$, Definition 2.17 reduces to the notion of $d$-self-closedness of $\mathcal{R}$.

Definition 2.18. ^[29] Given a mapping $f: X \rightarrow X$, a binary relation $\mathcal{R}$ defined on $X$ is called $f$-transitive if for any $x, y, z\in X$,

Later, Alam and Imdad ^[13] introduced the concept of locally $f$-transitivity.

Definition 2.19. ^[13] Let $X$ be a nonempty set, and $f$ be a self-mapping on $X$. A binary relation $\mathcal{R}$ on $X$ is called locally $f$-transitive if for each (effectively) $\mathcal{R}$-preserving sequence $\{x_{n}\} \subset f(X)$ (with range $E = \{x_{n}\in \mathbb{N}_{0}\})$, the binary relation $\mathcal{R}|_{E}$ is transitive.

Clearly, for a given self-mapping $f$ and a binary relation $\mathcal{R}$ on a nonempty set $X$,

Definition 2.20. ^[24] Let $X$ be a nonempty set and $\mathcal{R}$ a binary relation on $X$. A subset $E$ of $X$ is called $\mathcal{R}$-directed if for each $x, y\in E$, there exists $z\in X$ such that $(x, z)\in \mathcal{R}$ and $(y, z)\in \mathcal{R}$.

Now we recollect the following lemma which will be required in the proof of our main results.

Lemma 2.21. ^[30] Let $(X, d)$ be a metric space and $\{x_{n}\}$ be a sequence in $X$. If $\{x_{n}\}$ is not a Cauchy sequence, then there exist $\epsilon > 0$ and two subsequence $\{x_{n_{k}}\}$ and $\{x_{m_{k}}\}$ of $\{x_{n}\}$ such that

(i) $k < m_{k} < n_{k}$ $\forall$ $k\in \mathbb{N}$,

(ii) $d(x_{m_{k}}, x_{n_{k}}) \geq \epsilon$,

(iii) $d(x_{m_{k}}, x_{n_{k}-1}) < \epsilon$.

In addition to this, if $\{x_{n}\}$ also satisfies $\lim\limits_{n\to\infty}d(x_{n}, x_{n+1}) = 0$, then

Now we are equipped to prove our main results.

3.   Main results

In what follows, we define a family of functions as follows:

Consider a function $\phi: [0, \infty)^2 \rightarrow [0, \infty)$ defined by

Notice that $\phi \in \Phi$ but $\phi$ is not continuous, which establishes the fact that the family of functions $\Phi$ is larger than the family of functions considered by Choudhury ^[7] and Razani and Parvaneh ^[8].

Now we present our first result on the existence of coincidence points under weak C-contractions.

Theorem 3.1. Let $(X, d)$ be a $\mathcal{R}$-complete metric space endowed with a binary relation $\mathcal{R}$ and $f$, $g$ be two self-mappings on $X$. Suppose that the following conditions hold:

(a) $f(X) \subseteq g(X)$,

(b) $\mathcal{R}$ is $(f, g)$-closed and locally f-transitive,

(c) there exists $x_{0}\in X$ such that $(gx_{0}, fx_{0})\in \mathcal{R}$,

(d) $f$ and $g$ are $\mathcal{R}$-compatible,

(e) $g$ is $\mathcal{R}$-continuous,

(f) either $f$ is $\mathcal{R}$-continuous or $\mathcal{R}$ is $(g, d)$-self-closed,

(g) there exists $\phi \in \Phi$ such that

$\forall$ $x, y\in X$ with $(gx, gy) \in \mathcal{R}.$

Then $f$ and $g$ have a coincidence point.

Proof. By assumption $(c)$, there exists $x_{0}\in X$ such that $(gx_{0}, fx_{0})\in \mathcal{R}$. If $f(x_{0}) = g(x_{0})$, then we are done. Otherwise, by $(a)$ we can choose $x_{1} \in X$ such that $g(x_{1}) = f(x_{0})$. Again from $f(X) \subseteq g(X)$ there exists $x_{2} \in X$ such that $g(x_{2}) = f(x_{1})$. Continuing this process inductively, we can define a sequence $\{x_{n}\}$ $\subset$ $X$ of joint iterates such that

Now, we assert that $\{g{x_{n}}\}$ is a $\mathcal{R}$-preserving sequence, i.e.,

We prove the fact by mathematical induction. On using assumption $(c)$ and Eq (3.1) with $n = 0$, we have

Thus (3.2) holds for $n = 0$. Now suppose (3.2) holds for $n = r > 0$, i.e.,

then we have to show that (3.2) holds for $n = r+1$. since $\mathcal{R}$ is $(f, g)$-closed, we have from (3.3),

that is, (3.2) holds for $n = r+1$ also. Thus, by induction (3.2) holds $\forall$ $n\in\mathbb{N}_{0}$. In view of (3.1) and (3.2), the sequence $\{fx_{n}\}$ is also $\mathcal{R}$-preserving, i.e.,

If $g(x_{n_{0}}) = g(x_{n_{0}+1})$ for some $n_{0} \in \mathbb{N}$, then using (3.1) we have $g(x_{n_{0}}) = f(x_{n_{0}})$, i.e., $x_{n_{0}}$ is a coincidence point of $f$ and $g$ and hence we are done.

On the other hand, if $g(x_{n}) \neq g(x_{n+1})$ $\forall$ $n\in \mathbb{N}_{0}$ then $d(gx_{n}, gx_{n+1}) \neq 0$, then we can define a sequence $\{d_{n}\}^{\infty}_{n = 0}$ $\subset$ $(0, \infty)$ by

Applying (3.1), (3.2) and assumption $(g)$,

which gives

Therefore, the sequence $\{d_{n}\}$ is a decreasing sequence of non-negative real numbers and hence it is convergent. Suppose there exists $r \geq 0$ such that

We will show that $r = 0$. Suppose $r > 0$, then letting $n\to\infty$ in (3.5) and (3.6) we get

Again, taking upper limit in (3.4) and using (3.7) and (3.8), we get

Using the fact that for any sequence $\{x_{n}\}$, $\limsup (-x_{n}) = -\liminf(x_{n})$, we get

which gives $\liminf\limits_{n\to\infty}\phi(d(gx_{n}, gx_{n+2}), 0) \leq 0$ which is a contradiction to the property of $\phi$, since $(d(gx_{n}, gx_{n+2}), 0)$ $\rightarrow$ $(2r, 0)\neq (0, 0)$. Hence,

Now, we show that $\{gx_{n}\}$ is a Cauchy sequence. Suppose that $\{gx_{n}\}$ is not a Cauchy sequence. Therefore, by Lemma 2.21, there exist $\epsilon > 0$ and two subsequences $\{gx_{n_{k}}\}$ and $\{gx_{m_{k}}\}$ such that

for $n_{k} > m_{k} > k$, further, corresponding to $m_{k}$ we can choose $n_{k}$ in such a way that it is the smallest integer $n_{k} > m_{k}$ and satisfy (3.10). Then,

Further, in view of (3.9), (3.10), (3.11) and Lemma 2.21, we have

As $\{gx_{n}\}$ is $\mathcal{R}$-preserving and $\{gx_{n}\} \subseteq f(X)$, by the local $f$-transitivity of $\mathcal{R}$, we have $(gx_{m_{k}}, gx_{n_{k}}) \in \mathcal{R}$. Hence, applying contractivity condition $(g)$, we obtain

Taking the upper limit in the above equation and in view of (3.12), we get

Since for any sequence $\{x_{n}\}$, $\limsup (-x_{n}) = -\liminf(x_{n})$, we get using (3.12)

which is a contradiction to the property of $\phi$, since

Hence, $\{gx_{n}\}$ is a Cauchy sequence. Now since $\{gx_{n}\}$ is a $\mathcal{R}$-preserving sequence and $X$ is $\mathcal{R}$-complete, $\{gx_{n}\}$ converges to an element $z\in X$, i.e.,

Also, from (3.1),

By $\mathcal{R}$-continuity of $g$,

Utilizing (3.14) and $\mathcal{R}$-continuity of $g$,

Since $\{fx_{n}\}$ and $\{gx_{n}\}$ are $\mathcal{R}$-preserving and

by the $\mathcal{R}$-compatibility of $f$ and $g$,

Now, we prove that $z$ is a coincidence point of $f$ and $g$.

Suppose that $f$ is $\mathcal{R}$-continuous. Using (3.2), (3.13) and $\mathcal{R}$-continuity of $f$,

Applying (3.16), (3.17) and continuity of $d$,

so that $g(z) = f(z)$. Hence, $z$ is a coincidence point of $f$ and $g$.

Alternately, suppose that $\mathcal{R}$ is $(g, d)$-self-closed. As $\{gx_{n}\}$ is $\mathcal{R}$-preserving and $gx_{n} \rightarrow z$, due to $(g, d)$-self-closedness of $\mathcal{R}$, there exists a subsequences $\{gx_{n_{k}}\}$ of $\{gx_{n}\}$ such that

Since $gx_{n_{k}} \rightarrow z$, Eqs (3.13)–(3.17) also holds for $\{x_{n_{k}}\}$ instead of $\{x_{n}\}$. In view of (3.19) and using assumption $(g)$, we get

Now using triangle inequality and (3.20) we get

Letting $k\to\infty$ in the above equation, we get

which gives $d(gz, fz) = 0$, i.e, $z$ is a coincidence point of $f$ and $g$.

Theorem 3.2. In addition to Theorem 3.1, if we consider the following condition:

(h) $f(X)$ is $\mathcal{R}^{s}_{g(X)}$-directed,

then $f$ and $g$ have a unique point of coincidence.

Proof. Suppose there exist $x, y\in X$ such that

We show that $\bar{x} = \bar{y}$. As $f(x), f(y) \in f(X) \subseteq g(X)$, by assumption $(h)$, there exist $g(z)$ such that

and

Now define the constant sequences: $z^{0}_{n} = x$ and $z^{2}_{n} = y$ $\forall n\in \mathbb{N}_{0},$ then using (3.21),

Suppose $z^{1}_{0} = z$. Since $f(X) \subseteq g(X)$, we can define a sequence $\{z^{1}_{n}\}$ such that $g(z^{1}_{n+1}) = f(z^{1}_{n})$ $\forall$ $n\in \mathbb{N}_{0}.$ Therefore,

We claim that

We prove this fact by mathematical induction. It follows from (3.22) and (3.23) that (3.27) holds for $n = 0$. Suppose that (3.27) holds for $n = r > 0$, i.e.,

As $\mathcal{R}$ is $(f, g)$-closed, we have

which gives in view of (3.26), we get

Therefore, (3.27) holds for $n = r+1$ also. Hence, (3.27) holds $\forall$ $n\in\mathbb{N}_{0}$. Now in view of (3.27) and using (3.26) and assumption $(g)$, we get

which gives

which implies

which implies

Therefore, the sequence $\{d(gz^{0}_{n}, gz^{1}_{n})\}$ is decreasing non-negative sequence which converges to a non-negative real number $r$, i.e,

We will show that $r = 0$. Suppose that $r > 0$, then taking upper limit in (3.28) and utilizing the same method as used earlier in this proof, we get

which gives $\liminf\limits_{n\to\infty}\phi\big(d(gz^{0}_{n+1}, gz^{1}_{n+1}), d(gz^{1}_{n}, gz^{0}_{n})\big) \leq 0$, which is a contradiction to the property of $\phi$. Hence,

Similarly, we can show that

Now, using triangle inequality, (3.24) and (3.25), we get

Letting $n\to\infty$ and in view of (3.29) and (3.30), we get

Hence, $f$ and $g$ have unique point of coincidence.

Now we present coincidence point results for mappings satisfying weak K-contraction.

Theorem 3.3. Let $(X, d)$ be a $\mathcal{R}$-complete metric space endowed with a binary relation $\mathcal{R}$. Let $f$ and $g$ be two self-mappings on $X$. Suppose that the following conditions hold:

(a) $f(X) \subseteq g(X)$,

(b) $\mathcal{R}$ is $(f, g)$-closed and locally $f$-transitive,

(c) there exists $x_{0}\in X$ such that $(gx_{0}, fx_{0})\in \mathcal{R}$,

(d) $f$ and $g$ are $\mathcal{R}$-compatible,

(e) $g$ is $\mathcal{R}$-continuous,

(f) either $f$ is $\mathcal{R}$-continuous or $\mathcal{R}$ is $(g, d)$-self-closed,

(g) there exists $\phi \in \Phi$ such that

$\forall$ $x, y\in X$ with $(gx, gy)\in \mathcal{R}$.

Then $f$ and $g$ have a coincidence point.

Proof. Following the proof of Theorem 3.1, we can construct the sequence $\{gx_{n}\}$ defined in (3.1) and claim that the sequences $\{gx_{n}\}$ and $\{fx_{n}\}$ are $\mathcal{R}$-preserving. If $g(x_{n_{0}}) = g(x_{n_{0}+1})$ for some $n_{0} \in \mathbb{N}$, then using (3.1) we have $g(x_{n_{0}}) = f(x_{n_{0}})$ i.e. $x_{n_{0}}$ is a coincidence point of $f$ and $g$, hence we are done. On the other hand, if $g(x_{n}) \neq g(x_{n+1})$ $\forall$ $n\in \mathbb{N}_{0}$ then $d(gx_{n}, gx_{n+1}) \neq 0$. On using (3.1), (3.2) and assumption $(g)$, we have

which gives

Hence, the sequence $\{d(gx_{n}, gx_{n+1})\}$ is a decreasing sequence which converges to $r\geq0$. Using the same technique as in Theorem 3.1, we get

Now, we show that $\{gx_{n}\}$ is a Cauchy sequence. Following the lines of Theorem 3.1, there exist subsequences $\{gx_{n_{k}}\}$ and $\{gx_{m_{k}}\}$ of $\{gx_{n}\}$ such that $(gx_{m_{k}}, gx_{n_{k}}) \in \mathcal{R}$. Then applying condition $(g)$, we obtain

Letting $k\to\infty$ in the above equation and using the property of $\phi$, we get that the sequence $\{gx_{n}\}$ is Cauchy. The rest of the proof is similar to Theorem 3.1.

Theorem 3.4. In addition to Theorem 3.3, if we consider the following condition:

(h) $f(X)$ is $\mathcal{R}^{s}_{g(X)}$-directed,

then $f$ and $g$ have a unique point of coincidence.

Proof. The proof is almost similar to Theorem 3.2. Here,

which gives

Therefore, the sequence $\{d(gz^{1}_{n}, gz^{0}_{n})\}$ is decreasing non-negative sequence which converges to a non-negative real number, i.e.,

Also in view of (3.34) and (3.35), we get

Now taking the upper limit in (3.33) and using the property of $\phi$, we get

Similarly,

Now the conclusion is immediate following Theorem 3.2.

Remark 3.5. Theorem 3.2 (Theorem 3.4) also guarantees the existence of a unique common fixed point of $f$ and $g$.

Proof. Let $x$ be a coincidence point of $f$ and $g$. So we have, $g(x) = f(x) = \bar{x}$. Using Remark 2.15, every $\mathcal{R}$-compatible pair is weakly compatible. Therefore, $\bar{x}$ is also a coincidence point of $f$ and $g$. In view of Theorem 3.2 (Theorem 3.4), we get $g(x) = g(\bar{x})$ which gives

Hence, $\bar{x}$ is a common fixed point of $f$ and $g$. To claim the uniqueness, we assume $x'$ be another common fixed point of $f$ and $g$. Using Theorem 3.2 (Theorem 3.4), we get

which concludes the proof.

Under universal relation (i.e. $\mathcal{R} = X^{2}$), Theorem 3.1 together with Theorems 3.2, 3.3, 3.4 reduce to the following coincidence point theorems

Corollary 3.6. Let $(X, d)$ be a complete metric space and $f$, $g$ be two self-mappings on $X$. Suppose that the following conditions hold:

(a) $f(X) \subseteq g(X)$,

(b) $f$ and $g$ are compatible,

(c) $g$ is continuous,

(c) there exists $\phi \in \Phi$ such that

$\forall$ $x, y\in X$.

Then $f$ and $g$ have a unique point of coincidence.

Corollary 3.7. Let $(X, d)$ be a complete metric space and $f$, $g$ be two self-mappings on $X$. Suppose that the following conditions hold:

(a) $f(X) \subseteq g(X)$,

(b) $f$ and $g$ are compatible,

(c) $g$ is continuous,

(d) there exists $\phi \in \Phi$ such that

$\forall$ $x, y\in X$.

Then $f$ and $g$ have a unique point of coincidence.

4.   Related fixed point results

In this section, we derive several fixed point results of the existing literature as consequences of our newly proved results.

Taking $g = I$, the identity map on $X$ in Theorems 3.1, 3.2, 3.3 and 3.4, we obtain

Corollary 4.1. Let $(X, d)$ be a $\mathcal{R}$-complete metric space endowed with a binary relation $\mathcal{R}$ and $f$ a self-mappings on $X$. Suppose that the following conditions hold:

(a) $\mathcal{R}$ is $f$-closed and locally f-transitive,

(b) there exists $x_{0}\in X$ such that $(x_{0}, fx_{0})\in \mathcal{R}$,

(c) either $f$ is $\mathcal{R}$-continuous or $\mathcal{R}$ is $d$-self-closed,

(d) there exists $\phi \in \Phi$ such that

$\forall$ $x, y\in X$ with $(x, y) \in \mathcal{R}.$

Then $f$ has a fixed point. Moreover, if

(e) $f(X)$ is $\mathcal{R}^{s}$-directed,

then $f$ has a unique fixed point.

Corollary 4.2. Let $(X, d)$ be a $\mathcal{R}$-complete metric space endowed with a binary relation $\mathcal{R}$ and $f$ a self-mappings on $X$. Suppose that the following conditions hold:

(a) $\mathcal{R}$ is $f$-closed and locally f-transitive,

(b) there exists $x_{0}\in X$ such that $(x_{0}, fx_{0})\in \mathcal{R}$,

(c) either $f$ is $\mathcal{R}$-continuous or $\mathcal{R}$ is $d$-self-closed,

(d) there exists $\phi \in \Phi$ such that

$\forall$ $x, y\in X$ with $(x, y) \in \mathcal{R}.$

Then $f$ has a fixed point. Moreover, if

(e) $f(X)$ is $\mathcal{R}^{s}$-directed,

then $f$ has a unique fixed point.

Under universal relation (i.e. $\mathcal{R} = X^{2}$), taking $g = I$, the identity map on $X$ in Theorems 3.1, 3.2, 3.3 and 3.4, we obtain:

Corollary 4.3. Let $(X, d)$ be a complete metric space and $f$ be a self-mapping on $X$. If there exists $\phi \in \Phi$ such that

$\forall$ $x, y\in X$. Then, $f$ has a unique fixed point.

Corollary 4.4. Let $(X, d)$ be a complete metric space and $f$ a self-mapping on $X$. If there exists $\phi \in \Phi$ such that

$\forall$ $x, y\in X$. Then, $f$ has a unique fixed point.

Taking $\mathcal{R} = \preceq$, the partial order and $g = I$, the identity map on $X$ in Theorem 3.1 we obtain the following result:

Corollary 4.5. Let $(X, d, \preceq)$ be a complete metric space endowed with usual partial order and $f$ a self-mapping on $X$. Suppose the following conditions hold:

(a) there exists $x_{0} \in X$ such that $x_{0} \preceq fx_{0}$,

(b) $f$ is nondecreasing with respect to $\preceq$,

(c) $f$ is continuous or $(X, d, \preceq)$ is regular,

(d) there exists $\phi \in \Phi$ such that

then, $f$ has a fixed point.

Notice that Corollary 4.1 improves and sharpens Theorem 1.3 and Theorem 2.1 of Harjani et al. ^[30] since the auxiliary function $\phi$ considered here is relatively weaker than the existing one.

Remark 4.6. Taking $\phi (x, y) = k(x+y)$, where $0 < k < 1$ in Corollaries 4.3 and 4.4 we obtain the classical fixed point theorems given by Kannan ^[5] and Chatterjea ^[6] respectively.

5.   An illustrative example

Consider the metric space $(X, d)$ with $X = (-1, 1]$ with the usual metric $d$. Define two functions $f, g: X \rightarrow X$ by

Now endow $X$ with the following binary relation

Obviously, $X$ is $\mathcal{R}$-complete metric space. Consider a function $\phi: [0, \infty)^2 \rightarrow [0, \infty)$ defined by

For $x, y \in X$ with $(gx, gy)\in \mathcal{R}$,

Therefore, the condition $(g)$ of Theorem 3.1 is satisfied. Also, by routine calculation, it can be observed that all the other conditions of Theorems 3.1 and 3.2 are satisfied, and $f$ and $g$ have a unique point of coincidence, namely: $x = 0$, which is also a unique common fixed point of $f$ and $g$ in view of Remark 3.5.

Notice that condition $(g)$ of Theorem 3.1 does not hold for the whole space (for example, take $x = 0 \; \text{and} \; y = 1$). Also, the used auxiliary function $\phi$ in this example is discontinuous. Therefore, this example cannot be solved by the existing results, which establishes the importance of our results.

6.   Conclusions

In this paper, we observed that some of the conditions of the auxiliary function $\phi$ are not necessary for weak C-contractions and weak K-contractions. Moreover, we established the relation-theoretic variants of some coincidence point as well as fixed point theorems for these contractions. Also, the presented example shows the effectiveness of our newly proved results over corresponding several noted results. Now, for possible problems, one can attempt to prove related contractions like weakly $f$-Kannan, weakly $f$-Chatterjea etc., with the newly introduced family of auxiliary functions.

Acknowledgments

The authors would like to thank the anonymous referees for their comments that helped us improve this article. The first author would like to thank the Council of Scientific and Industrial Research (CSIR), Government of India for JRF (File No. 09/112(0604)/2018-EMR-I).

Conflict of interest

The authors declare no conflict of interest.