SERENDIPITY FIXED POINT

P. L. POWAR
1
& G. R. K. SAHU
2
1
Department of Mathematics and Computer Sciences, Rani Durgawati University, Jabalpur, Madhya Pradesh, India
2
Department of Mathematics and Computer Sciences, Government Model Science College, Jabalpur, Madhya Pradesh,
India

ABSTRACT
It has been noticed that the fixed point may not exist for some self maps T defined on a set X. To deal with such
cases the idea of Serendipity fixed point has been introduced in this paper. Considering the lighter concept of completeness
viz. weak completeness, the existence and uniqueness of Serendipity fixed point has been established under various
contraction conditions. This new idea may be useful in solving or simplifying the problems which are totally based on
fixed point theory.
KEYWORDS: Serendipity Fixed Point, Weak Convergence, Weak Cauchy Sequence, Weak Complete Metric Space,
Dual Contraction, Altering Distance Function, Dual Weak Contraction
AMS CLASSIFICATION: 47H10, 54H25
1. INTRODUCTION
Henri Poincare [13] in 1886, proved a result which is equivalent to the Browers fixed point theorem [5]. The field
of Fixed point theory has completed its century in 2012.Many of the researchers contributed a high level work in this
particular area. Most of the problems in pure and applied mathematics reduce to a problem of common fixed point of some
self mapping defined on metric space. The study of a fixed point and common fixed point satisfying different contractive
conditions has been explored by many mathematicians. Recently, the fixed point theorems involving the concept of
altering distance functions have been initiated by Delbosco in 1967(cf. [7]) and this was further studied by Khan et al. in
1984 (cf. [10]).The initial concept of altering distance function was generalized by Choudhary [6] and then the concept was
extensively used by many researchers (cf. [2], [3], [8], [9], [14]-[18]).
The idea of weak complete metric space involving the weak convergence of weak Cauchy sequence has been
described in [11]. The authors have studies the concept of dual space (cf. [11]) and applied it on the fixed point theory. If f
is real or complex valued function, then it was interesting to observe that even if for some xeX, Tx x but f(Tx) = f(x).
Such a point was noticed suddenly while studying the weak complete metric space and the dual space. Thus, the
nomenclature, Serendipity fixed point came in existence. With reference to this new definition of Serendipity fixed
point, some illustrative examples have been discussed in details. In the present paper, the authors have also established
some basic results in the perspective of this idea.
This notion of Serendipity fixed point will definitely play a key role in widening the applicational strength of the
field of fixed point theory.
2. PRELIMINARIES
In order to establish our results, we require the following definitions and results:

International Journal of Mathematics and
Computer Applications Research (IJMCAR)
ISSN 2249-6955
Vol. 3, Issue 3, Aug 2013, 65-78
TJPRC Pvt. Ltd.
66 P. L. Powar

& G. R. K. Sahu
2.1 Definition
Let X be a normed space. Then the set of all bounded linear functionals on X constitutes a normed space with the
norm defined by

which is called the dual space of X and is denoted by X* (cf. [11]).
2.2 Definition
Let {x
n
} be a sequence in a normed linear space X. The sequence {x
n
} is said to converge strongly to x in X if
0
n
x x , as n
This is written as lim x
n
= x, x is called the strong limit of {x
n
} (cf. [11]).
2.3 Definition
Let {x
n
} be a sequence in a normed linear space X. {x
n
} is said to converge weakly to x in X if for every linear
functional feX* (dual space of X)
f (x
n
) f (x), as n
i.e. for every e> 0 there exists a natural number n
o
eN such that
( ) ( )
n
f x f x <e , n>n
o
and for all f e X*
In this case, we write
n
w
x x and x is called the weak limit of the sequence {x
n
} (cf. [11]).
2.1 Remark
Weak convergence does not imply strong convergence in general. In the finite dimensional space the distinction
between strong and weak convergence disappears completely (Theorem 4.8-4(c) of [11]).
2.1 Example
Consider the Hilbert space which is the space of the square-integrable functions on the interval
[0,2t].The inner product on the space is defined by

