|
|
| 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. In this notation, we think of <math>o(g(x))</math> as a set. | | | <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) = 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. |
| |- | | |- |
| | <math>f \in o(g)</math> near <math>a</math> || This is a point-free notation. | | | <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 = o(g)</math> near <math>a</math> || This is a point-free notation. | | | <math>f = o(g)</math> near <math>a</math> || This is a point-free notation. |
Revision as of 17:12, 29 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  |
This is a point-free notation.
|
as  |
This is in point notation, as the variable appears in the notation. This allows us to define functions anonymously. For example, we can say as ; we didn't even name the functions. As the appearance of the symbol " " suggests, in this notation we think of as a set, namely the set of all functions that are as . In other words,
|
as  |
This is in point notation.
|
near  |
This is a point-free notation. As the appearance of the symbol " " suggests, in this notation we think of as a set, namely the set of all functions that are near . In other words,
|
near  |
This is a point-free notation.
|
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

.
Exercise. Interpret the meaning of
.
Expand to see solution:
It depends on where

is going. We want

whenever

, so this is only true when

.
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?
Exercise. Let
be constants. Interpret the statement "
as
".
Expand to see solution:
TODO: be careful with universal vs existential quantifiers.
The statement is saying
where
is some function such that
.
Because of the nested little o, we need to expand again and introduce
, where
so
.
Now we verify:
Could

have been arbitrary? In other words, could we have said

for arbitrary

? To compute the limit

we actually used the limit laws, which require that the right hand limit exist. This means that we needed

to exist.
References
[1]
[2]