PrepShorts · Study sheet · Class 11 Mathematics · Chapter 12, Limits and DerivativesPrepShorts

Chapter 12 · Limits and Derivatives

Limits pass through sums, products and quotients

Computing limits14 min

This video could not be loaded. Reload the page to try again.

Sign in with Google

14 min.

Almost everything you can compute about a limit rests on one rule: that if you know two limits, you know the limit of the combination. It is not obvious and it is not proved here - so it is scored instead. Nine rules, eighty-one ordered pairs, three operations, and two routes that never see each other's answer: across all 243 scores the number of times they both answered and disagreed is 0.

The idea

Almost everything computable about limits in this chapter rests on one theorem: that the limit of a combination is the same combination of the limits. It is not obvious — a limit is a statement about infinitely many nearby inputs, and there is no reason in the definition why two such statements should recombine — and the chapter admits as much by stating Theorem 1 without proving it. What the chapter does instead is make the student verify it numerically first, in Illustrations 5 and 7, and then attach the one caveat that the theorem cannot do without: the quotient clause holds only where the denominator's limit is not zero. That caveat is not fine print. Every hard limit in the rest of the chapter is a case where the clause fails and something else has to be found.

What you should be able to do

  • State each of the four parts of Theorem 1 in your own words, including the hypothesis that both limits exist
  • Explain why the hypothesis is needed, by exhibiting two pieces whose own limits both fail at a point while their sum behaves perfectly. Note why both have to fail: if a sum has a limit and one piece has a limit, the other is forced to have one too, as the difference of the first two. A single failure is available for a product, not for a sum
  • State the condition attached to the quotient part and say what goes wrong without it
  • Derive the constant-multiple rule as the special case of the product part in which one function is constant
  • Verify the sum and product parts numerically on the chapter's own two worked checks, at x → 1 and at x → 0
  • Extend the sum part from two functions to finitely many, and say why that extension is legitimate
  • Identify, in a multi-step limit computation, which part of Theorem 1 licenses each step
  • Recognise a computation in which Theorem 1 has been applied illegitimately

Words to know

TermDefinition in one lineFirst introduced
algebra of limitsthe collection of rules by which limits distribute over arithmetic combinationsprinted in this chapter as the heading of §12.3.1, p. 228
limitthe value the outputs settle on as the input is driven toward a pointprinted in this chapter, §12.3, p. 220
constant functiona function whose output does not change with its inputprinted in this chapter, §12.3, Illustration 4, p. 223
not definedthe record made where a quotient's denominator vanishesprinted in this chapter, §12.3.2, p. 231
does not existthe verdict on a limit that fails, distinct from a value that failsprinted in this chapter, §12.3.2, p. 229
hypothesis of a theoremthe conditions a theorem demands before its conclusion is availablean added phrasing; the chapter states its conditions without giving them this collective name
constant-multiple rulethe special case in which one factor of a product is a fixed numberan added label; §12.3.1 prints this case in a Note without naming it

Where people slip up

  • "These rules are obvious, so the theorem is bookkeeping." They are not obvious enough for this book to prove them, and the chapter says so. A limit is a statement about the behaviour of infinitely many values; that two such statements recombine cleanly is a real fact about the real numbers.
  • "If the combination has a limit, the pieces must have limits." False, and section 10's example shows it. The theorem runs one way only.
  • "The quotient rule works whenever the denominator function is non-zero near the point." The condition is on the denominator's limit, not on its values. Example 2 (iii)'s denominator is non-zero at every x near 2 and other than 2, and the rule still does not apply, because its limit at 2 is 0.
  • "0/0 means the answer is 0" or "means the answer is 1." It means the quotient rule is unavailable and something else must be done. §12.3.2 and §12.4 are that something else.
  • "You can apply the sum rule to a hundred terms because it says so." It says two. Extending to finitely many is a short induction, which the chapter performs silently on p. 229 when it splits a polynomial term by term. Make the step visible.
  • "A constant multiplier is a separate rule to memorise." It is the product rule with a constant function on one side, and the chapter prints it as a Note for exactly that reason.
Transcript1,919 words

