Sets of Discontinuity
In Chapter 4, we spent much of our time trying to understand and prove continuity of functions. However, as we saw in Section 4.1, discontinuous functions can be even more interesting. Recall the Dirchlet Function, which we saw was discontinuous on all of , or well as the modified Dirchlet, which was discontinuous on , and don’t forget the Thomae Function, which was discontinuous on all of . What is going on with these discontinuities, and what does this tell us about the discontinuities of an arbitrary function?
To start, let’s define, for a function , the set as the set of all points where fails to be continuous. It turns out that this set has a number of really interesting properties for a generic function on the real numbers. In general, we can divide discontinuities of a function at a point into three categories:
- Removable discontinuity: when exists but is a different value from Example: has a removable discontinuity at
- Jump discontinuity: when . Example: has a jump discontinuity at
- Essential discontinuity: when doesn’t exist for some other reason–so at least one or both of the right hand limits either doesn’t exist or is infinite. Example: the function has an essential discontinuity at the point .
Now, let’s look at the class of monotone functions. Similarly to how we defined a monotone sequence, we can define a monotone function as a function that is either increasing or decreasing on , so either (increasing) or (decreasing) for . Monotone functions can only have a jump discontinuity, because a removable or essential discontinuity would make the function not monotone on . With a jump discontinuity, a function can still maintain the property that or for . From there, we can create a bijection between the set of jump discontinuities of and a subset of to show that for monotone functions is either countable or finite.
Now that we’ve looked at monotone functions, let’s think about the discontinuity set of a non-monotone function. It turns out that, for any arbitrary function , is classified as a set, or a set that can be written as the countable union of closed sets (this proof is outlined on p. 143 of the Abbot textbook). We ran into sets in section 3.5 of the Abbot text, where they help us define as a complete metric space.
Now you may be wondering how we can determine if a set is a set and, since every set of discontinuities for an arbitrary function is a countable union of closed sets, whether we can construct a function that is discontinuous on any subset of . At first it might look like it–the Dirchlet function has and the Thomae function has . Does that mean every subset of is a set? It turns out not.
Let’s take a look at the irrational numbers. We already know that . According to Baire’s Theorem, which is described in more detail in Chapter 3 of the Abbot textbook, if is written as a set, then at least one of those sets must contain a non-empty open interval. Since can be expressed as the countable union of closed intervals (containing singleton points), it cannot contain any open intervals around those points. If were a set, then could not contain any open intervals, otherwise those intervals would intersect because is dense in . Since , then would contain no open intervals, which contradicts Baire’s Theorem, so is not an set.
We have shown there is no possible function that could be discontinuous on all of but continuous on . This has big implications–given an artibtrary subset of the real numbers, it is not always possible to construct a function that will be discontinuous on that set but continuous on the rest of . However, if we are given an arbitrary set, we will always able to construct a function with equal to that set.
Sources: http://math.mit.edu/~jspeck/18.01_Fall%202014/Supplementary%20notes/01c.pdf
Stephen Abbot, Understanding Analysis 2nd Edition
Leave a Reply
You must be logged in to post a comment.