SlideShare a Scribd company logo
Network and Complex Systems                                                                  www.iiste.org
ISSN 2224-610X (Paper) ISSN 2225-0603 (Online)
Vol 1, No.1, 2011


       Fixed Point Theorem Of Discontinuity And Weak
    Compatibility In Non complete Non-Archimedean Menger
                          PM-Spaces
                                              Pooja Sharma (Corresponding author)
                                        Career College, Barkatullah University
                                      M.I.G-9 sector 4B Saket Nager Bhopal, India
                        Tel: +919301030702            E-mail: poojasharma020283@gmail.com


                                                          R.S.Chandel
                                  Govt. Geetanjali College, Barkatullah University
                                                Tulsi Nager, Bhopal, India
                           Tel: +919425650235             E-mail: rschandel_2009@yahoo.com
Abstract
The aim of this paper is to prove a related common fixed point theorem for six weakly compatible self
maps in non complete non-Archimedean menger PM-spaces, without using the condition of continuity and
give a set of alternative conditions in place of completeness of the space.
Keywords: key words, Non-Archimedean Menger PM-space, R-weakly commutting maps, fixed points.
1. Introduction
There have been a number of generalizations of metric spaces, one of them is designated as Menger space
propounded by Menger in 1972. In 1976, Jungck established common fixed point theorems for commuting
maps generalizing the Banach’s fixed point theorem. Sessa (1982) defined a generalization of commutativity
called weak commutativity. Futher Jungck (1986) introduced more generalized commutativity, which is
called compatibility. In 1998, Jungck & Rhodes introduced the notion of weakly compatible maps and
showed that compatible maps are weakly compatible but converse need not true. Sharma & Deshpande
(2006) improved the results of Sharma & Singh (1982), Cho (1997), Sharma & Deshpande (2006). Chugh
and Kumar (2001) proved some interesting results in metric spaces for weakly compatible maps without
appeal to continuity. Sharma and deshpande (2006) proved some results in non complete Menger spaces, for
weakly compatible maps without appeal to continuity. In this Paper, we prove a common fixed point theorem
for six maps has been proved using the concept of weak compatibility without using condition of continuity.
We will improve results of Sharma & Deshpande (2006) and many others.
Preliminary notes
Definition 1.1 Let X be any nonempty set and D be the set of all left continuous distribution functions. An
order pair (X, F) is called a non-Archimedean probabilistic metric space, if F is a mapping from X × X
Into D satisfying the following conditions
    (i)        F x , y(t) = 1 for every t > 0 if and only if x = y,
    (ii)       F x , y(0) = 0 for x, y ∈ X
    (iii)      F x , y(t) =   F   y   , x(t) for every x, y     ∈ X
    (iv)       If    F x , y (t 1 ) = 1 and       F   y    , z(t 2 ) = 1,
            Then    F x , z(max{t 1 , t 2 }) = 1 for every x, y, z ∈ X,
Definition 1.2 A Non- Archimedean Manger PM-space is an order triple (X, F, ∆ ), where ∆ is a t-norm
Page | 33
www.iiste.org
Network and Complex Systems                                                                                                        www.iiste.org
ISSN 2224-610X (Paper) ISSN 2225-0603 (Online)
Vol 1, No.1, 2011

