User:IssaRice/Little o notation: Difference between revisions

From Machinelearning
No edit summary
No edit summary
Line 24: Line 24:


{{collapsible solution|In general we can't because for this notation to make sense, we also need to know where the argument <math>x</math> is going. In algorithms, we have <math>x \to \infty</math>, but in analysis (e.g. in some definitions of differentiability) we have <math>x \to 0</math>.}}
{{collapsible solution|In general we can't because for this notation to make sense, we also need to know where the argument <math>x</math> is going. In algorithms, we have <math>x \to \infty</math>, but in analysis (e.g. in some definitions of differentiability) we have <math>x \to 0</math>.}}
==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>.
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>.

Revision as of 02:55, 27 November 2018

Definition

Definition (little o near a point). Let f:RR and g:RR be two functions, and let aR. We say that f is little o of g near a iff for every ϵ>0 there exists δ>0 such that |xa|<δ implies |f(x)|<ϵ|g(x)|. Some equivalent ways to say the same thing are:

Notation Comments
f is little o of g near a
f(x)o(g(x)) as xa In this notation, we think of o(g(x)) as a set.
f(x)=o(g(x)) as xa
fo(g) near a
f=o(g) near a

Definition (little o at infinity). Let f:RR and g:RR be two functions. We say that f is little o of g at infinity iff for every ϵ>0 there exists M such that for all x, x>M implies |f(x)|<ϵ|g(x)|.


Can we write just fo(g) or f=o(g) or f(x)o(g(x)) or f(x)=o(g(x))?

Expand to see solution:

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

Properties

Let f:RR and g:RR be two functions, and suppose g(x)0 for all xR. Then f is little o of g near a if and only if limxaf(x)g(x)=0.