You know how to read a limit: drive the input toward a place, watch what the outputs settle on, and never ask about the place itself. That does not scale: there are infinitely many ways to build a new function out of two old ones. What we want is a rule saying that if you know the two limits, you already know the limit of the combination. Almost everything computable here rests on that sentence, and it is not obvious: a limit is a statement about infinitely many nearby inputs, and nothing says two of them have to recombine.

So we test it, which needs a reading that cannot cheat. Every reading here is taken the same way: eight inputs closing on the place from one side, five rounds of exact elimination, and three values that still have to agree at the end. Of the sixteen inputs two such runs offer, the number that ARE the place they are asked about is zero. Nothing here ever substitutes. Here is the rule, in four parts, for two functions at a place.

The limit of their sum is the sum of the two limits. The limit of their difference is the difference of the two limits. The limit of their product is the product of the two limits. And the limit of their quotient is the quotient of the two limits, provided the bottom one is not zero. Four claims, all hanging off one bar across the top: both limits are assumed to exist first.

That bar is the part nobody reads, and it does all the work. The fourth claim also carries a condition the other three do not. Neither piece of small print is decoration, and the rest of this is those two taken seriously. Let us score the thing rather than believe it. Nine rules go into a sweep: flat ones, straight ones, curved ones, two that flip sign at the place, and one that runs away.

Of the nine, six have a reading at zero, and the readings that come up are nothing, one and three. Nine rules make eighty-one ordered pairs, and each gets two answers from code with nothing in common: one approaches the combination, the other reads the two limits separately and combines them. Neither is ever shown the other's answer. Each pair lands in whichever of five boxes those answers put it: both agreed, both disagreed, only the combination answered, only the two limits did, or neither did.

For the sum: thirty-six, zero, two, zero, forty-three. For the difference: thirty-six, zero, three, zero, forty-two. For the product: thirty-six, zero, twenty-four, zero, twenty-one. Across all two hundred and forty-three scores, the number of times the two routes both answered and disagreed is zero. That is the rule, measured. Now the box that should surprise you: for the sum, two pairs had a limit and neither piece did. One of them: a rule reading minus one from below and one from above, added to its exact opposite.

Neither has a limit; their sum is nothing everywhere except at the place, so its limit is nothing. The rule never told you that, because its hypothesis was never met: the implication runs one way only. Now the sharper question: can exactly ONE piece fail while the combination still has a limit? Take every pair whose sum has a limit and count how many have neither piece readable, exactly one, and both: two, zero, thirty-six.

Zero in the middle. For the product: four, twenty, thirty-six. Same question, two operations, two different answers, and the reason is one line: if the sum has a limit and so does the first piece, the second is the difference of those two, and the difference claim hands it a limit whether you wanted one or not. A product has no such escape: x times a sign-flipping rule is the size of x, which reads nothing quite happily.

Now the check you can do by hand: take x squared plus x, and drive x toward one. Three readings on their own: x squared reads one, x reads one, and x plus one reads two. Read x squared plus x as a sum: one plus one is two. Or notice the very same function is x times x plus one, and read it as a product: one times two is two.

And straight off the whole function's own run, using no rule at all: two. Three routes, one answer: two decompositions of one function have to land in the same place, or the rule is not a rule. That they really are the same function is checked too: over every place both runs offer, the number where they differ is zero. Now something that is not a polynomial: the cosine, at nothing.

A cosine is not a fraction, so it is never evaluated here - it is trapped. Its series alternates in sign and its terms shrink, so two consecutive partial sums bracket the true value between them. A tenth of the way out the low end is one hundred and ninety-nine over two hundred, and the whole bracket is one over two hundred and forty thousand wide. Both ends are exact fractions, so read both by approaching: the low end settles on one, and so does the high end.

Squeezed between two readings that agree, the cosine's reading is one, and it was never evaluated. Now take x plus the cosine at nothing and read it whole through both ends: one, and one. The two pieces separately, added: nothing plus one is one. The sum claim does not care what kind of function you fed it. It cares only that both limits exist. Here is a rule you were probably taught separately: a fixed multiplier passes straight through a limit.

It is not a separate rule; it is the product claim with one side held flat. So: what does a flat function read? Five constants are offered, and the flat function built from each reads its own value back: five, minus three, a half, nothing, seven quarters. Measured, not assumed. Substitute that into the product claim: one of the two limits is just the constant, so the constant comes out and the other limit stays.

