Limit superior and limit inferior

From Wikipedia, the free encyclopedia

(Redirected from Liminf)
Jump to: navigation, search
An illustration of limit superior and limit inferior. The sequence xn is shown in blue. The two red curves approach the limit superior and limit inferior of xn, shown as solid red lines to the right.
An illustration of limit superior and limit inferior. The sequence xn is shown in blue. The two red curves approach the limit superior and limit inferior of xn, shown as solid red lines to the right.

In mathematics, the limit inferior and limit superior (also called infimum limit and supremum limit, or liminf and limsup) of a sequence can be thought of as limiting (i.e., eventual and extreme) bounds on the sequence. The limit inferior and limit superior of a function can be thought of in a similar fashion. (See limit of a function.) The limit inferior and limit superior of a set is the infimum and supremum of the set's limit points respectively.

Contents

The limit inferior of a sequence (xn) is defined as

\liminf_{n\rightarrow\infty}x_n=\sup_{n\geq 0}\,\inf_{m\geq n}x_m=\sup\{\,\inf\{\,x_m:m\geq n\,\}:n\geq 0\,\}

or

\liminf_{n\rightarrow\infty}x_n=\lim_{n\rightarrow\infty}\Big(\inf_{m\geq n}x_m\Big).

Similarly, the limit superior of (xn) is defined as

\limsup_{n\rightarrow\infty}x_n=\inf_{n\geq 0}\,\sup_{m\geq n}x_m=\inf\{\,\sup\{\,x_m:m\geq n\,\}:n\geq 0\,\}

or

\limsup_{n\rightarrow\infty}x_n=\lim_{n\rightarrow\infty}\Big(\sup_{m\geq n}x_m\Big).

If the terms in the sequence are real numbers, the limit superior and limit inferior always exist, as real numbers or ±∞. More generally, these definitions make sense in any partially ordered set, provided the suprema and infima exist, such as in a complete lattice.

Whenever the ordinary limit exists, the limit inferior and limit superior are both equal to it; therefore, each can be considered a generalization of the ordinary limit which is primarily interesting in cases where the limit does not exist. Whenever lim inf xn and lim sup xn both exist, we have

\liminf_{n\rightarrow\infty}x_n\leq\limsup_{n\rightarrow\infty}x_n.

Limits inferior/superior are related to big-O notation in that they bound a sequence only "in the limit"; the sequence may exceed the bound. However, with big-O notation the sequence can only exceed the bound in a finite prefix of the sequence, whereas the limit superior of a sequence like e-n may actually be less than all elements of the sequence. The only promise made is that some tail of the sequence can be bounded by the limit superior (inferior) plus (minus) an arbitrarily small positive constant.

The limit superior and limit inferior of a sequence are a special case of those of a function, see below.

In mathematical analysis, limit superior and limit inferior are important tools for studying sequences of real numbers. In order to deal with the difficulties arising from the fact that the supremum and infimum of a set of real numbers may not exist (the reals are not a complete lattice), it is convenient to consider sequences in the affinely extended real number system: we add the positive and negative infinities to the real line to give the complete totally ordered set [-∞,∞], which is a complete lattice.

Consider a sequence (xn) consisting of real numbers. Assume that the limit superior and limit inferior are real numbers (so, not infinite).

  • The limit superior of xn is the smallest real number b such that, for any positive real number \varepsilon, there exists a natural number N such that x_n<b+\varepsilon for all n > N. In other words, any number larger than the limit superior is an eventual upper bound for the sequence. Only a finite number of elements of the sequence are greater than b+\varepsilon.
  • The limit inferior of xn is the largest real number b that, for any positive real number \varepsilon, there exists a natural number N such that x_n>b-\varepsilon for all n > N. In other words, any number below the limit inferior is an eventual lower bound for the sequence. Only a finite number of elements of the sequence are less than b-\varepsilon.

The relationship of limit inferior and limit superior for sequences of real numbers is as follows

-\liminf_{n\to\infty} x_n = \limsup_{n\to\infty} (-x_n).

As mentioned earlier, it is convenient to extend R to [-∞,∞]. Then, (xn) in [-∞,∞] converges if and only if

\liminf_{n\to\infty} x_n = \limsup_{n\to\infty} x_n,

in which case

\lim_{n\to\infty} x_n

is equal to their common value. (Note that when working just in R, convergence to -∞ or ∞ would not be considered as convergence.) Since the limit inferior is at most the limit superior, the condition

\liminf_{n\to\infty} x_n = \infty

implies that

\lim_{n\to\infty} x_n = \infty,

and the condition

\limsup_{n\to\infty} x_n = - \infty

implies that

\lim_{n\to\infty} x_n = - \infty.

As an example, consider the sequence given by xn = sin(n). Using the fact that pi is irrational, one can show that

\liminf_{n\to\infty} x_n = -1

and

\limsup_{n\to\infty} x_n = +1.

