By FS we denote the linear space of all formal series over R. We can con-
sider FS as a linear algebra with two different products, namely for ∞
P
n=0 xn
P∞
and n=0 yn let
∞ ∞ ∞
! !
X X X
xn · yn = xn yn
n=0 n=0 n=0
(point-wise product) and
∞ ∞ ∞ X
n
! !
X X X
xn × yn = xk yn−k
n=0 n=0 n=0 k=0
P∞ P∞
Theorem 1. [P] Let n=0 an and n=0 bn be convergent series. Assume
that the series
convergent.
(−1)n P∞
Proof. Put an = n+1 for any n ∈ N. Note that the series n=0 an is
(k) (1)
alternating. Define numbers an inductively: an = an for any n ∈ N and
n
(1)
X
a(k+1)
n = a(k)
m an−m
m=0
n (k) n
C lnk−1 (n + 1) X
(k)
X 1 1 1 1
≤ C2 lnk−1 (n+1) · = 2 + ≤
m+1 n+1−m n+2 m+1 n+1−m
m=0 m=0
(k) n (k) (k)
2C2 lnk−1 (n + 1) X 1 2C2 C2 lnk (n + 1) 2C2 C2 lnk (n + 1)
≤ ≤ ≤ .
n+2 m+1 n+2 n+1
m=0
(k+1) (k)
Put C2 = 2C2 C2 .
We also have
n n n (k)
(k+1)
X
(k) (1)
X
(k) (1)
X C1 lnk−1 (m + 1) 1
|an |= am an−m = |am ||an−m | ≥ · ≥
m+1 n+1−m
m=0 m=0 m=0
n (k) n
X C1 lnk−1 (m + 1) 1 (k)
n X 1 1
· ≥ C1 lnk−1 · ≥
m+1 n+1−m 2 m+1 n+1−m
m=n/2 m≥(n−1)/2
(k) √ n
C lnk−1 ( n − 1)
X 1 1
≥ 1 + ≥
n+2 m+1 n+1−m
m≥(n−1)/2
(k) n (k)
C1 lnk−1 (n − 1) X 1 C1 C1 lnk (n − 1)
≥ ≥ =
2k−1 (n + 2) m+1 2k−1 (n + 2)
m=0
(k) (k)
C1 C1 lnk (n + 1) (n + 1) lnk (n − 1) C1 C1 C̃ lnk (n + 1)
= · ≥ ,
2k−1 (n + 1) (n + 2) lnk (n + 1) 2k−1 (n + 1)
where
(n + 1) lnk (n − 1)
0 < C̃ ≤
(n + 2) lnk (n + 1)
(k+1) (k)
for any n ∈ N. Put C1 = C1 C1 /2k C̃.
lnk−1 (n+1)
Let N be such that the map n 7→ n+1 is decreasing on {N, N +
1, N + 2, ...} Note that for m ≥ N
∞ ∞ (k)
X (1) (k)
X 1 C lnk−1 (ψ(n) + 1)
|aϕ(n) ||aψ(n) | ≤ · 2 ≤
n=m n=m
ϕ(n) + 1 ψ(n) + 1
4 ARTUR BARTOSZEWICZ AND SZYMON GLA̧B
∞ (k) ∞ (k)
X 1 C lnk−1 (n + 1) X C2 lnk−1 (n + 1)
≤ · 2 = <∞
n=m
n+1 n+1 n=m
(n + 1)2
(1) (1)
for any ϕ, ψ : N → N with ϕ(n), ψ(n) ≥ n. See that |an + an+1 | ≤
1 1 1 P∞ (k+1)
n+1 − n+2 ≤ (n+1)2 . Hence using Theorem 1 we obtain that n=0 an is
convergent.
P∞
Let A be a sub-algebra of (FS, ×) generated by n=0 an . To end the
proof it is enough to show that the series
∞
X
c1 a(1) (2) (k)
n + c2 an + ... + ck an
n=0
is conditionally convergent for any natural number k and any reals c1 , ..., ck
P∞ (k)
with ck 6= 0. This follows from the fact that ( ∞ k
P
n=0 an ) = n=0 an . This
2
≥ |ck−1 a(k−1)
n | + |c a
k−2 n
(k−2)
| + ... + |c a(2)
2 n | + |c a
1 n
(1)
| ≥
|ck |
2
≥ ck−1 a(k−1)
n + ck−2 a(k−2)
n + ... + c2 a(2) (1)
n + c1 an .
|ck |
Therefore
1 1
|ck a(k) (1) (2) (k−1)
n | − |c1 an + c2 an + ... + ck−1 an | ≥ |ck an(k) | − |ck a(k) (k)
n | = |ck an |.
2 2
CONDITIONALLY CONVERGENT SERIES 5
Hence
X∞ ∞
X
(1) (2) (k) (1)
c1 an + c2 an + ... + ck an ≥ c1 an + c2 a(2) (k)
n + ... + ck an ≥
n=0 n=m0
∞ ∞ (k)
X
(k) (1) (2)
(k−1)
X |ck an |
|ck an | − |c1 an + c2 an + ... + ck−1 an | ≥ = ∞.
n=m0 n=m0
2
linearly independent.
2. Appendix
Hence
m
X m
X
|cn | ≤ |ak bn−k | + |an−k bk | + |am bm | =
k=0 k=0
N
X −1 m
X N
X −1 m
X
|ak bn−k | + |ak bn−k | + |an−k bk | + |an−k bk | + |am bm | < ε.
k=0 k=N k=0 k=N
Therefore cn → 0.
Recall that if the series ∞
P
n=0 cn is convergent to some C, then C = AB,
that
4m
X 2m
X 2m
X
D4m = C4m − A2m B2m = ck − ak bl
k=0 k=0 l=0
tends to zero, if m → ∞.
We have
4m X
X k 2m
X 2m
X
D4m = al bk−l − ak bl =
k=0 l=0 k=0 l=0
4m
X 4m−1
X 1
X 2m
X
a0 bl + a1 bl + ... + a4m−1 bl + a4m b0 − (a0 + a1 + ... + a2m ) bl =
l=0 l=0 l=0 l=0
4m
X 4m−1
X 2m−1
X 2m−2
X
a0 bl +a1 bl +...+a2m−1 b2m+1 +a2m+1 bl +a2m+2 bl +...+a4m b0 =
l=2m+1 l=2m+1 l=0 l=0
4m−1
X 4m−3
X
(a0 + a1 ) bl + (a2 + a3 ) bl + ... + (a2m−2 + a2m−1 )b2m+1 +
l=2m+1 l=2m+1
2m−1
X 2m−3
X
+(a2m +a2m+1 ) bl +(a2m+2 +a2m+3 ) bl +...+(a4m−2 +a4m−1 )(b0 +b1 )+
l=0 l=0
a0 b4m + a2 b4m−2 + ... + a2m−2 b2m+2 + a2m b2m + a2m+2 b2m−2 + ... + a4m b0
Hence
m−1 4m−(2k+1) m−1 2m−(2k+1)
X X X X
|D4m | ≤ |a2k +a2k+1 |
bl +
|a2m+2k +a2m+2k+1 |
bl +
k=0 l=2m+1 k=0 l=0
2m
X X2m
+ |a2k b4m−2k | + |am | bk .
k=0 k=0
CONDITIONALLY CONVERGENT SERIES 7
P∞
+ a2k+1 |, | ∞
P
Let G = max{ k=0 |a2k k=0 bk |} < ∞. Let ε > 0 Let M ∈ N
m−1
X ε
|a2m+2k + a2m+2k+1 | < ,
4G
k=0
ε
|a2m | < ,
4G
2m
X ε
|a2k b4m−2k | < .
4
k=0
To find such m in the last inequality one should repeat the same reasoning
as in the first part of the proof where it has been shown that cn → 0. Now,
if m ≥ M , then |D4m | < ε and the result follows.
References