I was working through the prime number theorem proof and the following questions arose.
1.) Is $f_1=f_2-\mathcal{O}(x)$ equivalent to $f_1=f_2+\mathcal{O}(x)$ for any two functions $f_1$ and $f_2$.
2.) If I can show that $\log(f_1) = \mathcal{O}(x)$, then $f_1 = e^{\mathcal{O}(x)} = \mathcal{O}(e^x)$
The first seems true because the definition of Big O puts the function in absolute value brackets. i.e. $$f(x) = \mathcal{O}(g(x))$$ If and only if $$ \vert f(x)\vert \leq M g(x) \text{ } \{ x\geq x_o \forall_x, M \in \mathbb{R^+}\}$$ The second is the one I am having a harder time coming to a conclusion about.