1 Introduction

The concept of fuzzy metric spaces was defined in different ways [13]. Grabiec [4] presented a fuzzy version of the Banach contraction principle in a fuzzy metric space in Kramosi and Michalek’s sense. Fang [5] proved some fixed point theorems in fuzzy metric spaces, which improved, generalized, unified and extended some main results of Edelstein [6], Istratescu [7], Sehgal and Bharucha-Reid [8].

In order to obtain a Hausdorff topology, George and Veeramani [9, 10] modified the concept of fuzzy metric space due to Kramosil and Michalek [11]. Many fixed point theorems in complete fuzzy metric spaces in the sense of George and Veeramani (GV) [9, 10] have been obtained. For example, Singh and Chauhan [12] proved some common fixed point theorems for four mappings in GV fuzzy metric spaces. Gregori and Sapena [13] proved that each fuzzy contractive mapping has a unique fixed point in a complete GV fuzzy metric space, in which fuzzy contractive sequences are Cauchy.

In 2006, Bhaskar and Lakshmikantham [14] introduced the concept of coupled fixed point in metric spaces and obtained some coupled fixed point theorems with the application to a bounded value problem. Based on Bhaskar and Lakshmikantham’s work, many researchers have obtained more coupled fixed point theorems in metric spaces and cone metric spaces; see [14, 15]. Recently, the investigation of coupled fixed point theorems has been extended from metric spaces to probabilistic metric spaces and fuzzy metric spaces; see [1619]. In [18], the authors gave the following results.

Theorem SAS [[18], Theorem 2.5]

Let ab>ab for all a,b[0,1] and let (X,M,) be a complete fuzzy metric space such that M has an n-property. Let F:X×XX and g:XX be two functions such that

M ( F ( x , y ) , F ( u , v ) , k t ) M(gx,gu,t)M(gy,gv,t)

for all x,y,u,vX, where 0<k<1, F(X×X)g(X) and g is continuous and commutes with F. Then there exists a unique xX such that x=gx=F(x,x).

Let Φ={ϕ: R + R + }, where R + =[0,+) and each ϕΦ satisfies the following conditions:

(ϕ-1) ϕ is nondecreasing,

(ϕ-2) ϕ is upper semicontinuous from the right,

(ϕ-3) n = 0 ϕ n (t)<+ for all t>0, where ϕ n + 1 (t)=ϕ( ϕ n (t)), nN.

In [17], Hu proved the following result.

Theorem of Hu [[17], Theorem 1]

Let (X,M,) be a complete fuzzy metric space, whereis a continuous t-norm of H-type. Let F:X×XX and g:XX be two mappings and let there exist ϕΦ such that

M ( F ( x , y ) , F ( u , v ) , ϕ ( t ) ) M(gx,gu,t)M(gy,gv,t)

for all x,y,u,vX, t>0. Suppose that F(X×X)g(X) and that g is continuous, F and g are compatible. Then there exists xX such that x=gx=F(x,x), that is, F and g have a unique common fixed point in X.

In this paper, inspired by Sedghi et al. and Hu’s work mentioned above, we prove some common fixed point theorems for ϕ-contractive mappings in fuzzy metric spaces, in which a very simple condition is imposed on the function ϕ. Our results improve the corresponding ones of Sedghi et al. [18] and Hu [17]. Finally, an example is presented to illustrate the main result in this paper.

2 Preliminaries

Definition 2.1 [9]

A binary operation :[0,1]×[0,1][0,1] is a continuous t-norm if ∗ satisfies the following conditions:

  1. (1)

    ∗ is associative and commutative,

  2. (2)

    ∗ is continuous,

  3. (3)

    a1=a for all a[0,1],

  4. (4)

    abcd whenever ac and bd for all a,b,c,d[0,1].

Two typical examples of the continuous t-norm are a 1 b=ab and a 2 b=min{a,b} for all a,b[0,1].

Definition 2.2 [20]

A t-norm ∗ is said to be of Hadžić type (for short H-type) if the family of functions { m ( t ) } m = 1 is equicontinuous at t=1, where

1 (t)=tt, m + 1 (t)=t ( m ( t ) ) ,m=1,2,,t[0,1].

The t-norm ∗2 is an example of t-norm of H-type, but t-norm ∗1 is not of H-type. Some other t-norm of H-type can be found in [20].

Definition 2.3 (Kramosil and Michalek [11])

A fuzzy metric space (in the sense of Kramosil and Michalek) is a triple (X,M,), where X is a nonempty set, ∗ is a continuous t-norm and M: X 2 ×[0,) is a mapping, satisfying the following:

(KM-1) M(x,y,0)=0 for all x,yX,

(KM-2) M(x,y,t)=1 for all t>0 if and only if x=y,

(KM-3) M(x,y,t)=M(y,x,t) for all x,yX and all t>0,

(KM-4) M(x,y,):[0,)[0,1] is left continuous for all x,yX,

(KM-5) M(x,y,t+s)M(x,z,t)M(y,z,s) for all x,y,zX and all t,s>0.

In Definition 2.3, if M is a fuzzy set on X 2 ×(0,) and (KM-1), (KM-2), (KM-4) are replaced with the following (GV-1), (GV-2), (GV-4), respectively, then (X,M,) is called a fuzzy metric space in the sense of George and Veeramani [9]:

