# Unconditional summability

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff) (*)
is called unconditionally summable by some summation method (unconditionally -summable) if it is summable by this method to a sum whatever the ordering of its terms, where the value of may depend on the particular rearrangement (cf. Summation methods). The study of unconditional summability originated with W. Orlicz ; he showed, in particular, that if , then absolute summability of the series by a linear regular method (cf. Regular summation methods) implies unconditional convergence. It was subsequently shown that this condition may be replaced by a weaker one: . Unconditional summability by a matrix method does not imply unconditional convergence; in fact, take the series . If is a regular matrix summation method and if the series (*) is unconditionally -summable, then all its terms have the form , where is a constant and the series with terms is absolutely convergent: ; moreover, if the method does not sum the series .
In the case of series of functions one distinguishes between summability in measure, everywhere summability, almost-everywhere summability, etc. For unconditional summability of a series of functions, the following statement is valid almost-everywhere: If the series of measurable functions on a set is unconditionally -summable almost-everywhere on , then the terms of this series have the form , where is a finite measurable function on and the series is unconditionally almost-everywhere convergent on ; also, if does not sum .