The rearrangement number

[bibtex key=BlassBrendleBrianHamkinsHardyLarson2020:TheRearrangementNumber]

Abstract.  How many permutations of the natural numbers are needed so that every conditionally convergent series of real numbers can be rearranged to no longer converge to the same sum? We show that the minimum number of permutations needed for this purpose, which we call the rearrangement number, is uncountable, but whether it equals the cardinal of the continuum is independent of the usual axioms of
set theory. We compare the rearrangement number with several natural variants, for example one obtained by requiring the rearranged series to still converge but to a new, finite limit. We also compare the rearrangement number with several well-studied
cardinal characteristics of the continuum. We present some new forcing constructions designed to add permutations that rearrange series from the ground model in particular ways, thereby obtaining consistency results going beyond those that follow from comparisons with familiar cardinal characteristics. Finally we deal briefly with some variants concerning rearrangements by a special sort of permutations and with rearranging some divergent series to become (conditionally) convergent.

This project started with Michael Hardy’s question on MathOverflow, How many rearrangements must fail to alter the value of a sum before you conclude that none do? I had proposed in my answer that we should think of the cardinal in question as a cardinal characteristic of the continuum, the rearrangement number, since we could prove that it was uncountable and that it was the continuum under MA, and had begun to separate it from other familiar cardinal characteristics. Eventually, the research effort grew into the collaboration of this paper. What a lot of fun!

Colloquium talk at Vassar | Lecture notes talk at CUNY | the original MathOverflow question

The lecture notes are for an introductory talk on the topic I had given at the Vassar College Mathematics Colloquium.

3 thoughts on “The rearrangement number

  1. Pingback: The subseries number | Joel David Hamkins

  2. Pingback: The rearrangement number: how many rearrangements of a series suffice to validate absolute convergence? Warwick Mathematics Colloquium, October 2018 | Joel David Hamkins

  3. Pingback: The rearrangement and subseries numbers: how much convergence suffices for absolute convergence? Mathematics Colloquium, University of Münster, January 2019 | Joel David Hamkins

Leave a Reply

Your email address will not be published. Required fields are marked *