(GV-1) M(x,y,t)>0 for all t>0 and all x,yX,

(GV-2) M(x,y,t)=1 for some t>0 if and only if x=y,

(GV-4) M(x,y,):(0,)[0,1] is continuous.

Lemma 2.1 [4]

Let (X,M,) be a fuzzy metric space in the sense of GV. Then M(x,y,) is nondecreasing for all x,yX.

Definition 2.4 (George and Veeramani [9])

Let (X,M,) be a fuzzy metric space. A sequence { x n } in X is called an M-Cauchy sequence if for each ϵ(0,1) and t>0, there is n 0 N such that M( x n , x m ,t)>1ϵ for all m,n n 0 . The fuzzy metric space (X,M,) is called M-complete if every M-Cauchy sequence is convergent.

Definition 2.5 [14]

An element (x,y)X×X is called a coupled coincidence point of the mappings F:X×XX and g:XX if

F(x,y)=g(x),F(y,x)=g(y).

Here (gx,gy) is called a coupled point of coincidence.

Definition 2.6 [15]

An element xX×X is called a common fixed point of the mappings F:X×XX and g:XX if

F(x,x)=g(x)=x.

Definition 2.7 [17]

Let (X,M,) be a fuzzy metric space. The mappings F and g, where F:X×XX and g:XX, are said to be compatible if for all t>0,

lim n M ( g ( F ( x n , y n ) ) , F ( g ( x n ) , g ( y n ) ) , t ) = 1 and lim n M ( g ( F ( y n , x n ) ) , F ( g ( y n ) , g ( x n ) ) , t ) = 1

whenever { x n } and { y n } are sequences in X such that lim n F( x n , y n )= lim n g( x n )=x and lim n F( x n , y n )= lim n g( x n )=y for some x,yX.

In [21], Abbas et al. introduced the concept of w-compatible mappings. Here we give a similar concept in fuzzy metric spaces as follows.

Definition 2.8 Let (X,M,) be a fuzzy metric space, and let F:X×XX and g:XX be two mappings. F and g are said to be weakly compatible (or w-compatible) if they commute at their coupled coincidence points, i.e., if (x,y) is a coupled coincidence point of g and F, then g(F(x,y))=F(gx,gy).

3 Main results

In this section, the fuzzy metric space (X,M,) is in the sense of GV and the fuzzy metric M is assumed to satisfy the condition sup t > 0 M(x,y,t)=1 for all x,yX.

By using the continuity of ∗ and [[22], Lemma 1], we get the following result.

Lemma 3.1 Let nN, let g n :(0,)(0,), and let F n :R[0,1]. Assume that sup{F(t):t>0}=1 and

lim n g n (t)=0, F n ( g n ( t ) ) 2 n ( F ( t ) ) ,t>0.

If each F n is nondecreasing, then lim n F n (t)=1 for any t>0.

Theorem 3.1 Let (X,M,) be a fuzzy metric space under a continuous t-normof H-type. Let ϕ:(0,)(0,) be a function satisfying that lim n ϕ n (t)=0 for any t>0. Let F:X×XX and g:XX be two mappings with F(X×X)g(X) and assume that for any t>0,

M ( F ( x , y ) , F ( u , v ) , ϕ ( t ) ) M(gx,gu,t)M(gy,gv,t)
(3.1)

for all x,y,u,vX. Suppose that F(X×X) is complete and that g and F are w-compatible, then g and F have a unique common fixed point x X, that is, x =g( x )=F( x , x ).

Proof Since F(X×X)g(X), there exist two sequences { x n } and { y n } in X such that

g x n + 1 =F( x n , y n )andg y n + 1 =F( y n , x n )for all nN{0}.
(3.2)

From (3.1) and (3.2) we have

M ( g x n , g x n + 1 , ϕ ( t ) ) = M ( F ( x n 1 , y n 1 ) , F ( x n , y n ) , ϕ ( t ) ) M ( g x n 1 , g x n , t ) M ( g y n 1 , g y n , t )
(3.3)

and

M ( g y n , g y n + 1 , ϕ ( t ) ) = M ( F ( y n 1 , x n 1 ) , F ( y n , x n ) , ϕ ( t ) ) M ( g y n 1 , g y n , t ) M ( g x n 1 , g x n , t ) .
(3.4)

It follows from (3.3) and (3.4) that

M ( g x n , g x n + 1 , ϕ n ( t ) ) M ( g y n , g y n + 1 , ϕ n ( t ) ) 2 ( M ( g x n 1 , g x n , ϕ n 1 ( t ) ) M ( g y n 1 , g y n , ϕ n 1 ( t ) ) ) 2 n ( M ( g x 0 , g x 1 , t ) M ( g y 0 , g y 1 , t ) ) .

Let E n (t)=M(g x n ,g x n + 1 ,t)M(g y n ,g y n + 1 ,t). Then

E n ( ϕ n ( t ) ) 2 ( E n 1 ( ϕ n 1 ( t ) ) ) 2 n ( E 0 ( t ) ) .

Since ϕ n (t)0 and sup t > 0 E 0 (t)=1, by Lemma 3.1 we have

