Constructive aspects of Riemann's permutation theorem for series

2013/03/28 by Josef Berger, Berger, J., Douglas Bridges +5
Computer Science · Mathematics · #Computability, Logic, AI Algorithms #Advanced Topology and Set Theory #Mathematical and Theoretical Analysis

paper · pdf · doi:10.48550/arxiv.1303.7051

Abstract

The notions of permutable and weak-permutable convergence of a series ∑_n=1^∞a_n of real numbers are introduced. Classically, these two notions are equivalent, and, by Riemann's two main theorems on the convergence of series, a convergent series is permutably convergent if and only if it is absolutely convergent. Working within Bishop-style constructive mathematics, we prove that Ishihara's principle \BDN implies that every permutably convergent series is absolutely convergent. Since there are models of constructive mathematics in which the Riemann permutation theorem for series holds but \BDN does not, the best we can hope for as a partial converse to our first theorem is that the absolute convergence of series with a permutability property classically equivalent to that of Riemann implies \BDN. We show that this is the case when the property is weak-permutable convergence.

Related

• On the c₀-equivalence and permutations of series
• On Riemann's Theorem About Conditionally Convergent Series
• Type R λ-Permutation Approach to Velleman's Open Problem
• The Rearrangement Number
• On the set of limit points of conditionally convergent series