1 Introduction

The idea of statistical convergence was given by Zygmund [1] in the first edition of his monograph published in Warsaw in 1935. The concept of statistical convergence was formally introduced by Steinhaus [2] and Fast [3] and later reintroduced by Schoenberg [4]. Over the years and under different names statistical convergence has been applied in the theory of Fourier analysis, ergodic theory, number theory, measure theory, trigonometric series, turnpike theory, and Banach spaces. Later on it was further investigated from the sequence space point of view and linked with summability theory by Šalàt [5], Fridy [6], Connor [7], Fridy and Orhan [8], Rath and Tripathy [9], Mòricz [10], Malkowsky and Savas [11], Mursaleen [12], Et [13], Bhardwaj and Bala [14, 15], Savas [1619], Çolak [20], Savas and Mohiuddine [21], Mohiuddine et al. [22], and many others.

Statistical convergence depends on the density of subsets of the set N={1,2,3,}. The natural density of a subset A of ℕ is defined by

δ(A)= lim n 1 n |{kn:kA}|,

where the vertical bars indicate the total number of elements in the enclosed set [23]. It is clear that any finite subset of ℕ has zero natural density and δ( A c )=1δ(A), where A c =NA. A set A is said to be statistically dense [24] if δ(A)=1. A subsequence of a sequence is said to be statistically dense if the set of all indices of its elements is statistically dense. A sequence ( x k ) (of real or complex numbers) is said to be statistically convergent to some number L if for every ϵ>0, δ({kN:| x k L|>ϵ})=0. In this case, we write st- lim k x k =L. We shall denote the set of all statistically convergent sequences by [S].

Throughout this paper, we deal with sequences of scalars. We recall [6] that 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’.

The following concept is due to Fridy [6]. A sequence ( x k ) is said to be statistically Cauchy if for each ϵ>0, there exists a number N=N(ϵ) such that | x k x N |<ϵ, for a.a.k, that is, δ({kN:| x k x N |ϵ})=0. It was shown that a number sequence is statistically convergent if and only if it is statistically Cauchy.

Fridy [25] enriched the theory of statistical convergence by introducing the concept of statistical limit point and statistical cluster point as follows: If { x k ( j ) } is a subsequence of x=( x k ) and K={k(j):jN}, then abbreviate ( x k ( j ) ) by ( x ) K . In case δ(K)0, ( x ) K is called a nonthin subsequence of x. The number ζ is a statistical limit point of the number sequence x provided that there is a nonthin subsequence of x that converges to ζ. The number γ is a statistical cluster point of the number sequence x provided that for every ϵ>0, the set {kN:| x k γ|<ϵ} does not have density zero.

In 2000, Mursaleen [12] generalized the concept of statistical convergence by introducing the concept of λ-statistical convergence as follows. A sequence x=( x k ) is said to be λ-statistically convergent or S λ -convergent to L if for every ϵ>0

lim n 1 λ n | { k I n : | x k L | > ϵ } | =0,

where I n =[n λ n +1,n] and λ=( λ n ) is a non-decreasing sequence of positive numbers tending to ∞ such that λ n + 1 λ n +1, λ 1 =1. We shall denote the set of all such sequences ( λ n ) by Γ and the set of all λ-statistically convergent sequences by S λ .

Generalizing the concept of statistical convergence, Çolak [26] in 2010 introduced the concept of statistical convergence of order α by defining the α-density δ α (E) of a subset E of ℕ as follows:

δ α (E)= lim n 1 n α | { k n : k E } | ,

provided the limit exists. It is clear that any finite subset of ℕ has zero α-density. Note that the α-density of any set reduces to the natural density of the set in the case α=1.

Let 0<α1 be given. A sequence x=( x k ) is said to be statistically convergent of order α if there is a complex number L such that

lim n 1 n α | { k n : | x k L | ϵ } | =0

for every ϵ>0. The set of all statistically convergent sequences of order α will be denoted by [ S ] α .

In 2011, Çolak and Bektaş [27] introduced the concept of λ-statistical convergence of order α as follows: A sequence ( x k ) is said to be λ-statistically convergent of order α to L, if for given ϵ>0

lim n 1 λ n α | { k I n : | x k L | > ϵ } |=0,

where I n =[n λ n +1,n], λ=( λ n )Γ and 0<α1. The concept of λ-statistical convergence of order α is a generalization of the concepts of statistical convergence, λ-statistical convergence, and statistical convergence of order α.