The sequence of functions f
1
, f
2
, f
3
, defined by

converges weakly to the zero function in , as the integral

tends to zero for any square-integrable function g on when m tends to infinity, i.e.

Serendipity Fixed Point 67
However, does not tends to 0 , as m .
2.2 Example
Let (e
n
) be an orthonormal sequence in a Hilbert space H. For every f H*(dual space of H) has a Riesz
representation f(x) = (x, z). Hence f(e
n
) = (e
n
, z). In view of the Bessel inequality

it may be noted that the series on the left converges, hence its n
th
terms must approach to zero as n tends to .This
implies
f(e
n
) = (e
n
, z) 0.
Since f H* was arbitrary, we see that 0
n
w
e . However (e
n
) does not converge strongly as
|| e
m
-e
n
||
2
= (e
m
-e
n
, e
m
-e
n
) = 2,
for all m and n (cf. [11]).
2.4 Definition
Weak Cauchy sequence in a real or complex normed space X is a sequence {x
n
} in X such that for every feX*
the sequence {f(x
n
)} is Cauchy in R or C, respectively. i.e. if for every e> 0, there exists a natural number n
o
eN such
that
( ) ( )
n
f x f x <e, for all n, m > n
o
and for all feX* (cf. [11]).
2.5 Definition
A normed space X is said to be weakly complete if each weak Cauchy sequence in X converges weakly in X
(cf. [11]).
2.6 Definition
A fixed point of a mapping T: XX of a set X into itself is an xeX which is mapped onto itself, that is,Tx = x.
2.7 Definition
A Serendipity fixed point of a mapping T: XX of a set X into itself is a point xeX such that there exists real
or complex valued function f on X satisfying the condition f(Tx) = f(x).
2.3 Example
Let X be the set of all rational numbers, let T: XX defined by T(x) = x+1 and f: XR defined by f(x) = x
2
.
Clearly T has no fixed point but x = is the only Serendipity fixed point of T (cf. Figure 2.1 and Figure 2.2).
68 P. L. Powar

& G. R. K. Sahu

Has no Fixed Point
Figure 2.1 Figure 2.2
2.4 Example
Let X be the set of all integers, let T: XX defined by T(x) = - x and f: XR defined by f(x) = cos(x).
Clearly x = 0 is the only fixed point of T , but all the points of X are Serendipity fixed points of T (cf. Figure 2.3
and Figure 2.4).

is Fixed Point of All Points Are Serendipity Fixed Points of
Figure 2.3 Figure 2.4
2.5 Example
Let X be the set of all real numbers, let T: XX defined by T(x) = x
2
and f: XR defined by f(x) = x+1.
Clearly 0 and 1 are the fixed as well as Serendipity fixed points of T (cf. Figure 2.5 and Figure 2.6).

are Fixed Point of are Serendipity Fixed Point of
Figure 2.5 Figure 2.6
Serendipity Fixed Point 69
2.6 Example
Let X be the set of all irrational numbers, let T: XX defined by T(x) = x+1 and f: XR defined by f(x) = x
3
.

Clearly T has neither a fixed point nor a Serendipity fixed point in X (cf. Figure. 2.7 and Figure 2.8).

Has no Fixed Point Has no Serendipity Fixed Point
Figure 2.7 Figure 2.8
2.8 Definition
Let (X, d) be a space. A mapping T: XX is called a contraction on X if there is a positive real number c < 1
such that for all x, y in X
d( T(x), T(y)) c d(x, y).
2.9 Definition
Let X be normed linear space and T be a selfmap on X. Letd be the metric defined on R or C and for all x, y in
X and feX* such that
d(f T(x), f T(y)) c d(f(x), f(y)), 0 < c < 1.
Then T is called dual contraction on X.
2.10 Definition
A function : [0, ) [0, ) is called an altering distance function (cf. [10]) if the following properties are
satisfied:
(i) is a continuous function
(ii) is a monotonically increasing function
(iii) (x) = 0 x = 0 .
2.11 Definition
Let (X, d) be a metric space. A mapping T: XX is said to be weakly contractive (cf. [1]) if
d(T(x), T(y)) d(x, y) d(x, y), for all x, y in X
where is altering distance function.
70 P. L. Powar

