﻿

# Asymptotic theory

Asymptotic theory is the branch of mathematics which studies properties of asymptotic expansions.

The most known result of this field is the prime number theorem:Let &pi;("x") be the number of prime numbers that are smaller than or equal to "x".The limit

:$lim_\left\{x ightarrowinfty\right\}frac\left\{pi\left(x\right)ln\left(x\right)\right\}\left\{x\right\}$

exists, and is equal to 1.

Some results often neglected include the probability distribution of the likelihood ratio statistic and the expected value of the deviance in statistics, results that are used daily by applied statisticians.

Asymptotic distribution

In mathematics and statistics, an asymptotic distribution is a hypothetical distribution that is in a sense the "limiting" distribution of a sequence of distributions. A distribution is an ordered set of random variables

:Zi

for "i" = 1 to "n" for some positive integer "n". An asymptotic distribution allows "i" to range without bound, that is, "n" is infinite.

A special case of an asymptotic distribution is when the late entries go to zero -- that is, the Zi go to 0 as i goes to infinity. Some instances of "asymptotic distribution" refer only to this special case.

This is based on the notion of an asymptotic function which cleanly approaches a constant value (the "asymptote") as the independent variable goes to infinity; "clean" in this sense meaning that for any desired closeness epsilon there is some value of the independent variable after which the function never differs from the constant by more than epsilon.

An asymptote is a straight line that a curve approaches but never meets or crosses. Informally, one may speak of the curve meeting the asymptote "at infinity" although this is not a precise definition. In the equation

:"y" = 1/"x",

"y" becomes arbitrarily small in magnitude as "x" increases.

It is often used in time series analysis.

In mathematics an asymptotic expansion, asymptotic series or Poincaré expansion (after Henri Poincaré) is a formal series of functions which has the property that truncating the series after a finite number of terms provides an approximation to a given function as the argument of the function tends towards a particular, often infinite, point.

If &phi;"n" is a sequence of continuous functions on some domain, and if "L" is a (possibly infinite) limit point of the domain, then the sequenceconstitutes an asymptotic scale if for every "n",$varphi_\left\{n+1\right\}\left(x\right) = o\left(varphi_n\left(x\right)\right) \left(x ightarrow L\right)$. If "f" is a continuous function on the domain of the asymptotic scale, then an asymptotic expansion of"f" with respect to the scale is a formal series $sum_\left\{n=0\right\}^infty a_n varphi_\left\{n\right\}\left(x\right)$ such that, for any fixed "N",:$f\left(x\right) = sum_\left\{n=0\right\}^N a_n varphi_\left\{n\right\}\left(x\right) + O\left(varphi_\left\{N+1\right\}\left(x\right)\right) \left(x ightarrow L\right).$In this case, we write:$f\left(x\right) sim sum_\left\{n=0\right\}^infty a_n varphi_n\left(x\right) \left(x ightarrow L\right)$.See asymptotic analysis and big O notation for the notation.

The most common type of asymptotic expansion is a power series in either positiveor negative terms. While a convergent Taylor series fits the definition asgiven, a non-convergent series is what is usually intended by the phrase. Methods of generating such expansions include the Euler–Maclaurin formula andintegral transforms such as the Laplace and Mellin transforms. Repeated integration by parts will often lead to an asymptotic expansion.

Examples of asymptotic expansions

* Gamma function

