Limit: Difference between revisions

From Calculus
 
(54 intermediate revisions by the same user not shown)
Line 1: Line 1:
{{perspectives}}
{{perspectives}}
 
{{core term}}
==Motivation==
==Motivation==


Line 27: Line 27:


This interpretation is sometimes termed the "two finger test" where one finger is used to follow the graph for <math>x</math> slightly less than <math>c</math> and the other finger is used to follow the graph for <math>x</math> slightly greater than <math>c</math>.
This interpretation is sometimes termed the "two finger test" where one finger is used to follow the graph for <math>x</math> slightly less than <math>c</math> and the other finger is used to follow the graph for <math>x</math> slightly greater than <math>c</math>.
The interpretation is problematic in that it is not really a definition, and fails to have computational utility for wildly oscillatory functions or functions with other forms of weird behavior.


===Two key ideas===
===Two key ideas===
Line 691: Line 693:


0:15:47.269,0:15:50.300
0:15:47.269,0:15:50.300
oscillating with the minus 1 and 1. However,
oscillating within [-1,1]. However
smaller interval you
small an interval you


0:15:50.300,0:15:54.540
0:15:50.300,0:15:54.540
Line 970: Line 972:
0:22:00.640,0:22:01.870
0:22:00.640,0:22:01.870
understanding.</toggledisplay>
understanding.</toggledisplay>
'''Checkpoint questions''':
* To figure out the limit of a function at <math>2</math>, does the value of the function at <math>2.1</math> matter? Does the value of the function at <math>2.01</math> matter? <math>2.001</math>? How close is close enough?
* What is the limit <math>\lim_{x \to 0} \sin(1/x)</math>? What's the intuitive idea behind the reasoning? More formal versions of this reasoning will be introduced after we have seen the <math>\varepsilon-\delta</math> definition.


==Definition for finite limit for function of one variable==
==Definition for finite limit for function of one variable==
Line 981: Line 988:
<math>\lim_{x \to c} f(x) = L</math>
<math>\lim_{x \to c} f(x) = L</math>


if the following holds (the single sentence is broken down into multiple points to make it clearer):
if the following holds:


* For every <math>\varepsilon > 0</math> (the symbol <math>\varepsilon</math> is a Greek lowercase letter pronounced "epsilon")
{{quotation|For every <math>\varepsilon > 0</math>, there exists <math>\delta > 0</math> such that for all <math>x \in \R</math> satisfying <math>0 < |x - c| < \delta</math>, we have <math>|f(x) - L| < \varepsilon</math>.}}
* there exists <math>\delta > 0</math> such that (the symbol <math>\delta</math> is a Greek lowercase letter pronounced "delta")
 
* for all <math>x \in \R</math> satisfying <math>0 < |x - c| < \delta</math> (explicitly, <math>x \in (c - \delta,c) \cup (c, c+ \delta) = (c - \delta, c + \delta) \setminus \{ c \}</math>),
The definition is broken down into its four clauses below:
* we have <math>|f(x) - L| < \varepsilon</math> (explicitly, <math>f(x) \in (L - \varepsilon,L + \varepsilon)</math>).
 
{| class="sortable" border="1"
! Clause !! Interval description !! Symbol explanations
|-
| For every <math>\varepsilon > 0</math> || <math>\varepsilon \in (0,\infty)</math> || The symbol <math>\varepsilon</math> is a Greek lowercase letter pronounced "epsilon".<br>Although the definition customarily uses the letter <math>\varepsilon</math>, it can be replaced by any other letter, as long as the letter is different from the other letters in use. The reason for sticking to a standard letter choice is that it reduces cognitive overload.
|-
| there exists <math>\delta > 0</math> such that || <math>\delta \in (0,\infty)</math> || The symbol <math>\delta</math> is a Greek lowercase letter pronounced "delta"<br>Although the definition customarily uses the letter <math>\varepsilon</math>, it can be replaced by any other letter, as long as the letter is different from the other letters in use. The reason for sticking to a standard letter choice is that it reduces cognitive overload.
|-
| for all <math>x \in \R</math> satisfying <math>0 < |x - c| < \delta</math> || <math>x \in (c - \delta,c) \cup (c, c+ \delta) = (c - \delta, c + \delta) \setminus \{ c \}</math> || The symbol <math>| \ \  |</math> stands for the [[absolute value function]].<br><math>\in</math> stands for "is in the set" so the statements should be read as saying that <math>x</math> is in the set described in the two equivalent ways.<br><math>\cup</math> stands for the union, so the statement that <math>x \in (c - \delta,c) \cup (c, c+ \delta)</math> should be parsed as saying that <math>x \in (c - \delta,c)</math> ''or'' <math>x \in (c, c + \delta)</math><br><math>\setminus</math> stands for set difference, so the statement <math>x \in (c - \delta, c + \delta) \setminus \{ c \}</math> can be parsed as saying that <math>x</math> could be any value in <math>(c - \delta, c + \delta)</math> '''except''' <math>c</math>. The point <math>c</math> is excluded because we do not want the value of <math>f</math> at <math>c</math> to affect the limit notion.
|-
| we have <math>|f(x) - L| < \varepsilon</math> || <math>f(x) \in (L - \varepsilon,L + \varepsilon)</math> || The symbol <math>| \ \  |</math> stands for the [[absolute value function]].<br><math>\in</math> stands for "is in the set" so the statement should be read as saying that <math>f(x)</math> is in the set <math>(L - \varepsilon, L + \varepsilon)</math>.
|}


The '''limit''' (also called the '''two-sided limit''') <math>\lim_{x \to c} f(x)</math> is defined as a value <math>L \in \R</math> such that <math>\lim_{x \to c} f(x) = L</math>. By the [[uniqueness theorem for limits]], there is at most one value of <math>L \in \R</math> for which <math>\lim_{x \to c} f(x) = L</math>. Hence, it makes sense to talk of ''the'' limit when it exists.
The '''limit''' (also called the '''two-sided limit''') <math>\lim_{x \to c} f(x)</math> is defined as a value <math>L \in \R</math> such that <math>\lim_{x \to c} f(x) = L</math>. By the [[uniqueness theorem for limits]], there is at most one value of <math>L \in \R</math> for which <math>\lim_{x \to c} f(x) = L</math>. Hence, it makes sense to talk of ''the'' limit when it exists.
Line 1,190: Line 1,208:
L that's called the limit.</toggledisplay>
L that's called the limit.</toggledisplay>


''Note'': Although the definition customarily uses the letters <math>\varepsilon</math> and <math>\delta</math>, any other letters can be used, as long as these letters are different from each other and from the letters already in use. The reason for sticking to a standard letter choice is that it reduces cognitive overload.
'''Checkpoint questions''':
 
* In order to make sense of <math>\lim_{x \to c} f(x) = L</math> where must the function <math>f</math> be defined? Must <math>f</math> be defined ''at'' <math>c</math>? If <math>f(c)</math> exists, what can we say about its value?
* What's the formal definition of limit, i.e., what does <math>\lim_{x \to c} f(x) = L</math> mean?
* How would you write the formal definition of limit using intervals rather than absolute value inequalities to describe where <math>x</math> and <math>f(x)</math> should be?
* Why is there a "<math>0 < </math>" in the inequality <math>0 < |x - c| < \delta</math> in the <math>\varepsilon-\delta</math> definition? Why doesn't a <math>0 < </math> appear in the <math>|f(x) - L| < \varepsilon</math> part of the definition?
* In order to be able to talk of ''the'' limit <math>\lim_{x \to c} f(x)</math>, what additional fact do we need beyond the definition of what <math>\lim_{x \to c} f(x) = L</math> means?


===Left hand limit===
===Left-hand limit===


Suppose <math>f</math> is a [[function]] of one variable and <math>c \in \R</math> is a point such that <math>f</math> is defined on the immediate left of <math>c</math> (note that <math>f</math> may or may not be defined at <math>c</math>). In other words, there exists some value <math>t  > 0</math> such that <math>f</math> is defined on <math>(c-t,c)</math>.
Suppose <math>f</math> is a [[function]] of one variable and <math>c \in \R</math> is a point such that <math>f</math> is defined on the immediate left of <math>c</math> (note that <math>f</math> may or may not be defined at <math>c</math>). In other words, there exists some value <math>t  > 0</math> such that <math>f</math> is defined on <math>(c-t,c)</math>.
Line 1,200: Line 1,224:
<math>\lim_{x \to c^-} f(x) = L</math>
<math>\lim_{x \to c^-} f(x) = L</math>


if the following holds (the single sentence is broken down into multiple points to make it clearer):
if the following holds:
 
{{quotation|For every <math>\varepsilon > 0</math>, there exists <math>\delta > 0</math> such that for all <math>x \in \R</math> satisfying <math>0 < c - x < \delta</math>, we have <math>|f(x) - L| < \varepsilon</math>.}}
 
The definition is broken down into its four clauses below:


* For every <math>\varepsilon > 0</math>
{| class="sortable" border="1"
* there exists <math>\delta > 0</math> such that
! Clause !! Interval description !! Symbol explanations
* for all <math>x \in \R</math> satisfying <math>0 < c - x < \delta</math> (explicitly, <math>x \in (c - \delta,c)</math>),
|-
* we have <math>|f(x) - L| < \varepsilon</math> (explicitly, <math>f(x) \in (L - \varepsilon,L + \varepsilon)</math>.
| For every <math>\varepsilon > 0</math> || <math>\varepsilon \in (0,\infty)</math> || The symbol <math>\varepsilon</math> is a Greek lowercase letter pronounced "epsilon".<br>Although the definition customarily uses the letter <math>\varepsilon</math>, it can be replaced by any other letter, as long as the letter is different from the other letters in use. The reason for sticking to a standard letter choice is that it reduces cognitive overload.
|-
| there exists <math>\delta > 0</math> such that || <math>\delta \in (0,\infty)</math> || The symbol <math>\delta</math> is a Greek lowercase letter pronounced "delta"<br>Although the definition customarily uses the letter <math>\varepsilon</math>, it can be replaced by any other letter, as long as the letter is different from the other letters in use. The reason for sticking to a standard letter choice is that it reduces cognitive overload.
|-
| for all <math>x \in \R</math> satisfying <math>0 < c - x < \delta</math> || <math>x \in (c - \delta,c)</math> || The symbol <math>| \ \  |</math> stands for the [[absolute value function]].<br><math>\in</math> stands for "is in the set" so the statements should be read as saying that <math>x</math> is in the set <math>(c - \delta,c)</math> describing the immediate <math>\delta</math>-left of <math>c</math>.
|-
| we have <math>|f(x) - L| < \varepsilon</math> || <math>f(x) \in (L - \varepsilon,L + \varepsilon)</math> || The symbol <math>| \ \  |</math> stands for the [[absolute value function]].<br><math>\in</math> stands for "is in the set" so the statement should be read as saying that <math>f(x)</math> is in the set <math>(L - \varepsilon, L + \varepsilon)</math>.
|}


The '''left hand limit''' (acronym '''LHL''') <math>\lim_{x \to c^-} f(x)</math> is defined as a value <math>L \in \R</math> such that <math>\lim_{x \to c^-} f(x) = L</math>. By the [[uniqueness theorem for limits]] (one-sided version), there is at most one value of <math>L \in \R</math> for which <math>\lim_{x \to c^-} f(x) = L</math>. Hence, it makes sense to talk of ''the'' left hand limit when it exists.
The '''left-hand limit''' (acronym '''LHL''') <math>\lim_{x \to c^-} f(x)</math> is defined as a value <math>L \in \R</math> such that <math>\lim_{x \to c^-} f(x) = L</math>. By the [[uniqueness theorem for limits]] (one-sided version), there is at most one value of <math>L \in \R</math> for which <math>\lim_{x \to c^-} f(x) = L</math>. Hence, it makes sense to talk of ''the'' left hand limit when it exists.


===Right hand limit===
===Right-hand limit===


Suppose <math>f</math> is a [[function]] of one variable and <math>c \in \R</math> is a point such that <math>f</math> is defined on the immediate right of <math>c</math> (note that <math>f</math> may or may not be defined at <math>c</math>). In other words, there exists some value <math>t  > 0</math> such that <math>f</math> is defined on <math>(c,c+t)</math>.
Suppose <math>f</math> is a [[function]] of one variable and <math>c \in \R</math> is a point such that <math>f</math> is defined on the immediate right of <math>c</math> (note that <math>f</math> may or may not be defined at <math>c</math>). In other words, there exists some value <math>t  > 0</math> such that <math>f</math> is defined on <math>(c,c+t)</math>.
Line 1,217: Line 1,252:
<math>\lim_{x \to c^+} f(x) = L</math>
<math>\lim_{x \to c^+} f(x) = L</math>


if the following holds (the single sentence is broken down into multiple points to make it clearer):
if the following holds:
 
{{quotation|For every <math>\varepsilon > 0</math>, there exists <math>\delta > 0</math> such that for all <math>x \in \R</math> satisfying <math>0 < x - c < \delta</math>, we have <math>|f(x) - L| < \varepsilon</math>.}}
 
The definition is broken down into its four clauses below:
 
{| class="sortable" border="1"
! Clause !! Interval description !! Symbol explanations
|-
| For every <math>\varepsilon > 0</math> || <math>\varepsilon \in (0,\infty)</math> || The symbol <math>\varepsilon</math> is a Greek lowercase letter pronounced "epsilon".<br>Although the definition customarily uses the letter <math>\varepsilon</math>, it can be replaced by any other letter, as long as the letter is different from the other letters in use. The reason for sticking to a standard letter choice is that it reduces cognitive overload.
|-
| there exists <math>\delta > 0</math> such that || <math>\delta \in (0,\infty)</math> || The symbol <math>\delta</math> is a Greek lowercase letter pronounced "delta"<br>Although the definition customarily uses the letter <math>\varepsilon</math>, it can be replaced by any other letter, as long as the letter is different from the other letters in use. The reason for sticking to a standard letter choice is that it reduces cognitive overload.
|-
| for all <math>x \in \R</math> satisfying <math>0 < x - c < \delta</math> || <math>x \in (c,c + \delta)</math> || The symbol <math>| \ \  |</math> stands for the [[absolute value function]].<br><math>\in</math> stands for "is in the set" so the statements should be read as saying that <math>x</math> is in the set <math>(c,c + \delta)</math> describing the immediate <math>\delta</math>-right of <math>c</math>.
|-
| we have <math>|f(x) - L| < \varepsilon</math> || <math>f(x) \in (L - \varepsilon,L + \varepsilon)</math> || The symbol <math>| \ \  |</math> stands for the [[absolute value function]].<br><math>\in</math> stands for "is in the set" so the statement should be read as saying that <math>f(x)</math> is in the set <math>(L - \varepsilon, L + \varepsilon)</math>.
|}


* For every <math>\varepsilon > 0</math>
The '''right-hand limit''' (acronym '''RHL''') <math>\lim_{x \to c^+} f(x)</math> is defined as a value <math>L \in \R</math> such that <math>\lim_{x \to c^+} f(x) = L</math>. By the [[uniqueness theorem for limits]] (one-sided version), there is at most one value of <math>L \in \R</math> for which <math>\lim_{x \to c^+} f(x) = L</matH>. Hence, it makes sense to talk of ''the'' right hand limit when it exists.
* there exists <math>\delta > 0</math> such that
 
* for all <math>x \in \R</math> satisfying <math>0 < x - c < \delta</math> (explicitly, <math>x \in (c,c + \delta)</math>),
===Side-by-side comparison of the definitions===
* we have <math>|f(x) - L| < \varepsilon</math> (explicitly, <math>f(x) \in (L - \varepsilon,L + \varepsilon)</math>.


The '''right hand limit''' (acronym '''RHL''') <math>\lim_{x \to c^+} f(x)</math> is defined as a value <math>L \in \R</math> such that <math>\lim_{x \to c^+} f(x) = L</math>. By the [[uniqueness theorem for limits]] (one-sided version), there is at most one value of <math>L \in \R</math> for which <math>\lim_{x \to c^+} f(x) = L</matH>. Hence, it makes sense to talk of ''the'' right hand limit when it exists.
{| class="sortable" border="1"
! Clause for two-sided limit <math>\lim_{x \to c} f(x) = L</math> !! Clause for left hand limit <math>\lim_{x \to c^-} f(x) = L</math> !! Clause for right hand limit <math>\lim_{x \to c^+} f(x) = L</math>!! Comments
|-
| For every <math>\varepsilon > 0</math> || For every <math>\varepsilon > 0</math> || For every <math>\varepsilon > 0</math> || identical so far
|-
| there exists <math>\delta > 0</math> such that || there exists <math>\delta > 0</math> such that || there exists <math>\delta > 0</math> such that || still identical
|-
| for all <math>x \in \R</math> satisfying <math>0 < |x - c| < \delta</math>, i.e., <math>x \in (c - \delta,c) \cup (c,c + \delta)</math> || for all <math>x \in \R</math> satisfying <math>0 < c - x < \delta</math>, i.e., <math>x \in (c - \delta,c)</math> || for all <math>x \in \R</math> satisfying <math>0 < x - c < \delta</math>, i.e., <math>x \in (c,c + \delta)</math> || this is the part that differs, in so far as it is the direction of domain approach that differs between the definitions.
|-
| we have <math>|f(x) - L| < \varepsilon</math>, i.e., <math>f(x) \in (L - \varepsilon,L + \varepsilon)</math> || we have <math>|f(x) - L| < \varepsilon</math>, i.e., <math>f(x) \in (L - \varepsilon,L + \varepsilon)</math> || we have <math>|f(x) - L| < \varepsilon</math>, i.e., <math>f(x) \in (L - \varepsilon,L + \varepsilon)</math> || this part is again identical. Note that the left versus right is only about the direction of approach in the domain, not about the direction of approach of the function value.
|}


<center>{{#widget:YouTube|id=qBjqc78KGx0}}</center>
<center>{{#widget:YouTube|id=qBjqc78KGx0}}</center>
Line 1,617: Line 1,677:
0:11:07.000,0:11:09.000
0:11:07.000,0:11:09.000
Okay? [END!]</toggledisplay>
Okay? [END!]</toggledisplay>
'''Checkpoint questions''':
* In order to make sense of <math>\lim_{x \to c^-} f(x) = L</math>, where must the function <math>f</math> be defined? Must <math>f</math> be defined ''at'' <math>c</math>? If <math>f(c)</math> exists, what can we say about its value?
* The definitions of left hand limit, right hand limit and ordinary (two-sided) limit are pretty similar. There is only one clause that differs across the three definitions. What clause is this, and how does it differ across the definitions? Explain both in inequality notation and in interval notation.
* Why should we be careful when dealing with one-sided limits in the context of function compositions?


===Relation between the limit notions===
===Relation between the limit notions===


The two-sided limit exists if and only if (both the left hand limit and right hand limit exist and they are equal to each other).
The two-sided limit exists if and only if (both the left hand limit and right hand limit exist) '''and''' (they are equal to each other).
 
Explicitly, <math>\lim_{x \to c} f(x)</math> exists if '''all three''' of these conditions hold:
 
* <math>\lim_{x \to c^-} f(x)</math> exists.
* <math>\lim_{x \to c^+} f(x)</math> exists.
* <math>\lim_{x \to c^-} f(x) = \lim_{x \to c^+} f(x)</math>.
 
Moreover, in the event that both one-sided limits exist and are equal, the two-sided limit is equal to both of them.
 
Further, a particular value of <math>\delta > 0</math> works for a particular value of <math>\varepsilon > 0</math> in the two-sided limit definition if and only if it works in both the left hand limit definition and the right hand limit definition.


==Definition of finite limit for function of one variable in terms of a game==
==Definition of finite limit for function of one variable in terms of a game==
Line 1,632: Line 1,708:
<math>\!\lim_{x \to c} f(x) = L</math>
<math>\!\lim_{x \to c} f(x) = L</math>


Note that there is one trivial sense in which the above statement can be false, or rather, meaningless, namely, that <math>f</math> is not defined on the immediate left or immediate right of <math>c</math>. In that case, the limit statement above is false, but moreover, it is meaningless to even consider the notion of limit.
Note that there is one trivial sense in which the above statement can be false, or rather, meaningless, namely, that <math>f</math> is not defined on the immediate left or immediate right of <math>c</math>. In that case, the limit statement above is false, but moreover, it is meaningless to even consider the notion of limit. We therefore omit this sense from consideration and consider instead only the situation where <math>f</math> is defined on the immediate left and immediate right of <math>c</math>.


The game is between two players, a '''Prover''' whose goal is to prove that the limit statement is true, and a '''Skeptic''' (also called a '''Verifier''' or sometimes a '''Disprover''') whose goal is to show that the statement is false. The game has three moves:
The game is between two players, a '''Prover''' whose goal is to prove that the limit statement is true, and a '''Skeptic''' (also called a '''Verifier''' or sometimes a '''Disprover''') whose goal is to show that the statement is false. The game has three moves:


# First, the skeptic chooses <math>\varepsilon > 0</math>, or equivalently, chooses the target interval <math>(L - \varepsilon,L + \varepsilon)</math>.
# First, the skeptic chooses <math>\varepsilon > 0</math>, or equivalently, chooses the target interval <math>(L - \varepsilon,L + \varepsilon)</math> in which the skeptic is challenging the prover to ''trap'' the function.
# Then, the prover chooses <math>\delta > 0</math>, or equivalently, chooses the interval <math>(c - \delta, c + \delta) \setminus \{ c \}</math>.
# Then, the prover chooses <math>\delta > 0</math>, or equivalently, chooses the interval <math>(c - \delta, c + \delta) \setminus \{ c \}</math>.
# Then, the skeptic chooses a value <math>x</math> satisfying <math>0 < |x - c| < \delta</math>, or equivalently, <math>x \in (c - \delta, c + \delta) \setminus \{ c \}</math>, which is the same as <math>(c - \delta,c) \cup (c,c + \delta)</math>.
# Then, the skeptic chooses a value <math>x</math> satisfying <math>0 < |x - c| < \delta</math>, or equivalently, <math>x \in (c - \delta, c + \delta) \setminus \{ c \}</math>, which is the same as <math>(c - \delta,c) \cup (c,c + \delta)</math>.


Now, if <math>|f(x) - L| < \varepsilon</math> (i.e., <math>f(x) \in (L - \varepsilon,L + \varepsilon)</math>), the prover wins. Otherwise, the skeptic wins (see the subtlety about the domain of definition issue below the picture).
Now, if <math>|f(x) - L| < \varepsilon</math> (i.e., <math>f(x) \in (L - \varepsilon,L + \varepsilon)</math>), the prover wins. Otherwise, the skeptic wins.


We say that the limit statement
We say that the limit statement
Line 1,646: Line 1,722:
<math>\!\lim_{x \to c} f(x) = L</math>
<math>\!\lim_{x \to c} f(x) = L</math>


is '''true''' if the prover has a winning strategy for this game. The ''winning strategy'' for the prover basically constitutes a strategy to choose an appropriate <math>\delta</math> in terms of the <matH>\varepsilon</math> chosen by the skeptic. Thus, it is an expression of <math>\delta</math> as a function of <math>\varepsilon</math>.
is '''true''' if the prover has a '''winning strategy''' for this game. The ''winning strategy'' for the prover basically constitutes a strategy to choose an appropriate <math>\delta</math> in terms of the <math>\varepsilon</math> chosen by the skeptic. Thus, it is an expression of <math>\delta</math> as a function of <math>\varepsilon</math>. Verbally, the goal of the prover is to choose a value of <math>\delta</math> so that when the input is restricted to being within <math>\delta</math> distance of <math>c</math>, the output is '''trapped''' to within <math>\varepsilon</math> distance of the claimed limit <math>L</math>.


We say that the limit statement
We say that the limit statement
Line 1,654: Line 1,730:
is '''false''' if the skeptic has a winning strategy for this game. The '''winning strategy''' for the skeptic involves a choice of <math>\varepsilon</math>, ''and'' a strategy that chooses a value of <math>x</math> (constrained in the specified interval) based on the prover's choice of <math>\delta</math>.
is '''false''' if the skeptic has a winning strategy for this game. The '''winning strategy''' for the skeptic involves a choice of <math>\varepsilon</math>, ''and'' a strategy that chooses a value of <math>x</math> (constrained in the specified interval) based on the prover's choice of <math>\delta</math>.


[[File:Epsilondeltagamepicture.png|1000px]]
Let's review the definition in conjunction with the game along with a deeper semantic understanding of the steps:
 
 
'''Slight subtlety regarding domain of definition''': The domain of definition issue leads to a couple of minor subtleties:
{| class="sortable" border="1"
! Step no. !! Clause of definition !! Who moves? !! What is chosen? !! Constraints on the choice !! Comment
|-
| 1 || For every <math>\varepsilon > 0</math> || Skeptic || <math>\varepsilon</math> || Must be positive || The "for every" corresponds to the idea that the move is made by the side that does ''not'' have a winning strategy, because we want to argue that the side that ''does'' have a winning strategy can win ''no matter what''.
|-
| 2 || there exists <math>\delta > 0</math> such that || Prover || <math>\delta</math> || Must be positive || The "there exists" corresponds to the idea that the move is made by the side that has a winning strategy, because that side gets to choose a favorable value of the variable (in this case <math>\delta</math>).
|-
| 3 || for all <math>x</math> satisfying <math>0 < |x - c| < \delta</math>, || Skeptic || <math>x</math> || Must be within the interval <math>(c - \delta,c) \cup (c,c + \delta)</math> || The "for all" corresponds to the idea that the move is made by the side that does ''not'' have a winning strategy, because we want to argue that the side that ''does'' have a winning strategy can win ''no matter what''.
|-
| 4 || we have <math>|f(x) - L| < \varepsilon</math> || Neither; it's time for the judge to decide || -- || If <math>f(x) \in (L - \varepsilon,L + \varepsilon)</math> (the condition that we desire) the prover wins. Else, the skeptic wins. ||
|}
 
[[File:Epsilondeltagamepicture.png|1000px]]
 
'''Slight subtlety regarding domain of definition''': <toggledisplay>The domain of definition issue leads to a couple of minor subtleties:


* A priori, it is possible that the <math>x</math> chosen by the skeptic is outside the domain of <math>f</math>, so it does not make sense to evaluate <math>f(x)</math>. In the definition given above, this would lead to the game being won by the skeptic. In particular, if <math>f</math> is not defined on the immediate left or right of <math>c</math>, the skeptic can always win by picking <math>x</math> outside the domain.
* A priori, it is possible that the <math>x</math> chosen by the skeptic is outside the domain of <math>f</math>, so it does not make sense to evaluate <math>f(x)</math>. In the definition given above, this would lead to the game being won by the skeptic. In particular, if <math>f</math> is not defined on the immediate left or right of <math>c</math>, the skeptic can always win by picking <math>x</math> outside the domain.
Line 1,662: Line 1,752:
** We could require (as part of the game rules) that the prover pick <math>\delta</math> such that <math>(c - \delta, c + \delta) \setminus \{ c \} \subseteq \operatorname{dom} f</math>. This pre-empts the problem of picking <math>x</math>-values outside the domain.
** We could require (as part of the game rules) that the prover pick <math>\delta</math> such that <math>(c - \delta, c + \delta) \setminus \{ c \} \subseteq \operatorname{dom} f</math>. This pre-empts the problem of picking <math>x</math>-values outside the domain.
** We could require (as part of the game rules) that the skeptic pick <math>x</math> ''in'' the domain, i.e., pick <math>x</math> with <math>0 < |x - c| < \delta</math> and <math>x \in \operatorname{dom} f</math>.
** We could require (as part of the game rules) that the skeptic pick <math>x</math> ''in'' the domain, i.e., pick <math>x</math> with <math>0 < |x - c| < \delta</math> and <math>x \in \operatorname{dom} f</math>.
** We could alter the rule so that if the skeptic picks <math>x</math> outside the domain, the prover wins (instead of the skeptic winning).
** We could alter the rule so that if the skeptic picks <math>x</math> outside the domain, the prover wins (instead of the skeptic winning).</toggledisplay>


<center>{{#widget:YouTube|id=Kh253PUghFk}}</center>
<center>{{#widget:YouTube|id=Kh253PUghFk}}</center>
Line 2,037: Line 2,127:
I explain the mathematical symbols.</toggledisplay>
I explain the mathematical symbols.</toggledisplay>


===Negation of limit statement and non-existence of limit===
We now consider the explicit description of the definition for the case that the skeptic has a winning strategy for the limit game for <math>\lim_{x \to c} f(x) = L</math>, i.e., for the limit statement being false.
In words, the definition is:
{{quotation|There exists <math>\varepsilon > 0</math> such that for every <math>\delta > 0</math>, there exists <math>x</math> satisfying <math>0  < |x - c| < \delta</math> and <math>|f(x) - L| \ge \varepsilon</math>.}}
Let's review the definition in conjunction with the game along with a deeper semantic understanding of the steps:
{| class="sortable" border="1"
! Step no. !! Clause of definition for original limit statement (i.e., prover has a winning strategy) !! Clause of definition for skeptic having a winning strategy !! Who moves? !! What is chosen? !! Constraints on the choice !! Comment
|-
| 1 || For every <math>\varepsilon > 0</math> || There exists <math>\varepsilon > 0</math> such that || Skeptic || <math>\varepsilon</math> || Must be positive || Whether we use "for every" or "there exists" depends on who we're rooting for.
|-
| 2 || there exists <math>\delta > 0</matH> such that || for every <math>\delta > 0</math>, || Prover || <math>\delta</math> || Must be positive || Whether we use "for every" or "there exists" depends on who we're rooting for.
|-
| 3 || for all <math>x \in \R</math> satisfying <math>0 < |x - c| < \delta</math>, || there exists <math>x \in \R</math> satisfying <math>0 < |x - c| < \delta</math> and || Skeptic || <math>x</math> || Must be within the interval <math>(c - \delta,c) \cup (c,c + \delta)</math> || Whether we use "for every" or "there exists" depends on who we're rooting for.
|-
| 4 || we have <math>|f(x) - L| < \varepsilon</math> || <math>|f(x) - L| \ge \varepsilon</math>. || Neither; it's time for the judge to decide || -- || If <math>f(x) \in (L - \varepsilon,L + \varepsilon)</math>, the prover wins. Else, the skeptic wins. || The conditions are negatives of one another.
|}
<center>{{#widget:YouTube|id=N0U8Y11nlPk}}</center>
<center>{{#widget:YouTube|id=N0U8Y11nlPk}}</center>


Line 2,364: Line 2,475:


does not exist. The skeptic's winning strategy is as follows: regardless of the <math>L</math> chosen by the prover, pick a fixed <math>\varepsilon < 1</math> (independent of <math>L</math>, so <math>\varepsilon</math> can be decided in advance of the game -- note that the skeptic could even pick <math>\varepsilon = 1</math> and the strategy would still work). After the prover has chosen a value <math>\delta</math>, find a value <math>x \in (0 - \delta,0 + \delta) \setminus \{ 0 \}</math> such that the <math>\sin(1/x)</math> function value lies outside <math>(L - \varepsilon,L + \varepsilon)</math>. This is possible because the interval <math>(L - \varepsilon,L + \varepsilon)</math> has width <math>2 \varepsilon</math>, hence cannot cover the entire interval <math>[-1,1]</math>, which has width 2. However, the range of the <math>\sin(1/x)</math> function on <math>(0 - \delta,0 + \delta) \setminus \{ 0 \}</math> is all of <math>[-1,1]</math>.
does not exist. The skeptic's winning strategy is as follows: regardless of the <math>L</math> chosen by the prover, pick a fixed <math>\varepsilon < 1</math> (independent of <math>L</math>, so <math>\varepsilon</math> can be decided in advance of the game -- note that the skeptic could even pick <math>\varepsilon = 1</math> and the strategy would still work). After the prover has chosen a value <math>\delta</math>, find a value <math>x \in (0 - \delta,0 + \delta) \setminus \{ 0 \}</math> such that the <math>\sin(1/x)</math> function value lies outside <math>(L - \varepsilon,L + \varepsilon)</math>. This is possible because the interval <math>(L - \varepsilon,L + \varepsilon)</math> has width <math>2 \varepsilon</math>, hence cannot cover the entire interval <math>[-1,1]</math>, which has width 2. However, the range of the <math>\sin(1/x)</math> function on <math>(0 - \delta,0 + \delta) \setminus \{ 0 \}</math> is all of <math>[-1,1]</math>.
{{quotation|Crucially, the inability of the prover to trap the function value close to any point as <math>x \to 0</math> is the reason the limit fails to exist.}}


[[File:Sin1byxlimitat0.png|800px]]
[[File:Sin1byxlimitat0.png|800px]]
Line 2,973: Line 3,086:
the skeptic wins and so the limit doesn't
the skeptic wins and so the limit doesn't
exist.</toggledisplay>
exist.</toggledisplay>
==Strategic aspects==
===The strategy of small===
In the game formulation of the limit, the following loose statements are true:
* "Smaller is smarter" for the skeptic, i.e., the smaller the choice of <math>\varepsilon</math>, the better the outlook is for the skeptic to win.
* "Smaller is smarter" for the prover, i.e., the smaller the choice of <math>\delta</math>, the better the outlook is for the prover to win.
In other words, each side benefits by making the crucial move of that side as small as possible. However, there does not exist any ''single'' arbitrarily small number -- this is related to the observation in the [[#Two key ideas|motivation section]] that there is no such thing as a ''single'' arbitrarily close number. Thus, saying "choose as small a value as possible" is not a coherent strategy. What we can say is the following:
* If a value of <math>\delta > 0</math> works for a given value of <math>\varepsilon > 0</math>, the same value of <math>\delta > 0</math> also works for larger choices of <math>\varepsilon</math>.
* If a value of <math>\delta > 0</math> works for a given value of <math>\varepsilon > 0</math>, smaller values of <math>\delta > 0</math> also work for the same choice of <math>\varepsilon</math>.
===Prover's strategy revisited===
The prover, in choosing a winning strategy, must specify a rule that can determine a value of <math>\delta</math> that works in terms of the value of <math>\varepsilon</math> specified by the skeptic. In other words, the prover must have a way of specifying <math>\delta</math> ''as a function of'' <math>\varepsilon</math>.
The skeptic also chooses <math>x</math> in the next move. However, the prover has no way of knowing the value of <math>x</math> that the skeptic plans to pick. Thus, in order for the prover to have a winning strategy, the prover's choice of <math>\delta</math> should be such that ''no matter what'' <math>x</math> the skeptic picks, the prover wins.
===Skeptic's strategy revisited===
The skeptic, in choosing a winning strategy, must specify the value of <math>\varepsilon</math> and then specify how to pick a value of <math>x</math> that works. When picking the value of <math>\varepsilon</math>, the skeptic does not know what <math>\delta</math> the prover will pick. Thus, the skeptic's choice of <math>\varepsilon</math> cannot be dependent on the prover's subsequent choice of <math>\delta</math>.
However, when picking the value of <math>x</math>, the skeptic is aware of (and constrained by) the prover's choice of <math>\delta</math>.


==Misconceptions==
==Misconceptions==
Line 3,926: Line 4,065:


0:18:59.870,0:19:04.260
0:18:59.870,0:19:04.260
the moves of the skeptic be right "for every"
the moves of the skeptic we write "for every"
"for all." Right? And
"for all." Right? And


0:19:04.260,0:19:07.390
0:19:04.260,0:19:07.390
for all the moves of the prover it's "there
for all the moves of the prover we write "there
exists." Why do we do
exists." Why do we do


Line 4,160: Line 4,299:
{{quotation|Consider the limit problem <math>\displaystyle \lim_{x \to 2} x^2 = 4</math>. The <math>\varepsilon-\delta</math> proof corresponding to this problem would involve a game between a prover and a skeptic. To show that the limit statement is true, it suffices to exhibit a winning strategy for the prover for the game. The strategy is as follows. Pick <math>\delta = \frac{\varepsilon}{|x + 2|}</math>. Let's prove that this works.<br><br>''Specific claim'': For any skeptic-picked <math>\varepsilon > 0</math>, if the prover picks <math>\delta > 0</math> such that <math>\delta = \varepsilon/|x + 2|</math>, then regardless of the <math>x</math> that the skeptic picks with <math>0 < |x - 2| < \delta</math>, we have <math>|x^2 - 4| < \varepsilon</math>.<br><br>''Proof of claim'': We have: <br><math>|x^2 - 4| = |x - 2||x + 2| < \delta|x + 2| = \frac{\varepsilon}{|x + 2|} |x + 2| = \varepsilon</math>}}
{{quotation|Consider the limit problem <math>\displaystyle \lim_{x \to 2} x^2 = 4</math>. The <math>\varepsilon-\delta</math> proof corresponding to this problem would involve a game between a prover and a skeptic. To show that the limit statement is true, it suffices to exhibit a winning strategy for the prover for the game. The strategy is as follows. Pick <math>\delta = \frac{\varepsilon}{|x + 2|}</math>. Let's prove that this works.<br><br>''Specific claim'': For any skeptic-picked <math>\varepsilon > 0</math>, if the prover picks <math>\delta > 0</math> such that <math>\delta = \varepsilon/|x + 2|</math>, then regardless of the <math>x</math> that the skeptic picks with <math>0 < |x - 2| < \delta</math>, we have <math>|x^2 - 4| < \varepsilon</math>.<br><br>''Proof of claim'': We have: <br><math>|x^2 - 4| = |x - 2||x + 2| < \delta|x + 2| = \frac{\varepsilon}{|x + 2|} |x + 2| = \varepsilon</math>}}


The error is as follows: <toggledisplay>Recall the sequence of moves made in the game. First, the skeptic picks <math>\varepsilon > 0 </math>. Then, the prover picks <math>\delta > 0</math>. ''Then'', the skeptic picks a test value of <math>x</math> to challenge the prover's claim of the function being trapped. In particular, this means that at the stage that the prover picks the vaule of <math>\delta</math>, the prover is ''unaware'' of the value of <math>x</math> that the skeptic plans to pick. Hence, the prover's strategy for choosing <math>\delta</math> cannot use <math>x</math>. Rather, the prover must have a strategy for <math>\delta</math> purely in terms of <math>\varepsilon</math>, which is the only piece of information known to the prover at that stage in the game.
The error is as follows: <toggledisplay>Recall the sequence of moves made in the game. First, the skeptic picks <math>\varepsilon > 0 </math>. Then, the prover picks <math>\delta > 0</math>. ''Then'', the skeptic picks a test value of <math>x</math> to challenge the prover's claim of the function being trapped. In particular, this means that at the stage that the prover picks the value of <math>\delta</math>, the prover is ''unaware'' of the value of <math>x</math> that the skeptic plans to pick. Hence, the prover's strategy for choosing <math>\delta</math> cannot use <math>x</math>. Rather, the prover must have a strategy for <math>\delta</math> purely in terms of <math>\varepsilon</math>, which is the only piece of information known to the prover at that stage in the game.


This also explains why we called this error the ''strongly telepathic prover'', i.e., it involved the prover reading the skeptic's mind about future planned moves, which is impermissible.
This also explains why we called this error the ''strongly telepathic prover'', i.e., it involved the prover reading the skeptic's mind about future planned moves, which is impermissible.
Line 4,170: Line 4,309:
''Spot the error in this'':
''Spot the error in this'':


{{quotation|Consider the limit problem: <br><math>g(x) = \left \lbrace \begin{array}{ll} x, & x \text{ rational } \\ 0, & x \text{ irrational }\\\end{array}\right.</math><br>We want to show that <math>\displaystyle \lim_{x \to 0} g(x) = 0$</math><br>For this game, we need to exhibit a winning strategy for the prover. The winning strategy is as follows. The skeptic first chooses <math>\varepsilon > 0</math>. The prover now makes two cases. If the skeptic is planning to pick a rational value of <math>x</math>, then the prover chooses the strategy <math>\delta = \varepsilon</math>. If the skeptic is planning to choose an irrational value of <math>x</math>, then the prover can pick any <math>\delta</math>.<br>Clearly, the prover's strategy works in both cases, so we have a winning strategy.}}
{{quotation|Consider the limit problem: <br><math>g(x) = \left \lbrace \begin{array}{ll} x, & x \text{ rational } \\ 0, & x \text{ irrational }\\\end{array}\right.</math><br>We want to show that <math>\displaystyle \lim_{x \to 0} g(x) = 0</math><br>For this game, we need to exhibit a winning strategy for the prover. The winning strategy is as follows. The skeptic first chooses <math>\varepsilon > 0</math>. The prover now makes two cases. If the skeptic is planning to pick a rational value of <math>x</math>, then the prover chooses the strategy <math>\delta = \varepsilon</math>. If the skeptic is planning to choose an irrational value of <math>x</math>, then the prover can pick any <math>\delta</math>.<br>Clearly, the prover's strategy works in both cases, so we have a winning strategy.}}


Th error is as follows: <toggledisplay>Recall the sequence of moves made in the game. First, the skeptic picks <math>\varepsilon > 0 </math>. Then, the prover picks <math>\delta > 0</math>. ''Then'', the skeptic picks a test value of <math>x</math> to challenge the prover's claim of the function being trapped. In particular, this means that at the stage that the prover picks the vaule of <math>\delta</math>, the prover is ''unaware'' of the value of <math>x</math> that the skeptic plans to pick. Hence, the prover's strategy for choosing <math>\delta</math> cannot rely on specifics about what <math>x</math> the skeptic plans to choose.
Th error is as follows: <toggledisplay>Recall the sequence of moves made in the game. First, the skeptic picks <math>\varepsilon > 0 </math>. Then, the prover picks <math>\delta > 0</math>. ''Then'', the skeptic picks a test value of <math>x</math> to challenge the prover's claim of the function being trapped. In particular, this means that at the stage that the prover picks the value of <math>\delta</math>, the prover is ''unaware'' of the value of <math>x</math> that the skeptic plans to pick. Hence, the prover's strategy for choosing <math>\delta</math> cannot rely on specifics about what <math>x</math> the skeptic plans to choose.


This error is similar to the preceding error. Both involve impermissible telepathy on the prover's part in reading the skeptic's mind. The ''strongly telepathic prover'' error is more severe in the sense that it involves the prover reading the exact value of <math>x</math> that the skeptic plans to play, whereas the ''mildly telepathic prover'' error only involves the prover guessing the ''type'' of value (rational or irrational) that the skeptic plans to play.
This error is similar to the preceding error. Both involve impermissible telepathy on the prover's part in reading the skeptic's mind. The ''strongly telepathic prover'' error is more severe in the sense that it involves the prover reading the exact value of <math>x</math> that the skeptic plans to play, whereas the ''mildly telepathic prover'' error only involves the prover guessing the ''type'' of value (rational or irrational) that the skeptic plans to play.
Line 4,556: Line 4,695:


<center>{{#widget:YouTube|id=P9APtpIE4y8}}</center>
<center>{{#widget:YouTube|id=P9APtpIE4y8}}</center>
Full timed transcript: <toggledisplay>
0:00:15.530,0:00:22.530
Vipul: Okay. So this talk is going to be about
limit at infinity for functions on real numbers
0:00:24.300,0:00:28.980
and the concept of limits of sequences, how
these definitions are essentially almost the
0:00:28.980,0:00:34.790
same thing and how they differ.
0:00:34.790,0:00:41.790
Okay. So let's begin by reviewing the definition
of the limit as x approaches infinity of f(x).
0:00:42.360,0:00:47.390
Or rather what it means for that limit to
be a number L. Well, what it means is that
0:00:47.390,0:00:52.699
for every epsilon greater than zero, so we
first say for every neighborhood of L, small
0:00:52.699,0:00:59.429
neighborhood of L, given by radius epsilon
there exists a neighborhood of infinity which
0:00:59.429,0:01:03.010
is specified by choosing some a such that
that is
0:01:03.010,0:01:08.670
the interval (a,infinity) ...
0:01:08.670,0:01:15.220
... such that for all x in the interval from
a to infinity. That is for all x within the
0:01:15.220,0:01:20.430
chosen neighborhood of infinity, the f(x)
value is within the chosen neighborhood of
0:01:20.430,0:01:23.390
L. Okay?
0:01:23.390,0:01:28.049
If you want to think about it in terms of
the game between the prover and the skeptic,
0:01:28.049,0:01:34.560
the prover is claiming that the limit as x
approaches infinity of f(x) is L. The skeptic
0:01:34.560,0:01:38.930
begins by picking a neighborhood of L which
is parameterized by its radius epsilon. The
0:01:38.930,0:01:41.619
prover picks the
neighborhood of infinity which is parameterized
0:01:41.619,0:01:48.350
by its lower end a. Then the skeptic picks
a value x between a and infinity. Then they
0:01:48.350,0:01:51.990
check whether absolute value f(x) minus L
[symbolically: |f(x) - L|] is less than epsilon.
0:01:51.990,0:01:56.090
That is they check whether f(x) is in the
chosen neighborhood of L (the neighborhood
0:01:56.090,0:02:00.640
chosen by the skeptic). If it is,
then the prover wins. The prover has managed
0:02:00.640,0:02:05.810
to trap the function: for x large enough,
the prover has managed to trap the function
0:02:05.810,0:02:12.810
within epsilon distance of L. If not, then
the skeptic wins. The statement is true if
0:02:13.610,0:02:18.680
the prover has a winning the strategy for
the game.
0:02:18.680,0:02:21.730
Now, there is a similar definition which one
has for sequences. So, what's a sequence?
0:02:21.730,0:02:26.349
Well, it's just a function from the natural
numbers. And, here, we're talking of sequences
0:02:26.349,0:02:31.610
of real numbers. So, it's a function from
the naturals to the reals and we use the same
0:02:31.610,0:02:37.400
letter f for a good reason. Usually we write
sequences with subscripts, a_n type of thing.
0:02:37.400,0:02:42.409
But I'm using it as a function just to highlight
the similarities. So, limit as n approaches
0:02:42.409,0:02:47.519
infinity, n restricted to the natural numbers
... Usually if it's clear we're talking of
0:02:47.519,0:02:52.830
a sequence, we can remove this part [pointing
to the n in N constraint specification] just
0:02:52.830,0:02:54.980
say limit n approaches infinity f(n),
but since we want to be really clear here,
0:02:54.980,0:02:57.220
I have put this line. Okay?
0:02:57.220,0:03:02.709
So, this limit equals L means "for every epsilon
greater than 0 ..." So, it starts in the same
0:03:02.709,0:03:09.170
way. The skeptic picks a neighborhood of L.
Then the next line is a little different but
0:03:09.170,0:03:16.170
that's not really the crucial part. The skeptic
is choosing epsilon. The prover picks n_0,
0:03:18.799,0:03:22.830
a natural number. Now, here the prover is
picking a real number. Here the prover is
0:03:22.830,0:03:26.700
picking a natural number. That's not really
the big issue. You could in fact change this
0:03:26.700,0:03:33.659
line to match. You could interchange these
lines. It wouldn't affect either definition.
0:03:33.659,0:03:40.599
The next line is the really important one
which is different. In here [pointing to real-sense
0:03:40.599,0:03:47.430
limit], the condition has to be valid for
all x, for all real numbers x which are bigger
0:03:47.430,0:03:51.900
than the threshold which the prover has chosen.
Here on the other hand [pointing to the sequence
0:03:51.900,0:03:56.970
limit] the condition has to be valid for all
natural numbers which are bigger than the
0:03:56.970,0:04:00.659
threshold the prover has chosen. By the way,
some of you may have seen the definition with
0:04:00.659,0:04:07.659
an equality sign here. It doesn't make a difference
to the definition. It does affect what n_0
0:04:09.010,0:04:12.019
you can choose, it will go up or down by one,
but that's not
0:04:12.019,0:04:17.310
really a big issue. The big issue, the big
difference between these two definitions is
0:04:17.310,0:04:23.050
that in this definition you are insisting
that the condition here is valid for all real
0:04:23.050,0:04:30.050
x. So, you are insisting or rather the game
is forcing the prover to figure out how to
0:04:31.650,0:04:36.940
trap the function values for all real x. Whereas
here, the game is only requiring the prover
0:04:36.940,0:04:39.639
to trap the function values for all large
enough
0:04:39.639,0:04:42.880
natural numbers. So, here [real-sense limit]
it's all large enough real numbers. Here [sequence
0:04:42.880,0:04:49.250
limit] it's all large enough natural numbers.
Okay?
0:04:49.250,0:04:56.250
So, that's the only difference essentially.
Now, you can see from the way we have written
0:04:57.050,0:04:59.900
this that this [real-sense limit] is much
stronger. So, if you do have a function which
0:04:59.900,0:05:06.880
is defined on real so that both of these concepts
can be discussed. If it were just a sequence
0:05:06.880,0:05:10.080
and there were no function to talk about then
obviously, we can't even talk about this.
0:05:10.080,0:05:16.860
If there's a function defined on the reals
or on all large enough reals, then we can
0:05:16.860,0:05:21.470
try taking both of these. The existence of
this [pointing at the real-sense limit] and
0:05:21.470,0:05:24.580
[said "or", meant "and"] it's being equal
to L as much stronger than this [the sequence
0:05:24.580,0:05:27.250
limit] equal to L. If this is equal to L then
definitely this [the sequence limit] is equal
0:05:27.250,0:05:29.330
to L. Okay?
0:05:29.330,0:05:32.080
But maybe there are situations where this
[the sequence limit] is equal to some number
0:05:32.080,0:05:38.240
but this thing [the real-sense limit] doesn't
exist. So, I want to take one example here.
0:05:38.240,0:05:45.240
I have written down an example and we can
talk a bit about that is this. So, here is
0:05:45.509,0:05:52.509
a function. f(x) = sin(pi x). This is sin
(pi x) and the corresponding
0:05:55.630,0:06:00.530
function if you just restrict [it] to the
natural numbers is just sin (pi n). Now, what
0:06:00.530,0:06:06.759
does sin (pi n) look like for a natural number
n? In fact for any integer n? pi times
0:06:06.759,0:06:13.759
n is an integer multiple of pi. sin of integer
multiples of pi is zero. Let's make a picture
0:06:18.370,0:06:25.370
of sin ...
0:06:27.289,0:06:33.360
It's oscillating. Right? Integer multiples
of pi are precisely the ones where it's meeting
0:06:33.360,0:06:40.330
the axis. So, in fact we are concerned about
the positive one because we are talking of
0:06:40.330,0:06:45.840
the sequence (natural number [inputs]). Okay?
And so, if you are looking at this sequence,
0:06:45.840,0:06:51.090
all the terms here are zero. So, the limit
is also zero. So, this limit [the sequence
0:06:51.090,0:06:53.030
limit] is zero.
0:06:53.030,0:07:00.030
Okay. What about this limit? Well, we have
the picture again. Is it going anywhere? No.
0:07:05.349,0:07:07.650
It's oscillating between minus one and one
[symbolically: oscillating in [-1,1]]. It's
0:07:07.650,0:07:11.669
not settling down to any number. It's not...
You cannot trap it near any particular number
0:07:11.669,0:07:17.280
because it's all over the map between minus
one and one. For the same reason that sin(1/x)
0:07:17.280,0:07:22.840
doesn't approach anything as x approaches
zero, the same reason sin x or sin(pi x) doesn't
0:07:22.840,0:07:29.840
approach anything as x approaches infinity.
So, the limit for the real thing, this does
0:07:31.099,0:07:37.539
not exist. So, this gives an example where
the real thing [the real-sense limit] doesn't
0:07:37.539,0:07:44.539
exist and the sequence thing [sequence limit]
does exist and so here is the overall summary.
0:07:44.690,0:07:46.979
If the real sense limit,
that is this one [pointing to definition of
0:07:46.979,0:07:51.039
real sense limit] exists, [then] the sequence
limit also exists and they're both equal.
0:07:51.039,0:07:54.419
On the other hand, you can have a situation
with the real sense limit, the limit for the
0:07:54.419,0:08:00.819
function of reals doesn't exist but the sequence
limit still exists like this set up. Right?
0:08:00.819,0:08:05.569
Now, there is a little caveat that I want
to add. If the real sense limit doesn't exist
0:08:05.569,0:08:11.069
as a finite number but it's say plus infinity
then the sequence limit also has to be plus
0:08:11.069,0:08:16.150
infinity. If the real sense limit is minus
infinity, then the sequence limit also has
0:08:16.150,0:08:20.330
to be minus infinity. So, this type of situation,
where the real sense limit doesn't exist but
0:08:20.330,0:08:26.840
the sequence exists, well, will happen in
kind of oscillatory type of situations. Where
0:08:26.840,0:08:31.409
the real sense you have an oscillating thing
and in the sequence thing on the other hand
0:08:31.409,0:08:36.330
you somehow manage to pick a bunch of points
where that oscillation doesn't create a problem.
0:08:36.330,0:08:36.789
Okay?
0:08:36.789,0:08:43.630
Now, why is this important? Well, it's important
because in a lot of cases when you have to
0:08:43.630,0:08:50.630
calculate limits of sequences, you just calculate
them by doing, essentially, just calculating
0:08:53.230,0:09:00.230
the limits of the function defining the sequence
as a limit of a real valued function. Okay?
0:09:00.230,0:09:03.460
So, for instance if I ask you what is limit
...
0:09:03.460,0:09:10.460
Okay. I'll ask you what is limit [as] n approaches
infinity of n^2(n + 1)/(n^3 + 1) or something
0:09:15.200,0:09:22.200
like that. Right? Some rational function.
You just do this calculation as if you were
0:09:25.430,0:09:29.720
just doing a limit of a real function, function
of real numbers, right? The answer you get
0:09:29.720,0:09:33.060
will be the correct one. If it's a finite
number it will be the same finite number.
0:09:33.060,0:09:37.850
In this case it will just be one. But any
rational function, if the answer is finite,
0:09:37.850,0:09:44.070
same answer for the sequence. If it is plus
infinity, same answer for the sequence. If
0:09:44.070,0:09:46.250
it is minus infinity, same answer as for the
sequence.
0:09:46.250,0:09:53.250
However, if the answer you get for the real-sense
limit is oscillatory type of non existence,
0:09:54.660,0:09:59.410
then that's inconclusive as far as the sequence
is concerned. You actually have to think about
0:09:59.410,0:10:05.520
the sequence case and figure out for yourself
what happens to the limit. Okay? If might
0:10:05.520,0:10:07.230
in
fact be the case that the sequence limit actually
0:10:07.230,0:10:11.380
does exist even though the real sense [limit]
is oscillatory. Okay.
</toggledisplay>


===Real-valued functions of multiple variables case===
===Real-valued functions of multiple variables case===

Latest revision as of 03:14, 25 September 2021

ORIGINAL FULL PAGE: Limit
STUDY THE TOPIC AT MULTIPLE LEVELS:
ALSO CHECK OUT: Quiz (multiple choice questions to test your understanding) |Page with videos on the topic, both embedded and linked to

This page lists a core term of calculus. The term is used widely, and a thorough understanding of its definition is critical.
See a complete list of core terminology

Motivation

Quick summary

The term "limit" in mathematics is closely related to one of the many senses in which the term "limit" is used in day-to-day English. In day-to-day English, there are two uses of the term "limit":

  • Limit as something that one approaches, or is headed toward
  • Limit as a boundary or cap that cannot be crossed or exceeded

The mathematical term "limit" refers to the first of these two meanings. In other words, the mathematical concept of limit is a formalization of the intuitive concept of limit as something that one approaches or is headed toward.

For a function , the notation:

is meant to say "the limit, as approaches , of the function value " and thus, the mathematical equality:

is meant to say "the limit, as approaches , of the function value , is ." In a rough sense, what this means is that as gets closer and closer to , eventually comes, and stays, close enough to .

Graphical interpretation

The graphical interpretation of "" is that, if we move along the graph of the function in the plane, then the graph approaches the point whether we make approach from the left or the right. However, this interpretation works well only if is continuous on the immediate left and immediate right of .

This interpretation is sometimes termed the "two finger test" where one finger is used to follow the graph for slightly less than and the other finger is used to follow the graph for slightly greater than .

The interpretation is problematic in that it is not really a definition, and fails to have computational utility for wildly oscillatory functions or functions with other forms of weird behavior.

Two key ideas

The concept of limit involves two key ideas, both of which help explain why the definition is structured the way it is:

  • Arbitrarily close: The limit depends on how things behave arbitrarily close to the point involved. The notion of "arbitrarily close" is difficult to quantify non-mathematically, but what it means is that any fixed distance is too much. For instance, if doing , we can take points close to 2 such as 2.1, 2.01, 2.001, 2.0001, 2.0000001, 2.000000000000001. Any of these points, viewed in and of itself, is too far from 2 to offer any meaningful information. It is only the behavior in the limit, as we get arbitrarily close, that matters.
  • Trapping of the function close by: For a function to have a certain limit at a point, it is not sufficient to have the function value come close to that point. Rather, for to hold, it is necessary that for very close to , the function value is trapped close to . It is not enough that it keeps oscillating between being close to and being far from .
{{#widget:YouTube|id=iZ_fCNvYa9U}}

Full timed transcript: [SHOW MORE]

Checkpoint questions:

  • To figure out the limit of a function at , does the value of the function at matter? Does the value of the function at matter? ? How close is close enough?
  • What is the limit ? What's the intuitive idea behind the reasoning? More formal versions of this reasoning will be introduced after we have seen the definition.

Definition for finite limit for function of one variable

Two-sided limit

Suppose is a function of one variable and is a point such that is defined to the immediate left and immediate right of (note that may or may not be defined at ). In other words, there exists some value such that is defined on .

For a given value , we say that:

if the following holds:

For every , there exists such that for all satisfying , we have .

The definition is broken down into its four clauses below:

Clause Interval description Symbol explanations
For every The symbol is a Greek lowercase letter pronounced "epsilon".
Although the definition customarily uses the letter , it can be replaced by any other letter, as long as the letter is different from the other letters in use. The reason for sticking to a standard letter choice is that it reduces cognitive overload.
there exists such that The symbol is a Greek lowercase letter pronounced "delta"
Although the definition customarily uses the letter , it can be replaced by any other letter, as long as the letter is different from the other letters in use. The reason for sticking to a standard letter choice is that it reduces cognitive overload.
for all satisfying The symbol stands for the absolute value function.
stands for "is in the set" so the statements should be read as saying that is in the set described in the two equivalent ways.
stands for the union, so the statement that should be parsed as saying that or
stands for set difference, so the statement can be parsed as saying that could be any value in except . The point is excluded because we do not want the value of at to affect the limit notion.
we have The symbol stands for the absolute value function.
stands for "is in the set" so the statement should be read as saying that is in the set .

The limit (also called the two-sided limit) is defined as a value such that . By the uniqueness theorem for limits, there is at most one value of for which . Hence, it makes sense to talk of the limit when it exists.

{{#widget:YouTube|id=0vy0Fslxi-k}}

Full timed transcript: [SHOW MORE]

Checkpoint questions:

  • In order to make sense of where must the function be defined? Must be defined at ? If exists, what can we say about its value?
  • What's the formal definition of limit, i.e., what does mean?
  • How would you write the formal definition of limit using intervals rather than absolute value inequalities to describe where and should be?
  • Why is there a "" in the inequality in the definition? Why doesn't a appear in the part of the definition?
  • In order to be able to talk of the limit , what additional fact do we need beyond the definition of what means?

Left-hand limit

Suppose is a function of one variable and is a point such that is defined on the immediate left of (note that may or may not be defined at ). In other words, there exists some value such that is defined on .

For a given value , we say that:

if the following holds:

For every , there exists such that for all satisfying , we have .

The definition is broken down into its four clauses below:

Clause Interval description Symbol explanations
For every The symbol is a Greek lowercase letter pronounced "epsilon".
Although the definition customarily uses the letter , it can be replaced by any other letter, as long as the letter is different from the other letters in use. The reason for sticking to a standard letter choice is that it reduces cognitive overload.
there exists such that The symbol is a Greek lowercase letter pronounced "delta"
Although the definition customarily uses the letter , it can be replaced by any other letter, as long as the letter is different from the other letters in use. The reason for sticking to a standard letter choice is that it reduces cognitive overload.
for all satisfying The symbol stands for the absolute value function.
stands for "is in the set" so the statements should be read as saying that is in the set describing the immediate -left of .
we have The symbol stands for the absolute value function.
stands for "is in the set" so the statement should be read as saying that is in the set .

The left-hand limit (acronym LHL) is defined as a value such that . By the uniqueness theorem for limits (one-sided version), there is at most one value of for which . Hence, it makes sense to talk of the left hand limit when it exists.

Right-hand limit

Suppose is a function of one variable and is a point such that is defined on the immediate right of (note that may or may not be defined at ). In other words, there exists some value such that is defined on .

For a given value , we say that:

if the following holds:

For every , there exists such that for all satisfying , we have .

The definition is broken down into its four clauses below:

Clause Interval description Symbol explanations
For every The symbol is a Greek lowercase letter pronounced "epsilon".
Although the definition customarily uses the letter , it can be replaced by any other letter, as long as the letter is different from the other letters in use. The reason for sticking to a standard letter choice is that it reduces cognitive overload.
there exists such that The symbol is a Greek lowercase letter pronounced "delta"
Although the definition customarily uses the letter , it can be replaced by any other letter, as long as the letter is different from the other letters in use. The reason for sticking to a standard letter choice is that it reduces cognitive overload.
for all satisfying The symbol stands for the absolute value function.
stands for "is in the set" so the statements should be read as saying that is in the set describing the immediate -right of .
we have The symbol stands for the absolute value function.
stands for "is in the set" so the statement should be read as saying that is in the set .

The right-hand limit (acronym RHL) is defined as a value such that . By the uniqueness theorem for limits (one-sided version), there is at most one value of for which . Hence, it makes sense to talk of the right hand limit when it exists.

Side-by-side comparison of the definitions

Clause for two-sided limit Clause for left hand limit Clause for right hand limit Comments
For every For every For every identical so far
there exists such that there exists such that there exists such that still identical
for all satisfying , i.e., for all satisfying , i.e., for all satisfying , i.e., this is the part that differs, in so far as it is the direction of domain approach that differs between the definitions.
we have , i.e., we have , i.e., we have , i.e., this part is again identical. Note that the left versus right is only about the direction of approach in the domain, not about the direction of approach of the function value.
{{#widget:YouTube|id=qBjqc78KGx0}}

Full timed transcript: [SHOW MORE]

Checkpoint questions:

  • In order to make sense of , where must the function be defined? Must be defined at ? If exists, what can we say about its value?
  • The definitions of left hand limit, right hand limit and ordinary (two-sided) limit are pretty similar. There is only one clause that differs across the three definitions. What clause is this, and how does it differ across the definitions? Explain both in inequality notation and in interval notation.
  • Why should we be careful when dealing with one-sided limits in the context of function compositions?

Relation between the limit notions

The two-sided limit exists if and only if (both the left hand limit and right hand limit exist) and (they are equal to each other).

Explicitly, exists if all three of these conditions hold:

  • exists.
  • exists.
  • .

Moreover, in the event that both one-sided limits exist and are equal, the two-sided limit is equal to both of them.

Further, a particular value of works for a particular value of in the two-sided limit definition if and only if it works in both the left hand limit definition and the right hand limit definition.

Definition of finite limit for function of one variable in terms of a game

The formal definitions of limit, as well as of one-sided limit, can be reframed in terms of a game. This is a special instance of an approach that turns any statement with existential and universal quantifiers into a game.

Two-sided limit

Consider the limit statement, with specified numerical values of and and a specified function :

Note that there is one trivial sense in which the above statement can be false, or rather, meaningless, namely, that is not defined on the immediate left or immediate right of . In that case, the limit statement above is false, but moreover, it is meaningless to even consider the notion of limit. We therefore omit this sense from consideration and consider instead only the situation where is defined on the immediate left and immediate right of .

The game is between two players, a Prover whose goal is to prove that the limit statement is true, and a Skeptic (also called a Verifier or sometimes a Disprover) whose goal is to show that the statement is false. The game has three moves:

  1. First, the skeptic chooses , or equivalently, chooses the target interval in which the skeptic is challenging the prover to trap the function.
  2. Then, the prover chooses , or equivalently, chooses the interval .
  3. Then, the skeptic chooses a value satisfying , or equivalently, , which is the same as .

Now, if (i.e., ), the prover wins. Otherwise, the skeptic wins.

We say that the limit statement

is true if the prover has a winning strategy for this game. The winning strategy for the prover basically constitutes a strategy to choose an appropriate in terms of the chosen by the skeptic. Thus, it is an expression of as a function of . Verbally, the goal of the prover is to choose a value of so that when the input is restricted to being within distance of , the output is trapped to within distance of the claimed limit .

We say that the limit statement

is false if the skeptic has a winning strategy for this game. The winning strategy for the skeptic involves a choice of , and a strategy that chooses a value of (constrained in the specified interval) based on the prover's choice of .

Let's review the definition in conjunction with the game along with a deeper semantic understanding of the steps:

Step no. Clause of definition Who moves? What is chosen? Constraints on the choice Comment
1 For every Skeptic Must be positive The "for every" corresponds to the idea that the move is made by the side that does not have a winning strategy, because we want to argue that the side that does have a winning strategy can win no matter what.
2 there exists such that Prover Must be positive The "there exists" corresponds to the idea that the move is made by the side that has a winning strategy, because that side gets to choose a favorable value of the variable (in this case ).
3 for all satisfying , Skeptic Must be within the interval The "for all" corresponds to the idea that the move is made by the side that does not have a winning strategy, because we want to argue that the side that does have a winning strategy can win no matter what.
4 we have Neither; it's time for the judge to decide -- If (the condition that we desire) the prover wins. Else, the skeptic wins.

Slight subtlety regarding domain of definition: [SHOW MORE]

{{#widget:YouTube|id=Kh253PUghFk}}

Full timed transcript: [SHOW MORE]

Negation of limit statement and non-existence of limit

We now consider the explicit description of the definition for the case that the skeptic has a winning strategy for the limit game for , i.e., for the limit statement being false.

In words, the definition is:

There exists such that for every , there exists satisfying and .

Let's review the definition in conjunction with the game along with a deeper semantic understanding of the steps:

Step no. Clause of definition for original limit statement (i.e., prover has a winning strategy) Clause of definition for skeptic having a winning strategy Who moves? What is chosen? Constraints on the choice Comment
1 For every There exists such that Skeptic Must be positive Whether we use "for every" or "there exists" depends on who we're rooting for.
2 there exists such that for every , Prover Must be positive Whether we use "for every" or "there exists" depends on who we're rooting for.
3 for all satisfying , there exists satisfying and Skeptic Must be within the interval Whether we use "for every" or "there exists" depends on who we're rooting for.
4 we have . Neither; it's time for the judge to decide -- If , the prover wins. Else, the skeptic wins. The conditions are negatives of one another.
{{#widget:YouTube|id=N0U8Y11nlPk}}

Full timed transcript: [SHOW MORE]

Non-existence of limit

The statement does not exist could mean one of two things:

  1. is not defined around , i.e., there is no for which is defined on . In this case, it does not even make sense to try taking a limit.
  2. is defined around , except possibly at , i.e., there is for which is defined on . So, it does make sense to try taking a limit. However, the limit still does not exist.

The formulation of the latter case is as follows:

For every , there exists such that for every , there exists satisfying and such that .

We can think of this in terms of a slight modification of the limit game, where, in our modification, there is an extra initial move by the prover to propose a value for the limit. The limit does not exist if the skeptic has a winning strategy for this modified game.

An example of a function that does not have a limit at a specific point is the sine of reciprocal function. Explicitly, the limit:

does not exist. The skeptic's winning strategy is as follows: regardless of the chosen by the prover, pick a fixed (independent of , so can be decided in advance of the game -- note that the skeptic could even pick and the strategy would still work). After the prover has chosen a value , find a value such that the function value lies outside . This is possible because the interval has width , hence cannot cover the entire interval , which has width 2. However, the range of the function on is all of .

Crucially, the inability of the prover to trap the function value close to any point as is the reason the limit fails to exist.

{{#widget:YouTube|id=JoVuC4pksWs}}

Full timed transcript: [SHOW MORE]

Strategic aspects

The strategy of small

In the game formulation of the limit, the following loose statements are true:

  • "Smaller is smarter" for the skeptic, i.e., the smaller the choice of , the better the outlook is for the skeptic to win.
  • "Smaller is smarter" for the prover, i.e., the smaller the choice of , the better the outlook is for the prover to win.

In other words, each side benefits by making the crucial move of that side as small as possible. However, there does not exist any single arbitrarily small number -- this is related to the observation in the motivation section that there is no such thing as a single arbitrarily close number. Thus, saying "choose as small a value as possible" is not a coherent strategy. What we can say is the following:

  • If a value of works for a given value of , the same value of also works for larger choices of .
  • If a value of works for a given value of , smaller values of also work for the same choice of .

Prover's strategy revisited

The prover, in choosing a winning strategy, must specify a rule that can determine a value of that works in terms of the value of specified by the skeptic. In other words, the prover must have a way of specifying as a function of .

The skeptic also chooses in the next move. However, the prover has no way of knowing the value of that the skeptic plans to pick. Thus, in order for the prover to have a winning strategy, the prover's choice of should be such that no matter what the skeptic picks, the prover wins.

Skeptic's strategy revisited

The skeptic, in choosing a winning strategy, must specify the value of and then specify how to pick a value of that works. When picking the value of , the skeptic does not know what the prover will pick. Thus, the skeptic's choice of cannot be dependent on the prover's subsequent choice of .

However, when picking the value of , the skeptic is aware of (and constrained by) the prover's choice of .

Misconceptions

Most misconceptions associated with the formal definition of limit have to do with the ordering of the moves in the game, who's in charge of what move, and what information each person has at the time of making the move. We describe some common misconceptions below.

{{#widget:YouTube|id=F0r_offAc5M}}

Full timed transcript: [SHOW MORE]

Strongly telepathic prover

Spot the error in this:

Consider the limit problem . The proof corresponding to this problem would involve a game between a prover and a skeptic. To show that the limit statement is true, it suffices to exhibit a winning strategy for the prover for the game. The strategy is as follows. Pick . Let's prove that this works.

Specific claim: For any skeptic-picked , if the prover picks such that , then regardless of the that the skeptic picks with , we have .

Proof of claim: We have:

The error is as follows: [SHOW MORE]

Mildly telepathic prover

Spot the error in this:

Consider the limit problem:

We want to show that
For this game, we need to exhibit a winning strategy for the prover. The winning strategy is as follows. The skeptic first chooses . The prover now makes two cases. If the skeptic is planning to pick a rational value of , then the prover chooses the strategy . If the skeptic is planning to choose an irrational value of , then the prover can pick any .
Clearly, the prover's strategy works in both cases, so we have a winning strategy.

Th error is as follows: [SHOW MORE]

You say you want a replay?

Spot the error in this:

Consider the limit problem . Let's think of this in terms of an game. The skeptic begins by picking . The prover chooses . The skeptic now chooses . This value of is within the -distance of . It's now checked that is within -distance of the claimed limit . The prover has thus won the game, and we have established the truth of the limit statement.

The error is as follows: [SHOW MORE]

Playing to lose

Spot the error in this:

Here's an easy proof that . We need to show that the prover has a winning strategy for the game. Let's say the skeptic starts out by picking . The prover then picks . It can now easily be verified that for , , because the function is trapped within . Thus, the prover has succeeded in trapping the function within the $\varepsilon$-interval specified by the skeptic, and hence won the game. The limit statement is therefore true.

The error is as follows: [SHOW MORE]

Conceptual definition and various cases

Formulation of conceptual definition

Below is the conceptual definition of limit. Suppose is a function defined in a neighborhood of the point , except possibly at the point itself. We say that:

if:

  • For every choice of neighborhood of (where the term neighborhood is suitably defined)
  • there exists a choice of neighborhood of (where the term neighborhood is suitably defined) such that
  • for all that are in the chosen neighborhood of
  • is in the chosen neighborhood of .
{{#widget:YouTube|id=bE_aKfmUHN8}}

Full timed transcript: [SHOW MORE]

Functions of one variable case

The following definitions of neighborhood are good enough to define limits.

  • For points in the interior of the domain, for functions of one variable: We can take an open interval centered at the point. For a point , such an open interval is of the form . Note that if we exclude the point itself, we get .
  • For the point , for functions of one variable: We take intervals of the form , where .
  • For the point , for functions of one variable: We can take interval of the form , where .

We can now list the nine cases of limits, combining finite and infinite possibilities:

Case Definition
For every , there exists such that for all satisfying (i.e., ), we have (i.e., ).
For every , there exists such that for all satisfying (i.e., ), we have (i.e., ).
For every , there exists such that for all satisfying (i.e., ), we have (i.e., ).
For every , there exists such that for all satisfying (i.e., ), we have (i.e., ).
For every , there exists such that for all satisfying (i.e., ), we have (i.e., ).
For every , there exists such that for all satisfying (i.e., ), we have (i.e., ).
For every , there exists such that for all satisfying (i.e., ), we have (i.e., ).
For every , there exists such that for all satisfying (i.e., ), we have (i.e., ).
For every , there exists such that for all satisfying (i.e., ), we have (i.e., ).
{{#widget:YouTube|id=EOQby7b-WrA}}

Limit of sequence versus real-sense limit

Recall that the limit of a real-valued function to infinity is defined as follows:

means that:

  • For every
  • there exists (we're thinking of the neighborhood ) such that
  • for all (i.e. )
  • we have (i.e., ).

Suppose now instead that is a function restricted to the natural numbers. We can think of as a sequence, namely the sequence . In that case:

(in words, the sequence converges to ) means that:

  • For every
  • there exists such that
  • for all satisfying ,
  • we have (i.e., ).

The definitions differ both in their second and third line. However, the difference in the second line (the use of a real number versus a natural number to specify the threshold for the trapping interval) is not important, i.e., we could swap these lines between the definitions without changing the sense of either definition. The key difference between the definitions lies in their third lines. In the real-sense limit definition case, we require trapping of the function value close to the claimed limit for all sufficiently large reals whereas the sequence limit definition requires trapping only for all sufficiently large natural numbers.

To understand this distinction, consider the following: if is defined on reals, and it has a real-sense limit, i.e., for some , then it must also be true that . However, it is possible for to have a sequence limit but not have a real-sense limit. For instance, the function has undefined but is zero, because takes the value 0 at all integers.

{{#widget:YouTube|id=P9APtpIE4y8}}

Full timed transcript: [SHOW MORE]

Real-valued functions of multiple variables case

We consider the multiple input variables as a vector input variable, as the definition is easier to frame from this perspective.

The correct notion of neighborhood is as follows: for a point , we define the neighborhood parametrized by a positive real number as the open ball of radius centered at , i.e., the set of all points such that the distance from to is less than . This distance is the same as the norm of the difference vector . The norm is sometimes denoted . This open ball is sometimes denoted .

Suppose is a real-valued (i.e., scalar) function of a vector variable . Suppose is a point such that is defined "around" , except possibly at . In other words, there is an open ball centered at such that is defined everywhere on that open ball, except possibly at .

With these preliminaries out of the way, we can define the notion of limit. We say that:

if the following holds:

  • For every
  • there exists such that
  • for all satisfying (i.e., is in a ball of radius centered at but not the point itself -- note that the notation is for the norm, or length, of a vector)
  • we have . Note that and are both scalars, so the here is the usual absolute value function.
{{#widget:YouTube|id=usb3jew_QVI}}