& G. R. K. Sahu
2.12 Definition
Let X be normed linear space and T be a selfmap on X, if for all feX
*
satisfying the condition:
d(f T(x), f T(y)) d(f(x), f(y)) d(f(x), f(y)) , for all x, y in X
where is an altering distance function , then T is called dual weak contraction on X.
2.1 Lemma
Let (M, D) be a metric space, let (x
n
) be a sequence of point of M such that lim
n
d (x
n
, x
n+1
) = 0. If (x
n
) is not a
Cauchy sequence in M then there exists an e> 0 for which we can find subsequence (x
m(k)
) and (x
n(k)
) of (x
n
) with n(k) > m
(k) > k such that
( ) ( )
( )
,
m k n k
d x x >e,
( ) ( )
( )
,
m k n k
d x x <e and
(i) lim
k

( ) ( )
( )
,
m k n k
d x x =e
(ii) lim
k

( ) ( )
( )
1
,
m k n k
d x x

=e
(iii) lim
k

( ) ( )
( )
1 1
,
m k n k
d x x

=e
(iv) lim
k

( ) ( )
( )
1
,
m k n k
d x x
+
=e
(v) lim
k

( ) ( )
( )
1 1
,
m k n k
d x x
+ +
=e
(vi) lim
k

( ) ( )
( )
1 2
,
m k n k
d x x
+ +
=e
(see Lemma 1.3 of [12])
3. MAIN RESULTS
In this section , the basic result of fixed point theorem (cf.[4]) has been proved by considering the idea of dual
contraction map. Throughout our discussion, we consider X as an infinite dimensional normed linear space.
3.1 Theorem
Let X be a normed linear space, T be a selfmap on X and d be the metric defined on R. If f e

X*(real dual
space of X) and f is a bijection map satisfying the condition
d(f T(x), f T(y)) c d(f(x), f(y)), (0 < c < 1) , for all x, y in X (3.1)
then T has a unique Serendipity fixed point.
Proof
Let x be an arbitrary point in X, and {x
n
} be a sequence of point in X such that
Tx
n
= x
n+1
, neN (set of all natural numbers) (3.2)
Serendipity Fixed Point 71
Now putting x = x
n
and y = x
n+1
in (3.1.1), yields
d(f T(x
n
),f T(x
n+1
)) c d(f(x
n
),f(x
n+1
)) (cf. (3.1))
< d(f(x
n
), f(x
n+1
))
Let
n
= d(y
n
, y
n+1
), where, y
n
= f(x
n
), n = 1, 2, , n,
Clearly ,
n+1
c
n

n.

This implies that {
n
} is decreasing sequence of positive real numbers. Since R is complete, hence, {
n
}
converges and since
n
c
n

0,

