Big-Theta, Big-O, Big-Omega in $Bbb{R}^n$.
up vote
1
down vote
favorite
Is the following statement true?
Let $ g : Bbb{R}^n to Bbb{R}^n $
$$ Theta_{(g)} = Omega_{(g)} cap O_{(g)} $$
asymptotics computer-science computational-complexity
add a comment |
up vote
1
down vote
favorite
Is the following statement true?
Let $ g : Bbb{R}^n to Bbb{R}^n $
$$ Theta_{(g)} = Omega_{(g)} cap O_{(g)} $$
asymptotics computer-science computational-complexity
Shouldn't it be an intersection on the right hand side?
– kodlu
Oct 25 at 8:19
Yes, you are right kodlu. Thank you for the suggestion.
– Carlos Uribe
Nov 16 at 13:14
add a comment |
up vote
1
down vote
favorite
up vote
1
down vote
favorite
Is the following statement true?
Let $ g : Bbb{R}^n to Bbb{R}^n $
$$ Theta_{(g)} = Omega_{(g)} cap O_{(g)} $$
asymptotics computer-science computational-complexity
Is the following statement true?
Let $ g : Bbb{R}^n to Bbb{R}^n $
$$ Theta_{(g)} = Omega_{(g)} cap O_{(g)} $$
asymptotics computer-science computational-complexity
asymptotics computer-science computational-complexity
edited Nov 16 at 13:13
asked Oct 25 at 4:00
Carlos Uribe
62
62
Shouldn't it be an intersection on the right hand side?
– kodlu
Oct 25 at 8:19
Yes, you are right kodlu. Thank you for the suggestion.
– Carlos Uribe
Nov 16 at 13:14
add a comment |
Shouldn't it be an intersection on the right hand side?
– kodlu
Oct 25 at 8:19
Yes, you are right kodlu. Thank you for the suggestion.
– Carlos Uribe
Nov 16 at 13:14
Shouldn't it be an intersection on the right hand side?
– kodlu
Oct 25 at 8:19
Shouldn't it be an intersection on the right hand side?
– kodlu
Oct 25 at 8:19
Yes, you are right kodlu. Thank you for the suggestion.
– Carlos Uribe
Nov 16 at 13:14
Yes, you are right kodlu. Thank you for the suggestion.
– Carlos Uribe
Nov 16 at 13:14
add a comment |
1 Answer
1
active
oldest
votes
up vote
0
down vote
The notation $f(n)=O(g(n))$ means that $|f|$ is bounded above by $g$ asymptotically. Formally,
$$
exists k>0quadexists n_0 in mathbb{N}quadforall ninmathbb{N}, n>n_0:quad|f(n)|leq kcdot g(n).
$$
Note that this implies that $f$ is also bounded above by $g$ asymptotically.
The notation $f(n)=Omega(g(n))$ means that $f$ is bounded below by $g$ asymptotically.
Formally,
$$
exists k>0quadexists n_0inmathbb{N}quadforall ninmathbb{N},n>n_0:quad f(n)geq kcdot g(n).
$$
The notation $f(n)=Theta(g(n))$ means that $f$ is bounded both above and below by $g$ asymptotically. Formally,
$$
exists k_1>0quadexists k_2>0quadexists n_0inmathbb{N}quadforall ninmathbb{N}, n>n_{0}:quad k_1cdot g(n)leq f(n)leq k_2cdot g(n).
$$
Note that if $f(n)=Theta(g(n))$, then both $f(n)=O(g(n))$ and $f(n)=Omega(g(n))$ hold, which means that
$$
Theta(g(n)) = O(g(n)) cap Omega(g(n)),
$$
by definition.
add a comment |
1 Answer
1
active
oldest
votes
1 Answer
1
active
oldest
votes
active
oldest
votes
active
oldest
votes
up vote
0
down vote
The notation $f(n)=O(g(n))$ means that $|f|$ is bounded above by $g$ asymptotically. Formally,
$$
exists k>0quadexists n_0 in mathbb{N}quadforall ninmathbb{N}, n>n_0:quad|f(n)|leq kcdot g(n).
$$
Note that this implies that $f$ is also bounded above by $g$ asymptotically.
The notation $f(n)=Omega(g(n))$ means that $f$ is bounded below by $g$ asymptotically.
Formally,
$$
exists k>0quadexists n_0inmathbb{N}quadforall ninmathbb{N},n>n_0:quad f(n)geq kcdot g(n).
$$
The notation $f(n)=Theta(g(n))$ means that $f$ is bounded both above and below by $g$ asymptotically. Formally,
$$
exists k_1>0quadexists k_2>0quadexists n_0inmathbb{N}quadforall ninmathbb{N}, n>n_{0}:quad k_1cdot g(n)leq f(n)leq k_2cdot g(n).
$$
Note that if $f(n)=Theta(g(n))$, then both $f(n)=O(g(n))$ and $f(n)=Omega(g(n))$ hold, which means that
$$
Theta(g(n)) = O(g(n)) cap Omega(g(n)),
$$
by definition.
add a comment |
up vote
0
down vote
The notation $f(n)=O(g(n))$ means that $|f|$ is bounded above by $g$ asymptotically. Formally,
$$
exists k>0quadexists n_0 in mathbb{N}quadforall ninmathbb{N}, n>n_0:quad|f(n)|leq kcdot g(n).
$$
Note that this implies that $f$ is also bounded above by $g$ asymptotically.
The notation $f(n)=Omega(g(n))$ means that $f$ is bounded below by $g$ asymptotically.
Formally,
$$
exists k>0quadexists n_0inmathbb{N}quadforall ninmathbb{N},n>n_0:quad f(n)geq kcdot g(n).
$$
The notation $f(n)=Theta(g(n))$ means that $f$ is bounded both above and below by $g$ asymptotically. Formally,
$$
exists k_1>0quadexists k_2>0quadexists n_0inmathbb{N}quadforall ninmathbb{N}, n>n_{0}:quad k_1cdot g(n)leq f(n)leq k_2cdot g(n).
$$
Note that if $f(n)=Theta(g(n))$, then both $f(n)=O(g(n))$ and $f(n)=Omega(g(n))$ hold, which means that
$$
Theta(g(n)) = O(g(n)) cap Omega(g(n)),
$$
by definition.
add a comment |
up vote
0
down vote
up vote
0
down vote
The notation $f(n)=O(g(n))$ means that $|f|$ is bounded above by $g$ asymptotically. Formally,
$$
exists k>0quadexists n_0 in mathbb{N}quadforall ninmathbb{N}, n>n_0:quad|f(n)|leq kcdot g(n).
$$
Note that this implies that $f$ is also bounded above by $g$ asymptotically.
The notation $f(n)=Omega(g(n))$ means that $f$ is bounded below by $g$ asymptotically.
Formally,
$$
exists k>0quadexists n_0inmathbb{N}quadforall ninmathbb{N},n>n_0:quad f(n)geq kcdot g(n).
$$
The notation $f(n)=Theta(g(n))$ means that $f$ is bounded both above and below by $g$ asymptotically. Formally,
$$
exists k_1>0quadexists k_2>0quadexists n_0inmathbb{N}quadforall ninmathbb{N}, n>n_{0}:quad k_1cdot g(n)leq f(n)leq k_2cdot g(n).
$$
Note that if $f(n)=Theta(g(n))$, then both $f(n)=O(g(n))$ and $f(n)=Omega(g(n))$ hold, which means that
$$
Theta(g(n)) = O(g(n)) cap Omega(g(n)),
$$
by definition.
The notation $f(n)=O(g(n))$ means that $|f|$ is bounded above by $g$ asymptotically. Formally,
$$
exists k>0quadexists n_0 in mathbb{N}quadforall ninmathbb{N}, n>n_0:quad|f(n)|leq kcdot g(n).
$$
Note that this implies that $f$ is also bounded above by $g$ asymptotically.
The notation $f(n)=Omega(g(n))$ means that $f$ is bounded below by $g$ asymptotically.
Formally,
$$
exists k>0quadexists n_0inmathbb{N}quadforall ninmathbb{N},n>n_0:quad f(n)geq kcdot g(n).
$$
The notation $f(n)=Theta(g(n))$ means that $f$ is bounded both above and below by $g$ asymptotically. Formally,
$$
exists k_1>0quadexists k_2>0quadexists n_0inmathbb{N}quadforall ninmathbb{N}, n>n_{0}:quad k_1cdot g(n)leq f(n)leq k_2cdot g(n).
$$
Note that if $f(n)=Theta(g(n))$, then both $f(n)=O(g(n))$ and $f(n)=Omega(g(n))$ hold, which means that
$$
Theta(g(n)) = O(g(n)) cap Omega(g(n)),
$$
by definition.
answered yesterday
user153012
6,21822277
6,21822277
add a comment |
add a comment |
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f2970085%2fbig-theta-big-o-big-omega-in-bbbrn%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Shouldn't it be an intersection on the right hand side?
– kodlu
Oct 25 at 8:19
Yes, you are right kodlu. Thank you for the suggestion.
– Carlos Uribe
Nov 16 at 13:14