1 Introduction

Let A be a Banach ∗-algebra. A linear mapping δ:D(δ)A is said to be a derivation on A if δ(ab)=δ(a)b+aδ(b) for all a,bA, where D(δ) is a domain of δ and D(δ) is dense in A. If δ satisfies the additional condition δ( a )=δ ( a ) for all aA, then δ is called a ∗-derivation on A. It is well known that if A is a C -algebra and D(δ) is A, then the ∗-derivation δ is bounded. For several reasons, the theory of bounded derivations of C -algebras is very important in the theory of quantum mechanics and operator algebras [3, 4].

A functional equation is called stable if any function satisfying a functional equation “approximately” is near to a true solution of the functional equation. We say that a functional equation is superstable if every approximate solution is an exact solution of it.

In 1940, Ulam [24] proposed the following question concerning stability of group homomorphisms: Under what condition is there an additive mapping near an approximately additive mapping? Hyers [8] answered positively the problem of Ulam for the case where G 1 and G 2 are Banach spaces. A generalized version of the theorem of Hyers for an approximately linear mapping was given by ThM Rassias [20]. Since then, the stability problems of various functional equations have been extensively investigated by a number of authors (for instances, [1, 2, 9, 10, 19, 20]). In particular, those of the important functional equations are the following functional equations:

(1.1)
(1.2)

which are called the Cauchy equation and the Jensen equation, respectively. Every solution of the functional equations (1.1) and (1.2) is said to be an additive mapping.

Since Katsaras [14] introduced the idea of fuzzy norm on a linear space, several definitions for a fuzzy norm on a linear space have been introduced and discussed from different points of view [57]. We use the definition of fuzzy normed spaces given in [5, 17] to investigate the stability of derivation in the fuzzy Banach ∗-algebra setting. The stability of functional equations in fuzzy normed spaces was begun by [17], after then lots of results of fuzzy stability were investigated [11, 13, 16, 18].

Definition 1.1 [5, 17, 21]

Let X be a real vector space. A function N:X×R[0,1] is called a fuzzy norm on X if for all x,yX and all s,tR,

( N 1 ) N(x,t)=0 for t0;

( N 2 ) x=0 if and only if N(x,t)=1 for all t>0;

( N 3 ) N(cx,t)=N(x, t | c | ) if c0;

( N 4 ) N(x+y,s+t)min{N(x,s),N(y,t)};

( N 5 ) N(x,) is a non-decreasing function of R and lim t N(x,t)=1;

( N 6 ) for x0, N(x,) is continuous on R.

The pair (X,N) is called a fuzzy normed vector space.

Furthermore, we can make (X,N) a fuzzy normed ∗-algebra if we add ( N 7 ) and ( N 8 ) as follows:

( N 7 ) N(xy,st)min{N(x,s),N(y,t)};

( N 8 ) N(x,t)=N( x ,t).

The properties and examples of fuzzy normed vector spaces, fuzzy algebras, and fuzzy norms are given in [17, 18, 22, 23].

Definition 1.2 [5, 17, 21]

Let (X,N) be a fuzzy normed vector space. A sequence { x n } in X is said to be convergent or converge if there exists an xX such that lim n N( x n x,t)=1 for all t>0. In this case, x is called the limit of the sequence { x n } and we denote it by N- lim n x n =x.

Definition 1.3 [5, 17, 21]

Let (X,N) be a fuzzy normed vector space. A sequence { x n } in X is called Cauchy if for each ε>0 and each t>0 there exists an n 0 N such that for all n n 0 and all p>0, we have N( x n + p x n ,t)>1ε.

It is well known that every convergent sequence in a fuzzy normed vector space is Cauchy. If each Cauchy sequence is convergent, then the fuzzy norm is said to be complete and the fuzzy normed vector space is called a fuzzy Banach space.