Score it. Multiply two x plus three by each constant and read at one: twenty-five, minus fifteen, five halves, nothing, thirty-five quarters. Read two x plus three on its own and multiply each constant in afterwards: the same five numbers. All five land in the box where both routes agreed - and it is still the product claim, hypothesis and all, so multiply a constant by a rule with no limit and neither route answers.

The claims are stated for two functions, and you use them on ten. That step is an induction, performed silently: apply the two-term claim, then apply it again to the result. Ten terms are built here, none carrying a power above the third. Read the running sum of the first two, then the first three, and so on: five, nine, fourteen, twenty, twenty-seven, thirty-five, forty-four, fifty-four, sixty-five. Legitimate, because each step is one application of a claim already scored - but only while every term has a limit.

So spoil it: replace the last two terms with a sign-flipping rule and its exact opposite. Of the ten, the number readable on their own is eight. Read the running sums whole: five, nine, fourteen, twenty, twenty-seven, thirty-five, forty-four, then nothing at nine terms, then forty-four again at ten. One term at a time and added: the same seven, then nothing, then nothing. At ten terms the whole sum reads perfectly and the term-by-term route cannot start.

The extension is not free; it is the hypothesis, applied every time. Now the fourth claim's condition: provided the bottom limit is not zero. Almost everyone reads that as: provided the denominator is not zero near the place - a different sentence, and here is a function that separates them. Take x cubed minus four x squared plus four x, and go toward two. Of the sixteen places the two runs offer, the number where that denominator is zero is zero - a perfectly good non-zero number at every place you would put in a table.

And its reading at two is nothing. The condition is on the reading, not on the values. For contrast, a denominator that really does vanish inside its own run: ten x minus nineteen is zero at one point nine, the first place the left-hand run offers. Its reading at two is one, so the condition is satisfied, and yet a ratio carrying it cannot be read at all - the run hits a place with nothing to divide by.

A third kind of failure, and no algebra removes it. So what happens when the condition fails? Take x squared minus four, over x cubed minus four x squared plus four x, and go toward two. The top reads nothing; the bottom reads nothing. The quotient claim is unavailable and neither route answers - but they stop for different reasons. The two-limits route stops because there is nothing to divide by; the whole-combination route stops because its outputs do not settle on any one value.

A tenth to the left it is minus three hundred and ninety over nineteen; a tenth to the right, four hundred and ten over twenty-one; further in, both grow without bound. Of thirteen quotient problems offered, the number the fourth claim settles outright, because the bottom reading is not zero, is eight. Of the other five, four put nothing over nothing and one puts something over nothing. Scored into the five boxes: eight agreed, none disagreed, three were answered only by the combination, none only by the two limits, and two by neither.

Those three in the middle have limits, and the rule cannot reach them. Nothing over nothing is not an answer; it is a rule declining to apply. Watch what happens if you treat it as one. Here is the misconception written down as a rule: divide, and where there is nothing to divide by, say nothing. Put it to the same thirteen problems: eight agreed, three disagreed, none was answered only by the combination, two only by this rule, and none by neither.

The three it gets wrong are the interesting ones: where the real answer is two it says nothing; where twelve, nothing; where twenty-seven, nothing. And twice more it answers confidently where there is no answer at all. So what decides those cases? Not this rule and not the fourth claim; something else has to be found, and that is the work that comes next. One last thing, about honesty rather than mathematics: nothing here is a proof of that rule.

It has been scored, hard, on hundreds of cases, and scoring is not proving. What you have instead is more useful for now: you know what it claims and where it goes quiet. It demands that both limits already exist, and where they do, all four parts hold, whatever you fed in. Where they do not, the rule says nothing, and the combination may still have a limit you must find another way.

The fourth part demands one thing more, on a limit and not on a set of values, and every hard limit you meet from here is a case where that demand fails. So the small print is not the exception to the subject. It is the door into it.

Where this fits

Taken from the notes each video was made from, not from the reading order — these are the ideas this one rests on and the ones that later rest on it.

Builds on

Comes up again in

The book

Open in a new tab