lim n E n (t)=1.

Noting that min{M(g x n ,g x n + 1 ,t),M(g y n ,g y n + 1 ,t)} E n (t), we get that

lim n M(g x n ,g x n + 1 ,t)= lim n M(g y n ,g y n + 1 ,t)=1,t>0.
(3.5)

For any fixed t>0, since lim n ϕ n (t)=0, there exists n 0 = n 0 (t)N such that ϕ n 0 + 1 (t)< ϕ n 0 (t)<t. Next we show by induction that for any kN{0}, there exists b k N such that

M ( g x n , g x n + k , ϕ n 0 ( t ) ) M ( g y n , g y n + k , ϕ n 0 ( t ) ) b k ( M ( g x n , g x n + 1 , ϕ n 0 ( t ) ϕ n 0 + 1 ( t ) ) M ( g y n , g y n + 1 , ϕ n 0 ( t ) ϕ n 0 + 1 ( t ) ) ) .
(3.6)

It is obvious for k=0 since M(g x n ,g x n , ϕ n 0 (t))=M(g y n ,g y n , ϕ n 0 (t))=1. Assume that (3.6) holds for some kN. Since ϕ n 0 (t) ϕ n 0 + 1 (t)>0, by (KM-5) we have

M ( g x n , g x n + k + 1 , ϕ n 0 ( t ) ) = M ( g x n , g x n + k + 1 , ϕ n 0 ( t ) ϕ n 0 + 1 ( t ) + ϕ n 0 + 1 ( t ) ) M ( g x n , g x n + 1 , ϕ n 0 ( t ) ϕ n 0 + 1 ( t ) ) M ( g x n + 1 , g x n + k + 1 , ϕ n 0 + 1 ( t ) ) .
(3.7)

It follows from (3.1) and (3.6) that

M ( g x n + 1 , g x n + k + 1 , ϕ n 0 + 1 ( t ) ) = M ( F ( x n , y n ) , F ( x n + k , y n + k ) , ϕ n 0 + 1 ( t ) ) M ( g x n , g x n + k , ϕ n 0 ( t ) ) M ( g y n , g y n + k , ϕ n 0 ( t ) ) b k ( M ( g x n , g x n + 1 , ϕ n 0 ( t ) ϕ n 0 + 1 ( t ) ) M ( g y n , g y n + 1 , ϕ n 0 ( t ) ϕ n 0 + 1 ( t ) ) ) .
(3.8)

Now from (3.7) and (3.8) we get

M ( g x n , g x n + k + 1 , ϕ n 0 ( t ) ) M ( g x n , g x n + 1 , ϕ n 0 ( t ) ϕ n 0 + 1 ( t ) ) [ b k ( M ( g x n , g x n + 1 , ϕ n 0 ( t ) ϕ n 0 + 1 ( t ) ) M ( g y n , g y n + 1 , ϕ n 0 ( t ) ϕ n 0 + 1 ( t ) ) ) ] .
(3.9)

Similarly, we have

M ( g y n , g y n + k + 1 , ϕ n 0 ( t ) ) M ( g y n , g y n + 1 , ϕ n 0 ( t ) ϕ n 0 + 1 ( t ) ) [ b k ( M ( g y n , g y n + 1 , ϕ n 0 ( t ) ϕ n 0 + 1 ( t ) ) M ( g x n , g x n + 1 , ϕ n 0 ( t ) ϕ n 0 + 1 ( t ) ) ) ] .
(3.10)

From (3.9) and (3.10) we conclude that

M ( g x n , g x n + k + 1 , ϕ n 0 ( t ) ) M ( g y n , g y n + k + 1 , ϕ n 0 ( t ) ) M ( g x n , g x n + 1 , ϕ n 0 ( t ) ϕ n 0 + 1 ( t ) ) M ( g y n , g y n + 1 , ϕ n 0 ( t ) ϕ n 0 + 1 ( t ) ) [ 2 b k ( M ( g x n , g x n + 1 , ϕ n 0 ( t ) ϕ n 0 + 1 ( t ) ) M ( g y n , g y n + 1 , ϕ n 0 ( t ) ϕ n 0 + 1 ( t ) ) ) ] = 2 b k + 1 ( M ( g x n , g x n + 1 , ϕ n 0 ( t ) ϕ n 0 + 1 ( t ) ) M ( g y n , g y n + 1 , ϕ n 0 ( t ) ϕ n 0 + 1 ( t ) ) ) .

Since b k + 1 =2 b k +1N, this implies that (3.6) holds for k+1. Therefore, there exists b k N such that (3.6) holds for each kN{0}.

Now we prove that {F( x n , y n )} and {F( y n , x n )} are Cauchy sequences in X. Let t>0 and ϵ>0. Since lim n ϕ n (t)=0, there exists n 1 = n 1 (t)N such that ϕ n 1 + 1 (t)< ϕ n 1 (t)<t. Since { n :nN} is equicontinuous at 1 and (1)=1, there is δ>0 such that

if s(1δ,1],then  n (s)>1ϵfor all nN.
(3.11)

