Agnew's theorem explained

Agnew's theorem characterizes term rearrangements that preserve convergence of series. It was proposed by American mathematician Ralph Palmer Agnew.

Statement

Let be a permutation of

N , i.e., a bijective function p: N \to N . Then the following two statements are equivalent:^[1]

1. For any convergent series of real or complex terms $\backslash sum\_^\backslash infty\; a\_n$, the series $\backslash sum\_^\backslash infty\; a\_$ converges to the same sum.
2. There exists a constant such that, for any

n \in N , maps the interval to a union of at most intervals.

Examples

Let us split

N in intervals:

$$[g\_0+1,\backslash ,g\_1],\backslash ,\backslash ldots,\backslash ,[g\_\{k-1\}+1,\backslash ,g\_k],\backslash ,\backslash ldots\backslash ;,$$

where

g _{0=0} and g _{k>g} _{k-1} for any k \in N .

Let us also consider a permutation

p = p _{1} \circ … \circ p _{k} \circ … composed of an infinite number of permutations p _{k} that permute numbers within corresponding intervals:

Since each

p _{k} maps [g _{k-1} +1 ,g _{k]} to itself, it follows that p maps [ 1 ,n] to:

1. itself, if

n = g _{k} for some k , or

1. the union of

[ 1 ,g _{k-1} ] and the image under p _{k} of [g _{k-1} +1 ,n] , if n \in [g _{k-1} +1 ,g _{k-1]} for some k .

Hence, the total number of intervals in the image under

p of [ 1 ,n] equals 1 plus whatever number of additional intervals is created by p _{k} .

Bounded intervals

Permutation

p _{k} can create at most $\backslash left\backslash lfloor\backslash frac\backslash right\backslash rfloor$ additional intervals by mapping the first half of its interval, $[g\_\{k-1\}+1,\backslash ,g\_\{k-1\}+\backslash left\backslash lfloor\backslash frac\{g\_k-g\_\{k-1\}\}\{2\}\backslash right\backslash rfloor]$, in an interleaving fashion:

$$p\_k(g\_+n)\; =\; g\_+2n\backslash ;.$$

If the lengths of the intervals are bounded, i.e.,

g _{k-g} _{k-1} \le L , then permutation p _{k} can create at most $\backslash left\backslash lfloor\backslash frac\backslash right\backslash rfloor$ additional intervals, fulfilling the criterion in Agnew's theorem. Therefore, any p _{k} may be used.

This means that the terms of any convergent series $\backslash sum\_^\backslash infty\; a\_n$ may be rearranged freely within groups, if the lengths of these groups are bounded by a constant.

Unbounded intervals

Permutations

p _{k} that mirror their interval:

$$p\_k(g\_+n)\; =\; g\_k+1-n\backslash ;,$$

permutations

p _{k} that perform right circular shifts of their interval by S positions (0 < S < g _{k-g} _{k-1} ):

$$p\_k(g\_+n)\; =\; g\_+1+\backslash left((n-1+S)\; \backslash bmod\; (g\_k-g\_)\backslash right)\backslash ;,$$

and permutations

p _{k} that are the inverses of the interleaving permutations described above:

all create 1 additional interval, fulfilling the criterion in Agnew's theorem.

Permutations

p _{k} that rearrange their interval as B > 1 blocks can create at most $\backslash min(\backslash left\backslash lceil\backslash frac\backslash right\backslash rceil,\backslash left\backslash lfloor\backslash frac\backslash right\backslash rfloor)$ additional intervals. If the number of these blocks is bounded, then the criterion in Agnew's theorem is fulfilled.

This means that within groups of arbitrary unbounded length the terms of any convergent series $\backslash sum\_^\backslash infty\; a\_n$ may be mirrored, circularly shifted and rearranged in blocks (if the number of these blocks is bounded by a constant); terms at even positions within groups may be gathered at the beginning of the group (in the same order).

Dealing with unknown series

The permutations described by Agnew's theorem can transform a divergent series into a convergent one. Let us consider a permutation

p as described above with intervals increasing and p _{k} being interleaving permutations described above. Such p does not fulfill the criterion in Agnew's theorem, therefore, there exists a convergent series $\backslash sum\_^\backslash infty\; a\_n$ such that $\backslash sum\_^\backslash infty\; a\_$ is either divergent or converges to a different sum. But it can't converge to a different sum: the inverse permutation p ^{-1} is composed of inverses of interleaving permutations p ^{-1} _{k} , which all fulfill the criterion in Agnew's theorem, therefore $\backslash sum\_^\backslash infty\; a\_\; =\; \backslash sum\_^\backslash infty\; a\_n$ would converge to the same sum as $\backslash sum\_^\backslash infty\; a\_$. This means that $\backslash sum\_^\backslash infty\; a\_$ must be divergent.

However, if we require both

p and p ^{-1} to satisfy the criterion in Agnew's theorem, then p will preserve both convergence (with the same sum) and divergence. (If it didn't preserve divergence, then the inverse wouldn't preserve convergence.)

In fact, such permutations preserve absolute convergence (with the same sum), conditional convergence (with the same sum) and divergence. (All permutations preserve absolute convergence with the same sum; a conditionally convergent series can't be turned into an absolutely convergent one because the reverse permutation wouldn't preserve absolute convergence.)

This means that, when dealing with a series for which it is unknown whether it converges and what type of convergence it has, its terms may be rearranged using permutations

p , such that both p and p ^{-1} map [ 1 ,n] to at most K intervals, without changing the type of convergence/divergence of the series.

Notes and References

1. Ralph Palmer . Agnew . 1955 . Permutations preserving convergence of series . Proc. Amer. Math. Soc. . 6 . 4 . 563–564.