User:IssaRice/Little o notation: Difference between revisions

From Machinelearning
No edit summary
No edit summary
Line 3: Line 3:
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:


* <math>f(x) \in o(g(x))</math> as <math>x \to a</math>
{| class="wikitable"
* <math>f(x) = o(g(x))</math> as <math>x \to a</math>
|-
* <math>f \in o(g)</math> near <math>a</math>
! Notation !! Comments
|-
| <math>f</math> is little o of <math>g</math> near <math>a</math>
|-
| <math>f(x) \in o(g(x))</math> as <math>x \to a</math> || In this notation, we think of <math>o(g(x))</math> as a set.
|-
| <math>f(x) = o(g(x))</math> as <math>x \to a</math>
|-
| <math>f \in o(g)</math> near <math>a</math>
|-
| <math>f = o(g)</math> near <math>a</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>.
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>.

Revision as of 02:50, 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.