By (3.5), one has lim n M(g x n ,g x n + 1 , ϕ n 1 (t) ϕ n 1 + 1 (t))= lim n M(g y n ,g y n + 1 , ϕ n 1 (t) ϕ n 1 + 1 (t))=1. Since ∗ is continuous, there is NN such that for all n>N,

M ( g x n , g x n + 1 , ϕ n 1 ( t ) ϕ n 1 + 1 ( t ) ) M ( g y n , g y n + 1 , ϕ n 1 ( t ) ϕ n 1 + 1 ( t ) ) >1δ.

Hence, by (3.6) (replacing n 0 with n 1 ) and (3.11), we get

M ( g x n , g x n + k , ϕ n 1 ( t ) ) M ( g y n , g y n + k , ϕ n 1 ( t ) ) >1ϵ

for any kN{0}. Since

min { M ( g x n , g x n + k , ϕ n 1 ( t ) ) , M ( g y n , g y n + k , ϕ n 1 ( t ) ) } M ( g x n , g x n + k , ϕ n 1 ( t ) ) M ( g y n , g y n + k , ϕ n 1 ( t ) ) ,

one has

min { M ( g x n , g x n + k , ϕ n 1 ( t ) ) , M ( g y n , g y n + k , ϕ n 1 ( t ) ) } >1ϵ.

By monotonicity of M, we have, for any kN{0},

min { M ( g x n , g x n + k , t ) , M ( g y n , g y n + k , t ) } min { M ( g x n , g x n + k , ϕ n 1 ( t ) ) , M ( g y n , g y n + k , ϕ n 1 ( t ) ) } > 1 ϵ .

Thus {g x n } and {g y n }, i.e., {F( x n , y n )} and {F( y n , x n )} are Cauchy sequences in X. Since F(X×X) is complete and F(X×X)g(X), there exist x ˆ , y ˆ X such that {F( x n , y n )} converges to g x ˆ and {F( y n , x n )} converges to g y ˆ .

Next we prove that g x ˆ =F( x ˆ , y ˆ ) and g y ˆ =F( y ˆ , x ˆ ). Let t>0; since lim n ϕ n (t)=0, there exists n 2 = n 2 (t)N such that ϕ n 2 (ϕ(t))<ϕ(t). By (KM-5) and (3.1), we have

M ( F ( x ˆ , y ˆ ) , g x ˆ , ϕ ( t ) ) M ( F ( x ˆ , y ˆ ) , F ( x n + n 2 , y n + n 2 ) , ϕ n 2 + 1 ( t ) ) M ( F ( x n + n 2 , y n + n 2 ) , g ( x ˆ ) , ϕ ( t ) ϕ n 2 + 1 ( t ) ) M ( g x ˆ , g x n + n 2 , ϕ n 2 ( t ) ) M ( g y ˆ , g y n + n 2 , ϕ n 2 ( t ) ) M ( F ( x n + n 2 , y n + n 2 ) , g ( x ˆ ) , ϕ ( t ) ϕ n 2 + 1 ( t ) ) .
(3.12)

Note that {g x n }g x ˆ , {g y n }g y ˆ and {F( x n + n 2 , y n + n 2 )}g x ˆ . Thus, letting n in (3.12), we have

M ( F ( x ˆ , y ˆ ) , g x ˆ , ϕ ( t ) ) 11=1.

By induction we can get

M ( F ( x ˆ , y ˆ ) , g x ˆ , ϕ n ( t ) ) 1.

By (GV-2) one has F( x ˆ , y ˆ )=g x ˆ . Similarly, we can prove that F( y ˆ , x ˆ )=g y ˆ .

Next we prove that if ( x , y )X×X is another coupled coincidence point of g and F, then g x ˆ =g x and g y ˆ =g y . In fact, by (3.1) we have

M ( g x ˆ , g x , ϕ ( t ) ) = M ( F ( x ˆ , y ˆ ) , F ( x , y ) , ϕ ( t ) ) M ( g x ˆ , g x , t ) M ( g y ˆ , g y , t ) and M ( g y ˆ , g y , ϕ ( t ) ) = M ( F ( y ˆ , x ˆ ) , F ( y , x ) , ϕ ( t ) ) M ( g y ˆ , g y , t ) M ( g x ˆ , g x , t ) .

It follows that

M ( g x ˆ , g x , ϕ ( t ) ) M ( g y ˆ , g y , ϕ ( t ) ) 2 ( M ( g x ˆ , g x , t ) M ( g y ˆ , g y , t ) ) .

By induction we get

min { M ( g x ˆ , g x , ϕ n ( t ) ) , M ( g y ˆ , g y , ϕ n ( t ) ) } M ( g x ˆ , g x , ϕ n ( t ) ) M ( g y ˆ , g y , ϕ n ( t ) ) 2 n ( M ( g x ˆ , g x , t ) M ( g y ˆ , g y , t ) ) .

It follows from Lemma 3.1 and (GV-2) that g x ˆ =g x and g y ˆ =g y . This shows that g and F have the unique coupled point of coincidence.

Now we show that g x ˆ =g y ˆ and g y ˆ =g x ˆ . In fact, from (3.1) we get

M ( g x ˆ , g y n , ϕ ( t ) ) = M ( F ( x ˆ , y ˆ ) , F ( y n 1 , x n 1 ) , ϕ ( t ) ) M ( g x ˆ , g y n 1 , t ) M ( g y ˆ , g x n 1 , t )
(3.13)

