Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

We say that $f(x) = O(g(x))$ if there exists a constant $C$ such that $|f(x)| \leq C|g(x)|$ for all $x \in \mathbb{R}$ (or whatever we take our domain to be). What is meant explicitly by the statement that $f(x)$ is not $O(g(x))$?

share|cite|improve this question
It is more usual to require $|f(x)|\le C|g(x)|$ only for $x$ in some (punctured) neighborhood of the limit we're considering. For example if the limit in $x\to+\infty$ then there must be $N$ and $C$ such that $|f(x)|\le C|g(x)|$ for $x>N$, and if it is $x\to 0$, then there must be $\varepsilon$ such that it holds for $|x|<\varepsilon$, $x\ne 0$. Otherwise we couldn't say that $\log x = O(x)$ for $x\to\infty$, for example. – Henning Makholm Nov 13 '11 at 0:25
up vote 1 down vote accepted

For any $C$, there exists a value of $x$ such that $|f(x)| \gt C|g(x)|$.

share|cite|improve this answer

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.