We choose ∀K∈P′, then ∃J∈P,K⊆J, we can know f∣J is constant, thus f is constant on K, this means f is piecewise constant with respect to P′.
Exercise 11.2.2
By the condition given, there exists partitions P and P′, s.t. f is piecewise constant with respect to P, and g is piecewise constant with respect to P′. Now we consider any element K∈P#P′, by Lemma 11.2.7, f and g are piecewise constant with respect to P#P′, thus we can have c,d, s.t. f(x)=c,g(x)=d,∀x∈K, this means: (f+g)(x)=f(x)+g(x)=c+d,∀x∈K(f−g)(x)=f(x)−g(x)=c−d,∀x∈Kmax(f,g)(x)=max(f(x),g(x))=max(c,d),∀x∈K(fg)(x)=f(x)g(x)=cd,∀x∈K If in addition we have g(x)=0,∀x∈I, we can further have d=0 and (f/g)(x)=f(x)/g(x)=c/d,∀x∈K From above we can see that f+g,f−g,max(f,g),fg and if g doesn’t vanish on I, f/g are constant on K, since we choose arbitrary K from P#P′, we conclude all the functions are piecewise constant on I.
Exercise 11.2.3
By Lemma 11.2.7, we know f is piecewise constant with respect to P#P′, thus the value p.c.∫[P#P′]f=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]f=K∈P∑cK∣K∣=K∈P∑J∈PK∑cJ∣J∣=J∈P#P′∑cJ∣J∣=p.c.∫[P#P′]f Similarly we can prove p.c.∫[P′]f=p.c.∫[P#P′]f, and the statement is proved.
Exercise 11.2.4
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)=p.c.∫[P](f+g)=K∈P∑(cK+dK)∣K∣=K∈P∑cK∣K∣+K∈P∑dK∣K∣=p.c.∫[P]f+p.c.∫[P]g=p.c.∫If+p.c.∫Ig
( b ) cf is piecewise constant with respect to P, with constant value ccK on K∈P p.c.∫I(cf)=p.c.∫[P](cf)=K∈P∑(ccK)∣K∣=cK∈P∑cK∣K∣=c(p.c.∫[P]f)=c(p.c.∫If)
( c ) Use (b) we have p.c.∫I(−g)=−p.c.∫Ig, then use (a) we get p.c.∫I(f−g)=p.c.∫I(f+(−g))=p.c.∫If+p.c.∫I(−g)=p.c.∫If−p.c.∫Ig
( d ) If f(x)≥0,∀x∈I, then cK≥0,∀K∈P, so we have cK∣K∣≥0,∀K∈P p.c.∫If=p.c.∫[P]f=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)=p.c.∫If−p.c.∫Ig≥0⇒p.c.∫If≥p.c.∫Ig
( f ) If f(x)=c,∀x∈I, then cK=c,∀K∈P, so we have by Theorem 11.1.13 p.c.∫If=p.c.∫[P]f=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.∫JF=p.c.∫[P∪{J\I}]F=K∈P∪{J\I}∑cK∣K∣=K∈P∑cK∣K∣+0⋅∣J\I∣=K∈P∑cK∣K∣=p.c.∫If
( h ) We have PJ={L∩J:L∈P} and PK={L∩K:L∈P} be 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.∫If=p.c.∫I(F+G)=p.c.∫IF+p.c.∫IG=p.c.∫Jf∣J+p.c.∫Kf∣K