THE CONTINUOUS DUAL OF THE SEQUENCE SPACE lp(∆n),
(1≤p≤ ∞, n∈N)
M. IMANINEZHAD and M. MIRI
Abstract. The space lp(∆m) consisting of all sequences whosemth order differ-ences are p-absolutely summable was recently studied by Altay [On the space of p-summable difference sequences of order m,(1≤p <∞), Stud. Sci. Math. Hun-gar. 43(4)(2006), 387–402]. Following Altay [2], we have found the continuous dual of the spacesl1(∆n) andl
P(∆n). We have also determined the norm of the operator ∆nacting froml1to itself and froml
∞to itself, and proved that ∆nis a bounded linear operator on the spacelp(∆n).
1. Preliminaries, Definitions and Notations
Letω denote the space of all complex-valued sequences, i.e. ω =CN
where N=
{0,1,2,3, . . .}. Any vector subspace ofω which contains φ, the set of all finitely non-zero sequences, is called a sequence space. The continuous dual of a sequence spaceλwhich is denoted byλ∗ is the set of all bounded linear functionals on
λ. Suppose ∆ be the difference operator with matrix representation
∆ =
1 0 0 0 0 0 · · ·
−1 1 0 0 0 0 · · ·
0 −1 1 0 0 0 · · ·
0 0 −1 1 0 0 · · ·
0 0 0 −1 1 0 · · ·
..
. ... ... ... ... ... . ..
and supposex= (xk)∞
k=0∈ω, then ∆x= (xk−xk−1)∞k=0 and ∆nx= ∆(∆n−1x)
for all n ≥ 2 where any x with negative index is zero. For every n ∈ N\ {0},
Received February 12, 2010.
2000Mathematics Subject Classification. Primary 46B10; Secondary 46B45.
∆n has a triangle matrix representation, so it is invertible and ∆n = 2 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 4
1 0 0 0 0 0 0 0 · · ·
−(n
1) 1 0 0 0 0 0 0 · · ·
(n
2) −(n1) 1 0 0 0 0 0 · · · −(n
3) (n2) −(n1) 1 0 0 0 0 · · ·
. . . . . . . . . . . . . . . . . . . . . . . . · · ·
(−1)n(n n) (−1)
n−1
(n n−1)
. . .
. .
. −(n
1) 1 0 0 · · ·
0 (−1)n(n
n) (−1) n−1
(n n−1)
. . .
. . . −(n
1) 1 0 · · ·
0 0 (−1)n(n
n) (−1) n−1
(n n−1)
. . .
. . . −(n
1) 1 · · ·
. . . . . . . . . . . . . . . . . . . . . . . . . .. 3 7 7 7 7 7 7 7 7 7 7 7 7 7 7 7 7 7 7 7 7 7 7 5
∆−n=
1 0 0 0 0 0 · · ·
(n
1) 1 0 0 0 0 · · ·
(n+1
2 ) (n1) 1 0 0 0 · · ·
(n+2
3 ) (n+12 ) (n1) 1 0 0 · · ·
(n+34 ) ( n+2
3 ) (
n+1
2 ) (n1) 1 0 · · ·
.. . ... ... ... ... ... . ..
If a normed sequence spaceλcontains a sequence (bn) with the property that for everyx∈λ, there is a unique sequence of scalars (αn) such that
lim
n→∞kx−(α0b0+α1b1+· · ·+αnbn)k= 0,
(1)
then (bn) is called a Schauder basis forλ. The seriesPαkbk which has the sumx
is then called the expansion ofxwith respect to (bn) and written asx=Pαkbk.
2. The space lp(∆n)
Now we introduce an apparently new sequence space and denote it bylp(∆n) like
Kizmaz who defined and studiedl∞(∆),c(∆) andc0(∆).
lp(∆n) ={x∈ω: ∆nx∈lp} (2)
kxklp(∆n)=k∆ nxk
lp (3)
Triviallylp(∆) =bvp.
Theorem 2.1. lp(∆n)is a Banach space.
Proof. Since it is a routine verification to show that lp(∆n) is a normed space
with the norm defined by (3) and coordinate-wise addition and scalar multipli-cation we omit the details. To prove the theorem, we show that every Chauchy sequence in lp(∆n) has a limit. Suppose (x(m))∞
m=0 is a Chauchy sequence in lp(∆n). So
(4)
(∀ε >0)(∃N ∈N)(∀r, s≥N)(k∆nx(r)−∆nx(s)kl p=kx
(r)−
So the sequence (∆nx(m))∞
m=0inlp is Chauchy and sincelpis Banach, there exists x∈lp such that
k∆nx(m)−xklp→0 as m→ ∞ (5)
Butx= (∆n)(∆n)−1x, sok∆nx(m)−∆n(∆n)−1xk lp=kx
(m)−(∆n)−1xk
lp(∆n)→0
asm→ ∞. Now, since (∆n)−1x∈lp(∆n) we are done. ¤
Theorem 2.2. lp(∆n)is isometrically isomorphic tolp.
Proof. Let
T :lp(∆n)→ lp (6)
defined byT(x) = ∆nx. SinceTis bijective and norm preserving, we are done. ¤
Theorem 2.3. Except the casep= 2, the spacelp(∆n)is not an inner product space and hence not a Hilbert space for1≤p <∞.
Proof. First we show that l2(∆n) is a Hilbert space. It suffices to show that l2(∆n) has an inner product. Since
kxkl2(∆n)=k∆
n
xkl2 =<∆
n x,∆n
x >12,
(7)
l2(∆n) is a Hilbert space. Now, we show that ifp6= 2, thenlp(∆n) is not Hilbert.
Let
u= (∆n−1)−1(1,2,2,2,· · ·) e= (∆n−1)−1(1,0,0,0,· · ·).
Thenkuklp(∆n)=keklp(∆n)= 2
1
p andku+ek
lp(∆n)=ku−eklp(∆n)= 2. So the
parallelogram equality does not satisfy. Hence the spacelp(∆n) withp6= 2 is not
a Hilbert space. ¤
Theorem 2.4. If 1≤p < q <∞, then lp(∆n)⊆lq(∆n)⊆l∞(∆n).
Proof. We only point out that if 1≤p < q <∞, thenlp⊆lq ⊆l∞. ¤
Theorem 2.5. lp⊆lp(∆)⊆lp(∆2)⊆lp(∆3)⊆ · · ·
Proof. Since lp ⊆bvp, it is trivial that lp ⊆lp(∆). Now, if x ∈lp(∆n), then
∆nx∈lp⊆lp(∆). So
∆nx∈lp(∆) ⇒ ∆(∆nx)∈lp ⇒ ∆n+1x∈lp ⇒ x∈lp(∆n+1).
¤
Theorem 2.6. kxklp(∆n)≤2nkxklp
Proof. Sincekxklp(∆)=kxkbvp≤2kxklp,kxklp(∆2)≤2kxklp(∆)≤2·2· kxklp =
22kxk
3. Schauder basis for space lp(∆n)
Suppose ek is a sequence whose only nonzero term is 1 in the (k+ 1)th place.
The sequence (∆−nek)∞
k=0 is a sequence of elements oflp(∆n) since for all k∈N, ek ∈ lp. We assert that this sequence is a Schauder basis for lp(∆n). Suppose x∈ lp(∆n), x[m] =Pm
k=0(∆ nx)
k(∆−nek) = P m k=0∆
−n((∆nx)
kek). Then since x∈lp(∆n), we have ∆nx∈lpsuch that
̰
X
i=0
|(∆n x)i|p
!1
p
=s <∞ (8)
⇒(∀ε >0)(∃m0∈N) Ã∞
X
i=m
|(∆nx)i|p !1
p <ε
2 for allm≥m0 (9)
⇒kx−x[m]klp(∆n)=k∆ n
x−∆nx[m]klp
(10)
=k ∞
X
k=0
(∆n
x)kek−
m X
k=0
(∆n
x)kekklp
=k ∞
X
k=m+1
(∆n
x)kekklp=
à ∞
X
k=m+1
|∆n x|pk
!1
p
(11)
≤
à ∞
X
k=m0 |∆n
x|pk
!1
p < ε
2
Sox=P∞k=0(∆ nx)
k(∆−nek) =P
∞
k=0∆
−n((∆nx)
kek). Now, we show the
unique-ness of this representation. Supposex =P∞
k=0µk(∆
−nek) = P∞
k=0∆
−n(µkek),
so ∆nx = P∞
k=0µkek. On the other hand ∆nx = P∞
k=0(∆nx)kek. Hence µk= (∆nx)
k, for allk∈N. So this representation is unique.
4. Continuous dual oflp(∆n)
Sequence space bvp is lp(∆) so lp(∆n) is an extension of this space. In [1] the
continuous dual ofbvp was studied. The idea was wrong. We showed a counter example and then corrected it in [4]. Now, we introduce the continuous dual of
lp(∆n).
Suppose 1≤q <∞and let
dn q =
a∈ω:kakdn q =
° ° °D(n)a
° ° °l
q
=
∞
X
k=0 ¯ ¯ ¯ ¯ ¯ ¯
∞
X
j=k D(kjn)aj
¯ ¯ ¯ ¯ ¯ ¯
q
1
q
<∞
(12)
dn∞=
a∈ω:kakdn
∞ =
° ° °D(n)a
° ° °
l∞ = sup
k∈N
¯ ¯ ¯ ¯ ¯ ¯
∞
X
j=k Dkj(n)aj
¯ ¯ ¯ ¯ ¯ ¯
<∞
,
where
D(n)=
1 (n
1) (n+12 ) ( n+2
3 ) (
n+3
4 ) (
n+4 5 ) · · ·
0 1 (n
1) (
n+1
2 ) (
n+2
3 ) (
n+3 4 ) · · ·
0 0 1 (n
1) (n+12 ) ( n+2
3 ) · · ·
0 0 0 1 (n
1) (
n+1 2 ) · · ·
0 0 0 0 1 (n
1) · · ·
..
. ... ... ... ... ... . ..
(14)
sinceD(n) is triangle, thenD(n)−1
exists. Triviallydn
q anddn∞are normed spaces with respect to coordinate-wise addition and scalar multiplication. dn
q anddn∞are Banach spaces since if (x(m))∞
m=0 is a Chauchy sequence indnq, then
(∀ε >0)(∃N ∈N)(∀r, s > N)kD(n)(x(r)−x(s))kl q =kx
(r)−x(s)k dn
q < ε (15)
so the sequence (D(n)(x(m)))∞
m=0 is Chauchy in lq and since lq is Banach, there
existsy in lq such that kD(n)x(m)−yk
lq →0 asm→ ∞. But y=D
(n)D(n)−1
y, so kD(n)x(m)−D(n)D(n)−1
yklq =kx
(m)−D(n)−1
ykdn
q → 0 asm → ∞. On the
other handD(n)−1
y∈dn
q. Sodnq is Banach. In a similar waydn∞ is Banach.
Theorem 4.1. l1(∆n)∗ is isometrically isomorphic to dn∞.
Proof. Let
T :l1(∆n)∗→dn∞
(16)
defined by T f = (f(e0), f(e1), f(e2), f(e3),· · ·). Trivially T is linear and since x=P∞k=0(∆nx)k(∆−nek) we havef(x) =P
∞
k=0(∆nx)kf(∆
−nek). But
∆−n
ek = (0,0,· · ·,0
| {z }
kterm ,1,(n
1),(n+12 ),( n+2
3 ),( n+3
4 ),· · ·)
=ek+ (n1)e
k+1+ (n+1 2 )e
k+2+ (n+2 3 )e
k+3+· · · (17)
so
f(x) = ∞
X
k=0 £
(∆n
x)k·(f(ek) + (n1)f(ek+1) + (n+12 )f(e
k+2) +· · ·)¤ (18)
Iffj=f(ej), then with respect to (14), we have
f(x) = ∞
X
k=0 h
(∆n
x)k·(D (n) kkfk+D
(n)
k(k+1)fk+1+D (n)
k(k+2)fk+2+· · ·) i
= ∞
X
k=0
(∆nx)k·
∞
X
j=k D(kjn)fj
So|f(x)| ≤P∞
k=0|∆nx|k·supk∈N|
P∞
j=kD (n)
kj fj|=k(f0, f1, f2,· · ·)kdn
∞·kxkl1(∆n). Sokfk ≤ k(f0, f1, f2,· · ·)kdn
impliesf = 0. FinallyT is norm preserving since
|f(x)| ≤ ∞
X
k=0
|∆nx| k·sup
k∈N
¯ ¯
∞
X
j=k
Dkj(n)fj¯¯=kxkl1(∆n)· kT fkdn∞
(19)
So
kfk ≤ kT fkdn
∞
(20)
On the other hand,
¯ ¯
∞
X
j=k
D(kjn)fj¯¯=|f(∆−nek)| ≤ kfk · k∆−nekk
l1(∆n)=kfk for allk∈N (21)
So
kT fkdn
∞= sup
k∈N
¯ ¯
∞
X
j=k
D(kjn)fj¯¯≤ kfk
(22)
From (20) and (22), we have
kT fkdn
∞ =kfk.
SoT is norm preserving and it completes the proof. ¤
Theorem 4.2. If 1 < p < ∞, 1 p +
1
q = 1, then lp(∆ n)∗
is isometrically
isomorphic todn q.
Proof. Let
T :lp(∆n)∗ →dn
q (23)
defined by T f = (f(e0), f(e1), f(e2), f(e3),· · ·). Trivially T is linear and (18) implies that
|f(x)|=
¯ ¯ ¯ ¯ ¯ ¯
∞
X
k=0
[(∆nx)k·
∞
X
j=k
D(kjn)fj]
¯ ¯ ¯ ¯ ¯ ¯
≤
"∞
X
k=0
|∆nx|pk #1
p
∞
X
k=0 ¯ ¯ ¯ ¯ ¯ ¯
∞
X
j=k D(kjn)fj
¯ ¯ ¯ ¯ ¯ ¯
q
1
q
=kxklp(∆n)· k(f0, f1, f2,· · ·)kdn q.
The above computations show that T is surjective. Moreover T is injective since T f = 0 implies f = 0. T is norm preserving since |f(x)| ≤ kxklp(∆n)·
k(f0, f1, f2,· · ·)kdn
q =kxklp(∆n)· kT fkd n q. So
kfk ≤ kT fkdn q. (24)
On the other hand, letx(m)= (x(m) k ) where
(∆n
x(m))k =
¯ ¯
∞
X
j=k
Dkj(n)fj¯¯q−1sgn¡ ∞
X
j=k
D(kjn)fj¢ 0≤k≤m
0 k > m
Thenx(m)∈lp(∆n) since ∆nx(m)∈lp. So
f(x(m)) =f µ ∞
X
k=0
(∆n
x(m))k·(∆
−n ek)
¶ =f µ m X k=0 (∆n
x(m))k·(∆
−n ek)
¶
=
m X
k=0
(∆nx(m))kf(∆−nek) = m X
k=0
(∆nx(m))k
∞
X
j=k Dkj(n)fj
= m X k=0 ¯ ¯ ¯ ¯ ∞ X
j=k D(kjn)fj
¯ ¯ ¯ ¯
q−1
sgn
µ ∞
X
j=k D(kjn)fj
¶µ ∞
X
j=k D(kjn)fj
¶ = m X k=0 ¯ ¯ ¯ ¯ ∞ X
j=k D(kjn)fj
¯ ¯ ¯ ¯ q
≤ kfk · kx(m)k lp(∆n).
So
kx(m)klp(∆n)=k∆ n
x(m)klp= µ ∞
X
k=0
|∆n x(m)|pk
¶1 p = µ m X k=0 |∆n x(m)|pk
¶1 p = µ m X k=0 ¯ ¯ ¯ ¯ ∞ X
j=k Dkj(n)fj
¯ ¯ ¯ ¯
p(q−1)¯
¯ ¯ ¯sgn
µ ∞
X
j=k D(kjn)fj
¶¯ ¯ ¯ ¯
p¶1
p = µ m X k=0 ¯ ¯ ¯ ¯ ∞ X
j=k Dkj(n)fj
¯ ¯ ¯ ¯
q¶1
p So µ m X k=0 ¯ ¯ ¯ ¯ ∞ X
j=k D(kjn)fj
¯ ¯ ¯ ¯
q¶1
≤ kfk ·
µ m X k=0 ¯ ¯ ¯ ¯ ∞ X
j=k D(kjn)fj
¯ ¯ ¯ ¯
q¶1
p .
So
kfk ≥
µ m X k=0 ¯ ¯ ¯ ¯ ∞ X
j=k Dkj(n)fj
¯ ¯ ¯ ¯
q¶1
q
=kT fkdnq. (26)
From (24) and (26), we have
kT fkdn q =kfk.
SoT is norm preserving and this completes the proof. ¤
5. Continuity of∆n on some sequence spaces
Lemma 5.1. The matrix A = (ank) gives rise to a bounded linear operator T ∈B(l1)if and only if the supremum ofl1norms of the columns ofAis bounded.
In fact, kAk(l1,l1)= supn
P∞
k=0|ank|. Corollary 5.2. k∆nk
(l1,l1)= 2
n.
Lemma 5.3. The matrix A = (ank) gives rise to a bounded linear operator T ∈B(l∞)if and only if the supremum of l1 norms of the rows of A is bounded.
In fact, kAk(l∞,l∞)= supk
P∞
Corollary 5.4. k∆nk
(l∞,l∞)= 2
n.
Lemma 5.5. Let 1< p <∞ and letA∈(l∞, l∞)
T
(l1, l1). Then A∈(lp, lp).
Corollary 5.6. For every integern and1< p <∞holds∆n∈B(lp).
Proof. With respect to the matrix representation of ∆n and Lemma 5.1 and
5.3 ∆n ∈(l
∞, l∞)
T
(l1, l1) and so by Lemma 5.5, ∆n∈(lp, lp). ¤
Theorem 5.7. ∆n ∈B(lp(∆n)).
Proof. Suppose ∆n : lp →lp and x∈ lp. Then by Corollary 5.6, there exists Mp
n ∈ N such that k∆ nxk
lp ≤ M p
nkxklp. So if ∆
n : lp(∆n) → lp(∆n) and x ∈ lp(∆n), then k∆nxk
lp(∆n)=k∆n(∆nx)kl p ≤M
p
n· k∆nxklp =M p
n· kxklp(∆n). So
k∆nk
(lp(∆n),lp(∆n))≤Mnp and it completes the proof. ¤
In [1, Theorem 3.2] claims that the norm of operator Delta is 2 i.e. ∆ is a bounded operator onlp(∆) which confirms Theorem 5.7 in casen= 1.
Acknowledgment. We are grateful to the referee for his/her careful review-ing and suggestions. The first author is obliged to Dr. Bolbolian, Dr. Mohamma-dian and Mrs. Ramezani. Also he likes to express his thanks to Mr. Davoodnezhad and Mrs. Sadeghi1for supplying some references.
References
1. Akhmedov A. M. and Basar F., The Fine Spectra of the Difference Operator∆ over the Sequense Spacebvp(1≤p <∞), Acta Math. Sin. Eng. Ser.23(10)(2007), 1757–1768. 2. Altay B.,On the space of p-summable difference sequences of order m, (1≤p <∞),Stud.
Sci. Math. Hungar.43(4)(2006), 387–402.
3. Basar F. and Altay B.,On the Space of Sequences of p-Bounded Variation and Related Matrix Mappings, Ukrainian Math. J.55(1)(2003), 136–147.
4. Imaninezhad M. and Miri M.,The Dual Space of the Sequence Spacebvp(1≤p <∞), Acta Math. Univ. Comenianae79(1)(2010), 143–149.
5. Goldberg S., Unbounded Linear Operators, Dover Publication Inc. New York, 1985. 6. Kizmaz H.,On Certain Sequence Spaces, Canad. Math. Bull.24(2)(1981), 169–176. 7. Kreyszig E., Introductory Functional Analysis with Applications, John Wiley & Sons Inc.
New York-Chichester-Brisbane-Toronto, 1978.
8. Maddox I. J.,Elements of Functional Analysis, University Press, Cambridge, 1988. 9. Wilansky A.,Summability through Functional Analysis, North-Holland Mathematics Studies,
Amsterdam-New York-Oxford, 1984.
M. Imaninezhad, Islamic Azad University-Ferdows Branch, Iran,e-mail:imani507@gmail.com
M. Miri, Dep. of Math., University of Birjand, Iran,e-mail:mmiri@birjand.ac.ir