User:IssaRice/Little o notation: Difference between revisions

From Machinelearning
No edit summary
No edit summary
Line 32: Line 32:


Let <math>f : \mathbf R \to \mathbf R</math> and <math>g : \mathbf R \to \mathbf R</math> be two functions, and suppose <math>g(x) \ne 0</math> for all <math>x \in \mathbf R</math>. Then f is little o of g near a if and only if <math>\lim_{x\to a} \frac{f(x)}{g(x)} = 0</math>.
Let <math>f : \mathbf R \to \mathbf R</math> and <math>g : \mathbf R \to \mathbf R</math> be two functions, and suppose <math>g(x) \ne 0</math> for all <math>x \in \mathbf R</math>. Then f is little o of g near a if and only if <math>\lim_{x\to a} \frac{f(x)}{g(x)} = 0</math>.
==References==
<ref>https://sites.math.washington.edu/~folland/Math134/lin-approx.pdf</ref>
<ref>https://math.stackexchange.com/a/1784280/35525</ref>
<references/>

Revision as of 03:00, 27 November 2018

Definition

Definition (little o near a point). Let and be two functions, and let . We say that is little o of near iff for every there exists such that implies . Some equivalent ways to say the same thing are:

Notation Comments
is little o of near
as In this notation, we think of as a set.
as
near
near

Definition (little o at infinity). Let and be two functions. We say that is little o of at infinity iff for every there exists such that for all , implies .


Can we write just or or or ?

Expand to see solution:

In general we can't because for this notation to make sense, we also need to know where the argument is going. In algorithms, we have , but in analysis (e.g. in some definitions of differentiability) we have .

If we are being a little pedantic, what is wrong with saying " as "?

Expand to see solution:

We are saying , but we haven't clarified what is. Instead, we are relying on the reader to assume that is an argument to and .

Properties

Let and be two functions, and suppose for all . Then f is little o of g near a if and only if .

References

[1]

[2]