User:IssaRice/Little o notation: Difference between revisions

From Machinelearning
Line 41: Line 41:


'''Exercise'''. Let <math>c, x_0 \in \mathbf R</math> be constants. Interpret the statement "<math>o(c(x-x_0) + o(x-x_0)) \in o(x-x_0)</math> as <math>x \to x_0</math>".
'''Exercise'''. Let <math>c, x_0 \in \mathbf R</math> be constants. Interpret the statement "<math>o(c(x-x_0) + o(x-x_0)) \in o(x-x_0)</math> as <math>x \to x_0</math>".
{{collapsible solution|The statement is saying <math>f(x) \in o(x-x_0)</math> where <math>\lim_{x\to x_0} \frac{f(x)}{c(x-x_0) + g(x)} = 0</math>.
Because of the nested little o, we need to expand <math>g</math>. Here, <math>g(x) \in o(x-x_0)</math> so <math>\lim_{x\to x_0} \frac{g(x)}{x-x_0} = 0</math>.
Now we verify:
<math>\lim_{x\to x_0} \frac{f(x)}{c(x-x_0) + g(x)} = \lim \frac{f(x)}{c(x-x_0) + g(x)} \lim \frac{c(x-x_0) + g(x)}{x-x_0} = 0 \cdot (c + 0) = 0</math>}}


==References==
==References==

Revision as of 16:49, 29 November 2018

Definition

Definition (little o near a point). Let f:R→R and g:R→R be two functions, and let a∈R. We say that f is little o of g near a iff for every ϵ>0 there exists δ>0 such that |x−a|<δ 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 x→a In this notation, we think of o(g(x)) as a set.
f(x)=o(g(x)) as x→a
f∈o(g) near a
f=o(g) near a

Definition (little o at infinity). Let f:R→R and g:R→R 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)|.

Exercise. Can we write just f∈o(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 x→0.

Exercise. If we are being a little pedantic, what is wrong with saying "f∈o(g) as x→a"?

Expand to see solution:

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

Exercise. Interpret the meaning of x2∈o(x).

Expand to see solution:

It depends on where x is going. We want |x2|<ϵ|x| whenever |x−a|<δ, so this is only true when a=0.

Properties

Proposition. Let f:R→R and g:R→R be two functions, and suppose g(x)≠0 for all x∈R. Then f is little o of g near a if and only if limx→af(x)g(x)=0.

Proposition. transitivity

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

Exercise. Let c,x0∈R be constants. Interpret the statement "o(c(x−x0)+o(x−x0))∈o(x−x0) as x→x0".

Expand to see solution:

The statement is saying f(x)∈o(x−x0) where limx→x0f(x)c(x−x0)+g(x)=0.

Because of the nested little o, we need to expand g. Here, g(x)∈o(x−x0) so limx→x0g(x)x−x0=0.

Now we verify:

limx→x0f(x)c(x−x0)+g(x)=limf(x)c(x−x0)+g(x)limc(x−x0)+g(x)x−x0=0⋅(c+0)=0

References

[1]

[2]