Growth of Functions - Big Theta

Click For Summary
SUMMARY

The discussion confirms that if \( f(x) \) is big-theta of \( g(x) \), then \( g(x) \) is also big-theta of \( f(x) \). This is established through the definition of big-theta, which states that there exist positive constants \( C_1 \) and \( C_2 \) such that \( C_1g(x) \leq f(x) \leq C_2g(x) \) for sufficiently large \( x \). The conversation also highlights that the symmetry holds true primarily for nonnegative functions, while the behavior of negative functions requires careful consideration of the definition used. References to Wikipedia and a specific PDF document provide additional context on the properties of big-theta notation.

PREREQUISITES
  • Understanding of asymptotic notation, specifically big-theta (Θ).
  • Familiarity with limits and bounding functions in mathematical analysis.
  • Knowledge of algorithm analysis and its reliance on nonnegative functions.
  • Basic comprehension of mathematical inequalities and their implications.
NEXT STEPS
  • Study the formal definition of big-theta notation in algorithm analysis.
  • Learn about the properties of asymptotic notations, including big-O and big-Ω.
  • Explore the implications of negative functions in asymptotic analysis.
  • Review mathematical proofs involving limits and bounding functions.
USEFUL FOR

Mathematicians, computer scientists, and software engineers involved in algorithm analysis and performance optimization will benefit from this discussion, particularly those interested in the nuances of asymptotic notation.

Lepros
Messages
3
Reaction score
0
If f(x) if big-theta of g(x), is it also always the case then that g(x) is big-theta of f(x)?
 
Technology news on Phys.org
Affirmative. (The forum requires a 5-character minimum reply, so I could not just answer "yes".)
 
Evgeny.Makarov said:
Affirmative. (The forum requires a 5-character minimum reply, so I could not just answer "yes".)

Changed to 3. Now you can write "No." or "Yes."
 
Evgeny.Makarov said:
Affirmative. (The forum requires a 5-character minimum reply, so I could not just answer "yes".)
Why ?
 
Well, $f(x)=\Theta(g(x))$ means that from some $x_0$ forward and for some positive constants $C_1$ and $C_2$ we have $C_1g(x)\le f(x)\le C_2g(x)$. From this it is clear that $g(x)$ can be similarly bounded by $f(x)$, at least when $f(x)$ and $g(x)$ are (eventually) nonnegative.
 
But how can you write the double inequality ? We know it's okay if we consider absolute values, but if for example $\forall x>x_0~,~f(x)<0~\text{and}~g(x)>0,~\text{while}~C|f(x)|>g(x)$, what would happen ?

Another equivalent definition (or almost) is that limsup |f/g| < infinity, but if it's 0, couldn't there be a problem ?

I'm basing all this on the wikipedia, so please excuse my ignorance :DThis document ( http://courses.cs.vt.edu/~cs2604/Summer2000/Notes/C03.Asymptotics.pdf ) covers quite a lot of properties related to the big theta. But none of them talk about the equivalence...
 
Last edited:
In the Wikipedia page about Big O notation, the definition of $\Theta$ does not involve absolute values, so the relation $f(x)=\Theta(g(x))$ is symmetric. In the PDF document you provided, $\Theta$ is defined only for nonnegative functions. In my experience, $\Theta$ is most often used in algorithm analysis, where resources are usually nonnegative.

For functions that can be negative, the answer depends on the details of the definition of $\Theta$. If it means $C_1|g(x)|\le |f(x)|\le C_2|g(x)|$, then again the relation is symmetric. If it means $C_1g(x)\le |f(x)|\le C_2g(x)$, then, as you say, it does not follow that $|g(x)|\le 1/C_1\cdot f(x)$.
 
Evgeny.Makarov said:
-
Sorry, I was considering big O and not big theta :( I thought there were the same :(
 

Similar threads

  • · Replies 14 ·
Replies
14
Views
4K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 15 ·
Replies
15
Views
2K
  • · Replies 14 ·
Replies
14
Views
2K
Replies
2
Views
1K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 6 ·
Replies
6
Views
2K
  • · Replies 4 ·
Replies
4
Views
623
  • · Replies 3 ·
Replies
3
Views
2K