Quite recently, the concepts of ‘λ-statistical convergence of order α for the sequences of function’ and ‘the pointwise and uniform statistical convergence of order α’ have been introduced by Et et al. [28] and Çinar et al. [29], respectively.

In 1997, a statistical analog of a very basic property of convergent sequences was given by Fridy and Orhan [30] by the formal introduction of the concept of statistical boundedness as follows: ‘The real number sequence x is statistically bounded if there is a number B such that δ({k:| x k |>B})=0’.

They developed the statistical analogs of properties of the ordinary limit superior and inferior, and a natural analog of Knopp’s core. In the same year, Tripathy [31] proved the Decomposition Theorem for statistically bounded sequences and established the necessary and sufficient condition for a sequence to be statistically bounded.

In the present paper, we take the opportunity to contribute to the theory of statistical convergence, by introducing the concepts of λ-statistical boundedness, statistical boundedness of order α, and λ-statistical boundedness of order α. In the second section of this paper, we study and examine the concept of statistical boundedness to establish statistical analogs of various well-known results concerning bounded sequences. The third section is devoted to the introduction of the concept of statistical boundedness of order α where 0<α1. The relationship between statistical boundedness of order α and statistical boundedness of order β for αβ has been studied. In the fourth section of this paper, we introduce the concept of λ-statistical boundedness and prove inclusion relations between S(b), S λ (b) and S μ (b) under different conditions. In the last section, we introduce the concept of λ-statistical boundedness of order α and establish the condition for a statistically bounded sequence to be λ-statistically bounded of order α. It is observed that the concept of λ-statistical boundedness of order α is more general than the concepts of statistical boundedness, λ-statistical boundedness, and statistical boundedness of order α as it includes these concepts for some particular choices of α and λ.

Before proceeding to establish the proposed results, we recall some more definitions, which may be found in [32, 33].

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,

  4. (iv)

    symmetric if ( x k )X implies ( x π ( k ) )X where π is a permutation on ℕ.

