How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced — the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted — a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated — a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
Rearrangement of a series along a bijection of , and unconditional convergence
Definition
Let be a sequence of reals (Sequences of reals: bounded, eventually, frequently, tails, subsequences) and let be a bijection (Injection, surjection, bijection).
Rearrangement. The rearrangement of along is the composite sequence , again a function and so again a sequence of reals. The rearrangement of the series along is the series of that sequence (Series, partial sums, convergence and the sum, divergence, and the tail series).
A rearrangement uses each term of the original sequence exactly once: injectivity of says no term is repeated, surjectivity says none is omitted. That is the whole content of the word, and it is why the definition is stated with a bijection rather than with an informal "reordering".
Unconditional convergence. The series converges unconditionally when it converges and, for every bijection , the rearranged series converges with
Remarks
-
Unconditional convergence implies convergence, by definition and also by instance. The identity map is a bijection of and the rearrangement along it is the original sequence, so the clause about all bijections already contains the clause about the series itself.
-
Rearranging twice is rearranging once. If and are bijections of then so is , and the rearrangement of along is , the rearrangement of along . Likewise the inverse is a bijection, and rearranging along it undoes . Both facts are used in Dirichlet's rearrangement theorem: an absolutely convergent series converges unconditionally, and every rearrangement of it has the same sum.
-
A weaker-looking condition, which turns out to be the same one. One could ask only that every rearrangement converge, without requiring the sums to agree. Over that is not weaker: For a series of real numbers, unconditional convergence and absolute convergence are the same property identifies both conditions with absolute convergence (Absolutely convergent and conditionally convergent series, and the general starting index), because The Riemann series theorem: a conditionally convergent real series has, for every , a rearrangement with sum , and rearrangements diverging to , to , and oscillating with any prescribed in produces, for a series that converges but not absolutely, both a rearrangement with a different sum and a rearrangement that does not converge at all.
-
The definition says nothing about which series have the property. That is the subject of the two theorems that follow, and the answer over is exactly the absolutely convergent series.
Depends on
Used by
- For a series of real numbers, unconditional convergence and absolute convergence are the same property Corollary
- Series of vectors in ℝⁿ, absolute convergence, rearrangement, and the set of rearrangement sums Definition
- An explicit greedy rearrangement of the alternating harmonic series with sum 0, and the same recipe for any prescribed real Example
- Every rearrangement of ∑_k ≥ 0 (-1/2)ᵏ converges to 2/3 Example
- Taking two positive terms for each negative one rearranges the alternating harmonic series to 3/2 times its sum, by the identity T₃ₙ = S₄ₙ + tfrac12 S₂ₙ Example
- FALSE: every rearrangement of a convergent series converges, and to the same sum False statement
- The same question in ℝᵈ: what the set of rearrangement sums looks like, and why that answer is not reachable at this point in the reading order Remark
- Dirichlet's rearrangement theorem: an absolutely convergent series converges unconditionally, and every rearrangement of it has the same sum Theorem
- Fubini for double series: if ∑ᵢ ∑ⱼ |aᵢⱼ| converges then both iterated sums and the sum along every bijection ℕ → ℕ × ℕ converge to one and the same value Theorem
- The Riemann series theorem: a conditionally convergent real series has, for every c ∈ ℝ, a rearrangement with sum c, and rearrangements diverging to +∞, to -∞, and oscillating with any prescribed liminf ≤ limsup in overlineℝ Theorem
- The set of rearrangement sums of a convergent series in ℝⁿ is a nonempty subset of the affine subspace s + Γ^⊥ Theorem
Dependency tree · next 3 levels
Direct dependencies and their dependencies through the next three levels: 55 results over 16 levels. An arrow runs from a result to what uses it, and this result sits at the bottom with a heavier outline. Click the chart to enlarge it.
Sources
- Riemann series theorem (Wikipedia) (standard reference, not scraped)
- Unconditional convergence (Wikipedia) (standard reference, not scraped)
- N. Donaldson, Math 140A: Real Analysis notes (standard reference, not scraped)
- John K. Hunter, An Introduction to Real Analysis, Chapter 4 (standard reference, not scraped)