Approximations and expansions Definition
Asymptotic analysis
Builds on Big O notationLittle o notationAsymptotic equivalence
Definition
Let and let be a limit point of , possibly . A sequence of functions on is an asymptotic sequence as if as for every . Let be a function on and let be numbers. The formal series is an asymptotic expansion of as , written if for every , Asymptotic analysis is the study of such expansions and of asymptotic equivalence , meaning . Its estimates are written with big O and little o notation.
Remarks
Example: on as , with . Here , so .
A divergent example: as , , although the series converges for no .
Non-example: is not an asymptotic sequence as , since is not there; it is one as .
Given the asymptotic sequence, the coefficients are unique. Different functions can have the same expansion: has all coefficients with respect to as .
Reading path
To understand this page from the ground up, read these 4 pages in order. The foundations come first.
Show the path as a graph
- no evidence level
- Asymptotic equivalence concept
- Big O notation concept
- Little o notation concept
- Asymptotic analysis definition
Further reading
About this page
| Tag | VDX0PQ2GJ4 |
|---|---|
| URI | m2://VDX0PQ2GJ4 |
| Kind | definition |
| Writing | W0 stub |
| MSC | 41A60, 34E05 |
| Defines | Asymptotic analysis |
| Uses | Big O notation, Little o notation, Asymptotic equivalence |
| Changed | 2 November 2026 |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- a source with a locator (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.
What links here
No page links to this page yet.