Def 27.3

for partition 𝛿[𝑎,𝑏]

  1. Δ𝑗=𝑥𝑗1𝑥𝑗
  2. inf𝐼𝑓=inf𝑥𝐼𝑓(𝑥) and sup𝐼𝑓=sup𝑥𝐼𝑓(𝑥)
  3. 𝜎=𝑛1𝑗=0Δ𝑗inf𝐼𝑗𝑓 and 𝜎=𝑛1𝑗=0Δ𝑗sup𝐼𝑗𝑓 where 𝐼𝑗=[𝑥𝑗,𝑥{𝑗+𝑖}]

Thm 29.1

Then we can take 𝐼=lim𝑘𝜏𝑘𝑓 and 𝜏𝑘={𝑥𝑘𝑗0𝑗2𝑘} where 𝜏𝑘𝜏𝑘+1.
Indeed we can say 𝜏𝑘+1𝜏𝑘 and (𝜏𝑘) is bounded below and monotone decreasing, which imply it is convergent.
Remarks:

  1. 𝑥𝑘𝑗 means 𝑗-th element in 𝑥𝑘 partition
  2. 𝑥𝑘 partition means we evenly split it into 2𝑘 elements

Lemma 28.2

For two partition 𝜎𝜏

𝜎𝑓𝜏𝑓𝑅𝜏(𝑅,𝜉)𝜏𝜎𝑓

where 𝑅 is Riemann integral
Basically, if the largest sub-interval is larger, we will get more inaccurate result.

Lemma 28.3

For two partition 𝜎𝜏 , 𝑀=sup(𝑓(𝑥)𝑓(𝑦)) which is the worst difference where 𝑎𝑥,𝑦𝑏, we can say 𝜏𝜎𝑓𝜏+|𝜏|𝑀(#𝜏#𝜎) where # is the number of that set.