We say that a mapping f:XY between fuzzy normed vector spaces X and Y is continuous at a point x 0 X if for each sequence { x n } converging to x 0 in X, then the sequence {f( x n )} converges to f( x 0 ). If f:XY is continuous at each xX, then f:XY is said to be continuous on X.

In this paper, using the functional equation of ∗-derivations

f(λa+b+cd)=λf(a)+f(b)+f(c)d+cf(d)

introduced in [12] we prove fuzzy version of the stability of ∗-derivations associated to the Cauchy functional equation and the Jensen functional equation. We also prove the superstability of ∗-derivations on fuzzy Banach ∗-algebras.

2 Stability of ∗-derivations on fuzzy Banach ∗-algebras

In this section, let A be a fuzzy Banach ∗-algebra.

Theorem 2.1 Let φ: A 4 [0,) and ψ: A 2 [0,) be control functions such that

(2.1)
(2.2)

Suppose that f:AA is a mapping with f(0)=0 satisfying the followings:

lim t N ( f ( λ a + b + c d ) λ f ( a ) f ( b ) f ( c ) d c f ( d ) , t φ ( a , b , c , d ) ) =1
(2.3)

uniformly on A 4 and for all λT:={λC:|λ|=1}

lim t N ( f ( a ) f ( a ) , t ψ ( a , a ) ) =1
(2.4)

uniformly on A 2 . Then there exists a unique ∗-derivation δ on A satisfying

lim t N ( f ( a ) δ ( a ) , t φ ˜ ( a , a , 0 , 0 ) ) =1
(2.5)

for all aA.

Proof Let 0<ϵ<1 be given. Setting a=b, c=d=0 and λ=1 in (2.3), we can find some t 0 >0 such that

N ( f ( 2 a ) 2 f ( a ) , t φ ( a , a , 0 , 0 ) ) 1ϵ

for all aA and t t 0 . One can use induction to show that

N ( f ( 2 n a ) 2 n f ( a ) , t k = 0 n 1 2 n k 1 φ ( 2 k a , 2 k a , 0 , 0 ) ) 1ϵ.
(2.6)

Let t= t 0 and put n=p then by replacing a with 2 n a in (2.6), we obtain

N ( f ( 2 n + p a ) 2 n + p f ( 2 n a ) 2 n , t 0 2 n + p k = 0 p 1 2 p k 1 φ ( 2 n + k a , 2 n + k a , 0 , 0 ) ) 1ϵ
(2.7)

for all integers n0, p0. By the convergence of (2.1) there is n 0 N such that

t 0 2 k = n n + p 1 2 k φ ( 2 k a , 2 k a , 0 , 0 ) δ

for all n n 0 and p>0. Since the fuzzy norm N(x,) is nondecreasing, we can have

(2.8)

It follows from (2.8) and Definition 1.3 that the sequence { f ( 2 n a ) 2 n } is Cauchy. Due to the completeness of A, this sequence is convergent. Define

δ(a):=N lim n f ( 2 n a ) 2 n
(2.9)

for all aA. From the above equation, we have

δ ( 1 2 k a ) =N lim n 1 2 k f ( 2 n k a ) 2 n k = 1 2 k δ(a)
(2.10)

for each kN. Moreover, letting n=0 and passing the limit p in (2.8), we get

lim t N ( f ( a ) δ ( a ) , t φ ˜ ( a , a , 0 , 0 ) ) =1
(2.11)

for all aA. Putting c=d=0 and replacing a and b by 2 n a and 2 n b, respectively, in (2.3), there exists t 0 >0 such that

N ( 2 n f ( 2 n ( λ a + b ) ) λ 2 n f ( 2 n a ) 2 n f ( 2 n b ) , t 2 n φ ( 2 n a , 2 n b , 0 , 0 ) ) 1ϵ

for all t t 0 . Let a,bA. Temporarily fix t>0. Since lim n 1 2 n tφ( 2 n a, 2 n b,0,0)=0, there exists n 0 >0 such that

tφ ( 2 n a , 2 n a , 0 , 0 ) 2 n t 4 ,

