1 Introduction and background

Statistical convergence is a generalization of the usual notion of convergence. The idea of statistical convergence was given in the first edition (published in Warsaw in 1935) of the monograph of Zygmund [1], who called it ‘almost convergence’. Formally the concept of statistical convergence was introduced by Fast [2] in the year 1951 and later reintroduced by Schoenberg [3] in the year 1959. Statistical convergence also arises as an example of ‘convergence in density’ as introduced by Buck [4].

Although statistical convergence was introduced over nearly last 60 years, it has become an active area of research in recent years. Statistical convergence has been studied most recently by several authors [525].

The standard definition of ‘{ x k } is convergent to L’ requires that the set {kN:| x k L|ε} should be finite for every ε>0, where ℕ is the set of natural numbers.

The number sequence { x k } is said to be statistically convergent to the number L provided that the set {kN:| x k L|ε}, instead of being finite, has natural density 0, where the natural density of a subset KN (see [26], Chapter 11) is defined by

δ(K)= lim n 1 n |{kn:kK}|,

where |{kn:kK}| denotes the number of elements of K not exceeding n. A set K is said to be statistically dense [27] if δ(K)=1. A subsequence of a sequence is said to be statistically dense if the set of all indices of its elements is statistically dense. Obviously, we have δ(K)=0 provided that K is a finite set of positive integers.

We shall be particularly concerned with those subsets of ℕ which have natural density zero. To facilitate this, Fridy [10] introduced the following notation: if x={ x k } is a sequence such that x k satisfies property P for all k except a set of natural density zero, then we say that x={ x k } satisfies P for ‘almost all k’ and we abbreviate this by ‘a.a.k’ .

Using this notation, we have the following.

Definition 1.1 The number sequence x={ x k } is said to be statistically convergent to the number L if for each ε>0,

δ( A ε )=0,where  A ε = { k N : | x k L | ε } ,

i.e.,

lim n 1 n | { k n : | x k L | ε } |=0,

i.e.,

| x k L|<εa.a.k.

Following Freedman et al. [28], by a lacunary sequence θ= { k r } r = 0 , where k 0 =0, we shall mean an increasing sequence of non-negative integers with k r k r 1 as r. The intervals determined by θ will be denoted by I r =( k r 1 , k r ], and we let h r = k r k r 1 . Sums of the form i = k r 1 + 1 k r | x i |= i I r | x i | will be written for convenience as I r | x i | and the ratio k r k r 1 will be denoted by q r .

There is a strong connection [28] between the space | σ 1 | of strongly Cesàro summable sequences:

| σ 1 |= { x = { x k } :  there exists  L  such that  1 n k = 1 n | x k L | 0 }

and the sequence space N θ , which is defined by

N θ = { x = { x k } :  there exists  L  such that  1 h r I r | x k L | 0 } .

Fridy and Orhan [29] introduced and studied a concept of convergence, called lacunary statistical convergence, that is related to statistical convergence in the same way as N θ is related to | σ 1 |.

Definition 1.2 Let θ be a lacunary sequence. The number sequence x={ x k } is lacunary statistical convergent or S θ -convergent to L provided that for every ε>0, lim r 1 h r |{k I r :| x k L|ε}|=0. In this case, we write S θ limx=L or x k L( S θ ), and we define S θ ={x: for some L, S θ limx=L}.

Definition 1.3 For a lacunary sequence θ={ k r }, we define the lacunary density or θ density of KN by

δ θ (K)= lim r 1 h r | { k I r : k K } | .

Remark 1.4 For a non-negative regular matrix A=( a n k ), following Freedman and Sember [30], Demirci [8] defined the concept of A-density for a set KN as

δ A (K)= lim n { A χ K } n ,

where χ K is the characteristic function of K.

For A= C 1 , the Cesàro mean of order one, δ A (K) reduces to δ(K), i.e., the natural density of the set K.

For a lacunary sequence θ={ k r }, if we take A=( a n k ) such that

