User:IssaRice/Little o notation: Difference between revisions

From Machinelearning
No edit summary
No edit summary
Line 1: Line 1:
==Definition==
==Definition==


Definition (little o near a point). Let <math>f : \mathbf R \to \mathbf R</math> and <math>g : \mathbf R \to \mathbf R</math> be two functions, and let <math>a \in \mathbf R</math>. We say that <math>f</math> is little o of <math>g</math> near <math>a</math> iff for every <math>\epsilon > 0</math> there exists <math>\delta > 0</math> such that <math>|x - a| < \delta</math> implies <math>|f(x)| < \epsilon|g(x)|</math>. Some equivalent ways to say the same thing are:
'''Definition''' (little o near a point). Let <math>f : \mathbf R \to \mathbf R</math> and <math>g : \mathbf R \to \mathbf R</math> be two functions, and let <math>a \in \mathbf R</math>. We say that <math>f</math> is little o of <math>g</math> near <math>a</math> iff for every <math>\epsilon > 0</math> there exists <math>\delta > 0</math> such that <math>|x - a| < \delta</math> implies <math>|f(x)| < \epsilon|g(x)|</math>. Some equivalent ways to say the same thing are:


{| class="wikitable"
{| class="wikitable"
Line 18: Line 18:
|}
|}


Definition (little o at infinity). Let <math>f : \mathbf R \to \mathbf R</math> and <math>g : \mathbf R \to \mathbf R</math> be two functions. We say that <math>f</math> is little o of <math>g</math> at infinity iff for every <math>\epsilon > 0</math> there exists <math>M</math> such that for all <math>x</math>, <math>x > M</math> implies <math>|f(x)| < \epsilon|g(x)|</math>.
'''Definition''' (little o at infinity). Let <math>f : \mathbf R \to \mathbf R</math> and <math>g : \mathbf R \to \mathbf R</math> be two functions. We say that <math>f</math> is little o of <math>g</math> at infinity iff for every <math>\epsilon > 0</math> there exists <math>M</math> such that for all <math>x</math>, <math>x > M</math> implies <math>|f(x)| < \epsilon|g(x)|</math>.
 


Can we write just <math>f \in o(g)</math> or <math>f = o(g)</math> or <math>f(x) \in o(g(x))</math> or <math>f(x) = o(g(x))</math>?
Can we write just <math>f \in o(g)</math> or <math>f = o(g)</math> or <math>f(x) \in o(g(x))</math> or <math>f(x) = o(g(x))</math>?
Line 31: Line 30:
==Properties==
==Properties==


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>.
'''Proposition'''. 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==
==References==

Revision as of 03:03, 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

Proposition. 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]