The idea of dual sequence spaces was introduced by Köthe and Toeplitz [34] whose main results concerned α-duals; the α-dual of a 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 [34], they also introduced another kind of dual, namely, the β-dual (see [35] 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 more results on statistical boundedness

In the present section, we examine the concept of statistical boundedness in greater detail by giving statistical analogs of some of the results concerning boundedness.

Definition 2.1 [30]

A sequence x=( x k ) is said to be statistically bounded if there exists some L0 such that

δ ( { k : | x k | > L } ) =0,i.e.,| x k |L a.a.k.

By S(b), we shall denote the linear space of all statistically bounded sequences.

Bounded sequences are obviously statistically bounded as the empty set has zero natural density. However, the converse is not true, as the following example demonstrates.

Example 2.2 Consider the sequence x=( x k ) where

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

Clearly ( x k ) is not a bounded sequence. However, δ({k:| x k |> 1 2 })=0, as the set of squares has zero natural density and hence ( x k ) is statistically bounded.

Proposition 2.3 Every convergent sequence is statistically bounded.

Although a statistically convergent sequence does not need to be bounded, the following proposition shows that every statistical convergent sequence is statistically bounded.

Proposition 2.4 Every statistical convergent sequence is statistically bounded.

Proof Let ( x k ) converges to L statistically. So for each ϵ>0, δ({k:| x k L|>ϵ})=0. As {k:| x k |>|L|+ϵ}{k:| x k L|>ϵ}, so | x k ||L|+ϵ a.a.k. □

The following example illustrates that not every sequence is statistically bounded.

Example 2.5 Consider the sequence x=( x k )=(1,2,3,). Then for any L0, we have {k:| x k |>L}=NS, where S is a finite subset of N and so δ({k:| x k |>L})=1. Thus ( x k ) is not statistically bounded.

It is well known that every subsequence of a bounded sequence is bounded. However, for statistically bounded sequences this is no longer true. For example, the sequence ( y k )=(1,4,9,) is a subsequence of the statistically bounded sequence ( x k ), as given in Example 2.2 but ( y k ) is not statistically bounded.

A useful characterization of a statistically bounded sequence in terms of its bounded subsequence has been given by Tripathy [31] as follows.

Theorem 2.6 [31] ( ξ k ) is statistically bounded if and only there exists such a set K={ k 1 < k 2 < k 3 << k n <}N such that δ(K)=1 and { ξ k n } n N , the space of all bounded scalar sequences.

We give another characterization of a statistically bounded sequence in terms of its statistically dense subsequences as follows.

Theorem 2.7 A sequence is statistically bounded if and only if every statistically dense subsequence of it is statistically bounded.

The proof is similar to that of the corresponding result for statistical convergence in [[24], Theorem 2.1] and hence is omitted.

We now give a statistical analog of the well-known result that ‘If ( x k ) is a null sequence and ( y k ) is a bounded sequence, then ( x k y k ) is a null sequence.’

Proposition 2.8 If ( x k ) converges statistically to 0 and ( y k )S(b), then ( x k y k ) converges statistically to 0.

Fridy [6] has shown that a sequence x=( x k ) is statistically convergent if and only if there exists a convergent sequence y=( y k ) such that x k = y k a.a.k. We now establish a similar result for statistically bounded sequences. Our proof is quite different from that of Fridy.

Theorem 2.9 x=( x k ) is a statistically bounded sequence if and only if there exists a bounded sequence y=( y k ) such that x k = y k a.a.k.

Proof First suppose x=( x k ) is a statistically bounded sequence. Then there exists L0 such that δ(A)=0 where A={kN:| x k |>L}. Let

y k ={ x k , if  k A , 0 , otherwise .

Then y=( y k ) and y k = x k a.a.k.

Conversely, as y=( y k ) so there exists L0 such that | y k |L for all kN. Let D={kN: x k y k }. Clearly δ(D)=0. This gives | x k |L a.a.k because {kN:| x k |>L}D. □

Remark 2.10 Tripathy [31] has shown that S(b) + c 0 ¯ where c 0 ¯ and denote the spaces of statistically null and bounded sequences, respectively. We observe that + c 0 ¯ =S(b). But the representation of every element of S(b) as the sum of an element of and of c 0 ¯ is not unique, i.e., S(b) c 0 ¯ as c 0 ¯ {0}. In fact, c 0 ¯ c 0 where c 0 is the space of null sequences.

Our next result is a statistical analog of a well-known result stating that every Cauchy sequence is bounded but not conversely.

Theorem 2.11 Every statistically Cauchy sequence is statistically bounded, but the converse does not need to be true.

Proof Let x=( x k ) be a statistically Cauchy sequence. Then for each ϵ>0, there exists a number N (=N(ϵ)) such that | x k x N |<ϵ a.a.k. This implies that | x k |<L a.a.k, where L=ϵ+| x N |.

The sequence x=( x k )=(1,1,1,1,) is bounded and hence statistically bounded but is not statistically Cauchy. □

Proposition 2.12 [25]

Suppose x is a number sequence that has a monotone subsequence ( x ) M . If δ(M)=1 and x is bounded on M, then x is statistically convergent.

Corollary 2.13 Every monotone and statistically bounded sequence is statistically convergent.

Theorem 3 of [25] can be restated in terms of statistical boundedness as follows.

Theorem 2.14 Every statistically bounded sequence has a statistical cluster point.

Theorem 2.15

  1. (a)

    S(b) is not symmetric.

  2. (b)

    S(b) is normal and hence monotone.

  3. (c)

    S(b) is a sequence algebra.

Proof

  1. (i)

    Let x=(1,0,0,0,4,0,0,0,0,9,)S(b) and y=(0,1,4,0,9,16,25,36,0,) be a rearrangement of terms of the sequence ( x k ). Clearly for any L0, δ({k:| y k |>L})0.

  2. (ii)

    Let x=( x k )S(b) and y=( y k ) be such that | y k || x k | for all kN. As ( x k )S(b), there exists L0 such that δ({k:| x k |>L})=0. Clearly y=( y k )S(b) as {k:| y k |>L}{k:| x k |>L}. In view of the fact [33] that every normal space is monotone, S(b) is monotone.

  3. (iii)

    Let ( x k ),( y k )S(b). Then there exists L,M0 such that δ({k:| x k |L})=0 and δ({k:| y k |M})=0. The proof follows from the fact that {k:| x k y k |LM}{k:| x k |L}{k:| y k |M}.

 □

Proposition 2.16 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). Let, if possible, ( a k )ϕ, i.e., ( a k ) has infinitely many non-zero terms. Following [[6], p.7], we choose an increasing sequence ( k i ) of positive integers such that for each i, k i > i 2 and a k i 0. Define x={ x k } as

x k i ={ 1 a k i , i N , 0 , otherwise .

Then |{kn:| x k |>0}| n and so ( x k )S(b). But k | a k x k |= i 1=, which is a contradiction to the fact that ( a k )S ( b ) α . Hence ( a k )ϕ.

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

The proofs of the following Tauberian theorems are similar to the proofs of Theorem 3 and Theorem 5 in [6] and hence are omitted.

Theorem 2.17 If x=( x k ) is a sequence such that ( x k )S(b) and Δ x k =O( 1 k ), then ( x k ) .

Theorem 2.18 Let ( k ( i ) ) i N be an increasing sequence of positive integers such that lim inf i k ( i + 1 ) k ( i ) >1 and let x be a corresponding gap sequence: Δ x k =0 if kk(i) for i=1,2, ; if ( x k )S(b), then ( x k ) .

3 Statistical boundedness of order α

In the present section, we introduce and examine the concept of statistical boundedness of order α, where α is any real number such that 0<α1.

Definition 3.1 Let 0<α1 be given. A sequence x=( x k ) is said to be statistically bounded of order α if

lim n 1 n α | { k n : | x k | > M } |=0,for some M>0.

By [ S ( b ) ] α , we shall denote the linear space of all statistically bounded sequences of order α. For α=1, the statistical boundedness of order α is the same as the statistical boundedness. We do not talk of statistical boundedness of order α, α>1, since in this case [ S ( b ) ] α =ω, the space of all scalar sequences, i.e., statistical boundedness, becomes trivial.

Theorem 3.2 [ S ( b ) ] α for all α, 0<α1 and the inclusion is strict.

Proof The proof follows from the fact that the α-density of an empty set is zero. For strict inclusion, consider x=( x k ), defined by

x k ={ k , k = n 2 , 0 , k n 2  for  k N .

Then ( x k ) . But lim n 1 n α |{kn:| x k |>0}|=0, for α> 1 2 and so ( x k ) [ S ( b ) ] α for α> 1 2 . □

Now, one may ask a natural question: Is there any unbounded sequence which is not statistically bounded of order α, for any α (0<α1)? The answer is yes. In fact the sequence ( x k )=(1,2,3,) is an unbounded sequence but there does not exist any α, 0<α1 such that ( x k ) is statistically bounded of order α.

Theorem 3.3 Let 0<αβ1. Then [ S ( b ) ] α [ S ( b ) ] β and the inclusion is strict for α<β.

Proof If 0<αβ1, then

lim n 1 n β | { k n : | x k | > M } | lim n 1 n α | { k n : | x k | > M } |

and this gives [ S ( b ) ] α [ S ( b ) ] β . The inclusion is strict in view of the example cited in Theorem 3.2 as ( x k ) [ S ( b ) ] β for 1 2 <β1, but ( x k ) [ S ( b ) ] α for 0<α 1 2 . □

Corollary 3.4

  1. (a)

    [ S ( b ) ] α = [ S ( b ) ] β if and only if α=β.

  2. (b)

    [ S ( b ) ] α S(b) i.e., every statistically bounded sequence of order α (0<α1) is statistically bounded. In fact [ S ( b ) ] α =S(b) if and only if α=1.

The next theorem shows that a statistically convergent sequence of order α is statistically bounded of order α (0<α1).

Theorem 3.5 For 0<α1, [ S ] α [ S ( b ) ] α , the inclusion being strict.

Proof Let ( x k ) [ S ] α . Then there exists some LC, such that

lim n 1 n α | { k n : | x k L | ϵ } | =0,for every ϵ>0.

Now the result follows from the fact that

lim n 1 n α | { k n : | x k | > | L | + ϵ } | lim n 1 n α | { k n : | x k L | ϵ } | .

For strict inclusion, we see ( x k ) [ S ( b ) ] α but ( x k ) [ S ] α where

x k ={ 1 , k = 2 n , 1 , k 2 n ; k , n N .

 □

4 λ-Statistical boundedness

In the present section, we introduce and examine the concept of λ-statistical boundedness and obtain the condition on λ=( λ n )Γ for which the concept of λ-statistical boundedness coincides with the concept of statistical boundedness.

Definition 4.1 Let λ=( λ n )Γ. A sequence ( x k ) is said to be λ-statistically bounded if there exists M0 such that

lim n 1 λ n | { k I n : | x k | > M } |=0,

where I n =[n λ n +1,n]. For λ n =n, λ-statistical boundedness is the same as statistical boundedness. By S λ (b), we shall denote the linear space of all λ-statistically bounded sequences.

Theorem 4.2 S λ (b), the inclusion being strict.

Proof The inclusion is strict in view of the sequence x=( x k ):

x k ={ k , k = n 2 , 0 , k n 2  for  k N

and for λ=(n). □

Theorem 4.3 Let λ=( λ n ) and μ=( μ n ) be two sequences in Γ such that λ n μ n for all n n 0 .

  1. (a)

    If lim inf n λ n μ n >0, then S μ (b) S λ (b).

  2. (b)

    If lim n λ n μ n =1, then S λ (b) S μ (b).

  3. (c)

    If lim n λ n μ n =1, then S λ (b)= S μ (b).

Proof (a) Let lim inf n λ n μ n >0 and ( x k ) S μ (b). Then there exists M>0 such that

lim n 1 μ n | { k I n : | x k | > M } |=0,

where I n =[n μ n +1,n]. Now {k I n :| x k |>M}{k I n :| x k |>M} for all n n 0 and so 1 μ n |{k I n :| x k |>M}| λ n μ n 1 λ n |{k I n :| x k |>M}| which in turn implies that lim n 1 λ n |{k I n :| x k |>M}|=0.

  1. (b)

    Let ( x k ) S λ (b). Then

    1 μ n | { k I n : | x k | > M } | = 1 μ n | { k I n I n : | x k | > M } | + 1 μ n | { k I n : | x k | > M } | 1 μ n ( μ n λ n ) + 1 λ n | { k I n : | x k | > M } | = ( 1 λ n μ n ) + 1 λ n | { k I n : | x k | > M } | for all  n n 0 0 as  n

and so ( x k ) S μ (b).

  1. (c)

    The proof follows from parts (a) and (b). □

Corollary 4.4 Let λ=( λ n )Γ.

  1. (a)

    If lim inf n λ n n >0, then S(b) S λ (b).

  2. (b)

    If lim n λ n n =1, then S λ (b)S(b) and hence S λ (b)=S(b).

Theorem 4.5 Every λ-statistically convergent sequence is λ-statistically bounded.

The proof is easy and therefore is omitted.

5 λ-Statistical boundedness of order α

In this last section, we generalize the concepts of statistical boundednes, statistical boundedness of order α, and λ-statistical boundedness by introducing the concept of λ-statistical boundedness of order α.

Definition 5.1 Let λ=( λ n )Γ and 0<α1. A sequence ( x k ) is said to be λ-statistically bounded of order α if there exists M0 such that

lim n 1 λ n α | { k I n : | x k | > M } |=0,

where I n =[n λ n +1,n]. By [ S λ ( b ) ] α , we denote the linear space of all λ-statistically bounded sequences of order α. We observe that λ-statistical boundedness of order α

  1. (a)

    for λ n =n is the same as the statistical boundedness of order α,

  2. (b)

    for α=1 is the same as the λ-statistical boundedness,

  3. (c)

    for λ n =n, α=1 is the same as the statistical boundedness.

Theorem 5.2 [ S λ ( b ) ] α , the inclusion being strict.

The proof is easy and therefore is omitted.

The proof of the following theorem is similar to the proof of Theorem 3.3 in [28] and therefore is omitted.

Theorem 5.3 Let λ=( λ n ) and μ=( μ n ) be two sequences in Γ such that λ n μ n for all n n 0 and 0<αβ1.

  1. (a)

    If lim inf n λ n α μ n β >0, then [ S μ ( b ) ] β [ S λ ( b ) ] α .

  2. (b)

    If lim n λ n α μ n β =1 and lim n μ n μ n β =1, then [ S λ ( b ) ] α [ S μ ( b ) ] β .

Corollary 5.4 Let λΓ and 0<α1.

  1. (a)

    If lim inf n λ n α n >0, then S(b) [ S λ ( b ) ] α .

  2. (b)

    If lim n λ n α n =1, then [ S λ ( b ) ] α S(b) and so [ S λ ( b ) ] α =S(b).

Theorem 5.5 Every λ-statistically convergent sequence of order α is λ-statistically bounded of order α.

The proof is easy and therefore is omitted.