Alphabeta Math
RemarkRemark: AI-adaptedProof: Not applicableSession-authored (Fable 5 assisted)judge pass (z-ai/glm-5.2)audited 2026-07-29
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.

The same question in Rd\mathbb{R}^d: what the set of rearrangement sums looks like, and why that answer is not reachable at this point in the reading order

Remark

Everything on this page is about series of real numbers, and the answer it reaches is complete for that case. Write

S(a)  :=  {sR : some rearrangement of ak converges to s}\mathcal{S}(a) \;:=\; \Bigl\{\, s \in \mathbb{R} \ : \ \text{some rearrangement of } \sum a_k \text{ converges to } s \,\Bigr\}

for the set of rearrangement sums of a convergent series (Rearrangement of a series along a bijection of N\mathbb{N}, and unconditional convergence). Then this page determines S(a)\mathcal{S}(a) exactly, in two cases and no others.

For a series of real numbers, unconditional convergence and absolute convergence are the same property is the statement that these two cases are distinguished by absolute convergence and by nothing else.

The same question can be asked of a series of vectors, once one has a space in which a series of vectors has a sum: given a convergent series in Rd\mathbb{R}^d, what does its set of rearrangement sums look like? That question was raised by Paul Lévy in 1905 and taken up by Ernst Steinitz in 1913, and later by Wacław Sierpiński; the references below are to those papers, and they are given as the origin of the question. What the literature answers is not stated here in any form, and nothing on this page or anywhere else in this library depends on it. Part of it is now proved, later in the reading order and marked as forward material: Steinitz's polygonal confinement theorem: finitely many vectors of norm at most 11 summing to 00 can be ordered so that every partial sum has norm at most nn and The set of rearrangement sums of a convergent series in Rn\mathbb{R}^n is a nonempty subset of the affine subspace s+Γs + \Gamma^{\perp} establish that the set of rearrangement sums is nonempty and lies inside an affine subspace. The reverse inclusion, which is what would turn that containment into the classical answer, is still proved nowhere here.

The reason is a matter of reading order, not of difficulty or of interest. Stating the theorem requires Rd\mathbb{R}^d as a normed space (a norm, convergence of vector sequences, and a notion of a convergent series of vectors), and that vocabulary is introduced later in the reading order than this page. Rather than borrow it, or state a theorem whose terms are not yet defined, the obligation is recorded where it can be discharged: on the page that builds Rd\mathbb{R}^d as a normed space and afterwards. When that page is reached, the question raised here is the one it will answer.

What is safe to say now, and is worth saying. The one-dimensional dichotomy above is stark: a single point, or everything. Nothing in the proof of The Riemann series theorem: a conditionally convergent real series has, for every cRc \in \mathbb{R}, a rearrangement with sum cc, and rearrangements diverging to ++\infty, to -\infty, and oscillating with any prescribed lim inflim sup\liminf \le \limsup in R\overline{\mathbb{R}} survives verbatim in higher dimensions, because it is built on the order of R\mathbb{R}: the greedy rule "add positive terms until the running sum exceeds the target, then negative ones until it falls below" presupposes that the terms are signed and that the target can be approached from two sides. In Rd\mathbb{R}^d with d2d \ge 2 there is no such order, the terms point in many directions, and the argument has no analogue. A reader who expects the one-dimensional answer to generalise unchanged should treat that expectation as unsupported until the later page settles it.

No claim of this library is made about Rd\mathbb{R}^d above. The two Lévy and Steinitz papers are cited as the historical source of the question, not as authority for a result used anywhere here; no item on this page or elsewhere in the library rests on them.

Depends on

Used by

Dependency tree · next 3 levels

Direct dependencies and their dependencies through the next three levels: 78 results over 20 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