User:IssaRice/Little o notation: Difference between revisions

From Machinelearning
No edit summary
Line 20: Line 20:
'''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>?
'''Exercise'''. 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>?


{{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>.}}


If we are being a little pedantic, what is wrong with saying "<math>f \in o(g)</math> as <math>x \to a</math>"?
'''Exercise'''. If we are being a little pedantic, what is wrong with saying "<math>f \in o(g)</math> as <math>x \to a</math>"?


{{collapsible solution|We are saying <math>x \to a</math>, but we haven't clarified what <math>x</math> is. Instead, we are relying on the reader to assume that <math>x</math> is an argument to <math>f</math> and <math>g</math>.}}
{{collapsible solution|We are saying <math>x \to a</math>, but we haven't clarified what <math>x</math> is. Instead, we are relying on the reader to assume that <math>x</math> is an argument to <math>f</math> and <math>g</math>.}}

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

Exercise. 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 .

Exercise. 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 .

Proposition. transitivity

Proposition. we can replace the in the definition with , right?

References

[1]

[2]