for all n n 0 . Hence, we have

N ( δ ( λ a + b ) λ δ ( a ) δ ( b ) , t ) min { N ( δ ( λ a + b ) 2 n f ( 2 n ( λ a + b ) ) , t 4 ) , N ( λ δ ( a ) λ 2 n f ( 2 n a ) , t 4 ) , N ( δ ( b ) 2 n f ( 2 n b ) , 4 t ) , N ( f ( 2 n ( λ a + b ) ) λ f ( 2 n a ) f ( 2 n b ) , 2 n 4 t ) }

for all n n 0 and t>0. The first three terms on the second and third lines of the above inequality tend to 1 as n. Furthermore, the last term is greater than

N ( f ( 2 n ( λ a + b ) ) λ f ( 2 n a ) f ( 2 n b ) , t 0 φ ( 2 n a , 2 n b , 0 , 0 ) ) ,

which is greater than or equal to 1ϵ. Therefore,

N ( δ ( λ a + b ) λ δ ( a ) δ ( b ) , t ) 1ϵ

for all t>0. It follows that δ(λa+b)=λδ(a)+δ(b) by ( N 2 ) for all a,bA and all λT. Next, let λ= λ 1 +i λ 2 C where λ 1 , λ 2 R. Let γ 1 = λ 1 [ λ 1 ] and γ 2 = λ 2 [ λ 2 ], where [λ] denotes the integer part of λ. Then 0 γ i <1 (1i2). One can represent γ i as γ i = λ i , 1 + λ i , 2 2 such that λ i , j T (1i, j2). From (2.10), we infer that

δ ( λ x ) = δ ( λ 1 x ) + i δ ( λ 2 x ) = ( [ λ 1 ] δ ( x ) + δ ( γ 1 x ) ) +  i ( [ λ 2 ] δ ( x ) + δ ( γ 2 x ) ) = ( [ λ 1 ] δ ( x ) + 1 2 δ ( λ 1 , 1 x + λ 1 , 2 x ) ) +  i ( [ λ 2 ] δ ( x ) + 1 2 δ ( λ 2 , 1 x + λ 2 , 2 x ) ) = ( [ λ 1 ] δ ( x ) + 1 2 λ 1 , 1 δ ( x ) + 1 2 λ 1 , 2 δ ( x ) ) +  i ( [ λ 2 ] δ ( x ) + 1 2 λ 2 , 1 δ ( x ) + 1 2 λ 2 , 2 δ ( x ) ) = λ 1 δ ( x ) + i λ 2 δ ( x ) = λ δ ( x )

for all xA. Hence, δ is C-linear. Putting a=b=0 and replacing c and d by 2 n c and 2 n d, respectively, in (2.3), there exists t 0 >0 such that

N ( 2 2 n f ( 2 2 n c d ) 2 2 n f ( 2 n c ) ( 2 n d ) 2 2 n ( 2 n c ) f ( 2 n d ) , t 2 2 n φ ( 0 , 0 , 2 n c , 2 n d ) ) 1ϵ

for all t t 0 . Fix t(>0) temporarily. By (2.1) there exists n 0 >0 such that

tφ ( 0 , 0 , 2 n c , 2 n d ) 2 2 n t 4

for all n n 0 and t>0. We have

N ( δ ( c d ) δ ( c ) d c δ ( d ) , t ) min { N ( δ ( c d ) 2 2 n f ( 2 2 n c d ) , t 4 ) , N ( δ ( c ) d 2 2 n f ( 2 n c ) ( 2 n d ) , t 4 ) , N ( c δ ( d ) 2 2 n ( 2 n c ) f ( 2 n d ) , t 4 ) , N ( f ( 2 2 n c d ) f ( 2 n c ) ( 2 n d ) ( 2 n c ) f ( 2 n d ) , 2 2 n 4 t ) } min { N ( δ ( c d ) 2 2 n f ( 2 2 n c d ) , t 4 ) , N ( δ ( c ) d 2 2 n f ( 2 n c ) ( 2 n d ) , t 4 ) , N ( c δ ( d ) 2 2 n ( 2 n c ) f ( 2 n d ) , t 4 ) , N ( f ( 2 2 n c d ) f ( 2 n c ) ( 2 n d ) ( 2 n c ) f ( 2 n d ) , t φ ( 0 , 0 , 2 n c , 2 n d ) ) }

