Skip to the passage panel
WikiLean · Articles Articles Brain Contribute About

Preliminary: these links have not yet had an independent audit.

Asymptotic analysis

54 passages16 formalized10 partial28 not formalized

Statement only

More ways to filter
Library
Passages
About this page

This page

  • Wikipedia revision 1379563048, pinned: the text here is that revision, not today's article.
  • WikiProject Mathematics: C-class, High importance
  • Annotated article on WikiLean.
  • 54 passages checked, 41 Lean locations (and 20 related declarations).

Central statements: 23 of the 54 passages state the article's subject or a named result or definition; the other 31 are supporting (examples, setup). Of these 23: 7 formalized, 7 partial, 9 not formalized.

What the colours mean

  • Formalized a Lean declaration states it, proved, or a Lean definition defines it
  • Statement only Lean states it, but the proof is not finished
  • Partial Lean states part of it, or a more general or special form
  • Not formalized searched every library and not found

Libraries searched

Searched 48 Lean libraries, pinned 2026-10-17, 3 left out (library set u1).

How these links were made

  • Accuracy, from an audit of a sample of 224 items (blind, not independent): Strong links (exact, close or broad match) on supporting passages that have exactly the right relation: 92% (95% interval 49–99%), from 36 drawn of 1029, weighted by relation and library, an effective sample of 5.1; Links in a counting relation (exact, close, broad, narrow match or part) on supporting passages that have exactly the right relation: 73% (95% interval 40–92%), from 48 drawn of 1740, weighted by relation and library, an effective sample of 8.1; Central and subject passages whose formalization status is right: 86% (95% interval 73–94%), from 44 drawn of 1905, weighted by recorded status, an effective sample of 42; 'Not formalized' on supporting passages that is right (no declaration in the 48 libraries states it): 60% (95% interval 25–87%), from 12 drawn of 1236, weighted by article, an effective sample of 6.1.
  • Audit run tierA-batch1-audit, run by jack, 2 Nov 2026, 21:10 – 3 Nov 2026, 02:10 UTC: judged by Claude Opus 5.5 (claude-opus-5-5).
  • Record set tierA-b1b (cf-locate-recordset/2, statuses by status rule 3), exported 1 Nov 2026 by formal-companion at commit d85385a.
  • Seal sha256 23710337d053e8212378a9e580805628bcdfda61a6fc431e65f24a4a16c9e602.
  • Inventory run inv-tierA-b1r, run by jack, 30 Oct 2026, 07:23–20:00 UTC: worker Claude Opus 5 (claude-opus-5), reviewer Claude Opus 5 (claude-opus-5). It listed the formal passages, each with its kind and prominence, that the locate run then searched.
  • Locate run loc-tierA-b1b, run by jack, 31 Oct 2026, 04:59 – 1 Nov 2026, 03:06 UTC: worker Claude Opus 5 (claude-opus-5), reviewer Claude Opus 5 (claude-opus-5).
  • Challenge run chal-tierA-b1, run by jack, 1 Nov 2026, 03:19–14:25 UTC: worker Claude Opus 5 (claude-opus-5), reviewer Claude Opus 5 (claude-opus-5). In this article it re-checked every Lean location and absence on a central or subject passage (22 locations and 9 absences); on supporting passages, a seeded sample (seed 0; drawn at 0.5 for strong matches, 0.2 for weaker links and 0.25 for absences): 9 of 19 locations and 3 of 18 absences. In all, 31 of 41 Lean locations (76%) and 12 of 27 absences (44%) were re-checked.
  • Passage text: 54 of 54 passages shown in full, each the slice of the pinned revision's text that its record's span sha256 hashes, checked when the store was built.
  • Lean code: each declaration's type, from the declaration corpus of universe u1 (built 18 Oct 2026, sha256 a364fd6aede5), at the commit its card links.

How the text is shown