n
0, as n .
Now if m < n, then
d(y
m
, y
n
) = d(fx
m
, fx
n

= d(fTx
m-1
, fTx
n-1
)
c d(y
m-1
, y
n-1
)
< c
m
d(y
0
, y
n-m
)
< c
m
(d(y
0
, y
1
)+ d(y
1
,y
2
)+ d(y
n-m-1
,y
n-m
))
< c
m
d(y
0
, y
1
) (1+c++c
n-m-1
)
( )
1
, 0
1
m
o
c
d y y
c
<

as
m

( ) 1 c <
Hence {y
n
} is a Cauchy sequence in R, since R is complete, there exists a point y in R such that y
n
y i.e. f(x
n
)
y. Since, f is onto, this implies that there exists xeX such that f(x) = y. Therefore f(x
n
) f(x). Hence {x
n
} converges
weakly to x in X. We now show that x is Serendipity fixed point of T.
Since d(f T(x), y
n
)) = d(f T(x), fx
n
))
= d(fTx, fTx
n-1
))
cd(fx, fx
n-1
))
Letting n , we get d(f T(x),f(x)) cd(fx, fx)
This implies that d(f T(x), f(x)) = 0, therefore f(Tx) = f(x). Hence, x is a Serendipity fixed point of T.
Claim
x is unique.
Let, if possible, there exists peX such that, p = x and p is also a Serendipity fixed of T, i.e. fT(p) = f (p)
Now ( ) ( ) , , d fx fp d fTx fTp = ( ) , cd fx fp s .
Since c < 1 this implies that d(f(x), f(p)) = 0, hence f(x) = f(p), since f is one-one
So that x = p. Hence, x is unique Serendipity fixed point of T.
Using the concept of dual altering distance function, the following theorem cover similar result discussed in [10]
72 P. L. Powar

& G. R. K. Sahu
(see also [6], [7]).
3.2 Theorem
Let X be a normed linear space , T be a selfmap on X and d be the metric defined on R. If f e

X*(real dual
space of X) and f is a bijection map satisfying the condition:
( ) ( ) , , d fTx fTy c d fx fy s | | (3.3)
for all x, y

eX and for some 0 < c < 1, where | : [0, ) [0, ) be an altering distance function. Then T has
unique Serendipity fixed point.
Proof
Let x
o
be an arbitrary point in X and {x
n
} be a sequence of points in X, we define
x
n
= Tx
n1
and y
n
= fx
n
, for all n = 1, 2, , (3.4)
Let
( )
1
,
n n n
d fx fx o
+
=
( )
1
,
n n
d y y
+
= and
( )
n n
| | o = (3.5)
Now
( ) ( )
1 1 2 1
, ,
o
d fx fx d fTx fTx = = | | |

( )
1
,
o
c d fx fx s | (cf. (3.3))

o
c = | .
Hence, |
1
< |
0
( 0 < c < 1). Thus, by induction, we get
1 n n
| |

< , for all n=1,2, It is concluded that {|
n
}
is decreasing sequence of non-negative real numbers; hence it converges to 0, i.e. lim |
v
= 0
Since
1 n n
| |

< i.e.
( ) ( )
1 n n
| o | o

< (cf. ( 3.5))
This implies that the sequence {o
v
} is also a decreasing sequence of non- negative real numbers and hence
n
o as n
Claim
The sequence {y
n
} is a Cauchy sequence.
For this, it is sufficient to show that the subsequence {y
2n
} of {y
n
} is a Cauchy sequence. Let, if possible, {y
2n
} is
not a Cauchy sequence, then there exists an e> 0 and monotonically increasing sequence of natural numbers {2m(k)} and
{2n(k)} such that for n(k) > m(k),
( ) ( )
( )
2 2
,
n k m k
d y y > e and
( ) ( )
( )
2 2 1
,
n k m k
d y y

< e (3.6)
In view of (3.6),
( ) ( )
( )
2 2
,
n k m k
d y y es

Applying the function |, yields
( )
( ) ( )
( )
2 2
,
n k m k
d y y | | e s

Serendipity Fixed Point 73

( ) ( )
( )
2 1 2 1
,
n k m k
d fTx fTy

= | (cf. 3.4)

( ) ( )
( )
2 1 2 1
,
n k m k
c d y y

s |
Letting k and using lemma 2.1, we get
( ) ( ) ( ) c e s e < e | | | ( 0 < c <1),
which is a contradiction. Hence {y
2n
} is a Cauchy sequence, therefore {y
n
} is a Cauchy sequence in R. Since R is
complete, {y
n
} converges to a point y e

R i.e. y
n
y, as n .
Since f is onto, there exists xeX such that y = f(x) and y
n
= f (x
n
) f(x).
Hence
n
w
x x , i.e. {x
n
} converges weakly to x in X.
Claim
x is Serendipity fixed point of T.
Consider
( )
( )
( )
( )
2 2
, ,
n k n k
d fTx y d fTx fx = | |