for all n n 0 and t>0. From the above computation

δ(cd)=δ(c)d+cδ(d)
(2.12)

for all c,dA. So it is a derivation on A. Moreover, it follows from (2.7) with n=0 and (2.9) that lim t N(δ(a)f(a),t φ ˜ (a,a,0,0))=1 for all aA. It is well known that the additive mapping δ satisfying (2.5) is unique (see [3] or [20]). Replacing a and a by 2 n a and 2 n a , respectively, in (2.4) we can find t 0 >0 such that

N ( 2 n f ( 2 n a ) 2 n f ( 2 n a ) , t 2 n ψ ( 2 n a , 2 n a ) ) 1ϵ

for all aA and all t> t 0 . Since lim n 2 n ψ( 2 n a, 2 n a )=0, there exists some n 0 >0 such that tψ( 2 n a, 2 n a )< t 2 n 2 for all n n 0 . Hence,

N ( δ ( a ) δ ( a ) , t ) min { N ( δ ( a ) 2 n f ( 2 n a ) , t 4 ) , N ( δ ( a ) 2 n f ( 2 n a ) , t 4 ) , N ( f ( 2 n a ) f ( 2 n a ) , 2 n t 2 ) } .

The first two terms on the right-hand side of the above inequality tend to 1 as n. Furthermore, the last term is greater than

N ( f ( 2 n a ) f ( 2 n a ) , t ψ ( 2 n a , 2 n a ) ) ,

which is greater than or equal to 1ϵ. So, we have that N(δ ( a ) δ( a ),t)>1ϵ for all t>0. It follows from that δ( a )=δ ( a ) for all aA. So, δ is a *-derivation on A. □

Theorem 2.2 Suppose that f:AA is a mapping with f(0)=0 for which there exist functions φ: A 4 [0,) and ψ: A 2 [0,) such that

φ ˜ ( a , b , c , d ) : = 1 2 n = 0 2 n φ ( 2 n a , 2 n b , 2 n c , 2 n d ) < , lim n 2 n ψ ( 2 n a , 2 n b ) = 0 , lim t N ( f ( λ a + b + c d ) λ f ( a ) f ( b ) f ( c ) d c f ( d ) , t φ ( a , b , c , d ) ) = 1 , lim t N ( f ( a ) f ( a ) , t ψ ( a , a ) ) = 1

for all λT and all a,b,c,dA. Then there exists a unique ∗-derivation δ on A satisfying

lim t N ( f ( a ) δ ( a ) , t φ ˜ ( a , a , 0 , 0 ) ) =1

for all aA.

3 Stability of ∗-derivations associated to the Jensen equation

The stability of the Jensen equation has been studied first by Kominek and then by several other mathematicians: ([15]). In this section, we study the stability of ∗-derivation associated to the Jensen equation in a fuzzy Banach ∗-algebra A.

Theorem 3.1 Let A be a fuzzy Banach ∗-algebra. Suppose that f:AA is a mapping with f(0)=0 for which there exist functions φ: A 2 [0,) and ψ i : A 2 [0,) (1i2) such that

(3.1)
(3.2)
(3.3)
(3.4)

for all a,bA and all λT. Then there exists a unique ∗-derivation δ on A satisfying

lim t N ( f ( a ) δ ( a ) , t 3 ( φ ˜ ( a , a ) + φ ˜ ( a , 3 a ) ) ) =1
(3.5)

for all aA.

Proof Let 0<ϵ<1 be given. Letting λ=1 and b=a in (3.2), we can find some t 0 >0 such that