(This is because the sequence {1,2,3,...} is equidistributed mod 2π, a consequence of the Equidistribution theorem.)

If

I = \liminf_{n\to\infty} x_n

and

S = \limsup_{n\to\infty} x_n,

then the interval [I, S] need not contain any of the numbers xn, but every slight enlargement [I − ε, S + ε] (for arbitrarily small ε > 0) will contain xn for all but finitely many indices n. In fact, the interval [I, S] is the smallest closed interval with this property.

An example from number theory is

\liminf_{n\to\infty}(p_{n+1}-p_n),

where pn is the n-th prime number. The value of this limit inferior is conjectured to be 2 - this is the twin prime conjecture - but as yet has not even been proved finite. The corresponding limit superior is +\infty, because there are arbitrary gaps between consecutive primes.

Assume that a function is defined from a subset of the real numbers to the real numbers. As in the case for sequences, the limit inferior and limit superior are always well-defined if we allow the values +∞ and -∞; in fact, if both agree then the limit exists and is equal to their common value (again possibly including the infinities). For example, given f(x) = sin(1/x), we have lim supx0 f(x) = 1 and lim infx0 f(x) = -1. The difference between the two is a rough measure of how "wildly" the function oscillates, and in observation of this fact, it is called the oscillation of f at a. This idea of oscillation is sufficient to, for example, characterize Riemann-integrable functions as continuous except on a set of measure zero [1]. Note that points of nonzero oscillation (i.e., points at which f is "badly behaved") are discontinuities which, unless they make up a set of zero, are confined to a negligible set.

There is a notion of lim sup and lim inf for functions defined on a metric space whose relationship to limits of real-valued functions mirrors that of the relation between the lim sup, lim inf, and the limit of a real sequence. Take metric spaces X and Y, a subspace E contained in X, and function f: EY. Define for any limit point a of E:

\limsup_{x \to a} f(x) = \lim_{\varepsilon \to 0} \sup \{ f(x) : x \in E \cap B(a;\varepsilon) - \{a\} \}

and

\liminf_{x \to a} f(x) = \lim_{\varepsilon \to 0} \inf \{ f(x) : x \in E \cap B(a;\varepsilon) - \{a\} \}

where B(a;ε) denotes the metric ball of radius ε about a.

Note that as ε shrinks, the supremum of the function over the ball is monotone decreasing, so we have

\limsup_{x\to a} f(x)  = \inf_{\varepsilon > 0} (\sup \{ f(x) : x \in E \cap B(a;\varepsilon) - \{a\} \})

and similarly

\liminf_{x\to a} f(x) = \sup_{\varepsilon > 0}(\inf \{ f(x) : x \in E \cap B(a;\varepsilon) - \{a\} \}).

This finally motivates the definitions for general topological spaces. Take X, Y, E and a as before, but now let X and Y both be topological spaces. In this case, we replace metric balls with neighborhoods:

\limsup_{x\to a} f(x) = \inf \{ \sup \{ f(x) : x \in E \cap U - \{a\} \} :  U\ \mathrm{open}, a \in U, E \cap U - \{a\} \neq \emptyset  \}
\liminf_{x\to a} f(x) = \sup \{ \inf \{ f(x) : x \in E \cap U - \{a\} \} :  U\ \mathrm{open}, a \in U, E \cap U - \{a\} \neq \emptyset  \}

(there is a way to write the formula using a lim using nets and the neighborhood filter). This version is often useful in discussions of semi-continuity which crop up in analysis quite often. An interesting note is that this version subsumes the sequential version by considering sequences as functions from the natural numbers as a topological subspace of the extended real line, into the space (the closure of N in [-∞, ∞] is N ∪ {∞}.)

The power set P(X) of a set X is a complete lattice, and it is sometimes useful to consider limits superior and inferior of sequences in P(X), that is, sequences of subsets of X. If Xn is such a sequence, then an element a of X belongs to lim inf Xn if and only if there exists a natural number n0 such that a is in Xn for all n > n0. The element a belongs to lim sup Xn if and only if for every natural number n0 there exists an index n > n0 such that a is in Xn. In other words, lim sup Xn consists of those elements which are in Xn for infinitely many n, while lim inf Xn consists of those elements which are in Xn for all but finitely many n.

As an example, consider the sequence

\{0\},\{1\},\{0\},\{1\},\{0\},\{1\},\dots\,

whose superior limit is {0,1} but whose inferior limit is empty.

Using the standard parlance of set theory, the infimum of a sequence of sets is the countable intersection of the sets, the largest set included in all of the sets:

\inf\left\{\,x_n : n=1,2,3,\dots\,\right\}={\bigcap_{n=1}^\infty}x_n.

The sequence of In, n = 1, 2, 3, ..., where In is the infimum of set n, is non-decreasing, because InIn+1. Therefore, the countable union of infimum from 1 to n is equal to the nth infimum. Taking this sequence of sets to the limit:

