Superpolynomial convergence in the Riemann Rearrangement Theorem
Abstract
Let x ∈ R be arbitrary and consider the `greedy' approximation of x by signed harmonic sums: given an = Σk ≤ n k/k with k ∈ \-1,1\, we set n+1 = 1 if an ≤ x and n+1 = -1 otherwise. Bettin-Molteni-Sanna showed (Adv. Math. 2020) that this procedure has remarkable approximation properties: for almost all x ∈ R one has superpolynomial convergence in the sense that for every k ∈ N there are infinitely many n ∈ N with |an - x| ≤ n-k. We extend this result from 1 1/2 1/3 … 1/n to moment sequences, i.e. sequences defined as the moments of a measure μ supported on [0,1].
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.