Exercise 1.6.23 (Cousin's theorem)

Prove Cousin’s theorem: given any function δ : [a,b] (0,+) on a compact interval [a,b] of positive length, there exists a partition a = t0 < t1 < < tk = b with k 1, together with real numbers tj [tj1,tj] for each 1 j k and tj tj1 δ(tj).

Answers

Proof. To construct a partition for Cousin’s theorem1 , we implement the following algorithm.

c = b - a 
t = ([c,)) 
while (t  ): 
   c = c / 2 
   t = ([c,)) 
partition = {[a+i*c,a+(i+1)*c] for i=0,...,(b-a)/c}

Heuristically, the algorithm suggests starting with the largest possible value of δ that is allowed for this partition: b a. If the gauge function δ never exceeds this value, then we already have our partition a,b where the middle point t can be any point between a and b. If, however, δ does exceed b a somewhere, then we must search further. Splitting [a,b] in half, we check whether δ exceeds ba 2 on both halves of [a,b]. If this is not the case, then we are done as we have a partition a, b+a 2 ,b with the middle points t1,t2 anywhere in between. If that is not the case, we further split the interval into four parts and repeat the procedure with ba 4 .

The above algorithm is guaranteed to terminate. If that would not be the case, then we could find a x n=1In such that for all n we would have δ(x) < ba n , i.e., δ(x) = 0 - a contradiction to the positivity assumption on δ.

PIC
Figure 2: A gauge partition on [0,1] (by Jordan Barrett).
User profile picture
2021-12-24 11:02
Comments