a n k ={ 1 h n , if  k I n ; 0 , otherwise ,

then δ A (K) reduces to δ θ (K), i.e., the lacunary density or θ density of K. Thus the lacunary density or θ density is a particular case of the A-density.

We now introduce the following notation.

For a given lacunary sequence θ={ k r }, if x={ x k } is a sequence such that x k satisfies property P for all k, except a set of θ density zero, then we say that x={ x k } satisfies P for ‘almost all k with respect to θ’ and we abbreviate this by ‘a.a.k w.r.t. θ’.

Using this notation, we have the following.

Definition 1.5 Let θ={ k r } be a lacunary sequence. The number sequence x={ x k } is said to be lacunary statistical convergent or S θ -convergent to L provided that for every ε>0,

| x k L|<εa.a.k w.r.t. θ.

In 1997, Fridy and Orhan [31] introduced the concept of statistical boundedness as follows.

Definition 1.6 The number sequence x={ x k } is statistically bounded if there is a number M>0 such that δ({k:| x k |>M})=0, i.e.,

| x k |Ma.a.k.

We denote the set of all statistically bounded sequences by S(b).

In the same year, i.e., 1997, Tripathy [32] proved a decomposition theorem for statistically bounded sequences and also established a necessary and sufficient condition for a sequence to be statistically bounded.

Quite recently, Bhardwaj and Gupta [33] have introduced and studied the concepts of statistical boundedness of order α, λ-statistical boundedness and λ-statistical boundedness of order α.

The main object of this paper is to introduce and study the new concept of lacunary statistical boundedness.

Definition 1.7 Let θ={ k r } be a lacunary sequence. The number sequence x={ x k } is said to be lacunary statistical bounded or S θ -bounded if there exists M>0 such that

lim r 1 h r | { k I r : | x k | > M } | =0,

i.e.,

δ θ ( { k N : | x k | > M } ) =0,

i.e.,

| x k |Ma.a.k w.r.t. θ.

For a given lacunary sequence θ={ k r }, by S θ (b) we denote the set of all S θ -bounded sequences. Obviously, S θ (b) is a linear space with respect to co-ordinatewise addition and scalar multiplication.

In the next section we establish elementary relations among the concepts of boundedness, lacunary statistical boundedness and lacunary statistical convergence of sequences of numbers. It is shown that for a given lacunary sequence θ={ k r }, a sequence { x k } is lacunary statistical bounded if and only if for almost all k w.r.t. θ, the values x k coincide with those of a bounded sequence. Apart from studying various algebraic properties and computing the Köthe-Toeplitz duals of the sequence space S θ (b), a decompositon theorem for lacunary statistical boundedness is also established. In Section 3, we characterize those θ for which S θ (b)=S(b). It is also shown that precisely those subsequences of a lacunary statistical bounded sequence are lacunary statistical bounded which are lacunary statistical dense. In the last section, we consider the inclusion of S θ (b) by S θ (b) where θ is a lacunary refinement of θ. Recall [28] that the lacunary sequence θ ={ k r } is called a lacunary refinement of the lacunary sequence θ={ k r } if { k r }{ k r }. A general description of inclusion between two arbitrary lacunary methods of statistical boundedness is also given.

Before proceeding to establish the proposed results, we pause to collect some more definitions, which may be conveniently found in [34, 35].

A sequence space X is called

  1. (i)

    normal (or solid) if y={ y k }X whenever | y k || x k |, k1, for some x={ x k }X,

  2. (ii)

    monotone if it contains the canonical preimages of all its stepspaces,

  3. (iii)

    sequence algebra if xy={ x k y k }X whenever x={ x k },y={ y k }X.

The idea of dual sequence spaces was introduced by Köthe and Toeplitz [36] whose main results concerned α-duals; the α-dual of sequence space X being defined as

X α = { a = { a k } : k | a k x k | <  for all  x = { x k } X } .

In the same paper [36], they also introduced another kind of dual, namely, the β-dual (see [37] also, where it is called the g-dual by Chillingworth) defined as

X β = { a = { a k } : k a k x k  converges for all  x = { x k } X } .

Obviously ϕ X α X β , where ϕ is the well-known sequence space of finitely non-zero scalar sequences. Also if XY, then Y η X η for η=α or β. For any sequence space X, we denote ( X δ ) η by X δ η where δ,η=α or β. It is clear that X X η η where η=α or β.

For a sequence space X, if X= X α α then X is called a Köthe space or a perfect sequence space.

2 Some inclusion relations and a decomposition theorem

We begin by establishing elementary connections between boundedness, lacunary statistical boundedness and lacunary statistical convergence.

We state the following result without proof in view of the fact that the empty set has zero lacunary density for every lacunary sequence θ.

Theorem 2.1 Every bounded sequence is lacunary statistical bounded, i.e., S θ (b) for every lacunary sequence θ.

Remark 2.2 The converse of the above theorem need not be true.

Example 2.3 Define x={ x i } as

x i ={ k r 1 + 1 , if  i = k r 1 + 1 , r = 1 , 2 , 3 , ; 0 , otherwise ,

where θ={ k r } is a lacunary sequence. Clearly x={ x i } . But lim r 1 h r |{k I r :| x k |> 1 2 }|= lim r 1 h r =0 and so x={ x i } S θ (b).

Remark 2.4 From Theorem 2.1 and above example, it is clear that lacunary statistical boundedness is a generalization of the usual concept of boundedness of sequences.

Theorem 2.5 Every lacunary statistical convergent sequence is lacunary statistical bounded, but not conversely.

Proof Let x k L( S θ ). Then for each ε>0, we have lim r 1 h r |{k I r :| x k L|ε}|=0. The result now follows from the fact that {k I r :| x k ||L|+ε}{k I r :| x k L|ε}.

It can easily be verified that lacunary statistical bounded sequence { ( 1 ) k } is not lacunary statistical convergent. □

Remark 2.6 There are sequences which are not lacunary statistical bounded for any lacunary sequence θ. One example of such sequences is x={ x k } where x k =k for each kN. Hence S θ (b)ω where ω is the space of all scalar sequences.

Theorem 2.7 For a given lacunary sequence θ={ k r }, a sequence x={ x k } is lacunary statistical bounded if and only if there exists a bounded sequence y={ y k } such that x k = y k a.a.k w.r.t. θ.

Proof First suppose that x={ x k } is a lacunary statistical bounded sequence. Then there exists M0 such that δ ( θ ) (K)=0 where K={kN:| x k |>M}. Let

y k ={ x k , if  k K ; 0 , otherwise .

Then y={ y k } and y k = x k a.a.k w.r.t. θ.

Conversely, as y={ y k } so there exists L0 such that | y k |L for all kN. Let D={kN: x k y k }. As δ ( θ ) (D)=0, so | x k |L a.a.k w.r.t. θ. □

Corollary 2.8 Every lacunary statistical bounded sequence has a bounded subsequence.

A decomposition theorem for statistical boundedness was given by Tripathy [32]. We now give a lacunary analog of this result.

Theorem 2.9 (Decomposition theorem)

If x={ x k } is a lacunary statistical bounded sequence, then there exists a bounded sequence y={ y k } and a lacunary statistical null sequence z={ z k } such that x=y+z. However, this decomposition is not unique.

Proof As x={ x k } is a lacunary statistical bounded sequence, so there exists M>0 such that δ θ (A)=0, where A={kN:| x k |>M}. Define sequences y={ y k } and z={ z k } as follows:

y k = { x k , if  k N A ; 0 , if  k A , z k = { 0 , if  k N A ; x k , if  k A .

Clearly x=y+z where y is a bounded sequence and z is a lacunary statistical null sequence, i.e., S θ (b) + c θ 0 where c θ 0 denotes the set of all lacunary statistical null sequences. As , c θ 0 S θ (b), so + c θ 0 S θ (b). Consequently, we have S θ (b)= + c θ 0 . Using the fact that ϕ c θ 0 , where ϕ is the space of finitely non-zero scalar sequences, we have S θ (b) c θ 0 , i.e., the decomposition is not unique. □

Theorem 2.10

  1. (a)

    S θ (b) is normal and hence monotone.

  2. (b)

    S θ (b) is a sequence algebra.

The proof is easy and so omitted.

Proposition 2.11 [ S θ ( b ) ] α = [ S θ ( b ) ] β =ϕ, the space of finitely non-zero scalar sequences.

Proof To show that [ S θ ( b ) ] α =ϕ, it is sufficient to show that [ S θ ( b ) ] α ϕ since ϕ [ S θ ( b ) ] α obviously. Let { a k } [ S θ ( b ) ] α . Then k | a k x k |< for all x={ x k } S θ (b). Suppose { a k }ϕ, i.e., { a k } has infinitely many non-zero terms. Following Lemma 5 of [12], for each rN, if I r contains a k such that a k 0, let m(r) be the least such k; otherwise leave m(r) undefined. Thus there are infinitely many m(r)’s and m(r) I r . Now define x k = 1 | a k | if k=m(r) for some r=1,2,3, and x k =0 otherwise. Now 1 h r |{kI(r):| x k |>0}|= 1 h r |{kI(r):| x k |0}|= 1 h r 0 as r and so { x k } S θ (b). But I r | a k x k |=1 for infinitely many r and so k | a k x k |=. □

In view of the fact [[35], p.52] that for a monotone sequence space, α- and β-dual spaces coincide, we have [ S θ ( b ) ] β = [ S θ ( b ) ] α =ϕ.

Corollary 2.12 S θ (b) is not perfect.

Proof As [ S θ ( b ) ] α α = ϕ α =ω, so S θ (b) is not a perfect space. □

3 Lacunary statistical boundedness versus statistical boundedness

In this section, we study the inclusions S θ (b)S(b) and S(b) S θ (b) under certain restrictions on θ={ k r } and characterize those θ for which S θ (b)=S(b).

Lemma 3.1 For any lacunary sequence θ, S(b) S θ (b) if and only if lim inf r q r >1.

Proof (Sufficiency). If lim inf r q r >1, then there exists δ>0 such that q r 1+δ for sufficiently large r. Since h r = k r k r 1 , so we have h r k r δ 1 + δ and k r 1 h r 1 δ . For { x k } S θ (b), there exists M>0 such that lim r 1 h r |{k I r :| x k |>M}|=0.

Now for sufficiently large r, we have

1 k r | { k k r : | x k | > M } | h r k r 1 h r | { k I r : | x k | > M } | δ 1 + δ 1 h r | { k I r : | x k | > M } | .

This proves the sufficiency.

(Necessity). Assume that lim inf r q r =1. Proceeding as in Lemma 2.1 of [28], we can select a subsequence { k r ( j ) } of θ={ k r } satisfying

k r ( j ) k r ( j ) 1 <1+ 1 j and k r ( j ) 1 k r ( j 1 ) >j,where r(j)r(j1)+2.

Define x={ x k } by

x i ={ i , if  i I r ( j ) ,  for some  j = 1 , 2 , 3 , ; 0 , otherwise .

Now for any M>0, there exists j 0 N (actually there are infinitely many j 0 ) such that k r ( j 0 ) 1 >M and we have

1 h r ( j 0 ) | { k I r ( j 0 ) : | x k | > M } | 1 h r ( j 0 ) | { k I r ( j 0 ) : | x k | > k r ( j 0 ) 1 } | = 1

i.e., 1 h r ( j ) |{k I r ( j ) :| x k |>M}|=1 for all j j 0 . Also, for rr(j), 1 h r |{k I r :| x k |>M}|=0. Thus x={ x k } S θ (b).

Now for any t sufficiently large integer, we can find the unique j for which k r ( j ) 1 <t k r ( j + 1 ) 1 and write

1 t | { k t : | x k | > 1 2 } | k r ( j 1 ) + h r ( j ) k r ( j ) 1 < 1 j + 1 j = 2 j .

Since t implies j, we have { x k }S(b). □

Remark 3.2 The sequence { x k }, constructed in the necessity part of above lemma, is an example of a statistical bounded sequence which is not lacunary statistical bounded.

Lemma 3.3 For any lacunary sequence θ, S θ (b)S(b) if and only if lim sup r q r <.

Proof The proof of sufficiency part can be established following a similar technique to Lemma 3 of [29]. For necessity, we assume that lim sup r q r =. Following Lemma 2.2 of [28], we can select a subsequence { k r ( j ) } of the lacunary sequence θ such that q r ( j ) >j. Define x={ x k } as

x i ={ i , if  k r ( j ) 1 < i 2 k r ( j ) 1 ,  for some  j = 1 , 2 , ; 0 , otherwise .

Then τ r ( j ) = 1 h r ( j ) |{i I r ( j ) :| x i |> 1 2 }|= k r ( j ) 1 k r ( j ) k r ( j ) 1 < 1 j 1 and, if r r j , τ r =0. Hence { x k } S θ (b). However, for any real M>0, there exists some j 0 such that k r ( j ) 1 >M for all j j 0 ;

1 2 k r ( j ) 1 | { i 2 k r ( j ) 1 : | x i | > M } | 1 2 k r ( j ) 1 | { i 2 k r ( j ) 1 : | x i | > k r ( j ) 1 } | 1 2

and this is true for all j j 0 . Thus { x k }S(b). □

Remark 3.4 The sequence { x k }, constructed in the necessity part of above lemma, is an example of a lacunary statistical bounded sequence which is not statistical bounded.

Combining Lemma 3.1 and Lemma 3.3 we have the following.

Theorem 3.5 Let θ be a lacunary sequence. Then S θ (b)=S(b) if and only if 1< lim inf r q r lim sup r q r <.

Theorem 3.6

S(b)= lim inf r q r > 1 S θ (b)= lim sup r q r < S θ (b).

Proof In view of Lemma 3.1, we have S(b) lim inf r q r > 1 S θ (b). Suppose, if possible, x={ x k } lim inf r q r > 1 S θ (b) but xS(b). We have { x k } S θ (b) for all θ={ k r } with lim inf r q r >1. If we take θ={ 2 r }, then in view of Theorem 3.5 we have S θ (b)=S(b) and so xS(b), contrary to our supposition. Hence S(b)= lim inf r q r > 1 S θ (b). The remaining part can be proved similarly and hence is omitted. □

Remark 3.7 It is well known that every subsequence of a bounded sequence is bounded. However, for lacunary statistical bounded sequences this is no longer true. This can be verified by the following example.

Example 3.8 Let θ={ k r } be a lacunary sequence with lim inf r q r >1 and consider the sequence x={ x k } as

x k ={ k , if  k  is a square ; 0 , if  k  is not a square ,

i.e., x={ x k }=(1,0,0,4,0,0,0,0,9,). Then { x k }S(b) S θ (b). However, { y k }=(1,4,9,) is a subsequence of the lacunary statistical bounded sequence { x k } but is not lacunary statistical bounded.

We now characterize those subsequences of a lacunary statistical bounded sequence which are themselves lacunary statistical bounded. Before doing so, we introduce the following definition.

Definition 3.9 Let θ be a lacunary sequence. A subset A of ℕ is said to be lacunary statistical dense or θ dense if δ θ (A)=1. A subsequence of a sequence is said to be lacunary statistical dense if the set of all indices of its elements is lacunary statistical dense.

In view of Theorem 2.1 of Burgin and Duman [27] we state the following result without proof.

Theorem 3.10 A sequence is lacunary statistical bounded if and only if every lacunary statistical dense subsequence of it is lacunary statistical bounded.

4 Inclusion between two lacunary methods of statistical boundedness

Our first result shows that if β is a refinement of θ, then S β (b) S θ (b).

We state the following result, which can be established following the technique of Theorem 7 of Fridy and Orhan [29].

Theorem 4.1 If β is a lacunary refinement of θ and { x k } S β (b), then { x k } S θ (b), i.e., S β (b) S θ (b).

Following Li [13], we state the next result without proof in which we impose certain restriction on a refinement β of θ so as to have the reverse inclusion i.e., S θ (b) S β (b).

Theorem 4.2 Suppose β={ r } is a lacunary refinement of the lacunary sequence θ={ k r }. Let I r =( k r 1 , k r ] and J r =( r 1 , r ], r=1,2,3, . If there exists δ>0 such that | J j | | I i | δ for every J j I i , then S θ (b) S β (b).

The following result is a consequence of Theorem 4.1 and Theorem 4.2.

Corollary 4.3 Under the hypothesis of Theorem  4.2, we have S θ (b)= S β (b).

The next theorem provides a sufficient condition for lacunary sequences β={ r } and θ={ k r } to yield the inclusion relation S θ (b) S β (b).

In view of Theorem 2 of Li [13] we state the following result without proof.

Theorem 4.4 Suppose β={ r }, θ={ k r } are two lacunary sequences. Let I r =( k r 1 , k r ], J r =( r 1 , r ], r=1,2,3, , and I i j = I i J j , i,j=1,2,3, . If there exists δ>0 such that | I i j | | I i | δ for every i,j=1,2,3, , provided I i j ϕ, then S θ (b) S β (b).

Remark 4.5 If the condition in Theorem 4.4 is replaced by | I i j | | J j | δ for every i,j=1,2,3, , provided I i j ϕ, then it can be seen that S β (b) S θ (b).

Combining Remark 4.5 and Theorem 4.4, we get the following.

Theorem 4.6 Suppose β={ r }, θ={ k r } are two lacunary sequences. Let I r =( k r 1 , k r ], J r =( r 1 , r ], r=1,2,3, , and I i j = I i J j , i,j=1,2,3, . If there exists δ>0 such that | I i j | | I i | + | J j | δ for every i,j=1,2,3, , provided I i j ϕ, then S θ (b)= S β (b).