# Definition:Asymptotically Equal

(Redirected from Definition:Asymptotic Equivalence)

Jump to navigation
Jump to search
## Contents

## Definition

### Sequences

Let $b_n \ne 0$ for all $n$.

$\sequence {a_n}$ is **asymptotically equal** to $\sequence {b_n}$ if and only if:

- $\displaystyle \lim_{n \to \infty} \dfrac {a_n} {b_n} \to 1$

### Functions

Let $f$ and $g$ real functions defined on $\R$.

Then:

**$f$ is asymptotically equal to $g$**

- $\dfrac {f \left({x}\right)} {g \left({x}\right)} \to 1$ as $x \to +\infty$.

That is, the larger the $x$, the closer $f$ gets (relatively) to $g$.

### General Definition

Let $T = \left({S, \tau}\right)$ be a topological space.

Let $V$ be a normed vector space over $\R$ or $\C$ with norm $\left\Vert{\, \cdot \,}\right\Vert$.

Let $f, g: S \to V$ be mappings.

Let $x_0 \in X$.

Then:

- $f$ is
**asymptotically equal**to $g$ as $x \to x_0$

- $f - g = o \left({g}\right)$ as $x \to x_0$

where $o$ denotes little-O notation.

## Notation

The notation $a_n \sim b_n$ and $f \sim g$ is frequently seen to denote asymptotic equality.

## Also known as

If $f \sim g$, then $f$ and $g$ are also said to be **asymptotically equivalent**.

## Also see

- Results about
**Asymptotic Notation**can be found here.

## Sources

- 1994: H.E. Rose:
*A Course in Number Theory*(2nd ed.) ... (previous) ... (next): Preface to first edition: Prerequisites