N ( f ( a ) + f ( a ) , t φ ( a , a ) ) 1ϵ

for all aA and t t 0 . Letting λ=1 and replacing a and b by −a and 3a, respectively, in (3.2), we get also t 1 t 0 such that

N ( 2 f ( a ) f ( a ) f ( 3 a ) , t φ ( a , 3 a ) ) 1ϵ

for all aA and t t 1 . Thus,

(3.6)

for all aA. Replace a by 3 n a in (3.6)

N ( f ( 3 n a ) 3 n f ( 3 n + 1 a ) 3 n + 1 , t 3 n + 1 ( φ ( 3 n a , 3 n a ) + φ ( 3 n a , 3 n + 1 a ) ) ) 1ϵ.

Given δ>0, there exists an integer n 0 >0 such that

t 3 j = m n 1 3 j ( φ ( 3 j a , 3 j a ) + φ ( 3 j a , 3 j + 1 a ) ) δ

for all nm n 0 .

So, we have

(3.7)
(3.8)

for all nonnegative integers n, m with nm n 0 and all aA. It follows from Definition 1.3 that the sequence { 1 3 n f( 3 n a)} is a Cauchy sequence for all aA. Since A is complete, the sequence { 1 3 n f( 3 n a)} is convergent. So, one can define the mapping δ:AA by

δ(a)=N lim n 1 3 n f ( 3 n a )
(3.9)

for all aA. If we put λ=1 and replace a, b with 3 n a, 3 n b, respectively, in (3.2), we can find some t 0 >0 such that

N ( 2 f ( 3 n a + b 2 ) f ( 3 n a ) f ( 3 n b ) , 3 n t φ ( 3 n a , 3 n b ) ) 1ϵ

for all t t 0 . Fix t>0 temporarily. Since lim n 3 n φ( 3 n a, 3 n b)=0, there is some n 0 >0 such that tφ( 3 n a, 3 n b)< 3 n t 4 for all n n 0 . Then we have

N ( 2 δ ( a + b 2 ) δ ( a ) δ ( b ) , t ) min { N ( 2 δ ( a + b 2 ) 1 3 n 2 f ( 3 n a + b 2 ) , t 4 ) , N ( δ ( a ) f ( 3 n a ) 3 n , t 4 ) , N ( δ ( b ) f ( 3 n b ) 3 n , t 4 ) , N ( 2 f ( 3 n a + b 2 ) f ( 3 n a ) f ( 3 n b ) , 3 n t 4 ) }

for all a,bA and t>0. The first three terms on the second and third lines of the above inequality tend to 1 as n. Furthermore, the last term is greater than

N ( 2 f ( 3 n a + b 2 ) f ( 3 n a ) f ( 3 n b ) , t φ ( 3 n a , 3 n b ) ) ,

which is greater than or equal to 1ϵ.

So, we have

N ( 2 δ ( a + b 2 ) δ ( a ) δ ( b ) , t ) 1ϵ

for all t>0. By the definition of fuzzy norm, we have

2δ ( a + b 2 ) =δ(a)+δ(b)
(3.10)

for all a,bA. Since f(0)=0, we have δ(0)=0. Putting b=0 in (3.10), we get 2δ( a 2 )=δ(a) for each aA and, therefore, δ(a)+δ(b)=2δ( a + b 2 )=δ(a+b) for all a,bA. Moreover, letting m=0 and passing the limit n in (3.8), we get

N ( f ( a ) δ ( a ) , t 3 ( φ ˜ ( a , a ) + φ ˜ ( a , 3 a ) ) ) 1ϵ

for all aA. So, we have Eq. (3.5). It is known that such an additive mapping δ is unique. Let λT. Replacing both a and b in (3.2) by 3 n a and dividing the both sides of the obtained inequality by 3 n , there exists some t 0 >0 such that

N ( 3 n f ( λ 3 n a ) λ 3 n f ( 3 n a ) , 3 n t φ ( 3 n a , 3 n a ) ) 1ϵ