Each passage is shown in full, as revision 1379563048 states it (checked against its record's span hash when the store was built). Where a passage is only part of a sentence, it is highlighted and the rest of the sentence is shown in grey around it, from the same copy of the revision; a list item also shows the sentence that introduces it. Formulas are drawn from their TeX; hover one to see it.

Each card's Lean code is its declaration's type as Lean prints it, from the declaration corpus of library set u1 at the card's commit, laid out as a header: binders before the colon, then the hypotheses as arrows (the corpus keeps no hypothesis names) and the conclusion, in Mathlib's notation (𝓝, π, R[X], Type*). It is not the source text; Source opens that.

Select a highlighted passage to see where Lean formalizes it.

Figure 1. Aysmptotic approximation: The function f(x)=x is an asymptotic approximation for the function f(x)=x+e^-x for large positive values of x.

In mathematical analysis, asymptotic analysis, also known as asymptotics, is the development and application of methods that generate an approximate analytical solution to a mathematical problem when a variable or parameter assumes a value that is large, small or near a specified value.[1]

An example of asymptotic analysis is function approximation. For example, the function y ~ ( x ) = x {\textstyle {\widetilde {y}}(x)=x} accurately approximates the function y ( x ) = x + e − x {\textstyle y(x)=x+e^{-x}} for large positive x {\textstyle x} values (Figure 1). For any desired accuracy, there is a corresponding range of x {\textstyle x} values where this accuracy occurs. In this case, a chosen accuracy with a relative error of less than 1% occurs when the x {\textstyle x} values are greater than 3.4.

The prime number theorem is an example of an important asymptotic result. For any real number x {\textstyle x} , the prime counting function, denoted as π ⁡ ( x ) {\textstyle \operatorname {\pi } (x)} , is the number of prime numbers less than or equal to x {\textstyle x} . The function, x / ln ⁡ ( x ) {\textstyle x/\ln(x)} , approximates the prime counting function for large numbers x {\textstyle x} . As in the preceding example, as the number x {\textstyle x} becomes increasingly larger, the approximating function becomes increasingly more accurate, leading to an increasingly smaller relative error. This asymptotic relationship is expressed using this notation: π ( x ) ∼ x ln ⁡ ( x ) ( x → ∞ ) {\displaystyle \pi (x)\sim {\frac {x}{\ln(x)}}\quad (x\to \infty )}

Asymptotic analysis impacts on many areas of mathematics. Mathematicians use asymptotic analysis for computing function approximations, implicit functions, integrals, iterated functions, series summation, partial sums, solutions of difference equations, solutions of differential equations and properties of computer algorithms.[2][3][4][5]

Definition

Formally, given functions f (x) and g(x), we define a binary relation f ( x ) ∼ g ( x ) ( as  x → ∞ ) {\displaystyle f(x)\sim g(x)\quad ({\text{as }}x\to \infty )} if and only if (de Bruijn 1981, §1.4) lim x → ∞ f ( x ) g ( x ) = 1. {\displaystyle \lim _{x\to \infty }{\frac {f(x)}{g(x)}}=1.}

The symbol ~ is the tilde. The relation is an equivalence relation on the set of functions of x; the functions f and g are said to be asymptotically equivalent. The domain of f and g can be any set for which the limit is defined: e.g. real numbers, complex numbers, positive integers.

The same notation is also used for other ways of passing to a limit: e.g. x → 0, x ↓ 0, |x| → 0. The way of passing to the limit is often not stated explicitly, if it is clear from the context.

Although the above definition is common in the literature, it is problematic if g(x) is zero infinitely often as x goes to the limiting value. For that reason, some authors use an alternative definition. The alternative definition, in little-o notation, is that f ~ g if and only if f ( x ) = g ( x ) ( 1 + o ( 1 ) ) . {\displaystyle f(x)=g(x)(1+o(1)).}

This definition is equivalent to the prior definition if g(x) is not zero in some neighbourhood of the limiting value.[5]: §1.2 

Properties

The zero function, f ( z ) = 0 {\textstyle f(z)=0} , can never be equivalent to any other function.[6]

The little-o relation has the partial ordering property defined as if f ( x ) = o ( g ( x ) ) {\textstyle f(x)=o(g(x))} and g ( x ) = o ( h ( x ) ) {\textstyle g(x)=o(h(x))} then f ( x ) = o ( h ( x ) ) {\textstyle f(x)=o(h(x))} .[6]

Asymptotic equivalence has reflexive, symmetric and transitive properties.

If these functions are equivalent, f ( x ) ∼ g ( x ) ( x → L ) {\textstyle f(x)\sim g(x)\,(x\to L)} , then the exponentiated functions to the real power r {\textstyle r} are also equivalent:[7] ( f ( x ) ) r ∼ ( g ( x ) ) r   ( x → L ) {\displaystyle (f(x))^{r}\sim (g(x))^{r}\ (x\to L)}

If these functions are equivalent f ( x ) ∼ g ( x ) ( x → L ) {\textstyle f(x)\sim g(x)\,(x\to L)} , and these functions are equivalent h ( x ) ∼ k ( x ) ( x → L ) {\textstyle h(x)\sim k(x)\,(x\to L)} , then the quotients are equivalent:[7] f ( x ) h ( x ) ∼ g ( x ) k ( x )   ( x → L ) {\displaystyle {\frac {f(x)}{h(x)}}\sim {\frac {g(x)}{k(x)}}\ (x\to L)} These properties allow asymptotically equivalent functions to be freely exchanged in many algebraic expressions.

Asymptotically equivalent functions remain asymptotically equivalent under integration if requirements related to convergence are met. There are more stringent requirements for asymptotically equivalent functions to remain asymptotically equivalent under differentiation.[8]

Examples of asymptotic formulas

  • Factorial n ! ∼ 2 π n ( n e ) n {\displaystyle n!\sim {\sqrt {2\pi n}}\left({\frac {n}{e}}\right)^{n}} —this is Stirling's approximation
  • Partition function
    For a positive integer n, the partition function, p(n), gives the number of ways of writing the integer n as a sum of positive integers, where the order of addends is not considered. p ( n ) ∼ 1 4 n 3 e π 2 n 3 {\displaystyle p(n)\sim {\frac {1}{4n{\sqrt {3}}}}e^{\pi {\sqrt {\frac {2n}{3}}}}}
  • Airy function
    The Airy function, Ai(x), is a solution of the differential equation y″ − xy = 0; it has many applications in physics. Ai ⁡ ( x ) ∼ e − 2 3 x 3 2 2 π x 1 / 4 {\displaystyle \operatorname {Ai} (x)\sim {\frac {e^{-{\frac {2}{3}}x^{\frac {3}{2}}}}{2{\sqrt {\pi }}x^{1/4}}}}
  • Hankel functions H α ( 1 ) ( z ) ∼ 2 π z e i ( z − 2 π α − π 4 ) H α ( 2 ) ( z ) ∼ 2 π z e − i ( z − 2 π α − π 4 ) {\displaystyle {\begin{aligned}H_{\alpha }^{(1)}(z)&\sim {\sqrt {\frac {2}{\pi z}}}e^{i\left(z-{\frac {2\pi \alpha -\pi }{4}}\right)}\\H_{\alpha }^{(2)}(z)&\sim {\sqrt {\frac {2}{\pi z}}}e^{-i\left(z-{\frac {2\pi \alpha -\pi }{4}}\right)}\end{aligned}}}

Asymptotic expansion

An asymptotic expansion of a function f(x) is in practice an expression of that function in terms of a series, the partial sums of which do not necessarily converge, but such that taking any initial partial sum provides an asymptotic formula for f. The idea is that successive terms provide an increasingly accurate description of the order of growth of f.

In symbols, it means we have f ∼ g 1 , {\displaystyle f\sim g_{1},} but also f − g 1 ∼ g 2 {\displaystyle f-g_{1}\sim g_{2}} and f − g 1 − ⋯ − g k − 1 ∼ g k {\displaystyle f-g_{1}-\cdots -g_{k-1}\sim g_{k}} for each fixed k. In view of the definition of the ∼ {\displaystyle \sim } symbol, the last equation means f − ( g 1 + ⋯ + g k ) = o ( g k ) {\displaystyle f-(g_{1}+\cdots +g_{k})=o(g_{k})} in the little o notation, i.e., f − ( g 1 + ⋯ + g k ) {\displaystyle f-(g_{1}+\cdots +g_{k})} is much smaller than g k . {\displaystyle g_{k}.}

The relation f − g 1 − ⋯ − g k − 1 ∼ g k {\displaystyle f-g_{1}-\cdots -g_{k-1}\sim g_{k}} takes its full meaning if g k + 1 = o ( g k ) {\displaystyle g_{k+1}=o(g_{k})} for all k, which means the g k {\displaystyle g_{k}} form an asymptotic scale. In that case, some authors may abusively write f ∼ g 1 + ⋯ + g k {\displaystyle f\sim g_{1}+\cdots +g_{k}} to denote the statement f − ( g 1 + ⋯ + g k ) = o ( g k ) . {\displaystyle f-(g_{1}+\cdots +g_{k})=o(g_{k}).} One should however be careful that this is not a standard use of the ∼ {\displaystyle \sim } symbol, and that it does not correspond to the definition given in § Definition.

In the present situation, this relation g k = o ( g k − 1 ) {\displaystyle g_{k}=o(g_{k-1})} actually follows from combining steps k and k−1; by subtracting f − g 1 − ⋯ − g k − 2 = g k − 1 + o ( g k − 1 ) {\displaystyle f-g_{1}-\cdots -g_{k-2}=g_{k-1}+o(g_{k-1})} from f − g 1 − ⋯ − g k − 2 − g k − 1 = g k + o ( g k ) , {\displaystyle f-g_{1}-\cdots -g_{k-2}-g_{k-1}=g_{k}+o(g_{k}),} one gets g k + o ( g k ) = o ( g k − 1 ) , {\displaystyle g_{k}+o(g_{k})=o(g_{k-1}),} i.e. g k = o ( g k − 1 ) . {\displaystyle g_{k}=o(g_{k-1}).}

In case the asymptotic expansion does not converge, for any particular value of the argument there will be a particular partial sum which provides the best approximation and adding additional terms will decrease the accuracy. This optimal partial sum will usually have more terms as the argument approaches the limit value.

Examples of asymptotic expansions

  • Gamma function e x x x 2 π x Γ ( x + 1 ) ∼ 1 + 1 12 x + 1 288 x 2 − 139 51840 x 3 − ⋯   ( x → ∞ ) {\displaystyle {\frac {e^{x}}{x^{x}{\sqrt {2\pi x}}}}\Gamma (x+1)\sim 1+{\frac {1}{12x}}+{\frac {1}{288x^{2}}}-{\frac {139}{51840x^{3}}}-\cdots \ (x\to \infty )}
  • Exponential integral x e x E 1 ( x ) ∼ ∑ n = 0 ∞ ( − 1 ) n n ! x n   ( x → ∞ ) {\displaystyle xe^{x}E_{1}(x)\sim \sum _{n=0}^{\infty }{\frac {(-1)^{n}n!}{x^{n}}}\ (x\to \infty )}
  • Error function π x e x 2 erfc ⁡ ( x ) ∼ 1 + ∑ n = 1 ∞ ( − 1 ) n ( 2 n − 1 ) ! ! n ! ( 2 x 2 ) n   ( x → ∞ ) {\displaystyle {\sqrt {\pi }}xe^{x^{2}}\operatorname {erfc} (x)\sim 1+\sum _{n=1}^{\infty }(-1)^{n}{\frac {(2n-1)!!}{n!(2x^{2})^{n}}}\ (x\to \infty )} where m!! is the double factorial.

Worked 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. For example, we might start with the formal power series 1 1 − w = ∑ n = 0 ∞ w n {\displaystyle {\frac {1}{1-w}}=\sum _{n=0}^{\infty }w^{n}}

The expression on the left is valid on the entire complex plane w ≠ 1 {\displaystyle w\neq 1} , while the right hand side converges only for | w | < 1 {\displaystyle |w|<1} . Multiplying by e − w / t {\displaystyle e^{-w/t}} and integrating both sides yields ∫ 0 ∞ e − w t 1 − w d w = ∑ n = 0 ∞ t n + 1 ∫ 0 ∞ e − u u n d u {\displaystyle \int _{0}^{\infty }{\frac {e^{-{\frac {w}{t}}}}{1-w}}\,dw=\sum _{n=0}^{\infty }t^{n+1}\int _{0}^{\infty }e^{-u}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 {\displaystyle u=w/t} , may be recognized as the gamma function. Evaluating both, one obtains the asymptotic expansion e − 1 t Ei ⁡ ( 1 t ) = ∑ n = 0 ∞ n ! t n + 1 {\displaystyle e^{-{\frac {1}{t}}}\operatorname {Ei} \left({\frac {1}{t}}\right)=\sum _{n=0}^{\infty }n!\;t^{n+1}}

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 Ei ⁡ ( 1 / t ) {\displaystyle \operatorname {Ei} (1/t)} . Substituting x = − 1 / t {\displaystyle x=-1/t} and noting that Ei ⁡ ( x ) = − E 1 ( − x ) {\displaystyle \operatorname {Ei} (x)=-E_{1}(-x)} results in the asymptotic expansion given earlier in this article.

Asymptotic distribution

In mathematical 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, …, 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 , {\displaystyle y={\frac {1}{x}},} y becomes arbitrarily small in magnitude as x increases.

Applications

Asymptotic analysis is used in several mathematical sciences. In statistics, asymptotic theory provides limiting approximations of the probability distribution of sample statistics, such as the likelihood ratio statistic and the expected value of the deviance. Asymptotic theory does not provide a method of evaluating the finite-sample distributions of sample statistics, however. Non-asymptotic bounds are provided by methods of approximation theory.

Examples of applications are the following.

Asymptotic analysis is a key tool for exploring the ordinary and partial differential equations which arise in the mathematical modelling of real-world phenomena.[9] An illustrative example is the derivation of the boundary layer equations from the full Navier-Stokes equations governing fluid flow. In many cases, the asymptotic expansion is in power of a small parameter, ε: in the boundary layer case, this is the nondimensional ratio of the boundary layer thickness to a typical length scale of the problem. Indeed, applications of asymptotic analysis in mathematical modelling often center around a nondimensional parameter which has been shown, or assumed, to be small through a consideration of the scales of the problem at hand.[9]

Asymptotic expansions typically arise in the approximation of certain integrals (Laplace's method, saddle-point method, method of steepest descent) or in the approximation of probability distributions (Edgeworth series). The Feynman graphs in quantum field theory are another example of asymptotic expansions which often do not converge.

Asymptotic versus Numerical Analysis

De Bruijn illustrates the use of asymptotics in the following dialog between Dr. N.A., a numerical analyst, and Dr. A.A., an asymptotic analyst:

N.A.: I want to evaluate my function f ( x ) {\displaystyle f(x)} for large values of x {\displaystyle x} , with a relative error of at most 1%.

A.A.: f ( x ) = x − 1 + O ( x − 2 ) ( x → ∞ ) {\displaystyle f(x)=x^{-1}+\mathrm {O} (x^{-2})\qquad (x\to \infty )} .

N.A.: I am sorry, I don't understand.

A.A.: | f ( x ) − x − 1 | < 8 x − 2 ( x > 10 4 ) . {\displaystyle |f(x)-x^{-1}|<8x^{-2}\qquad (x>10^{4}).}

N.A.: But my value of x {\displaystyle x} is only 100.

A.A.: Why did you not say so? My evaluations give

| f ( x ) − x − 1 | < 57000 x − 2 ( x > 100 ) . {\displaystyle |f(x)-x^{-1}|<57000x^{-2}\qquad (x>100).}

N.A.: This is no news to me. I know already that 0 < f ( 100 ) < 1 {\displaystyle 0<f(100)<1} .

A.A.: I can gain a little on some of my estimates. Now I find that

| f ( x ) − x − 1 | < 20 x − 2 ( x > 100 ) . {\displaystyle |f(x)-x^{-1}|<20x^{-2}\qquad (x>100).}

N.A.: I asked for 1%, not for 20%.

A.A.: It is almost the best thing I possibly can get. Why don't you take larger values of x {\displaystyle x} ?

N.A.: !!! I think it's better to ask my electronic computing machine.

Machine: f(100) = 0.01137 42259 34008 67153

A.A.: Haven't I told you so? My estimate of 20% was not far off from the 14% of the real error.

N.A.: !!! . . .  !

Some days later, Miss N.A. wants to know the value of f(1000), but her machine would take a month of computation to give the answer. She returns to her Asymptotic Colleague, and gets a fully satisfactory reply.[2]: 19 

See also

Notes

  1. ^ Murray 2012, p. 1.
  2. ^ a b de Bruijn 1981.
  3. ^ Murray 2012.
  4. ^ Paulsen 2013.
  5. ^ a b Estrada & Kanwal 2012.
  6. ^ a b Paulsen 2013, pp. 1–3, 7.
  7. ^ a b Paulsen 2013, p. 9.
  8. ^ Olver 1974, pp. 8, 9, 21.
  9. ^ a b Howison 2005.

References