Taylor series

From testwiki
Jump to navigation Jump to search

Template:Short description Template:Good article

As the degree of the Taylor polynomial rises, it approaches the correct function. This image shows Template:Math and its Taylor approximations by polynomials of degree 1, 3, 5, 7, 9, 11, and 13 at Template:Math.

In mathematical analysis, the Taylor series or Taylor expansion of a function is an infinite sum of terms that are expressed in terms of the function's derivatives at a single point. For most common functions, the function and the sum of its Taylor series are equal near this point. Taylor series are named after Brook Taylor, who introduced them in 1715. A Taylor series is also called a Maclaurin series when Template:Math is the point where the derivatives are considered, after Colin Maclaurin, who made extensive use of this special case of Taylor series in the 18th century.

The partial sum formed by the first Template:Math terms of a Taylor series is a polynomial of degree Template:Mvar that is called the Template:Mvarth Taylor polynomial of the function. Taylor polynomials are approximations of a function, which become generally more accurate as Template:Mvar increases. Taylor's theorem gives quantitative estimates on the error introduced by the use of such approximations. If the Taylor series of a function is convergent, its sum is the limit of the infinite sequence of the Taylor polynomials. A function may differ from the sum of its Taylor series, even if its Taylor series is convergent. A function is analytic at a point Template:Mvar if it is equal to the sum of its Taylor series in some open interval (or open disk in the complex plane) containing Template:Mvar. This implies that the function is analytic at every point of the interval (or disk).

Definition

The Taylor series of a real or complex-valued function Template:Math, that is infinitely differentiable at a real or complex number Template:Math, is the power series f(a)+f′(a)1!(x−a)+f″(a)2!(x−a)2+⋯=∑n=0∞f(n)(a)n!(x−a)n. Here, Template:Math denotes the factorial of Template:Mvar. The function Template:Math denotes the Template:Mvarth derivative of Template:Math evaluated at the point Template:Mvar. The derivative of order zero of Template:Math is defined to be Template:Math itself and Template:Math and Template:Math [[empty product|are both defined to be Template:Math]]. This series can be written by using sigma notation, as in the right side formula.Template:Sfn The corresponding Taylor polynomial of degree Template:Mvar is Tn(x)=∑k=0nf(k)(a)k!(x−a)k. Template:AnchorWith Template:Math, the Maclaurin series takes the form:Template:Sfn f(0)+f′(0)1!x+f″(0)2!x2+⋯=∑n=0∞f(n)(0)n!xn.

Basic properties

Script error: No such module "sidebar". Taylor series inherit the basic properties of power series. Taylor series can also be combined algebraically. Sums, differences, products, and scalar multiples of Taylor series are obtained by the corresponding operations on power series. In particular, the Taylor series of f(x)g(x) around a point x=a is the Cauchy product of the Taylor series of f(x) and g(x) about x=a.Template:Sfn Compositions of functions having Taylor series likewise have Taylor series, obtained by substituting one convergent power series into another when the substitution is valid.Template:Sfn

A Taylor series may be differentiated and integrated term by term. Thus ddx∑n=0∞cn(x−a)n=∑n=1∞ncn(x−a)n−1, and ∫∑n=0∞cn(x−a)ndx=C+∑n=0∞cnn+1(x−a)n+1. The differentiated and integrated series have the same radius of convergence as the original power series, although the convergence behavior at the boundary may be different.Template:SfnTemplate:Sfn

These properties sometimes allow the Taylor series of functions, such as the arctangent, to be computed in terms of simpler series, such as the geometric series.Template:Sfn

Calculation of Taylor series

Several methods can be used to calculate Taylor series. One may apply the definition directly, although this often requires first identifying a general formula for the derivatives or coefficients.Template:Sfn In many cases, Taylor series can also be obtained from known expansions by algebraic manipulations of power series, such as substitution, multiplication, division, addition, or subtraction, as well as termwise differentiation and integration of known Taylor series.Template:Sfn In some cases, they may also be derived by repeated integration by parts. In practice, Taylor series are often computed with the aid of computer algebra systems.[1]Template:Sfn

