{
  "id": "infinite-series",
  "title": "Infinite Series",
  "lang": "en",
  "source_lang": "en",
  "summary": "An infinite series is an ordered sum of infinitely many terms, assigned an ordinary sum when its finite partial sums approach a limit.",
  "category": "mathematics",
  "subcategory": "analysis",
  "type": "concept",
  "aliases": [
    "Infinite sum"
  ],
  "generated_at": "2026-10-04",
  "model": "pro/gpt-6.1-sol",
  "url": "https://aiwiki.page/en/infinite-series/",
  "translations": {
    "zh-Hans": {
      "url": "https://aiwiki.page/zh/infinite-series/",
      "json": "https://aiwiki.page/zh/infinite-series.json"
    }
  },
  "sections": [
    {
      "heading": "",
      "text": "An infinite series is an expression formed by adding the terms of an infinite sequence in a specified order. Its ordinary sum is defined as the limit of its finite partial sums, when that limit exists. Infinite series provide a way to obtain finite values from infinitely many contributions, but they may also diverge. Their convergence and manipulation are central subjects of calculus and mathematical analysis. (openstax.org)"
    },
    {
      "heading": "Definition and convergence",
      "text": "For a sequence \\(a_1,a_2,\\ldots\\) of real numbers or complex numbers, the associated series is written\n\n\\[\\sum_{n=1}^{\\infty}a_n=a_1+a_2+a_3+\\cdots.\\]\n\nIts \\(N\\)th partial sum is\n\n\\[S_N=\\sum_{n=1}^{N}a_n.\\]\n\nThe series converges to \\(S\\) if \\(S_N\\to S\\) as \\(N\\to\\infty\\). More precisely, for every \\(\\varepsilon>0\\), there must be an index \\(N_0\\) such that \\(|S_N-S|<\\varepsilon\\) whenever \\(N\\ge N_0\\). Otherwise, the series diverges. Thus, an infinite sum is a limiting process, not a finite addition with an infinitely distant last term. (openstax.org)\n\nA series must be distinguished from its sequence of terms. Convergence of \\(\\sum a_n\\) implies \\(a_n\\to0\\), because \\(a_n=S_n-S_{n-1}\\), but the converse is false: terms can tend to zero while their accumulated sum grows without bound. Divergence can also occur through oscillation rather than unbounded growth. (openstax.org)\n\nThe Cauchy criterion expresses convergence without requiring the sum to be known in advance. A real or complex series converges exactly when, for every \\(\\varepsilon>0\\), all sufficiently late finite tails satisfy\n\n\\[\\left|\\sum_{n=p}^{q}a_n\\right|<\\varepsilon \\qquad(q\\ge p).\\]\n\nEquivalently, its partial sums form a Cauchy sequence. This criterion underlies the rigorous treatment of series through the smallness of their tails. (mathshistory.st-andrews.ac.uk)"
    },
    {
      "heading": "Fundamental examples",
      "text": "Geometric series\n\nA geometric series has a constant ratio between consecutive terms:\n\n\\[\\sum_{n=0}^{\\infty}ar^n.\\]\n\nFor \\(r\\ne1\\), its partial sum through \\(n=N\\) is\n\n\\[a\\frac{1-r^{N+1}}{1-r}.\\]\n\nConsequently,\n\n\\[\\sum_{n=0}^{\\infty}ar^n=\\frac{a}{1-r} \\qquad\\text{when }|r|<1.\\]\n\nFor \\(a\\ne0\\), it diverges when \\(|r|\\ge1\\). In particular,\n\n\\[1+\\frac12+\\frac14+\\frac18+\\cdots=2.\\]\n\nThe zero series, obtained when \\(a=0\\), is a trivial exception to the divergence statement. (openstax.org)\n\nHarmonic and \\(p\\)-series\n\nThe harmonic series\n\n\\[\\sum_{n=1}^{\\infty}\\frac1n\\]\n\ndiverges even though \\(1/n\\to0\\). More generally, for real \\(p\\), a p-series\n\n\\[\\sum_{n=1}^{\\infty}\\frac1{n^p}\\]\n\nconverges exactly when \\(p>1\\). These series are standard benchmarks for comparison tests. (openstax.org)\n\nFor a complex parameter \\(s\\), the related expression\n\n\\[\\zeta(s)=\\sum_{n=1}^{\\infty}n^{-s}\\]\n\ndefines the Riemann zeta function in the region \\(\\operatorname{Re}(s)>1\\). Definitions of that function outside this region require an extension beyond this convergent series representation. (dlmf.nist.gov)\n\nTelescoping series\n\nIn a telescoping series, cancellation makes the partial sums especially simple. For example,\n\n\\[\\sum_{n=1}^{N}\\frac1{n(n+1)} = \\sum_{n=1}^{N}\\left(\\frac1n-\\frac1{n+1}\\right) = 1-\\frac1{N+1}.\\]\n\nTaking the limit gives\n\n\\[\\sum_{n=1}^{\\infty}\\frac1{n(n+1)}=1.\\]\n\nThe cancellation is performed first in finite partial sums, avoiding any assumption that infinite expressions may be manipulated like finite ones. (openstax.org)"
    },
    {
      "heading": "Absolute and conditional convergence",
      "text": "A series is absolutely convergent if\n\n\\[\\sum_{n=1}^{\\infty}|a_n|<\\infty.\\]\n\nAbsolute convergence implies ordinary convergence. A series is conditionally convergent if it converges but its series of absolute values diverges. These distinctions are collected under absolute and conditional convergence. (openstax.org)\n\nThe alternating harmonic series is a standard conditionally convergent example:\n\n\\[1-\\frac12+\\frac13-\\frac14+\\cdots=\\ln2.\\]\n\nIts signs provide cancellation sufficient for convergence, although the corresponding harmonic series of positive terms diverges. (openstax.org)\n\nAbsolute convergence is particularly important when changing the order of terms: every rearrangement of an absolutely convergent real or complex series has the same sum. Conditional convergence does not provide this protection. The Riemann rearrangement theorem states that a conditionally convergent real series can be rearranged to converge to any prescribed real number, or to diverge. The order of summation is therefore part of the meaning of a conditionally convergent series. (openstax.org)"
    },
    {
      "heading": "Tests for convergence",
      "text": "Most series do not have a convenient formula for their partial sums. Convergence tests establish convergence or divergence without necessarily determining the sum.\n\n- Term test: if \\(a_n\\) does not tend to zero, then \\(\\sum a_n\\) diverges. If \\(a_n\\to0\\), this test is inconclusive. (openstax.org)\n- Comparison test: if \\(0\\le a_n\\le b_n\\) eventually and \\(\\sum b_n\\) converges, then \\(\\sum a_n\\) converges. If \\(a_n\\ge b_n\\ge0\\) eventually and \\(\\sum b_n\\) diverges, then \\(\\sum a_n\\) diverges. (openstax.org)\n- Limit comparison test: for eventually positive terms, if \\(a_n/b_n\\to L\\) with \\(0<L<\\infty\\), the two series either both converge or both diverge. (openstax.org)\n- Integral test: if \\(a_n=f(n)\\), where \\(f\\) is eventually positive, continuous, and decreasing, then \\(\\sum a_n\\) and the corresponding improper integral have the same convergence behavior. (openstax.org)\n\nThe ratio test, assuming the terms are eventually nonzero, uses\n\n\\[L=\\lim_{n\\to\\infty}\\left|\\frac{a_{n+1}}{a_n}\\right|.\\]\n\nIf \\(L<1\\), the series converges absolutely; if \\(L>1\\), it diverges. When \\(L=1\\), the test is inconclusive. The root test similarly examines \\(\\lim_{n\\to\\infty}|a_n|^{1/n}\\), when this limit exists, with the same conclusions. These tests detect geometric-type decay or growth. (openstax.org)\n\nFor an alternating series\n\n\\[\\sum_{n=1}^{\\infty}(-1)^{n-1}b_n,\\]\n\nthe alternating-series test guarantees convergence if \\(b_n\\ge0\\), \\(b_n\\) is eventually nonincreasing, and \\(b_n\\to0\\). This establishes convergence, not necessarily absolute convergence. (openstax.org)"
    },
    {
      "heading": "Series of functions",
      "text": "When the terms are functions, a series takes the form \\(\\sum f_n(x)\\). Pointwise convergence means that the numerical series converges separately at each point. Uniform convergence requires the partial sums to approach their limiting function with an error bound that works simultaneously throughout the specified domain. The Weierstrass \\(M\\)-test guarantees uniform convergence if \\(|f_n(x)|\\le M_n\\) everywhere and \\(\\sum M_n\\) converges. (dlmf.nist.gov)\n\nA power series has the form\n\n\\[\\sum_{n=0}^{\\infty}c_n(x-a)^n.\\]\n\nIt has a radius of convergence \\(R\\), possibly zero or infinite: it converges absolutely for \\(|x-a|<R\\) and diverges for \\(|x-a|>R\\). Boundary points require separate analysis. (openstax.org)\n\nA Taylor series uses coefficients determined by the derivatives of a function:\n\n\\[\\sum_{n=0}^{\\infty}\\frac{f^{(n)}(a)}{n!}(x-a)^n.\\]\n\nAt \\(a=0\\), it is called a Maclaurin series. For example, the exponential function has the representation\n\n\\[e^x=\\sum_{n=0}^{\\infty}\\frac{x^n}{n!}.\\]\n\nHaving derivatives of every order does not by itself guarantee that a function equals its Taylor series; equality requires the Taylor remainder to tend to zero. (openstax.org)\n\nFourier series instead expand functions using sinusoidal or complex exponential terms. Their convergence can depend on the point and on the type of convergence considered. Near jump discontinuities, partial sums can exhibit persistent overshoot, known as the Gibbs phenomenon. (dlmf.nist.gov)"
    },
    {
      "heading": "Approximation and error bounds",
      "text": "For a convergent series with sum \\(S\\), truncation after \\(N\\) terms gives an approximation \\(S_N\\), with remainder\n\n\\[R_N=S-S_N.\\]\n\nConvergence ensures \\(R_N\\to0\\), but a useful computation also needs information about its size. Under the alternating-series test hypotheses,\n\n\\[|R_N|\\le b_{N+1}.\\]\n\nThus the first omitted term bounds the truncation error. (openstax.org)\n\nFor a positive decreasing function satisfying \\(a_n=f(n)\\), the integral-test remainder estimate is\n\n\\[\\int_{N+1}^{\\infty}f(x)\\,dx \\le R_N \\le \\int_N^{\\infty}f(x)\\,dx.\\]\n\nFor example, applying these bounds to \\(\\sum n^{-2}\\) places its remainder between \\(1/(N+1)\\) and \\(1/N\\). This illustrates why convergence alone does not imply rapid numerical approximation. (openstax.org)\n\nIn numerical analysis, convergence acceleration transforms partial sums into a new sequence intended to approach the same limit faster. A limit-preserving transformation must retain the original limit whenever the stipulated convergence conditions hold. (visiblecement.nist.gov)"
    },
    {
      "heading": "Divergent series and generalized summation",
      "text": "A divergent series has no ordinary finite sum, but a specified summability method may assign it a generalized value. Such methods must be distinguished from convergence of partial sums. A method is called regular if it agrees with ordinary summation for every convergent series to which it applies. (dlmf.nist.gov)\n\nFor example, Cesàro summation considers the arithmetic means of partial sums. For\n\n\\[1-1+1-1+\\cdots,\\]\n\nthe partial sums alternate between \\(1\\) and \\(0\\), so the series diverges ordinarily. Their arithmetic means tend to \\(1/2\\), giving a Cesàro value of \\(1/2\\). This does not make the original partial sums convergent. (dlmf.nist.gov)\n\nAn asymptotic expansion is another distinct use of series notation. Its purpose is to describe approximation as a parameter approaches a specified limit; an infinite expansion need not converge when that parameter is fixed. Finite truncations can nevertheless provide useful approximations. (dlmf.nist.gov)"
    },
    {
      "heading": "Historical development",
      "text": "A major development in the theory was the systematic separation of convergent series from formal manipulations of divergent expressions. In his Cours d’analyse of 1821, Augustin-Louis Cauchy gave definitions of convergence and absolute convergence and developed criteria based on limits and the behavior of tails. His work helped establish the rigorous framework in which the validity of an infinite operation must be proved rather than inferred from corresponding finite algebraic operations. (mathshistory.st-andrews.ac.uk)"
    }
  ],
  "links": [
    "limit",
    "calculus",
    "mathematical-analysis",
    "real-number",
    "complex-number",
    "cauchy-sequence",
    "geometric-series",
    "harmonic-series",
    "p-series",
    "riemann-zeta-function",
    "telescoping-series",
    "absolute-and-conditional-convergence",
    "integral",
    "alternating-series",
    "mathematical-function",
    "pointwise-convergence",
    "uniform-convergence",
    "power-series",
    "taylor-series",
    "derivative",
    "exponential-function",
    "fourier-series",
    "numerical-analysis",
    "asymptotic-expansion",
    "augustin-louis-cauchy"
  ],
  "sources": [
    {
      "title": "2 Infinite Series — Calculus Volume 2",
      "url": "https://openstax.org/books/calculus-volume-2/pages/5-2-infinite-series"
    },
    {
      "title": "Ch. 5 Introduction — Calculus Volume 2",
      "url": "https://openstax.org/books/calculus-volume-2/pages/5-introduction"
    },
    {
      "title": "Ch. 5 Key Concepts — Calculus Volume 2",
      "url": "https://openstax.org/books/calculus-volume-2/pages/5-key-concepts"
    },
    {
      "title": "Ch. 5 Key Terms — Calculus Volume 2",
      "url": "https://openstax.org/books/calculus-volume-2/pages/5-key-terms"
    },
    {
      "title": "3 The Divergence and Integral Tests — Calculus Volume 2",
      "url": "https://openstax.org/books/calculus-volume-2/pages/5-3-the-divergence-and-integral-tests"
    },
    {
      "title": "4 Comparison Tests — Calculus Volume 2",
      "url": "https://openstax.org/books/calculus-volume-2/pages/5-4-comparison-tests"
    },
    {
      "title": "5 Alternating Series — Calculus Volume 2",
      "url": "https://openstax.org/books/calculus-volume-2/pages/5-5-alternating-series"
    },
    {
      "title": "6 Ratio and Root Tests — Calculus Volume 2",
      "url": "https://openstax.org/books/calculus-volume-2/pages/5-6-ratio-and-root-tests"
    },
    {
      "title": "1 Power Series and Functions — Calculus Volume 2",
      "url": "https://openstax.org/books/calculus-volume-2/pages/6-1-power-series-and-functions"
    },
    {
      "title": "3 Taylor and Maclaurin Series — Calculus Volume 2",
      "url": "https://openstax.org/books/calculus-volume-2/pages/6-3-taylor-and-maclaurin-series"
    },
    {
      "title": "DLMF §1.9 Calculus of a Complex Variable",
      "url": "https://dlmf.nist.gov/1.9"
    },
    {
      "title": "DLMF §25.2 Definition and Expansions",
      "url": "https://dlmf.nist.gov/25.2"
    }
  ],
  "license": "https://creativecommons.org/licenses/by/4.0/"
}