Skip to main content
Springer logoLink to Springer
. 2017 Jun 2;2017(1):128. doi: 10.1186/s13660-017-1401-4

Some normed binomial difference sequence spaces related to the p spaces

Meimei Song 1, Jian Meng 1,
PMCID: PMC5487949  PMID: 28680231

Abstract

The aim of this paper is to introduce the normed binomial sequence spaces bpr,s() by combining the binomial transformation and difference operator, where 1p. We prove that these spaces are linearly isomorphic to the spaces p and , respectively. Furthermore, we compute Schauder bases and the α-, β- and γ-duals of these sequence spaces.

Keywords: sequence space; matrix domain; Schauder basis; α-, β- and γ-duals

Introduction and preliminaries

Let w denote the space of all sequences. By p, , c and c0, we denote the spaces of p-absolutely summable, bounded, convergent and null sequences, respectively, where 1p<. Let Z be a sequence space, then Kizmaz [1] introduced the following difference sequence spaces:

Z(Δ)={(xk)w:(Δxk)Z}

for Z=,c,c0, where Δxk=xkxk+1 for each kN={1,2,3,}, the set of positive integers. Since then, many authors have studied further generalization of the difference sequence spaces [26]. Moreover, Altay and Polat [7], Başarir and Kara [812], Kara [13], Kara and İlkhan [14], Polat and Başar [15], and many others have studied new sequence spaces from a matrix point of view that represent difference operators.

For an infinite matrix A=(an,k) and x=(xk)w, the A-transform of x is defined by Ax={(Ax)n} and is supposed to be convergent for all nN, where (Ax)n=k=0an,kxk. For two sequence spaces X, Y and an infinite matrix A=(an,k), the sequence space XA is defined by XA={x=(xk)w:AxX}, which is called the domain of matrix A in the space X. By (X:Y), we denote the class of all matrices such that XYA.

The Euler means Er of order r is defined by the matrix Er=(en,kr), where 0<r<1 and

