ΘρϵηΠατπ

Absolutely Dominated
Let f,g:00, we say that g is absolutely dominated by f iff for all n0,g(n)f(n)
Squared Dominates Linear
Let f(n)=n2 and g(n)=n show that g is absolutely dominated by f
Absolutely Dominated up to a Constant Factor
Let f,g:00, we say that g is absolutely dominated up to a constant factor by f iff there exists c+ such that g is absolutely dominated by cf
Eventually Dominated
Let f,g:00, we say that g is eventually dominated by f iff there exists some n0+ such that n+,nn0 then we know g(n)f(n)
Lower Degree Polynomial plus Constant is Eventually Dominated by Higher Degree
Let f(n)=n2 and g(n)=n+90
Eventually Dominated up to a Constant Factor
Let f,g:00, we say that g is eventually dominated by f iff there exists some c+ such that g is eventually dominated by cf
Big-O
Suppose we have f:00, then we define the set 𝒪(f) as all functions that are eventually dominated up to a constant factor by f
Big-O of
Let f,g:00, we say that g is big-o of f iff g𝒪(f)

Note that if g is big-o of f, then we know that f is an asymptotic upper bound for g

Basic Polynomial
Suppose f(n)=n3 and g(n)=n3+100n+5000, show that g𝒪(f)
TODO
Omega
Suppose we have f:00, then we define the set Ω(f) as the set of all functions g:00 such that c,n0+ s.t. n0,nn0g(n)cf(n)
Omega of
Let f,g:00, we say that g is omega of f iff gΩ(f)

Here we can think of Ω as being 𝒪's counter part, so that when g is omega of f, then f is a lower bound on g's eventual growth rate.

Theta
Suppose we have f:00, then we define the set Θ(f) as the set of all functions g:00 such that g𝒪(f)Ω(f) where we are using big-o and theta

The point of theta is to say that g is both eventually upper and lower bounded by f which means that g should grow asymptotically the same as f