A number of standard Maclaurin series are frequently used as starting points for calculating other Taylor series. Some fundamental examples are listed below; a more comprehensive listing appears later in the article.

Common Maclaurin series
Function Maclaurin series Convergence
ex ∑n=0∞xnn!=1+x+x22!+x33!+⋯ All x
sin⁡x ∑n=0∞(−1)nx2n+1(2n+1)!=x−x33!+x55!−⋯ All x
cos⁡x ∑n=0∞(−1)nx2n(2n)!=1−x22!+x44!−⋯ All x
11−x ∑n=0∞xn=1+x+x2+x3+⋯ |x|<1

Examples

Term-by-term differentiation

Inside the region of convergence, a Taylor series can be differentiated term-by-term. For example, differentiating the geometric series 11−x=1+x+x2+x3+⋯,|x|<1, one gets ddx11−x=1(1−x)2=0+1+2x+3x2+⋯,|x|<1. Thus 1(1−x)2=∑n=1∞nxn−1,|x|<1. This process can be iterated, giving 1(1−x)3=∑n=2∞n(n−1)xn−2,|x|<1. 1(1−x)4=∑n=3∞n(n−1)(n−2)xn−3,|x|<1. and so forth.Template:Sfn

Term-by-term integration

Inside the region of convergence, a Taylor series can be integrated term-by-term. For example, integrating the geometric series 11−t=1+t+t2+t3+⋯,|t|<1, one gets −log⁡(1−x)=∫0xdt1−t=x+x22+x33+x44+⋯,|x|<1. This gives the Maclaurin seriesTemplate:Sfn log⁡(1−x)=−∑n=1∞xnn, valid for |x|<1.

Substitution

Taylor series can be composed, for example if the Taylor series of f(t) is known, then the Taylor series of f(xn) is obtained by evaluating at t=xn term by term. For instance, the geometric series 1/(1−t)=1+t+t2+⋯ evaluated at t=−x2 gives 11+x2=1−x2+x4−x6+⋯=∑n=0∞(−1)nx2n. This last series can be integrated term-by-term to giveTemplate:Sfn arctan⁡x=∫0xdt1+t2=∑n=0∞(−1)n2n+1x2n+1, for |x|<1.

Composition

In order to compute the 7th-degree Maclaurin polynomial for the function f(x)=ln⁡(cos⁡x),x∈(−π2,π2), one may first rewrite the function as f(x)=ln(1+(cos⁡x−1)), the composition of two functions Template:Math and Template:Math. The Taylor series for the natural logarithm is (using big O notation) ln⁡(1+x)=x−x22+x33+O(x4) and for the cosine function cos⁡x−1=−x22+x424−x6720+O(x8).

The first several terms from the second series can be substituted into each term of the first series. Because the first term in the second series has degree 2, three terms of the first series suffice to give a polynomial of degree 7:[2] f(x)=ln⁡(1+(cos⁡x−1))=(cos⁡x−1)−12(cos⁡x−1)2+13(cos⁡x−1)3+O((cos⁡x−1)4)=−x22−x412−x645+O(x8).

Since the cosine is an even function, the coefficients for all the odd powers are zero.

Division

Given that the Taylor series at Template:Math of the function Template:Math. The Taylor series for the exponential function is ex=1+x+x22!+x33!+x44!+⋯, and the series for cosine is cos⁡x=1−x22!+x44!−⋯.

Assume the series for their quotient is excos⁡x=c0+c1x+c2x2+c3x3+c4x4+⋯ Multiplying both sides by the denominator Template:Math and then expanding it as a series yields ex=(c0+c1x+c2x2+c3x3+c4x4+⋯)(1−x22!+x44!−⋯)=c0+c1x+(c2−c02!)x2+(c3−c12!)x3+(c4−c22!+c04!)x4+⋯

Comparing the coefficients of Template:Math with the coefficients of Template:Math, c0=1,  c1=1,  c2−12c0=12,  c3−12c1=16,  c4−12c2+124c0=124, ….

The coefficients Template:Math of the series for Template:Math can thus be computed one at a time, amounting to long division of the series for Template:Math and Template:Math: excos⁡x=1+x+x2+23x3+12x4+⋯.

Non-elementary integrals

