B.2. PIECEWISE LINEAR APPROXIMATION 377

B.2 Piecewise Linear ApproximationDefinition B.2.1 Let P be a dissection of [0,T ] and let F ∈ V p ([0,T ]) . Let FP

denote the piecewise linear approximation of F. That is, it agrees with F at every pointof P and in [ti, ti+1] it is of the form 1

ti+1−ti[(F (ti))(ti+1− t)+F (ti+1)(t− ti)] = F (ti)+

(t− ti)(

F(ti+1)−F(ti)ti+1−ti

).

To get the piecewise linear approximation, you could write

FP (t)≡∫ t

0

(F (0)t1− t0

+n−1

∑i=0

F (ti+1)−F (ti)ti+1− ti

)X[ti,ti+1) (s)ds

Note that the formula gives

FP (t1) = F (0)+F (t1)−F (t0) = F (t1) ,

FP (t2) = F (t1)+F (t2)−F (t1)

t2− t1(t2− t1) = F (t2)

etc.Next is a fundamental approximation lemma which says that when you replace a func-

tion in V p with its piecewise linear approximation the p variation gets smaller. First is asimple observation. Suppose p ≥ 1 and ∑

ni=1 ri = r where each ri is positive and less than

1. Then rp ≥ ∑ni=1 rp

i . To see this is so, note that ∑ni=1

rir = 1 and so ∑i

( rir

)p ≤ ∑irir = 1 so

the claim follows.

Lemma B.2.2 Let F ∈ V p ([0,T ]) and let P be a dissection. Then∥∥FP

∥∥p,[0,T ] ≤

∥F∥p,[0,T ]. Also, if Pε is a dissection for which

∑Pε

∣∣∣FP (ui+1)−FP (ui)∣∣∣p > ∥∥∥FP

∥∥∥p

p,[0,T ]− ε,

then this inequality continues to hold for Pε in which Pε ⊆P .

Proof: Let Pε be a dissection of [0,T ] such that

∑ui∈Pε

∣∣∣FP (ui+1)−FP (ui)∣∣∣p > ∥∥∥FP

∥∥∥p

p,[0,T ]− ε (2.1)

The idea is to show that, deleting some points of Pε you can assume every grid point ofPε is also a grid point of P while preserving the above inequality. This might not be toosurprising because the variation of FP is determined by the F (ti) where ti ∈P . Let themesh points of Pε be denoted by {ui} and those of P are denoted by

{t j}

.Let

(t j, t j+1

)be an interval which contains points of Pε say ui,ui+1, ...,uk in order.

Modify P if necessary by including t j, t j+1. Then corresponding to this interval, the abovesum gives

k−1

∑l=i|a(ul+1−ul)|p +

∣∣a(t j+1−uk)∣∣p + ∣∣a(ui− t j)

∣∣p

B.2. PIECEWISE LINEAR APPROXIMATION 377B.2 Piecewise Linear ApproximationDefinition B.2.1 Let F be a dissection of [0,7] and let F € V? ([0,T]). Let F?denote the piecewise linear approximation of F. That is, it agrees with F at every pointof P and in {t;,t)41] it is of the form ih [(F (ti)) (ti41 —t) + F (G41) (t-—4)] = F(t) +(t—1)) (Mr),tip.To get the piecewise linear approximation, you could write; t n—1 . _ .pr? ()= i (ee 5 Elon) fw) Ying. (6) dsh-to jy tit TGNote that the formula givesF?(q) = F(0)+F(t)—F() =F (n),FO)-FUW) 6) = FW)F? (hm) = F(t)+ —etc.Next is a fundamental approximation lemma which says that when you replace a func-tion in V? with its piecewise linear approximation the p variation gets smaller. First is asimple observation. Suppose p > 1 and Y"_, r; = r where each r; is positive and less than1. Then r? > ¥"_,r?. To see this is so, note that D?_; “ = 1 and so Y;(“)’ <y; 4 =1s0the claim follows.Lemma B.2.2 Let F € V?((0,T]) and let P be a dissection. Then IF IL,.0 1 <IF llp,[0,.7)- Also, if Pe is a dissection for whichYF? (wis) —F (ui)Pep g\|PHF Ton n®p,[0,7]then this inequality continues to hold for P_ in which Pz C FP.Proof: Let Y, be a dissection of [0,7] such thatLujePeZe G PpF” (us) —F” (uj) ~€ (2.1)p,[0,7]DP> |r?The idea is to show that, deleting some points of “, you can assume every grid point of#, is also a grid point of Y while preserving the above inequality. This might not be toosurprising because the variation of F” is determined by the F (t;) where t; € Y. Let themesh points of A, be denoted by {u;} and those of Y are denoted by {tj}.Let (t;,t;41) be an interval which contains points of We say uj, Uj41,...,Uz in order.Modify Y if necessary by including t;,t;1. Then corresponding to this interval, the abovesum givesk-ly la (uy — uy) |? + |a (tj41 — ux) |’ + la (uj —tj) ’I=i