Since f majorizes g we have f(x)≥g(x),∀x∈I, and g majorizes h means g(x)≥h(x),∀x∈I, thus we have f(x)≥h(x),∀x∈I, which means f majorizes h. If f and g majorize each other, then it means f(x)≥g(x),∀x∈I and g(x)≥f(x),∀x∈I, so we shall have f(x)=g(x),∀x∈I.
Exercise 11.3.2
We have f majorizes g⇒f(x)≥g(x),∀x∈I⇒f(x)+h(x)≥g(x)+h(x),∀x∈I⇒(f+h)(x)≥(g+h)(x),∀x∈I⇒f+h majorizes g+h We cannot have fh majorizes gh if f majorizes g, since if we let h(x)=−1 on I, we shall have (fh)(x)=f(x)h(x)=−f(x)≤−g(x)=g(x)h(x)=(gh)(x). We cannot have cf majorizes cg if f majorizes g, we could let c=−1 and use a similar proof to show (cf)(x)≤(cg)(x).
Exercise 11.3.3
For f, we see f(x)≥f(x),∀x∈I, thus f majorizes f, and f is piecewise constant, thus by definition of upper Riemann integral we have ∫If≤p.c.∫If By the same logic we have f minorizes f, thus ∫If≥p.c.∫If Thus we have ∫If≥∫If, use Lemma 11.3.3 we can see f is Riemann integrable, and ∫If=p.c.∫If
Exercise 11.3.4
If g is piecewise constant with P and majorizes f on I, we denote cJ as the constant value of g for each J∈P, then cJ≥f(x),∀x∈J, thus cJ≥x∈Jsupf(x),∀J∈P So we have p.c.∫Ig=J∈P∑cJ∣J∣=J∈P,J=∅∑cJ∣J∣≥J∈P,J=∅∑(x∈Jsupf(x))∣J∣=U(f,P) A similar proof can show p.c.∫Ih≤L(f,P).
Exercise 11.3.5
By Lemma 11.3.11, let P be a partition of I. If g is piecewise constant with P and majorizes f on I, we have p.c.∫Ig≥U(f,P), so p.c.∫Ig≥inf{U(f,P):P is a partition of I} then since g is arbitrary as long as it is piecewise constant with P and majorizes f on I, ∫If≥inf{U(f,P):P is a partition of I} On the other hand, let mathbfP be a partition of I. We define a new piecewise constant function with P and majorizes f on I as follows: ∀x∈I,∃J∈P,x∈J, this J is unique, so we let G(x)=x∈Jsupf(x) Then G is piecewise constant with P and majorizes f on I, further we have p.c.∫IG=U(f,P) Thus we can say that ∫If≤p.c.∫IG=U(f,P) Since P could be any partition of I, we can say ∫If≤U(f,P),∀P is a partition of I So it’s easy to see ∫If≤inf{U(f,P):P is a partition of I} Thus we can have ∫If=inf{U(f,P):P is a partition of I} A similar proof can show that ∫If=sup{L(f,P):P is a partition of I}