Math 2.0

Approximations and expansions Definition

Asymptotic equivalence

Builds on Little o notation

Definition

Let ff and gg be real functions defined on an interval [x0,∞)[x_0, \infty). The functions are asymptotically equivalent as x→∞x \to \infty if f(x)−g(x)=o(g(x))f(x) - g(x) = o(g(x)) as x→∞x \to \infty, in the sense of little o notation. The notation is f(x)∼g(x)f(x) \sim g(x).

Remarks

If g(x)≠0g(x) \ne 0 for large xx, then f∼gf \sim g means that f(x)/g(x)→1f(x)/g(x) \to 1. The relation ∼\sim is an equivalence relation. For example, x2+x∼x2x^2 + x \sim x^2. Stirling's formula states n!∼2πn (n/e)nn! \sim \sqrt{2 \pi n}\, (n/e)^n. Mathlib defines it for filters, as Asymptotics.IsEquivalent.

Reading path

To understand this page from the ground up, read these 3 pages in order. The foundations come first.

Show the path as a graph
Each page uses the pages above it. The colour of the bar on a box shows how strong the evidence is, and the box also gives it as text. The list has the same pages.
  • no evidence level
  1. Big O notation definition
  2. Little o notation definition
  3. Asymptotic equivalence definition

Where this leads

8 pages build on this one.

Further reading

  1. Web https://en.wikipedia.org/wiki/Asymptotic_analysis, Definition
About this page
Tag00SB5EA3VW
URIm2://00SB5EA3VW
Kinddefinition
WritingW0 stub
MSC41A60
DefinesAsymptotic equivalence
UsesLittle o notation

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • an inventory row: the row of the inventory that the node accounts for (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

Used by