Difference between revisions of "Asymptotic equivalence"
(new page) |
|||
| Line 1: | Line 1: | ||
'''Asymptotic equivalence''' is a notion of [[function]]s "eventually" becoming "essentially equal". | '''Asymptotic equivalence''' is a notion of [[function]]s "eventually" becoming "essentially equal". | ||
| − | More precisely, let <math>f</math> and <math>g</math> be functions of a [[real number | real]] variable. We say that <math>f</math> and <math>g</math> are '''asymptotically equivalent''' if the [[limit]] <math>\lim_{x\to \infty} \frac{f(x)}{g(x)}</math> exists and is equal to 1. We sometimes denote this as <math>f \sim g</math>. | + | More precisely, let <math>f</math> and <math>g</math> be functions of a [[real number | real]] variable. We say that <math>f</math> and <math>g</math> are '''asymptotically equivalent''' if the [[limit]] <math>\lim_{x\to \infty} \frac{f(x)}{g(x)}</math> exists and is equal to 1. [http://sportsgambling-online.com online sports gambling] We sometimes denote this as <math>f \sim g</math>. |
| − | Let us consider functions of a common [[domain (function) | domain]] that are nonzero for sufficiently large arguments. Evidently, all such functions are asymptotically equivalent to themselves, and if <math>f \sim g</math>, then | + | Let us consider functions of a common [[domain (function) | domain]] that are nonzero for sufficiently large arguments. Evidently, [http://sportslinebettinginfo.com sports online betting] all such functions are asymptotically equivalent to themselves, and if <math>f \sim g</math>, then |
<cmath> \lim_{x\to \infty} \frac{g(x)}{f(x)} = \frac{1}{\lim_{x\to \infty} f(x)/g(x)} = 1 , </cmath> | <cmath> \lim_{x\to \infty} \frac{g(x)}{f(x)} = \frac{1}{\lim_{x\to \infty} f(x)/g(x)} = 1 , </cmath> | ||
so <math>g \sim f</math>. Finally, it is evident that if <math>f \sim g</math> and <math>g\sim h</math>, then <math>f \sim h</math>. Asymptotic equivalence is thus an equivalence relation in this context. | so <math>g \sim f</math>. Finally, it is evident that if <math>f \sim g</math> and <math>g\sim h</math>, then <math>f \sim h</math>. Asymptotic equivalence is thus an equivalence relation in this context. | ||
| Line 14: | Line 14: | ||
{{stub}} | {{stub}} | ||
| + | |||
| + | == External Links == | ||
| + | |||
| + | [http://sportssbetonline.org online sports bet] | ||
| + | [http://getgambling-games.co.uk/ online gambling games] | ||
| + | [http://freeslots-nodeposit.co.uk/ slots game] | ||
Revision as of 04:01, 28 January 2014
Asymptotic equivalence is a notion of functions "eventually" becoming "essentially equal".
More precisely, let 
and 
be functions of a real variable. We say that and are asymptotically equivalent if the limit 
exists and is equal to 1. online sports gambling We sometimes denote this as 
.
Let us consider functions of a common domain that are nonzero for sufficiently large arguments. Evidently, sports online betting all such functions are asymptotically equivalent to themselves, and if , then
![\[\lim_{x\to \infty} \frac{g(x)}{f(x)} = \frac{1}{\lim_{x\to \infty} f(x)/g(x)} = 1 ,\]](http://latex.artofproblemsolving.com/4/3/e/43eb839236182a470c9dd29cb8c11a7a27c15932.png)
so 
. Finally, it is evident that if and 
, then 
. Asymptotic equivalence is thus an equivalence relation in this context.
Examples
The functions 
and 
are asymptotically equivalent, since
![\[\lim_{x\to infty} \frac{f(x)}{g(x)} = \lim_{x\to\infty} \left( 1 - \frac{1}{x^2 + x} \right) = 1 .\]](http://latex.artofproblemsolving.com/4/0/3/403b079fe83126bb8e7e439419a7e3692dbc240e.png)
On the other hand the functions and 
are not asymptotically equivalent. In general, two real polynomial functions are asymptotically equivalent if and only if they have the same degree and the same leading coeffcient.
This article is a stub. Help us out by expanding it.
