Video:Limit: Difference between revisions

From Calculus
Line 2,842: Line 2,842:


<center>{{#widget:YouTube|id=Kms_VHwgdZ8}}</center>
<center>{{#widget:YouTube|id=Kms_VHwgdZ8}}</center>
Full timed transcript: <toggledisplay>
0:00:15.500,0:00:19.140
Vipul: Okay. This talk is going to be about
certain misconceptions
0:00:19.140,0:00:22.440
that people have regarding limits and these
are misconceptions that
0:00:22.440,0:00:25.840
people generally acquire after...
0:00:25.840,0:00:29.180
These are not the misconceptions that
people have before studying limits,
0:00:29.180,0:00:32.730
these are misconceptions you might have after
studying limits,
0:00:32.730,0:00:35.059
after studying the epsilon delta definition.
0:00:35.059,0:00:38.550
I'm going to describe these misconceptions
in terms of the limit game,
0:00:38.550,0:00:41.900
the prover skeptic game of the limit. Though
the misconceptions
0:00:41.900,0:00:45.850
themselves can be, sort of, don't depend
on the understanding of the
0:00:45.850,0:00:49.059
game but to understand exactly what's
happening, it's better to think
0:00:49.059,0:00:51.010
of it in terms of the game.
0:00:51.010,0:00:55.370
First recall the definition. So limit as x
approaches c of f(x) is a
0:00:55.370,0:01:01.629
number L; so c and L are both numbers, real
numbers. f is a function,
0:01:01.629,0:01:06.380
x is approaching c. And we said this is true
if the following -- for
0:01:06.380,0:01:10.180
every epsilon greater than zero, there exists
a delta greater than
0:01:10.180,0:01:14.800
zero such that for all x which are given delta
distance of c, f(x) is
0:01:14.800,0:01:17.590
within epsilon distance of L. Okay?
0:01:17.590,0:01:24.590
Now, how do we describe this in terms for
limit game?
0:01:26.530,0:01:33.530
KM: So, skeptic starts off with the first
part of the definition.
0:01:34.990,0:01:38.189
Vipul: By picking the epsilon? Okay, that's
the thing written in
0:01:38.189,0:01:42.939
black. What's the skeptic trying to do? What's the
goal of the skeptic?
0:01:42.939,0:01:49.100
KM: To try and pick an epsilon that would
not work.
0:01:49.100,0:01:53.450
Vipul: So the goal of the skeptic is to try
to show that the statement is false.
0:01:53.450,0:01:54.100
KM: Yeah.
0:01:54.100,0:01:57.790
Vipul: Right? In this case the skeptic should
try to start by choosing
0:01:57.790,0:02:02.220
an epsilon that is really -- the goal of
the skeptic is to pick an
0:02:02.220,0:02:04.500
epsilon that's really small, what is the
skeptic trying to challenge
0:02:04.500,0:02:07.920
the prover into doing by picking the epsilon?
The skeptic is trying to
0:02:07.920,0:02:11.959
challenge the prover into trapping the function
close to L when x is
0:02:11.959,0:02:17.040
close to c. And the skeptic specifies what
is meant by "close to L" is
0:02:17.040,0:02:19.860
by the choice of epsilon. Okay?
0:02:19.860,0:02:24.900
When picking epsilon the skeptic is
effectively picking this interval, L -
0:02:24.900,0:02:30.700
epsilon, L + epsilon). Okay? And basically
that's what the skeptic is
0:02:30.700,0:02:33.680
doing. The prover is then picking a delta.
What is the goal of the
0:02:33.680,0:02:36.239
prover in picking the delta? The prover is
saying, "Here's how I can
0:02:36.239,0:02:40.099
trap the function within that interval. I'm
going to pick a delta and
0:02:40.099,0:02:43.520
my claim is that if the x value within delta distance of c, except the
0:02:43.520,0:02:47.000
point c itself, so my claim is for any x value
there the function is
0:02:47.000,0:02:48.260
trapped in here."
0:02:48.260,0:02:52.819
So, the prover picks the delta and then the
skeptic tries to meet the
0:02:52.819,0:02:56.709
prover's claim or rather, test the prover's
claim by picking an x
0:02:56.709,0:02:59.670
which is within the interval specified by
the prover and then they
0:02:59.670,0:03:03.379
both check whether f(x) is within epsilon
distance [of L]. If it is
0:03:03.379,0:03:07.940
then the prover wins and if it is not, if
this [|f(x) - L|]is not less
0:03:07.940,0:03:09.989
than epsilon then the skeptic wins. Okay?
0:03:09.989,0:03:13.659
So, the skeptic is picking the neighborhood
of the target point which
0:03:13.659,0:03:17.030
in this case is just the open interval of
radius epsilon, the prover
0:03:17.030,0:03:21.940
is picking the delta which is effectively the
neighborhood of the domain
0:03:21.940,0:03:25.760
point except the point c as I've said open
interval (c - delta, c +
0:03:25.760,0:03:30.870
delta) excluding c and then the skeptic picks
an x in the neighborhood
0:03:30.870,0:03:35.700
specified by prover and if the function value
is within the interval
0:03:35.700,0:03:38.830
specified by the skeptic then the prover wins.
0:03:38.830,0:03:41.989
Now, what does it mean to say the statement
is true in terms of the
0:03:41.989,0:03:43.080
game?
0:03:43.080,0:03:50.080
KM: So, it means that the prover is always
going to win the game.
0:03:51.849,0:03:55.629
Vipul: Well, sort of. I mean the prover may
play it stupidly. The
0:03:55.629,0:04:00.750
prover can win the game if the prover plays
well. So, the prover has a
0:04:00.750,0:04:03.230
winning strategy for the game. Okay?
0:04:05.230,0:04:10.299
The statement is true if the prover has a
winning strategy for [the
0:04:10.299,0:04:14.090
game] and that means the prover has a way
of playing the game such that
0:04:14.090,0:04:17.320
whatever the skeptic does the prover is going
to win the game. The
0:04:17.320,0:04:20.789
statement is considered false if the skeptic
has a winning strategy
0:04:20.789,0:04:23.370
for the game which means the skeptic has a
way of playing so that
0:04:23.370,0:04:25.729
whatever the prover does the skeptic can win
the game.
0:04:25.729,0:04:27.599
Or if the game doesn't make sense at all
...
0:04:27.599,0:04:29.460
maybe the function is not defined on
0:04:29.460,0:04:31.050
the immediate left and right of c.
0:04:31.050,0:04:32.370
If the function isn't defined then we
0:04:32.370,0:04:34.160
cannot even make sense of the statement.
0:04:34.160,0:04:36.990
Either way -- the skeptic has a winning strategy
0:04:36.990,0:04:37.770
or the game doesn't make sense --
0:04:41.770,0:04:43.470
then the statement is false.
0:04:43.470,0:04:47.660
If the prover has a winning strategy
the statement is true.
0:04:47.660,0:04:54.660
With this background in mind let's look
at some common misconceptions.
0:04:56.540,0:05:03.540
Okay. Let's say we are trying to prove that
the limit as x approaches
0:05:27.620,0:05:31.530
2 of x^2 is 4, so is that statement correct?
The statement we're
0:05:31.530,0:05:32.060
trying to prove?
0:05:32.060,0:05:32.680
KM: Yes.
0:05:32.680,0:05:35.960
Vipul: That's correct. Because in fact x^2
is a continuous function
0:05:35.960,0:05:40.160
and the limit of a continuous function at
the point is just the
0:05:40.160,0:05:43.030
value at the point and 2^2 is 4. But we're
going to now try to prove
0:05:43.030,0:05:48.530
this formally using the epsilon-delta definition
of limit, okay? Now
0:05:48.530,0:05:51.229
in terms of the epsilon-delta definition or
rather in terms of this
0:05:51.229,0:05:55.160
game setup, what we need to do is we need
to describe a winning
0:05:55.160,0:06:01.460
strategy for the prover. Okay? We need to
describe delta in terms of
0:06:01.460,0:06:05.240
epsilon. The prover essentially ... the only
move the prover makes is
0:06:05.240,0:06:09.130
this choice of delta. Right? The skeptic picked
epsilon, the prover
0:06:09.130,0:06:12.810
picked delta then the skeptic picks x and
then they judge who won. The
0:06:12.810,0:06:15.810
only choice the prover makes is the choice
of delta, right?
0:06:15.810,0:06:16.979
KM: Exactly.
0:06:16.979,0:06:20.080
Vipul: The prover chooses the delta in terms
of epsilon.
0:06:20.080,0:06:24.819
So, here is my strategy. My strategy is I'm
going to choose delta as,
0:06:24.819,0:06:29.509
I as a prover is going to choose delta as
epsilon over the absolute
0:06:29.509,0:06:33.690
value of x plus 2 [|x + 2|]. Okay?
0:06:33.690,0:06:36.880
Now, what I want to show that this strategy
works. So, what I'm aiming
0:06:36.880,0:06:39.840
is that if ... so let me just finish this
and then you can tell me where
0:06:39.840,0:06:43.419
I went wrong here, okay? I'm claiming that
this strategy works which
0:06:43.419,0:06:47.130
means I'm claiming that if the skeptic now
picks any x which is within
0:06:47.130,0:06:54.130
delta distance of 2; the target point,
0:06:56.710,0:07:01.490
then the function value is within epsilon
distance of 4, the claimed
0:07:01.490,0:07:04.080
limit. That's what I want to show.
0:07:04.080,0:07:08.300
Now is that true? Well, here's how I do
it. I think, I started by
0:07:08.300,0:07:13.539
picking this expression, I factored it as
|x - 2||x + 2|. The absolute
0:07:13.539,0:07:16.810
value of product is the product of the absolute
values so this can be
0:07:16.810,0:07:21.599
split like that. Now I see, while we know
that |x - 2| is less than
0:07:21.599,0:07:24.979
delta and this is a positive thing. So we
can either less than delta
0:07:24.979,0:07:31.979
times absolute value x plus 2. Right? And
this delta is epsilon over
0:07:35.599,0:07:37.620
|x + 2| and we get epsilon.
0:07:37.620,0:07:40.460
So, this thing equals something, less than
something, equals
0:07:40.460,0:07:43.580
something, equals something, you have a chain
of things, there's one
0:07:43.580,0:07:47.720
step that you have less than. So overall we
get that this expression,
0:07:47.720,0:07:53.740
this thing is less than epsilon. So, we have
shown that whatever x the
0:07:53.740,0:08:00.370
skeptic would pick, the function value lies
within the epsilon
0:08:00.370,0:08:05.030
distance of the claimed limit. Whatever the
skeptic picks (x within the
0:08:05.030,0:08:09.240
delta distance of the target point).
0:08:09.240,0:08:16.240
Does this strategy work? Is this a proof?
What's wrong with this?
0:08:24.270,0:08:31.270
Do you think there's anything wrong
with the algebra down here?
0:08:33.510,0:08:40.510
KM: Well, we said that ...
0:08:40.910,0:08:47.910
Vipul: So, is there anything wrong in the
algebra here? This is this,
0:08:50.160,0:08:51.740
this is less than delta, delta ... So, this
part
0:08:51.740,0:08:52.089
seems fine, right?
0:08:52.089,0:08:52.339
KM: Yes.
0:08:52.330,0:08:55.640
Vipul: There's nothing wrong in the algebra
here. So, what could be
0:08:55.640,0:09:00.310
wrong? Our setup seems fine. If the x value
is within delta distance
0:09:00.310,0:09:03.350
of 2 then the function value is within epsilon
this is 4. That's
0:09:03.350,0:09:05.360
exactly what we want to prove, correct?
0:09:05.360,0:09:11.120
So, there's nothing wrong this point onward.
So, the error happened
0:09:11.120,0:09:14.440
somewhere here. Where do you think that part
you think what is wrong
0:09:14.440,0:09:21.160
here? In the strategy choice step? What do
you think went wrong in the
0:09:21.160,0:09:24.010
strategy choice step?
0:09:24.010,0:09:28.850
What? Okay, so let's go over the game. Skeptic
will choose the epsilon,
0:09:28.850,0:09:29.760
then?
0:09:29.760,0:09:35.130
KM: Then the prover chooses delta.
0:09:35.130,0:09:36.080
Vipul: Prover chooses delta. Then?
0:09:36.080,0:09:39.529
KM: Then the skeptic has to choose the x value.
0:09:39.529,0:09:42.470
Vipul: x value. So, when the prover is deciding
the strategy, when the
0:09:42.470,0:09:45.860
prover is choosing the delta, what information
does the prover have?
0:09:45.860,0:09:48.410
KM: He just has the information epsilon.
0:09:48.410,0:09:50.500
Vipul: Just the information on epsilon. So?
0:09:50.500,0:09:57.060
KM: So, in this case the mistake was that
because he didn't know the x value yet?
0:09:57.060,0:10:03.100
Vipul: The strategy cannot depend on x.
0:10:03.100,0:10:04.800
KM: Yeah.
0:10:04.800,0:10:09.790
Vipul: So, the prover is sort of picking the
delta based on x but the
0:10:09.790,0:10:12.660
prover doesn't know x at this stage when
picking the delta. The delta
0:10:12.660,0:10:15.910
that the prover chooses has to be completely
a function of epsilon
0:10:15.910,0:10:19.680
alone, it cannot depend on the future moves
of the skeptic because the
0:10:19.680,0:10:23.700
prover cannot read the skeptic's mind. Okay?
And doesn't know what the
0:10:23.700,0:10:24.800
skeptic plans to do.
0:10:24.800,0:10:31.800
So that is the ... that's the ... I call
this ... can you see what I
0:10:42.240,0:10:43.040
call this?
0:10:43.040,0:10:45.399
KM: The strongly telepathic prover.
0:10:45.399,0:10:51.470
Vipul: So, do you know what I meant by that?
Well, I meant the prover
0:10:51.470,0:10:58.470
is sort of reading the skeptic's mind. All
right? It's called
0:11:07.769,0:11:10.329
telepathy.
0:11:10.329,0:11:17.329
Okay, the next one.
0:11:25.589,0:11:30.230
This one says that the function defined this
way. Okay? It's defined
0:11:30.230,0:11:34.829
as g(x) is x when x is rational and zero when
x is irrational. So,
0:11:34.829,0:11:41.829
what would this look like? Well, it's like
this. There's a line y
0:11:42.750,0:11:49.510
equals x and there's the x-axis and the
graph is just the irrational x
0:11:49.510,0:11:52.750
coordinate parts of this line and the rational
x coordinate parts of
0:11:52.750,0:11:56.350
this line. It's kind of like both these
lines but only parts of
0:11:56.350,0:11:58.529
them. Right?
0:11:58.529,0:12:02.079
Now we want to show that limit as x approaches
zero of g(x) is
0:12:02.079,0:12:06.899
zero. So just in here, do you think the statement
is true? That x goes
0:12:06.899,0:12:09.910
to zero, does this function go to zero?
0:12:09.910,0:12:10.610
KM: Yes.
0:12:10.610,0:12:17.610
Vipul: Because both the pieces are going to
zero. That's the inclusion. Okay?
0:12:20.610,0:12:24.089
This is the proof we have here. So the idea,
we again think about it
0:12:24.089,0:12:27.790
in terms of the game. The skeptic first picks
the epsilon, okay? Now
0:12:27.790,0:12:30.779
that we would have to choose the delta, but
there are really two cases
0:12:30.779,0:12:35.200
on x, right? x rational and x irrational.
So the prover chooses the
0:12:35.200,0:12:39.459
delta based on sort of whether the x is rational
or irrational, so if
0:12:39.459,0:12:43.880
the x is rational then the prover just picks
delta equals epsilon, and
0:12:43.880,0:12:48.339
that's good enough for rational x, right?
Because for rational x the
0:12:48.339,0:12:51.410
slope of the line is one so picking delta
as epsilon is good enough.
0:12:51.410,0:12:55.760
For irrational x, if the skeptic's planning
to choose an irrational x
0:12:55.760,0:12:59.730
then the prover can just choose any delta
actually. Like just pick
0:12:59.730,0:13:03.880
the delta in advance. Like delta is one or
something. Because if x is
0:13:03.880,0:13:10.430
irrational then it's like a constant function
and therefore, like, for
0:13:10.430,0:13:14.970
any delta the function is trapped within epsilon
distance of the given
0:13:14.970,0:13:16.970
limit. Okay?
0:13:16.970,0:13:19.950
So the prover sort of makes two cases based
on whether the skeptic
0:13:19.950,0:13:26.950
will pick a rational or an irrational x and
sort of based on that if
0:13:27.040,0:13:30.730
it's rational this is the prover's strategy,
if it's irrational then
0:13:30.730,0:13:34.050
the prover can just do any delta.
0:13:34.050,0:13:37.630
Can you tell me what's wrong with this proof?
0:13:37.630,0:13:44.630
KM: So, you're still kind of basing it on
what the skeptic is going to
0:13:44.750,0:13:45.800
pick next.
0:13:45.800,0:13:49.100
Vipul: Okay. It's actually pretty much the
same problem [as the
0:13:49.100,0:13:55.449
preceding one], in a somewhat minor form.
The prover is sort of making
0:13:55.449,0:13:59.959
cases based on what the skeptic is going to
do next, and choosing a
0:13:59.959,0:14:01.940
strategy according to that. But the prover
doesn't actually know what
0:14:01.940,0:14:05.089
the skeptic is going to do next, so the prover
should actually have a
0:14:05.089,0:14:08.970
single strategy that works in both cases.
If cases will be made to
0:14:08.970,0:14:12.209
prove that the strategy works so the prover
has to have a single
0:14:12.209,0:14:12.459
strategy.
0:14:12.449,0:14:15.370
Now in this case the strategy we can choose
the prover just, the
0:14:15.370,0:14:18.779
prover can pick delta as epsilon because that
will work in both cases.
0:14:18.779,0:14:20.019
KM: Exactly.
0:14:20.019,0:14:23.320
Vipul: Yeah. But in general if you have two
different piece
0:14:23.320,0:14:26.579
definitions then the way you would do it so
you would pick delta as
0:14:26.579,0:14:30.300
the min [minimum] of the delta that work in
the two different pieces,
0:14:30.300,0:14:32.910
because you sort of want to make sure that
both cases are covered. But
0:14:32.910,0:14:36.730
the point is you have to do that -- take
the min use that rather than
0:14:36.730,0:14:39.730
just say, "I'm going to choose my delta
based on what the skeptic is
0:14:39.730,0:14:42.589
going to move next." Okay?
0:14:42.589,0:14:49.120
This is a minor form of the same misconception
that that was there in
0:14:49.120,0:14:56.120
the previous example we saw.
0:15:04.620,0:15:11.620
So, this is what I call the mildly telepathic
prover, right? The
0:15:14.970,0:15:18.579
prover is still behaving telepathically
predicting the skeptic's future
0:15:18.579,0:15:23.740
moves but it's not so bad. The prover is
just making, like, doing a
0:15:23.740,0:15:25.470
coin toss type of telepathy. That isn't
the only one the prover is
0:15:25.470,0:15:30.790
actually, deciding exactly what x skeptic
would take. But it's still
0:15:30.790,0:15:32.790
the same problem and the reason why I think
people will have this
0:15:32.790,0:15:36.329
misconception is because they don't think
about it in terms of the
0:15:36.329,0:15:38.970
sequence in which the moves are made, and
the information that each
0:15:38.970,0:15:45.970
body has at any given stage of the game.
0:15:50.889,0:15:57.889
Let's do this one.
0:16:10.930,0:16:15.259
So, this is a limit game, right? Let's say
that limit as x approaches
0:16:15.259,0:16:22.259
1 of 2x is 2, okay? How do we go about showing
this? Well, the idea is
0:16:23.699,0:16:27.990
let's play the game, right? Let's say
the skeptic it picks epsilon as
0:16:27.990,0:16:34.990
0.1, okay? The prover picks delta as 0.05.
The skeptic is then picking
0:16:35.139,0:16:38.790
epsilon as 0.1, the skeptic is saying, "Please
trap the function
0:16:38.790,0:16:43.800
between 1.9 and 2.1. Okay? Find the delta
small enough so that the
0:16:43.800,0:16:48.389
function value is dropped between 1.9 and
2.1. The prover picks delta
0:16:48.389,0:16:55.389
as 0.05 which means the prover is now getting
the input value trap
0:16:57.850,0:17:04.850
between 0.95 and 1.05. That's 1 plus minus
this thing. And now the
0:17:05.439,0:17:09.070
prover is claiming that if the x value is
within this much distance of
0:17:09.070,0:17:13.959
1 except the value equal to 1, then the function
value is within 0.1
0:17:13.959,0:17:17.630
distance of 2. So, the skeptic tries picking
x within the interval
0:17:17.630,0:17:23.049
prescribed by the prover, so maybe the skeptic
picks 0.97 which is
0:17:23.049,0:17:26.380
within 0.05 distance of 1.
0:17:26.380,0:17:31.570
And then they check that f(x) is 1.94, that
is at the distance of 0.06
0:17:31.570,0:17:38.570
from 2. So, it's within 0.1 of the claimed
limit. Who won the game?
0:17:38.780,0:17:42.650
If the thing is within the interval then who
wins?
0:17:42.650,0:17:43.320
KM: The prover.
0:17:43.320,0:17:46.720
Vipul: The prover wins, right? So, the prover
won again so therefore
0:17:46.720,0:17:52.100
this limit statement is true, right? So, what's
wrong with this as a
0:17:52.100,0:17:57.370
proof that the limit statement is true? How
is this not a proof that
0:17:57.370,0:18:03.870
the limit statement is true? This what I've
written here, why is that
0:18:03.870,0:18:05.990
not a proof that the limit statement is true?
0:18:05.990,0:18:11.960
KM: Because it's only an example for the
specific choice of epsilon and x.
0:18:11.960,0:18:16.200
Vipul: Yes, exactly. So, it's like a single
play of the game, the
0:18:16.200,0:18:20.470
prover wins, but the limit statement doesn't
just say that the prover
0:18:20.470,0:18:24.380
wins the game, it says the prover has a winning
strategy. It says that
0:18:24.380,0:18:27.660
the prover can win the game regardless of
how the skeptic plays;
0:18:27.660,0:18:31.070
there's a way for the prover to do that.
This just gives one example
0:18:31.070,0:18:34.640
where the prover won the game, but it doesn't
tell us that regardless
0:18:34.640,0:18:37.280
of the epsilon the skeptic takes the prover
can pick a delta such that
0:18:37.280,0:18:41.090
regardless of the x the skeptic picks, the
function is within the
0:18:41.090,0:18:45.530
thing. So that's what they should do. Okay?
0:18:45.530,0:18:51.160
Now you notice -- I'm sure you notice this
but the way the game and the
0:18:51.160,0:18:58.160
limit definition. The way the limit definition
goes, you see that all
0:18:59.870,0:19:04.260
the moves of the skeptic be right "for every"
"for all." Right? And
0:19:04.260,0:19:07.390
for all the moves of the prover it's "there
exists." Why do we do
0:19:07.390,0:19:11.140
that? Because we are trying to get a winning
strategy for the prover,
0:19:11.140,0:19:14.309
so the prover controls his own moves. Okay?
0:19:14.309,0:19:15.250
KM: Exactly.
0:19:15.250,0:19:18.630
Vipul: So, therefore wherever it's a prover
move it will be a there
0:19:18.630,0:19:22.240
exists. Where there is a skeptic's move
the prover has to be prepared
0:19:22.240,0:19:29.240
for anything the skeptic does. All those moves
are "for every."
0:19:30.559,0:19:33.850
One last one. By the way, this one was called,
"You say you want a
0:19:33.850,0:19:36.870
replay?" Which is basically they're just
saying that just one play is
0:19:36.870,0:19:40.890
not good enough. If the statement is actually
true, the prover should
0:19:40.890,0:19:45.370
be willing to accept the skeptic ones, the
reply and say they want to
0:19:45.370,0:19:47.679
play it again, the prover should say "sure"
and "I'm going to win
0:19:47.679,0:19:53.320
again." That's what it would mean for
the limit statement to be true.
0:19:53.320,0:20:00.320
One last one. Just kind of pretty similar
to the one we just saw. Just
0:20:16.690,0:20:23.690
a little different.
0:20:39.020,0:20:46.020
Okay, this one, let's see. We are saying
that the limit as x
0:20:50.450,0:20:56.900
approaches zero of sin(1/x) is zero, right?
Let's see how we prove
0:20:56.900,0:21:01.409
this. If the statement true ... well, do you
think the statement is
0:21:01.409,0:21:08.409
true? As x approach to zero, is sin 1 over
x approaching zero? So
0:21:13.980,0:21:20.980
here's the picture of sin(1/x). y-axis.
It's an oscillatory function
0:21:22.010,0:21:27.870
and it has this kind of picture. Does it doesn't
go to zero as x
0:21:27.870,0:21:29.270
approaches zero?
0:21:29.270,0:21:30.669
KM: No.
0:21:30.669,0:21:35.539
Vipul: No. So, you said that this statement
is false, but I'm going to
0:21:35.539,0:21:38.700
try to show it's true. Here's how I do
that. Let's say the skeptic
0:21:38.700,0:21:44.510
picks epsilon as two, okay? And then the prover
... so, the epsilon is
0:21:44.510,0:21:48.520
two so that's the interval of width two
about the game limit zero. The
0:21:48.520,0:21:55.150
prover picks delta as 1/pi. Whatever x the
skeptic picks, okay?
0:21:55.150,0:22:02.150
Regardless of the x that the
skeptic picks, the function is trapped
within epsilon of the game limit. Is that
0:22:10.340,0:22:16.900
true? Yes, because sin
(1/x) is between minus 1 and 1, right? Therefore
0:22:16.900,0:22:20.100
since the skeptic
picked an epsilon of 2, the function value
0:22:20.100,0:22:24.030
is completely trapped in
the interval from -1 to 1, so therefore the
0:22:24.030,0:22:27.919
prover managed to trap it
within distance of 2 of the claimed limit zero.
0:22:27.919,0:22:30.970
Okay? Regardless of what
the skeptic does, right? It's not just saying
0:22:30.970,0:22:34.370
that the prover won the
game once, it's saying whatever x the skeptic
0:22:34.370,0:22:40.740
picks the prover can
still win the game. Right? Regardless if the
0:22:40.740,0:22:43.780
x is skeptic picks, the
prover picked a delta such that the function
0:22:43.780,0:22:48.100
is trapped. It's
completely trapped, okay? It's not an issue
0:22:48.100,0:22:51.130
of whether the skeptic
picks the stupid x. Do you think that this
0:22:51.130,0:22:52.130
proves the statement?
0:22:52.130,0:22:59.130
KM: No, I mean in this case it still depended
on the epsilon that the
0:23:01.030,0:23:01.820
skeptic chose.
0:23:01.820,0:23:04.980
Vipul: It's still dependent on the epsilon
that the skeptic chose? So,
0:23:04.980,0:23:05.679
yes, that's exactly the problem.
0:23:05.679,0:23:09.370
So, we proved that the statement -- we prove
that from this part onward
0:23:09.370,0:23:12.500
but it still, we didn't prove it for all
epsilon, we only prove for
0:23:12.500,0:23:16.309
epsilon is 2, and 2 is a very big number,
right? Because the
0:23:16.309,0:23:19.970
oscillation is all happening between minus
1 and 1, and if in fact the
0:23:19.970,0:23:26.970
skeptic had pick epsilon as 1 or something
smaller than 1 then the two
0:23:27.030,0:23:32.169
epsilon strip width would not cover the entire
-1, +1
0:23:32.169,0:23:35.490
interval, and then whatever the prover did
the skeptic could actually
0:23:35.490,0:23:39.530
pick an x and show that it's not trapped.
So, in fact the reason why
0:23:39.530,0:23:43.110
the prover could win the game from this point
onward is that the
0:23:43.110,0:23:45.900
skeptic made of stupid choice of epsilon.
Okay?
0:23:45.900,0:23:52.289
In all these situation, all these misconceptions,
the main problem is,
0:23:52.289,0:23:58.919
that we're not ... keeping in mind the order
which the moves I made
0:23:58.919,0:24:04.179
and how much information each claim has at
the stage where that move
0:24:04.179,0:24:04.789
is being made.</toggledisplay>


==Conceptual definition and various cases==
==Conceptual definition and various cases==

Revision as of 20:11, 22 December 2012

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

Motivation and general idea

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

Full timed transcript: [SHOW MORE]

Definition for finite limit for function of one variable

Two-sided limit

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

Full timed transcript: [SHOW MORE]

Left hand limit

Right hand limit

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

Full timed transcript: [SHOW MORE]

Relation between the limit notions

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

Two-sided limit

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

Full timed transcript: [SHOW MORE]

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

Full timed transcript: [SHOW MORE]

Non-existence of limit

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

Full timed transcript: [SHOW MORE]

Misconceptions

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

Full timed transcript: [SHOW MORE]

Conceptual definition and various cases

Formulation of conceptual definition

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

Functions of one variable case

This covers limits at and to infinity.

{{#widget:YouTube|id=EOQby7b-WrA}}

Real-valued functions of multiple variables case

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