Riemann rearrangement theorem

A conditionally convergent real series can be rearranged to converge to any prescribed value or to diverge
Riemann rearrangement theorem

Riemann rearrangement theorem: Let n=1an\sum_{n=1}^\infty a_n be a of real numbers (i.e., it converges but not absolutely). Then for any LRL\in\mathbb{R} there exists a aπ(n)\sum a_{\pi(n)} that converges to LL. There also exist rearrangements that diverge to ++\infty, to -\infty, and that oscillate.

This theorem highlights that conditional convergence is fragile: the “sum” depends on the order of terms.

Proof sketch (optional): Separate positive and negative terms: an+\sum a_n^+ diverges to ++\infty and an\sum a_n^- diverges to -\infty. Build a rearrangement by adding enough positive terms to exceed LL, then enough negative terms to drop below LL, and repeat with ever smaller overshoots since an0a_n\to 0.