Blog Archive

Sunday, November 19, 2023

An interesting idea about Big O

I am reviewing my course and preparing for the final exam. I observed something interesting.

Definition of big O I

Let f,g be functions defined on an interval of the form (a,∞).

We shall say that

(1)f(x)=O(g(x)) as (x⟶∞)

If there exists M>0 and x0>a such that for all x>x0, |f(x)|≤M|g(x)|.

We could also define a big O for x⟶b.

Definition of big O II

if there exist positive numbers δ and M, such that ∀x∈0<|x−b|<δ, |f(x)|≤M|g(x)|.

One interesting thing is this definition looks like Stalk, i.e. Fx:=lim→U∋x⁡F(U).

But change the relation from f|U=g|U| to f|U(x)|≤M|g|U(x)|

 

Proposition

Let F(a,∞) be the space of all the functions defined on (a,∞).

Then Of={f(x)∈F(a,∞)|f(x)=O(g(x))} is a subspace of F(a,∞).

Proof

We only need to prove that

(2)f(x)−h(x)∈Og,λf(x)∈Og

Since |f−h|≤|f|+|h|, thus |f−g|≤(Cf+Ch)g(x) for an open interval (k,∞).

(3)|λf(x)|=|λ||f(x)|≤|λ|Cf|g(x)|◻

Moreover, if f(x)=Θ(g(x)), then Of=Og.

 

Indeed, f∼g:=f(x)=O(g(x)) is a preorder relation. Thus it can form a category in the usual sense.

The element of of preorder set can be the object and the preorder relation can be the morphism.

Let us call this preorder category O

(4)HomO(f,g)≠∅⟺f(x)=O(g(x))

Then O(−) form a functor.

(5)O(−):O⟶VectR

It maps f to Of, and it maps the preorder relation f(x)=O(g(x)), to inclusion map igf:Of⟶Og.

 

No comments:

Post a Comment

Popular Posts