and

M ( g y ˆ , g x n , ϕ ( t ) ) = M ( F ( y ˆ , x ˆ ) , F ( x n 1 , y n 1 ) , ϕ ( t ) ) M ( g y ˆ , g x n 1 , t ) M ( g x ˆ , g y n 1 , t ) .
(3.14)

Let M n (t)=M(g y ˆ ,g x n ,t)M(g x ˆ ,g y n ,t). From (3.13) and (3.14) it follows that

M n ( ϕ n ( t ) ) 2 ( M n 1 ( ϕ n 1 ( t ) ) ) 2 n ( M 0 ( t ) ) .

By Lemma 3.1 we get lim n M n (t)=1, which implies that

lim n M(g y ˆ ,g x n ,t)= lim n M(g x ˆ ,g y n ,t)=1.

Since {g x n } converges to g x ˆ and {g y n } converges to g y ˆ , we see that g y ˆ =g x ˆ .

Now let u=g x ˆ . Then we have u=g y ˆ since g x ˆ =g y ˆ . Since g and F are w-compatible, we have

gu=g(g x ˆ )=g ( F ( x ˆ , y ˆ ) ) =F(g x ˆ ,g y ˆ )=F(u,u),

which implies that (u,u) is a coupled coincidence point of g and F. Since g and F have a unique coupled point of coincidence, we can conclude that gu=g x ˆ , i.e., gu=u. Therefore, we have u=gu=F(u,u). Finally, we prove the uniqueness of a common fixed point of g and F. Let vX be such that v=gv=F(v,v). By (3.1) we have

M ( u , v , ϕ ( t ) ) =M ( F ( u , u ) , F ( v , v ) , ϕ ( t ) ) M(gu,gv,t)M(gu,gv,t)= 2 ( M ( u , v , t ) ) ,

which implies that

M ( u , v , ϕ n ( t ) ) 2 n ( M ( u , v , t ) ) .

By Lemma 3.1 and (GV-2), we see that u=v. This completes the proof. □

Theorem 3.2 Let (X,M,) be a fuzzy metric space under a continuous t-normof H-type. Let ϕ:(0,)(0,) be a function satisfying that lim n ϕ n (t)= for any t>0. Suppose that g:XX and F:X×XX are two mappings such that F(X×X)g(X), and assume that for any t>0,

M ( F ( x , y ) , F ( p , q ) , t ) M ( g x , g p , ϕ ( t ) ) M ( g y , g q , ϕ ( t ) )
(3.15)

for all x,y,p,qX. Suppose that F(X×X) is complete and that g and F are w-compatible, then g and F have a unique common fixed point in x X, that is, x =g x =F( x , x ).

Proof Since F(X×X)g(X), we can construct two sequences { x n } and { y n } in X such that

g x n + 1 =F( x n , y n )andg y n + 1 =F( y n , x n ),for all nN{0}.
(3.16)

From (3.15) and (3.16) we have

M ( g x n , g x n + 1 , t ) = M ( F ( x n 1 , y n 1 ) , F ( x n , y n ) , t ) M ( g x n 1 , g x n , ϕ ( t ) ) M ( g y n 1 , g y n , ϕ ( t ) )
(3.17)

and

M ( g y n , g y n + 1 , t ) = M ( F ( y n 1 , x n 1 ) , F ( y n , x n ) , t ) M ( g y n 1 , g y n , ϕ ( t ) ) M ( g x n 1 , g x n , ϕ ( t ) ) .
(3.18)

Now, let E n (t)=M(g x n 1 ,g x n ,t)M(g y n 1 ,g y n ,t). From (3.17) and (3.18) we get E n + 1 (t) E n (ϕ(t)). It follows that

E n + 1 (t) 2 ( E n ( ϕ ( t ) ) ) 2 n ( E 1 ( ϕ n ( t ) ) ) .
(3.19)

Since lim t E 1 (t)= lim t M(g x 0 ,g x 1 ,t)M(g y 0 ,g y 1 ,t)=1 and lim n ϕ n (t)= for each t>0, we have lim n E 1 ( ϕ n (t))=1. By Lemma 3.1 we have

lim n E n (t)=1for all t>0.
(3.20)

For any fixed t>0, since lim n ϕ n (t)=, there exists n 0 = n 0 (t)N such that ϕ n 0 + 1 (t)> ϕ n 0 (t)>t. Similarly, since lim n ϕ n ( ϕ n 0 + 1 (t) ϕ n 0 (t))=, there exists m 0 = m 0 (t)N such that ϕ m 0 ( ϕ n 0 + 1 (t) ϕ n 0 (t))> ϕ n 0 + 1 (t) ϕ n 0 (t). By (3.17) we have

M ( g x n + m 0 , g x n + m 0 + 1 , ϕ n 0 + 1 ( t ) ϕ n 0 ( t ) ) E n + m 0 ( ϕ ( ϕ n 0 + 1 ( t ) ϕ n 0 ( t ) ) ) 2 m 0 ( E n ( ϕ m 0 ( ϕ n 0 + 1 ( t ) ϕ n 0 ( t ) ) ) ) 2 m 0 ( E n ( ϕ n 0 + 1 ( t ) ϕ n 0 ( t ) ) ) .
(3.21)

