User:IssaRice/Little o notation: Difference between revisions

From Machinelearning
Line 9: Line 9:
| <math>f</math> is little o of <math>g</math> near <math>a</math> || This is a point-free notation.
| <math>f</math> is little o of <math>g</math> near <math>a</math> || This is a point-free notation.
|-
|-
| <math>f(x) \in o(g(x))</math> as <math>x \to a</math> || This is in point notation, as the variable <math>x</math> appears in the notation. This allows us to define functions anonymously. For example, we can say <math>x^2 \in o(x)</math> as <math>x \to 0</math>; we didn't even name the functions. As the appearance of the symbol "<math>\in</math>" suggests, in this notation we think of <math>o(g(x))</math> as a set, namely the set of all functions that are <math>o(g(x))</math> as <math>x \to a</math>. In other words,
| <math>f(x) \in o(g(x))</math> as <math>x \to a</math> || This is in point notation, as the variable <math>x</math> appears in the notation. This allows us to define functions anonymously. For example, we can say <math>x^2 \in o(x)</math> as <math>x \to 0</math>; we didn't even name the functions. As the appearance of the symbol "<math>\in</math>" suggests, in this notation we think of <math>o(g(x))</math> as a set, namely the set of all functions that are <math>o(g(x))</math> as <math>x \to a</math>.
|-
|-
| <math>f(x) = o(g(x))</math> as <math>x \to a</math> || This is in point notation.
| <math>f(x) = o(g(x))</math> as <math>x \to a</math> || This is in point notation. As the equality symbol suggests, in this notation we think of f as a concrete manifestation of a function that is <math>o(g(x))</math> near <math>a</math>. This allows us to algebraically manipulate the expression <math>o(g(x))</math> along with all our other expressions.
|-
|-
| <math>f \in o(g)</math> near <math>a</math> || This is a point-free notation. As the appearance of the symbol "<math>\in</math>" suggests, in this notation we think of <math>o(g)</math> as a set, namely the set of all functions that are <math>o(g)</math> near <math>a</math>. In other words, <math>o(g) = \{f : \forall \epsilon > 0 \ \exists \delta > 0\ \forall x\ (|x-a| < \delta \implies |f(x)| < \epsilon|g(x)|)\}</math>
| <math>f \in o(g)</math> near <math>a</math> || This is a point-free notation. As the appearance of the symbol "<math>\in</math>" suggests, in this notation we think of <math>o(g)</math> as a set, namely the set of all functions that are <math>o(g)</math> near <math>a</math>. In other words, <math>o(g) = \{f : \forall \epsilon > 0 \ \exists \delta > 0\ \forall x\ (|x-a| < \delta \implies |f(x)| < \epsilon|g(x)|)\}</math>

Revision as of 17:17, 29 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 This is a point-free notation.
f(x)o(g(x)) as xa This is in point notation, as the variable x appears in the notation. This allows us to define functions anonymously. For example, we can say x2o(x) as x0; we didn't even name the functions. As the appearance of the symbol "" suggests, in this notation we think of o(g(x)) as a set, namely the set of all functions that are o(g(x)) as xa.
f(x)=o(g(x)) as xa This is in point notation. As the equality symbol suggests, in this notation we think of f as a concrete manifestation of a function that is o(g(x)) near a. This allows us to algebraically manipulate the expression o(g(x)) along with all our other expressions.
fo(g) near a This is a point-free notation. As the appearance of the symbol "" suggests, in this notation we think of o(g) as a set, namely the set of all functions that are o(g) near a. In other words, o(g)={f:ϵ>0δ>0x(|xa|<δ|f(x)|<ϵ|g(x)|)}
f=o(g) near a This is a point-free notation.

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

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

Exercise. If we are being a little pedantic, what is wrong with saying "fo(g) as xa"?

Expand to see solution:

We are saying xa, 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 x2o(x).

Expand to see solution:

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

Properties

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

Proposition. transitivity

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

Exercise. Let c,x0R be constants. Interpret the statement "o(c(xx0)+o(xx0))o(xx0) as xx0".

Expand to see solution:

TODO: be careful with universal vs existential quantifiers.

The statement is saying f(x)o(xx0) where f is some function such that limxx0f(x)c(xx0)+o(xx0)=0.

Because of the nested little o, we need to expand again and introduce g, where g(x)o(xx0) so limxx0g(x)xx0=0.

Now we verify:

limxx0f(x)xx0=limf(x)c(xx0)+g(x)limc(xx0)+g(x)xx0=0(c+0)=0

Could g have been arbitrary? In other words, could we have said o(c(xx0)+o(h(x)))o(xx0) for arbitrary h(x)? To compute the limit limxx0f(x)xx0 we actually used the limit laws, which require that the right hand limit exist. This means that we needed limxx0g(x)/h(x) to exist.

References

[1]

[2]