Math 2.0

definition

Big O notation

Definition

Let ff and gg be real functions defined on an interval [x0,∞)[x_0, \infty). The notation f(x)=O(g(x))f(x) = O(g(x)) as x→∞x \to \infty means that there are real numbers C>0C > 0 and x1≥x0x_1 \ge x_0 with ∣f(x)∣≤C∣g(x)∣for all x≥x1.|f(x)| \le C |g(x)| \quad \text{for all } x \ge x_1.

Remarks

The same definition works as x→ax \to a, with ∣x−a∣<δ|x - a| < \delta in place of x≥x1x \ge x_1. If g(x)≠0g(x) \ne 0 for large xx, then f=O(g)f = O(g) means that f/gf/g is bounded for large xx. For example, 3x2+5x=O(x2)3x^2 + 5x = O(x^2) as x→∞x \to \infty. Mathlib defines it for filters, as Asymptotics.IsBigO.

Explanations

L1 human

The statement f=O(g)f = O(g) says that ff grows at most as fast as gg, up to a constant factor. It ignores constant factors and small values of xx.

What this node needs for W2
  • edge instance_of in: one example (0 of 1)
  • edge not_instance_of in: one non-example that fails one clause (0 of 1)

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

What depends on this

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

Sources

  1. Web https://en.wikipedia.org/wiki/Big_O_notation, Formal definition