Term-by-term integration of Taylor series can be used to find the Taylor series of non-elementary integrals. For example, the Fresnel integral is S(x)=∫0xsin⁡(t2)dt and S(x) cannot be expressed in terms of elementary functions. Its Maclaurin series can be determined by termwise integration of the series sin⁡(t2)=∑n=0∞(−1)n(2n+1)!t4n+2, givingTemplate:Sfn S(x)=∑n=0∞(−1)n(4n+3)(2n+1)!x4n+3.

Differential equations

Template:See also

Taylor series can also be used to solve some ordinary differential equations. The method is to assume that the solution has a power series expansion, differentiate the series term by term, substitute the resulting series into the differential equation, and then determine the coefficients by equating like powers of the variable.[3]

For example, to solve y″−y=0, suppose that y=∑n=0∞anxn. Then y″=∑n=2∞n(n−1)anxn−2=∑n=0∞(n+2)(n+1)an+2xn. Substitution into the differential equation gives ∑n=0∞((n+2)(n+1)an+2−an)xn=0. Since power series expansions are unique, each coefficient must vanish, so an+2=an(n+2)(n+1). The even and odd coefficients are therefore determined separately by the arbitrary constants a0 and a1: y=a0(1+x22!+x44!+⋯)+a1(x+x33!+x55!+⋯). Thus y=a0cosh⁡x+a1sinh⁡x, or equivalently y=C1ex+C2e−x.

Approximation error and Taylor's theorem

Template:Main Template:Multiple image

The error incurred in approximating a function by its degree Template:Mvar Taylor polynomial is called the remainder and is denoted by the function Template:Math. Taylor's theorem can be used to obtain a bound on the size of the remainder.Template:Sfn

In particular, Taylor's theorem writes a function, where the hypotheses of the theorem are satisfied, in the form f(x)=∑k=0nf(k)(a)k!(x−a)k+Rn(x). The behavior of the remainder as Template:Mvar tends to infinity determines whether the Taylor series represents the original function, which are questions of convergence and analyticity.

Generalization in finite differences

One form of the Gregory–Newton interpolation formula can be written as f(x)=∑k=0∞Δk[f](a)k!(x−a)k which interpolates a polynomial f in terms of its finite differences evaluated at a single point a, and where (x−a)k is the falling factorial. For a polynomial, this series terminates and gives the polynomial exactly; more generally, a function admits a Gregory–Newton development under suitable analytic hypotheses, classically formulated by Niels Erik Nørlund in terms of holomorphy in a half-plane together with an exponential type growth condition.[4][5]Template:Sfn

One generalization of the Taylor series that does converge to the value of the function itself for any bounded continuous function on Template:Math, and this can be done by using the calculus of finite differences. Specifically, the following theorem, due to Einar Hille, that for any Template:Math,[6] limh→0+∑n=0∞tnn!Δhnf(a)hn=f(a+t). Here Template:Math is the Template:Mvarth finite difference operator with step size Template:Mvar. The series is precisely the Taylor series, except that divided differences appear in place of differentiation. When the function Template:Math is analytic at Template:Mvar, the terms in the series converge to the terms of the Taylor series, and in this sense generalizes the usual Taylor series.

In general, for any infinite sequence Template:Math, the following power series identity holds:Template:Sfn ∑n=0∞unn!Δnai=e−u∑j=0∞ujj!ai+j. So in particular,Template:Sfn f(a+t)=limh→0+e−t/h∑j=0∞f(a+jh)(t/h)jj!.

The series on the right is the expected value of Template:Math, where Template:Mvar is a Poisson-distributed random variable that takes the value Template:Math with probability Template:Math. Hence,[7] f(a+t)=limh→0+∫−∞∞f(a+x)dPt/h,h(x).

The law of large numbers implies that the identity holds.Template:Sfn

Convergence and analyticity

Template:Main

A Taylor series is formed from the values of all derivatives of a function at a single point, but this does not by itself imply that the series converges to the function. In general, a Taylor series may fail to converge, or it may converge to a function different from the original one.