for all aA and all t t 0 . Fix t>0 temporarily. Since lim n 3 n ϕ( 3 n a, 3 n b)=0, there exists n 0 >0 such that 3 n ϕ( 3 n a, 3 n b) t 2 for all n n 0 .

If we consider the following inequality

N ( δ ( λ a ) λ δ ( a ) , t ) min { N ( δ ( λ a ) 3 n f ( λ 3 n a ) , t 4 ) , N ( λ δ ( a ) 3 n f ( λ 3 n a ) , t 4 ) , N ( 3 n f ( λ 3 n a ) 3 n f ( λ 3 n a ) , t 2 ) } ,

then the first two terms on the second line of the above inequality tend to 1 as n and the last term is greater than

N ( 3 n f ( λ 3 n a ) λ 3 n f ( 3 n a ) , 3 n t φ ( 3 n a , 3 n a ) ) ,

which is greater than or equal to 1ϵ. So, we can get δ(λa)=λδ(a) for all λC by the similar discussion in the proof Theorem 2.1. Replacing both a and a in (3.3) by 3 n a and 3 n a , and then dividing the both sides of the obtained inequality by 3 n , we find some t 0 >0 such that

N ( 3 n f ( 3 n a ) 3 n f ( 3 n a ) , t 3 n ψ 1 ( 3 n a , 3 n a ) ) 1ϵ

for all t t 0 . Fix t>0 temporarily. Since lim n 3 n ψ 1 ( 3 n a, 3 n a )=0, there exists n 0 >0 such that 3 n t ψ 1 ( 3 n a, 3 n a ) t 2 for all n n 0 . We consider the following inequality:

N ( δ ( a ) δ ( a ) , t ) min { N ( δ ( a ) 3 n f ( 3 n a ) , t 4 ) , N ( δ ( a ) 3 n f ( 3 n a ) , t 4 ) , N ( 3 n f ( 3 n a ) 3 n f ( 3 n a ) , t 2 ) } .

Then we get δ( a )=δ ( a ) for all aA. For the derivation property, replacing both a and b in (3.4) by 3 n a and 3 n b, we can find some t 0 >0 such that

N ( f ( 3 2 n a b ) 3 2 n 3 n a f ( 3 n b ) 3 2 n f ( 3 n a ) ( 3 n b ) 3 2 n , 3 n t ψ 2 ( 3 n a , 3 n b ) ) 1ϵ

for all t t 0 . By (3.4), there exists n 0 N such that 3 n t ψ 2 ( 3 n a, 3 n b) t 4 for all n n 0 and t>0. We can get δ(ab)=δ(a)b+aδ(b) for all a,bA from the following computation:

N ( δ ( a b ) a δ ( b ) δ ( a ) b , t ) min { N ( δ ( a b ) f ( 3 2 n a b ) 3 2 n , t 4 ) , N ( a δ ( b ) 3 n a f ( 3 n b ) 3 2 n , t 4 ) , N ( δ ( a ) b f ( 3 n a ) ( 3 n b ) 3 2 n , t 4 ) , N ( f ( 3 2 n a b ) 3 2 n 3 n a f ( 3 n b ) 3 2 n f ( 3 n a ) ( 3 n b ) 3 2 n , t 4 ) } .

Hence, δ is the ∗-derivation on A that we want. □

4 Superstability of ∗-derivations

In this section, we prove the superstability of ∗-derivations on a fuzzy Banach ∗-algebras. More precisely, we introduce the concept of (ψ,φ)-approximate ∗-derivation and show that any (ψ,φ)-approximate ∗-derivation is just a ∗-derivation.

Definition 4.1 Suppose that A is a ∗-normed algebra and s{1,1}. Let δ:AA be a mapping for which there exist a function φ:AA, and functions ψ i :A×AR (1i3) satisfying