( )
( )
2 1
,
n k
d fTx fTx

=|

( )
( )
2 1
,
n k
c d fx fx

s

( )
( )
2 1
,
n k
cd fx y

=
Letting, k

we get
( ) ( ) , , d fTx fx d fx fx s | |
Finally we conclude that
( ) , 0 d fTx fx = | i.e.
( ) , 0 d fTx fx = and hence,
fTx = fx.
This shows that x is Serendipity fixed point of T. The uniqueness of x is follows similarly as discussed in Theorem
3.1.
Involving the concept of dual weak altering distance function, the following theorem has been proved in view of
result due to Delbosco et al.(cf.[7]).
3.3 Theorem
Let X be a normed linear space, T be a selfmap on X, d be the metric defined on R. If f eX*(real dual space of
X) and f is a bijection map satisfying the condition
( ) ( ) ( ) , , , d fTx fTy d fx fy d fx fy s | (3.7)
for all x, y eX, where | : [0, ) [0, ) be an altering distance function.
Then T has unique Serendipity fixed point.
74 P. L. Powar

& G. R. K. Sahu
Proof
Let x
o
be an arbitrary point in X and {x
n
} be a sequence of points in X. Define
x
n
= Tx
n1
and fx
n
= y
n
, n = 1, 2,, n, (3.8)
Now putting x = x
n
and y = x
n+1
in (3.7) , we get
( )
1
,
n n
d fTx fTx
+
( ) ( )
1 1
, ,
n n n n
d fx fx d fx fx
+ +
s |
Let
n
= d(y
n
, yn
+1
), where y
n
= f(x
n
), n = 1, 2, , n, (3.9)
Clearly
n+1

n
|
n



n

This implies that {
n
} is decreasing sequence of real numbers. Since R is complete, {
n
} converges to zero, as n
.
Claim
The sequence {y
n
} is a Cauchy sequence.
For this, it is enough to show that the subsequence {y
2n
} of {y
n
} is a Cauchy sequence. Let, if possible, {y
2n
} is
not a Cauchy sequence, then there exists an e> 0 and monotonically increasing sequence of natural numbers {2m(k)} and
{2n(k)} such that for n(k) > m(k),
( ) ( )
( )
2 2
,
n k m k
d y y > e and
( ) ( )
( )
2 2 1
,
n k m k
d y y

< e
Since
( ) ( )
( )
( ) ( )
( )
2 2 2 2
, ,
n k m k n k m k
d y y d fx fx es = (cf. (3.8))

( ) ( )
( )
2 1 2 1
,
n k m k
d fTx fTx

=

( ) ( )
( )
2 1 2 1
,
n k m k
d fx fx

s
( ) ( )
( )
2 1 2 1
,
n k m k
d fx fx

|

( ) ( )
( )
2 1 2 1
,
n k m k
d y y

=
( ) ( )
( )
2 1 2 1
,
n k m k
d y y

|
Letting k
,
we get
( ) es e e <e |
which is a contradiction, hence {y
2n
} is a Cauchy sequence, therefore {y
n
} is also a Cauchy sequence in R. Since
R is complete, y
n
y, as n , for some y eR.
i.e. f (x
n
) y , as n . As f is onto, there exists x eH such that f (x) = y. Hence,
Consider
( )
( )
( )
( )
2 2 1
, ,
n k n k
d fTx y d fTx fTx

=

( )
( )
( )
( )
2 1 2 1
, ,
n k n k
d fx fx d fx fx |

s (cf. (3.7))
Serendipity Fixed Point 75

( )
( )
( )
( )
2 1 2 1
, ,
n k n k
d fx y d fx y |

