Week 7 Riemann Stieltjes Integration: Lectures 1921

 Noel Rodgers
 6 months ago
 Views:
Transcription
1 Week 7 Riemnn Stieltjes Integrtion: Lectures Lecture 19 Throughout this section α will denote monotoniclly incresing function on n intervl [, b]. Let f be bounded function on [, b]. Let P = { = 0 < 1,, n = b} be prtition of [, b]. Put α i = α( i ) α( i 1 ). M i = sup{f(x) : i 1 x i }. m i = inf{f(x) : i 1 x i }. U(P, f) = M i α i ; L(P, f) = m i α i. i=1 fdα = inf{u(p, f) : P }; Definition 1 If fdα = i=1 fdα = sup{l(p, f) : P }. fdα, then we sy f is RiemnnStieltjes (RS) integrble w.r.t. to α nd denote this common vlue by b fdα := f(x)dα(x) := fdα = fdα. 0
2 Let R(α) denote the clss of ll RS integrble functions on [, b]. Definition 2 A prtition P of [, b] is clled refinement of nother prtition P of [, b] if, points of P re ll present in P. We then write P P. Lemm 1 If P P then L(P ) L(P ) nd U(P ) U(P ). Enough to do this under the ssumption tht P hs one extr point thn P. And then it is obvious becuse if < b < c then inf{f(x) : x c} min{inf{f(x) : x b}, inf{f(x) : b x c} etc. Theorem 1 fdα fdα. For first of ll, becuse for every prtition P we hve U(P, f) L(P, f). Let P nd Q be ny two prtitions of [, b]. By tking common refinement T = P Q, nd pplying the bove lemm we get U(P ; f) U(T ; f) L(T ; f) L(Q; f) Now vrying Q over ll possible prtitions nd tking the supremum, we get U(P ) fdα. Now vrying P over ll prtitions of [, b] nd tking the infimum, we get the theorem. Theorem 2 Let f be bounded function nd α be monotoniclly incresing function. Then the following re equivlent. (i) f R(α). (ii) Given ɛ > 0, there exists prtition P of [, b] such tht U(P, f) L(P, f) < ɛ. 1
3 (iii) Given ɛ > 0, there exists prtition P of [, b] such tht for ll refinements of Q of P we hve U(Q, f) L(Q, f) < ɛ. (iv) Given ɛ > 0, there exists prtition P = { 0 < 1 < cdots < n } of [, b] such tht for rbitrry points t i, s i [ i 1, i ] we hve f(s i ) f(t i ) α i < ɛ. i=1 (v) There exists rel number η such tht for every ɛ > 0, there exists prtition P = { 0 < 1, < < n } of [, b] such tht for rbitrry points t i [ i 1, i ], we hve n i=1 f(t i) α i η < ɛ. Proof: (i) = (ii): By definition of the upper nd lower integrls, there exist prtitions Q, T such tht U(Q) fdα < ɛ/2; fdα L(T ) < ɛ/2. Tke common refinement P to Q nd T nd replce Q, T by P in the bove inequlities, nd then dd the two inequlities nd use the hypothesis (i) to conclude (ii). (ii) = (i): Since L(P ) fdα b fdα U(P ) the conclusion follows. (ii) = (iii): This follows from the previous theorem for if P P then (iii) = (ii): Obvious. L(P ) L(P ) U(P ) U(P ). (iii) = (iv): Note tht f(s i ) f(t i ) M i m i. Therefore, f(s i ) f(t i ) α i i i (M i m i ) α i = U(P, f) L(P, f) < ɛ. 2
4 (iv) = (iii): Choose points t i, s i [ i 1, i ] such tht m i f(s i ) < ɛ 2n α i, M i f(t i ) < ɛ 2n α i. Then U(P, f) L(P, f) i (M i m i ) α i i [ M i f(t i ) + m i f(s i ) + f(t i ) f(s i )] α i < 2ɛ. Thus so fr, we hve proved tht (i) to (iv) re ll equivlent to ech other. (i) = (v): We first note tht hving proved tht (i) to (iv) re ll equivlent, we cn use ny one of them. We tke η = fdα. Given ɛ > 0 we choose prtition P such tht L(P ) η < ɛ/3. nd prtition Q such tht (iv) holds with ɛ replced by ɛ/3. We then tke common refinement T of these two prtitions for which gin the sme would hold becuse of (iii). We now choose s i [ i 1, i ] such tht m i f(s i ) < ɛ 3n α i whenever α i is non zero. (If α i = 0 we cn tke s i to be ny point.) Then for rbitrry points t i [ i 1, i ], we hve = i f(t i) α i η [(f(t i ) f(s i ) + (f(s i ) m i ) + m i ] α i η i i f(s i ) f(t i ) α i + f(s i ) m i α i + L(P ) η i ɛ/3 + ɛ/3 + ɛ/3 = ɛ. (v) = (iv): Given ɛ > 0 choose prtition s in (v) with ɛ replced by ɛ/2. 3
5 Lecture 20 Fundmentl Properties of the RiemnnStieltjes Integrl Theorem 3 Let f, g be bounded functions nd α be n incresing function on n intervl [, b]. () Linerity in f : This just mens tht if f, g R(α), λ, µ R then λf + µg R(α). Moreover, (λf + µg) = λ fdα + µ fdα. (b) SemiLinerity in α. This just mens if f R(α j ), j = 1, 2 λ j > 0 then f R(λ 1 α 1 + λ 2 α 2 ) nd moreover, fd(λ 1 α 1 + λ 2 α 2 ) = λ fdα 1 + µ fdα 2. (c) Let < c < b. Then f R(α) on [, b] if f R(α) on [, c] s well s on [c, b]. Moreover we hve fdα = c fdα + c fdα. (d) f 1 f 2 on [, b] nd f i R(α) then f 1dα f 2dα. (e) If f R(α) nd f(x) M then fdα M[α(b) α()]. (f) If f is continuous on [, b] then f R(α). (g) f : [, b] [c, d] is in R(α) nd φ : [c, d] R is continuous then φ f R(α). (h) If f R(α) then f 2 R(α). (i) If, f, g R(α) then fg R(α). (j) If f R(α) then f R(α) nd fdα f dα. 4
6 Proof: () Put h = f + g. Given ɛ > 0, choose prtitions P, Q of [, b] such tht U(P, f) L(P, f) < ɛ/2, P (Q, g) L(Q, g) < ɛ/2 nd replce these prtitions by their common refinement T nd then ppel to L(T, f) + L(T, g) L(T, h) U(T, h) U(T, f) + U(T, g). For constnt λ since U(P, λf) = λu(p, f); L(P, λf) = λl(p.f) it follows tht proof of (). λfdα = λ (b) This is esier: In ny prtition P we hve fdα. Combining these two we get the from which the conclusion follows. (λ 1 α 1 + λ 2 α 2 ) = λ 1 α 1 + λ 2 α 2 (c) All tht we do is to stick to those prtitions of [, b] which contin the point c. (d) This is esy nd (e) is consequence of (d). ɛ (f) Given ɛ > 0, put ɛ 1 =. Then by uniform continuity of f, α(b) α() there exists δ > 0 such tht f(t) f(s) < ɛ 1 whenever t, s [, b] nd t s < δ. Choose prtition P such tht α i < δ for ll i. Then it follows tht M i m i < ɛ 1 nd hence U(P ) L(P ) < ɛ. (g) Given ɛ > 0 by uniform continuity of φ, we get ɛ > δ > 0 such tht φ(t) φ(s) < ɛ for ll t, s [c, d] with t s < δ. There is prtition P of [, b] such tht U(P, f) L(P, f) < δ 2. 5
7 The differences M i m i my behve in two different wys: Accordingly let us define A = {1 i n : M i m i < δ}, B = {1, 2,..., n} \ A. Put h = φ f. It follows tht M i (h) m i (h) < ɛ, i A. Therefore we hve δ( α i ) i m i ) α i < U(P, f) L(P, f) < δ i B i B(M 2. Therefore we hve i B α i < δ. Now let K be bound for φ(t) on [c, d]. Then U(P, h) L(P, h) = i (M i(h) m i (h)) α i = i A (M i(h) m i (h)) α i + i B (M i(h) m i (h)) α i ɛ(α(b) α()) + 2Kδ < ɛ(α(b) α() + 2K). Since ɛ > 0 is rbitrry, we re done. (h) Follows from (g) by tking φ(t) = t 2. (i) Write fg = 1 4 [(f + g)2 (f g) 2 ]. (j) Tke φ(t) = t nd pply (g) to see tht f R(α). Now let λ = ±1 so tht λ fdα 0. Then fdα = λ fdα = λfdα f dα. This completes the proof of the theorem. Theorem 4 Suppose f is monotonic nd α is continuous nd monotoniclly incresing. Then f R(α). Proof: Given ɛ > 0, by uniform continuity of α we cn find prtition P such tht ech α i < ɛ. 6
8 Now if f is incresing, then we hve M i = f( i ), m i = f( i 1 ). Therefore, U(P ) L(P ) = i [f( i ) f( i 1 )] α i < f(b) f())ɛ. Since ɛ > 0 is rbitrry, we re done. Lecture 21 Theorem 5 Let f be bounded function on [, b] with finitely mny discontinuities. Suppose α is continuous t every point where f is discontinuous. Then f R(α). Proof: Becuse of (c) of theorem 3, it is enough to prove this for the cse when c [, b] is the only discontinuity of f. Put K = sup f(t). Given ɛ > 0, we cn find δ 1 > 0 such tht α(c + δ 1 ) α(c δ 1 ) < ɛ. By uniform continuity of f on [, b] \ (c δ, c + δ) we cn find δ 2 > 0 such tht x y < δ 2 implies f(x) f(y) < ɛ. Given ny prtition P of [, b] choose prtition Q which contins the points c nd whose mesh is less thn min{δ 1, δ 2 }. It follows tht U(Q) L(Q) < ɛ(α(b) α()) + 2Kɛ. Since ɛ > 0 is rbitrry this implies f R(α). Remrk 1 The bove result leds one to the following question. Assuming tht α is continuous on the whole of [, b], how lrge cn be the set of discontinuities of function f such tht f R(α)? The nswer is not within RS theory. Lebesgue hs to invent new powerful theory which not only nswers this nd severl such questions rised by Riemnn integrtion theory but lso provides sound foundtion to the theory of probbility. Exmple 1 We shll denote the unit step function t 0 by U which 7
9 is defined s follows: U(x) = { 0, x 0; 1, x > 0. By shifting the origin t other points we cn get other unit step function. For exmple, suppose c [, b]. Consider α(x) = U(x c), x [, b]. For ny bounded function f : [, b] R, let us try to compute fdα. Consider ny prtition P of [, b] in which c = k. The only non zero α i is α k = 1. Therefore U(P ) L(P ) = M k (f) m k (f). Now ssume tht f is continuous t c. Then by choosing k+1 close to k = c, we cn mke M k m k 0. This mens tht f R(α). Indeed, it follows tht M k f(c) nd m k f(c). Therefore, fdα = f(c). Now suppose f hs discontinuity t c of the first kind i.e, in prticulr, f(c + ) exists. It then follows tht M k m k f(c) f(c + ). Therefore, f R(α) iff f(c + ) = f(c). Thus, we see tht it is possible to destroy integrbility by just disturbing the vlue of the function t one single point where α itself is discontinuous. In prticulr, tke f = α. It follows tht α R(α) on [, b]. We shll now prove prtil converse to (c) of Theorem 3. Theorem 6 Let f be bounded function nd α n incresing function on [, b]. Let c [, b] t which (t lest) f or α is continuous. If f R(α) on [, b] then f R(α) on both [, c] nd [c, b]; moreover, in tht cse, fdα = c fdα + c fdα. 8
10 Proof: Assume α is continuous t c. If T c is the trnsltion function T c (x) = x c then the functions g 1 = U T nd g 2 = 1 U T re both in R(α) since they re discontinuous only t c. Therefore fg 1, fg 2 R(α). But these respectively imply tht f R(α) on [c, b] nd on [, c]. We now consider the cse when f is continuous t c. We shll prove tht f R(α) on [, c], the proof tht f R(α) on [c, b] being similr. Recll tht the set of discontinuities of monotonic function is countble. Therefore there exist sequence of points c n in [, c] (we re ssuming tht < c) such tht c n c. By the erlier cse f R(α) on ech of the intervls [, c n ]. We clim tht the sequence s n := cn fdα converges to limit which is equl to c fdα. Let K > 0 be bound for α. Given ɛ > 0 we cn choose δ > 0 such tht for x, y [c δ, c + δ], f(x) f(y) < ɛ/2k. If n 0 is big enough then n, m n 0 implies tht s n s m < ɛ. This mens {s n } Cuchy nd hence is convergent with limit equl to sy, s. Now choose n so tht s s n < ɛ. Put = α(c) α(c ). Since c n c, from the left, it follows tht α(c n ) α(c ). Choose n lrge enough so tht where L is bound for f. α(c n ) α(c ) < ɛ/l Now, choose ny prtition Q of [, c n ] so tht U(Q, f) s n < ɛ. This is possible becuse f R(α) on [, c n ]. Put P = Q {c}, M = mx{f(x) : x [c n, c]}. Then s + f(c) U(P, f) s s n + s n U(Q, f) + f(c) (α(c) α(c n ))M ɛ + ɛ + (f(c) M) + (α(c n ) α(c ))M 2ɛ + ɛ 2K + M ɛ K 4ɛ. 9
11 Theorem 7 Let {c n } be sequence of non negtive rel numbers such tht n c n <. Let t n (, b) be sequence of distinct points in the open intervl nd let α = n c nu T tn. Then for ny continuous function f on [, b] we hve fdα = n c n f(t n ). Proof: Observe tht for ny x [, b], 0 n U(x t n) n c n nd hence α(x) mkes sense. Also clerly it is monotoniclly incresing nd α() = 0 nd α(b) = n c n. Given ɛ > 0 choose n 0 such tht n>n 0 c n < ɛ. Tke α 1 = n n 0 U T tn, α 2 = n>n 0 U T tn. By (b) of theorem 3, nd from the exmple bove, we hve fdα 1 = n n 0 c n f(t n ). If K is bound for f on [, b] we lso hve fdα 2 < K(α 2 (b) α 2 ()) = K c n = Mɛ. n>n 0 Therefore, This proves the clim. fdα c n f(t n ) < Kɛ. n n 0 Theorem 8 Let α be n incresing function nd α R(x) on [, b]. Then for ny bounded rel function on [, b], f R(α) iff fα R(x). Furthermore, in this cse, fdα = f(x)α (x)dx. 10
12 Proof: Given ɛ > 0, since α is Riemnn integrble, by (iv) of theorem 2, there exists prtition P = { = 0 < 1 < < n = b} of [, b] such tht for ll s i, t i [ i 1, i ] we hve, α (s i ) α (t i ) x i < ɛ. i=1 Apply MTV to α to obtin t i [ i 1, i ] such tht α i = α (t i ) x i. Put M = sup f(x). Then f(s i ) α i = i=1 f(s i )α (t i ) x i. i=1 Therefore, f(s i ) x i i=1 f(s i )α (s i ) x i < i i=1 f(s i ) α (s i ) α (t i ) x i > Mɛ. Therefore f(s i ) x i i=1 f(s i )α (s i ) x i + Mɛ U(P, fα ) + Mɛ. i=1 Since this is true for rbitrry s i [ i 1, i ], it follows tht U(P, f, α) U(P, fα ) + Mɛ. Likewise, we lso obtin U(P, fα ) U(P, f, α)) + Mɛ. Thus U(P, f, α) U(P, fα ) < Mɛ. Exctly in the sme mnner, we lso get L(P, f, α L(P, fα ) < Mɛ. 11
13 Note tht the bove two inequlities hold for refinements of P s well. Now suppose f R(α). we cn then ssume tht the prtition P is chosen so tht It then follows tht U(P, f, α) L(P, fα) < Mɛ. U(P, fα ) L(P, fα ) < 3Mɛ. Since ɛ > 0 is rbitrry, this implies fα is Riemnn integrble. The other wy impliction is similr. Moreover, the bove inequlities lso estblish the lst prt of the theorem. Remrk 2 The bove theorems illustrte the power of Stieltjes modifiction of Riemnn theory. In the first cse, α ws stircse function (lso clled pure step function). The integrl therein is reduced to finite or infinite sum. In the ltter cse, α is differentible function nd the integrl reduced to the ordinry Riemnn integrl. Thus the RS theory brings brings unifiction of the discrete cse with the continuous cse, so tht we cn tret both of them in one go. As n illustrtive exmple, consider thin stright wire of finite length. The moment of inerti bout n xis perpendiculr to the wire nd through n end point is given by l 0 x 2 dm where m(x) denotes the mss of the segment [0, x] of the wire. If the mss is given by density function ρ, then m(x) = x ρ(t)dt or 0 equivlently, dm = ρ(x)dx nd the moment of inerti tkes form l 0 x 2 ρ(x)dx. On the other hnd if the mss is mde of finitely mny vlues m i 12
14 concentrted t points x i then the inerti tkes the form x 2 i m i. i Theorem 9 Chnge of Vrible formul Let φ : [, b] [c, d] be strictly incresing differentible function such tht φ() = c, φ(b) = d. Let α be n incresing function on [c, d] nd f be bounded function on [c, d] such tht f R(α). Put β = α φ, g = f φ. Then g R(β) nd we hve gdβ = d c fdα. Proof: Since φ is strictly incresing, it defines oneone correspondence of prtitions of [, b] with those of [c, d], given by { = 0 < 1 < < n = b} {c = φ() < φ( 1 ) < < φ( n ) = d}. Under this correspondence observe tht the vlue of the two functions f, g re the sme nd lso the vlue of function α, β re lso the sme. Therefore, the two upper sums lower sums re the sme nd hence the two upper nd lower integrls re the sme. The result follows. 13
15 Week 8 Functions of Bounded Vrition Lectures Lecture 22 : Functions of bounded Vrition Definition 3 Let f : [, b] R be ny function. For ech prtition P = { = 0 < 1 < < n = b} of [, b], consider the vritions Let V (P, f) = f( k ) f( k 1 ). k=1 V f = V f [, b] = sup{v (P, f) : P is prtition of [, b]}. If V f is finite we sy f is of bounded vrition on [, b]. Then V f is clled the totl vrition of f on [, b]. Let us denote the spce of ll functions of bounded vritions on [, b] by BV[, b]. Lemm 2 If Q is refinement of P then V (Q, f) V (P, f). Theorem 10 () f, g BV[, b], α, β R = αf + βg BV[, b]. Indeed, we lso hve V αf+βg α V f + β V g. (b) f BV[, b] = f is bounded on [, b]. 14
16 (c) f, g BV[, b] = fg BV[, b]. Indeed, if f K, g L then V fg LV f + KV g. (d) f BV[, b] nd f is bounded wy from 0 then 1/f BV[, b]. (e) Given c [, b], f BV[, b] iff f BV[, c] nd f BV[c, b]. Moreover, we hve V f [, b] = V f [, c] + V f [c, b]. (f) For ny f BV[, b] the function V f : [, b] R defined by V f () = 0 nd V f (x) = V f [, x], < x b, is n incresing function. (g) For ny f BV[, b], the function D f = V f f is n incresing function on [, b]. (h) Every monotonic function f on [, b] is of bounded vrition on [, b]. (i) Any function f : [, b] R is in BV[, b] iff it is the difference of two monotonic functions. (j) If f is continuous on [, b] nd differentible on (, b) with the derivtive f bounded on (, b), then f BV[, b]. (k) Let f BV[, b] nd continuous t c [, b] iff V f : [, b] R is continuous t c. Proof: () Indeed for every prtition, we hve V (P, αf+βg) = αv (P, f)+ βv (P, g). The result follows upon tking the supremum. (b) Tke M = V f + f(). Then f(x) f(x) f() f() V (P, f) + f() M, where P is ny prtition in which, x re consecutive terms. (c) For ny two points x, y we hve, f(x)g(x) f(y)g(y) f(x) f(x) g(y) + g(y) f(x) f(y) Therefore, it follows tht V (P, f) KV g + LV f. 15
17 (d) Let 0 < m < f(x) for ll x [, b]. Then 1 f(x) 1 f(y) = f(x) f(y) f(x)f(y) It follows tht V (P, 1/f) V f for ll prtitions P nd hence the result. m 2 (e) Given ny prtition P of [, c] we cn extend it to prtition Q of [, b] by including the intervl [c, b]. Then V (Q, f) = V (P, f) + f(b) f(c) nd hence it follows tht if f BV[, b] then f BV[, c]; for similr reson, f BV[c, b] s well. Conversely suppose f BV[, c] BV[c, b]. Given prtion P of [, b] we first refine it to P by dding the point c nd then write Q = Q 1 Q 2 where Q i re the resstrictions of Q to [, c], [c, b] respectively. It follows tht V (P, f) V (Q, f) = V (Q 1, f) + V (Q 2, f) V f ([, c] + V f [c, b]. Therefore f BV[, b]. In either cse, the bove inequlity lso shows tht V f [, b] V f [, c + V f [c, b]. On the other hnd, since V (P, f) V (P, f) for ll P it follows tht V f [, b] = sup{v (P, f) : P is prtition of [, b]}. Since every prtition P is of the form P = Q 1 Q 2 where Q 1, Q 2 re rbitrry prtitions of [, c] nd [c, b] respectively, nd V (P, f) = V (Q 1, f) + V (Q 2, f) it follows tht V f [, b] = V f [, c] + V f [c, b]. (f) Follows from (e) (g) Let x < y b. Proving V f [, x] f(x) V f [, y] f(y) is the 16
18 sme s proving V f, x] + f(y) f(x) V f [, y]. For ny prtition P of [, x] let P = P {y}. Then V (P, f) + f(y) f(x) V (P, f) + f(y) f(x) = V (P, f) V f [, y]. Since this is true for ll prtitions P of [, x] we re through. (h) My ssume f is incresing. But then for every prtition P we hve V (P, f) = f(b) f() nd hence V f = f(b) f(). (i) If f BV[, b], from (f) nd (g), we hve f = V f (V f f) s difference of two incresing functions. The converse follows from () nd (h). (j) This is becuse then f stisfies Lipschitz condition f(x) f(y) M x y for ll x, y [, b]. Therefore for every prtition P we hve V (P, f) M(b ). (k) Observe tht V f is incresing nd hence V f (c ± ) exist. By (h) it follows tht sme is true for f. We shll show tht f(c) = f(c ± ) iff V f (c) = V f (c ± ) which would imply (k). So, ssume tht f(c) = f(c + ). Given ɛ > 0 we cn find δ 1 > 0 such tht f(x) f(c) < ɛ for ll c < x < c + δ 1, x [, b]. We cn lso choose prtition P = {c = x 0 < x 1 < < x n = b} such tht V f [c, b] ɛ < k f k. Put δ = min{δ 1, x 1 c}. Let now c < x < c + δ. Then V f (x) V f (c) = V f [c, x] = V f [c, b] V f [x, b] < ɛ + k f k V f [x, b] ɛ + f(x) f(c) + f(x 1 ) f(x) + k 2 f k V f [x, b] ɛ + ɛ + V f [x, b] V f [x, b] = 2ɛ. This proves tht V f (c + ) = V f (c) s required. 17
19 Conversely, suppose V f (c + ) = V f (c). Then given ɛ > 0 we cn find δ > 0 such tht for ll c < x < c + δ we hve V f (x) V f (c) < ɛ. But then given x, y such tht c < y < x < c + δ it follows tht f(y) f(c) + f(x) f(y) V f ([c, x] = V f (x) V f (c) < ɛ which definitely implies tht f(x) f(y) ɛ. This completes the proof tht V f (c + ) = V f (c) iff f(c + ) = f(c). Similr rguments will prove tht V f (c ) = V f (c) iff f(c ) = f(c). Exmple 2 Not ll continuous functions on closed nd bounded intervl re of bounded vrition. A typicl exmples is f : [0, π] R defined by f(x) = { For ech n consider the prtition P = {0, x cos ( π x), x 0 0, x = n, 1 2n 1,..., 1} Then V (P, f) = n 1 k=1. As n, we know this tends to. k However, the function g(x) = xf(x) is of bounded vrition. To see this observe tht g is differentible in [0, 1] nd the derivtive is bounded (though not continuous) nd so we cn pply (j) of the bove theorem. Also note tht even prtil converse to (j) is not true, i.e., differentible function of bounded vrition need not hve its derivtive bounded. For exmple h(x) = x 1/3, being incresing function, is of bounded vrition on [0, 1] but its derivtive is not bounded. Remrk 3 We re now going extend the RS integrl with integrtors α not necessrily incresing functions. In this connection, it should be noted tht condition (v) of theorem 63 becomes the strongest nd hence we dopt tht s the definition. 18
20 Definition 4 Let f, α : [, b] R be ny two functions. We sy f is RS integrble with respect to to α nd write f R(α) if there exists rel number η such tht for every ɛ > 0 there exists prtition P of [, b] such tht for every refinement Q = { + x 0 < x 1 < < x n = b} of P nd points t i [x i 1, x i ] we hve f(t i ) α i η < ɛ. i=1 We then write η = fdα nd cll it RS integrl of f with respect to α. It should be noted tht, in this generl sitution, severl properties listed in Theorem 64 my not be vlid. However, property (b) of Theorem 64 is vlid nd indeed becomes better. Lemm 3 For ny two functions α, β nd rel numbers λ, µ, if f R(α) R(β), then f R(λα + µβ). Moreover, in this cse we hve fd(λ α + µβ) = λ fdα + µ fdβ. Proof: This is so becuse for ny fixed prtition we hve the linerity property of : (λα + µβ) i = (λα + µβ)(x i x i 1 ) = λ( α) i + µ( β) i And hence the sme is true of the RS sums. Therefore, if η = fdα, γ = fdβ, then it follows tht λη + µγ = fd(λα + µβ). 19
21 Theorem 11 Let α be function of bounded vrition nd let V denote its totl vrition function V : [, b] R defined by V (x) = V α [, x]. Let f be ny bounded function. Then f R(α) iff f R(V α ) nd f R(V α). Proof: The if prt is esy becuse of (). Also, we need only prove tht if f R(α) then f R(V ). Given ɛ > 0 choose prtition P ɛ so tht for ll refinements P of P ɛ, nd for ll choices of t k, s k [ i 1, i ], we hve, k ) f(s k )) α k < ɛ, V f (b) < k=1(f(t k We shll estblish tht U(P, f, V ) L(P, f, V ) < ɛk α k + ɛ. for some constnt K. By dding nd subtrcting, this tsk my be broken up into estblishing two inequlities [M k (f) m k (f)][ V k α k ] < ɛk/2; k [M k (f) m k (f)] α k < ɛk/2. Now observe tht V k α k 0 for ll k. Therefore if M is bound for f, then k [M k(f) m k (f)][ V k α k ] 2M k ( V k α k ) 2M(V f (b) α k ) < 2Mɛ. To prove the second inequlity, let us put A = {k : α k 0}; B = {1, 2,..., n} \ A. For k A choose t k, s k [ k 1, k ] such tht f(t k ) f(s k ) > M k (f) m k (f) ɛ; 20 k
22 nd for k B choose them so tht We then hve f(s k ) f(t k ) > M k (f) m k (f) ɛ. k [M k(f) m k (f)] α k < k A (f(t k) f(s k )) α k + k B (f(s k) f(t k )) k + ɛ k α k = k [f(t k) f(s k )) α k + ɛv (b) = ɛ(1 + V (b)). Putting K = mx{2m, 1 + V (b)} we re done. Corollry 1 Let α : [, b] R be of bounded vrition nd f : [, b] R be ny function. If f R(α) on [, b] then it is so on every subintervl [c, d] of [, b]. Corollry 2 Let f : [, b] R be of bounded vrition nd α : [, b] R be continuous of bounded vrition. Then f R(α). Proof: By (k) of the bove theorem, we see tht V (α) nd V (α) α re both continuous nd incresing. Hence by previous theorem, V (f) nd V (f) f re both integrble with respect to V (α) nd V (α) α. Now we just use the dditive property. Lecture 24 Exmple 3 : 1. Consider the double sequence, s m,n = m, m, n 1. m + n 21
23 Compute the two iterted limits nd record your results. lim m lim n s m,n, lim n lim m s m,n x 2 2. Let f n (x) = (1 + x 2 ), x R, n 1 nd put f(x) = n n f n(x). Check tht f n is continuous. Compute f nd see tht f is not continuous. 3. Define g m (x) = lim n (cos m!πx) 2n nd put g(x) = lim m g m (x). Compute g nd see tht g is discontinuous everywhere. Directly check tht ech g m is Riemnn integrble wheres g is not Riemnn integrble. sin nx 4. Consider the sequence h n (x) = nd put h(x) = lim n f n (x). n Check tht h 0. On the other hnd, compute lim n h n(x). Wht do you conclude? 5. Put λ n (x) = n 2 x(1 x 2 ) n, 0 x 1. Compute the lim n λ n (x). On the other hnd check tht Therefore we hve 1 0 = lim n [ 1 0 λ n (x)dx = ] λ n (x)dx n2 2n [lim n λ n (x)]dx = 0. These re ll exmples wherein certin nice properties of functions fil to be preserved under pointwise limit of functions. And we hve seen enough results to show tht these properties re preserved under uniform convergence. We know tht if sequence of continuous functions converges uniformly to function, then the limit function is continuous. We cn 22
24 now sk for the converse: Suppose sequence of continuous functions f n converges pointwise to function f which is lso continuous. the convergence uniform? The nswer in generl is NO. But there is sitution when we cn sy yes s well. Theorem 12 Let X be compct metric spce f n : X R be sequence of continuous functions converging pointwise to continuous function f. Suppose further tht f n is monotone. Then the f n f uniformly on X. Proof: Recll tht f is monotone incresing mens f n (x) f n+1 (x) for ll n nd for ll x. Likewise f n is monotone decresing mens f n (x) f n+1 (x) for ll n nd for ll x. Therefore, we cn define g n (x) = f(x) f n (x) to obtin sequence of continuous functions which monotoniclly decreses to 0. It suffices to prove tht g n converges uniformly. Given ɛ > 0 we wnt to find n 0 such tht g n (x) < ɛ for ll n n 0 nd for ll x X. Put K n = {x X : g n (x) ɛ}. Then ech K n is closed subset of X. Also g n (x) g n+1 (x) it follows tht K n+1 K n. On the other hnd, sunce g n (x) 0 it follows tht n K n =. Since this is hppening in compct spce X we conclude tht K n0 = for n 0. Remrk 4 The compctness is crucil s illustrted by the exmple: f n (x) = 1 nx + 1, 0 < x < 1. Is 23
Math 554 Integration
Mth 554 Integrtion Hndout #9 4/12/96 Defn. A collection of n + 1 distinct points of the intervl [, b] P := {x 0 = < x 1 < < x i 1 < x i < < b =: x n } is clled prtition of the intervl. In this cse, we
More information1 i n x i x i 1. Note that kqk kp k. In addition, if P and Q are partition of [a, b], P Q is finer than both P and Q.
Chpter 6 Integrtion In this chpter we define the integrl. Intuitively, it should be the re under curve. Not surprisingly, fter mny exmples, counter exmples, exceptions, generliztions, the concept of the
More informationLecture 1. Functional series. Pointwise and uniform convergence.
1 Introduction. Lecture 1. Functionl series. Pointwise nd uniform convergence. In this course we study mongst other things Fourier series. The Fourier series for periodic function f(x) with period 2π is
More informationRiemann Stieltjes Integration  Definition and Existence of Integral
 Definition nd Existence of Integrl Dr. Adity Kushik Directorte of Distnce Eduction Kurukshetr University, Kurukshetr Hryn 136119 Indi. Prtition Riemnn Stieltjes Sums Refinement Definition Given closed
More informationThe RiemannStieltjes Integral
Chpter 6 The RiemnnStieltjes Integrl 6.1. Definition nd Eistene of the Integrl Definition 6.1. Let, b R nd < b. ( A prtition P of intervl [, b] is finite set of points P = { 0, 1,..., n } suh tht = 0
More informationUNIFORM CONVERGENCE MA 403: REAL ANALYSIS, INSTRUCTOR: B. V. LIMAYE
UNIFORM CONVERGENCE MA 403: REAL ANALYSIS, INSTRUCTOR: B. V. LIMAYE 1. Pointwise Convergence of Sequence Let E be set nd Y be metric spce. Consider functions f n : E Y for n = 1, 2,.... We sy tht the sequence
More informationMATH 409 Advanced Calculus I Lecture 19: Riemann sums. Properties of integrals.
MATH 409 Advnced Clculus I Lecture 19: Riemnn sums. Properties of integrls. Drboux sums Let P = {x 0,x 1,...,x n } be prtition of n intervl [,b], where x 0 = < x 1 < < x n = b. Let f : [,b] R be bounded
More informationThe final exam will take place on Friday May 11th from 8am 11am in Evans room 60.
Mth 104: finl informtion The finl exm will tke plce on Fridy My 11th from 8m 11m in Evns room 60. The exm will cover ll prts of the course with equl weighting. It will cover Chpters 1 5, 7 15, 17 21, 23
More informationMath 324 Course Notes: Brief description
Brief description These re notes for Mth 324, n introductory course in Mesure nd Integrtion. Students re dvised to go through ll sections in detil nd ttempt ll problems. These notes will be modified nd
More informationMath 8 Winter 2015 Applications of Integration
Mth 8 Winter 205 Applictions of Integrtion Here re few importnt pplictions of integrtion. The pplictions you my see on n exm in this course include only the Net Chnge Theorem (which is relly just the Fundmentl
More informationMapping the delta function and other Radon measures
Mpping the delt function nd other Rdon mesures Notes for Mth583A, Fll 2008 November 25, 2008 Rdon mesures Consider continuous function f on the rel line with sclr vlues. It is sid to hve bounded support
More informationChapter 4. Lebesgue Integration
4.2. Lebesgue Integrtion 1 Chpter 4. Lebesgue Integrtion Section 4.2. Lebesgue Integrtion Note. Simple functions ply the sme role to Lebesgue integrls s step functions ply to Riemnn integrtion. Definition.
More informationFunctions of bounded variation
Division for Mthemtics Mrtin Lind Functions of bounded vrition Mthemtics Clevel thesis Dte: 20060130 Supervisor: Viktor Kold Exminer: Thoms Mrtinsson Krlstds universitet 651 88 Krlstd Tfn 054700 10
More informationa n+2 a n+1 M n a 2 a 1. (2)
Rel Anlysis Fll 004 Tke Home Finl Key 1. Suppose tht f is uniformly continuous on set S R nd {x n } is Cuchy sequence in S. Prove tht {f(x n )} is Cuchy sequence. (f is not ssumed to be continuous outside
More informationMATH 174A: PROBLEM SET 5. Suggested Solution
MATH 174A: PROBLEM SET 5 Suggested Solution Problem 1. Suppose tht I [, b] is n intervl. Let f 1 b f() d for f C(I; R) (i.e. f is continuous relvlued function on I), nd let L 1 (I) denote the completion
More information2 Definitions and Basic Properties of Extended Riemann Stieltjes Integrals
2 Definitions nd Bsic Properties of Extended Riemnn Stieltjes Integrls 2.1 Regulted nd Intervl Functions Regulted functions Let X be Bnch spce, nd let J be nonempty intervl in R, which my be bounded or
More informationPolynomial Approximations for the Natural Logarithm and Arctangent Functions. Math 230
Polynomil Approimtions for the Nturl Logrithm nd Arctngent Functions Mth 23 You recll from first semester clculus how one cn use the derivtive to find n eqution for the tngent line to function t given
More informationMath 4200: Homework Problems
Mth 4200: Homework Problems Gregor Kovčič 1. Prove the following properties of the binomil coefficients ( n ) ( n ) (i) 1 + + + + 1 2 ( n ) (ii) 1 ( n ) ( n ) + 2 + 3 + + n 2 3 ( ) n ( n + = 2 n 1 n) n,
More informationCzechoslovak Mathematical Journal, 55 (130) (2005), , Abbotsford. 1. Introduction
Czechoslovk Mthemticl Journl, 55 (130) (2005), 933 940 ESTIMATES OF THE REMAINDER IN TAYLOR S THEOREM USING THE HENSTOCKKURZWEIL INTEGRAL, Abbotsford (Received Jnury 22, 2003) Abstrct. When relvlued
More informationConvex Sets and Functions
B Convex Sets nd Functions Definition B1 Let L, +, ) be rel liner spce nd let C be subset of L The set C is convex if, for ll x,y C nd ll [, 1], we hve 1 )x+y C In other words, every point on the line
More informationThe Wave Equation I. MA 436 Kurt Bryan
1 Introduction The Wve Eqution I MA 436 Kurt Bryn Consider string stretching long the x xis, of indeterminte (or even infinite!) length. We wnt to derive n eqution which models the motion of the string
More information63. Representation of functions as power series Consider a power series. ( 1) n x 2n for all 1 < x < 1
3 9. SEQUENCES AND SERIES 63. Representtion of functions s power series Consider power series x 2 + x 4 x 6 + x 8 + = ( ) n x 2n It is geometric series with q = x 2 nd therefore it converges for ll q =
More informationSection 6.1 Definite Integral
Section 6.1 Definite Integrl Suppose we wnt to find the re of region tht is not so nicely shped. For exmple, consider the function shown elow. The re elow the curve nd ove the x xis cnnot e determined
More informationNUMERICAL INTEGRATION. The inverse process to differentiation in calculus is integration. Mathematically, integration is represented by.
NUMERICAL INTEGRATION 1 Introduction The inverse process to differentition in clculus is integrtion. Mthemticlly, integrtion is represented by f(x) dx which stnds for the integrl of the function f(x) with
More information(0.0)(0.1)+(0.3)(0.1)+(0.6)(0.1)+ +(2.7)(0.1) = 1.35
7 Integrtion º½ ÌÛÓ Ü ÑÔÐ Up to now we hve been concerned with extrcting informtion bout how function chnges from the function itself. Given knowledge bout n object s position, for exmple, we wnt to know
More informationImproper Integrals. The First Fundamental Theorem of Calculus, as we ve discussed in class, goes as follows:
Improper Integrls The First Fundmentl Theorem of Clculus, s we ve discussed in clss, goes s follows: If f is continuous on the intervl [, ] nd F is function for which F t = ft, then ftdt = F F. An integrl
More information7.2 The Definition of the Riemann Integral. Outline
7.2 The Definition of the Riemnn Integrl Tom Lewis Fll Semester 2014 Upper nd lower sums Some importnt theorems Upper nd lower integrls The integrl Two importnt theorems on integrbility Outline Upper nd
More information7  Continuous random variables
71 Continuous rndom vribles S. Lll, Stnford 2011.01.25.01 7  Continuous rndom vribles Continuous rndom vribles The cumultive distribution function The uniform rndom vrible Gussin rndom vribles The Gussin
More informationContinuous Random Variables
STAT/MATH 395 A  PROBABILITY II UW Winter Qurter 217 Néhémy Lim Continuous Rndom Vribles Nottion. The indictor function of set S is relvlued function defined by : { 1 if x S 1 S (x) if x S Suppose tht
More informationNumerical integration
2 Numericl integrtion This is pge i Printer: Opque this 2. Introduction Numericl integrtion is problem tht is prt of mny problems in the economics nd econometrics literture. The orgniztion of this chpter
More informationSTEP FUNCTIONS, DELTA FUNCTIONS, AND THE VARIATION OF PARAMETERS FORMULA. 0 if t < 0, 1 if t > 0.
STEP FUNCTIONS, DELTA FUNCTIONS, AND THE VARIATION OF PARAMETERS FORMULA STEPHEN SCHECTER. The unit step function nd piecewise continuous functions The Heviside unit step function u(t) is given by if t
More informationThe problems that follow illustrate the methods covered in class. They are typical of the types of problems that will be on the tests.
ADVANCED CALCULUS PRACTICE PROBLEMS JAMES KEESLING The problems tht follow illustrte the methods covered in clss. They re typicl of the types of problems tht will be on the tests. 1. Riemnn Integrtion
More informationUniversitaireWiskundeCompetitie. Problem 2005/4A We have k=1. Show that for every q Q satisfying 0 < q < 1, there exists a finite subset K N so that
Problemen/UWC NAW 5/7 nr juni 006 47 Problemen/UWC UniversitireWiskundeCompetitie Edition 005/4 For Session 005/4 we received submissions from Peter Vndendriessche, Vldislv Frnk, Arne Smeets, Jn vn de
More information20 MATHEMATICS POLYNOMIALS
0 MATHEMATICS POLYNOMIALS.1 Introduction In Clss IX, you hve studied polynomils in one vrible nd their degrees. Recll tht if p(x) is polynomil in x, the highest power of x in p(x) is clled the degree of
More informationWe know that if f is a continuous nonnegative function on the interval [a, b], then b
1 Ares Between Curves c 22 Donld Kreider nd Dwight Lhr We know tht if f is continuous nonnegtive function on the intervl [, b], then f(x) dx is the re under the grph of f nd bove the intervl. We re going
More information(a) A partition P of [a, b] is a finite subset of [a, b] containing a and b. If Q is another partition and P Q, then Q is a refinement of P.
Chpter 7: The Riemnn Integrl When the derivtive is introdued, it is not hrd to see tht the it of the differene quotient should be equl to the slope of the tngent line, or when the horizontl xis is time
More informationNecessary and Sufficient Conditions for Differentiating Under the Integral Sign
Necessry nd Sufficient Conditions for Differentiting Under the Integrl Sign Erik Tlvil 1. INTRODUCTION. When we hve n integrl tht depends on prmeter, sy F(x f (x, y dy, it is often importnt to know when
More information7.6 The Use of Definite Integrals in Physics and Engineering
Arknss Tech University MATH 94: Clculus II Dr. Mrcel B. Finn 7.6 The Use of Definite Integrls in Physics nd Engineering It hs been shown how clculus cn be pplied to find solutions to geometric problems
More informationFarey Fractions. Rickard Fernström. U.U.D.M. Project Report 2017:24. Department of Mathematics Uppsala University
U.U.D.M. Project Report 07:4 Frey Frctions Rickrd Fernström Exmensrete i mtemtik, 5 hp Hledre: Andres Strömergsson Exmintor: Jörgen Östensson Juni 07 Deprtment of Mthemtics Uppsl University Frey Frctions
More informationl 2 p2 n 4n 2, the total surface area of the
Week 6 Lectures Sections 7.5, 7.6 Section 7.5: Surfce re of Revolution Surfce re of Cone: Let C be circle of rdius r. Let P n be n nsided regulr polygon of perimeter p n with vertices on C. Form cone
More information1 Sequences. 2 Series. 2 SERIES Analysis Study Guide
2 SERIES Anlysis Study Guide 1 Sequences Def: An ordered field is field F nd totl order < (for ll x, y, z F ): (i) x < y, y < x or x = y, (ii) x < y, y < z x < z (iii) x < y x + z < y + z (iv) 0 < y, x
More informationSection 14.3 Arc Length and Curvature
Section 4.3 Arc Length nd Curvture Clculus on Curves in Spce In this section, we ly the foundtions for describing the movement of n object in spce.. Vector Function Bsics In Clc, formul for rc length in
More informationA Convergence Theorem for the Improper Riemann Integral of Banach Spacevalued Functions
Interntionl Journl of Mthemticl Anlysis Vol. 8, 2014, no. 50, 24512460 HIKARI Ltd, www.mhikri.com http://dx.doi.org/10.12988/ijm.2014.49294 A Convergence Theorem for the Improper Riemnn Integrl of Bnch
More informationPDE Notes. Paul Carnig. January ODE s vs PDE s 1
PDE Notes Pul Crnig Jnury 2014 Contents 1 ODE s vs PDE s 1 2 Section 1.2 Het diffusion Eqution 1 2.1 Fourier s w of Het Conduction............................. 2 2.2 Energy Conservtion.....................................
More informationHenstock Kurzweil delta and nabla integrals
Henstock Kurzweil delt nd nbl integrls Alln Peterson nd Bevn Thompson Deprtment of Mthemtics nd Sttistics, University of NebrskLincoln Lincoln, NE 685880323 peterso@mth.unl.edu Mthemtics, SPS, The University
More informationMA123, Chapter 10: Formulas for integrals: integrals, antiderivatives, and the Fundamental Theorem of Calculus (pp.
MA123, Chpter 1: Formuls for integrls: integrls, ntiderivtives, nd the Fundmentl Theorem of Clculus (pp. 27233, Gootmn) Chpter Gols: Assignments: Understnd the sttement of the Fundmentl Theorem of Clculus.
More informationMATH 101A: ALGEBRA I PART B: RINGS AND MODULES 35
MATH 101A: ALGEBRA I PART B: RINGS AND MODULES 35 9. Modules over PID This week we re proving the fundmentl theorem for finitely generted modules over PID, nmely tht they re ll direct sums of cyclic modules.
More informationOn the Generalized Weighted QuasiArithmetic Integral Mean 1
Int. Journl of Mth. Anlysis, Vol. 7, 2013, no. 41, 20392048 HIKARI Ltd, www.mhikri.com http://dx.doi.org/10.12988/ijm.2013.3499 On the Generlized Weighted QusiArithmetic Integrl Men 1 Hui Sun School
More informationA basic logarithmic inequality, and the logarithmic mean
Notes on Number Theory nd Discrete Mthemtics ISSN 30 532 Vol. 2, 205, No., 3 35 A bsic logrithmic inequlity, nd the logrithmic men József Sándor Deprtment of Mthemtics, BbeşBolyi University Str. Koglnicenu
More informationMath 211A Homework. Edward Burkard. = tan (2x + z)
Mth A Homework Ewr Burkr Eercises 5C Eercise 8 Show tht the utonomous system: 5 Plne Autonomous Systems = e sin 3y + sin cos + e z, y = sin ( + 3y, z = tn ( + z hs n unstble criticl point t = y = z =
More informationChapter 4 Contravariance, Covariance, and Spacetime Diagrams
Chpter 4 Contrvrince, Covrince, nd Spcetime Digrms 4. The Components of Vector in Skewed Coordintes We hve seen in Chpter 3; figure 3.9, tht in order to show inertil motion tht is consistent with the Lorentz
More informationBIFURCATIONS IN ONEDIMENSIONAL DISCRETE SYSTEMS
BIFRCATIONS IN ONEDIMENSIONAL DISCRETE SYSTEMS FRANCESCA AICARDI In this lesson we will study the simplest dynmicl systems. We will see, however, tht even in this cse the scenrio of different possible
More informationS. S. Dragomir. 1. Introduction. In [1], Guessab and Schmeisser have proved among others, the following companion of Ostrowski s inequality:
FACTA UNIVERSITATIS NIŠ) Ser Mth Inform 9 00) 6 SOME COMPANIONS OF OSTROWSKI S INEQUALITY FOR ABSOLUTELY CONTINUOUS FUNCTIONS AND APPLICATIONS S S Drgomir Dedicted to Prof G Mstroinni for his 65th birthdy
More informationProblem Set 3
14.102 Problem Set 3 Due Tuesdy, October 18, in clss 1. Lecture Notes Exercise 208: Find R b log(t)dt,where0
More informationJournal of Inequalities in Pure and Applied Mathematics
Journl of Inequlities in Pure nd Applied Mthemtics GENERALIZATIONS OF THE TRAPEZOID INEQUALITIES BASED ON A NEW MEAN VALUE THEOREM FOR THE REMAINDER IN TAYLOR S FORMULA volume 7, issue 3, rticle 90, 006.
More informationMath 113 Exam 2 Practice
Mth Em Prctice Februry, 8 Em will cover sections 6.5, 7.7.5 nd 7.8. This sheet hs three sections. The first section will remind you bout techniques nd formuls tht you should know. The second gives number
More informationLecture 6: Singular Integrals, Open Quadrature rules, and Gauss Quadrature
Lecture notes on Vritionl nd Approximte Methods in Applied Mthemtics  A Peirce UBC Lecture 6: Singulr Integrls, Open Qudrture rules, nd Guss Qudrture (Compiled 6 August 7) In this lecture we discuss the
More informationHENSTOCKKURZWEIL TYPE INTEGRATION OF RIESZSPACEVALUED FUNCTIONS AND APPLICATIONS TO WALSH SERIES
Rel Anlysis Exchnge Vol. 29(1), 2003/2004, pp. 419 439 A. Boccuto, Deprtment of Mtemtics nd Informtics, Universit di Perugi, vi Vnvitelli 1, 06123 Perugi, Itly. emil: boccuto@dipmt.unipg.it V. A. Skvortsov,
More information1 Online Learning and Regret Minimization
2.997 DecisionMking in LrgeScle Systems My 10 MIT, Spring 2004 Hndout #29 Lecture Note 24 1 Online Lerning nd Regret Minimiztion In this lecture, we consider the problem of sequentil decision mking in
More informationTHE HANKEL MATRIX METHOD FOR GAUSSIAN QUADRATURE IN 1 AND 2 DIMENSIONS
THE HANKEL MATRIX METHOD FOR GAUSSIAN QUADRATURE IN 1 AND 2 DIMENSIONS CARLOS SUERO, MAURICIO ALMANZAR CONTENTS 1 Introduction 1 2 Proof of Gussin Qudrture 6 3 Iterted 2Dimensionl Gussin Qudrture 20 4
More informationFINALTERM EXAMINATION 2011 Calculus &. Analytical GeometryI
FINALTERM EXAMINATION 011 Clculus &. Anlyticl GeometryI Question No: 1 { Mrks: 1 )  Plese choose one If f is twice differentible function t sttionry point x 0 x 0 nd f ''(x 0 ) > 0 then f hs reltive...
More informationIf u = g(x) is a differentiable function whose range is an interval I and f is continuous on I, then f(g(x))g (x) dx = f(u) du
Integrtion by Substitution: The Fundmentl Theorem of Clculus demonstrted the importnce of being ble to find ntiderivtives. We now introduce some methods for finding ntiderivtives: If u = g(x) is differentible
More informationThe Bernoulli Numbers John C. Baez, December 23, x k. x e x 1 = n 0. B k n = n 2 (n + 1) 2
The Bernoulli Numbers John C. Bez, December 23, 2003 The numbers re defined by the eqution e 1 n 0 k. They re clled the Bernoulli numbers becuse they were first studied by Johnn Fulhber in book published
More informationPractice final exam solutions
University of Pennsylvni Deprtment of Mthemtics Mth 26 Honors Clculus II Spring Semester 29 Prof. Grssi, T.A. Asher Auel Prctice finl exm solutions 1. Let F : 2 2 be defined by F (x, y (x + y, x y. If
More informationEntropy and Ergodic Theory Notes 10: Large Deviations I
Entropy nd Ergodic Theory Notes 10: Lrge Devitions I 1 A chnge of convention This is our first lecture on pplictions of entropy in probbility theory. In probbility theory, the convention is tht ll logrithms
More informationON THE WEIGHTED OSTROWSKI INEQUALITY
ON THE WEIGHTED OSTROWSKI INEQUALITY N.S. BARNETT AND S.S. DRAGOMIR School of Computer Science nd Mthemtics Victori University, PO Bo 14428 Melbourne City, VIC 8001, Austrli. EMil: {neil.brnett, sever.drgomir}@vu.edu.u
More informationA GENERAL INTEGRAL RICARDO ESTRADA AND JASSON VINDAS
A GENERAL INTEGRAL RICARDO ESTRADA AND JASSON VINDAS Abstrct. We define n integrl, the distributionl integrl of functions of one rel vrible, tht is more generl thn the Lebesgue nd the DenjoyPerronHenstock
More informationDiscrete Leastsquares Approximations
Discrete Lestsqures Approximtions Given set of dt points (x, y ), (x, y ),, (x m, y m ), norml nd useful prctice in mny pplictions in sttistics, engineering nd other pplied sciences is to construct curve
More informationThe Dirac distribution
A DIRAC DISTRIBUTION A The Dirc distribution A Definition of the Dirc distribution The Dirc distribution δx cn be introduced by three equivlent wys Dirc [] defined it by reltions δx dx, δx if x The distribution
More informationIntroduction to Numerical Analysis
Introduction to Numericl Anlysis Doron Levy Deprtment of Mthemtics nd Center for Scientific Computtion nd Mthemticl Modeling (CSCAMM) University of Mrylnd June 14, 2012 D. Levy CONTENTS Contents 1 Introduction
More information10. AREAS BETWEEN CURVES
. AREAS BETWEEN CURVES.. Ares etween curves So res ove the xxis re positive nd res elow re negtive, right? Wrong! We lied! Well, when you first lern out integrtion it s convenient fiction tht s true in
More informationChapter 4. Additional Variational Concepts
Chpter 4 Additionl Vritionl Concepts 137 In the previous chpter we considered clculus o vrition problems which hd ixed boundry conditions. Tht is, in one dimension the end point conditions were speciied.
More informationMATH 573 FINAL EXAM. May 30, 2007
MATH 573 FINAL EXAM My 30, 007 NAME: Solutions 1. This exm is due Wednesdy, June 6 efore the 1:30 pm. After 1:30 pm I will NOT ccept the exm.. This exm hs 1 pges including this cover. There re 10 prolems.
More informationSummary of Elementary Calculus
Summry of Elementry Clculus Notes by Wlter Noll (1971) 1 The rel numbers The set of rel numbers is denoted by R. The set R is often visulized geometriclly s numberline nd its elements re often referred
More informationNew Integral Inequalities for ntime Differentiable Functions with Applications for pdfs
Applied Mthemticl Sciences, Vol. 2, 2008, no. 8, 353362 New Integrl Inequlities for ntime Differentible Functions with Applictions for pdfs Aristides I. Kechriniotis Technologicl Eductionl Institute
More informationE1: CALCULUS  lecture notes
E1: CALCULUS  lecture notes Ştefn Blint Ev Kslik, Simon Epure, Simin Mriş, Aureli Tomoiogă Contents I Introduction 9 1 The notions set, element of set, membership of n element in set re bsic notions of
More informationCalculus MATH 172Fall 2017 Lecture Notes
Clculus MATH 172Fll 2017 Lecture Notes These notes re concise summry of wht hs been covered so fr during the lectures. All the definitions must be memorized nd understood. Sttements of importnt theorems
More informationInnerproduct spaces
Innerproduct spces Definition: Let V be rel or complex liner spce over F (here R or C). An inner product is n opertion between two elements of V which results in sclr. It is denoted by u, v nd stisfies:
More informationDEFINITION OF ASSOCIATIVE OR DIRECT PRODUCT AND ROTATION OF VECTORS
3 DEFINITION OF ASSOCIATIVE OR DIRECT PRODUCT AND ROTATION OF VECTORS This chpter summrizes few properties of Cli ord Algebr nd describe its usefulness in e ecting vector rottions. 3.1 De nition of Associtive
More information31.2. Numerical Integration. Introduction. Prerequisites. Learning Outcomes
Numericl Integrtion 3. Introduction In this Section we will present some methods tht cn be used to pproximte integrls. Attention will be pid to how we ensure tht such pproximtions cn be gurnteed to be
More information1 Error Analysis of Simple Rules for Numerical Integration
cs41: introduction to numericl nlysis 11/16/10 Lecture 19: Numericl Integrtion II Instructor: Professor Amos Ron Scries: Mrk Cowlishw, Nthnel Fillmore 1 Error Anlysis of Simple Rules for Numericl Integrtion
More informationAnonymous Math 361: Homework 5. x i = 1 (1 u i )
Anonymous Mth 36: Homewor 5 Rudin. Let I be the set of ll u (u,..., u ) R with u i for ll i; let Q be the set of ll x (x,..., x ) R with x i, x i. (I is the unit cube; Q is the stndrd simplex in R ). Define
More informationOrthogonal Polynomials and LeastSquares Approximations to Functions
Chpter Orthogonl Polynomils nd LestSqures Approximtions to Functions **4/5/3 ET. Discrete LestSqures Approximtions Given set of dt points (x,y ), (x,y ),..., (x m,y m ), norml nd useful prctice in mny
More informationMath 0230 Calculus 2 Lectures
Mth Clculus Lectures Chpter 7 Applictions of Integrtion Numertion of sections corresponds to the text Jmes Stewrt, Essentil Clculus, Erly Trnscendentls, Second edition. Section 7. Ares Between Curves Two
More informationMTH 505: Number Theory Spring 2017
MTH 505: Numer Theory Spring 207 Homework 2 Drew Armstrong The Froenius Coin Prolem. Consider the eqution x ` y c where,, c, x, y re nturl numers. We cn think of $ nd $ s two denomintions of coins nd $c
More informationC1M14. Integrals as Area Accumulators
CM Integrls s Are Accumultors Most tetbooks do good job of developing the integrl nd this is not the plce to provide tht development. We will show how Mple presents Riemnn Sums nd the ccompnying digrms
More informationInternational Jour. of Diff. Eq. and Appl., 3, N1, (2001),
Interntionl Jour. of Diff. Eq. nd Appl., 3, N1, (2001), 3137. 1 New proof of Weyl s theorem A.G. Rmm Mthemtics Deprtment, Knss Stte University, Mnhttn, KS 665062602, USA rmm@mth.ksu.edu http://www.mth.ksu.edu/
More information1. Review: Eigenvalue problem for a symmetric matrix
1. Review: Eigenvlue problem for symmetric mtrix 1.1. Inner products For vectors u,v R n we define the inner product by u,v := nd the norm by u := u,u. We cll two vectors u,v orthogonl if u,v =. Recll
More informationCSCI FOUNDATIONS OF COMPUTER SCIENCE
1 CSCI 2200 FOUNDATIONS OF COMPUTER SCIENCE Spring 2015 My 7, 2015 2 Announcements Homework 9 is due now. Some finl exm review problems will be posted on the web site tody. These re prcqce problems not
More information5: The Definite Integral
5: The Definite Integrl 5.: Estimting with Finite Sums Consider moving oject its velocity (meters per second) t ny time (seconds) is given y v t = t+. Cn we use this informtion to determine the distnce
More informationNotes on Calculus II Integral Calculus. Miguel A. Lerma
Notes on Clculus II Integrl Clculus Miguel A. Lerm November 22, 22 Contents Introduction 5 Chpter. Integrls 6.. Ares nd Distnces. The Definite Integrl 6.2. The Evlution Theorem.3. The Fundmentl Theorem
More informationThe Basic Functional 2 1
2 The Bsic Functionl 2 1 Chpter 2: THE BASIC FUNCTIONAL TABLE OF CONTENTS Pge 2.1 Introduction..................... 2 3 2.2 The First Vrition.................. 2 3 2.3 The Euler Eqution..................
More informationJackson 2.26 Homework Problem Solution Dr. Christopher S. Baird University of Massachusetts Lowell
Jckson 2.26 Homework Problem Solution Dr. Christopher S. Bird University of Msschusetts Lowell PROBLEM: The twodimensionl region, ρ, φ β, is bounded by conducting surfces t φ =, ρ =, nd φ = β held t zero
More informationNot for reproduction
AREA OF A SURFACE OF REVOLUTION cut h FIGURE FIGURE πr r r l h FIGURE A surfce of revolution is formed when curve is rotted bout line. Such surfce is the lterl boundry of solid of revolution of the type
More informationThe Definite Integral
CHAPTER 3 The Definite Integrl Key Words nd Concepts: Definite Integrl Questions to Consider: How do we use slicing to turn problem sttement into definite integrl? How re definite nd indefinite integrls
More informationHomework Solution  Set 5 Due: Friday 10/03/08
CE 96 Introduction to the Theory of Computtion ll 2008 Homework olution  et 5 Due: ridy 10/0/08 1. Textook, Pge 86, Exercise 1.21. () 1 2 Add new strt stte nd finl stte. Mke originl finl stte nonfinl.
More informationCalculus 2: Integration. Differentiation. Integration
Clculus 2: Integrtion The reverse process to differentition is known s integrtion. Differentition f() f () Integrtion As it is the opposite of finding the derivtive, the function obtined b integrtion is
More informationa a a a a a a a a a a a a a a a a a a a a a a a In this section, we introduce a general formula for computing determinants.
Section 9 The Lplce Expnsion In the lst section, we defined the determinnt of (3 3) mtrix A 12 to be 22 12 21 22 2231 22 12 21. In this section, we introduce generl formul for computing determinnts. Rewriting
More informationLecture 1  Introduction and Basic Facts about PDEs
* 18.15  Introdution to PDEs, Fll 004 Prof. Gigliol Stffilni Leture 1  Introdution nd Bsi Fts bout PDEs The Content of the Course Definition of Prtil Differentil Eqution (PDE) Liner PDEs VVVVVVVVVVVVVVVVVVVV
More informationContinuous Random Variables Class 5, Jeremy Orloff and Jonathan Bloom
Lerning Gols Continuous Rndom Vriles Clss 5, 8.05 Jeremy Orloff nd Jonthn Bloom. Know the definition of continuous rndom vrile. 2. Know the definition of the proility density function (pdf) nd cumultive
More information