lim n n s ψ i ( n s a , b ) = lim n n s ψ i ( a , n s b ) =0(a,bA)
(4.1)

such that

(4.2)
(4.3)
(4.4)

for all a,b,c,dA. Then δ is called a (ψ,φ)-approximate ∗-derivation on A.

Theorem 4.2 Let A be a fuzzy Banach ∗-algebra with approximate unit. Then any (ψ,φ)-approximate ∗-derivation δ on A is a ∗-derivation.

Proof We assume that (4.1) holds. An arbitrary ϵ>0 is given. Let a,bA and λC. For nN there exists t 0 >0 by (4.2) such that

N ( n s ( n s b δ ( λ a ) φ ( n s b ) λ a ) , n s t ψ 1 ( n s b , λ a ) ) 1 ϵ , N ( n s ( φ ( n s b ) λ a λ n s b δ ( a ) ) , n s t | λ | ψ 1 ( n s b , a ) ) 1 ϵ

for all t t 0 . Fix t>0 temporarily. Since lim n n s ψ 1 ( n s a,b)= lim n n s ψ 1 (a, n s b)=0, there exists n 0 >0 such that t n s ψ 1 ( n s b,λa) t 2 and n s t|λ| ψ 1 ( n s b,a) t 2 for all n n 0 and t>0.

We have

N ( b ( δ ( λ a ) λ δ ( a ) ) , t ) = N ( n s ( n s b δ ( λ a ) φ ( n s b ) λ a + φ ( n s b ) λ a λ n s b δ ( a ) ) , t ) min { N ( n s ( n s b δ ( λ a ) φ ( n s b ) λ a ) , t 2 ) , N ( n s ( φ ( n s b ) λ a λ n s b δ ( a ) ) , t 2 ) } .

Since

N ( n s ( n s b δ ( λ a ) φ ( n s b ) λ a ) , t 2 ) N ( n s ( n s b δ ( λ a ) φ ( n s b ) λ a ) , t n s ψ 1 ( n s a , b ) )

and

N ( n s ( φ ( n s b ) λ a λ n s b δ ( a ) ) , t 2 ) N ( n s ( φ ( n s b ) λ a λ n s b δ ( a ) ) , t n s | λ | ψ 1 ( n s b , a ) ) ,

it leads us to have a conclusion that N(b(δ(λa)λδ(a)),t)1ϵ for all t>0. Therefore, b(δ(λa)λδ(a))=0 for all bA by ( N 2 ). Let { e i } i I be an approximate unit of A. If we replace b with { e i } i I , then we have

e i ( δ ( λ a ) λ δ ( a ) ) =0

for all iI. So we conclude that δ(λa)=λδ(a) for all aA and λC. Next, we are going to prove the additivity of δ. By (4.2), there exists t 0 >0 such that

N ( n s ( n s c δ ( a + b ) φ ( n s c ) ( a + b ) ) , n s t ψ 1 ( n s c , a + b ) ) 1 ϵ , N ( n s ( n s c δ ( a ) φ ( n s c ) a ) , n s t ψ 1 ( n s c , a ) ) 1 ϵ ,

and

N ( n s ( n s c δ ( b ) φ ( n s c ) b ) , n s t ψ 1 ( n s c , b ) ) 1ϵ

for all t t 0 . Fix t>0 temporarily. By (4.1), we can find n 0 >0 such that n s t ψ 1 ( n s c,a+b) t 3 , n s t ψ 1 ( n s c,a) t 3 , and n s t ψ 1 ( n s c,b) t 3 for all n n 0 .

For the additivity, we can have

