Open main menu
Home
Random
Recent changes
Special pages
Community portal
Preferences
About Wikipedia
Disclaimers
Incubator escapee wiki
Search
User menu
Talk
Dark mode
Contributions
Create account
Log in
Editing
Limit of a sequence
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
{{Short description|Value to which tends an infinite sequence}} {{For|the general mathematical concept|Limit (mathematics)}} {{more citations needed|date=May 2017}} [[File:Archimedes pi.svg|350px|right|thumb|alt=diagram of a hexagon and pentagon circumscribed outside a circle|The sequence given by the perimeters of regular ''n''-sided [[polygon]]s that [[circumscribe]] the [[unit circle]] has a limit equal to the perimeter of the circle, i.e. <math>2\pi</math>. The corresponding sequence for inscribed polygons has the same limit.]] <div class="thumb tright"> <div class="thumbinner" style="width:252px;"> <div style="width:240px; font-family:arial; font-size:12px; font-weight:bold; background:#fff;"> {| class="wikitable" style="width:100%;" |- !<math>n</math>!!<math>n\times \sin\left(\tfrac1{n}\right)</math> |- |1||0.841471 |- |2||0.958851 |- |colspan="2"|... |- |10||0.998334 |- |colspan="2"|... |- |100||0.999983 |} </div> <div class="thumbcaption"> As the positive [[integer]] <math display="inline">n</math> becomes larger and larger, the value <math display="inline">n\times \sin\left(\tfrac1{n}\right)</math> becomes arbitrarily close to <math display="inline">1</math>. We say that "the limit of the sequence <math display="inline">n \times \sin\left(\tfrac1{n}\right)</math> equals <math display="inline">1</math>." </div> </div> </div> In [[mathematics]], the '''limit of a sequence''' is the value that the terms of a [[sequence]] "tend to", and is often denoted using the <math>\lim</math> symbol (e.g., <math>\lim_{n \to \infty}a_n</math>).<ref name="Courant (1961), p. 29">Courant (1961), p. 29.</ref> If such a limit exists and is finite, the sequence is called '''convergent'''.<ref>{{Cite web|last=Weisstein|first=Eric W.|title=Convergent Sequence|url=https://mathworld.wolfram.com/ConvergentSequence.html|access-date=2020-08-18|website=mathworld.wolfram.com|language=en}}</ref> A sequence that does not converge is said to be '''divergent'''.<ref>Courant (1961), p. 39.</ref> The limit of a sequence is said to be the fundamental notion on which the whole of [[mathematical analysis]] ultimately rests.<ref name="Courant (1961), p. 29"/> Limits can be defined in any [[metric space|metric]] or [[topological space]], but are usually first encountered in the [[real number]]s. ==History== The Greek philosopher [[Zeno of Elea]] is famous for formulating [[Zeno's paradoxes|paradoxes that involve limiting processes]]. [[Leucippus]], [[Democritus]], [[Antiphon (person)|Antiphon]], [[Eudoxus of Cnidus|Eudoxus]], and [[Archimedes]] developed the [[method of exhaustion]], which uses an infinite sequence of approximations to determine an area or a volume. Archimedes succeeded in summing what is now called a [[geometric series]]. [[Grégoire de Saint-Vincent]] gave the first definition of limit (terminus) of a [[geometric series]] in his work ''Opus Geometricum'' (1647): "The ''terminus'' of a progression is the end of the series, which none progression can reach, even not if she is continued in infinity, but which she can approach nearer than a given segment."<ref>Van Looy, H. (1984). A chronology and historical analysis of the mathematical manuscripts of Gregorius a Sancto Vincentio (1584–1667). Historia Mathematica, 11(1), 57-75.</ref> [[Pietro Mengoli]] anticipated the modern idea of limit of a sequence with his study of quasi-proportions in ''Geometriae speciosae elementa'' (1659). He used the term ''quasi-infinite'' for [[Unbounded function|unbounded]] and ''quasi-null'' for [[Vanishing function|vanishing]]. [[Isaac Newton|Newton]] dealt with series in his works on ''Analysis with infinite series'' (written in 1669, circulated in manuscript, published in 1711), ''Method of fluxions and infinite series'' (written in 1671, published in English translation in 1736, Latin original published much later) and ''Tractatus de Quadratura Curvarum'' (written in 1693, published in 1704 as an Appendix to his ''Optiks''). In the latter work, Newton considers the binomial expansion of <math display="inline">(x+o)^n</math>, which he then linearizes by ''taking the limit'' as <math display="inline">o</math> tends to <math display="inline">0</math>. In the 18th century, [[mathematician]]s such as [[Leonhard Euler|Euler]] succeeded in summing some ''divergent'' series by stopping at the right moment; they did not much care whether a limit existed, as long as it could be calculated. At the end of the century, [[Joseph-Louis Lagrange|Lagrange]] in his ''Théorie des fonctions analytiques'' (1797) opined that the lack of rigour precluded further development in calculus. [[Carl Friedrich Gauss|Gauss]] in his study of [[hypergeometric series]] (1813) for the first time rigorously investigated the conditions under which a series converged to a limit. The modern definition of a limit (for any <math display="inline">\varepsilon</math> there exists an index <math display="inline">N</math> so that ...) was given by [[Bernard Bolzano]] (''Der binomische Lehrsatz'', Prague 1816, which was little noticed at the time), and by [[Karl Weierstrass]] in the 1870s. ==Real numbers== [[File:Converging Sequence example.svg|320px|thumb|The plot of a convergent sequence {''a<sub>n</sub>''} is shown in blue. Here, one can see that the sequence is converging to the limit 0 as ''n'' increases.]] In the [[real numbers]], a number <math>L</math> is the '''limit''' of the [[sequence]] <math>(x_n)</math>, if the numbers in the sequence become closer and closer to <math>L</math>, and not to any other number. ===Examples=== {{see also|List of limits}} *If <math>x_n = c</math> for constant <math display="inline">c</math>, then <math>x_n \to c</math>.<ref group="proof">''Proof'': Choose <math>N = 1</math>. For every <math>n \geq N</math>, <math>|x_n - c| = 0 < \varepsilon</math></ref><ref name=":0">{{Cite web|title=Limits of Sequences {{!}} Brilliant Math & Science Wiki|url=https://brilliant.org/wiki/limits-of-sequences/|access-date=2020-08-18|website=brilliant.org|language=en-us}}</ref> *If <math>x_n = \frac{1}{n}</math>, then <math>x_n \to 0</math>.<ref group="proof">''Proof'': Choose an integer <math>N > \frac{1}{\varepsilon}.</math> For every <math>n \geq N</math>, one has <math>|x_n - 0| =\frac 1n \le \frac 1N < \varepsilon</math>.</ref><ref name=":0" /> *If <math>x_n = \frac{1}{n}</math> when <math>n</math> is even, and <math>x_n = \frac{1}{n^2}</math> when <math>n</math> is odd, then <math>x_n \to 0</math>. (The fact that <math>x_{n+1} > x_n</math> whenever <math>n</math> is odd is irrelevant.) *Given any real number, one may easily construct a sequence that converges to that number by taking decimal approximations. For example, the sequence <math display="inline">0.3, 0.33, 0.333, 0.3333, \dots</math> converges to <math display="inline">\frac{1}{3}</math>. The [[decimal representation]] <math display="inline">0.3333\dots</math> is the ''limit'' of the previous sequence, defined by <math display="block"> 0.3333... : = \lim_{n\to\infty} \sum_{k=1}^n \frac{3}{10^k}</math> *Finding the limit of a sequence is not always obvious. Two examples are <math>\lim_{n\to\infty} \left(1 + \tfrac{1}{n}\right)^n</math> (the limit of which is the [[e (mathematical constant)|number ''e'']]) and the [[arithmetic–geometric mean]]. The [[squeeze theorem]] is often useful in the establishment of such limits. ===Definition=== We call <math>x</math> the '''limit''' of the [[sequence]] <math>(x_n)</math>, which is written :<math>x_n \to x</math>, or :<math>\lim_{n\to\infty} x_n = x</math>, if the following condition holds: :For each [[real number]] <math>\varepsilon > 0</math>, there exists a [[natural number]] <math>N</math> such that, for every natural number <math>n \geq N</math>, we have <math>|x_n - x| < \varepsilon</math>.<ref>{{Cite web| last=Weisstein|first=Eric W.| title=Limit|url=https://mathworld.wolfram.com/Limit.html|access-date=2020-08-18| website=mathworld.wolfram.com|language=en}}</ref> In other words, for every measure of closeness <math>\varepsilon</math>, the sequence's terms are eventually that close to the limit. The sequence <math>(x_n)</math> is said to '''converge to''' or '''tend to''' the limit <math>x</math>. Symbolically, this is: :<math>\forall \varepsilon > 0 \left(\exists N \in \N \left(\forall n \in \N \left(n \geq N \implies |x_n - x| < \varepsilon \right)\right)\right)</math>. {{anchor|null sequence}} If a sequence <math>(x_n)</math> converges to some limit <math>x</math>, then it is '''convergent''' and <math>x</math> is the only limit; otherwise <math>(x_n)</math> is '''divergent'''. A sequence that has zero as its limit is sometimes called a '''null sequence'''. === Illustration === <gallery widths="350" heights="200"> File:Folgenglieder im KOSY.svg|Example of a sequence which converges to the limit <math>a</math>|alt=Example of a sequence which converges to the limit <nowiki> </nowiki> a <nowiki> </nowiki> {\displaystyle a} . File:Epsilonschlauch.svg|Regardless which <math>\varepsilon > 0</math> we have, there is an index <math>N_0</math>, so that the sequence lies afterwards completely in the epsilon tube <math>(a-\varepsilon,a+\varepsilon)</math>. File:Epsilonschlauch klein.svg|There is also for a smaller <math>\varepsilon_1 > 0</math> an index <math>N_1</math>, so that the sequence is afterwards inside the epsilon tube <math>(a-\varepsilon_1,a+\varepsilon_1)</math>. File:Epsilonschlauch2.svg|For each <math>\varepsilon > 0</math> there are only finitely many sequence members outside the epsilon tube. </gallery> ===Properties=== Some other important properties of limits of real sequences include the following: *When it exists, the limit of a sequence is unique.<ref name=":0" /> *Limits of sequences behave well with respect to the usual [[Arithmetic#Arithmetic operations|arithmetic operations]]. If <math>\lim_{n\to\infty} a_n</math> and <math>\lim_{n\to\infty} b_n</math> exists, then ::<math>\lim_{n\to\infty} (a_n \pm b_n) = \lim_{n\to\infty} a_n \pm \lim_{n\to\infty} b_n</math><ref name=":0" /> ::<math>\lim_{n\to\infty} c a_n = c \cdot \lim_{n\to\infty} a_n</math><ref name=":0" /> ::<math>\lim_{n\to\infty} (a_n \cdot b_n) = \left(\lim_{n\to\infty} a_n \right)\cdot \left( \lim_{n\to\infty} b_n \right)</math><ref name=":0" /> ::<math>\lim_{n\to\infty} \left(\frac{a_n}{b_n}\right) = \frac{\lim\limits_{n\to\infty} a_n}{\lim\limits_{n\to\infty} b_n}</math> provided <math>\lim_{n\to\infty} b_n \ne 0</math><ref name=":0" /> ::<math>\lim_{n\to\infty} a_n^p = \left( \lim_{n\to\infty} a_n \right)^p</math> *For any [[continuous function]] <math display="inline">f</math>, if <math>\lim_{n\to\infty}x_n</math> exists, then <math>\lim_{n\to\infty} f \left(x_n \right)</math> exists too. In fact, any real-valued [[function (mathematics)|function]] ''<math display="inline">f</math>'' is continuous if and only if it preserves the limits of sequences (though this is not necessarily true when using more general notions of continuity). *If <math>a_n \leq b_n</math> for all <math>n</math> greater than some <math>N</math>, then <math>\lim_{n\to\infty} a_n \leq \lim_{n\to\infty} b_n</math>. *([[Squeeze theorem]]) If <math>a_n \leq c_n \leq b_n</math> for all <math>n</math> greater than some <math>N</math>, and <math>\lim_{n\to\infty} a_n = \lim_{n\to\infty} b_n = L</math>, then <math>\lim_{n\to\infty} c_n = L</math>. *([[Monotone convergence theorem]]) If <math>a_n</math> is [[Sequence#Bounded|bounded]] and [[Sequence#Increasing and decreasing|monotonic]] for all <math>n</math> greater than some <math>N</math>, then it is convergent. *A sequence is convergent if and only if every subsequence is convergent. *If every subsequence of a sequence has its own subsequence which converges to the same point, then the original sequence converges to that point. These properties are extensively used to prove limits, without the need to directly use the cumbersome formal definition. For example, once it is proven that <math>1/n \to 0</math>, it becomes easy to show—using the properties above—that <math>\frac{a}{b+\frac{c}{n}} \to \frac{a}{b}</math> (assuming that <math>b \ne 0</math>). ===Infinite limits=== A sequence <math>(x_n)</math> is said to '''tend to infinity''', written :<math>x_n \to \infty</math>, or :<math>\lim_{n\to\infty}x_n = \infty</math>, if the following holds: :For every real number <math>K</math>, there is a natural number <math>N</math> such that for every natural number <math>n \geq N</math>, we have <math>x_n > K</math>; that is, the sequence terms are eventually larger than any fixed <math>K</math>. Symbolically, this is: :<math>\forall K \in \mathbb{R} \left(\exists N \in \N \left(\forall n \in \N \left(n \geq N \implies x_n > K \right)\right)\right)</math>. Similarly, we say a sequence '''tends to minus infinity''', written :<math>x_n \to -\infty</math>, or :<math>\lim_{n\to\infty}x_n = -\infty</math>, if the following holds: :For every real number <math>K</math>, there is a natural number <math>N</math> such that for every natural number <math>n \geq N</math>, we have <math>x_n < K</math>; that is, the sequence terms are eventually smaller than any fixed <math>K</math>. Symbolically, this is: :<math>\forall K \in \mathbb{R} \left(\exists N \in \N \left(\forall n \in \N \left(n \geq N \implies x_n < K \right)\right)\right)</math>. If a sequence tends to infinity or minus infinity, then it is divergent. However, a divergent sequence need not tend to plus or minus infinity, and the sequence <math>x_n=(-1)^n</math> provides one such example. ==Metric spaces== ===Definition=== A point <math>x</math> of the [[metric space]] <math>(X, d)</math> is the '''limit''' of the [[sequence]] <math>(x_n)</math> if: :For each [[real number]] <math>\varepsilon > 0</math>, there is a [[natural number]] <math>N</math> such that, for every natural number <math>n \geq N</math>, we have <math>d(x_n, x) < \varepsilon </math>. Symbolically, this is: :<math>\forall \varepsilon > 0 \left(\exists N \in \N \left(\forall n \in \N \left(n \geq N \implies d(x_n, x) < \varepsilon \right)\right)\right)</math>. This coincides with the definition given for real numbers when <math>X = \R</math> and <math>d(x, y) = |x-y|</math>. ===Properties=== *When it exists, the limit of a sequence is unique, as distinct points are separated by some positive distance, so for <math>\varepsilon </math> less than half this distance, sequence terms cannot be within a distance <math>\varepsilon </math> of both points. *For any [[continuous function]] ''f'', if <math>\lim_{n \to \infty} x_n</math> exists, then <math>\lim_{n \to \infty} f(x_n) = f\left(\lim_{n \to \infty}x_n \right)</math>. In fact, a [[Function (mathematics)|function]] ''f'' is continuous if and only if it preserves the limits of sequences. ===Cauchy sequences=== {{main|Cauchy sequence}} [[File:Cauchy sequence illustration.svg|350px|thumb| The plot of a Cauchy sequence (''x<sub>n</sub>''), shown in blue, as <math>x_n</math> versus ''n''. Visually, we see that the sequence appears to be converging to a limit point as the terms in the sequence become closer together as ''n'' increases. In the [[real numbers]] every Cauchy sequence converges to some limit.]] A Cauchy sequence is a sequence whose terms ultimately become arbitrarily close together, after sufficiently many initial terms have been discarded. The notion of a Cauchy sequence is important in the study of sequences in [[metric spaces]], and, in particular, in [[real analysis]]. One particularly important result in real analysis is the ''Cauchy criterion for convergence of sequences'': a sequence of real numbers is convergent if and only if it is a Cauchy sequence. This remains true in other [[complete metric space]]s. ==Topological spaces== ===Definition=== A point <math>x \in X</math> of the topological space <math>(X, \tau)</math> is a '''{{visible anchor|Limit of a sequence in a topological space|text=limit}}''' or '''{{visible anchor|Limit point of a sequence|text=limit point}}'''{{sfn|Dugundji|1966|pp=209-210}}{{sfn|Császár|1978|p=61}} of the [[sequence]] <math>\left(x_n\right)_{n \in \N}</math> if: :For every [[Topological neighbourhood|neighbourhood]] <math>U</math> of <math>x</math>, there exists some <math>N \in \N</math> such that for every <math>n \geq N</math>, we have <math>x_n \in U</math>.<ref>{{cite book|last1=Zeidler|first1=Eberhard|title=Applied functional analysis : main principles and their applications|date=1995|publisher=Springer-Verlag|location=New York|isbn=978-0-387-94422-7|page=29|edition=1}}</ref> This coincides with the definition given for metric spaces, if <math>(X, d)</math> is a metric space and <math>\tau</math> is the topology generated by <math>d</math>. A limit of a sequence of points <math>\left(x_n\right)_{n \in \N}</math> in a topological space <math>T</math> is a special case of a [[Limit of a function#Functions on topological spaces|limit of a function]]: the [[Domain of a function|domain]] is <math>\N</math> in the space <math>\N \cup \lbrace + \infty \rbrace</math>, with the [[induced topology]] of the [[affinely extended real number system]], the [[Range of a function|range]] is <math>T</math>, and the function argument <math>n</math> tends to <math>+\infty</math>, which in this space is a [[Limit point of a set|limit point]] of <math>\N</math>. ===Properties=== In a [[Hausdorff space]], limits of sequences are unique whenever they exist. This need not be the case in non-Hausdorff spaces; in particular, if two points <math>x</math> and <math>y</math> are [[topologically indistinguishable]], then any sequence that converges to <math>x</math> must converge to <math>y</math> and vice versa. ==Hyperreal numbers== The definition of the limit using the [[hyperreal numbers]] formalizes the intuition that for a "very large" value of the index, the corresponding term is "very close" to the limit. More precisely, a real sequence <math>(x_n)</math> tends to ''L'' if for every infinite [[hypernatural]] <math display="inline">H</math>, the term <math>x_H</math> is infinitely close to <math display="inline">L</math> (i.e., the difference <math>x_H - L</math> is [[infinitesimal]]). Equivalently, ''L'' is the [[Standard part function|standard part]] of <math>x_H</math>: :<math> L = {\rm st}(x_H)</math>. Thus, the limit can be defined by the formula :<math>\lim_{n \to \infty} x_n= {\rm st}(x_H)</math>. where the limit exists if and only if the righthand side is independent of the choice of an infinite ''<math display="inline">H</math>''. ==Sequence of more than one index== Sometimes one may also consider a sequence with more than one index, for example, a double sequence <math>(x_{n, m})</math>. This sequence has a limit <math>L</math> if it becomes closer and closer to <math>L</math> when both ''n'' and ''m'' becomes very large. ===Example=== *If <math>x_{n, m} = c</math> for constant <math display="inline">c</math>, then <math>x_{n,m} \to c</math>. *If <math>x_{n, m} = \frac{1}{n + m}</math>, then <math>x_{n, m} \to 0</math>. *If <math>x_{n, m} = \frac{n}{n + m}</math>, then the limit does not exist. Depending on the relative "growing speed" of <math display="inline">n</math> and <math display="inline">m</math>, this sequence can get closer to any value between <math display="inline">0</math> and <math display="inline">1</math>. ===Definition=== We call <math>x</math> the '''double limit''' of the [[sequence]] <math>(x_{n, m})</math>, written :<math>x_{n, m} \to x</math>, or :<math>\lim_{\begin{smallmatrix} n \to \infty \\ m \to \infty \end{smallmatrix}} x_{n, m} = x</math>, if the following condition holds: :For each [[real number]] <math>\varepsilon > 0</math>, there exists a [[natural number]] <math>N</math> such that, for every pair of natural numbers <math>n, m \geq N</math>, we have <math>|x_{n, m} - x| < \varepsilon</math>.<ref name="Zakon">{{cite book|chapter=Chapter 4. Function Limits and Continuity|pages=223|title=Mathematical Anaylysis, Volume I|year=2011|last1=Zakon|first1=Elias|publisher=University of Windsor |isbn=9781617386473}}</ref> In other words, for every measure of closeness <math>\varepsilon</math>, the sequence's terms are eventually that close to the limit. The sequence <math>(x_{n, m})</math> is said to '''converge to''' or '''tend to''' the limit <math>x</math>. Symbolically, this is: :<math>\forall \varepsilon > 0 \left(\exists N \in \N \left(\forall n, m \in \N \left(n, m \geq N \implies |x_{n, m} - x| < \varepsilon \right)\right)\right) </math>. The double limit is different from taking limit in ''n'' first, and then in ''m''. The latter is known as [[iterated limit]]. Given that both the double limit and the iterated limit exists, they have the same value. However, it is possible that one of them exist but the other does not. ===Infinite limits=== A sequence <math>(x_{n,m})</math> is said to '''tend to infinity''', written :<math>x_{n,m} \to \infty</math>, or :<math>\lim_{\begin{smallmatrix} n \to \infty \\ m \to \infty \end{smallmatrix}}x_{n,m} = \infty</math>, if the following holds: :For every real number <math>K</math>, there is a natural number <math>N</math> such that for every pair of natural numbers <math>n,m \geq N</math>, we have <math>x_{n,m} > K</math>; that is, the sequence terms are eventually larger than any fixed <math>K</math>. Symbolically, this is: :<math>\forall K \in \mathbb{R} \left(\exists N \in \N \left(\forall n, m \in \N \left(n, m \geq N \implies x_{n, m} > K \right)\right)\right)</math>. Similarly, a sequence <math>(x_{n,m})</math> '''tends to minus infinity''', written :<math>x_{n,m} \to -\infty</math>, or :<math>\lim_{\begin{smallmatrix} n \to \infty \\ m \to \infty \end{smallmatrix}}x_{n,m} = -\infty</math>, if the following holds: :For every real number <math>K</math>, there is a natural number <math>N</math> such that for every pair of natural numbers <math>n,m \geq N</math>, we have <math>x_{n,m} < K</math>; that is, the sequence terms are eventually smaller than any fixed <math>K</math>. Symbolically, this is: :<math>\forall K \in \mathbb{R} \left(\exists N \in \N \left(\forall n, m \in \N \left(n, m \geq N \implies x_{n, m} < K \right)\right)\right)</math>. If a sequence tends to infinity or minus infinity, then it is divergent. However, a divergent sequence need not tend to plus or minus infinity, and the sequence <math>x_{n,m}=(-1)^{n+m}</math> provides one such example. ===Pointwise limits and uniform limits=== For a double sequence <math>(x_{n,m})</math>, we may take limit in one of the indices, say, <math>n \to \infty</math>, to obtain a single sequence <math>(y_m)</math>. In fact, there are two possible meanings when taking this limit. The first one is called '''pointwise limit''', denoted :<math>x_{n, m} \to y_m\quad \text{pointwise}</math>, or :<math>\lim_{n \to \infty} x_{n, m} = y_m\quad \text{pointwise}</math>, which means: :For each [[real number]] <math>\varepsilon > 0</math> and each fixed [[natural number]] <math>m</math>, there exists a natural number <math>N(\varepsilon, m) > 0</math> such that, for every natural number <math>n \geq N</math>, we have <math>|x_{n, m} - y_m| < \varepsilon</math>.<ref name="Habil">{{Cite web|url=https://www.researchgate.net/publication/242705642|date=2005|title=Double Sequences and Double Series|last=Habil|first=Eissa|language=en|access-date=2022-10-28}}</ref> Symbolically, this is: :<math>\forall \varepsilon > 0 \left( \forall m \in \mathbb{N} \left(\exists N \in \N \left(\forall n \in \N \left(n \geq N \implies |x_{n, m} - y_m| < \varepsilon \right)\right)\right)\right)</math>. When such a limit exists, we say the sequence <math>(x_{n, m})</math> [[pointwise convergence|converges pointwise]] to <math>(y_m)</math>. The second one is called '''uniform limit''', denoted :<math>x_{n, m} \to y_m \quad \text{uniformly}</math>, :<math>\lim_{n \to \infty} x_{n, m} = y_m \quad \text{uniformly}</math>, :<math>x_{n, m} \rightrightarrows y_m </math>, or :<math>\underset{n\to\infty}{\mathrm{unif} \lim} \; x_{n, m} = y_m </math>, which means: :For each [[real number]] <math>\varepsilon > 0</math>, there exists a natural number <math>N(\varepsilon) > 0</math> such that, for every [[natural number]] <math>m</math> and for every natural number <math>n \geq N</math>, we have <math>|x_{n, m} - y_m| < \varepsilon</math>.<ref name="Habil"/> Symbolically, this is: :<math>\forall \varepsilon > 0 \left(\exists N \in \N \left( \forall m \in \mathbb{N} \left(\forall n \in \N \left(n \geq N \implies |x_{n, m} - y_m| < \varepsilon \right)\right)\right)\right)</math>. In this definition, the choice of <math>N</math> is independent of <math>m</math>. In other words, the choice of <math>N</math> is ''uniformly applicable'' to all natural numbers <math>m</math>. Hence, one can easily see that uniform convergence is a stronger property than pointwise convergence: the existence of uniform limit implies the existence and equality of pointwise limit: :If <math>x_{n, m} \to y_m</math> uniformly, then <math>x_{n, m} \to y_m</math> pointwise. When such a limit exists, we say the sequence <math>(x_{n, m})</math> [[uniform convergence|converges uniformly]] to <math>(y_m)</math>. ===Iterated limit=== For a double sequence <math>(x_{n,m})</math>, we may take limit in one of the indices, say, <math>n \to \infty</math>, to obtain a single sequence <math>(y_m)</math>, and then take limit in the other index, namely <math>m \to \infty</math>, to get a number <math>y</math>. Symbolically, :<math>\lim_{m \to \infty} \lim_{n \to \infty} x_{n, m} = \lim_{m \to \infty} y_m = y</math>. This limit is known as '''[[iterated limit]]''' of the double sequence. The order of taking limits may affect the result, i.e., :<math>\lim_{m \to \infty} \lim_{n \to \infty} x_{n, m} \ne \lim_{n \to \infty} \lim_{m \to \infty} x_{n, m}</math> in general. A sufficient condition of equality is given by the [[Moore-Osgood theorem]], which requires the limit <math>\lim_{n \to \infty}x_{n, m} = y_m</math> to be uniform in <math display="inline">m</math>.<ref name="Zakon" /> ==See also== * [[Limit point]] * [[Subsequential limit]] * [[Limit superior and limit inferior]] * [[Limit of a function]] * [[Set-theoretic limit|Limit of a sequence of sets]] * [[Net (mathematics)#Limit of nets|Limit of a net]] * [[Pointwise convergence]] * [[Uniform convergence]] * [[Modes of convergence]] == Notes == {{reflist|group=note}} {{reflist}} ===Proofs=== {{reflist|group=proof}} ==References== * {{Császár General Topology}} <!-- {{sfn|Császár|1978|p=}} --> * {{Dugundji Topology}} <!-- {{sfn|Dugundji|1966|p=}} --> * [[Richard Courant|Courant, Richard]] (1961). "Differential and Integral Calculus Volume I", Blackie & Son, Ltd., Glasgow. * [[Frank Morley]] and [[James Harkness (mathematician)|James Harkness]] [https://archive.org/details/treatiseontheory00harkuoft A treatise on the theory of functions] (New York: Macmillan, 1893) ==External links== * {{springer|title=Limit|id=p/l058820}} * [https://web.archive.org/web/20040905075957/http://www-gap.dcs.st-and.ac.uk/~history/HistTopics/The_rise_of_calculus.html ''A history of the calculus'', including limits] {{Calculus topics}} [[Category:Limits (mathematics)]] [[Category:Sequences and series]]
Edit summary
(Briefly describe your changes)
By publishing changes, you agree to the
Terms of Use
, and you irrevocably agree to release your contribution under the
CC BY-SA 4.0 License
and the
GFDL
. You agree that a hyperlink or URL is sufficient attribution under the Creative Commons license.
Cancel
Editing help
(opens in new window)
Pages transcluded onto the current version of this page
(
help
)
:
Template:Anchor
(
edit
)
Template:Calculus topics
(
edit
)
Template:Cite book
(
edit
)
Template:Cite web
(
edit
)
Template:Császár General Topology
(
edit
)
Template:Dugundji Topology
(
edit
)
Template:For
(
edit
)
Template:Main
(
edit
)
Template:More citations needed
(
edit
)
Template:Reflist
(
edit
)
Template:See also
(
edit
)
Template:Sfn
(
edit
)
Template:Short description
(
edit
)
Template:Springer
(
edit
)
Template:Visible anchor
(
edit
)