= (cf. (3.8))
Applying limit as k , yields
( ) ( ) ( ) , , , d fTx fx d fx fx d fx fx s |
This implies that
( ) , 0 d fTx fx s , thus,
( ) , 0 d fTx fx = and hence f Tx = fx
This shows that x is Serendipity fixed point of T. The uniqueness of x is follows similarly.
3.4 Theorem
Let X be a normed linear space,
{ }
1
n
n
T

=
be a sequence of self maps on X, d be the metric defined on R. If f
eX*(real dual space of X) and f is a bijection satisfying the condition:
( ) ( ) , ,
i j
d f T x f T y c d fx fy s | | (3.10)
for all i, j = 1, 2, and for all distinct x, y e X, where 0 < c < 1 and | is an altering distance function.
Then
{ }
1
n
n
T

=
has a unique common Serendipity fixed point in X.
Proof
Let x be an arbitrary point in X and let{x
n
}is an iterative sequence of points of X defined by
1 n n n
x T x

= and f(x
n)
= y
n
, for all n=1, 2, . (3.11)
Let
( ) ( )
1 1
, ,
n n n n n
d fx fx d y y o
+ +
= = and
( )
n n
| | o =
Now
( ) ( )
1 1 2 1 2 1
, ,
o
d fx fx d fT x fT x = = | | |

(cf. (3.11))

( )
1
,
o
c d fx fx s | (cf. (3.10))

o
c = | .
Hence, |
1
< |
0

0
( 0 < c < 1)
Thus, by induction we get
1 n n
| |

< , for all n = 1, 2, 3,
It follows that {|
v
} is decreasing sequence of non-negative real numbers, hence converges to zero, i.e.
lim 0
n
| = .
Since
1 n n
| |

< i.e.
( ) ( )
1 n n
| o | o

< , for all n = 1, 2, 3,
It may observe that the sequence {o
n
} is also a decreasing sequence of non-negative real numbers and hence
0
n
o as n .
76 P. L. Powar

& G. R. K. Sahu
Claim
The sequence {y
n
} is a Cauchy sequence.
In order to establish the claim, it is enough if we show that the subsequence {y
2n
} of {y
n
} is a Cauchy sequence.
Let, if possible, {y
2n
} is not a Cauchy sequence, then there exists an e> 0 and monotonically increasing sequence of
natural numbers {2m(k)} and {2n(k)} such that n(k) > m(k),
( ) ( )
( )
2 2
,
n k m k
d y y > e and
( ) ( )
( )
2 2 1
,
n k m k
d y y

< e
In view of the above inequality,
( ) ( )
( )
2 2
,
n k m k
d y y es and is increasing, it follows directly that
( )
( ) ( )
( )
2 2
,
n k m k
d y y | | e s
( ) ( ) ( ) ( )
( )
2 2 1 2 2 1
,
n k n k m k m k
d fT x fT x

=|

( ) ( )
( )
2 1 2 1
,
n k m k
c d y y

s | (referring relation(3.11))
Letting k

and using Lemma 2.1, we get
( ) ( ) ( ) c e s e < e | | |
which is a contradiction. Hence {y
2n
} is a Cauchy sequence, therefore {y
n
} is a Cauchy sequence in R. Since R is
complete, therefore {y
n
} converges to a point yeR ie y
n
y as n , since f is onto, there exists xeX such that f
(x) = y, hence y
n
= f(x
n
) f(x) as n , therefore
n
w
x x i.e.{x
n
} converges weakly to x in X.
We claim that x is Serendipity fixed point of T. Consider

( )
( )
( ) ( )
( )
2 2 2 1
, ,
i i n k n k n k
d fT x y d fT x fT x | |

=
( )
( )
2 1
,
n k
c d fx fx

s |

( )
( )
2 1
,
n k
c d fx y

= |
Letting k
,
we get

( )
( )
( ) , ,
i x
d fT x f c d fx fx s | |
This implies that
( ) , 0
i
d fTx fx | =
i.e.
( ) , 0
i
d fTx fx = , thus, f T
i
x = f x , for all i = 1, 2,.
Thus , x is Serendipity fixed point of T
i
, for each i = 1, 2,
Hence, x is common Serendipity fixed point of the sequence of mappings
{ }
1
n
n
T