and (X, F) is a Non-Archimedean PM-space satisfying the following condition.
      (v)       F x , z (max{         t ,t
                                        1    2
                                                 }       ≥ ∆ (F x , y ( t 1 ), F     y   , z(   t   2
                                                                                                      ≥ 0.
                                                                                                        )) for x,y,z   ∈ X and     t ,t
                                                                                                                                     1    2
The concept of neighborhoods in Menger PM-spaces was introduced by Schwizer-Skla (1983). If x ∈ X, t >
0 and λ ∈ (0, 1), then and ( ∈, λ )-neighborhood of x, denoted by U x ( ε , λ ) is defined by
                U x ( ε , λ ) = {y ∈ X : F y , x(t) > 1- λ }
If the t-norm ∆ is continuous and strictly increasing then (X, F, ∆ ) is a Hausdorff space in the topology
induced by the family {U x (t, y) : x ∈ X, t > 0, λ ∈ (0, 1)} of neighborhoods .
Definition 1.3 A t-norm is a function ∆ : [0, 1]         × [0, 1] → [0, 1] which is associative,
commutative, non decreasing in each coordinate and ∆ (a, 1) = a for every a ∈ [0, 1].
Definition 1.4 A PM- space (X, F) is said to be of type (C) g if there exists a g ∈ Ω such that
                          g (F x , y(t)) ≤ g (F x , z(t)) + g (F z ,y(t))
for all x, y, z ∈ X and t ≥ 0, where Ω = {g : g [0,1] → [0, ∞ ) is continuous, strictly decreasing, g(1)
= 0 and g(0) > ∞ }.
Definition 1.5 A pair of mappings A and S is called weakly compatible pair if they commute at coincidence
points.
Definition 1.6 Let A, S: X → X be mappings. A and S are said to be compatible if
lim n→∞ g(FASx n , SAx n (t)) = 0
For all t > 0, whenever {x n } is a sequence in X such that lim n→∞ Ax n = lim n→∞                                              Sx n = z for some
z ∈ X.
Definition 1.7  A Non-Archimedean Manger PM-space (X, F, ∆ ) is said to be of type (D) g if there
exists a g ∈ Ω such that
g( ∆ (S, t) ≤                        ∈ [0, 1].
                   g(S) + g(t)) for all S, t
Lemma 1.1 If a function φ : [0, + ∞ ) → [0,- ∞ ) satisfying the condition
                                       ( ∅ ), then we have

                            ≥ 0, lim n→∞ φ (t) 0, where               φ
                                                     n                    n
      (1)   For all t                                                         (t) is the n-th iteration of             φ (t).

      (2)   If {   t   n
                           } is non-decreasing sequence real numbers and                            t   n +1
                                                                                                               ≤ φ ( t n ), n = 1,2,….., then

            lim n→∞        t   n
                                   = 0. In particular, if       t ≤   φ (t) for all t ≥         0, then t = 0.


Lemma 1.2 Let {y n } be a sequence in X such that lim n→∞ F                          y   n
                                                                                             y n+1 (t) = 1 for all t > 0.


If the sequence {y n } is not a Cauchy sequence in X, then there exit                           ε0        > 0,   t0 > 0, two sequences

{ mi }, { ni } of positive integers such that


(1)   mi > ni +1, ni → ∞ as i → ∞ ,

(2) F y mi , y ni (t 0 ) < 1-         ε0    and F y mi - 1, y ni (t 0 ) ≥ 1-         ε 0 , i = 1,2,….
Main Results

Page | 34
www.iiste.org
Network and Complex Systems                                                                           www.iiste.org
ISSN 2224-610X (Paper) ISSN 2225-0603 (Online)
Vol 1, No.1, 2011

Theorem 2.1          :   Let A, B, S, T, P and Q be a mappings from X into itself such that
      (i)       P(X) ⊂ AB(X), Q(X)         ⊂ ST(X)
      (ii)      g(FPx, Qy(t))      ≤ φ [max{g(FABy, STx(t)), g(FPx, STx(t)), g(FQy, ABy(t)), g(FQy, STx(t)),
                g(FPx, ABy(t))}]

               (for all x, y ∈ X and t>0, where a function      φ :[0,+ ∞ ) → [0,+ ∞ ) satisfies the condition ( ∅ ).
      (iii)     A(X) or B(X) is complete subspace of X, then
       (a)      P and ST have a coincidence point.
       (b)      Q and AB have a coincidence point.
Further, if
      (iv)      The pairs (P, ST) and (Q, AB) are R-weakly compatible then A,B,S,T,P and Q have a unique
                common fixed point.
Proof: Since P(X) ⊂ AB(X) for any x0 ∈ X, there exists a point x1 ∈ X , Such that P x0 =AB x1 . Since
Q(X) ⊂ ST(X) for this point x1 ,we can choose a point x2 ∈ X such that B x1 =S x 2 and so on..
Inductively, we can define a sequence { yn } in X such that y2n =P x2n =AB x2 n+1 and
 y2 n+1 =Q x2 n+1 =ST x2 n+ 2 , for n=1,2,3……..
Before proving our main theorem we need the following :
Lemma 2.2: Let A,B,S,T,P,Q :X → X be mappings satisfying the condition (i) and (ii).
Then the sequence { yn } define above, such that

               lim       g(F   yn , yn+1 (t)) = 0,    For all t>0 is a Cauchy sequence in X.
               n→∞

 Proof of Lemma 2.2: Since g ∈ Ω , it follows that


               lim F yn , yn+1 (t) = 1 for all t>0 if and only if
               n→∞


               lim g(F yn , yn+1 (t)) = 0 for all t>0. By Lemma 1.2, if { yn } is not a Cauchy sequence in X,
               n→∞


there exists   ∈0 >0, t>0, two sequence { mi },{ ni }of positive integers such that

(A)   mi > ni +1, and ni → ∞ as i → ∞ ,

(B) (Fy mi ,y ni ( t0 )) > g(1- ∈0 ) and g(Fy mi +1 ,y ni ( t0 ))   ≤ g(1- ∈0 ), i=1,2,3……
Thus we have




                  g(1- ∈0 )      < (Fy mi ,y ni ( t0 ))


Page | 35
www.iiste.org
Network and Complex Systems                                                                            www.iiste.org
ISSN 2224-610X (Paper) ISSN 2225-0603 (Online)
Vol 1, No.1, 2011


                                ≤ g(Fy mi , ymi−1 ( t0 )) + g(F ymi−1 ,y ni ( t0 ))

(v)                               ≤ g(1- ∈0 ) + g(F ymi , ymi−1 ( t0 ))

Thus i → ∞ in (v), we have

(vi)                    lim g(F ymi , y ni ( t0 )) = g(1- ∈0 ).
                        n→∞

On the other hand, we have

(vii)              g(1- ∈0 ) < g(F   ymi , y ni ( t0 ))

                              ≤ g(F yni , yni+1 ( t0 ) ) + g(F yni+1 , ymi ( t0 ) ).

Now, consider g(F yni+1 , ymi ( t0 ) ) in (vii. Without loss generality, assume that both      ni and mi are even.
Then by (ii), we have

g(F    yni+1, ymi ( t0 )) = g(FP xmi , Q xni+1 ( t0 ))

  ≤ ∅ [max{g(FST xmi , AB xni+1 ( t0 )) , g(FST xmi , P xmi ( t0 )) , g(FAB xni+1 , Q xni+1 ( t0 )) ,

g(FST xmi , Q xni +1 ( t0 )) , g(FAB xni+1 , P xmi ( t0 ))}]


(viii) = ∅ [max{g(Fy mi−1 ,y ni ( t0 )), g(Fy mi −1 , y mi ( t0 )), g(Fy ni ,y ni+1 ( t0 )), g(Fy mi −1 ,y ni+1 ( t0 )),


g(Fy ni , y mi ( t0 )) }]

Using (vi),(vii),(viii) and letting i → ∞ n(viii), we have

g(1- ∈0 )    ≤ ∅ [max{g(1- ∈0 ), 0, 0, g(1- ∈0 ), g(1- ∈0 )}]

              = ∅ (g(1- ∈0 ))


              < g(1- ∈0 ),

This is a contradiction. Therefore {y n } is a Cauchy sequence in X.

Proof of the Theorem 2.1: If we prove lim n → ∞ g(Fy n , y ni+1 (t)) = 0 for all t>0, Then by Lemma(2.2)

the sequence {y n } define above is a Cauchy sequence in X.


Now, we prove lim n → ∞ g(Fy n , y n + 1 (t)) = 0 for all t > 0. In fact by (ii), we have

g(Fy 2 n , y 2 n+1 (t)) = g(FP X 2 n , Q X 2 n+1 (t))

Page | 36
www.iiste.org
Network and Complex Systems                                                                                     www.iiste.org
ISSN 2224-610X (Paper) ISSN 2225-0603 (Online)
Vol 1, No.1, 2011


                          ≤ ∅ [max {g(FST X 2n , AB X 2n , AB X 2 n+1 (t)), g(FST X 2n ,P X 2n (t)),

                              g(FAB X 2 n+1 , Q X 2 n+1 (t)), g(F X 2n , Q X 2 n +1 (t)), g(FAB X n +1 ,P X 2n (t))}]


                          = ∅ [max{g(Fy 2 n−1 , y 2n (t)), g(Fy 2 n−1 , y 2n (t)), g(Fy 2n ,y 2 n + 1 (t)),


                              g(Fy 2 n − 1 , y 2 n+1 (t))}],


                            = ∅ [max{g(Fy 2 n−1 , y 2n (t)), g(Fy 2 n−1 , y 2n (t)), g(Fy 2n ,y 2 n + 1 (t)),


                                         g(Fy 2 n − 1 , y 2n (t)) + g(Fy 2n ,y 2 n + 1 (t)), 0}]


 If g(Fy 2 n−1 , y 2n (t)     ≤ g(Fy 2n ,y 2 n + 1 (t) for all t > 0, then we have

    g(Fy 2n ,y 2 n + 1 (t))    ≤ ∅ g(Fy 2n ,y 2n ,y 2 n + 1 (t)),

Which means that,by Lemma 1.1,                 g(Fy 2n ,y 2 n + 1 (t)) = 0 for all t >0.

Similarly, we have g(Fy 2n ,y 2 n + 1 (t)) = 0 for all t > 0. Thus we have                 lim n → ∞ g(Fy n , y n + 1 (t)) = 0

for all t > 0. On the othr hand, if g(Fy 2 n − 1 , y 2n (t))                 ≥ g(Fy 2n ,y 2 n + 1 (t)), then by (ii), we have

g(Fy 2n ,y 2 n + 1 (t))   ≤ g(Fy 2 n − 1 , y 2n (t)), for t > 0.

 Similarly, g(Fy 2 n + 1 ,y 2 n+2 (t))      ≤ g(Fy 2n , y 2 n+1 (t)) for all t > 0 .

 g(Fy n , y n + 1 (t)) ≤ g(Fy n − 1 ,y n (t)), for all t >0 and n= 1,2,3,…….
Therefore by Lemma (1.1)
lim n → ∞ g(Fy n , y n + 1 (t)) = 0 for all t > 0, which implies that {y n } is a Cauchy sequence in X.
Now suppose that ST(X) is a complete. Note that the subsequence {y n + 1 } is contained in ST(X) and a
                                                  −1
limit in ST(X) . Call it z. Let p ∈ (ST)               z.

We shall use that fact that the subsequence {y 2 n } also converges to z. By (ii), we have


g(FP p , y 2 n+1 (kt)) = g(FP p ,Qx 2 n+1 (kt))


                           ≤ ∅ [max{g(FST p , ABx 2 n+1 (t)), g(FST p , P p (t)), g(FAB x2 n+1 , Q x2 n+1 (t)),

g(FST    p , Q x2 n+1 (t)), g(FAB x2 n+1 , P p (t))}]

 = ∅ [max{FST        p , y2 n (t),g(FST p ,P p (t)), g(F y2 n , y2 n+1 (t)), g(F ST p , y2 n+1 (t)), g(F y2 n , P p (t))}]

Page | 37
www.iiste.org
Network and Complex Systems                                                                          www.iiste.org
ISSN 2224-610X (Paper) ISSN 2225-0603 (Online)
Vol 1, No.1, 2011

Taking the limit      n → ∞ , we obtain
g(FP p , z(kt)) ≤ ∅ [max{g(Fz, z(t)), g(Fz, P p (t)), g(Fz, z(t), g(Fz, z(t)), g(Fz, P p (t))}]


                   < ∅ (g(FP p , z(t))),

For all t>0,which means that P p = z and therefore, P p =           ST p =z, i.e. p is a coincidence point of P
and ST. This proves (i). Since P(X) ⊂ AB(X) and , P p = z implies that z ∈ AB(X).
                 −1
Let q ∈ (AB)       z. Then q = z.
It can easily be verified by using similar arguments of the previous part of the proof that Qq = z.
If we assume that ST(X) is complete then argument analogous to the previous completeness argument
establishes (i) and (ii).
The remaining two cases pertain essentially to the previous cases. Indeed, if B(X) is complete, then by (2.1),
z ∈ Q(X) ⊂ ST(X).
Similarly if P(X) ⊂ AB(X). Thus (i) and (ii) are completely established.
Since the pair {P, ST} is weakly compatible therefore P and ST commute at their coincidence point i.e.
PST p = STP p or Pz = STz. Similarly QABq = ABQq or Qz = ABz.
Now, we prove that Pz = z by (2.2) we have

g(FPz,   y2 n+1 (t)) = g(FPz, Q x2 n+1 (t))

                      ≤ ∅ [max{g(FSTz, AB x2 n+1 )), g(FSTz, Pz(t)), g(FAB x2 n+1 , Q x2 n+1 (t)),

                 g(FSTz , Q x2 n+1 (t)), g(FST x2 n+1 , Pz(t))}].

By letting   n → ∞ , we have
    g(FPz , z(t)) ≤ ∅ [max{g(FPz, z(t)), g(FPz, Pz(t)), g(Fz, z(t)), g(FPz, Pz(t)), g(Fz, Pz(t))}],
Which implies that Pz =z =STz.
This means that z is a common fixed point of A,B, S, T, P, Q. This completes the proof.
Acknowledgment: The author is thankful to the referees for giving useful suggestions and comments for
the improvement of this paper.
References
Chang S.S.(1990) “Fixed point theorems for single-valued and           multivalued mappings in
non-Archimedean Menger probabilistic metric spaces”, Math. Japonica 35(5), 875-885

Chang S.S., Kang S. and Huang N.(1991), “Fixed point theorems for mappings in probabilistic metric
spaces with applications”, J. of Chebgdu Univ. of Sci. and Tech. 57(3), 1-4.

Cho Y.J., Ha H.S. and Chang S.S.(1997) “Common fixed point theorems for compatible mappings of
type (A) in non-Archimedean Menger PM-spaces”, Math. Japonica 46(1), 169-179.

Chugh R. and Kumar S.(2001) “Common fixed points for weakly compatible maps”, Proc. Indian
Page | 38
www.iiste.org
Network and Complex Systems                                                                www.iiste.org
ISSN 2224-610X (Paper) ISSN 2225-0603 (Online)
Vol 1, No.1, 2011

Acad. Sci. 111(2), 241-247.

Hadzic O.(1980) “A note on I. Istratescu’s fixed theorem in non-Archimedean Menger Spaces”, Bull.
Math. Soc. Sci. Math. Rep. Soc. Roum. T. 24(72), 277-280,

Jungck G. and Peridic(1979), “fixed points and commuting mappings”, Proc. Amer Math. Soc. 76,
333-338.

Jungck G.. (1986) “Compatible mappings and common fixed points”, Internat, J. Math. Sci. 9(4),
771-779.

Jungck G., Murthy P.P. and Cho Y.J.(1993) “Compatible mappings of type(A) and common fixed
points”, Math.. Japonica 38(2), 381-390.

Jungck G. and Rhoades B.E.(1998) “Fixed point for set valued functions without continuity “,ind. J.
Pure Appl, Math. 29(3),227-238,.

Menger K.(1942) “Statistical metrices”; Proc. Nat. Acad. Sci. Usa 28, 535-537.

Pant R.P. (1999), “R-weak commutativity and common fixed points”, Soochow J. Math. 25(1),37-42.

Sessa S.(1982) “On a weak commutativity condition of Mappings n fixed point considerations”, Publ.
Inst. Math. Beograd 32(46), 146-153.

Sharma Sushil and Singh Amaedeep (1982) “Common fixed point for weak compatible”,             Publ. Inst.
Math. Beograd 32(46), 146-153.

Sharma Sushil and Deshpande Bhavana (2006) “Discontinuity and weak compatibility in fixed point
consideration in noncomplete non-archimedean menger PM-spaces”;J. Bangladesh Aca. Sci.
30(2),189-201.

Singh S.L. and Pant B.D..(1988),” Coincidence and fixed point theorems for a family of mappings on
Menger spaces and extension to Uniformspaces”, math. Japonica 33(6), 957-973.

Shweizer. B. and Sklar, A(1983). “Probabilistic metric spaces”; Elsevier, North Holland.




Page | 39
www.iiste.org
International Journals Call for Paper
The IISTE, a U.S. publisher, is currently hosting the academic journals listed below. The peer review process of the following journals
usually takes LESS THAN 14 business days and IISTE usually publishes a qualified article within 30 days. Authors should
send their full paper to the following email address. More information can be found in the IISTE website : www.iiste.org

Business, Economics, Finance and Management               PAPER SUBMISSION EMAIL
European Journal of Business and Management               EJBM@iiste.org
Research Journal of Finance and Accounting                RJFA@iiste.org
Journal of Economics and Sustainable Development          JESD@iiste.org
Information and Knowledge Management                      IKM@iiste.org
Developing Country Studies                                DCS@iiste.org
Industrial Engineering Letters                            IEL@iiste.org


Physical Sciences, Mathematics and Chemistry              PAPER SUBMISSION EMAIL
Journal of Natural Sciences Research                      JNSR@iiste.org
Chemistry and Materials Research                          CMR@iiste.org
Mathematical Theory and Modeling                          MTM@iiste.org
Advances in Physics Theories and Applications             APTA@iiste.org
Chemical and Process Engineering Research                 CPER@iiste.org


Engineering, Technology and Systems                       PAPER SUBMISSION EMAIL
Computer Engineering and Intelligent Systems              CEIS@iiste.org
Innovative Systems Design and Engineering                 ISDE@iiste.org
Journal of Energy Technologies and Policy                 JETP@iiste.org
Information and Knowledge Management                      IKM@iiste.org
Control Theory and Informatics                            CTI@iiste.org
Journal of Information Engineering and Applications       JIEA@iiste.org
Industrial Engineering Letters                            IEL@iiste.org
Network and Complex Systems                               NCS@iiste.org


Environment, Civil, Materials Sciences                    PAPER SUBMISSION EMAIL
Journal of Environment and Earth Science                  JEES@iiste.org
Civil and Environmental Research                          CER@iiste.org
Journal of Natural Sciences Research                      JNSR@iiste.org
Civil and Environmental Research                          CER@iiste.org


Life Science, Food and Medical Sciences                   PAPER SUBMISSION EMAIL
Journal of Natural Sciences Research                      JNSR@iiste.org
Journal of Biology, Agriculture and Healthcare            JBAH@iiste.org
Food Science and Quality Management                       FSQM@iiste.org
Chemistry and Materials Research                          CMR@iiste.org


Education, and other Social Sciences                      PAPER SUBMISSION EMAIL
Journal of Education and Practice                         JEP@iiste.org
Journal of Law, Policy and Globalization                  JLPG@iiste.org                       Global knowledge sharing:
New Media and Mass Communication                          NMMC@iiste.org                       EBSCO, Index Copernicus, Ulrich's
Journal of Energy Technologies and Policy                 JETP@iiste.org                       Periodicals Directory, JournalTOCS, PKP
Historical Research Letter                                HRL@iiste.org                        Open Archives Harvester, Bielefeld
                                                                                               Academic Search Engine, Elektronische
Public Policy and Administration Research                 PPAR@iiste.org                       Zeitschriftenbibliothek EZB, Open J-Gate,
International Affairs and Global Strategy                 IAGS@iiste.org                       OCLC WorldCat, Universe Digtial Library ,
Research on Humanities and Social Sciences                RHSS@iiste.org                       NewJour, Google Scholar.

Developing Country Studies                                DCS@iiste.org                        IISTE is member of CrossRef. All journals
Arts and Design Studies                                   ADS@iiste.org                        have high IC Impact Factor Values (ICV).

More Related Content

PDF
Complete l fuzzy metric spaces and common fixed point theorems
PDF
Nokton theory-en
PDF
Research Inventy : International Journal of Engineering and Science
PDF
PaperNo13-Habibi-IMF
PDF
On fixed point theorems in fuzzy metric spaces in integral type
PDF
NONLINEAR DIFFERENCE EQUATIONS WITH SMALL PARAMETERS OF MULTIPLE SCALES
PDF
Welcome to International Journal of Engineering Research and Development (IJERD)
PDF
Reformulation of Nash Equilibrium with an Application to Interchangeability
Complete l fuzzy metric spaces and common fixed point theorems
Nokton theory-en
Research Inventy : International Journal of Engineering and Science
PaperNo13-Habibi-IMF
On fixed point theorems in fuzzy metric spaces in integral type
NONLINEAR DIFFERENCE EQUATIONS WITH SMALL PARAMETERS OF MULTIPLE SCALES
Welcome to International Journal of Engineering Research and Development (IJERD)
Reformulation of Nash Equilibrium with an Application to Interchangeability

What's hot (20)

PDF
Coincidence points for mappings under generalized contraction
PDF
Generalization of Tensor Factorization and Applications
PDF
Optimization Approach to Nash Euilibria with Applications to Interchangeability
PDF
Advanced Microeconomics - Lecture Slides
PDF
somenath_fixedpoint_dasguptaIMF17-20-2013
DOC
Chapter 3 (maths 3)
PDF
Fixed Point Results In Fuzzy Menger Space With Common Property (E.A.)
PDF
11.[104 111]analytical solution for telegraph equation by modified of sumudu ...
PDF
Fourier series
PDF
Random Matrix Theory and Machine Learning - Part 2
PDF
On fixed point theorems in fuzzy metric spaces
PDF
On estimating the integrated co volatility using
PDF
Random Matrix Theory and Machine Learning - Part 3
PDF
tensor-decomposition
PDF
An Altering Distance Function in Fuzzy Metric Fixed Point Theorems
PPTX
senior seminar
PDF
Random Matrix Theory and Machine Learning - Part 1
PDF
Random Matrix Theory and Machine Learning - Part 4
PDF
Common fixed theorems for weakly compatible mappings via an
PDF
computational stochastic phase-field
Coincidence points for mappings under generalized contraction
Generalization of Tensor Factorization and Applications
Optimization Approach to Nash Euilibria with Applications to Interchangeability
Advanced Microeconomics - Lecture Slides
somenath_fixedpoint_dasguptaIMF17-20-2013
Chapter 3 (maths 3)
Fixed Point Results In Fuzzy Menger Space With Common Property (E.A.)
11.[104 111]analytical solution for telegraph equation by modified of sumudu ...
Fourier series
Random Matrix Theory and Machine Learning - Part 2
On fixed point theorems in fuzzy metric spaces
On estimating the integrated co volatility using
Random Matrix Theory and Machine Learning - Part 3
tensor-decomposition
An Altering Distance Function in Fuzzy Metric Fixed Point Theorems
senior seminar
Random Matrix Theory and Machine Learning - Part 1
Random Matrix Theory and Machine Learning - Part 4
Common fixed theorems for weakly compatible mappings via an
computational stochastic phase-field
Ad

Viewers also liked (10)

PDF
Creacion de un infocentro en el sector la mariquita
PDF
Moro e kennedy due destini paralleli
PPT
T72 Medium Tank Destroyed by Top-Attack Missile
PPT
No More BS Tent Cities!
PDF
Il buco nero dei cecchini di Kiev.
PDF
Progressisti in divisa,pacifisti in guerra gli inganni di Avaaz.
PDF
La grande mano di soros & co. nel disordine ucraino.
PDF
Contribuir en el proceso de aprendizaje de las ciencias de la tierra de los n...
PDF
Creacion de una pagina web para el consejo comunal del sector la mariquita
PPTX
Los factores bióticos y abióticos y su influencia 1
Creacion de un infocentro en el sector la mariquita
Moro e kennedy due destini paralleli
T72 Medium Tank Destroyed by Top-Attack Missile
No More BS Tent Cities!
Il buco nero dei cecchini di Kiev.
Progressisti in divisa,pacifisti in guerra gli inganni di Avaaz.
La grande mano di soros & co. nel disordine ucraino.
Contribuir en el proceso de aprendizaje de las ciencias de la tierra de los n...
Creacion de una pagina web para el consejo comunal del sector la mariquita
Los factores bióticos y abióticos y su influencia 1
Ad

Similar to 11.fixed point theorem of discontinuity and weak compatibility in non complete non archimedean menger pm-spaces (20)

PDF
A common fixed point of integral type contraction in generalized metric spacess
PDF
11.[29 35]a unique common fixed point theorem under psi varphi contractive co...
PDF
Common fixed point theorems of integral type in menger pm spaces
PDF
11.a common fixed point theorem for compatible mapping
PDF
A common fixed point theorem for compatible mapping
PDF
Hk3114251433
PDF
Common fixed point for two weakly compatible pairs ...
PDF
Fixed point result in probabilistic metric space
PDF
IRJET- Common Fixed Point Results in Menger Spaces
PDF
Notes
PDF
International Journal of Computational Engineering Research(IJCER)
PDF
11.a focus on a common fixed point theorem using weakly compatible mappings
PDF
A focus on a common fixed point theorem using weakly compatible mappings
PDF
Fixed points of contractive and Geraghty contraction mappings under the influ...
PDF
International Journal of Mathematics and Statistics Invention (IJMSI)
PDF
Common fixed point theorems for random operators in hilbert space
PDF
The International Journal of Engineering and Science (IJES)
PDF
A common fixed point theorems in menger space using occationally weakly compa...
PDF
A common fixed point theorems in menger space using occationally weakly compa...
PDF
A common unique random fixed point theorem in hilbert space using integral ty...
A common fixed point of integral type contraction in generalized metric spacess
11.[29 35]a unique common fixed point theorem under psi varphi contractive co...
Common fixed point theorems of integral type in menger pm spaces
11.a common fixed point theorem for compatible mapping
A common fixed point theorem for compatible mapping
Hk3114251433
Common fixed point for two weakly compatible pairs ...
Fixed point result in probabilistic metric space
IRJET- Common Fixed Point Results in Menger Spaces
Notes
International Journal of Computational Engineering Research(IJCER)
11.a focus on a common fixed point theorem using weakly compatible mappings
A focus on a common fixed point theorem using weakly compatible mappings
Fixed points of contractive and Geraghty contraction mappings under the influ...
International Journal of Mathematics and Statistics Invention (IJMSI)
Common fixed point theorems for random operators in hilbert space
The International Journal of Engineering and Science (IJES)
A common fixed point theorems in menger space using occationally weakly compa...
A common fixed point theorems in menger space using occationally weakly compa...
A common unique random fixed point theorem in hilbert space using integral ty...

More from Alexander Decker (20)

PDF
Abnormalities of hormones and inflammatory cytokines in women affected with p...
PDF
A validation of the adverse childhood experiences scale in
PDF
A usability evaluation framework for b2 c e commerce websites
PDF
A universal model for managing the marketing executives in nigerian banks
PDF
A unique common fixed point theorems in generalized d
PDF
A trends of salmonella and antibiotic resistance
PDF
A transformational generative approach towards understanding al-istifham
PDF
A time series analysis of the determinants of savings in namibia
PDF
A therapy for physical and mental fitness of school children
PDF
A theory of efficiency for managing the marketing executives in nigerian banks
PDF
A systematic evaluation of link budget for
PDF
A synthetic review of contraceptive supplies in punjab
PDF
A synthesis of taylor’s and fayol’s management approaches for managing market...
PDF
A survey paper on sequence pattern mining with incremental
PDF
A survey on live virtual machine migrations and its techniques
PDF
A survey on data mining and analysis in hadoop and mongo db
PDF
A survey on challenges to the media cloud
PDF
A survey of provenance leveraged
PDF
A survey of private equity investments in kenya
PDF
A study to measures the financial health of
Abnormalities of hormones and inflammatory cytokines in women affected with p...
A validation of the adverse childhood experiences scale in
A usability evaluation framework for b2 c e commerce websites
A universal model for managing the marketing executives in nigerian banks
A unique common fixed point theorems in generalized d
A trends of salmonella and antibiotic resistance
A transformational generative approach towards understanding al-istifham
A time series analysis of the determinants of savings in namibia
A therapy for physical and mental fitness of school children
A theory of efficiency for managing the marketing executives in nigerian banks
A systematic evaluation of link budget for
A synthetic review of contraceptive supplies in punjab
A synthesis of taylor’s and fayol’s management approaches for managing market...
A survey paper on sequence pattern mining with incremental
A survey on live virtual machine migrations and its techniques
A survey on data mining and analysis in hadoop and mongo db
A survey on challenges to the media cloud
A survey of provenance leveraged
A survey of private equity investments in kenya
A study to measures the financial health of

Recently uploaded (20)

PDF
Diabetes mellitus diagnosis method based random forest with bat algorithm
PDF
Unlocking AI with Model Context Protocol (MCP)
PDF
Electronic commerce courselecture one. Pdf
PPT
Teaching material agriculture food technology
PDF
Approach and Philosophy of On baking technology
PDF
Empathic Computing: Creating Shared Understanding
PPTX
KOM of Painting work and Equipment Insulation REV00 update 25-dec.pptx
PPTX
Spectroscopy.pptx food analysis technology
DOCX
The AUB Centre for AI in Media Proposal.docx
PPTX
Effective Security Operations Center (SOC) A Modern, Strategic, and Threat-In...
PDF
Advanced methodologies resolving dimensionality complications for autism neur...
PPTX
20250228 LYD VKU AI Blended-Learning.pptx
PDF
Network Security Unit 5.pdf for BCA BBA.
PDF
7 ChatGPT Prompts to Help You Define Your Ideal Customer Profile.pdf
PPTX
VMware vSphere Foundation How to Sell Presentation-Ver1.4-2-14-2024.pptx
PDF
Encapsulation theory and applications.pdf
PDF
Encapsulation_ Review paper, used for researhc scholars
PDF
Chapter 3 Spatial Domain Image Processing.pdf
PPTX
Detection-First SIEM: Rule Types, Dashboards, and Threat-Informed Strategy
PDF
NewMind AI Weekly Chronicles - August'25 Week I
Diabetes mellitus diagnosis method based random forest with bat algorithm
Unlocking AI with Model Context Protocol (MCP)
Electronic commerce courselecture one. Pdf
Teaching material agriculture food technology
Approach and Philosophy of On baking technology
Empathic Computing: Creating Shared Understanding
KOM of Painting work and Equipment Insulation REV00 update 25-dec.pptx
Spectroscopy.pptx food analysis technology
The AUB Centre for AI in Media Proposal.docx
Effective Security Operations Center (SOC) A Modern, Strategic, and Threat-In...
Advanced methodologies resolving dimensionality complications for autism neur...
20250228 LYD VKU AI Blended-Learning.pptx
Network Security Unit 5.pdf for BCA BBA.
7 ChatGPT Prompts to Help You Define Your Ideal Customer Profile.pdf
VMware vSphere Foundation How to Sell Presentation-Ver1.4-2-14-2024.pptx
Encapsulation theory and applications.pdf
Encapsulation_ Review paper, used for researhc scholars
Chapter 3 Spatial Domain Image Processing.pdf
Detection-First SIEM: Rule Types, Dashboards, and Threat-Informed Strategy
NewMind AI Weekly Chronicles - August'25 Week I

11.fixed point theorem of discontinuity and weak compatibility in non complete non archimedean menger pm-spaces

  • 1. Network and Complex Systems www.iiste.org ISSN 2224-610X (Paper) ISSN 2225-0603 (Online) Vol 1, No.1, 2011 Fixed Point Theorem Of Discontinuity And Weak Compatibility In Non complete Non-Archimedean Menger PM-Spaces Pooja Sharma (Corresponding author) Career College, Barkatullah University M.I.G-9 sector 4B Saket Nager Bhopal, India Tel: +919301030702 E-mail: poojasharma020283@gmail.com R.S.Chandel Govt. Geetanjali College, Barkatullah University Tulsi Nager, Bhopal, India Tel: +919425650235 E-mail: rschandel_2009@yahoo.com Abstract The aim of this paper is to prove a related common fixed point theorem for six weakly compatible self maps in non complete non-Archimedean menger PM-spaces, without using the condition of continuity and give a set of alternative conditions in place of completeness of the space. Keywords: key words, Non-Archimedean Menger PM-space, R-weakly commutting maps, fixed points. 1. Introduction There have been a number of generalizations of metric spaces, one of them is designated as Menger space propounded by Menger in 1972. In 1976, Jungck established common fixed point theorems for commuting maps generalizing the Banach’s fixed point theorem. Sessa (1982) defined a generalization of commutativity called weak commutativity. Futher Jungck (1986) introduced more generalized commutativity, which is called compatibility. In 1998, Jungck & Rhodes introduced the notion of weakly compatible maps and showed that compatible maps are weakly compatible but converse need not true. Sharma & Deshpande (2006) improved the results of Sharma & Singh (1982), Cho (1997), Sharma & Deshpande (2006). Chugh and Kumar (2001) proved some interesting results in metric spaces for weakly compatible maps without appeal to continuity. Sharma and deshpande (2006) proved some results in non complete Menger spaces, for weakly compatible maps without appeal to continuity. In this Paper, we prove a common fixed point theorem for six maps has been proved using the concept of weak compatibility without using condition of continuity. We will improve results of Sharma & Deshpande (2006) and many others. Preliminary notes Definition 1.1 Let X be any nonempty set and D be the set of all left continuous distribution functions. An order pair (X, F) is called a non-Archimedean probabilistic metric space, if F is a mapping from X × X Into D satisfying the following conditions (i) F x , y(t) = 1 for every t > 0 if and only if x = y, (ii) F x , y(0) = 0 for x, y ∈ X (iii) F x , y(t) = F y , x(t) for every x, y ∈ X (iv) If F x , y (t 1 ) = 1 and F y , z(t 2 ) = 1, Then F x , z(max{t 1 , t 2 }) = 1 for every x, y, z ∈ X, Definition 1.2 A Non- Archimedean Manger PM-space is an order triple (X, F, ∆ ), where ∆ is a t-norm Page | 33 www.iiste.org
  • 2. Network and Complex Systems www.iiste.org ISSN 2224-610X (Paper) ISSN 2225-0603 (Online) Vol 1, No.1, 2011 and (X, F) is a Non-Archimedean PM-space satisfying the following condition. (v) F x , z (max{ t ,t 1 2 } ≥ ∆ (F x , y ( t 1 ), F y , z( t 2 ≥ 0. )) for x,y,z ∈ X and t ,t 1 2 The concept of neighborhoods in Menger PM-spaces was introduced by Schwizer-Skla (1983). If x ∈ X, t > 0 and λ ∈ (0, 1), then and ( ∈, λ )-neighborhood of x, denoted by U x ( ε , λ ) is defined by U x ( ε , λ ) = {y ∈ X : F y , x(t) > 1- λ } If the t-norm ∆ is continuous and strictly increasing then (X, F, ∆ ) is a Hausdorff space in the topology induced by the family {U x (t, y) : x ∈ X, t > 0, λ ∈ (0, 1)} of neighborhoods . Definition 1.3 A t-norm is a function ∆ : [0, 1] × [0, 1] → [0, 1] which is associative, commutative, non decreasing in each coordinate and ∆ (a, 1) = a for every a ∈ [0, 1]. Definition 1.4 A PM- space (X, F) is said to be of type (C) g if there exists a g ∈ Ω such that g (F x , y(t)) ≤ g (F x , z(t)) + g (F z ,y(t)) for all x, y, z ∈ X and t ≥ 0, where Ω = {g : g [0,1] → [0, ∞ ) is continuous, strictly decreasing, g(1) = 0 and g(0) > ∞ }. Definition 1.5 A pair of mappings A and S is called weakly compatible pair if they commute at coincidence points. Definition 1.6 Let A, S: X → X be mappings. A and S are said to be compatible if lim n→∞ g(FASx n , SAx n (t)) = 0 For all t > 0, whenever {x n } is a sequence in X such that lim n→∞ Ax n = lim n→∞ Sx n = z for some z ∈ X. Definition 1.7 A Non-Archimedean Manger PM-space (X, F, ∆ ) is said to be of type (D) g if there exists a g ∈ Ω such that g( ∆ (S, t) ≤ ∈ [0, 1]. g(S) + g(t)) for all S, t Lemma 1.1 If a function φ : [0, + ∞ ) → [0,- ∞ ) satisfying the condition ( ∅ ), then we have ≥ 0, lim n→∞ φ (t) 0, where φ n n (1) For all t (t) is the n-th iteration of φ (t). (2) If { t n } is non-decreasing sequence real numbers and t n +1 ≤ φ ( t n ), n = 1,2,….., then lim n→∞ t n = 0. In particular, if t ≤ φ (t) for all t ≥ 0, then t = 0. Lemma 1.2 Let {y n } be a sequence in X such that lim n→∞ F y n y n+1 (t) = 1 for all t > 0. If the sequence {y n } is not a Cauchy sequence in X, then there exit ε0 > 0, t0 > 0, two sequences { mi }, { ni } of positive integers such that (1) mi > ni +1, ni → ∞ as i → ∞ , (2) F y mi , y ni (t 0 ) < 1- ε0 and F y mi - 1, y ni (t 0 ) ≥ 1- ε 0 , i = 1,2,…. Main Results Page | 34 www.iiste.org
  • 3. Network and Complex Systems www.iiste.org ISSN 2224-610X (Paper) ISSN 2225-0603 (Online) Vol 1, No.1, 2011 Theorem 2.1 : Let A, B, S, T, P and Q be a mappings from X into itself such that (i) P(X) ⊂ AB(X), Q(X) ⊂ ST(X) (ii) g(FPx, Qy(t)) ≤ φ [max{g(FABy, STx(t)), g(FPx, STx(t)), g(FQy, ABy(t)), g(FQy, STx(t)), g(FPx, ABy(t))}] (for all x, y ∈ X and t>0, where a function φ :[0,+ ∞ ) → [0,+ ∞ ) satisfies the condition ( ∅ ). (iii) A(X) or B(X) is complete subspace of X, then (a) P and ST have a coincidence point. (b) Q and AB have a coincidence point. Further, if (iv) The pairs (P, ST) and (Q, AB) are R-weakly compatible then A,B,S,T,P and Q have a unique common fixed point. Proof: Since P(X) ⊂ AB(X) for any x0 ∈ X, there exists a point x1 ∈ X , Such that P x0 =AB x1 . Since Q(X) ⊂ ST(X) for this point x1 ,we can choose a point x2 ∈ X such that B x1 =S x 2 and so on.. Inductively, we can define a sequence { yn } in X such that y2n =P x2n =AB x2 n+1 and y2 n+1 =Q x2 n+1 =ST x2 n+ 2 , for n=1,2,3…….. Before proving our main theorem we need the following : Lemma 2.2: Let A,B,S,T,P,Q :X → X be mappings satisfying the condition (i) and (ii). Then the sequence { yn } define above, such that lim g(F yn , yn+1 (t)) = 0, For all t>0 is a Cauchy sequence in X. n→∞ Proof of Lemma 2.2: Since g ∈ Ω , it follows that lim F yn , yn+1 (t) = 1 for all t>0 if and only if n→∞ lim g(F yn , yn+1 (t)) = 0 for all t>0. By Lemma 1.2, if { yn } is not a Cauchy sequence in X, n→∞ there exists ∈0 >0, t>0, two sequence { mi },{ ni }of positive integers such that (A) mi > ni +1, and ni → ∞ as i → ∞ , (B) (Fy mi ,y ni ( t0 )) > g(1- ∈0 ) and g(Fy mi +1 ,y ni ( t0 )) ≤ g(1- ∈0 ), i=1,2,3…… Thus we have g(1- ∈0 ) < (Fy mi ,y ni ( t0 )) Page | 35 www.iiste.org
  • 4. Network and Complex Systems www.iiste.org ISSN 2224-610X (Paper) ISSN 2225-0603 (Online) Vol 1, No.1, 2011 ≤ g(Fy mi , ymi−1 ( t0 )) + g(F ymi−1 ,y ni ( t0 )) (v) ≤ g(1- ∈0 ) + g(F ymi , ymi−1 ( t0 )) Thus i → ∞ in (v), we have (vi) lim g(F ymi , y ni ( t0 )) = g(1- ∈0 ). n→∞ On the other hand, we have (vii) g(1- ∈0 ) < g(F ymi , y ni ( t0 )) ≤ g(F yni , yni+1 ( t0 ) ) + g(F yni+1 , ymi ( t0 ) ). Now, consider g(F yni+1 , ymi ( t0 ) ) in (vii. Without loss generality, assume that both ni and mi are even. Then by (ii), we have g(F yni+1, ymi ( t0 )) = g(FP xmi , Q xni+1 ( t0 )) ≤ ∅ [max{g(FST xmi , AB xni+1 ( t0 )) , g(FST xmi , P xmi ( t0 )) , g(FAB xni+1 , Q xni+1 ( t0 )) , g(FST xmi , Q xni +1 ( t0 )) , g(FAB xni+1 , P xmi ( t0 ))}] (viii) = ∅ [max{g(Fy mi−1 ,y ni ( t0 )), g(Fy mi −1 , y mi ( t0 )), g(Fy ni ,y ni+1 ( t0 )), g(Fy mi −1 ,y ni+1 ( t0 )), g(Fy ni , y mi ( t0 )) }] Using (vi),(vii),(viii) and letting i → ∞ n(viii), we have g(1- ∈0 ) ≤ ∅ [max{g(1- ∈0 ), 0, 0, g(1- ∈0 ), g(1- ∈0 )}] = ∅ (g(1- ∈0 )) < g(1- ∈0 ), This is a contradiction. Therefore {y n } is a Cauchy sequence in X. Proof of the Theorem 2.1: If we prove lim n → ∞ g(Fy n , y ni+1 (t)) = 0 for all t>0, Then by Lemma(2.2) the sequence {y n } define above is a Cauchy sequence in X. Now, we prove lim n → ∞ g(Fy n , y n + 1 (t)) = 0 for all t > 0. In fact by (ii), we have g(Fy 2 n , y 2 n+1 (t)) = g(FP X 2 n , Q X 2 n+1 (t)) Page | 36 www.iiste.org
  • 5. Network and Complex Systems www.iiste.org ISSN 2224-610X (Paper) ISSN 2225-0603 (Online) Vol 1, No.1, 2011 ≤ ∅ [max {g(FST X 2n , AB X 2n , AB X 2 n+1 (t)), g(FST X 2n ,P X 2n (t)), g(FAB X 2 n+1 , Q X 2 n+1 (t)), g(F X 2n , Q X 2 n +1 (t)), g(FAB X n +1 ,P X 2n (t))}] = ∅ [max{g(Fy 2 n−1 , y 2n (t)), g(Fy 2 n−1 , y 2n (t)), g(Fy 2n ,y 2 n + 1 (t)), g(Fy 2 n − 1 , y 2 n+1 (t))}], = ∅ [max{g(Fy 2 n−1 , y 2n (t)), g(Fy 2 n−1 , y 2n (t)), g(Fy 2n ,y 2 n + 1 (t)), g(Fy 2 n − 1 , y 2n (t)) + g(Fy 2n ,y 2 n + 1 (t)), 0}] If g(Fy 2 n−1 , y 2n (t) ≤ g(Fy 2n ,y 2 n + 1 (t) for all t > 0, then we have g(Fy 2n ,y 2 n + 1 (t)) ≤ ∅ g(Fy 2n ,y 2n ,y 2 n + 1 (t)), Which means that,by Lemma 1.1, g(Fy 2n ,y 2 n + 1 (t)) = 0 for all t >0. Similarly, we have g(Fy 2n ,y 2 n + 1 (t)) = 0 for all t > 0. Thus we have lim n → ∞ g(Fy n , y n + 1 (t)) = 0 for all t > 0. On the othr hand, if g(Fy 2 n − 1 , y 2n (t)) ≥ g(Fy 2n ,y 2 n + 1 (t)), then by (ii), we have g(Fy 2n ,y 2 n + 1 (t)) ≤ g(Fy 2 n − 1 , y 2n (t)), for t > 0. Similarly, g(Fy 2 n + 1 ,y 2 n+2 (t)) ≤ g(Fy 2n , y 2 n+1 (t)) for all t > 0 . g(Fy n , y n + 1 (t)) ≤ g(Fy n − 1 ,y n (t)), for all t >0 and n= 1,2,3,……. Therefore by Lemma (1.1) lim n → ∞ g(Fy n , y n + 1 (t)) = 0 for all t > 0, which implies that {y n } is a Cauchy sequence in X. Now suppose that ST(X) is a complete. Note that the subsequence {y n + 1 } is contained in ST(X) and a −1 limit in ST(X) . Call it z. Let p ∈ (ST) z. We shall use that fact that the subsequence {y 2 n } also converges to z. By (ii), we have g(FP p , y 2 n+1 (kt)) = g(FP p ,Qx 2 n+1 (kt)) ≤ ∅ [max{g(FST p , ABx 2 n+1 (t)), g(FST p , P p (t)), g(FAB x2 n+1 , Q x2 n+1 (t)), g(FST p , Q x2 n+1 (t)), g(FAB x2 n+1 , P p (t))}] = ∅ [max{FST p , y2 n (t),g(FST p ,P p (t)), g(F y2 n , y2 n+1 (t)), g(F ST p , y2 n+1 (t)), g(F y2 n , P p (t))}] Page | 37 www.iiste.org
  • 6. Network and Complex Systems www.iiste.org ISSN 2224-610X (Paper) ISSN 2225-0603 (Online) Vol 1, No.1, 2011 Taking the limit n → ∞ , we obtain g(FP p , z(kt)) ≤ ∅ [max{g(Fz, z(t)), g(Fz, P p (t)), g(Fz, z(t), g(Fz, z(t)), g(Fz, P p (t))}] < ∅ (g(FP p , z(t))), For all t>0,which means that P p = z and therefore, P p = ST p =z, i.e. p is a coincidence point of P and ST. This proves (i). Since P(X) ⊂ AB(X) and , P p = z implies that z ∈ AB(X). −1 Let q ∈ (AB) z. Then q = z. It can easily be verified by using similar arguments of the previous part of the proof that Qq = z. If we assume that ST(X) is complete then argument analogous to the previous completeness argument establishes (i) and (ii). The remaining two cases pertain essentially to the previous cases. Indeed, if B(X) is complete, then by (2.1), z ∈ Q(X) ⊂ ST(X). Similarly if P(X) ⊂ AB(X). Thus (i) and (ii) are completely established. Since the pair {P, ST} is weakly compatible therefore P and ST commute at their coincidence point i.e. PST p = STP p or Pz = STz. Similarly QABq = ABQq or Qz = ABz. Now, we prove that Pz = z by (2.2) we have g(FPz, y2 n+1 (t)) = g(FPz, Q x2 n+1 (t)) ≤ ∅ [max{g(FSTz, AB x2 n+1 )), g(FSTz, Pz(t)), g(FAB x2 n+1 , Q x2 n+1 (t)), g(FSTz , Q x2 n+1 (t)), g(FST x2 n+1 , Pz(t))}]. By letting n → ∞ , we have g(FPz , z(t)) ≤ ∅ [max{g(FPz, z(t)), g(FPz, Pz(t)), g(Fz, z(t)), g(FPz, Pz(t)), g(Fz, Pz(t))}], Which implies that Pz =z =STz. This means that z is a common fixed point of A,B, S, T, P, Q. This completes the proof. Acknowledgment: The author is thankful to the referees for giving useful suggestions and comments for the improvement of this paper. References Chang S.S.(1990) “Fixed point theorems for single-valued and multivalued mappings in non-Archimedean Menger probabilistic metric spaces”, Math. Japonica 35(5), 875-885 Chang S.S., Kang S. and Huang N.(1991), “Fixed point theorems for mappings in probabilistic metric spaces with applications”, J. of Chebgdu Univ. of Sci. and Tech. 57(3), 1-4. Cho Y.J., Ha H.S. and Chang S.S.(1997) “Common fixed point theorems for compatible mappings of type (A) in non-Archimedean Menger PM-spaces”, Math. Japonica 46(1), 169-179. Chugh R. and Kumar S.(2001) “Common fixed points for weakly compatible maps”, Proc. Indian Page | 38 www.iiste.org
  • 7. Network and Complex Systems www.iiste.org ISSN 2224-610X (Paper) ISSN 2225-0603 (Online) Vol 1, No.1, 2011 Acad. Sci. 111(2), 241-247. Hadzic O.(1980) “A note on I. Istratescu’s fixed theorem in non-Archimedean Menger Spaces”, Bull. Math. Soc. Sci. Math. Rep. Soc. Roum. T. 24(72), 277-280, Jungck G. and Peridic(1979), “fixed points and commuting mappings”, Proc. Amer Math. Soc. 76, 333-338. Jungck G.. (1986) “Compatible mappings and common fixed points”, Internat, J. Math. Sci. 9(4), 771-779. Jungck G., Murthy P.P. and Cho Y.J.(1993) “Compatible mappings of type(A) and common fixed points”, Math.. Japonica 38(2), 381-390. Jungck G. and Rhoades B.E.(1998) “Fixed point for set valued functions without continuity “,ind. J. Pure Appl, Math. 29(3),227-238,. Menger K.(1942) “Statistical metrices”; Proc. Nat. Acad. Sci. Usa 28, 535-537. Pant R.P. (1999), “R-weak commutativity and common fixed points”, Soochow J. Math. 25(1),37-42. Sessa S.(1982) “On a weak commutativity condition of Mappings n fixed point considerations”, Publ. Inst. Math. Beograd 32(46), 146-153. Sharma Sushil and Singh Amaedeep (1982) “Common fixed point for weak compatible”, Publ. Inst. Math. Beograd 32(46), 146-153. Sharma Sushil and Deshpande Bhavana (2006) “Discontinuity and weak compatibility in fixed point consideration in noncomplete non-archimedean menger PM-spaces”;J. Bangladesh Aca. Sci. 30(2),189-201. Singh S.L. and Pant B.D..(1988),” Coincidence and fixed point theorems for a family of mappings on Menger spaces and extension to Uniformspaces”, math. Japonica 33(6), 957-973. Shweizer. B. and Sklar, A(1983). “Probabilistic metric spaces”; Elsevier, North Holland. Page | 39 www.iiste.org
  • 8. International Journals Call for Paper The IISTE, a U.S. publisher, is currently hosting the academic journals listed below. The peer review process of the following journals usually takes LESS THAN 14 business days and IISTE usually publishes a qualified article within 30 days. Authors should send their full paper to the following email address. More information can be found in the IISTE website : www.iiste.org Business, Economics, Finance and Management PAPER SUBMISSION EMAIL European Journal of Business and Management EJBM@iiste.org Research Journal of Finance and Accounting RJFA@iiste.org Journal of Economics and Sustainable Development JESD@iiste.org Information and Knowledge Management IKM@iiste.org Developing Country Studies DCS@iiste.org Industrial Engineering Letters IEL@iiste.org Physical Sciences, Mathematics and Chemistry PAPER SUBMISSION EMAIL Journal of Natural Sciences Research JNSR@iiste.org Chemistry and Materials Research CMR@iiste.org Mathematical Theory and Modeling MTM@iiste.org Advances in Physics Theories and Applications APTA@iiste.org Chemical and Process Engineering Research CPER@iiste.org Engineering, Technology and Systems PAPER SUBMISSION EMAIL Computer Engineering and Intelligent Systems CEIS@iiste.org Innovative Systems Design and Engineering ISDE@iiste.org Journal of Energy Technologies and Policy JETP@iiste.org Information and Knowledge Management IKM@iiste.org Control Theory and Informatics CTI@iiste.org Journal of Information Engineering and Applications JIEA@iiste.org Industrial Engineering Letters IEL@iiste.org Network and Complex Systems NCS@iiste.org Environment, Civil, Materials Sciences PAPER SUBMISSION EMAIL Journal of Environment and Earth Science JEES@iiste.org Civil and Environmental Research CER@iiste.org Journal of Natural Sciences Research JNSR@iiste.org Civil and Environmental Research CER@iiste.org Life Science, Food and Medical Sciences PAPER SUBMISSION EMAIL Journal of Natural Sciences Research JNSR@iiste.org Journal of Biology, Agriculture and Healthcare JBAH@iiste.org Food Science and Quality Management FSQM@iiste.org Chemistry and Materials Research CMR@iiste.org Education, and other Social Sciences PAPER SUBMISSION EMAIL Journal of Education and Practice JEP@iiste.org Journal of Law, Policy and Globalization JLPG@iiste.org Global knowledge sharing: New Media and Mass Communication NMMC@iiste.org EBSCO, Index Copernicus, Ulrich's Journal of Energy Technologies and Policy JETP@iiste.org Periodicals Directory, JournalTOCS, PKP Historical Research Letter HRL@iiste.org Open Archives Harvester, Bielefeld Academic Search Engine, Elektronische Public Policy and Administration Research PPAR@iiste.org Zeitschriftenbibliothek EZB, Open J-Gate, International Affairs and Global Strategy IAGS@iiste.org OCLC WorldCat, Universe Digtial Library , Research on Humanities and Social Sciences RHSS@iiste.org NewJour, Google Scholar. Developing Country Studies DCS@iiste.org IISTE is member of CrossRef. All journals Arts and Design Studies ADS@iiste.org have high IC Impact Factor Values (ICV).