3.11. Riemann’s Condition#
When we are discussing about whether the limit \(\lim\) exists or not, we check that if the limit inferior \(\liminf\) and the limit superior \(\limsup\) are equal.
Similarly, it is reasonable to guess that the existence of the integral \(\int\) depends on the equality of the lower and upper integrals (whether \(\underline{\int} = \overline{\int}\)).
We say that a function \(f\) satisfies the Riemann’s condition with respect to \(\alpha\) on \([a, b]\) if for any \(\varepsilon > 0\), there exists a partition \(P_\varepsilon\) such that
or equivalently, just saying that
Note
(3.28) is the definition given in [Apostol, 1974]. But clearly (3.28)\(\iff\)(3.29). ((3.28)\(\implies\)(3.29) is obvious.) If (3.29) holds, then by Theorem 3.11 we know that the upper sum will decrease while the lower sum will increase as the partition gets finer, and the lower sum is always no greater than the upper sum. Therefore, (3.28) holds.
Let \(f\) be a bounded function on \([a, b]\). We have
Proof. Let \(M = \sup_{x \in [a, b]} f(x)\) and \(m = \inf_{x \in [a, b]} f(x)\). Clearly
That is, \(M-m\) is an upper bound of the set \(\{f(x) - f(y) \mid x, y \in [a, b]\}\). We now show that \(M - m\) is the least upper bound. Let \(\varepsilon > 0\) be arbitrary. There exists \(x_0 \in [a, b]\) such that \(f(x_0) > M - \varepsilon/2\), and there exists \(y_0 \in [a, b]\) such that \(f(y_0) < m + \varepsilon/2\). It then follows that
This completes the proof.
The following theorem ease the procedure of proving the existence of an integral.
Assume \(\alpha\) is increasing on \([a, b]\). Then the following statements are equivalent:
\(f \in \mathfrak{R}(\alpha)\) on \([a, b]\).
\(f\) satisfies the Riemann’s condition with respect to \(\alpha\) on \([a, b]\).
\(\underline{\int_a^b} f \dif \alpha = \overline{\int_a^b} f \dif \alpha\).
Proof. \noindent Proof of 1 \(\implies\) 2: Let \(\varepsilon > 0\) be arbitrary. Because \(f \in \mathfrak{R}(\alpha)\) on \([a, b]\), there exists a partition \(P_\varepsilon\) such that for all \(P \supseteq P_\varepsilon\) and any list of representatives \(T\) of \(P\), we have
We now construct two particular lists of representatives \(T_1\) and \(T_2\) of \(P\) as follows. Write \(P = \{x_0, \ldots, x_n\}\). On each subinterval \([x_{k-1}, x_k]\), we can find a \(t_k\) such that
and we can find a \(t_k^\prime\) such that
Let \(T_1\) be the list of all such \(t_k\)’s and \(T_2\) be the list of all \(t_k^\prime\)’s. It then follows that
Taking the difference yields
But (3.30) implies that
Combined with (3.31), we obtain
which holds for any refinement \(P\) of \(P_\varepsilon\). Therefore, \(f\) satisfies the Riemann’s condition with respect to \(\alpha\) on \([a, b]\).
\noindent Proof of 2 \(\implies\) 3: Let \(\varepsilon > 0\) be arbitrary. Because \(f\) satisfies the Riemann’s condition. There exists a partition \(P_\varepsilon\) such that
But
Therefore,
Since the above inequality holds for every \(\varepsilon\), we have \( \underline{\int_a^b} f \dif \alpha = \overline{\int_a^b} f \dif \alpha\).
\noindent Proof of 3 \(\implies\) 1: Let \(\varepsilon > 0\) be arbitrary. There exists a partition \(P_\varepsilon^\prime\) such that
and a partition \(P_\varepsilon^{\prime\prime}\) such that
Let \(P_\varepsilon = P_\varepsilon^\prime \cup P_\varepsilon^{\prime\prime}\). For any refinement \(P \supseteq P_\varepsilon\), and any list of representatives \(T\) of \(P\), we have
Because the lower and upper integrals are equal, we can write \(A = \underline{\int_a^b} f \dif \alpha - \varepsilon = \overline{\int_a^b} f \dif \alpha - \varepsilon\). It then follows that
This implies that \(f \in \mathfrak{R}(\alpha)\) on \([a, b]\), and the value of the integral equals to that of both lower and upper integrals.