{
  "id": "telescoping-series",
  "title": "Telescoping Series",
  "lang": "en",
  "source_lang": "en",
  "summary": "A telescoping series is a series whose partial sums simplify through cancellation, leaving boundary terms that determine its sum and convergence.",
  "category": "mathematics",
  "subcategory": "analysis",
  "type": "concept",
  "aliases": [
    "Telescopic series"
  ],
  "generated_at": "2026-11-05",
  "model": "pro/gpt-6.1-sol",
  "url": "https://aiwiki.page/en/telescoping-series/",
  "translations": {
    "zh-Hans": {
      "url": "https://aiwiki.page/zh/telescoping-series/",
      "json": "https://aiwiki.page/zh/telescoping-series.json"
    }
  },
  "sections": [
    {
      "heading": "",
      "text": "A telescoping series is an infinite series whose partial sums simplify because most terms cancel when the summands are written as differences. In the standard form\n\n\\[\\sum_{n=1}^{\\infty}(b_n-b_{n+1}),\\]\n\nthe first \\(N\\) terms sum to \\(b_1-b_{N+1}\\). The convergence and value of the series therefore depend on the limit of the sequence \\((b_n)\\). The name refers to the way an extended expression collapses like the sliding sections of a telescope."
    },
    {
      "heading": "Basic identity and convergence",
      "text": "For any sequence \\(b_n\\) of real numbers or complex numbers, and integers \\(m\\leq N\\),\n\n\\[\\sum_{n=m}^{N}(b_n-b_{n+1}) = (b_m-b_{m+1})+(b_{m+1}-b_{m+2}) +\\cdots+(b_N-b_{N+1}) = b_m-b_{N+1}.\\]\n\nEvery interior term occurs once with a positive sign and once with a negative sign. Only the boundary terms remain.\n\nThis is a finite algebraic identity: it requires no convergence assumptions. For the corresponding infinite series, its partial sums satisfy\n\n\\[S_N=b_m-b_{N+1}.\\]\n\nConsequently,\n\n\\[\\sum_{n=m}^{\\infty}(b_n-b_{n+1})\\]\n\nconverges if and only if \\(b_n\\) has a finite limit \\(L\\), in which case\n\n\\[\\sum_{n=m}^{\\infty}(b_n-b_{n+1})=b_m-L.\\]\n\nThe same identity gives an exact expression for the remainder after summing through index \\(N\\):\n\n\\[R_N = \\sum_{n=N+1}^{\\infty}(b_n-b_{n+1}) = b_{N+1}-L.\\]\n\nThus, a bound on \\(|b_{N+1}-L|\\) is immediately a bound on the truncation error.\n\nThe reversed convention is equally common:\n\n\\[\\sum_{n=m}^{N}(b_{n+1}-b_n)=b_{N+1}-b_m.\\]"
    },
    {
      "heading": "Recognizing telescoping structure",
      "text": "The cancellation is not always apparent in the original summand. Common ways to reveal it include partial fraction decomposition, rationalization of expressions involving square roots, logarithm identities, and identities derived from a recurrence relation.\n\nRational summands\n\nThe elementary decomposition\n\n\\[\\frac{1}{n(n+1)}=\\frac1n-\\frac1{n+1}\\]\n\ngives\n\n\\[\\sum_{n=1}^{N}\\frac{1}{n(n+1)} =1-\\frac{1}{N+1}.\\]\n\nSince \\(1/(N+1)\\to0\\),\n\n\\[\\sum_{n=1}^{\\infty}\\frac{1}{n(n+1)}=1.\\]\n\nThe exact remainder is \\(1/(N+1)\\).\n\nCancellation can also take place across more than one index. For a positive integer \\(k\\),\n\n\\[\\frac{1}{n(n+k)} =\\frac1k\\left(\\frac1n-\\frac1{n+k}\\right),\\]\n\nand hence\n\n\\[\\sum_{n=1}^{N}\\frac{1}{n(n+k)} = \\frac1k\\left( \\sum_{j=1}^{k}\\frac1j - \\sum_{j=N+1}^{N+k}\\frac1j \\right).\\]\n\nTaking the limit yields\n\n\\[\\sum_{n=1}^{\\infty}\\frac{1}{n(n+k)} = \\frac1k\\sum_{j=1}^{k}\\frac1j.\\]\n\nLogarithmic summands\n\nUsing the natural logarithm,\n\n\\[\\log\\left(1+\\frac1n\\right) =\\log(n+1)-\\log n.\\]\n\nTherefore,\n\n\\[\\sum_{n=1}^{N}\\log\\left(1+\\frac1n\\right) =\\log(N+1).\\]\n\nThe partial sums tend to \\(+\\infty\\), so this telescoping series diverges. Telescoping is a method of simplifying partial sums, not a guarantee of convergence.\n\nRationalization\n\nThe identity\n\n\\[\\frac{1}{\\sqrt{n+1}+\\sqrt n} =\\sqrt{n+1}-\\sqrt n\\]\n\nproduces\n\n\\[\\sum_{n=1}^{N} \\frac{1}{\\sqrt{n+1}+\\sqrt n} =\\sqrt{N+1}-1.\\]\n\nThis series also diverges, even though its individual terms tend to zero."
    },
    {
      "heading": "Shifted and weighted cancellation",
      "text": "More generally, for a fixed positive integer \\(k\\),\n\n\\[\\sum_{n=m}^{N}(b_n-b_{n+k}) = \\sum_{j=m}^{m+k-1}b_j - \\sum_{j=N+1}^{N+k}b_j.\\]\n\nThe boundary consists of two blocks of \\(k\\) terms. If \\(b_n\\to L\\), then\n\n\\[\\sum_{n=m}^{\\infty}(b_n-b_{n+k}) = \\sum_{j=m}^{m+k-1}b_j-kL.\\]\n\nUnlike the adjacent-difference case, convergence of this shifted series need not imply convergence of \\(b_n\\). For example, a nonconstant \\(k\\)-periodic sequence satisfies \\(b_n-b_{n+k}=0\\) for every \\(n\\).\n\nA related identity underlies the geometric series. For \\(r\\ne1\\),\n\n\\[r^n=\\frac{r^n-r^{n+1}}{1-r},\\]\n\nso\n\n\\[\\sum_{n=0}^{N}r^n = \\frac{1-r^{N+1}}{1-r}.\\]\n\nFor \\(|r|<1\\), the remaining boundary term tends to zero, giving the sum \\(1/(1-r)\\)."
    },
    {
      "heading": "Relation to discrete calculus",
      "text": "Define the forward difference of a sequence by\n\n\\[\\Delta b_n=b_{n+1}-b_n.\\]\n\nThe telescoping identity becomes\n\n\\[\\sum_{n=m}^{N}\\Delta b_n=b_{N+1}-b_m.\\]\n\nThis is the discrete counterpart of the fundamental theorem of calculus:\n\n\\[\\int_a^b F'(x)\\,dx=F(b)-F(a).\\]\n\nIn each case, accumulating local changes yields the net change between endpoints.\n\nFinding a sequence \\(b_n\\) such that\n\n\\[a_n=b_{n+1}-b_n\\]\n\nis therefore analogous to finding an antiderivative. For example,\n\n\\[n^2 = \\frac{(n+1)n(2n+1)}6 - \\frac{n(n-1)(2n-1)}6,\\]\n\nso telescoping gives\n\n\\[\\sum_{n=1}^{N}n^2 =\\frac{N(N+1)(2N+1)}6.\\]\n\nEvery sequence admits a formal representation as a difference: define\n\n\\[b_1=0,\\qquad b_{n+1}=b_n+a_n.\\]\n\nThen \\(a_n=b_{n+1}-b_n\\). In practice, however, a series is called telescoping when the difference representation makes its partial sums meaningfully simpler, rather than merely expressing them in new notation."
    },
    {
      "heading": "Applications and limitations",
      "text": "Telescoping identities are used to evaluate sums, establish error bounds, solve difference equations, and prove convergence estimates in numerical analysis and mathematical optimization. For example, if nonnegative quantities \\(e_n\\) and a sequence \\(V_n\\) satisfy\n\n\\[e_n\\leq V_n-V_{n+1}, \\qquad V_n\\geq B,\\]\n\nthen\n\n\\[\\sum_{n=1}^{N}e_n \\leq V_1-V_{N+1} \\leq V_1-B.\\]\n\nThe partial sums of \\(\\sum e_n\\) are nondecreasing and bounded, so the series converges and \\(e_n\\to0\\).\n\nSeveral distinctions are important:\n\n- Cancellation must be performed on finite partial sums first. Writing\n\n\\[\\sum_{n=1}^{\\infty}b_n-\\sum_{n=1}^{\\infty}b_{n+1}\\]\n\nis not a valid substitute if the two separate series diverge.\n- A convergent boundary sequence does not imply absolute convergence. For example, let\n\n\\[b_n=\\frac{(-1)^n}{n}.\\]\n\nThen \\(b_n\\to0\\), so \\(\\sum(b_n-b_{n+1})=-1\\), but\n\n\\[|b_n-b_{n+1}|=\\frac1n+\\frac1{n+1},\\]\n\nwhose series diverges.\n- A vanishing summand is not sufficient for convergence. The square-root example above has terms tending to zero but unbounded partial sums.\n- Exact cancellation and numerical computation differ. In floating-point arithmetic, subtracting nearly equal quantities can lose relative accuracy. A telescoping identity may permit a more accurate endpoint calculation, but the numerical stability of the particular formulas still matters."
    }
  ],
  "links": [
    "infinite-series",
    "limit",
    "real-number",
    "complex-number",
    "recurrence-relation",
    "natural-logarithm",
    "geometric-series",
    "fundamental-theorem-of-calculus",
    "antiderivative",
    "numerical-analysis",
    "mathematical-optimization",
    "floating-point-arithmetic",
    "numerical-stability"
  ],
  "sources": [],
  "license": "https://creativecommons.org/licenses/by/4.0/"
}