=
.

Serendipity Fixed Point 77
Claim
x is unique.
Let, if possible, peX such that p is also a Serendipity fixed point of T
n
, n =1, 2, i.e. fT
n
(p) = f(p), n=1,
2,
Now
( ) ( ) , ,
i i
d fx fp d fTx fT p | | = , for all i, j, = 1, 2,

( ) , c d fx fp s |

( ) , d fx fp | <
which is a contradiction. Hence x is unique common Serendipity fixed point of the sequence of mappings
{ }
1
n
n
T

=
.
CONCLUSIONS
The new concept may have a high potential of applications. For example, if we consider a classical method viz.
Picards method of successive approximation, for finding the solution of linear differential equations in which the sequence
of solutions converges to a fixed point which is the unique solution of the equation, this concept of Serendipity fixed point
may be applied in case when such types of approximate solutions do not converge to any unique limit.
REFERENCES
1. Alber, YaI, Guerre-Delabriere, S. (1997), Principles of weakly contractive maps in Hilber spaces. Oper Theory.
Adv. Appl. 98, 7-22.
2. Babu, G.V.R. and Shaik, Ismail (2001), A fixed point theorem by altering distances, Bull Cal. Math Soc, 93(5),
393-398.
3. Babu, G.V.R. (2004), Generalization of fixed point theorems relating to the diameter of orbits by using a control
function, Tamkang J. Math, 35(2), 159-168.
4. Banach, S. (1922), Surles operations dans les ensembles abstraits et leur application aux equationsitegrales, Fund.
Math., 3, 133-181.
5. Brouwer, L.E.J. (1912), Uber abbidungen vom mannigfaltikeiten, Math., Ann. 71, 97-115.
6. Choudhury, B.S. (2005), A common unique fixed point result in metric spaces involving generalized altering
distances, Math. Commun. 10, 105-110.
7. Delbosco, D. (1976-77), Unestensione di un teorema sul punto di S. Reich, Rend. Sem. Univers.Politecn.Torino,
35, 233-238.
8. Dutta, P.N., Choudhury, B.S. (2008), A generalization of contraction principles in metric spaces, Fixed Point
Theory Appl., 8 Article ID 406368.
9. Fisher, B. (1979), A common fixed point theorem for commuting mappings, Math. Sem. Notes, 7, 297-300.
78 P. L. Powar

& G. R. K. Sahu
10. Khan, M.S., Swalesh, M., Sessa, S. (1984), Fixed point theorems by altering distances between the points. Bull.
Aust. Math. Soc. 30, 1-9.
11. Kreyszig, E. (1989), Introdutory Functional Analysis With Applications, John Wiley & Sons(Asia) Pte Ltd. Wiley
Classics Library Edition Published.
12. Morales, J. R., Rojes, E. (2012), Some fixed point theorems by altering distance functions. Palestine Journal of
Mathematics.Vol.1(2),110-116.
13. Poincare, H. (1886), Sur les courbes defines par les equations differentielles, Journ de Math. 2.
14. ORegan, D., Petrusel, A. (2008), Fixed point theorems for generalize contractions in ordered metric spaces. J.
Math. Anal Appl. 341, 1241-1252.
15. Rao, K.P.R., Babu, A. Som, Babu, D. Vasu (2007), Common fixed points through Generalized altering distance
function. Intenational mathematical forum, 2, no.65, 3233-3239.
16. Rhoades, B.E. (2001), Some theorems on weakly contractive maps, Nonlinear Anal, 47, 2683-2693.
17. Sastry, K.P.R., Babu,G.V.R. (1999), Some fixed point theorems by altering distances between the points, Indian
J. Pure Appl. Math. 30(6), 641-647.
18. Zhang, Q., Song, Y. (2009), Fixed point theory for generalized weakly contraction. Appl. Math. Lett. 22, 75-
78.