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.
We show that shadowing is a generic property for continuous maps on dendrites.
Every conditionally convergent series of real numbers has a divergent subseries. How many subsets of the natural numbers are needed so that every conditionally convergent series diverges on the subseries corresponding to one of these sets? The answer to this question is defined to be the subseries number, a new cardinal characteristic of the continuum. This cardinal is bounded below by ℵ 1 and above by the cardinality of the continuum, but it is not provably equal to either. We define three natural variants of the subseries number, and compare them with each other, with their corresponding rearrangement numbers, and with several well-studied cardinal characteristics of the continuum. Many consistency results are obtained from these comparisons, and we obtain another by computing the value of the subseries number in the Laver model.
The shift map σ on ω* is the continuous self-map of ω* induced by the function n ↦ n + 1 on ω. Given a compact Hausdorff space X and a continuous function f : X → X, we say that (X, f) is a quotient of (ω*, σ) whenever there is a continuous surjection Q : ω*→ X such that Q ○ σ = σ ○ f.Our main theorem states that if the weight of X is at most ℵ1, then (X, f) is a quotient of (ω*, σ), if and only if f is weakly incompressible (which means that no nontrivial open U ⊆ X has $f\left( {\bar{U}} \right) \subseteq U$). Under CH, this gives a complete characterization of the quotients of (ω*, σ) and implies, for example, that (ω*, σ−1) is a quotient of (ω*, σ).In the language of topological dynamics, our theorem states that a dynamical system of weight ℵ1 is an abstract ω-limit set if and only if it is weakly incompressible.We complement these results by proving (1) our main theorem remains true when ℵ1 is replaced by any κ < p, (2) consistently, the theorem becomes false if we replace ℵ1 by ℵ2, and (3) OCA + MA implies that (ω*, σ−1) is not a quotient of (ω*, σ).
No abstract
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
hi@scite.ai
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.