196 CHAPTER 9. INTEGRATION

− f(t ′j+1

)(g(x j)−g(z))+

n

∑i= j+1

(f (ti)− f

(t ′i+1))

(g(xi)−g(xi−1))

The term, f (t j)(g(x j)−g

(x j−1

))can be written as

f (t j)(g(x j)−g

(x j−1

))= f (t j)(g(x j)−g(z))+ f (t j)

(g(z)−g

(x j−1

))and so, the middle terms can be written as

f (t j)(g(x j)−g(z))+ f (t j)(g(z)−g

(x j−1

))− f(t ′j)(

g(z)−g(x j−1

))− f

(t ′j+1

)(g(x j)−g(z))

=(

f (t j)− f(t ′j+1

))(g(x j)−g(z))+

(f (t j)− f

(t ′j))(

g(z)−g(x j−1

))The absolute value of this is dominated by

2(V[a,b] (g)+1

) (∣∣g(x j)−g(z)∣∣+ ∣∣g(z)−g

(x j−1

)∣∣)This is because the various pairs of values at which f is evaluated are closer than δ . Simi-larly, ∣∣∣∣∣ j−1

∑i=1

(f (ti)− f

(t ′i))

(g(xi)−g(xi−1))

∣∣∣∣∣≤ j−1

∑i=1

∣∣ f (ti)− f(t ′i)∣∣ |g(xi)−g(xi−1)|

≤j−1

∑i=1

ε

2(V[a,b] (g)+1

) |g(xi)−g(xi−1)|

and∣∣∣∣∣ n

∑i= j+1

(f (ti)− f

(t ′i+1))

(g(xi)−g(xi−1))

∣∣∣∣∣≤ n

∑i= j+1

ε

2(V[a,b] (g)+1

) |g(xi)−g(xi−1)| .

Thus renumbering the points to include z,

∣∣S (P, f )−S(P′, f

)∣∣≤ n+1

∑i=1

ε

2(V[a,b] (g)+1

) |g(xi)−g(xi−1)|< ε/2.

Similar reasoning would apply if you added in two new points in the partition or more gen-erally, any finite number of new points. You would just have to consider more exceptionalterms. Therefore, if ||P|| < δ and Q is any partition, then from what was just shown, youcan pick the points on the intervals any way you like and

|S (P, f )−S (P∪Q, f )|< ε/2.

Therefore, if ||P|| , ||Q||< δ ,

|S (P, f )−S (Q, f )| ≤ |S (P, f )−S (P∪Q, f )|+ |S (P∪Q, f )−S (Q, f )|< ε/2+ ε/2 = ε

196 CHAPTER 9. INTEGRATION~f (tur) (@(%))—8(2)) + ¥ (0) ~F(hu)) (8) 26-0)i=j+The term, f (t;) (g (xj) — g (x;-1)) can be written asf(t) (¢ (A) —8 Oy-1)) =F (4) (8 (i) —8 @) +f ) (9 @) —8 (4-1)and so, the middle terms can be written asF (t;) (8 (%7) —8 (2) +f (ty) (8 We ue—f (4) (¢(2) 8 (xj- \. Nadle —g(z))= (f (ti) —f (thr) (gi) —8 (2) + (FH) -— FG) (8 @ 8 @-1))The absolute value of this is dominated by€< 2(Van (@) 41) 8H) 8 (z)| + |¢(z) —g (x-1)])This is because the various pairs of values at which f is evaluated are closer than 6. Simi-larly,f (ti) — Ff (/)) (8 (i) —8 @i-1)< y | ( ti) — (t;) | Ig ( Xi) — 8 (xi-1)|<B syig anita)andnYFG) -F (G41) (8) — 8 O-1)i=j+1Thus renumbering the points to include z,ek ee aSPRA-SP INS Mo Gg) y ls) g(xi-1)| <€/2.g)t+1Similar reasoning would apply if you added in two new points in the partition or more gen-erally, any finite number of new points. You would just have to consider more exceptionalterms. Therefore, if ||P|| < 6 and Q is any partition, then from what was just shown, youcan pick the points on the intervals any way you like andTherefore, if ||P|| ,||Q|| < 6,IS(PA)-S(@,f)| < |S(PS)—-S(PUQ,f)|+|S(PUQ.F) —S(Q.f)|< e€/2+¢e/2=€e