{
  "id": "alternating-series",
  "title": "Alternating Series",
  "lang": "en",
  "source_lang": "en",
  "summary": "An alternating series is an infinite series whose terms alternate in sign; decreasing term magnitudes tending to zero ensure convergence and give a direct error bound.",
  "category": "mathematics",
  "subcategory": "analysis",
  "type": "concept",
  "aliases": [
    "Alternating-sign series"
  ],
  "generated_at": "2026-11-05",
  "model": "pro/gpt-6.1-sol",
  "url": "https://aiwiki.page/en/alternating-series/",
  "translations": {
    "zh-Hans": {
      "url": "https://aiwiki.page/zh/alternating-series/",
      "json": "https://aiwiki.page/zh/alternating-series.json"
    }
  },
  "sections": [
    {
      "heading": "",
      "text": "An alternating series is an infinite series of real numbers whose successive nonzero terms alternate between positive and negative. Its standard form is\n\n\\[\\sum_{n=1}^{\\infty}(-1)^{n-1}a_n =a_1-a_2+a_3-a_4+\\cdots, \\qquad a_n\\geq 0.\\]\n\nA series beginning with a negative term differs only by an overall minus sign. Alternation alone does not guarantee convergence. The central result is the alternating series test: if the magnitudes decrease monotonically to zero, the series converges, and the error after any sufficiently late partial sum is no larger than the magnitude of the next term."
    },
    {
      "heading": "Definition and convergence",
      "text": "For the standard form above, the \\(N\\)th partial sum is\n\n\\[S_N=\\sum_{n=1}^{N}(-1)^{n-1}a_n.\\]\n\nThe series converges to a sum \\(S\\) when the sequence of partial sums has the limit\n\n\\[\\lim_{N\\to\\infty}S_N=S.\\]\n\nThus convergence concerns the accumulated sums, not merely the individual terms.\n\nA necessary condition for convergence is \\(a_n\\to0\\). This condition is not sufficient, even when signs alternate. For example,\n\n\\[1-1+1-1+\\cdots\\]\n\ndoes not converge in the ordinary sense, since its partial sums alternate between \\(1\\) and \\(0\\).\n\nAllowing \\(a_n=0\\) is convenient in statements of theorems. Strictly alternating nonzero terms correspond to \\(a_n>0\\); zero terms can be omitted when describing the sign pattern."
    },
    {
      "heading": "Alternating series test",
      "text": "The alternating series test, also called the Leibniz test after Gottfried Wilhelm Leibniz, states that\n\n\\[\\sum_{n=1}^{\\infty}(-1)^{n-1}a_n\\]\n\nconverges if:\n\n- \\(a_n\\geq0\\);\n- \\(a_{n+1}\\leq a_n\\);\n- \\(\\lim_{n\\to\\infty}a_n=0\\).\n\nThe second condition means that the magnitudes form a nonincreasing sequence, the discrete analogue of a monotonic function. Both nonnegativity and monotonic decrease need hold only from some index onward: changing finitely many terms does not affect whether a series converges.\n\nThese are sufficient conditions, not a characterization of every convergent alternating series. If the magnitudes are not eventually nonincreasing, the test gives no conclusion.\n\nProof by interlacing partial sums\n\nAssume the conditions hold from the first term. The even partial sums satisfy\n\n\\[S_{2m+2}-S_{2m} =a_{2m+1}-a_{2m+2}\\geq0,\\]\n\nso they form a nondecreasing sequence. The odd partial sums satisfy\n\n\\[S_{2m+3}-S_{2m+1} =-a_{2m+2}+a_{2m+3}\\leq0,\\]\n\nso they form a nonincreasing sequence.\n\nMoreover, every even partial sum lies below every odd partial sum. The two sequences are therefore bounded and converge. Their difference is\n\n\\[S_{2m+1}-S_{2m}=a_{2m+1}\\longrightarrow0,\\]\n\nso they have the same limit. Consequently, the full sequence \\(S_N\\) converges.\n\nThis proof also shows that the sum is bracketed by consecutive partial sums:\n\n\\[S_{2m}\\leq S\\leq S_{2m+1}.\\]"
    },
    {
      "heading": "Remainder and approximation error",
      "text": "Under the hypotheses of the alternating series test, define the remainder after \\(N\\) terms by\n\n\\[R_N=S-S_N.\\]\n\nThen\n\n\\[|R_N|\\leq a_{N+1}, \\qquad 0\\leq(-1)^N R_N\\leq a_{N+1}.\\]\n\nThus the remainder has the sign of the first omitted term, unless it is zero. For a series beginning positively:\n\n- an even partial sum is a lower bound for the sum;\n- an odd partial sum is an upper bound;\n- consecutive partial sums enclose the sum in an interval of width \\(a_{N+1}\\).\n\nTo guarantee an absolute truncation error no greater than \\(\\varepsilon\\), it suffices to choose \\(N\\) so that\n\n\\[a_{N+1}\\leq\\varepsilon.\\]\n\nIf monotonicity begins only after an initial segment, this estimate applies once the omitted tail satisfies the test’s hypotheses.\n\nThe estimate is especially useful in numerical analysis because it requires neither the exact sum nor a separate bound on all remaining terms. It bounds truncation error, however, not rounding errors introduced by floating-point arithmetic."
    },
    {
      "heading": "Absolute and conditional convergence",
      "text": "An alternating series is absolutely convergent if\n\n\\[\\sum_{n=1}^{\\infty}a_n\\]\n\nconverges. This is the series obtained by taking the absolute value of every term. Absolute convergence guarantees convergence of the original series, whether or not its signs alternate.\n\nA series is conditionally convergent if it converges but its absolute-value series diverges. Alternating series provide fundamental examples because cancellation can produce a finite sum even when the total magnitude is infinite.\n\nThe alternating series test establishes ordinary convergence; it does not by itself decide absolute convergence.\n\nAlternating harmonic series\n\nThe alternating harmonic series is\n\n\\[1-\\frac12+\\frac13-\\frac14+\\cdots =\\sum_{n=1}^{\\infty}\\frac{(-1)^{n-1}}{n} =\\ln2,\\]\n\nwhere \\(\\ln\\) denotes the natural logarithm. Its magnitudes decrease to zero, so the alternating series test applies. The corresponding positive series \\(\\sum 1/n\\) diverges, making the alternating harmonic series conditionally convergent.\n\nIts remainder satisfies\n\n\\[|R_N|\\leq\\frac{1}{N+1}.\\]\n\nFor example, \\(999\\) terms suffice to guarantee an absolute truncation error no greater than \\(10^{-3}\\).\n\nAlternating power-law terms\n\nFor real \\(p\\), consider\n\n\\[\\sum_{n=1}^{\\infty}\\frac{(-1)^{n-1}}{n^p}.\\]\n\n- If \\(p>1\\), the series converges absolutely.\n- If \\(0<p\\leq1\\), it converges conditionally.\n- If \\(p\\leq0\\), its terms do not tend to zero, so it diverges.\n\nThis family separates the role of cancellation from the rate at which term magnitudes decrease.\n\nAlternating geometric series\n\nFor \\(0<r<1\\), the geometric series\n\n\\[1-r+r^2-r^3+\\cdots=\\frac{1}{1+r}\\]\n\nconverges absolutely. After \\(N\\) terms, its exact remainder is\n\n\\[R_N=\\frac{(-r)^N}{1+r},\\]\n\nand hence\n\n\\[|R_N|=\\frac{r^N}{1+r}\\leq r^N,\\]\n\nconsistent with the alternating-series remainder bound."
    },
    {
      "heading": "Why decreasing magnitudes matter",
      "text": "The requirement that magnitudes decrease cannot simply be discarded while retaining the test’s conclusion. Define\n\n\\[a_{2k-1}=\\frac{1}{\\sqrt{k}}+\\frac{1}{k}, \\qquad a_{2k}=\\frac{1}{\\sqrt{k}}.\\]\n\nThese magnitudes tend to zero, and the series\n\n\\[a_1-a_2+a_3-a_4+\\cdots\\]\n\nhas strictly alternating signs. Nevertheless,\n\n\\[S_{2m} =\\sum_{k=1}^{m}(a_{2k-1}-a_{2k}) =\\sum_{k=1}^{m}\\frac1k,\\]\n\nwhich tends to positive infinity. The positive excess in each adjacent pair accumulates without bound.\n\nConversely, monotonicity is not necessary for convergence. For example, set\n\n\\[a_{2k-1}=4^{-k}, \\qquad a_{2k}=2\\cdot4^{-k}.\\]\n\nThe magnitudes increase from every odd-indexed term to the following even-indexed term, so they are not eventually nonincreasing. Yet their total sum is finite, and the alternating series therefore converges absolutely."
    },
    {
      "heading": "Power series and function expansions",
      "text": "Alternating series occur frequently in power series and Taylor expansions. For example,\n\n\\[\\ln(1+x) =\\sum_{n=1}^{\\infty}(-1)^{n-1}\\frac{x^n}{n}, \\qquad -1<x\\leq1.\\]\n\nFor \\(0<x\\leq1\\), the expansion is alternating, and the remainder after \\(N\\) terms satisfies\n\n\\[|R_N(x)|\\leq\\frac{x^{N+1}}{N+1}.\\]\n\nAt \\(x=1\\), it gives the alternating harmonic series. At the other endpoint, \\(x=-1\\), it becomes a divergent negative harmonic series, illustrating why the endpoints of a power series require separate examination.\n\nAnother example is\n\n\\[\\arctan x =\\sum_{n=0}^{\\infty}(-1)^n\\frac{x^{2n+1}}{2n+1}, \\qquad |x|\\leq1.\\]\n\nAt \\(x=1\\), this yields\n\n\\[\\frac{\\pi}{4}=1-\\frac13+\\frac15-\\frac17+\\cdots,\\]\n\nwhere \\pi is the circle constant. Although convergent, the series is slow for numerical computation because its term magnitudes decrease only proportionally to \\(1/n\\).\n\nWhen the next-term bound tends to zero uniformly over a domain, it also establishes uniform convergence. For instance, the logarithm expansion above converges uniformly on \\([0,1]\\), since\n\n\\[\\sup_{0\\leq x\\leq1}|R_N(x)| \\leq\\frac{1}{N+1}\\longrightarrow0.\\]"
    },
    {
      "heading": "Rearrangement and grouping",
      "text": "The order of terms matters for conditionally convergent series. The Riemann rearrangement theorem states that a conditionally convergent real series can be rearranged to converge to any prescribed real number; other rearrangements can make it diverge.\n\nFor example, rearrange the alternating harmonic series by taking two positive terms followed by one negative term:\n\n\\[1+\\frac13-\\frac12+\\frac15+\\frac17-\\frac14+\\cdots.\\]\n\nThe resulting sum is\n\n\\[\\frac32\\ln2,\\]\n\nrather than \\(\\ln2\\).\n\nBy contrast, every rearrangement of an absolutely convergent series has the same sum. Grouping consecutive terms of an already convergent series into finite blocks also preserves its sum. However, convergence of the grouped series alone does not establish convergence of the original series: grouping \\(1-1+1-1+\\cdots\\) into pairs produces zero-valued blocks while concealing the oscillation of its ungrouped partial sums."
    }
  ],
  "links": [
    "infinite-series",
    "real-number",
    "limit",
    "gottfried-wilhelm-leibniz",
    "monotonic-function",
    "numerical-analysis",
    "floating-point-arithmetic",
    "absolute-convergence",
    "absolute-value",
    "natural-logarithm",
    "geometric-series",
    "power-series",
    "taylor-series",
    "pi",
    "uniform-convergence"
  ],
  "sources": [],
  "license": "https://creativecommons.org/licenses/by/4.0/"
}