\liminf_{n\rightarrow\infty}x_n={\bigcup_{n=1}^\infty}\left({\bigcap_{m=n}^\infty}x_m\right).

The limsup can be defined in a dual fashion. The supremum of a sequence of sets is the smallest set containing all the sets, i.e., the countable union of the sets.

\sup\left\{\,x_n : n=1,2,3,\dots\,\right\}={\bigcup_{n=1}^\infty}x_n.

The limsup is the countable intersection of this non-increasing (each supremum is a subset of the previous supremum) sequence of sets.

\limsup_{n\rightarrow\infty}x_n={\bigcap_{n=1}^\infty}\left({\bigcup_{m=n}^\infty}x_m\right).

See Borel-Cantelli lemma for an example.

The above definitions are inadequate for many technical applications. In fact, the definitions above are specializations of the following definitions.

The limit inferior of a set X is the infimum of all of the limit points of the set. That is,

\liminf X = \inf \{ x \in X : x \text{ is a limit point of } X \}\,

Similarly, the limit superior of a set X is the supremum of all of the limit points of the set. That is,

\limsup X = \sup \{ x \in X : x \text{ is a limit point of } X \}\,

Note that the set X needs to be defined as a subset of a partially ordered set that is also a topological space in order for these definitions to make sense. Moreover, it has to be a complete lattice, so that the suprema and infima always exist. In that case every set has a limit superior and a limit inferior. Also note that neither the limit inferior nor the limit superior of a set must be an element of the set.

Take a topological space X and a filter base B in that space. The set of all cluster points for that filter base is given by

\bigcap \{ \overline{B}_0 : B_0 \in B \}

where \overline{B}_0 is the closure of B0. This is clearly a closed set and is similar to the set of limit points of a set. Assume that X is also a partially ordered set. The limit superior of the filter base B is defined as

\limsup B = \sup \bigcap \{ \overline{B}_0 : B_0 \in B \}

when that supremum exists. When X has a total order, is a complete lattice and has the order topology,

\limsup B = \inf\{ \sup B_0 : B_0 \in B \}

Proof: Similarly, the limit inferior of the filter base B is defined as

\liminf B = \inf \bigcap \{ \overline{B}_0 : B_0 \in B \}

when that infimum exists; if X is totally ordered, is a complete lattice, and has the order topology, then

\liminf B = \sup\{ \inf B_0 : B_0 \in B \}

If the limit inferior and limit superior agree, then there must be exactly one cluster point and the limit of the filter base is equal to this unique cluster point.

Note that filter bases are generalizations of nets, which are generalizations of sequences. Therefore, these definitions give the limit inferior and limit superior of any net (and thus any sequence) as well. For example, take topological space X and the net (x_\alpha)_{\alpha \in A}, where (A,{\leq}) is a directed set and x_\alpha \in X for all \alpha \in A. The filter base ("of tails") generated by this net is B defined by

B \triangleq \{ \{ x_\alpha : \alpha_0 \leq \alpha \} : \alpha_0 \in A \}.\,

Therefore, the limit inferior and limit superior of the net are equal to the limit superior and limit inferior of B respectively. Similarly, for topological space X, take the sequence (xn) where x_n \in X for any n \in \mathbb{N} with \mathbb{N} being the set of natural numbers. The filter base ("of tails") generated by this sequence is C defined by

C \triangleq \{ \{ x_n : n_0 \leq n \} : n_0 \in \mathbb{N} \}.\,

Therefore, the limit inferior and limit superior of the sequence are equal to the limit superior and limit inferior of C respectively.

  • Amann, H.; Escher, Joachim (2005). Analysis. Basel; Boston: Birkhäuser. ISBN 0817671536. 
  • González, Mario O (1991). Classical complex analysis. New York: M. Dekker. ISBN 0824784154. 
Advanced Search
Included Web Search Engines


Safe Search

close

Top Matching Results

Occasionally Search.com will highlight specialized results that are based on the context of your query. Examples of specialized results include specific links to news, images, or video.

Top Matching Results may highlight information from other Search.com pages, content from the CNET Network of sites, or third party content. The listings are based purely on relevance. Search.com does not receive payment for listings in this section but our partners that provide this data may get paid for listing these products.

Sponsored Links

This section contains paid listings which have been purchased by companies that want to have their sites appear for specific search terms and related content. These listings are administered, sorted and maintained by a third party and are not endorsed by Search.com.

Search Results

Search.com sends your search query to several search engines at one time and integrates the results into one list which has been sorted by relevance using Search.com's proprietary algorithm. You can customize the list of search engines included in your metasearch from the preferences.

The search engines that are used in your metasearch may allow companies to pay to have their Web sites included within the results. To view the Paid Inclusion policy for a specific search engine, please visit their Web site. Search.com does not accept payment or share revenue with any search engine partner for listings in this section.