N ( c ( δ ( a + b ) δ ( a ) δ ( b ) ) , t ) = N ( n s ( n s c δ ( a + b ) φ ( n s c ) ( a + b ) ) + n s ( n s c δ ( a ) φ ( n s c ) a ) + n s ( n s c δ ( b ) φ ( n s c ) b ) , t ) min { N ( n s ( n s c δ ( a + b ) φ ( n s c ) ( a + b ) ) , t 3 ) , N ( n s ( n s c δ ( a ) φ ( n s c ) a ) , t 3 ) , N ( n s ( n s c δ ( b ) φ ( n s c ) b ) , t 3 ) } min { N ( n s ( n s c δ ( a + b ) φ ( n s c ) ( a + b ) ) , n s t ψ 1 ( n s c , a + b ) ) , N ( n s ( n s c δ ( a ) φ ( n s c ) a ) , n s t ψ 1 ( n s c , a ) ) , N ( n s ( n s c δ ( b ) φ ( n s c ) b ) , n s t ψ 1 ( n s c , b ) ) } .

Since all terms of the final inequality of the above inequality are larger than 1ϵ, we can have N(c(δ(a+b)δ(a)δ(b)),t)>1ϵ for all t>0. We can get c(δ(a+b)δ(a)δ(b))=0 for all a,b,cA by ( N 2 ). By using the approximate unit of A, we have that δ(a+b)=δ(a)+δ(b) for all a,bA. Next, we are going to show the derivation property of δ. From (4.2) and (4.1), there exists t 0 >0 such that

N ( n s ( n s z δ ( a b ) φ ( n s z ) ( a b ) ) , n s t ψ 1 ( n s z , a b ) ) 1 ϵ , N ( n s ( φ ( n s z ) a b n s z ( δ ( a ) b + a δ ( b ) ) ) , n s t ψ 2 ( n s z , a b ) ) 1 ϵ

for all t t 0 . By (4.1), we can find n 0 >0 such that n s t ψ 1 ( n s z,ab) t 2 and n s t ψ 2 ( n s z,ab) t 2 for all n n 0 . The following computation

N ( z ( δ ( a b ) δ ( a ) b a δ ( b ) ) , t ) min { N ( n s ( n s z δ ( a b ) φ ( n s z ) ( a b ) ) , t 2 ) , N ( n s ( φ ( n s z ) a b n s z ( δ ( a ) b + a δ ( b ) ) ) , t 2 ) } min { N ( n s ( n s z δ ( a b ) φ ( n s z ) ( a b ) ) , n s t ψ 1 ( n s z , a b ) ) , N ( n s ( φ ( n s z ) a b n s z ( δ ( a ) b + a δ ( b ) ) ) , n s t ψ 2 ( n s z , a b ) ) } 1 ϵ

yields that δ(ab)=δ(a)b+aδ(b) for all a,bA. By (4.2) and (4.4) there exists t 0 >0 such that

N ( n s ( n s z δ ( a ) φ ( n s z ) a ) , n s t ψ 1 ( n s z , a ) ) 1 ϵ , N ( n s ( φ ( n s z ) a n s z δ ( a ) ) , n s t ψ 3 ( n s z , a ) ) 1 ϵ

for all t t 0 . For fixing t>0 temporarily, there exists n 0 >0 such that n s t ψ 1 ( n s z, a ) t 2 and n s t ψ 3 ( n s z,a) t 2 for n n 0 . From the following computation

N ( z ( δ ( a ) δ ( a ) ) , t ) = N ( n s ( n s z δ ( a ) φ ( n s z ) a ) + n s ( φ ( n s z ) a n s z δ ( a ) ) , t ) min { N ( n s ( n s z δ ( a ) φ ( n s z ) a ) , t 2 ) , N ( n s ( φ ( n s z ) a n s z δ ( a ) ) , t 2 ) } min { N ( n s ( n s z δ ( a ) φ ( n s z ) a ) , n s t ψ 1 ( n s z , a ) ) , N ( n s ( φ ( n s z ) a n s z δ ( a ) ) , n s t ψ 3 ( n s z , a ) ) } > 1 ϵ

we can have N(z(δ( a )δ ( a ) ),t)>1ϵ for all t>0. By ( N 2 ) and using approximate unit δ( a )=δ ( a ) for all aA. Thus, δ is a ∗-derivation on A. □