::$frac\left\{e^x\right\}\left\{x^x sqrt\left\{2pi x Gamma\left(x+1\right) sim 1+frac\left\{1\right\}\left\{12x\right\}+frac\left\{1\right\}\left\{288x^2\right\}-frac\left\{139\right\}\left\{51840x^3\right\}-cdots \left(x ightarrow infty\right)$

* Exponential integral

::$xe^xE_1\left(x\right) sim sum_\left\{n=0\right\}^infty frac\left\{\left(-1\right)^nn!\right\}\left\{x^n\right\} \left(x ightarrow infty\right)$

* Riemann zeta function

::$zeta\left(s\right) sim sum_\left\{n=1\right\}^\left\{N-1\right\}n^\left\{-s\right\} + frac\left\{N^\left\{1-s\left\{s-1\right\} +N^\left\{-s\right\} sum_\left\{m=1\right\}^infty frac\left\{B_\left\{2m\right\} s^\left\{overline\left\{2m-1\right\}\left\{\left(2m\right)! N^\left\{2m-1$
where $B_\left\{2m\right\}$ are Bernoulli numbers and $s^\left\{overline\left\{2m-1$ is a rising factorial. This expansion is valid for all complex "s" and is often used to compute the zeta function by using a large enough value of "N", for instance $N > |s|$.

* Error function

::$sqrt\left\{pi\right\}x e^\left\{x^2\right\}\left\{ m erfc\right\}\left(x\right) = 1+sum_\left\{n=1\right\}^infty \left(-1\right)^n frac\left\{\left(2n\right)!\right\}\left\{n!\left(2x\right)^\left\{2n.$

Detailed example

Asymptotic expansions often occur when an ordinary series is used in a formal expression that forces the taking of values outside of its domain of convergence. Thus, for example, one may start with the ordinary series

:$frac\left\{1\right\}\left\{1-w\right\}=sum_\left\{n=0\right\}^infty w^n$

The expression on the left is valid on the entire complex plane $w e 1$, while the right hand side converges only for $|w|< 1$. Multiplying by $e^\left\{-w/t\right\}$ and integrating both sides yields

:$int_0^infty frac\left\{e^\left\{-w/t\left\{1-w\right\} dw = sum_\left\{n=0\right\}^infty t^\left\{n+1\right\} int_0^infty e^\left\{-u\right\} u^n du$

The integral on the left hand side can be expressed in terms of the exponential integral. The integral on the right hand side, after the substitution $u=w/t$, may be recognized as the gamma function. Evaluating both, one obtains the asymptotic expansion

:$e^\left\{-1/t\right\}; operatorname\left\{Ei\right\}left\left(frac\left\{1\right\}\left\{t\right\} ight\right) = sum _\left\{n=0\right\}^infty n! ; t^\left\{n+1\right\}$

Here, the right hand side is clearly not convergent for any non-zero value of "t". However, by keeping "t" small, and truncating the series on the right to a finite number of terms, one may obtain a fairly good approximation to the value of $operatorname\left\{Ei\right\}\left(1/t\right)$. Substituting $x=-1/t$ and noting that $operatorname\left\{Ei\right\}\left(x\right)=-E_1\left(-x\right)$ results in the asymptotic expansion given earlier in this article.

References

* Hardy, G. H., "Divergent Series", Oxford University Press, 1949
* Paris, R. B. and Kaminsky, D., "Asymptotics and Mellin-Barnes Integrals", Cambridge University Press, 2001
* Whittaker, E. T. and Watson, G. N., "A Course in Modern Analysis", fourth edition, Cambridge University Press, 1963

* [http://swan.econ.ohio-state.edu/econ840/note4.pdf A paper on time series analysis using asymptotic distribution]
* [http://thesaurus.maths.org/mmkb/entry.html?action=entryById&id=4185]

Wikimedia Foundation. 2010.

### Look at other dictionaries:

• Asymptotic analysis — This article is about the comparison of functions as inputs approach infinite. For asymptotes in geometry, see asymptotic curve. In mathematical analysis, asymptotic analysis is a method of describing limiting behavior. The methodology has… …   Wikipedia

• Asymptotic freedom — In physics, asymptotic freedom is the property of some gauge theories in which the interaction between the particles, such as quarks, becomes arbitrarily weak at ever shorter distances, i.e. length scales that asymptotically converge to zero (or …   Wikipedia

• Asymptotic gain model — The asymptotic gain model [Middlebrook, RD: Design oriented analysis of feedback amplifiers ; Proc. of National Electronics Conference, Vol. XX, Oct. 1964, pp. 1 4] G {infin} T} . while in classical feedback theory, in terms of the open loop gain …   Wikipedia

• Asymptotic computational complexity — In computational complexity theory, asymptotic computational complexity is the usage of the asymptotic analysis for the estimation of computational complexity of algorithms and computational problems, commonly associated with the usage of the big …   Wikipedia

• Asymptotic equipartition property — In information theory the asymptotic equipartition property (AEP) is a general property of the output samples of a stochastic source. It is fundamental to the concept of typical set used in theories of compression.Roughly speaking, the theorem… …   Wikipedia

• Theory of computation — In theoretical computer science, the theory of computation is the branch that deals with whether and how efficiently problems can be solved on a model of computation, using an algorithm. The field is divided into three major branches: automata… …   Wikipedia

• Asymptotic stability — See also Lyapunov stability for an alternate definition used in dynamical systems. In control theory, a continuous linear time invariant system is asymptotically stable if and only if the system has eigenvalues only with strictly negative real… …   Wikipedia

• Contiguity (probability theory) — In probability theory, two sequences of probability measures are said to be contiguous if asymptotically they share the same support. Thus the notion of contiguity extends the concept of absolute continuity to the sequences of measures. The… …   Wikipedia

• Geometric group theory — is an area in mathematics devoted to the study of finitely generated groups via exploring the connections between algebraic properties of such groups and topological and geometric properties of spaces on which these groups act (that is, when the… …   Wikipedia

• Additive number theory — In mathematics, additive number theory is a branch of number theory that studies ways to express an integer as the sum of integers in a set. Two classical problem in this area of number theory are the Goldbach conjecture and Waring s problem.… …   Wikipedia