On the c₀-equivalence and permutations of series

Abstract: Assume that a convergent series of real numbers

s u m l i m i t s_{n = 1}^{i} n f t y a_{n}

has the property that there exists a set

A s u b s e t e q N

such that the series

s u m l i m i t s_{n i n A} a_{n}

is conditionally convergent. We prove that for a given arbitrary sequence

(b_{n})

of real numbers there exists a permutation

s i g m a c o l o n N o N

such that

s i g m a (n) = n

for every

n o t i n A

and

(b_{n})

is

c_{0}

-equivalent to a subsequence of the sequence of partial sums of the series

s u m l i m i t s_{n = 1}^{i} n f t y a_{s i g m a (n)}

. Moreover, we discuss a connection between our main result with the classical Riemann series theorem.

Cites Work

Cited In (1)

This page was built for publication: On the \(c_0\)-equivalence and permutations of series