Telescoping (mathematics)

From testwiki
Jump to navigation Jump to search

Template:Short description Template:Other uses

The collapsing of a telescope, in which successive segments slide into one another and disappear within the structure so that only the outermost parts remain visible, analogously illustrates telescoping in mathematics, where consecutive terms in algebraic expressions cancel each other out after expansion, leaving only the boundary terms.

In mathematics, telescoping refers to a property of certain algebraic expressions or iterated binary operations in which successive terms cancel each other after expansion. As a result, the overall expression simplifies significantly, since most intermediate terms eliminate one another, leaving only a small number of boundary terms from the original structure.[1]

Most commonly, expressions of the form

f(n)=g(n+1)−g(n)

or

f(n)=g(n+1)g(n),g(n)≠0

are considered, where g is a function defined on the set of natural numbers.

Definition

Let A⊆ℤ and let f,g:A→ℝ.

We say that a function f has the telescoping property with respect to g if one of the following holds:

Additive case

f(n)=g(n+1)−g(n).

Then the sum

∑k=mnf(k)

is telescoping.[2]

Multiplicative case

If g(n)≠0, then

f(n)=g(n+1)g(n).

Then the product

∏k=mnf(k)

reduces telescopically.[3]

Relation to finite difference operator

Let Δ be the finite difference operator:

Δg(n)=g(n+1)−g(n).

Then in the additive case:

f(n)=Δg(n).

This is analogous to the Newton–Leibniz formula:

∑k=mnΔg(k)=g(n+1)−g(m).

Similarly for products:

∏k=mng(k+1)g(k)=g(n+1)g(m),g(k)≠0.

Examples

f(n)=1n(n+1)

Decomposition:

f(n)=1n−1n+1

so for g(n)=−1n we have

f(n)=g(n+1)−g(n).

Thus:

∑k=1n1k(k+1)=1−1n+1.[2]

Telescoping product

f(n)=n+1n

with g(n)=n, so

∏k=1nk+1k=n+1.[3]

Example with Fibonacci numbers

Let Fn be the Fibonacci sequence:

f(n)=Fn+1Fn.

Then:

∏k=1nFk+1Fk=Fn+1F1=Fn+1.[4]

References

Template:Reflist