For example, the function f(x)={e−1/x2if x≠0,0if x=0 is infinitely differentiable at x=0, and all of its derivatives at 0 are equal to zero. Its Taylor series at 0 is therefore the zero series, even though the function itself is not identically zero. This gives a standard example of a non-analytic smooth function.Template:Sfn

The function Template:Math is not analytic at Template:Math: the Taylor series is identically Template:Math, although the function is not.

More generally, the Taylor series of a function represents the function at a point x precisely when the remainder terms in Taylor's theorem tend to zero at that point. If f(x)=∑k=0nf(k)(a)k!(x−a)k+Rn(x), then the Taylor series converges to f(x) exactly when limn→∞Rn(x)=0.

A function is called analytic at a point if it is equal to the sum of its Taylor series in some open interval around that point, or, in the complex case, in some open disk. Equivalently, a function is analytic in a region if it is locally given by a convergent power series. Thus, if f(x)=∑n=0∞an(x−b)n near b, then differentiating the series term by term and setting x=b gives an=f(n)(b)n!. Thus the power series expansion of an analytic function is its Taylor series.Template:SfnTemplate:Sfn

In real analysis, infinite differentiability does not imply analyticity, as the example above shows. Borel's lemma implies that every power series is the Taylor series of some smooth function. In complex analysis, however, every holomorphic function is analytic.Template:Sfn A function whose Taylor series converges to the function throughout the whole complex plane is called an entire function. Polynomials, the exponential function, and the sine and cosine functions are entire functions.Template:Sfn

Radius of convergence

For any power series ∑n=0∞cn(x−a)n, there is a number R, called the radius of convergence, such that the series converges absolutely for |x−a|<R and diverges for |x−a|>R.Template:SfnTemplate:Sfn The radius may be zero, finite and positive, or infinite. It is given by the Cauchy–Hadamard formula 1R=lim supn→∞|cn|1/n, with the usual conventions for R=0 and R=∞. When the limit exists, the ratio test often gives R=limn→∞|cncn+1|.

Thus, when a Taylor series converges, it does so in an open interval centered at a in the real case, or in an open disk centered at a in the complex case. The behavior at the boundary points may vary: the series may converge at some, all, or none of them.Template:Sfn

For a complex analytic function, the radius of convergence of the Taylor series at a is the distance from a to the nearest point where the function cannot be continued holomorphically. In many common examples this is the distance to the nearest singularity in the complex plane.Template:Sfn

This explains the different radii of convergence for familiar Taylor series. The series for ex, sin⁡x, and cos⁡x have infinite radius of convergence because these functions are entire. By contrast, the Taylor series for log⁡(1+x) at x=0 has radius of convergence 1, because the nearest singularity is at x=−1.Template:Sfn

Complex singularities can determine the radius of convergence even for functions that are smooth on the real line. For example, 11+x2 is smooth for every real x, but its Taylor series at 0 has radius of convergence 1, because the corresponding complex function has singularities at x=i and x=−i.Template:Sfn

The radius of convergence should not be confused with the quality of approximation by a low-degree Taylor polynomial. A Taylor polynomial may approximate a function accurately near the center even if the full Taylor series has a small radius of convergence. Conversely, near the boundary of the interval or disk of convergence, the Taylor series may converge slowly. Outside the radius of convergence, the Taylor series does not represent the function.Template:SfnTemplate:Sfn

Generalizations near singularities

Template:Main

A Taylor series cannot be centered at a point where the function is not analytic. Some singularities, namely poles, can be accounted for by a Laurent series. If f has a pole of order k at z=a, then near a it has a Laurent series of the form ∑n=−k∞an(z−a)n. A meromorphic function is a function which is analytic except at isolated poles; near each pole it has a Laurent series with only finitely many negative-power terms.Template:Sfn

More generally, a function analytic in an annulus r<|z−a|<R has a convergent Laurent series of the form ∑n=−∞∞an(z−a)n in that annulus.Template:Sfn

Other types of singularities, namely branch points, can occur for algebraic functions. If f(z) is an algebraic function of a complex variable z and z=a is a branch point, then f(z) need not have a Taylor series based at z=a. However, after a change of variables z−a=te, where e is a positive integer called the ramification index, a branch of the function becomes analytic as a function of t. The resulting expansion in fractional powers of z−a is known as a Puiseux series.Template:Sfn

Taylor series in multiple variables

The Taylor series may also be generalized to functions of more than one variable with[8] T(x1,…,xd)=∑n1=0∞⋯∑nd=0∞(x1−a1)n1⋯(xd−ad)ndn1!⋯nd!(∂n1+⋯+ndf∂x1n1⋯∂xdnd)(a1,…,ad)=f(a1,…,ad)+∑j=1d∂f(a1,…,ad)∂xj(xj−aj)+12!∑j=1d∑k=1d∂2f(a1,…,ad)∂xj∂xk(xj−aj)(xk−ak)+13!∑j=1d∑k=1d∑l=1d∂3f(a1,…,ad)∂xj∂xk∂xl(xj−aj)(xk−ak)(xl−al)+⋯,=∑|α|≥0(𝐱−𝐚)αα!(∂αf)(𝐚). The last expression is the multivariate Taylor series in terms of multi-index notation with a full analogy to the single variable case.

For example, for a function Template:Math that depends on two variables, Template:Mvar and Template:Mvar, the Taylor series to second order about the point Template:Math is f(a,b)+(x−a)fx(a,b)+(y−b)fy(a,b)+12!((x−a)2fxx(a,b)+2(x−a)(y−b)fxy(a,b)+(y−b)2fyy(a,b)) where the subscripts denote the respective partial derivatives.

Second-order Taylor series in several variables

Template:See also

A second-order Taylor series expansion of a scalar-valued function of more than one variable can be written compactly as T(𝐱)=f(𝐚)+(𝐱−𝐚)𝖳Df(𝐚)+12!(𝐱−𝐚)𝖳{D2f(𝐚)}(𝐱−𝐚)+⋯, where Template:Math is the gradient of Template:Math evaluated at Template:Math and Template:Math is the Hessian matrix.

Example

Second-order Taylor series approximation (in orange) of a function Template:Math around the origin.

In order to compute a second-order Taylor series expansion around the point Template:Math of the function f(x,y)=exln⁡(1+y), one first computes all the necessary partial derivatives: fx=exln⁡(1+y),fy=ex1+y,fxx=exln⁡(1+y),fyy=−ex(1+y)2,fxy=fyx=ex1+y.

Evaluating these derivatives at the origin gives the Taylor coefficients fx(0,0)=0,fy(0,0)=1,fxx(0,0)=0,fyy(0,0)=−1,fxy(0,0)=1.

Substituting these values in to the general formula T(x,y)=f(a,b)+(x−a)fx(a,b)+(y−b)fy(a,b)+12!((x−a)2fxx(a,b)+2(x−a)(y−b)fxy(a,b)+(y−b)2fyy(a,b))+⋯ produces T(x,y)=0+0(x−0)+1(y−0)+12(0(x−0)2+2(x−0)(y−0)+(−1)(y−0)2)+⋯=y+xy−12y2+⋯

Since Template:Math is analytic in Template:Math, we have exln⁡(1+y)=y+xy−12y2+⋯,|y|<1.

Applications

Taylor polynomials are used to approximate functions near a point. Keeping only the first nonzero terms often gives a simpler model of a more complicated expression. For example, the small-angle approximation sin⁡x≈x comes from the first term of the Taylor series for sine, and higher-order approximations are obtained by retaining more terms. This approximation is widely used: for example, in Gaussian optics where the behavior of light rays making small angles with an axis is studied by replacing the sine function with its linear approximation.

Such approximations are used throughout mathematics, physics, and engineering. In perturbation theory, a complicated quantity is often expanded in powers of a small parameter, and the first few terms are used as an approximate solution. Taylor expansions also occur in the analysis of the simple pendulum and in numerical methods for approximating functions.Template:Sfn[9]

History

The ancient Greek philosopher Zeno of Elea considered the problem of summing an infinite series to achieve a finite result, but rejected it as an impossibility; the result was Zeno's paradox.Template:Sfn Later, Aristotle proposed a philosophical resolution of the paradox, but the mathematical content was apparently unresolved until taken up by Archimedes, as it had been prior to Aristotle by the Presocratic Atomist Democritus. It was through Archimedes's method of exhaustion that an infinite number of progressive subdivisions could be performed to achieve a finite result.Template:Sfn Liu Hui independently employed a similar method a few centuries later.Template:Sfn

In the 14th century, the earliest examples of specific Taylor series (but not the general method) were given by the Indian mathematician Madhava of Sangamagrama.Template:Sfn Though no record of his work survives, writings of his followers in the Kerala school of astronomy and mathematics suggest that he found the Taylor series for the trigonometric functions of sine, cosine, and arctangent; see Madhava series. During the following two centuries, his followers developed further series expansions and rational approximations.Template:Sfn

In late 1670, James Gregory was shown in a letter from John Collins several Maclaurin series (Template:Math, Template:Math, Template:Math, and Template:Math) derived by Isaac Newton, and told that Newton had developed a general method for expanding functions in series. Newton had in fact used a cumbersome method involving long division of series and term-by-term integration, but Gregory did not know it and set out to discover a general method for himself. In early 1671 Gregory discovered something like the general Maclaurin series and sent a letter to Collins including series for Template:Math, Template:Math, Template:Math, Template:Math (the integral of Template:Math), Template:Math (the [[integral of the secant function|integral of Template:Math]], the inverse Gudermannian function), Template:Math, and Template:Math (the Gudermannian function). However, thinking that he had merely redeveloped a method by Newton, Gregory never described how he obtained these series, and it can only be inferred that he understood the general method by examining scratch work he had scribbled on the back of another letter from 1671.[10]

In 1691–1692, Newton wrote down an explicit statement of the Taylor and Maclaurin series in an unpublished version of his work De Quadratura Curvarum. It was the earliest explicit formulation of the general Taylor series.[11] However, this work by Newton was never completed and the relevant sections were omitted from the portions published in 1704 under the title Tractatus de Quadratura Curvarum.Template:Sfn

It was not until 1715 that a general method for constructing these series for all functions for which they exist was finally published by Brook Taylor, after whom the series are now named.[12]

The Maclaurin series was named after Colin Maclaurin, a Scottish mathematician, who published a special case of the Taylor result in the mid-18th century.Template:Sfn

List of Maclaurin series of some common functions

Template:See also Several important Maclaurin series expansions follow. All these expansions are valid for complex arguments Template:Mvar. For multivalued complex functions, such as logarithms, fractional powers, and inverse trigonometric functions, a principal branch is understood.

Exponential function

The exponential function Template:Math (in blue), and the sum of the first Template:Math terms of its Taylor series at Template:Math (in red)

The exponential function Template:Math (with base [[e (mathematics)|Template:Mvar]]) has Maclaurin seriesTemplate:Sfn ex=∑n=0∞xnn!=1+x+x22!+x33!+⋯. It converges for all Template:Mvar.

The exponential generating function of the Bell numbers is the exponential function of the predecessor of the exponential function: exp⁡(exp⁡x−1)=∑n=0∞Bnn!xn

Natural logarithm

The natural logarithm (with base Template:Mvar) has Maclaurin series[13] ln⁡(1−x)=−∑n=1∞xnn=−x−x22−x33−⋯,ln⁡(1+x)=∑n=1∞(−1)n+1xnn=x−x22+x33−⋯.

The last series is known as Mercator series, named after Nicholas Mercator since it was published in his 1668 treatise Logarithmotechnia.Template:Sfn Both of these series converge for Template:Math. In addition, the series for Template:Math converges for Template:Math, and the series for Template:Math converges for Template:Math.[13]

Geometric series

The geometric series and its derivatives have Maclaurin series 11−x=∑n=0∞xn1(1−x)2=∑n=1∞nxn−11(1−x)3=∑n=2∞(n−1)n2xn−2.

All are convergent for Template:Math. These are special cases of the binomial series given in the next section.

Binomial series

The binomial series is the power series

(1+x)α=∑n=0∞(αn)xn

whose coefficients are the generalized binomial coefficientsTemplate:Sfn

(αn)=∏k=1nα−k+1k=α(α−1)⋯(α−n+1)n!.

(If Template:Math, this product is an empty product and has value Template:Math.) It converges for Template:Math for any real or complex number Template:Mvar.

When Template:Math, this is essentially the infinite geometric series mentioned in the previous section. The special cases Template:Math and Template:Math give the square root function and its inverse:Template:Sfn (1+x)12=1+12x−18x2+116x3−5128x4+7256x5−⋯=∑n=0∞(−1)n−1(2n)!4n(n!)2(2n−1)xn,(1+x)−12=1−12x+38x2−516x3+35128x4−63256x5+⋯=∑n=0∞(−1)n(2n)!4n(n!)2xn.

When only the linear term is retained, this simplifies to the binomial approximation.

Trigonometric functions

The usual trigonometric functions and their inverses have the following Maclaurin series:Template:Sfn sin⁡x=∑n=0∞(−1)n(2n+1)!x2n+1=x−x33!+x55!−⋯for all xcos⁡x=∑n=0∞(−1)n(2n)!x2n=1−x22!+x44!−⋯for all xtan⁡x=∑n=1∞B2n(−4)n(1−4n)(2n)!x2n−1=x+x33+2x515+⋯for |x|<π2sec⁡x=∑n=0∞(−1)nE2n(2n)!x2n=1+x22+5x424+⋯for |x|<π2arcsin⁡x=∑n=0∞(2n)!4n(n!)2(2n+1)x2n+1=x+x36+3x540+⋯for |x|≤1arccos⁡x=π2−arcsin⁡x=π2−x−x36−3x540−⋯for |x|≤1arctan⁡x=∑n=0∞(−1)n2n+1x2n+1=x−x33+x55−⋯for |x|≤1, x≠±i

All angles are expressed in radians. The numbers Template:Math appearing in the expansions of Template:Math are the Bernoulli numbers. The Template:Math in the expansion of Template:Math are Euler numbers.Template:Sfn

Hyperbolic functions

The hyperbolic functions have Maclaurin series closely related to the series for the corresponding trigonometric functions:Template:Sfn sinh⁡x=∑n=0∞x2n+1(2n+1)!=x+x33!+x55!+⋯for all xcosh⁡x=∑n=0∞x2n(2n)!=1+x22!+x44!+⋯for all xtanh⁡x=∑n=1∞B2n4n(4n−1)(2n)!x2n−1=x−x33+2x515−17x7315+⋯for |x|<π2arsinh⁡x=∑n=0∞(−1)n(2n)!4n(n!)2(2n+1)x2n+1=x−x36+3x540−⋯for |x|≤1artanh⁡x=∑n=0∞x2n+12n+1=x+x33+x55+⋯for |x|≤1, x≠±1

The numbers Template:Math appearing in the series for Template:Math are the Bernoulli numbers.Template:Sfn

Polylogarithmic functions

The polylogarithms have these defining identities: Li2(x)=∑n=1∞1n2xnLi3(x)=∑n=1∞1n3xn

The Legendre chi functions are defined as follows: χ2(x)=∑n=0∞1(2n+1)2x2n+1χ3(x)=∑n=0∞1(2n+1)3x2n+1

And the formulas presented below are called inverse tangent integrals: Ti2(x)=∑n=0∞(−1)n(2n+1)2x2n+1Ti3(x)=∑n=0∞(−1)n(2n+1)3x2n+1

These formulas occur in statistical mechanics. Integrals encountered in Bose–Einstein and Fermi–Dirac statistics can be expressed in terms of polylogarithms.[14] The inverse tangent integral value Ti2(1/3) appears in the per-site entropy of spanning trees on a large triangular lattice.[15]

Elliptic functions

The complete elliptic integrals of first kind K and of second kind E can be defined as follows: 2πK(x)=∑n=0∞[(2n)!]216n(n!)4x2n2πE(x)=∑n=0∞[(2n)!]2(1−2n)16n(n!)4x2n

The Jacobi theta functions describe the world of the elliptic modular functions and they have these Taylor series: ϑ00(x)=1+2∑n=1∞xn2ϑ01(x)=1+2∑n=1∞(−1)nxn2

See also

Template:Portal

Notes

Template:Reflist

References

Template:Refbegin

Template:Refend

Further reading

Template:Sister project links

Template:Series (mathematics) Template:Authority control