Math 2.0

definition

Asymptotic equivalence

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.

Explanations

L1 human

Two functions are asymptotically equivalent if their ratio tends to 11. Their difference may still grow, but it is small compared with the functions.

What this node 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 node is. They do not measure its truth.

What this needs

To read this node, read these 3 nodes in this order. The foundations come first, and the list ends with this node.

Each node uses the nodes above it. The colour of the bar on a box shows the evidence level, and the box also gives it as text. The list below has the same nodes.
  • no evidence level
  1. Big O notation definition
  2. Little o notation definition
  3. Asymptotic equivalence definition

What depends on this

3 nodes use this node, directly or through other nodes.

Sources

  1. Web https://en.wikipedia.org/wiki/Asymptotic_analysis, Definition