Tuesday, February 26, 2019

calculus - Big-O inside a log operation



I would appreciate help in understanding how:



log(1s1O(1))=log(1s1)+O(1) as s1+



I thought of perhaps a Taylor series for log(x1), but that would have an O(x2) term.



Also I would appreciate any reference or tutorial recommendations to get a good understanding of big-O notation in general.




Thanks very much.


Answer



f(s)=O(1) as s1+ means that there is a constant C such that $|f(s)|

One thing to always keep in mind is that equalities between things with O's or o's are not really symmetric equalities. This means that it is probably safe to prove this 'in both directions'.



The left hand side is talking about a function f(s) such that there is a constant C such that $|e^{f(s)}-\frac{1}{s-1}|

The right hand side is talking about a function g(s) such that there is a constant D such that $|g(s)-\log(\frac{1}{s-1})|


Let us check that the function on the left f satisfies the description on the right. According to its description, we can write f(s) as log(1s1+h(s)), where h is bounded as s1+. We subtract log(1s1) and get log(1+(s1)h(s)). Since h is bounded and (s1)0 then this subtraction is bounded. This was the description on the right.



Now, we do the other direction. Let us check that g satisfies the description on the left. From what we know of g we can write it as log(1s1)+a(s) with a bounded. We now compute elog(1/(s1))+a(s)1s1=ea(s)(s1)1(s1)=ea(s)1(s1) ... oops.



I guess that is why this is not really a symmetric equality.



So, reading from left to right the equality is true. Reading from right to left, it is not.


No comments:

Post a Comment

analysis - Injection, making bijection

I have injection f:AB and I want to get bijection. Can I just resting codomain to f(A)? I know that every function i...