en,kr={(nk)(1r)nkrkif 0kn,0if k>n.

The Euler sequence spaces epr and er were defined by Altay, Başar and Mursaleen [16] as follows:

epr={x=(xk)w:n|k=0n(nk)(1r)nkrkxk|p<}

and

er={x=(xk)w:supnN|k=0n(nk)(1r)nkrkxk|<}.

Altay and Polat [7] defined further generalization of the Euler sequence spaces e0r(), ecr() and er() by

e0r()={x=(xk)w:(xk)e0r},ecr()={x=(xk)w:(xk)ecr}

and

er()={x=(xk)w:(xk)er},

where xk=xkxk1 for each kN. Here any term with negative subscript is equal to naught. Many authors have used especially the Euler matrix for defining new sequence spaces, for instance, Kara and Başarir [17], Karakaya and Polat [18] and Polat and Başar [15].

Recently Bişgin [19, 20] defined another type of generalization of the Euler sequence spaces and introduced the binomial sequence spaces b0r,s, bcr,s, br,s and bpr,s. Let r,sR and r+s0. Then the binomial matrix Br,s=(bn,kr,s) is defined by

bn,kr,s={1(s+r)n(nk)snkrkif 0kn,0if k>n,

for all k,nN. For sr>0 we have

  • (i)

    Br,s<,

  • (ii)

    limnbn,kr,s=0 for each kN,

  • (iii)

    limnkbn,kr,s=1.

Thus, the binomial matrix Br,s is regular for sr>0. Unless stated otherwise, we assume that sr>0. If we take s+r=1, we obtain the Euler matrix Er. So the binomial matrix generalizes the Euler matrix. Bişgin [20] defined the following spaces of binomial sequences:

bpr,s={x=(xk)w:n|1(s+r)nk=0n(nk)snkrkxk|p<}

and

br,s={x=(xk)w:supnN|1(s+r)nk=0n(nk)snkrkxk|<}.

The main purpose of the present paper is to study the normed difference spaces bpr,s() and br,s() of the binomial sequence whose Br,s()-transforms are in the spaces p and , respectively. These new sequence spaces are the generalization of the sequence spaces defined in [7] and [20]. Also, we compute the bases and α-, β- and γ-duals of these sequence spaces.

The binomial difference sequence spaces

In this section, we introduce the spaces bpr,s() and br,s() and prove that these sequence spaces are linearly isomorphic to the spaces p and , respectively.

We first define the binomial difference sequence spaces bpr,s() and br,s() by

bpr,s()={x=(xk)w:(xk)bpr,s}

and

br,s()={x=(xk)w:(xk)br,s}.

Let us define the sequence y=(yn) as the Br,s()-transform of a sequence x=(xk), that is,

yn=[Br,s(xk)]n=1(s+r)nk=0n(nk)snkrk(xk) 2.1

for each nN. Then the binomial difference sequence spaces bpr,s() or br,s() can be redefined by all sequences whose Br,s()-transforms are in the space p or .

Theorem 2.1

The sequence spaces bpr,s() and br,s() are complete linear metric spaces with the norm defined by

fbpr,s()(x)=yp=(n=1|yn|p)1p

and

fbr,s()(x)=y=supnN|yn|,

where 1p< and the sequence y=(yn) is defined by the Br,s()-transform of x.

Proof

The proof of the linearity is a routine verification. It is obvious that fbpr,s(αx)=|α|fbpr,s(x) and fbpr,s(x)=0 if and only if x=θ for all xbpr,s(), where θ is the zero element in bpr,s and αR. We consider x,zbpr,s(), then we have

fbpr,s()(x+z)=(n|(Br,s[(xk+zk)])n|p)1p(n|[Br,s(xk)]n|p)1p+(n|[Br,s(zk)]n|p)1p=fbpr,s()(x)+fbpr,s()(z).

Hence fbpr,s() is a norm on the space bpr,s().

Let (xm) be a Cauchy sequence in bpr,s(), where xm=(xmk)k=1bpr,s() for each mN. For every ε>0, there is a positive integer m0 such that fbpr,s()(xmxl)<ε for m,lm0. Then we get

|(Br,s[(xmkxlk)])n|(n|(Br,s[(xmkxlk)])n|p)1p<ε

for m,lm0 and each kN. So (Br,s(xmk))m=1 is a Cauchy sequence in the set of real numbers R. Since R is complete, we have limmBr,s(xmk)=Br,s(xk) for each kN. We compute

n=0i|(Br,s[(xmkxlk)])n|fbpr,s()(xmxl)<ε 2.2

for m>m0. We take i and l →∞, then the inequality (2.2) implies that

fbpr,s()(xmx)0.

We have

fbpr,s()(x)fbpr,s()(xmx)+fbpr,s()(xm)<,

that is, xbpr,s(). Thus, the space bpr,s() is complete. For the space br,s(), the proof can be completed in a similar way. So, we omit the detail. □

Theorem 2.2

The sequence spaces bpr,s() and br,s() are linearly isomorphic to the spaces p and , respectively, where 1p<.

Proof

Similarly, we only prove the theorem for the space bpr,s(). To prove bpr,s()p, we must show the existence of a linear bijection between the spaces bpr,s() and p.

Consider T:bpr,s()p by T(x)=Br,s(xk). The linearity of T is obvious and x=θ whenever T(x)=θ. Therefore, T is injective.

Let y=(yn)p and define the sequence x=(xk) by

xk=i=0k(s+r)ij=ik(ji)rj(s)jiyi 2.3

for each kN. Then we have

fbpr,s()(x)=[Br,s(xk)]np=(n=1|1(s+r)nk=0n(nk)snkrk(xk)|p)1p=(n=1|yn|p)1p=yp<,

which implies that xbpr,s() and T(x)=y. Consequently, T is surjective and is norm preserving. Thus, bpr,s()p. □

The Schauder basis and α-, β- and γ-duals

For a normed space (X,), a sequence {xk:xkX}kN is called a Schauder basis [21] if for every xX, there is a unique scalar sequence (λk) such that xk=0nλkxk0 as n. Next, we shall give a Schauder basis for the sequence space bpr,s().

We define the sequence g(k)(r,s)={gi(k)(r,s)}iN by

gi(k)(r,s)={0if 0i<k,(s+r)kj=ki(jk)rj(s)jkif ik,

for each kN.

Theorem 3.1

The sequence (g(k)(r,s))kN is a Schauder basis for the binomial sequence spaces bpr,s() and every x=(xi)bpr,s() has a unique representation by

x=kλk(r,s)g(k)(r,s), 3.1

where 1p< and λk(r,s)=[Br,s(xi)]k for each kN.

Proof

Obviously, Br,s(gi(k)(r,s))=ekp, where ek is the sequence with 1 in the kth place and zeros elsewhere for each kN. This implies that g(k)(r,s)bpr,s() for each kN.

For xbpr,s() and mN, we put

x(m)=k=0mλk(r,s)g(k)(r,s).

By the linearity of Br,s(), we have

Br,s(xi(m))=k=0mλk(r,s)Br,s(gi(k)(r,s))=k=0mλk(r,s)ek

and

[Br,s((xixi(m)))]k={0if 0km,[Br,s(xi)]kif k>m,

for each kN.

For any given ε>0, there is a positive integer m0 such that

k=m0+1|[Br,s(xi)]k|p<(ε2)p

for all km0. Then we have

fbpr,s()(xx(m))=(k=m+1|[Br,s(xi)]k|p)1p(k=m0+1|[Br,s(xi)]k|p)1p<ε2<ε,

which implies that xbpr,s() is represented as (3.1).

To prove the uniqueness of this representation, we assume that

x=kμk(r,s)g(k)(r,s).

Then we have

[Br,s(xi)]k=kμk(r,s)[Br,s(gi(k)(r,s))]k=kμk(r,s)(ek)k=μk(r,s),

which is a contradiction with the assumption that λk(r,s)=[Br,s(xi)]k for each kN. This shows the uniqueness of this representation. □

Corollary 3.2

The sequence space bpr,s() is separable, where 1p<.

For the duality theory, the study of sequence spaces is more useful when we investigate them equipped with linear topologies. Köthe and Toeplitz [22] first computed duals whose elements can be represented as sequences and defined the α-dual (or Köthe-Toeplitz dual).

For the sequence spaces X and Y, define the multiplier space M(X,Y) by

M(X,Y)={u=(uk)w:ux=(ukxk)Y for all x=(xk)X}.

Then the α-, β- and γ-duals of a sequence space X are defined by

Xα=M(X,1),Xβ=M(X,c)andXγ=M(X,),

respectively.

We give the following properties:

supnNk|an,k|q<, 3.2
supkNn|an,k|<, 3.3
supn,kN|an,k|<, 3.4
limnan,k=akfor each kN, 3.5
supKΓk|nKan,k|q<, 3.6
limnk|an,k|=k|limnan,k|, 3.7

where Γ is the collection of all finite subsets of N, 1p+1q=1 and 1<p.

Lemma 3.3

[23]

Let A=(an,k) be an infinite matrix. Then the following statements hold:

  • (i)

    A(1:1) if and only if (3.3) holds.

  • (ii)

    A(1:c) if and only if (3.4) and (3.5) hold.

  • (iii)

    A(1:) if and only if (3.4) holds.

  • (iv)

    A(p:1) if and only if (3.6) holds with 1p+1q=1 and 1<p.

  • (v)

    A(p:c) if and only if (3.2) and (3.5) hold with 1p+1q=1 and 1<p<.

  • (vi)

    A(p:) if and only if (3.2) holds with 1p+1q=1 and 1<p<.

  • (vii)

    A(:c) if and only if (3.5) and (3.7) hold with 1p+1q=1 and 1<p<.

  • (viii)

    A(:) if and only if (3.2) holds with q=1.

Theorem 3.4

We define the set U1r,s and U2r,s by

U1r,s={u=(uk)w:supiNk|(s+r)ij=ik(ji)rj(s)jiuk|<}

and

U2r,s={u=(uk)w:supKΓi|kK(s+r)ij=ik(ji)rj(s)jiuk|q<}.

Then [b1r,s()]α=U1r,s and [bpr,s()]α=U2r,s, where 1<p.

Proof

Let u=(uk)w and x=(xk) be defined by (2.3), then we have

ukxk=i=0k(s+r)ij=ik(ji)rj(s)jiukyi=(Gr,sy)k

for each kN, where Gr,s=(gk,ir,s) is defined by

gk,ir,s={(s+r)ij=ik(ji)rj(s)jiukif 0ik,0if i>k.

Therefore, we deduce that ux=(ukxk)1 whenever xb1r,s() or bpr,s() if and only if Gr,sy1 whenever y1 or p, which implies that u=(uk)[b1r,s()]α or [bpr,s()]α if and only if Gr,s(1:1) and Gr,s(p:1) by parts (i) and (iv) of Lemma 3.3, we obtain u=(uk)[b1r,s()]α if and only if

supiNk|(s+r)ij=ik(ji)rj(s)jiuk|<

and u=(uk)[bpr,s()]α if and only if

supKΓi|kK(s+r)ij=ik(ji)rj(s)jiuk|q<.

Thus, we have [b1r,s()]α=U1r,s and [bpr,s()]α=U2r,s, where 1<p. □

Now, we define the sets U3r,s, U4r,s, U5r,s, U6r,s and U7r,s by

U3r,s={u=(uk)w:limn(s+r)ki=knj=ki(jk)rj(s)jkui exists for each kN},U4r,s={u=(uk)w:supn,kN|(s+r)ki=knj=ki(jk)rj(s)jkui|<},U5r,s={u=(uk)w:limnk|(s+r)ki=knj=ki(jk)rj(s)jkui|U5r,s==k|limn(s+r)ki=knj=ki(jk)rj(s)jkui|},U6r,s={u=(uk)w:supnNk=0n|(s+r)ki=knj=ki(jk)rj(s)jkui|q<},1<q<,

and

U7r,s={u=(uk)w:supnNk=0n|(s+r)ki=knj=ki(jk)rj(s)jkui|<}.

Theorem 3.5

We have the following relations:

  • (i)

    [b1r,s()]β=U3r,sU4r,s,

  • (ii)

    [bpr,s()]β=U3r,sU6r,s, where 1<p<,

  • (iii)

    [br,s()]β=U3r,sU5r,s,

  • (iv)

    [b1r,s()]γ=U4r,s,

  • (v)

    [bpr,s()]γ=U6r,s, where 1<p<,

  • (vi)

    [br,s()]γ=U7r,s.

Proof

Let u=(uk)w and x=(xk) be defined by (2.3), then we consider the following equation:

k=0nukxk=k=0nuk[i=0k(s+r)ij=ik(ji)rj(s)jiyi]=k=0n[(s+r)ki=knj=ki(jk)rj(s)jkui]yk=(Ur,sy)n,

where Ur,s=(un,kr,s) is defined by

un,k={(s+r)ki=knj=ki(jk)rj(s)jkuiif 0kn,0if k>n.

Therefore, we deduce that ux=(ukxk)c whenever xb1r,s() if and only if Ur,syc whenever y1, which implies that u=(uk)[b1r,s()]β if and only if Ur,s(1:c). By Lemma 3.3(ii), we obtain [b1r,s()]β=U3r,sU4r,s. Using Lemma 3.3(i) and (iii)-(viii) instead of (ii), the proof can be completed in a similar way. So, we omit the details. □

Conclusion

By considering the definitions of the binomial matrix Br,s=(bn,kr,s) and the difference operator, we introduce the sequence spaces bpr,s() and br,s(). These spaces are the natural continuations of [1, 7, 20]. Our results are the generalizations of the matrix domain of the Euler matrix of order r. In order to give fully inform the reader on related topics with applications and a possible line of further investigation, the e-book [24] is added to the list of references.

Acknowledgements

We wish to thank the referee for his/her constructive comments and suggestions.

Footnotes

Competing interests

The authors declare that they have no competing interests.

Authors’ contributions

JM came up with the main ideas and drafted the manuscript. MS revised the paper. All authors read and approved the final manuscript.

Publisher’s Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

References

  • 1.Kizmaz H. On certain sequence spaces. Can. Math. Bull. 1981;24:169–176. doi: 10.4153/CMB-1981-027-5. [DOI] [Google Scholar]
  • 2.Bektaş C, Et M, Çolak R. Generalized difference sequence spaces and their dual spaces. J. Math. Anal. Appl. 2004;292:423–432. doi: 10.1016/j.jmaa.2003.12.006. [DOI] [Google Scholar]
  • 3.Dutta H. Characterization of certain matrix classes involving generalized difference summability spaces. Appl. Sci. 2009;11:60–67. [Google Scholar]
  • 4.Reddy BS. On some generalized difference sequence spaces. Soochow J. Math. 2010;26:377–386. [Google Scholar]
  • 5.Tripathy BC, Esi A. On a new type of generalized difference Cesàro sequence spaces. Soochow J. Math. 2005;31:333–340. [Google Scholar]
  • 6.Tripathy BC, Esi A. A new type of difference sequence spaces. Int. J. Sci. Technol. 2006;1:147–155. [Google Scholar]
  • 7.Altay B, Polat H. On some new Euler difference sequence spaces. Southeast Asian Bull. Math. 2006;30:209–220. [Google Scholar]
  • 8.Başarir M, Kara EE. On compact operators on the Riesz Bm-difference sequence spaces. Iran. J. Sci. Technol. 2011;35:279–285. [Google Scholar]
  • 9.Başarir M, Kara EE. On some difference sequence spaces of weighted means and compact operators. Ann. Funct. Anal. 2011;2:114–129. doi: 10.15352/afa/1399900200. [DOI] [Google Scholar]
  • 10.Başarir M, Kara EE. On compact operators on the Riesz Bm-difference sequence spaces II. Iran. J. Sci. Technol. 2012;33:371–376. [Google Scholar]
  • 11.Başarir M, Kara EE. On the B-difference sequence space derived by generalized weighted mean and compact operators. J. Math. Anal. Appl. 2012;391:67–81. doi: 10.1016/j.jmaa.2012.02.031. [DOI] [Google Scholar]
  • 12.Başarir M, Kara EE. On the mth order difference sequence space of generalized weighted mean and compact operators. Acta Math. Sci. 2013;33:797–813. doi: 10.1016/S0252-9602(13)60039-9. [DOI] [Google Scholar]
  • 13.Kara EE. Some topological and geometrical properties of new Banach sequence spaces. J. Inequal. Appl. 2013;2013 doi: 10.1186/1029-242X-2013-38. [DOI] [Google Scholar]
  • 14.Kara EE, İlkhan M. On some Banach sequence spaces derived by a new band matrix. Br. J. Math. Comput. Sci. 2015;9:141–159. doi: 10.9734/BJMCS/2015/17499. [DOI] [Google Scholar]
  • 15.Polat H, Başar F. Some Euler spaces of difference sequences of order m. Acta Math. Sci. 2007;27:254–266. doi: 10.1016/S0252-9602(07)60024-1. [DOI] [Google Scholar]
  • 16.Altay B, Başar F, Mursaleen M. On the Euler sequence spaces which include the spaces p and I. Inf. Sci. 2006;176:1450–1462. doi: 10.1016/j.ins.2005.05.008. [DOI] [Google Scholar]
  • 17.Kara EE, Başarir M. On compact operators and some Euler B(m)-difference sequence spaces. J. Math. Anal. Appl. 2011;379:499–511. doi: 10.1016/j.jmaa.2011.01.028. [DOI] [Google Scholar]
  • 18.Karakaya V, Polat H. Some new paranormed sequence spaces defined by Euler and difference operators. Acta Sci. Math. 2010;76:87–100. [Google Scholar]
  • 19.Bişgin MC. The binomial sequence spaces of nonabsolute type. J. Inequal. Appl. 2016;2016 doi: 10.1186/s13660-016-1256-0. [DOI] [Google Scholar]
  • 20.Bişgin MC. The binomial sequence spaces which include the spaces p and and geometric properties. J. Inequal. Appl. 2016;2016 doi: 10.1186/s13660-016-1252-4. [DOI] [Google Scholar]
  • 21.Choudhary B, Nanda S. Functional Analysis with Application. New Delhi: Wiley; 1989. [Google Scholar]
  • 22.Köthe G, Toeplitz O. Linear Raume mit unendlichvielen koordinaten and Ringe unenlicher Matrizen. J. Reine Angew. Math. 1934;171:193–226. [Google Scholar]
  • 23.Stieglitz M, Tietz H. Matrixtransformationen von folgenräumen eine ergebnisubersict. Math. Z. 1977;154:1–16. doi: 10.1007/BF01215107. [DOI] [Google Scholar]
  • 24.Başar F. Summability Theory and its Applications. Istanbul: Bentham Science; 2012. [Google Scholar]

Articles from Journal of Inequalities and Applications are provided here courtesy of Springer

RESOURCES