Next we show by induction that for any kN{0}, there exists b k N such that

M ( g x n + m 0 , g x n + m 0 + k , ϕ n 0 + 1 ( t ) ) b k ( E n ( ϕ n 0 + 1 ( t ) ϕ n 0 ( t ) ) ) and M ( g y n + m 0 , g y n + m 0 + k , ϕ n 0 + 1 ( t ) ) b k ( E n ( ϕ n 0 + 1 ( t ) ϕ n 0 ( t ) ) ) .
(3.22)

This is obvious for k=0 since M(g x n + m 0 ,g x n + m 0 , ϕ n 0 + 1 (t))=1 and M(g y n + m 0 ,g y n + m 0 , ϕ n 0 + 1 (t))=1. Assume that (3.22) holds for some kN. By (3.15), (3.22), (3.21) and (KM-5), we have

M ( g x n + m 0 , g x n + m 0 + k + 1 , ϕ n 0 + 1 ( t ) ) = M ( g x n + m 0 , g x n + m 0 + k + 1 , ϕ n 0 + 1 ( t ) ϕ n 0 ( t ) + ϕ n 0 ( t ) ) M ( g x n + m 0 , g x n + m 0 + 1 , ϕ n 0 + 1 ( t ) ϕ n 0 ( t ) ) M ( g x n + m 0 + 1 , g x n + m 0 + k + 1 , ϕ n 0 ( t ) ) = M ( g x n + m 0 , g x n + m 0 + 1 , ϕ n 0 + 1 ( t ) ϕ n 0 ( t ) ) M ( F ( x n + m 0 , y n + m 0 ) , F ( x n + m 0 + k , y n + m 0 + k ) , ϕ n 0 ( t ) ) M ( g x n + m 0 , g x n + m 0 + 1 , ϕ n 0 + 1 ( t ) ϕ n 0 ( t ) ) ( M ( g x n + m 0 , g x n + m 0 + k , ϕ n 0 + 1 ( t ) ) M ( g y n + m 0 , g y n + m 0 + k , ϕ n 0 + 1 ( t ) ) ) M ( g x n + m 0 , g x n + m 0 + 1 , ϕ n 0 + 1 ( t ) ϕ n 0 ( t ) ) ( 2 b k ( E n ( ϕ n 0 + 1 ( t ) ϕ n 0 ( t ) ) ) 2 m 0 ( E n ( ϕ n 0 + 1 ( t ) ϕ n 0 ( t ) ) ( 2 b k ( E n ( ϕ n 0 + 1 ( t ) ϕ n 0 ( t ) ) ) = 2 ( m 0 + b k ) ( E n ( ϕ n 0 + 1 ( t ) ϕ n 0 ( t ) ) ) .

Similarly, we can prove that

M ( g y n + m 0 , g y n + m 0 + k + 1 , ϕ n 0 + 1 ( t ) ) 2 ( m 0 + b k ) ( E n ( ϕ n 0 + 1 ( t ) ϕ n 0 ( t ) ) ) .

Since b k + 1 =2( m 0 + b k )N, (3.22) holds for k+1. Therefore, there exists b k N such that (3.22) holds for all kN{0}.

Let t>0 and ϵ>0. By hypothesis, { n :nN} is equicontinuous at 1 and (1)=1, so there is δ>0 such that

if s(1δ,1],then  n (s)>1ϵfor all nN.
(3.23)

Since by (3.20) lim n E n ( ϕ n 0 + 1 (t) ϕ n 0 (t))=1, there is N 0 N such that for all n> N 0 , E n ( ϕ n 0 + 1 (t) ϕ n 0 (t))(1δ,1]. Hence, it follows from (3.22) and (3.23) that

M ( g x n + m 0 , g x n + m 0 + k , ϕ n 0 + 1 ( t ) ) M ( g y n + m 0 , g y n + m 0 + k , ϕ n 0 + 1 ( t ) ) >1ϵ

for all n> N 0 and any kN{0}. Noting that (3.17) and (3.18), we have

min { M ( g x n + m 0 + n 0 + 1 , g x n + m 0 + n 0 + 1 + k , t ) , M ( g y n + m 0 + n 0 + 1 , g y n + m 0 + n 0 + 1 + k , t ) } 2 n 0 + 1 ( M ( g x n + m 0 , g x n + m 0 + k , ϕ n 0 + 1 ( t ) ) M ( g y n + m 0 , g y n + m 0 + k , ϕ n 0 + 1 ( t ) ) ) > 1 ϵ .

This implies that for all kN,

M(g x m ,g x m + k ,t)>1ϵandM(g y m ,g y m + k ,t)>1ϵ,

where m> N 0 + n 0 + m 0 +1. Thus {g x n } and {g y n }, i.e., {F( x n , y n )} and {F( y n , x n )} are the Cauchy sequences. Since F(X×X) is complete and F(X×X)g(X), there exists ( x ˆ , y ˆ )X×X such that {F( x n , y n )} converges to g x ˆ and {F( y n , x n )} converges to g y ˆ .

Next we prove that g x ˆ =F( x ˆ , y ˆ ) and g y ˆ =F( y ˆ , x ˆ ). By (KM-5) and (3.15), we have, for any t>0,

M ( F ( x ˆ , y ˆ ) , F ( x n , y n ) , t ) M ( g x ˆ , g x n , ϕ ( t ) ) M ( g y ˆ , g y n , ϕ ( t ) ) .
(3.24)

Since lim n g x n =g x ˆ and lim n g y n =g y ˆ , letting n in (3.24), we have lim n F( x n , y n )=F( x ˆ , y ˆ ). Noting that lim n F( x n , y n )=g x ˆ , we have F( x ˆ , y ˆ )=g x ˆ . Similarly, we can prove that F( y ˆ , x ˆ )=g y ˆ .

Let u=g x ˆ and v=g y ˆ . Since g and F are w-compatible, we have

g u = g ( g x ˆ ) = g ( F ( x ˆ , y ˆ ) ) = F ( g x ˆ , g y ˆ ) = F ( u , v ) and g v = g ( g y ˆ ) = g ( F ( y ˆ , x ˆ ) ) = F ( g y ˆ , g x ˆ ) = F ( v , u ) .
(3.25)

This shows that (u,v) is a coupled coincidence point of g and F. Now we prove that gu=g x ˆ and gv=g y ˆ . In fact, from (3.15) we have

M ( g u , g x n , t ) = M ( F ( u , v ) , F ( x n 1 , y n 1 ) , t ) M ( g u , g x n 1 , ϕ ( t ) ) M ( g v , g y n t , ϕ ( t ) ) and M ( g v , g y n , t ) = M ( F ( v , u ) , F ( y n 1 , x n 1 ) , t ) M ( g v , g y n 1 , ϕ ( t ) ) M ( g u , g x n t , ϕ ( t ) ) .

Let M n (t)=M(gu,g x n ,t)M(gv,g y n ,t). Then we have

M n (t) 2 ( M n 1 ( ϕ ( t ) ) ) 2 n ( M 0 ( ϕ n ( t ) ) ) .

Since lim n ϕ n (t)= and ∗ is continuous, we have

2 n ( M 0 ( ϕ n ( t ) ) ) = 2 n ( M ( g v , g x 0 , ϕ n ( t ) ) M ( g u , g y 0 , ϕ n ( t ) ) ) 1as n.

This shows that M n (t)1 as n, and so we have gu=g x ˆ and gv=g y ˆ . Therefore, we have gu=u and gv=v. Now, from (3.25) it follows that u=gu=F(u,v) and v=gv=F(v,u).

Finally, we prove that u=v. In fact, by (3.15) we have, for any t>0,

M(u,v,t)=M ( F ( u , v ) , F ( v , u ) , t ) M ( g u , g v , ϕ ( t ) ) M ( g v , g u , ϕ ( t ) ) = 2 ( M ( u , v , ϕ ( t ) ) ) .

By induction we can get M(u,v,t) 2 n (M(u,v, ϕ n (t))). Letting n and noting that ϕ n (t) as n, we have M(u,v,t)=1 for any t>0, i.e., u=v. Therefore, u is a common fixed point of g and F. The uniqueness of u is similar to the final proof line of Theorem 3.1. This completes the proof. □

In Theorem 3.1 and Theorem 3.2, if we let gx=x for all xX, we get the following result.

Corollary 3.1 Let (X,M,) be a fuzzy metric space under a continuous t-normof H-type. Let ϕ:(0,)(0,) be a function satisfying that lim n ϕ n (t)=0 for any t>0. Let F:X×XX be a mapping, and assume that for any t>0,

M ( F ( x , y ) , F ( p , q ) , ϕ ( t ) ) M(x,p,t)M(p,q,t)

for all x,y,p,qX. Suppose that F(X×X) is complete. Then F has a unique fixed point x X, that is, x =F( x , x ).

Corollary 3.2 Let (X,M,) be a fuzzy metric space under a continuous t-normof H-type. Let ϕ:(0,)(0,) be a function satisfying that lim n ϕ n (t)= for any t>0. Let F:X×XX be a mapping, and assume that for any t>0,

M F ( x , y ) , F ( p , q ) (t) M x , p (t) M p , q ( ϕ ( t ) )

for all x,y,p,qX. Suppose that F(X×X) is complete. Then F has a unique fixed point x X, that is, x =F( x , x ).

Now, we illustrate Theorem 3.1 by the following example.

Example 3.1 Let X=[0, 1 4 ){ 1 2 } and xy=min(x,y) for all x,yX. Define M(x,y,t)= t t + | x y | for all x,yX and t>0. Then (X,M,) is a fuzzy metric space, but it is not complete. Define two mappings g:XX and F:X×XX by

g(x)={ x 2 if  x [ 0 , 1 8 ] , x if  x ( 1 8 , 1 4 ) , 1 2 if  x = 1 2

and

F(x,y)={ x 8 if  x [ 0 , 1 4 ) , 1 32 if  x = 1 2 .

It is easy to see that g and F are not commuting since g(F( 1 2 , 1 2 ))F(g( 1 2 ),g( 1 2 )), F(X×X)g(X), and F(X×X) is complete.

Let ϕ:(0,)(0,) by

ϕ(t)={ 3 2 , t = 1 , t 2 , t 1 .

Then lim n ϕ n (t)=0 for any t>0.

Now, we verify (3.1) for t1. We shall consider the following four cases.

Case 1. Let x 1 2 and u 1 2 . In this case there are four possibilities:

Case 1.1. Let x[0, 1 8 ] and u[0, 1 8 ]. Then we have

M ( F ( x , y ) , F ( u , v ) , ϕ ( t ) ) = t 2 t 2 + | x 8 u 8 | = 2 t 2 t + | x 2 u 2 | t t + | x 2 u 2 | min { t t + | x 2 u 2 | , t t + | y 2 v 2 | } min { M ( g ( x ) , g ( u ) , t ) , M ( g ( y ) , g ( v ) , t ) } for all  y , v X .

Case 1.2. Let x[0, 1 8 ] and u( 1 8 , 1 4 ). Then

M ( F ( x , y ) , F ( u , v ) , ϕ ( t ) ) = t 2 t 2 + | x 8 u 8 | = 2 t 2 t + ( u 2 x 2 ) 2 t 2 t + ( u x 2 ) min { t t + | u x 2 | , t t + | y 2 v 2 | } min { M ( g ( x ) , g ( u ) , t ) , M ( g ( y ) , g ( v ) , t ) } for all  y , v X .

Case 1.3. Let x( 1 8 , 1 4 ) and u[0, 1 8 ]. This case is similar to Case 1.2.

Case 1.4. Let x( 1 8 , 1 4 ) and u( 1 8 , 1 4 ). Then

M ( F ( x , y ) , F ( u , v ) , ϕ ( t ) ) = t 2 t 2 + | x 8 u 8 | = 2 t 2 t + | x 2 u 2 | t t + | x 2 u 2 | min { t t + | x u | , t t + | y 2 v 2 | } min { M ( g ( x ) , g ( u ) , t ) , M ( g ( y ) , g ( v ) , t ) } for all  y , v X .

Case 2. Let x= 1 2 and u= 1 2 . Then we have

M ( F ( x , y ) , F ( u , v ) , ϕ ( t ) ) = M ( F ( 1 2 , y ) , F ( 1 2 , v ) , ϕ ( t ) ) = t 2 t 2 + | 1 32 1 32 | = 1 min { M ( g ( 1 2 ) , g ( 1 2 ) , t ) , M ( g ( y ) , g ( v ) , t ) } for all  y , v X .

Case 3. Let x= 1 2 and u 1 2 . Then we have:

Case 3.1. If u[0, 1 8 ], then

M ( F ( x , y ) , F ( u , v ) , ϕ ( t ) ) = M ( F ( 1 2 , y ) , F ( u , v ) , ϕ ( t ) ) = t 2 t 2 + | 1 32 u 8 | = t t + | 1 16 u 4 | t t + | 1 4 u | t t + | 1 2 u 2 | min { M ( g ( 1 2 ) , g ( u ) , t ) , M ( g ( y ) , g ( v ) , t ) } for all  y , v X .

Case 3.2. If u( 1 8 , 1 4 ), then

M ( F ( x , y ) , F ( u , v ) , ϕ ( t ) ) = M ( F ( 1 2 , y ) , F ( u , v ) , ϕ ( t ) ) = t 2 t 2 + | 1 32 u 8 | = t t + | 1 16 u 4 | t t + | 1 2 u | min { M ( g ( 1 2 ) , g ( u ) , t ) , M ( g ( y ) , g ( v ) , t ) } for all  y , v X .

Case 4. x 1 2 and u= 1 2 . This case is similar to Case 3.

For t=1, since M(F(x,y),F(u,v),ϕ(1))=M(F(x,y),F(u,v), 3 2 ), by Cases 1-4 above, we can see that M(F(x,y),F(u,v),ϕ(1))min{M(gx,gu,1),M(gy,gv,1)} for all x,y,u,vX. It is easy to see that (0,0) is a coupled coincidence point of g and F. Also, g and F are w-compatible at (0,0). By Theorem 3.1, we conclude that g and F have a unique common fixed point in X. Obviously, in this example, 0 is the unique common fixed point of g and F.

Since g(x) is not continuous at x= 1 8 and (X,M,) is not complete, Hu’s Theorem 3.1 [[17], Theorem 1] cannot be applied to Example 3.1.

Remark 3.1 Our results improve the ones of Sedghi et al. [18] as follows:

  1. (i)

    from kt to ϕ(t);

  2. (ii)

    the functions F and g are not required to be commutable.

Our results also improve the corresponding ones of Hu [17] as follows:

  1. (a)

    in our Theorem 3.1, the function ϕ(t) is only required to satisfy the condition lim n ϕ n (t)=0 for any t>0. However, the function ϕ(t) in Hu’s result is required to satisfy the conditions (ϕ-1)-(ϕ-3);

  2. (b)

    in our results, the mappings F and g are required to be weakly compatible, but in Hu’s result the mappings F and g are required to be compatible.

Also, in our results the mapping g is not required to be continuous, but the condition is imposed on the mapping g in the results of Sedghi et al. and Hu.