We prove this by induction on n. More precisely, we let P(n) be the property that whenever I is a bounded interval, and whenever P is a partition of I with cardinality n, that α[I]=∑J∈Pα[J] . The case P(0) and P(1) are all easy to prove. Now suppose inductively that P(n) is true for n≥1, let I be a bounded interval, and P be a partition of I with cardinality n+1. If I is the empty set or a point, then all the intervals in P must also be either the empty set or a point and so every interval has length zero and the claim is trivial. Thus we will assume that I is an interval of the form (a,b],[a,b),(a,b) or [a,b]. Let us first suppose that b∈I, i.e., I is either (a,b] or [a,b]. Since b∈I, we know that one of the intervals K in P contains b. Since K is contained in I, it must therefore be of the form (c,b],[c,b], or {b} for some real number c, with a≤c≤b (in the latter case of K={b}, we set c:=b). In particular, this means that the set I−K is also an interval of the form [a,c],(a,c),(a,c],[a,c) when c>a, or a point or empty set when a=c. Either way, we easily see that α[I]=α(b)−α(a)=α(b)−α(c)+α(c)−α(a)=α[K]+α[I−K] On the other hand, since P forms a partition of I, we see that P−{K} forms a partition of I−K, By the induction hypothesis, we thus have α[I−K]=J∈P−{K}∑α[J] Combining these two identities, we obtain α[I]=J∈P∑α[J] Now suppose that b∈/I, i.e., I is either (a,b) or [a,b), Then one of the intervals K also is of the form (c,b) or [c,b). In particular, this means that the set I−K is also an interval of the form [a,c],(a,c),(a,c],[a,c) when c>a, or a point or empty set when a=c. The rest of the argument then proceeds as above.
Exercise 11.8.2
Proposition: Let I be a bounded interval, and let f:I→R be a function. Suppose that P and P′ are partitions of I such that f is piecewise constant both with respect to P and with respect to P′. Then p.c.∫[P]fdα=p.c.∫[P′]fdα. Proof: By Lemma 11.2.7, we know f is piecewise constant with respect to P#P′, thus the value p.c.∫[P#P′]fdα=J∈P#P′∑cJα[J] is well defined. Now choose any K∈P, then PK={J∈P#P′:J⊆K} is a partition of K, and f is constant with constant value cK on both K and all elements of PK, thus by Theorem 11.1.13 we have cJ=cK,∀J∈PK, and α[K]=J∈PK∑α[J]⟹cKα[K]=J∈PK∑cKα[J]=J∈PK∑cJα[J] Also, consider the set {J∈P#P′:J⊆K for some K∈P}⊆P#P′, for any J∈P#P′, by definition we can find a K∈P and a K′∈P′ s.t. J=K∩K′, so the two sets are equal. Thus p.c.∫[P]fdα=K∈P∑cKα[K]=K∈P∑J∈PK∑cJα[J]=J∈P#P′∑cJα[J]=p.c.∫[P#P′]fdα Similarly we can prove p.c.∫[P′]fdα=p.c.∫[P#P′]fdα, and the statement is proved.
Exercise 11.8.3
Proposition: Let I be a bounded interval, and let f:I→R and g:I→R be piecewise constant functions on I. Let α:X→R be defined on a domain containing I which is monotone increasing, then ( a ) We have p.c.∫I(f+g)dα=p.c.∫Ifdα+p.c.∫Igdα. ( b ) For any real number c, we have p.c.∫I(cf)dα=c(p.c.∫Ifdα). ( c ) We have p.c.∫I(f−g)dα=p.c.∫Ifdα−p.c.∫Igdα. ( d ) If f(x)≥0,∀x∈I, then p.c.∫Ifdα≥0. ( e ) If f(x)≥g(x),∀x∈I, then p.c.∫Ifdα≥p.c.∫Igdα. ( f ) If f(x)=c,∀x∈I, then p.c.∫Ifdα=cα[I]. ( g ) Let J be a bounded interval containing I (i.e. I⊆J), and let F:J→R be the function F(x)={f(x),0,x∈Ix∈/I Then F is piecewise constant on J, and p.c.∫JFdα=p.c.∫Ifdα. ( h ) Suppose that {J,K} is a partition of I into two intervals J and K. Then the functions f∣J:J→R and f∣K:K→R are piecewise constant on J and K respectively, and we have p.c.∫Ifdα=p.c.∫Jf∣Jdα+p.c.∫Kf∣Kdα Proof: We choose partitions of I:P′ and P′′ such that f is piecewise constant with respect to P′ and g is piecewise constant with respect to P′′. Then let P=P′#P′′, we can see f and g are piecewise constant with respect to P. For any K∈P, let cK,dK denote the constant value of f and g on K.
( a ) f+g is piecewise constant with respect to P, with constant value cK+dK on K∈P, p.c.∫I(f+g)dα=p.c.∫[P](f+g)dα=K∈P∑(cK+dK)α[K]=K∈P∑cKα[K]+K∈P∑dKα[K]=p.c.∫[P]fdα+p.c.∫[P]gdα=p.c.∫Ifdα+p.c.∫Igdα ( b ) cf is piecewise constant with respect to P, with constant value ccK on K∈P, p.c.∫I(cf)dα=p.c.∫[P](cf)dα=K∈P∑(ccK)α[K]=cK∈P∑cKα[K]=c(p.c.∫[P]fdα)=c(p.c.∫Ifdα) ( c ) Use ( b ) we have p.c.∫I(−g)dα=−p.c.∫Igdα, then use ( a ) we get p.c.∫I(f−g)dα=p.c.∫I(f+(−g))dα=p.c.∫Ifdα+p.c.∫I(−g)dα=p.c.∫Ifdα−p.c.∫Igdα ( d ) If f(x)≥0,∀x∈I, then cK≥0,∀K∈P, since α is monotone increasing we have cKα[K]≥0,∀K∈P, thus p.c.∫Ifdα=p.c.∫[P]fdα=K∈P∑cKα[K]≥0 ( e ) We have f(x)−g(x)≥0,∀x∈I, so use ( d ) we have p.c.∫I(f−g)dα=p.c.∫Ifdα−p.c.∫Igdα≥0⇒p.c.∫Ifdα≥p.c.∫Igdα ( f ) If f(x)=c,∀x∈I, then cK=c,∀K∈P, so we have by Lemma 11.8.4 p.c.∫Ifdα=p.c.∫[P]fdα=K∈P∑cKα[K]=cK∈P∑α[K]=cα[I]
(g) The set P∪{J−I} is a partition of J, and F is piecewise constant on P∪{J−I}, with additional constant value cJ−I=0, thus p.c.∫JFdα=p.c.∫[P∪{J−I}]Fdα=K∈P∪{J−I}∑cKα[K]=K∈P∑cKα[K]+0⋅α[J−I]=K∈P∑cKα[K]=p.c.∫Ifdα
( h ) We have PJ={L∩J:L∈P} and PK={L∩K:L∈P} partitions of J and K, and since f is piecewise constant with P, it’s easy to see f∣J is piecewise constant with PJ on J, f∣K is piecewise constant with PK on K. As we have J⊆I and K⊆I, we define F(x)={f∣J(x),0,x∈Jx∈/J,G(x)={f∣K(x),0,x∈Kx∈/K Since {J,K} is a partition of I, we have f=f∣J+f∣K=F+G, thus use ( a ) ,( g ) we have p.c.∫Ifdα=p.c.∫I(F+G)dα=p.c.∫IFdα+p.c.∫IGdα=p.c.∫Jf∣Jdα+p.c.∫Kf∣Kdα
Exercise 11.8.4
Proposition: Let I be a bounded interval, and let f be a function which is uniformly continuous on I. Let α:X→R be defined on a domain containing I which is monotone increasing, Then f is Riemann-Stieltjes integrable on I with respect to α. Proof: From Proposition 9.9.15 we see that f is bounded. Now we have to show that ∫Ifdα=∫Ifdα. If I is a point or the empty set then the theorem is trivial, so let us assume that I is one of the four intervals [a,b],(a,b),(a,b], or [a,b) for some real numbers a<b. Let ε>0 be arbitrary. By uniform continuity, there exists a δ>0 such that ∣f(x)−f(y)∣<ε whenever x,y∈I,∣x−y∣<δ. By the Archimedean principle, there exists an integer N>0 such that (b−a)/N<δ, Note that we can partition I into N intervals J1,…,JN, each of length (b−a)/N, we thus have ∫Ifdα≤k=1∑N(x∈Jksupf(x))α[Jk],∫Ifdα≥k=1∑N(x∈Jkinff(x))α[Jk] So we have ∫Ifdα−∫Ifdα≤k=1∑N(x∈Jksupf(x)−x∈Jkinff(x))α[Jk]≤εk=1∑Nα[Jk]=εα[I]=ε(α(b)−α(a)) This shows ∫Ifdα−∫Ifdα cannot be positive.
Exercise 11.8.5
We let ε>0 be arbitrary. Then since f is continuous, ∃δ>0 such that ∣f(x)−f(0)∣<ϵ,∀x∈(−δ,δ) Since f is continuous on [−1,1], f is bounded, thus ∃M>0, s.t. ∣f(x)∣≤M,∀x∈[−1,1] We let {[−1,−δ],(−δ,δ),[δ,1]} be a partition of [−1,1], then the piecewise constant function g(x)={f(0)+ϵ,M,x∈(−δ,δ)x∈[−1,1]\(−δ,δ) majorizes f and we have ∫[−1,1]fdsgn≤∫[−1,1]gdsgn=M(sgn(−δ)−sgn(−1))+(f(0)+ϵ)(sgn(δ)−sgn(−δ))+M(sgn(1)−sgn(δ))=2(f(0)+ϵ) Similarly, the piecewise constant function h(x)={f(0)−ϵ,−M,x∈(−δ,δ)x∈[−1,1]\(−δ,δ) minorizes f and we have ∫[−1,1]fdsgn≥∫[−1,1]hdsgn=2(f(0)−ϵ) Thus we have 2(f(0)−ϵ)≤∫[−1,1]fdsgn≤∫[−1,1]fdsgn≤2(f(0)+ϵ) And the result follows.