Proof That Right Continuous Function Countably Many Discontinuities

\(\require{cancel}\newcommand{\avoidbreak}{\postdisplaypenalty=100} \newcommand{\ann}{\operatorname{ann}} \renewcommand{\Re}{\operatorname{Re}} \renewcommand{\Im}{\operatorname{Im}} \newcommand{\Orb}{\operatorname{Orb}} \newcommand{\hol}{\operatorname{hol}} \newcommand{\aut}{\operatorname{aut}} \newcommand{\codim}{\operatorname{codim}} \newcommand{\sing}{\operatorname{sing}} \newcommand{\esssup}{\operatorname{ess~sup}} \newcommand{\essran}{\operatorname{essran}} \newcommand{\innprod}[2]{\langle #1 | #2 \rangle} \newcommand{\linnprod}[2]{\langle #1 , #2 \rangle} \newcommand{\supp}{\operatorname{supp}} \newcommand{\Nul}{\operatorname{Nul}} \newcommand{\Ran}{\operatorname{Ran}} \newcommand{\sabs}[1]{\lvert {#1} \rvert} \newcommand{\snorm}[1]{\lVert {#1} \rVert} \newcommand{\abs}[1]{\left\lvert {#1} \right\rvert} \newcommand{\norm}[1]{\left\lVert {#1} \right\rVert} \newcommand{\babs}[1]{\bigl\lvert {#1} \bigr\rvert} \newcommand{\bnorm}[1]{\bigl\lVert {#1} \bigr\rVert} \newcommand{\C}{{\mathbb{C}}} \newcommand{\R}{{\mathbb{R}}} \newcommand{\Z}{{\mathbb{Z}}} \newcommand{\N}{{\mathbb{N}}} \newcommand{\Q}{{\mathbb{Q}}} \newcommand{\D}{{\mathbb{D}}} \newcommand{\F}{{\mathbb{F}}} \newcommand{\bB}{{\mathbb{B}}} \newcommand{\bC}{{\mathbb{C}}} \newcommand{\bR}{{\mathbb{R}}} \newcommand{\bZ}{{\mathbb{Z}}} \newcommand{\bN}{{\mathbb{N}}} \newcommand{\bQ}{{\mathbb{Q}}} \newcommand{\bD}{{\mathbb{D}}} \newcommand{\bF}{{\mathbb{F}}} \newcommand{\bH}{{\mathbb{H}}} \newcommand{\bO}{{\mathbb{O}}} \newcommand{\bP}{{\mathbb{P}}} \newcommand{\bK}{{\mathbb{K}}} \newcommand{\bV}{{\mathbb{V}}} \newcommand{\CP}{{\mathbb{CP}}} \newcommand{\RP}{{\mathbb{RP}}} \newcommand{\HP}{{\mathbb{HP}}} \newcommand{\OP}{{\mathbb{OP}}} \newcommand{\sA}{{\mathcal{A}}} \newcommand{\sB}{{\mathcal{B}}} \newcommand{\sC}{{\mathcal{C}}} \newcommand{\sF}{{\mathcal{F}}} \newcommand{\sG}{{\mathcal{G}}} \newcommand{\sH}{{\mathcal{H}}} \newcommand{\sM}{{\mathcal{M}}} \newcommand{\sO}{{\mathcal{O}}} \newcommand{\sP}{{\mathcal{P}}} \newcommand{\sQ}{{\mathcal{Q}}} \newcommand{\sR}{{\mathcal{R}}} \newcommand{\sS}{{\mathcal{S}}} \newcommand{\sI}{{\mathcal{I}}} \newcommand{\sL}{{\mathcal{L}}} \newcommand{\sK}{{\mathcal{K}}} \newcommand{\sU}{{\mathcal{U}}} \newcommand{\sV}{{\mathcal{V}}} \newcommand{\sX}{{\mathcal{X}}} \newcommand{\sY}{{\mathcal{Y}}} \newcommand{\sZ}{{\mathcal{Z}}} \newcommand{\fS}{{\mathfrak{S}}} \newcommand{\interior}{\operatorname{int}} \newcommand{\id}{\textit{id}} \newcommand{\im}{\operatorname{im}} \newcommand{\rank}{\operatorname{rank}} \newcommand{\Tor}{\operatorname{Tor}} \newcommand{\Torsion}{\operatorname{Torsion}} \newcommand{\Ext}{\operatorname{Ext}} \newcommand{\Hom}{\operatorname{Hom}} \newcommand{\mapsfrom}{\ensuremath{\text{\reflectbox{$\mapsto$}}}} \newcommand{\from}{\ensuremath{\leftarrow}} \newcommand{\dhat}[1]{\hat{\hat{#1}}} \newcommand{\spn}{\operatorname{span}} \newcommand{\nicefrac}[2]{{{}^{#1}}\!/\!{{}_{#2}}} \newcommand{\unitfrac}[3][\!\!]{#1 \,\, {{}^{#2}}\!/\!{{}_{#3}}} \newcommand{\unit}[2][\!\!]{#1 \,\, #2} \newcommand{\noalign}[1]{} \newcommand{\qed}{\qquad \Box} \newcommand{\qedhere}{} \newcommand{\widebar}[1]{\overline{#1}} \newcommand{\lt}{<} \newcommand{\gt}{>} \newcommand{\amp}{&} \)

Note: 1 lecture (optional, can safely be omitted unless Section 4.4 is also covered, requires Section 3.5)

Definition 3.6.1 .

Let \(S \subset \R\text{.}\) We say \(f \colon S \to \R\) is increasing (resp. strictly increasing) if \(x,y \in S\) with \(x < y\) implies \(f(x) \leq f(y)\) (resp. \(f(x) < f(y)\)). We define decreasing and strictly decreasing in the same way by switching the inequalities for \(f\text{.}\)

If a function is either increasing or decreasing, we say it is monotone. If it is strictly increasing or strictly decreasing, we say it is strictly monotone.

Sometimes nondecreasing (resp. nonincreasing) is used for increasing (resp. decreasing) function to emphasize it is not strictly increasing (resp. strictly decreasing).

If \(f\) is increasing, then \(-f\) is decreasing and vice versa. Therefore, many results about monotone functions can just be proved for, say, increasing functions, and the results follow easily for decreasing functions.

Subsection 3.6.1 Continuity of monotone functions

One-sided limits for monotone functions are computed by computing infima and suprema.

Proposition 3.6.2 .

Let \(S \subset \R\text{,}\) \(c \in \R\text{,}\) \(f \colon S \to \R\) be increasing, and \(g \colon S \to \R\) be decreasing. If \(c\) is a cluster point of \(S \cap (-\infty,c)\text{,}\) then

\begin{equation*} \lim_{x \to c^-} f(x) = \sup \{ f(x) : x < c, x \in S \} \qquad \text{and} \qquad \lim_{x \to c^-} g(x) = \inf \{ g(x) : x < c, x \in S \} . \end{equation*}

If \(c\) is a cluster point of \(S \cap (c,\infty)\text{,}\) then

\begin{equation*} \lim_{x \to c^+} f(x) = \inf \{ f(x) : x > c, x \in S \} \qquad \text{and} \qquad \lim_{x \to c^+} g(x) = \sup \{ g(x) : x > c, x \in S \} . \end{equation*}

If \(\infty\) is a cluster point of \(S\text{,}\) then

\begin{equation*} \lim_{x \to \infty} f(x) = \sup \{ f(x) : x \in S \} \qquad \text{and} \qquad \lim_{x \to \infty} g(x) = \inf \{ g(x) : x \in S \} . \end{equation*}

If \(-\infty\) is a cluster point of \(S\text{,}\) then

\begin{equation*} \lim_{x \to -\infty} f(x) = \inf \{ f(x) : x \in S \} \qquad \text{and} \qquad \lim_{x \to -\infty} g(x) = \sup \{ g(x) : x \in S \} . \end{equation*}

Namely, all the one-sided limits exist whenever they make sense. For monotone functions therefore, when we say the left-hand limit \(x \to c^-\) exists, we mean that \(c\) is a cluster point of \(S \cap (-\infty,c)\text{,}\) and same for the right-hand limit.

Proof.

Let us assume \(f\) is increasing, and we will show the first equality. The rest of the proof is very similar and is left as an exercise.

Let \(a := \sup \{ f(x) : x < c, x \in S \}\text{.}\) If \(a = \infty\text{,}\) then given an \(M \in \R\text{,}\) there exists an \(x_M \in S\text{,}\) \(x_M < c\text{,}\) such that \(f(x_M) > M\text{.}\) As \(f\) is increasing, \(f(x) \geq f(x_M) > M\) for all \(x \in S\) with \(x > x_M\text{.}\) If we take \(\delta := c-x_M > 0\text{,}\) then we obtain the definition of the limit going to infinity.

Next suppose \(a < \infty\text{.}\) Let \(\epsilon > 0\) be given. Because \(a\) is the supremum and \(S \cap (-\infty,c)\) is nonempty, \(a \in \R\) and there exists an \(x_\epsilon \in S\text{,}\) \(x_\epsilon < c\text{,}\) such that \(f(x_\epsilon) > a-\epsilon\text{.}\) As \(f\) is increasing, if \(x \in S\) and \(x_\epsilon < x < c\text{,}\) we have \(a-\epsilon < f(x_\epsilon) \leq f(x) \leq a\text{.}\) Let \(\delta := c-x_\epsilon\text{.}\) Then for \(x \in S \cap (-\infty,c)\) with \(\abs{x-c} < \delta\text{,}\) we have \(\abs{f(x)-a} < \epsilon\text{.}\)

Suppose \(f \colon S \to \R\) is increasing, \(c \in S\text{,}\) and that both one-sided limits exist. Since \(f(x) \leq f(c) \leq f(y)\) whenever \(x < c < y\text{,}\) taking the limits we obtain

\begin{equation*} \lim_{x \to c^-} f(x) \leq f(c) \leq \lim_{x \to c^+} f(x) . \end{equation*}

Then \(f\) is continuous at \(c\) if and only if both limits are equal to each other (and hence equal to \(f(c)\)). See also Proposition 3.1.17. See Figure 3.8 to get an idea of a what a discontinuity looks like.

Corollary 3.6.3 .

If \(I \subset \R\) is an interval and \(f \colon I \to \R\) is monotone and not constant, then \(f(I)\) is an interval if and only if \(f\) is continuous.

Assuming \(f\) is not constant is to avoid the technicality that \(f(I)\) is a single point: \(f(I)\) is a single point if and only if \(f\) is constant. A constant function is continuous.

Proof.

Without loss of generality, suppose \(f\) is increasing.

First suppose \(f\) is continuous. Take two points \(f(x_1) < f(x_2)\) in \(f(I)\text{.}\) As \(f\) is increasing, then \(x_1 < x_2\text{.}\) By the intermediate value theorem, given \(y\) with \(f(x_1) < y < f(x_2)\text{,}\) we find a \(c \in (x_1,x_2) \subset I\) such that \(f(c) = y\text{,}\) so \(y \in f(I)\text{.}\) Hence, \(f(I)\) is an interval.

Let us prove the reverse direction by contrapositive. Suppose \(f\) is not continuous at \(c \in I\text{,}\) and that \(c\) is not an endpoint of \(I\text{.}\) Let

\begin{equation*} a := \lim_{x \to c^-} f(x) = \sup \bigl\{ f(x) : x \in I, x < c \bigr\} , \qquad b := \lim_{x \to c^+} f(x) = \inf \bigl\{ f(x) : x \in I, x > c \bigr\} . \end{equation*}

As \(c\) is a discontinuity, \(a < b\text{.}\) If \(x < c\text{,}\) then \(f(x) \leq a\text{,}\) and if \(x > c\text{,}\) then \(f(x) \geq b\text{.}\) Therefore no point in \((a,b) \setminus \{ f(c) \}\) is in \(f(I)\text{.}\) However there exists \(x_1 \in I\text{,}\) \(x_1 < c\text{,}\) so \(f(x_1) \leq a\text{,}\) and there exists \(x_2 \in I\text{,}\) \(x_2 > c\text{,}\) so \(f(x_2) \geq b\text{.}\) Both \(f(x_1)\) and \(f(x_2)\) are in \(f(I)\text{,}\) but there are points in between them that are not in \(f(I)\text{.}\) So \(f(I)\) is not an interval. See Figure 3.8.

When \(c \in I\) is an endpoint, the proof is similar and is left as an exercise.

---

Figure 3.8. Increasing function \(f \colon I \to \R\) discontinuity at \(c\text{.}\)

---

A striking property of monotone functions is that they cannot have too many discontinuities.

Corollary 3.6.4 .

Let \(I \subset \R\) be an interval and \(f \colon I \to \R\) be monotone. Then \(f\) has at most countably many discontinuities.

Proof.

Let \(E \subset I\) be the set of all discontinuities that are not endpoints of \(I\text{.}\) As there are only two endpoints, it is enough to show that \(E\) is countable. Without loss of generality, suppose \(f\) is increasing. We will define an injection \(h \colon E \to \Q\text{.}\) For each \(c \in E\) the one-sided limits of \(f\) both exist as \(c\) is not an endpoint. Let

\begin{equation*} a := \lim_{x \to c^-} f(x) = \sup \bigl\{ f(x) : x \in I, x < c \bigr\} , \qquad b := \lim_{x \to c^+} f(x) = \inf \bigl\{ f(x) : x \in I, x > c \bigr\} . \end{equation*}

As \(c\) is a discontinuity, we have \(a < b\text{.}\) There exists a rational number \(q \in (a,b)\text{,}\) so let \(h(c) := q\text{.}\) If \(d \in E\) is another discontinuity, then if \(d > c\text{,}\) then there exist an \(x \in I\) with \(c < x < d\text{,}\) and so \(\lim_{x \to d^-} f(x) \geq b\text{.}\) Hence the rational number we choose for \(h(d)\) is different from \(q\text{,}\) since \(q=h(c) < b\) and \(h(d) > b\text{.}\) Similarly if \(d < c\text{.}\) So after making such a choice for every \(c \in E\text{,}\) we have a one-to-one (injective) function into \(\Q\text{.}\) Therefore, \(E\) is countable.

Example 3.6.5 .

By \(\lfloor x \rfloor\) denote the largest integer less than or equal to \(x\text{.}\) Define \(f \colon [0,1] \to \R\) by

\begin{equation*} f(x) := x + \sum_{n=0}^{\lfloor 1/(1-x) \rfloor} 2^{-n} , \end{equation*}

for \(x < 1\) and \(f(1) := 3\text{.}\) It is left as an exercise to show that \(f\) is strictly increasing, bounded, and has a discontinuity at all points \(1-\nicefrac{1}{k}\) for \(k \in \N\text{.}\) In particular, there are countably many discontinuities, but the function is bounded and defined on a closed bounded interval. See Figure 3.9.

---

Figure 3.9. Increasing function with countably many discontinuities.

---

Similarly, one can find an example of a function discontinuous on a dense set such as the rational numbers. See the exercises.

Subsection 3.6.2 Continuity of inverse functions

A strictly monotone function \(f\) is one-to-one (injective). To see this fact, notice that if \(x \not= y\text{,}\) then we can assume \(x < y\text{.}\) Either \(f(x) < f(y)\) if \(f\) is strictly increasing or \(f(x) > f(y)\) if \(f\) is strictly decreasing, so \(f(x) \not= f(y)\text{.}\) Hence, \(f\) must have an inverse \(f^{-1}\) defined on its range.

Proposition 3.6.6 .

If \(I \subset \R\) is an interval and \(f \colon I \to \R\) is strictly monotone, then the inverse \(f^{-1} \colon f(I) \to I\) is continuous.

Proof.

Let us suppose \(f\) is strictly increasing. The proof is almost identical for a strictly decreasing function. Since \(f\) is strictly increasing, so is \(f^{-1}\text{.}\) That is, if \(f(x) < f(y)\text{,}\) then we must have \(x < y\) and therefore \(f^{-1}\bigl(f(x)\bigr) < f^{-1}\bigl(f(y)\bigr)\text{.}\)

Take \(c \in f(I)\text{.}\) If \(c\) is not a cluster point of \(f(I)\text{,}\) then \(f^{-1}\) is continuous at \(c\) automatically. So let \(c\) be a cluster point of \(f(I)\text{.}\) Suppose both of the following one-sided limits exist:

\begin{equation*} \begin{aligned} x_0 & := \lim_{y \to c^-} f^{-1}(y) = \sup \bigl\{ f^{-1}(y) : y < c, y \in f(I) \bigr\} = \sup \bigl\{ x \in I : f(x) < c \bigr\} , \\ x_1 & := \lim_{y \to c^+} f^{-1}(y) = \inf \bigl\{ f^{-1}(y) : y > c, y \in f(I) \bigr\} = \inf \bigl\{ x \in I : f(x) > c \bigr\} . \end{aligned} \end{equation*}

We have \(x_0 \leq x_1\) as \(f^{-1}\) is increasing. For all \(x \in I\) where \(x > x_0\text{,}\) we have \(f(x) \geq c\text{.}\) As \(f\) is strictly increasing, we must have \(f(x) > c\) for all \(x \in I\) where \(x > x_0\text{.}\) Therefore,

\begin{equation*} \{ x \in I : x > x_0 \} \subset \bigl\{ x \in I : f(x) > c \bigr\}. \end{equation*}

The infimum of the left-hand set is \(x_0\text{,}\) and the infimum of the right-hand set is \(x_1\text{,}\) so we obtain \(x_0 \geq x_1\text{.}\) So \(x_1 = x_0\text{,}\) and \(f^{-1}\) is continuous at \(c\text{.}\)

If one of the one-sided limits does not exist, the argument is similar and is left as an exercise.

Example 3.6.7 .

The proposition does not require \(f\) itself to be continuous. Let \(f \colon \R \to \R\) be defined by

\begin{equation*} f(x) := \begin{cases} x & \text{if } x < 0, \\ x+1 & \text{if } x \geq 0. \\ \end{cases} \end{equation*}

The function \(f\) is not continuous at \(0\text{.}\) The image of \(I = \R\) is the set \((-\infty,0)\cup [1,\infty)\text{,}\) not an interval. Then \(f^{-1} \colon (-\infty,0)\cup [1,\infty) \to \R\) can be written as

\begin{equation*} f^{-1}(y) = \begin{cases} y & \text{if } y < 0, \\ y-1 & \text{if } y \geq 1. \end{cases} \end{equation*}

It is not difficult to see that \(f^{-1}\) is a continuous function. See Figure 3.10 for the graphs.

---

Figure 3.10. Graph of \(f\) on the left and \(f^{-1}\) on the right.

---

Notice what happens with the proposition if \(f(I)\) is an interval. In that case, we could simply apply Corollary 3.6.3 to both \(f\) and \(f^{-1}\text{.}\) That is, if \(f \colon I \to J\) is an onto strictly monotone function and \(I\) and \(J\) are intervals, then both \(f\) and \(f^{-1}\) are continuous. Furthermore, \(f(I)\) is an interval precisely when \(f\) is continuous.

Subsection 3.6.3 Exercises

Exercise 3.6.1 .

Suppose \(f \colon [0,1] \to \R\) is monotone. Prove \(f\) is bounded.

Exercise 3.6.2 .

Finish the proof of Proposition 3.6.2. Hint: You can halve your work by noticing that if \(g\) is decreasing, then \(-g\) is increasing.

Exercise 3.6.3 .

Finish the proof of Corollary 3.6.3.

Exercise 3.6.4 .

Prove the claims in Example 3.6.5.

Exercise 3.6.5 .

Finish the proof of Proposition 3.6.6.

Exercise 3.6.6 .

Suppose \(S \subset \R\text{,}\) and \(f \colon S \to \R\) is an increasing function. Prove:

1. If \(c\) is a cluster point of \(S \cap (c,\infty)\text{,}\) then \(\lim\limits_{x\to c^+} f(x) < \infty\text{.}\)

2. If \(c\) is a cluster point of \(S \cap (-\infty,c)\) and \(\lim\limits_{x\to c^-} f(x) = \infty\text{,}\) then \(S \subset (-\infty,c)\text{.}\)

Exercise 3.6.7 .

Let \(I \subset \R\) be an interval and \(f \colon I \to \R\) a function. Suppose that for each \(c \in I\text{,}\) there exist \(a, b \in \R\) with \(a > 0\) such that \(f(x) \geq a x + b\) for all \(x \in I\) and \(f(c) = a c + b\text{.}\) Show that \(f\) is strictly increasing.

Exercise 3.6.8 .

Suppose \(I\) and \(J\) are intervals and \(f \colon I \to J\) is a continuous, bijective (one-to-one and onto) function. Show that \(f\) is strictly monotone.

Exercise 3.6.9 .

Consider a monotone function \(f \colon I \to \R\) on an interval \(I\text{.}\) Prove that there exists a function \(g \colon I \to \R\) such that \(\lim\limits_{x \to c^-} g(x) = g(c)\) for all \(c\) in \(I\) except the smaller (left) endpoint of \(I\text{,}\) and such that \(g(x) = f(x)\) for all but countably many \(x \in I\text{.}\)

Exercise 3.6.10 .

1. Let \(S \subset \R\) be a subset. If \(f \colon S \to \R\) is increasing and bounded, then show that there exists an increasing \(F \colon \R \to \R\) such that \(f(x) = F(x)\) for all \(x \in S\text{.}\)

2. Find an example of a strictly increasing bounded \(f \colon S \to \R\) such that an increasing \(F\) as above is never strictly increasing.

Exercise 3.6.11 .

(Challenging)   Find an example of an increasing function \(f \colon [0,1] \to \R\) that has a discontinuity at each rational number. Then show that the image \(f([0,1])\) contains no interval. Hint: Enumerate the rational numbers and define the function with a series.

Exercise 3.6.12 .

Suppose \(I\) is an interval and \(f \colon I \to \R\) is monotone. Show that \(\R \setminus f(I)\) is a countable union of disjoint intervals.

Exercise 3.6.13 .

Suppose \(f \colon [0,1] \to (0,1)\) is increasing. Show that for every \(\epsilon > 0\text{,}\) there exists a strictly increasing \(g \colon [0,1] \to (0,1)\) such that \(g(0) = f(0)\text{,}\) \(f(x) \leq g(x)\) for all \(x\text{,}\) and \(g(1)-f(1) < \epsilon\text{.}\)

Exercise 3.6.14 .

Prove that the Dirichlet function \(f \colon [0,1] \to\R\) defined by \(f(x) := 1\) if \(x\) is rational and \(f(x) := 0\) otherwise cannot be written as a difference of two increasing functions. That is, there do not exist increasing \(g\) and \(h\) such that, \(f(x) = g(x) - h(x)\text{.}\)

Exercise 3.6.15 .

Suppose \(f \colon (a,b) \to (c,d)\) is a strictly increasing onto function. Prove that there exists a \(g \colon (a,b) \to (c,d)\text{,}\) which is also strictly increasing and onto, and \(g(x) < f(x)\) for all \(x \in (a,b)\text{.}\)

sherrerhingthat.blogspot.com

Source: https://www.jirka.org/ra/html/sec_monotonefunc.html

Share this post