Continuity

MATH1051

 

5.1 Definition of Continuity

We say that a function is continuous at if is defined, exists and .

If is not continuous at , we say that is discontinuous at , or has a discontinuity at .

A function may not be continuous at for a number of reasons.

5.1.1 Example

Let

Then has a discontinuity at . This is because while . Hence the third condition does not hold.

5.2 Continuity of Intervals

We say that is continuous on the open interval if is continuous at , for all .

If is continuous on the closed interval , then is continuous on and

You could think of a continuous function being one that on an interval can be drawn without lifting your pen.

5.3 Properties of Continuous Functions

If and are continuous at and is a constant, then the following functions are all continuous at .

Since the function is continuous, this proves that any polynomial is continuous, and any ratio of polynomials is continuous, provided the denominator is not zero.

5.4 The Intermediate Value Theorem (IVT)

Suppose that is continuous on the closed interval and let be any number between and , where . Then there exists a number such that .

5.4.1 Example

You want to show that there is at least one real solution for a function. Say, for example, show that the equation has one real solution for .

First, you can just test out any two numbers in between the function that would make sense. Since we have a cosine (), we will use or for one of our .

Now that we shown that this bound is too big, we go for a smaller number, say .

Since the higher bound of and the lower bound of are between 0, that means that there will be a real solution for at some point in between.

5.5 Application of the IVT (Bisection Method)

The bisection method is a procedure for approximating the zeros of a continuous function. It first cuts the interval in half (say, at a point ) and then decides in which of the smaller intervals (, or ) the zero lies. This process is repeated until the interval is small enough to give a significant approximation of the zero itself.

We can present this bisection method as an algorithm:

  1. Given such that , let .
  2. If then quit; is a zero of
  3. If then:
    1. If , a zero lies in the interval . So replace by .
    2. If , replace by .
  4. If the interval is small enough to give a precise enough approximation then quit. Otherwise, go to step 1.