MHB Upper Bounds and Tight Upper Bounds

  • Thread starter Thread starter Sudharaka
  • Start date Start date
  • Tags Tags
    Bounds
Click For Summary
A tight upper bound, often represented as Θ, refers to a function that asymptotically matches the growth rate of another function, such as f(n) = n^3 + 2n^2, which has a tight upper bound of Θ(n^3). This is distinct from the supremum or least upper bound, as the function can increase indefinitely. In contrast, O(n^4) serves as an asymptotic upper bound, while Ω(n) represents an asymptotic lower bound. A tight bound effectively captures both upper and lower asymptotic behaviors. Understanding these distinctions clarifies the concept of tight upper bounds in mathematical analysis.
Sudharaka
Gold Member
MHB
Messages
1,558
Reaction score
1
Hi everyone, :)

What is a Tight Upper Bound? Is it the least upper bound? But then tight upper bound will be equivalent to the supremum. :confused:
 
Mathematics news on Phys.org
Sudharaka said:
Hi everyone, :)

What is a Tight Upper Bound? Is it the least upper bound? But then tight upper bound will be equivalent to the supremum. :confused:

Hi! :)

I think you are talking about the $\Theta$ bound.

It's a different type of bound.

Suppose we have the function $f(n) = n^3 + 2n^2$.
Its tight upper bound is $\Theta(n^3)$.
This is not a supremum (or least upper bound), since the function doesn't have one - it goes up to infinity.
The point it that it goes up asymptotically with $n^3$.

For instance $O(n^4)$ is an asymptotic upper bound, while $\Omega(n)$ is an asymptotic lower bound.
A tight bound is one that is both.
 
I like Serena said:
Hi! :)

I think you are talking about the $\Theta$ bound.

It's a different type of bound.

Suppose we have the function $f(n) = n^3 + 2n^2$.
Its tight upper bound is $\Theta(n^3)$.
This is not a supremum (or least upper bound), since the function doesn't have one - it goes up to infinity.
The point it that it goes up asymptotically with $n^3$.

For instance $O(n^4)$ is an asymptotic upper bound, while $\Omega(n)$ is an asymptotic lower bound.
A tight bound is one that is both.

Thanks much. That makes perfect sense now. :)
 
Thread 'Erroneously  finding discrepancy in transpose rule'
Obviously, there is something elementary I am missing here. To form the transpose of a matrix, one exchanges rows and columns, so the transpose of a scalar, considered as (or isomorphic to) a one-entry matrix, should stay the same, including if the scalar is a complex number. On the other hand, in the isomorphism between the complex plane and the real plane, a complex number a+bi corresponds to a matrix in the real plane; taking the transpose we get which then corresponds to a-bi...

Similar threads

  • · Replies 8 ·
Replies
8
Views
5K
  • · Replies 6 ·
Replies
6
Views
3K
Replies
11
Views
2K
Replies
4
Views
1K
  • · Replies 13 ·
Replies
13
Views
2K
  • · Replies 17 ·
Replies
17
Views
2K
  • · Replies 11 ·
Replies
11
Views
1K
  • · Replies 3 ·
Replies
3
Views
5K
Replies
2
Views
2K
  • · Replies 9 ·
Replies
9
Views
3K