# Real Analysis and Multivariable Calculus: Graduate Level Problems and Solutions. Igor Yanovsky

Size: px
Start display at page:

Transcription

1 Rel Anlysis nd Multivrible Clculus: Grdute Level Problems nd Solutions Igor Ynovsky 1

2 Rel Anlysis nd Multivrible Clculus Igor Ynovsky, Disclimer: This hndbook is intended to ssist grdute students with qulifying exmintion preprtion. Plese be wre, however, tht the hndbook might contin, nd lmost certinly contins, typos s well s incorrect or inccurte solutions. I cn not be mde responsible for ny inccurcies contined in this hndbook.

3 Rel Anlysis nd Multivrible Clculus Igor Ynovsky, Contents 1 Countbility 5 2 Unions, Intersections, nd Topology of Sets 7 3 Sequences nd Series 9 4 Notes Lest Upper Bound Property Completeness 14 6 Compctness 16 7 Continuity Continuity nd Compctness Sequences nd Series of Functions Pointwise nd Uniform Convergence Normed Vector Spces Equicontinuity Arzel-Ascoli Theorem Connectedness Reltive Topology Connectedness Pth Connectedness Bire Ctegory Theorem Integrtion Riemnn Integrl Existence of Riemnn Integrl Fundmentl Theorem of Clculus Differentition R R The Derivtive of Rel Function Rolle s Theorem Men Vlue Theorem R R m R n R m Chin Rule Men Vlue Theorem x ( f y ) = y ( f x ) Tylor s Theorem Lgrnge Multipliers

4 Rel Anlysis nd Multivrible Clculus Igor Ynovsky, Successive Approximtions nd Implicit Functions Contrction Mppings Inverse Function Theorem Implicit Function Theorem Differentition Under Integrl Sign

5 Rel Anlysis nd Multivrible Clculus Igor Ynovsky, Countbility The number of elements in S is the crdinlity of S. S nd T hve the sme crdinlity (S T ) if there exists bijection f : S T. crd S crd T if injective 1 f : S T. crd S crd T if surjective 2 f : S T. S is countble if S is finite, or S N. Theorem. S, T φ. injection f : S T surjection g : T S. Theorem. Q is countble. Proof. Need to show tht there is bijection f : N Q. Since N Q, crd N crd Q, nd therefore, f tht is injective. To show crd N crd Q, construct the following mp. The set of ll rtionl numbers cn be displyed in grid with rows i = 1, 2, 3,... nd columns j = 0, 1, 1, 2, 2, 3, 3,.... Ech ij, the ij th entry in tble, would be represented s j i. Strting from 11, nd ssigning it n = 1, move from ech subsequent row digonlly left-down, updting n. This would give mp g : N Q, which will count ll frctions, some of them more thn once. Therefore, crd N crd Q, nd so g is surjective. Thus, crd N = crd Q, nd Q is countble. Theorem. R is not countble. Proof. It is enough to prove tht [0, 1) R is not countble. Suppose tht the set of ll rel numbers between 0 nd 1 is countble. Then we cn list the deciml representtions of these numbers (use the infinite expnsions) s follows: 1 = n... 2 = n... 3 = n... nd so on. We derive contrdiction by showing there is number x between 0 nd 1 tht is not on the list. For ech positive integer j, we will choose jth digit fter the deciml to be different thn jj : x = 0.x 1 x 2 x 3... x n..., where x j = 1 if jj 1, nd x j = 2 if jj = 1. For ech integer j, x differs in the jth position from the jth number on the list, nd therefore cnnot be tht number. Therefore, x cnnot be on the list. This mens the list s we chose is not bijection, nd so the set of ll rel numbers is uncountble. (Need to worry bout not llowing 9 tils in deciml expnsion: = ). 1 injective = 1-1: f(s 1 ) = f(s 2 ) s 1 = s 2. 2 surjective = onto: t T, s S, s.t. f(s) = t.

6 Rel Anlysis nd Multivrible Clculus Igor Ynovsky, Problem (F 01, #4). The set of ll sequences whose elements re the digits 0 nd 1 is not countble. Let S be the set of ll binry sequences. We wnt to show tht there does not exist one-to-one mpping from the set N onto the set S. Proof. 1) Let A be countble subset of S, nd let A consist of the sequences s 1, s 2,.... We construct the sequence s s follows. If the nth digit in s n is 1, let the nth digit of s be 0, nd vice vers. Then the sequence s differs from every member of A in t lest one plce; thus s / A. However, s S, so tht A is proper 3 subset of S. Thus, every countble subset of S is proper subset of S, nd therefore, S is not countble. Proof. 2) Suppose there exists f : N S tht is injective. We cn lwys exhibit n injective mp f : N S by lwys picking different sequence from the set of sequences tht re lredy listed. (One wy to do tht is to choose binry representtion for ech n N). Suppose f : N S is surjective. Then, ll sequences in S could be listed s s 1, s 2,.... We construct the sequence s s follows. If the nth digit in s n is 1, let the nth digit of s be 0, nd vice vers. Then the sequence s differs from every member of the list. Therefore, s is not on the list, nd our ssumption bout f being surjective is flse. Thus, there does not exist f : N S surjective. Theorem. crd (A) < crd (P (A)) 4. Proof. crd (A) crd (P (A)), since A cn be injectively mpped to the set of oneelement sets of A, which is subset of P (A). We need to show there is no onto mp between A nd P (A). So we would like to find thing in P (A) which is not reched by f. In other words, we wnt to describe subset of A which cnnot be of the form f() for ny A. Suppose A = P (A). Then there is 1-1 correspondence f : A P (A). We obtin contrdiction to the fct tht f is onto by exhibiting subset X of A such tht X f() for ny A. For every A, either f(), or / f(). Let X = { A : / f()}. Consider A. If f(), then / X, so f() X. If / f(), thn X, so f() X. Therefore, X f(), A, contrdiction. Therefore, crd (A) < crd (P (A)). Theorem. Suppose tht f : [0, 1] R is n incresing function. Show tht f cn hve t most countble number of discontinuities. Proof. Let E = {x [0, 1] : f is discontinuous t x}. Given ny x E, we know tht lim t x f(t) < lim t x + f(t) nd, using this fct, we choose r(x) Q such tht lim t x f(t) < r(x) < lim t x + f(t). We hve defined 1 1 function r : E Q. 3 A is proper subset of B if every element of A is n element of B, nd there is n element of B which is not in A. 4 Power set of set S is the set whose elements re ll possible subsets of S, i.e. S = {1, 2}, P (S) = 2 S = {φ, {1}, {2}, {1, 2}}. P (A) = 2 n, if A = n.

7 Rel Anlysis nd Multivrible Clculus Igor Ynovsky, Unions, Intersections, nd Topology of Sets Theorem. Let E α be collection of sets. Then ( α E α ) c = α (E c α). Proof. Let A = ( E α ) c nd B = ( E c α). If x A, then x / E α, hence x / E α for ny α, hence x E c α for every α, so tht x E c α. Thus A B. Conversely, if x B, then x E c α for every α, hence x / E α for ny α, hence x / E α, so tht x ( E α ) c. Thus B A. Theorem. ) For ny collection G α of open sets, α G α is open. b) For ny collection F α of closed sets, α F α is closed. c) For ny finite collection G 1,..., G n of open sets, n i=1 G i is open. d) For ny finite collection F 1,..., F n of closed sets, n i=1 F i is closed. Proof. ) Put G = α G α. If x G, then x G α for some α. Since x is n interior point of G α, x is lso n interior point of G, nd G is open. b) By theorem bove, ( α F α ) c = α (F c α) ( α F α ) c = α (F c α), (2.1) nd F c α is open. Hence ) implies tht the right eqution of (2.1) is open so tht α F α is closed. c) Put H = n i=1 G i. For ny x H, there exists neighborhoods N ri of x, such tht N ri G i (i = 1,..., n). Put r = min(r 1,..., r n ). Then N r (x) G i for i = 1,..., n, so tht N r (x) H, nd H is open. d) By tking complements, d) follows from c): ( n i=1 F i) c = n i=1 (F c i ). Theorem. S M X. S open reltive to M open U X such tht S = U M. Proof. S open reltive to M. To ech x S, r x, x y < r x, y M y S. Define U = x S N rx (x) U X open. It is cler tht S U M. By our choice of N rx (x), we hve N rx (x) M S, x S so tht U M S S = U M. If U is open in X nd S = U M, every x S hs neighborhood N rx (x) U. Then N rx (x) M S so tht S is open reltive to M.

8 Rel Anlysis nd Multivrible Clculus Igor Ynovsky, Theorem. K Y X. K compct reltive to X K compct reltive to Y. Proof. Suppose K is compct reltive to X, nd let {V α } be collection of sets, open reltive to Y, such tht K α V α. By the bove theorem, U α open reltive to X, such tht V α = Y U α, α; nd since K is compct reltive to X, we hve K U α1 Uαn Since K Y K V α1 Vαn. Suppose K is compct reltive to Y. Let {U α } be collection of open subsets of X which covers K, nd put V α = Y U α. Then will hold for some choice of α 1,..., α n ; nd since V α U α, implies. Theorem. Compct subsets of metric spces re closed. Proof. Let K X be compct subset. We prove K c is open. Suppose x X, x / K. If y K, let V y nd W y be neighborhoods of x nd y, respectively, of rdius less thn 1 2 d(x, y). Since K is compct, K W y 1 Wyn = W. If V = V y1 Vyn, then V is neighborhood of x which does not intersect W. Hence V K c, so tht x is n interior point of K c. Theorem. Closed subsets of compct sets re compct. Proof. Suppose F K X, F is closed (reltive to X), nd K is compct. Let {V α } be n open cover of F. If F c is djoined to {V α }, we obtin n open cover Ω of K. Since K is compct, there is finite subcollection Φ of Ω which covers K, nd hence F. If F c is member of Φ, we my remove it from Φ nd still retin n open cover of F. We hve thus shown tht finite subcollection of {V α } covers F. Corollry. If F is closed nd K is compct, then F K is compct. Proof. K is closed (by theorem bove), nd thus F K is closed. Since F K K, the bove theorem shows tht F K is compct. Theorem. If {K α } is collection of compct subsets of metric spce X such tht the intersection of every finite subcollection of {K α } is nonempty, then K α is nonempty. Proof. Fix member K 1 of {K α }. Assume tht no point of K 1 belongs to every K α. Then the sets Kα c form n open cover of K 1 ; nd since K 1 is compct, K 1 Kα c 1 K c αn. But this mens tht K 1 Kα1 Kαn is empty. contrdiction.

9 Rel Anlysis nd Multivrible Clculus Igor Ynovsky, Sequences nd Series A sequence {p n } converges to p X if: ɛ > 0, N: n N p n p < ɛ lim n p n = p. A sequence {p n } is Cuchy if: ɛ > 0, N: n, m N p n p m < ɛ. Cuchy criterion: A sequence converges in R k it is Cuchy sequence. Cuchy criterion: n converges ɛ > 0, N : m k=n k ɛ if m n N. The series n is sid to converge bsolutely if n converges. Problem (S 03, #2). If 1, 2, 3,... is sequence of rel numbers with j=1 j <, then lim N N j=1 j exists. ( n converges bsolutely n converges). Proof. If s n = n j=1 j is prtil sum, then for m n we hve s n s m = n j j=1 m j = j=1 n j j=m n j Since j converges, given ɛ > 0, N, s.t. m, n N (m n), then n j=m j < ɛ. Thus {s n } is Cuchy sequence in R, nd converges. lim N N j=1 j exists. Problem (F 01, #2). Let N denote the positive integers, let n = ( 1) n 1 n, nd let α be ny rel number. Prove there is one-to-one nd onto mpping σ : N N such tht σ(n) = α. n=1 j=m Proof. n = ( 1) n 1 n 1 = 1, 2 = 1 2, 3 = 1 3, 4 = 1 4,.... 2n > 0, 2n 1 < 0, n = 1, 2,... (positive terms) = n=1 2n = 0. (negtive terms) = n=1 2n 1 n=1 1 2n, nd lim n 1 2n 1 = 0. n=1 1 2n = 1 2 = n=1 n=1 1 n diverges, nd lim n 1 2n = 1 2n 1 diverges by comprison with Clim: α R, there is one-to-one nd onto mpping σ : N N such tht n=1 σ(n) = α, where σ(n) is the rerrngement of indices of the originl series. Given α, choose positive terms in sequentil order until their sum exceeds α. At this switch point, choose negtive terms until their sum is less thn α. Repet the process. Note: This process never stops becuse no mtter how mny positive nd negtive terms re tken, there re still infinitely mny both positive nd negtive terms left; the sum of positive terms is, the sum of negtive terms is. Let the sum of terms t the Nth step be denoted by S N, S N = N n=1 σ(n). At switch point, α S N is bounded by the size of the term dded: α S N 0, N All terms { n } will eventully be dded to the [ sum (σ : N N is surjective (onto)) t different steps (σ : N N is injective (1-1)). σ : {1, 2, 3,...} {n1, n 2, n 3,...} ].

10 Rel Anlysis nd Multivrible Clculus Igor Ynovsky, Root Test. Given n, put α = lim sup n n n. Then ) if α < 1, n converges; b) if α > 1, n diverges; c) if α = 1, the test gives no informtion. Rtio Test. The series n ) converges if lim sup n n+1 n < 1, b) diverges if n+1 n 1 for ll n n 0, where n 0 is some fixed integer. Alternting Series. Suppose () ; (b) 2m 1 0, 2m 0, m = 1, 2, 3,... ; (c) lim n n = 0. Then n converges. Geometric Series. x < 1 : k=0 x k = 1 1 x. P roof : S n = 1 + x + x x n xs n = x + x 2 + x x n+1 = (1 x)s n = 1 x n+1 S n = n x k = 1 xn+1 1 x k=0

11 Rel Anlysis nd Multivrible Clculus Igor Ynovsky, Problem (F 02, #4). By integrting the series prove tht x 2 = 1 x 2 + x 4 x 6 + x 8 π 4 = Justify crefully ll the steps (especilly tking the limit s x 1 from below). Proof. Geometric Series: x 2 = 1 x 2 + x 4 x 6 + x 8 ; x < 1. dx 1 + x 2 = tn 1 (x) = x x3 3 + x5 5 x7 7 + x9 9. dx 1 + x 2 = [tn 1 (x)] 1 0 = tn 1 1 tn 1 0 = π 4 0 = π ɛ 0 dx 1 ɛ 1 + x 2 = lim ɛ 0 0 dx 1 + x 2 = f n f 0 f(x)dx S(x) S N (x) = 1 ɛ 0 dx 1 + x 2 { S }} { [1 x 2 + x 4 ] } {{ } converges uniformly for x 1 ɛ dx = lim f n (x)dx f(x)dx f n (x)dx f(x) f n (x) dx S is uniform limit of S N = N ( 1) n x 2n. n=1 ( 1) n x 2n, x [0, 1 ɛ] x 2n N+1 N+1 1 ɛ 0 S N (x)dx f f n dx = (b ) f f n. (1 ɛ) 2n = N+1 Above clcultions show tn 1 x = ( 1) n x 2n+1, x < 1. 2n + 1 Alternting series test right side converges. π 4 = ( 1) n 2n + 1 = (1 ɛ)2(n+1) (1 ɛ) 2 0.

12 Rel Anlysis nd Multivrible Clculus Igor Ynovsky, Logrithm. x < 1 : log(1 + x) = x x = 1 x + x2 x 3 + = dt 1 + t = x x2 2 + x3 3 x4 ( 1) n x n n=0 4 + = n=1 n+1 xn ( 1) log(1 + x) is not vlid for x > 1, or x < 1. Clim: If x = 1, the series converges to log 2. Proof: n=1 ( 1)n 1 xn n is uniformly convergent for x [0, 1], since the sum of ny number of consecutive terms strting with the n th hs bsolute vlue t most, since for 0 < x < 1 we hve lternting series. x n n 1 n Binomil Series. x < 1 : ( (1 + x) α α(α 1) (α n + 1) = 1 + x n α = 1 + αx + n! 2 n=1 = 1 + αx + α(α 1) x 2 + 2! α(α 1)(α 2) x 3 + 3! Problem (F 03, #3). The sequence 1, 2,... with n = n. Proof. By Binomil Series Theorem with α = n, x = 1 n, we get: ( ) n = 1 + n 1 n(n 1) 1 n(n 1)(n 2) + + n n 2! n2 3! ! + 1 3! n! = n k=0 1 k! e, s n. n ) ( x 2 α + + n ( n) n converges s ) x n + 1 n(n 1)(n 2) n3 n! 1 n n

13 Rel Anlysis nd Multivrible Clculus Igor Ynovsky, Notes 4.1 Lest Upper Bound Property An ordered set S is sid to hve the lest upper bound 5 property if: E S, E is not empty, nd E is bounded bove, then sup E exists in S. Completeness xiom: If E is nonempty subset of R tht is bounded bove, then E hs lest upper bound. Problem (F 02, #2). Show why the Lest Upper Bound Property (every set bounded bove hs lest upper bound) implies the Cuchy Completeness Property (every Cuchy sequence hs limit) of the rel numbers. Proof. Suppose {x n } Cuchy. The problem is to show tht {x n } converges. We first show tht {x n } is bounded. Fix ɛ > 0 nd let N be such tht x n x m < ɛ if n, m > N. Then for ny fixed n > N, the entire sequence is contined in the closed bll of center x n nd rdius mx{d(x n, x 1 ), d(x n, x 2 ),..., d(x n, x N ), ɛ}. Thus {x n } is bounded. Define z n = sup{x k } k n. Since {x n } is bounded, ech z n is finite rel number nd is bounded bove in bsolute vlue by M. If m > n, then z m is obtined by tking the sup of smller set thn is z n ; hence {z n } is decresing. By the gretest lower bound property, Z = {z n n N} hs n infimum. Let x = inf Z. We clim tht x n x. 6 For ech ɛ > 0 there is corresponding integer N such tht x z N x+ɛ. Since {x n } is Cuchy, by tking lrger N if necessry, we know tht k N x k [x N ɛ, x N +ɛ]. It follows tht z N [x N ɛ, x N + ɛ]. Hence for k N, x k x x k x N + x N z N + z N x ɛ + ɛ + ɛ = 3ɛ. 5 lest upper bound of E sup E. 6 Ide: Since {x n} is Cuchy, the terms of this sequence would pproch one nother. {z n} lso pproches {x n }. Since z n x, {z n } pproches x. It follows tht {x n } pproches x.

14 Rel Anlysis nd Multivrible Clculus Igor Ynovsky, Completeness A metric spce X is complete if every Cuchy sequence of elements of X converges to n element of X. Lemm. A convergent sequence is Cuchy sequence. Proof. x n x mens ɛ > 0, N, such tht n N, x x n < ɛ. Hence x n x m x n x + x x m 2ɛ when n, m N. Thus, x n is Cuchy sequence. Lemm. If x n is Cuchy, then x n is bounded. Proof. If the sequence is x 1, x 2, x 3,..., ɛ > 0 nd N is such tht x n x m < ɛ if n, m > N, then for ny fixed m > N, the entire sequence is contined in the closed bll of center x m nd rdius mx{d(x m, x 1 ), d(x m, x 2 ),..., d(x m, x N ), ɛ}. Lemm. If x n is Cuchy nd x nk x, then x n x. Proof. Let ɛ > 0. Since x n is Cuchy choose k > 0 so lrge tht x n x m < ɛ whenever n, m k. Since x nk x choose l > 0 so lrge (i.e. n l lrge) tht x nj x < ɛ whenever j l. Set N = mx(k, n l ). If m, n j > N, then x m x x m x nj + x nj x < ɛ + ɛ = 2ɛ. Theorem. [, b] is complete. Proof. Let x n be Cuchy sequence in [, b]. Let x nk be monotone subsequence. Since x nk b, x nk converges (by the Lest Upper Bound). x nk c. Since [, b] is closed, c [, b]. Any x n tht is Cuchy in [, b], converges in [, b]. [, b] is complete. The bove theorem is specific cse of the following Lemm: Theorem. Let x n be Cuchy sequence in compct metric spce X. Then x n converges to some point of X. Proof. Since X is (sequentilly) compct, then for ny sequence x n X, there is subsequence x nk c, c X. Using the bove theorem (x n Cuchy nd x nk c x n c), we see tht x n c X. Theorem. R is complete. Proof. Let x n be Cuchy sequence in R. x n is bounded (by the Lemm bove). {x n } [, b], nd see bove. A direct consequence of the bove theorem is the following: In R k, every Cuchy sequence converges. Theorem. [0, 1) is not complete.

15 Rel Anlysis nd Multivrible Clculus Igor Ynovsky, Bolzno-Weierstrss. Every bounded, infinite subset S R hs limit point. Proof. If I 0 is closed intervl contining S, denote by I 1 one of the closed hlf-intervls of I 0 tht contins infinitely mny points of S. Continuing in this wy, we define nested sequence of intervls {I n }, ech of which contins infinitely mny points of S. If c = n=1 I n, then it is cler tht c is limit point of S. Lemm. Every bounded sequence of R hs convergent subsequence. Proof. If sequence x n contins only finitely mny distinct points, the conclusion is trivil nd obvious. Otherwise we re deling with bounded infinite set, to which the Bolzno-Weierstrss theorem pplies, giving us limit point x. If, for ech integer k 1, x nk is point of the sequence such tht x nk x 1/k, then it is cler tht is convergent subsequence. x nk Theorem. A closed subspce Y of complete metrix spce X is complete. Proof. Let y n be Cuchy sequence in Y. Then y n is lso Cuchy sequence in X. Since X is complete, x X such tht y n x in X. Since Y is closed, x Y. Consequently, y n x in Y. Theorem. A complete subspce Y of metric spce X is closed in X. Proof. Suppose x X is limit point of Y. y n in Y tht converges to x. y n is Cuchy sequence in X; hence it is lso Cuchy sequence in Y. Since Y is complete, y n y Y. Since limits of sequences re unique, y = x nd x belongs to Y. Hence Y is closed. Theorem. V is normed spce. If we hve the following impliction v n < n=1 v n <, n=1 then V is complete (V is Bnch spce). Proof. Sy v n is Cuchy. Choose n k such tht m, n n k v m v n < 2 k. We my ssume tht n 1 < n 2 <.... v nk+1 v nk < 2 k k=1 v n k+1 v nk <. It follows tht n=1 (v n k+1 v nk ) <. s s K = K (v nk+1 v nk ) = v nk+1 v n1 v nk+1 converges v n converges. k=1

16 Rel Anlysis nd Multivrible Clculus Igor Ynovsky, Compctness M is (sequentilly) compct if for ny sequence x n M, there is subsequence x nk c, c M. M is (topologiclly) compct if ny open cover of M, M G α, G α open, contins finite subcover. Problem (W 02, #2). [, b] is compct. Proof. Let x n be sequence in [, b]. Let x nk be monotone subsequence x nk b x nk c. Since [, b] is closed, c [, b]. [, b] is (sequentilly) compct. Lemm. If M is compct, every open cover of M hs countble subcover. Theorem. If M is sequentilly compct, then it is topologiclly compct. Proof. Sy tht M G 1 G2 hs countble subcover. Need to show tht there is finite subcover, i.e. M n k=1 G k for some n. Suppose tht fils for every n; then for every n = 1, 2,..., there would exist n x n M \ G k. k=1 Tht sequence would hve convergent subsequence {x nk }. Let x be its limit, x nk x. Then x would be contined in G m for some m, nd thus x nk G m for ll n k sufficiently lrge, which is impossible for n k > m (since x nk M\G 1 Gnk ). We hve reched contrdiction. So there must be finite subcovering. Problem (S 02, #3). If M is topologiclly compct, then it is sequentilly compct. Proof. Let x n M nd E be the rnge of {x n }. If E is finite, then there is x E nd sequence {n i }, with n 1 < n 2 <..., such tht x n1 = x n2 = = x The subsequence {x ni } converges to x. If E is infinite, E hs limit point x in M (s n infinite subset of compct set). Every neighborhood of x contins infinitely mny points of M. For ech k, B 1 (x) k contins infinitely mny x n s. Select one nd cll it x nk, such tht, n k > n k 1 >.... We hve subsequence {x nk } so tht d(x, x nk ) < 1 k 0. x n k x. Problem (F 02, #1). Let K be compct subset nd F be closed subset in the metric spce X. Suppose K F = φ. Prove tht 0 < inf{d(x, y) : x K, y F }. Proof. Given x K, x / F, d x = d(x, F ) > 0. Then, the bll centered t tht x with rdius d x /2, i.e. B dx 2 (x), stisfies B dx 2 (x) F = φ. Since x ws tken rbitrry, this is true x K, x / F. K x K B d x (x). Since K is compct, x 1,..., x n K, n <, such tht 2 K n k=1 B d x (x k ), nd B dx k (x k ) F = φ. Since min k {d xk } > 0, we hve < inf{d(x, y) : x K, y F }.

17 Rel Anlysis nd Multivrible Clculus Igor Ynovsky, Continuity Limits of Functions: lim x p f(x) = q if: ɛ > 0, δ such tht x E 0 < x p < δ f(x) q < ɛ. A function f is continuous t p: lim x p f(x) = f(p) if: ɛ > 0, δ such tht x E x p < δ f(x) f(p) < ɛ. Negtion: f is not continuous t p if: ɛ > 0, δ such tht x E x p < δ f(x) f(p) > ɛ. f is uniformly continuous on X if: ɛ > 0, δ such tht x, z X x z < δ f(x) f(z) < ɛ. Negtion: f is not uniformly continuous on X if: ɛ > 0, δ such tht x, z X x z < δ f(x) f(z) > ɛ. Exmples: f(x) = 1 x on (0, 1] nd f(x) = x2 on [1, ) re not uniformly continuous. Theorem. f : X Y is continuous f 1 (V ) is open in X for every open set V in Y. Proof. 7 Suppose f is continuous on X. Let V be n open set in Y. We hve to show tht every point of f 1 (V ) is n interior point of f 1 (V ). Let x f 1 (V ). Choose ɛ such tht B ɛ (f(x)) V. Since f is continuous 8, δ > 0 such tht f(b δ (x)) B ɛ (f(x)) V. Hence, B δ (x) f 1 (V ). Since f 1 (V ) contins n open bll bout ech of its points, f 1 (V ) is open. Suppose f 1 (V ) is open in X for every open set V in Y. Let x X nd let ɛ > 0. Then f 1 (B ɛ (f(x))) is open in X. Hence, δ such tht B δ (x) f 1 (B ɛ (f(x))). Applying f, we obtin f(b δ (x)) B ɛ (f(x)), nd so f is continuous. Problem (S 02, #4; S 03, #1). A function f : (0, 1) R is the restriction to (0, 1) of continuous function F : [0, 1] R f is uniformly continuous on (0, 1). Proof. We show tht if f : (0, 1) R is uniformly continuous, then there is continuous F : [0, 1] R with F (x) = f(x) for ll x (0, 1). Let x n be sequence in (0, 1) converging to 0. Since f is uniformly continuous, given ɛ > 0, δ, s.t. x y < δ f(x) f(y) < ɛ. Therefore, we hve f(x n ) f(x m ) < ɛ for n, m lrge enough. f(x n ) is Cuchy sequence, so it converges to some ξ. Define F (0) = lim n f(x n ) = ξ. We wnt to show tht this limit is well defined. Let y n be nother sequence, s.t. y n 0, so f(y n ) is Cuchy by the sme rgument. Since the sequence (f(x 1 ), f(y 1 ), f(x 2 ), f(y 2 ),...) is Cuchy by still the sme rgument, nd tht there is subsequence f(x n ) ξ, then the entire sequence converges to ξ. Thus, F (0) = lim n f(x n ) = ξ is well defined. By the sme set of rguments, F (1) = η. The function F : [0, 1] R given by f(x) for x (0, 1), F (x) = ξ for x = 0, η for x = 1. is the unique continuous extension of f to [0, 1]. F : [0, 1] R is continuous, nd [0, 1] is compct. Therefore, F is uniformly continuous on [0, 1]. Thus, f = F (0,1) : (0, 1) R is uniformly continuous. 7 Gmelin, Green, p. 26; Edwrds, p f continuous t x ɛ > 0, δ such tht z B δ (x) f(z) B ɛ (f(x)), or f(b δ (x)) B ɛ (f(x)).

18 Rel Anlysis nd Multivrible Clculus Igor Ynovsky, Continuity nd Compctness Theorem. Let f : X Y is continuous, where X is compct. Then f(x) is compct. Proof. 1) Let {V α } be n open cover of f(x), (V α Y ). Since f is continuous, f 1 (V α ) is open. Since X is compct, there re finitely mny α 1,..., α n, such tht X f 1 (V α1 )... f 1 (V αn ). Since f(f 1 (E)) E for every E Y, then f(x) V α1... Vαn. f(x) is compct. Proof. 2) Let {y n } be sequence in the imge of f. Thus we cn find x n X, such tht y n = f(x n ). Since X is compct the sequence {x n } hs convergent subsequence {x nk } with limit s X. Since f is continuous, lim y n k = lim f(x n k ) = f(s) k k Hence, the given sequence {y n } hs convergent subsequence which converges in f(x). f(x) is compct. Problem (F 01, #1). Let K R be compct nd f(x) continuous on K. Then f hs mximum on K (i.e. there exists x 0 K, such tht f(x) f(x 0 ) for ll x K). Proof. By theorem bove, the imge f(k) is closed nd bounded. Let b be its lest upper bound. Then b is dherent to f(k). Since f(k) is closed b f(k), tht is x 0 K, such tht b = f(x 0 ), nd thus f(x 0 ) f(x), x K. Theorem. Let f : [, b] R be continuous function. Then: 1) f is bounded; 2) f ssumes its mx nd min vlues; 3) f() < p < f(b) x : f(x) = p. Proof. 1) f is continuous f([, b]) is compct f([, b]) is closed nd bounded. 2) φ f([, b]) M. Let M 0 = sup f([, b]) M 0 closure(f([, b])) = f([, b]) x 0 [, b] : f(x 0 ) = M 0. 3) [, b] is connected f([, b]) is connected f([, b]) is n intervl. Theorem. f : X Y continuous nd X compct. Then f is uniformly continuous. Proof. 9 Suppose tht f is not uniformly continuous. Then there exist ɛ > 0 nd (setting δ = 1/k in the definition) points x k, z k X 10 such tht x k z k < 1/k while f(x k ) f(z k ) ɛ. Pssing to subsequence, we cn ssume tht x k x X. 11 Since x k z k 0, we lso obtin z k x. Since f is continuous, f(x k ) f(x) nd f(z k ) f(x), so tht f(x k ) f(z k ) f(x k ) f(x) + f(x) f(z k ) 0, contrdiction. 9 Gmelin, Green, p ; Rudin, p See the technique of negtion in the beginning of the section. 11 Since {x k } is Cuchy, nd the convergent subsequence cn be constructed, x k x.

19 Rel Anlysis nd Multivrible Clculus Igor Ynovsky, Sequences nd Series of Functions 8.1 Pointwise nd Uniform Convergence Suppose {f n }, n = 1, 2, 3,..., is sequence of functions defined on set E, nd suppose tht the sequence of numbers {f n (x)} converges x E. Define function f by f(x) = lim n f n(x), (x E). {f n } converges pointwise to f on E. A sequence of functions {f n } converges uniformly on E to f if ɛ > 0, N, such tht n N, f n (x) f(x) ɛ, x E. Exmple: Consider f(x) = x n on [0, 1] convergent, but not uniformly convergent on [0, 1]. Problem (F 01, #3). If {f n } is sequence of continuous functions on E, nd if f n f uniformly on E, then f is continuous on E. Proof. Fix ɛ > 0. Since f n f uniformly, choose N, s.t. n N f n (x) f(x) < ɛ 3, x E Since f n is continuous t p, choose δ, s.t. x E, x p < δ then f n (x) f n (p) < ɛ 3, n N Thus, f(x) f(p) f(x) f n (x) + f n (x) f n (p) + f n (p) f(p) < ɛ 3 + ɛ 3 + ɛ 3 = ɛ. Hence, given ny ɛ, δ, s.t. x p < δ f(x) f(p) < ɛ, nd f is continuous t p. 8.2 Normed Vector Spces Problem (F 03, #7). C 0 [, b] with the metric d(f, g) sup x [0,1] f(x) g(x) = f g is complete. Proof. Let {ϕ n } 1 be Cuchy sequence of elements of C 0 [, b]. Given ɛ > 0, choose N such tht m, n N ϕ m ϕ n < ɛ 2 (sup norm). Then, in prticulr, ϕ m (x) ϕ n (x) < ɛ/2 for ech x [, b]. Therefore {ϕ n (x)} 1 is Cuchy sequence of rel numbers, nd hence converges to some rel number ϕ(x). It remins to show tht the sequence of functions {ϕ n } converges uniformly to ϕ; if so, it will imply tht ϕ is continuous on [, b], i.e. ϕ C 0 [, b]. Clim: For n N, (N sme s bove, n fixed), ϕ(x) ϕ n (x) < ɛ for ll x [, b]. To see this, choose m N sufficiently lrge (depending on x) s.t. ϕ(x) ϕ m (x) < ɛ/2. ϕ(x) ϕ n (x) ϕ(x) ϕ m (x) + ϕ m (x) ϕ n (x) < ɛ/2+ ϕ m ϕ n < ɛ/2+ɛ/2 = ɛ. Since x [, b] ws rbitrry, it follows tht ϕ n ϕ < ɛ s desired.

20 Rel Anlysis nd Multivrible Clculus Igor Ynovsky, Theorem. Let {f n } C 1 [, b], f n f pointwise, f n g uniformly. Then f n f uniformly, nd f is differentible, with f = g. Proof. By the Fundmentl Theorem of Clculus, we hve f n (x) = f n () + x f n n, x [, b]. From this nd the Uniform Convergence nd Integrtion theorem, we obtin f(x) = lim f n(x) = lim f n() + lim n n f(x) = f() + x g. n Another ppliction of the Fundmentl Theorem yields f = g s desired. To see tht convergence of f n f is uniform, note tht x x x f n (x) f(x) = f n g + f n () f() f n g + f n () f() x f n, (b ) f n g + f n () f(). The uniform convergence of f n therefore follows from tht of f n. Theorem. C 1 [, b], with the C 1 -norm defined by ϕ = mx ϕ(x) + mx x [,b] x [,b] ϕ (x), is complete. Proof. Let {ϕ n } 1 be Cuchy sequence of elements of C1 [, b]. Since mx ϕ m(x) ϕ n (x) ϕ m ϕ n x [,b] (C 1 norm), ϕ n is uniformly Cuchy sequence of continuous functions. Thus ϕ n ϕ C 0 [, b] uniformly. Similrly, since mx x [,b] ϕ m(x) ϕ n(x) ϕ m ϕ n (C 1 norm), ϕ n ψ C 0 [, b] uniformly. By the bove theorem, ϕ is differentible with ϕ = ψ, so ϕ C 1 [, b]. Since mx ϕ n(x) ϕ(x) = ϕ n ϕ (sup norm), nd x [,b] mx x [,b] ϕ n(x) ϕ (x) = ϕ n ϕ (sup norm) the uniform convergence of ϕ n nd ϕ n implies tht ϕ n ϕ with respect to the C 1 -norm of C 1 [, b]. Thus every Cuchy sequence in C 1 [, b] converges.

21 Rel Anlysis nd Multivrible Clculus Igor Ynovsky, Equicontinuity A fmily F of functions f defined on set E X is equicontinuous on E if: ɛ > 0, δ, such tht x y < δ, x, y E, f F f(x) f(y) < ɛ Arzel-Ascoli Theorem Suppose {f n (x)} n=1 is uniformly bounded nd equicontinuous sequence of functions defined on compct subset K of X. Then {f n } is precompct, i.e. the closure of {f n } is compct, i.e. {f n } contins uniformly convergent subsequence, i.e. {f n } contins subsequence {f nk } tht converges uniformly on K to function f X. 9 Connectedness 9.1 Reltive Topology Define the neighborhood of point in R n s N ɛ (x) = {y : x y < ɛ}. Consider the subset of R n, M R n. If ll we re interested in re just points in M, it would be more nturl to define neighborhood of point x M s N M,ɛ = {y M : x y < ɛ}. Thus, the reltive neighborhood is just restriction of the neighborhood in R n to M. Reltive interior points nd reltive boundry points of set, s well s reltive open set nd reltive closed set, cn be defined ccordingly. Alterntive definitions: S M( R n ) is open reltive to M if there is n open set U in R n such tht S = U M. S M( R n ) is closed reltive to M if there is closed set V in R n such tht S = V M. Exmple: A set S = [1, 4) is open reltive to M = [1, 10] R since for the open set U = (0, 4) in R, we hve S = U M. Exmple: A set S = [1, 3] is open reltive to M = [1, 3] [4, 6] R since for the open set U = (0, 4) in R, we hve S = U M. 9.2 Connectedness X is connected if it cnnot be expressed s disjoint 12 union of two nonempty subsets tht re both open nd closed. i.e. M is connected if M = A B, such tht A, B open nd A B = φ, then A or B is empty; or, M is connected if M = A B, A, B open A = φ or B = φ. Fct: X is connected X nd φ re the only subsets which re clopen. X is disconnected if there re closed nd open subsets A nd B of X such tht A B = X, A B = φ, A φ, B φ. Another wy of phrsing: X is disconnected if there is closed nd open U X, such tht U φ nd U X. If there is such U, then the complement V = X \ U of U is lso both closed nd open nd X is the disjoint union of the nonempty sets U nd V. A subset of spce is connected subset if it is connected in the reltive topology. 12 A B = φ, then A nd B re disjoint.

22 Rel Anlysis nd Multivrible Clculus Igor Ynovsky, Problem (S 02, #1). The closed intervl [, b] is connected. Proof. Let [, b] = G H, s.t. G H = φ. Let b H. Then clim: G = φ. If not, let c = sup G. Since G is closed, c G. Since G is open 13, B ɛ (c) G, i.e. [c, c + ɛ) G. Tht contrdicts c = sup G. Thus G = φ. Note: Since [, b) nd (, b) cn be expressed s the union of n incresing sequence of compct intervls, these re lso connected. Theorem. Let S α M, S α connected. Suppose S α φ. Then S α is connected. Proof. Let S = S α = G H, G, H re open in S α. Choose x 0 S α. S α = (S α G) (Sα H). Assume x0 G. Since S α is connected nd x 0 S α G, we get Sα H = φ, α. Therefore, ( Sα ) H = φ. Since H S α H = φ. Therefore, S is connected. Corollry. R is connected. Proof. Let R = n N [ n, n], 0 [ n, n]. Therefore, R is the union of connected subsets. By the theorem bove, R is connected. Theorem. Let f : M N is continuous nd M is connected. Then f(m) is connected. Proof. Sy f(m) = G H, G, H φ. G, H open. Then M = f 1 (G) f 1 (H), where f 1 (G) nd f 1 (H) re both open nd nonempty. Contrdicts connectedness of M. Theorem., b I, nd < c < b, then c I, i.e. I is n intervl I R is connected. Proof. Assume I n intervl. S = [, b]; S = (, b], ; S = [, b), b ; S = (, b),, b. [, b) = n n 0 [, b 1 n ]. [, b 1 n ]. Sy I is not n intervl. < c < b,, b I, c / I. I = ((, c) I) ((c, ) I), i.e. I is not connected. Problem (W 02, #3). The open unit bll in R 2, {(x, y) R 2 : x 2 + y 2 < 1} is connected. Proof. Let f θ (t) = t(cos θ, sin θ), 1 < t < 1. We hve f θ : ( 1, 1) (t cos θ, t sin θ). Since f θ is continuous nd ( 1, 1) is connected, f θ (( 1, 1)) is connected. The unit bll cn be expressed s {(x, y) R 2 : x 2 + y 2 < 1} = 0 θ<π f θ(t). We know tht the origin is contined in the intersection of f θ s. Therefore, 0 θ<π f θ(t) is connected by the theorem bove. 13 If M = G H, G H = φ nd G, H re open, then G is closed nd open, since G = H c. M = [0, 1] [2, 3] is not connected becuse if G = [0, 1], H = [2, 3], M = G H, G, H re clopen in M, G H = φ, nd G, H φ.

23 Rel Anlysis nd Multivrible Clculus Igor Ynovsky, Pth Connectedness A pth in X from x 0 to x 1 is continuous function γ : [0, 1] X, such tht γ(0) = x 0 nd γ(1) = x 1. X is pth-connected if, for every pir of points x 0 nd x 1 in X, there is pth γ from x 0 to x 1. Theorem. A pth-connected spce is connected. Proof. Fix x 0 X. For ech x X, let γ x : [0, 1] X be pth from x 0 to x. By theorems bove, i.e. (1) X connected nd f : X Y continuous f(x) connected; (2) ny intervl in R is connected; ech γ x ([0, 1]) is connected subset of X. Ech γ x ([0, 1]) contins x 0 nd X = {γx ([0, 1]) : x X}, so tht the theorem bove shows tht X is connected. Theorem. An open subset of R n is connected it is pth-connected. Problem. Any subintervl of R (closed, open, or semiopen) is pth-connected. Proof. If, b belong to n intervl (of ny kind), then γ(t) = (1 t) + tb, 0 t 1, defines pth from to b in the intervl. Problem. If X is pth-connected nd f : X Y is mp, then f(x) is pthconnected. Proof. If p = f(x) nd q = f(y), nd γ is pth in X from p to q, then f γ is pth in f(x) from x to y.

24 Rel Anlysis nd Multivrible Clculus Igor Ynovsky, Bire Ctegory Theorem A subset T X is dense in X if T = X, i.e. every point of X is limit point of T, or point of T, or both. A subset Y X is nowhere dense if Y hs no interior points, i.e. int(y ) = φ. Y is nowhere dense X \ Y is dense open subset of X. The interior of E is the lrgest open set in E, i.e. the set of ll interior points of E. Q = R, (R \ Q) = R. [0, 1] Q is not closed; (0, 1) Q is not open in R. Bire s Ctegory Theorem. Let {U n } n=1 be sequence of dense open subsets of complete metric spce X. Then n=1 U n is lso dense in X. (Any countble intersection of dense open sets in complete metric spce is dense.) Corollry. Let {E n } n=1 be sequence of nowhere dense subsets of complete metric spce X. Then n=1 E n hs empty interior. (In complete metric spce, no nonempty open subset cn be expressed s union of countble collection of nowhere dense sets.) Proof. We pply the Bire Ctegory Theorem to the dense open sets U n = X \ E n. Then, n=1 U n is dense in X. U n = (X \ E n ) = X \ n=1 n=1 n=1 E n Therefore, X \ n=1 E n is dense, n=1 E n is nowhere dense n=1 E n hs empty interior. A subset of X is of the first ctegory (i.e. Q) if it is the countble union of nowhere dense subsets. A subset (i.e. I, R) tht is not of the first ctegory is sid to be of the second ctegory. S R is F σ set if S = n=1 F n, F n closed. S R is G δ set if S = n=1 G n, G n open. Problem (W 02, #4). The set of irrtionl numbers I in R is not the countble union of closed sets (not n F σ set). Proof. Suppose I = F n, where ech F n is closed. R = n N F n {q} q Q Thus R cn be expressed s the countble union of closed sets. By (corollry to) the Bire Ctegory Theorem, since R is nonempty open subset, one of these closed sets hs nonempty interior. It cnnot be one of q s, nd since ny nonempty intervl contins rtionl numbers, it cnnot be one of F n s. Contrdiction. Problem (S 02, #2; F 02, #3). The set Q of rtionl numbers is not the countble intersection of open sets of R (not G δ set). Show tht there is subset of R which is not the countble intersection of open subsets. Proof. We tke complements in the preceding theorem. ech G n open. Then, I = R \ Q = R \ ( n N G n ) = n N(R \ G n ), Suppose Q = G n, where nd R \ G n is closed. Thus, I is F σ set, which contrdicts the previous theorem.

25 Rel Anlysis nd Multivrible Clculus Igor Ynovsky, Problem (S 03, #3). Find S R such tht both (i) nd (ii) hold for S: (i) S is not the countble union of closed sets (not F σ ); (ii) S is not the countble intersection of open sets (not G δ ). Proof. Let A [0, 1] not F σ, B [2, 3] not G δ A B is neither F σ nor G δ. If A B is F σ, sy A B = F }{{} n closed A = A B [0, 1] = F n [0, 1] = (Fn [0, 1]) } {{ } closed F σ set contrdiction. If A B is G δ, sy A B = G n }{{} open B = A B ( 3 2, 7 2 ) = G n ( 3 2, 7 2 ) = (G n ( 3 2, 7 2 )) } {{ } open G δ set contrdiction. Problem. Q is not open, is not closed, but is the countble union of closed sets (F σ set). Proof. Since ny neighborhood (q ɛ, q + ɛ) of rtionl q contins irrtionls, Q hs no inner points. Q is not open. Since every irrtionl number i is the limit of sequence of rtionls Q is not closed. Since every one-point-set {x} R is closed nd Q is countble, sy (q n ) is sequence of ll rtionl numbers, we find tht Q = n N{q n } is the countble union of closed sets, i.e. Q is F σ. Problem. The set of isolted points of countble complete metric spce X forms dense subset of X. Proof. For ech point x X tht is not n isolted point of X, define U x = X \ {x}. Ech such U x is open nd dense in X, nd the intersection of the U x s consists precisely of the isolted points of X. By the Bire Ctegory Theorem, the intersection of the U x s is dense in X. Problem. Suppose tht F is subset of the first ctegory in metric spce X nd E is subset of F. Prove tht E is of the first ctegory in X. Show by n exmple tht E my not be of the first ctegory in the metric spce F. Proof. If F = F n, where ech F n is nowhere dense, then E = (E F n ), nd ech E F n is nowhere dense. For exmple, note the R is of first ctegory in R 2, but R is not of first ctegory in itself. Problem. Any countble union of sets of the first ctegory in X is gin of the first ctegory in X. Proof. A countble union of countble unions is countble union.

26 Rel Anlysis nd Multivrible Clculus Igor Ynovsky, Problem. ) If, b R stisfy < b, then there exists rtionl number q (, b). b) The set Q of rtionl numbers is dense in R. Problem. The set of irrtionl numbers is dense in R. Proof. If i is ny irrtionl number, nd if q is rtionl, then q + i/n is irrtionl, nd q + i/n q. Problem. Regrd the rtionl numbers Q s subspce of R. Does the metric spce Q hve ny isolted points? Proof. The rtionls hve no isolted points. This does not contrdict the bove, i.e. The set of isolted points of countble complete metric spce X forms dense subset of X becuse the rtionls re not complete. Problem. Every open subset of R is union of disjoint open intervls (finite, semiinfinite, or infinite). Proof. For ech x U, let I x be the union of ll open intervls contining x tht re contined in U. Show tht ech I x is n open intervl (possibly infinite or semi-infinite), ny two I x s either coincide or re disjoint, nd the union of the I x s is U. 11 Integrtion 11.1 Riemnn Integrl Let [, b] be given intervl. A prtition P of [, b] is finite set of points x 0,..., x n : = x 0 < x 1 <... < x n 1 < x n = b, x i = x i x i 1. A Riemnn sum for f correspoding to the given prtition is S(P, f) = n f(x i) x i, x i 1 x i x i. i=1 Definition: f is Riemnn integrble on [, b], if A R such tht: ɛ > 0, δ > 0 such tht whenever S is Riemnn sum for f corresponding to ny prtition of [, b] with mx( x i ) < δ S A < ɛ. In this cse A is clled the Riemnn integrl of f between nd b nd is denoted s f dx. Alterntive Definition: f is Riemnn integrble on [, b] if: ɛ > 0, P such tht U(P, f) L(P, f) < ɛ. If f is bounded, there exist m nd M, such tht m f(x) M, x b. Hence, for every P, m(b ) S(P, f) M(b ), so tht S(P, f) is bounded. bounded function f. This shows tht Riemnn sums re defined for every

27 Rel Anlysis nd Multivrible Clculus Igor Ynovsky, Existence of Riemnn Integrl Theorem. f is integrble on [, b] ɛ > 0, δ > 0 such tht S 1 (P, f), S 2 (P, f), P with mx( x i ) < δ, then S 1 S 2 < ɛ. Proof. Suppose f is integrble on [, b]. ɛ > 0, δ > 0 such tht S(P, f), P with mx( x i ) < δ, then S f(x)dx < ɛ/2. For such S 1 nd S 2, S 1 S 2 = ( S1 f(x)dx ) ( S 2 f(x)dx ) < ɛ 2 + ɛ 2 = ɛ. ɛ > 0, δ > 0 such tht S 1 (P, f), S 2 (P, F ), P with mx( x i ) < δ S 1 S 2 < ɛ. For n = 1, 2,..., choose S (n) (P, f), P with mx( x i ) < 1/n. Then, ɛ > 0, N > 0 (δ = 1/N), such tht S (n) S (m) < ɛ, n, m N S (n) is Cuchy sequence of rel numbers S (n) converges to some A R S (N) A < ɛ, 1/N < δ. Thus for ny S(P, f), P with mx( x i ) < δ, we hve S A S S (N) + S (N) A < 2ɛ. Theorem. If f is continuous on [, b] then f is integrble on [, b]. Proof. Since f is uniformly continuous on [, b], ɛ > 0, δ > 0 such tht x, z [, b], x z < δ f(x) f(z) < ɛ. If P is ny prtition of [, b] with mx( x i ) < δ, then implies tht M i m i ɛ, i = 1,..., n, nd therefore n n U(P, f) L(P, f) = (M i m i ) x i ɛ x i = ɛ(b ). i=1 Thus, ɛ > 0, P such tht U(P, f) L(P, f) < Cɛ f is integrble Fundmentl Theorem of Clculus Theorem. If f : [, b] R is continuous, nd F : [, b] R is defined by F (x) = x f(t)dt, then F is differentible nd F = f. Proof. Since f is continuous, F (x) = x f(t)dt is defined for ll x [, b]. We hve to show tht for ny fixed x 0 [, b] F (x) F (x 0 ) lim = f(x 0 ). x x 0 x x 0 For ny x [, b], x x 0, we hve F (x) F (x 0 ) x f(x 0 ) x x 0 = f(t)dt x0 f(t)dt x f(x 0 ) x x 0 = x 0 f(t)dt f(x 0 ) x x 0 x x x x = x 0 f(t)dt x 0 f(x 0 )dt x x 0 x x 0 = x 0 (f(t) f(x 0 ))dt x x 0 x 0 f(t) f(x 0 ) dt x x 0 Since f is continuous t x 0, given ɛ > 0, δ, such tht x [, b], x x 0 < δ f(x) f(x 0 ) < ɛ. Then for ny t between x nd x 0, we hve f(t) f(x 0 ) < ɛ. x x < 0 ɛ dt x x 0 = ɛ. Thus F (x 0 ) = f(x 0 ). i=1

28 Rel Anlysis nd Multivrible Clculus Igor Ynovsky, Corollry. If f : [, b] R is continuous nd F = f on [, b], then f(t)dt = F (b) F (). Proof. Since d dx ( x f(t)dt F (x)) = f(x) f(x) = 0, x f(t)dt F (x) is constnt. Thus x f(t)dt = F (x) + c, for some c R. In prticulr, 0 = f(t)dt = F () + c, so tht c = F (). Therefore, x f(t)dt = F (x) F (). Hence, f(t)dt = F (b) F (). Integrtion by Prts. Suppose f nd g re differentible functions on [, b], f, g R. Then f(x)g (x)dx = f(b)g(b) f()g() f (x)g(x)dx. Proof. Let h(x) = f(x)g(x) nd pply the Fundmentl Theorem of Clculus to h nd its derivtive. Note tht h R. h (x)dx = h(b) h() (f (x)g(x) + f(x)g (x))dx = f(b)g(b) f()g(). Men Vlue Theorem for Integrls. If f : [, b] R is continuous, then f(x)dx = f(c)(b ) for some c [, b]. Proof. Since f is continuous, by the Fundmentl Theorem of Clculus, there is function F : [, b] R such tht F (x) = f(x) for x (, b), nd f(x)dx = F (b) F (). By the Men Vlue Theorem for Differentition, c (, b) such tht F (b) F () = F (c)(b ). Thus, f(x)dx = }{{} F T C F (b) F () = }{{} MV T F (c)(b ) = Thus, c (, b) such tht f(x)dx = f(c)(b ). }{{} F T C f(c)(b ). Generlized Men Vlue Theorem for Integrls. If f, g : [, b] R re continuous nd g(x) > 0 for ll x [, b], then there exists c [, b] such tht f(x)g(x)dx = f(c) g(x)dx. Proof. Since g(x) > 0 for ll x [, b] nd since g is continuous, g(x) > 0. Suppose f(x) ttins its mximum M t x 2 nd minimum m t x 1. Then m = f(x 1 ) f(x) f(x 2 ) = M for x [, b], nd m nd hence m g(x)dx f(x)g(x)dx g(x)dx M. f(x)g(x)dx M g(x)dx, Since f is continuous on compct [, b], c such tht f(c) = f(x)g(x)dx g(x)dx.

29 Rel Anlysis nd Multivrible Clculus Igor Ynovsky, Uniform Convergence nd Integrtion. Let {f n } be sequence of continuous functions on [, b] nd f n f uniformly on [, b]. Then lim f n(x) dx = lim n n } {{ } f(x) f n (x)dx. Proof. Let f = lim n f n. Since ech f n is continuous nd f n f uniformly f is continuous. In prticulr, f is integrble on [, b]. By the definition of uniform convergence, ɛ > 0, N > 0 such tht n > N, f(x) f n (x) < ɛ/(b ), x [, b]. Thus, ɛ b f(x) f n(x) or ɛ (f(x) f n (x))dx ɛ f(x)dx ɛ, x [, b] b f n (x)dx ɛ. The lst inequlity holds for ll n > N, nd therefore, lim n f n(x)dx = f(x)dx. Uniform Convergence nd Differentition. Let {f n } be sequence of differentible functions on [, b] such tht {f n (x 0 )} converges for some x 0 [, b]. If f n f uniformly, then f n f uniformly on [, b], nd ( ) lim f n = lim n n f n Proof. See the section on Sequences nd Series of Functions: Normed Vector Spces where the weker sttement is proved, i.e. {f n } C 1, f n f pointwise on [, b].

30 Rel Anlysis nd Multivrible Clculus Igor Ynovsky, Differentition 12.1 R R The Derivtive of Rel Function Let f : (, b) R, x 0 (, b). f is differentible t x 0 if f (x 0 ) = lim x x 0 f(x) f(x 0 ) x x 0 exists. f is the derivtive of f. Theorem. f : (, b) R. f is differentible t x 0 f is continuous t x 0. Proof. f(x) f(x 0 ) lim (f(x) f(x 0 )) = lim lim (x x 0 ) = f (x 0 ) 0 = 0. x x 0 x x 0 x x 0 x x 0 Since lim x x0 f(x) = f(x 0 ), f is continuous t x 0. Lemm. If f (c) > 0, then f is loclly strictly incresing t c, i.e., δ > 0 such tht: c δ < x < c f(x) < f(c), c < x < c + δ f(c) < f(x). Proof. lim x c f(x) f(c) x c > 0 δ > 0: f(x) f(c) x c > 0 whenever 0 < x c < δ. Thus since f(x) f(c) = f(x) f(c) x c (x c), (x c), we hve c δ < x < c f(x) f(c) < 0, c < x < c + δ f(x) f(c) > 0. Corollry. If f hs mx (or min) t c (, b), i.e. f(x) f(c) (or f(x) f(c)) for ll x, then f (c) = 0. Proof. Sy f (c) 0. Sy f (c) > 0. Then x > c f(x) f(c) (since f hs mx t c), contrdicting the lemm bove. Proofs of other conditions re similr Rolle s Theorem Theorem. Let f be continuous on [, b], differentible on (, b), nd f() = f(b). Then c (, b) : f (c) = 0. Proof. Let M = sup{f(x) : x [, b]}, m = inf{f(x) : x [, b]}. Then m f() = f(b) M. If M = m f(x) = f(), x f (c) = 0, c (, b). Sy f() = f(b) < M. Then choose c [, b] : f(c) = M. From, c (, b). We hve from corollry, f (c) = 0. Similrly, sy m < f() = f(b). Then choose c [, b] : f(c) = m. From, c (, b). We hve from corollry, f (c) = Men Vlue Theorem Theorem. Let f be continuous on [, b], differentible on (, b). Then c (, b): f (c) = f(b) f(). b

31 Rel Anlysis nd Multivrible Clculus Igor Ynovsky, Proof. Let g(x) = f(x) f(b) f() b (x ). Then g() = g(b) = f(). By Rolle s Theorem, c (, b), such tht 0 = g (c) = f (c) f(b) f() b. Corollry. Let f be continuous on [, b], differentible on (, b). ) f (x) = 0, x (, b) f is constnt. b) f (x) > 0, x (, b) f is strictly incresing. Proof. b) x 1 < x 2 b. By men vlue theorem, f(x 2 ) f(x 1 ) = f (c)(x 2 x 1 ) for some c (x 1, x 2 ). Therefore, f(x 2 ) f(x 1 ) > 0 for ll such x 1, x 2. Proof of ) is similr R R m f : R R m is differentible t c R if there exists liner mp L : R R m such tht f(c + h) f(c) L(h) lim = 0. h 0 h f 1 (c) in which cse L is defined by L = df c = f (c) =. f m(c) The liner mpping df c : R R m is clled the differentil of f t c. The mtrix of the liner mpping f (c) is the derivtive. The differentil is the liner mpping whose mtrix is the derivtive R n R m Let U R n open, c U. f : U R m is differentible t c if there exists liner mp L : R n R m such tht f(c + h) f(c) L(h) lim = 0. h 0 h in which cse L is defined by L = df c = f (c) = f 1 f 1 x n x 1 f m x 1 f m x n Let v R n, c G R n. The directionl derivtive with respect to v of f t c is D v f(c) = lim t 0 f(c + tv) f(c) t provided tht the limit exists. In prticulr, the prtil derivtives of f t c re x=c. f f(c + te j ) f(c) f(c 1,..., c j + t,..., c n ) f(c 1,..., c j,..., c n ) (c) = D ej f(c) = lim = lim x j t 0 t t 0 t

32 Rel Anlysis nd Multivrible Clculus Igor Ynovsky, Theorem. Let f be differentible t c (i.e., df c : R n R m is defined). Then: ) 14 The directionl derivtive D v f(c) exists v R n, nd D v f(c) = df c (v) ( = f (c)v). b) 15 The mtrix f (c) of df c is df c = f (c) = [ f i x j (c)]. Proof. ) Since f is differentible, nd letting h = tv, f(c + tv) f(c) df c (tv) lim = 0, t 0 tv 1 [ v lim t 0 f(c + tv) f(c) t f(c + tv) f(c) lim = df c (v). t 0 t ] df c (v) = 0, i.e. D v f(c) exists, nd equls to df c (v). Proof. b) df c = df c (e 1 ) df c (e n ) = D e1 f(c) D en f(c) = f x 1 (c) [ ] fi x j (c). m n f : R n R m is sid to be continuously differentible t c if the prtil derivtives f i x j exist on B ɛ (c), nd re continuous t c. 14 Edwrds, Theorem Edwrds, Theorem 2.4 f x n (c) =

### 2005-06 Second Term MAT2060B 1. Supplementary Notes 3 Interchange of Differentiation and Integration

Source: http://www.mth.cuhk.edu.hk/~mt26/mt26b/notes/notes3.pdf 25-6 Second Term MAT26B 1 Supplementry Notes 3 Interchnge of Differentition nd Integrtion The theme of this course is bout vrious limiting

### Example A rectangular box without lid is to be made from a square cardboard of sides 18 cm by cutting equal squares from each corner and then folding

1 Exmple A rectngulr box without lid is to be mde from squre crdbord of sides 18 cm by cutting equl squres from ech corner nd then folding up the sides. 1 Exmple A rectngulr box without lid is to be mde

### MATH 150 HOMEWORK 4 SOLUTIONS

MATH 150 HOMEWORK 4 SOLUTIONS Section 1.8 Show tht the product of two of the numbers 65 1000 8 2001 + 3 177, 79 1212 9 2399 + 2 2001, nd 24 4493 5 8192 + 7 1777 is nonnegtive. Is your proof constructive

### MODULE 3. 0, y = 0 for all y

Topics: Inner products MOULE 3 The inner product of two vectors: The inner product of two vectors x, y V, denoted by x, y is (in generl) complex vlued function which hs the following four properties: i)

### 4.11 Inner Product Spaces

314 CHAPTER 4 Vector Spces 9. A mtrix of the form 0 0 b c 0 d 0 0 e 0 f g 0 h 0 cnnot be invertible. 10. A mtrix of the form bc d e f ghi such tht e bd = 0 cnnot be invertible. 4.11 Inner Product Spces

### Polynomial Functions. Polynomial functions in one variable can be written in expanded form as ( )

Polynomil Functions Polynomil functions in one vrible cn be written in expnded form s n n 1 n 2 2 f x = x + x + x + + x + x+ n n 1 n 2 2 1 0 Exmples of polynomils in expnded form re nd 3 8 7 4 = 5 4 +

### and thus, they are similar. If k = 3 then the Jordan form of both matrices is

Homework ssignment 11 Section 7. pp. 249-25 Exercise 1. Let N 1 nd N 2 be nilpotent mtrices over the field F. Prove tht N 1 nd N 2 re similr if nd only if they hve the sme miniml polynomil. Solution: If

### Factoring Polynomials

Fctoring Polynomils Some definitions (not necessrily ll for secondry school mthemtics): A polynomil is the sum of one or more terms, in which ech term consists of product of constnt nd one or more vribles

### 9 CONTINUOUS DISTRIBUTIONS

9 CONTINUOUS DISTIBUTIONS A rndom vrible whose vlue my fll nywhere in rnge of vlues is continuous rndom vrible nd will be ssocited with some continuous distribution. Continuous distributions re to discrete

### The Riemann Integral. Chapter 1

Chpter The Riemnn Integrl now of some universities in Englnd where the Lebesgue integrl is tught in the first yer of mthemtics degree insted of the Riemnn integrl, but now of no universities in Englnd

### Example 27.1 Draw a Venn diagram to show the relationship between counting numbers, whole numbers, integers, and rational numbers.

2 Rtionl Numbers Integers such s 5 were importnt when solving the eqution x+5 = 0. In similr wy, frctions re importnt for solving equtions like 2x = 1. Wht bout equtions like 2x + 1 = 0? Equtions of this

### Review guide for the final exam in Math 233

Review guide for the finl exm in Mth 33 1 Bsic mteril. This review includes the reminder of the mteril for mth 33. The finl exm will be cumultive exm with mny of the problems coming from the mteril covered

### 1. Prove that the empty set is a subset of every set.

1. Prove that the empty set is a subset of every set. Basic Topology Written by Men-Gen Tsai email: b89902089@ntu.edu.tw Proof: For any element x of the empty set, x is also an element of every set since

### LINEAR TRANSFORMATIONS AND THEIR REPRESENTING MATRICES

LINEAR TRANSFORMATIONS AND THEIR REPRESENTING MATRICES DAVID WEBB CONTENTS Liner trnsformtions 2 The representing mtrix of liner trnsformtion 3 3 An ppliction: reflections in the plne 6 4 The lgebr of

### Integration by Substitution

Integrtion by Substitution Dr. Philippe B. Lvl Kennesw Stte University August, 8 Abstrct This hndout contins mteril on very importnt integrtion method clled integrtion by substitution. Substitution is

### INTERCHANGING TWO LIMITS. Zoran Kadelburg and Milosav M. Marjanović

THE TEACHING OF MATHEMATICS 2005, Vol. VIII, 1, pp. 15 29 INTERCHANGING TWO LIMITS Zorn Kdelburg nd Milosv M. Mrjnović This pper is dedicted to the memory of our illustrious professor of nlysis Slobodn

### Binary Representation of Numbers Autar Kaw

Binry Representtion of Numbers Autr Kw After reding this chpter, you should be ble to: 1. convert bse- rel number to its binry representtion,. convert binry number to n equivlent bse- number. In everydy

### Lecture 5. Inner Product

Lecture 5 Inner Product Let us strt with the following problem. Given point P R nd line L R, how cn we find the point on the line closest to P? Answer: Drw line segment from P meeting the line in right

### 5.2. LINE INTEGRALS 265. Let us quickly review the kind of integrals we have studied so far before we introduce a new one.

5.2. LINE INTEGRALS 265 5.2 Line Integrls 5.2.1 Introduction Let us quickly review the kind of integrls we hve studied so fr before we introduce new one. 1. Definite integrl. Given continuous rel-vlued

### FUNCTIONS AND EQUATIONS. xεs. The simplest way to represent a set is by listing its members. We use the notation

FUNCTIONS AND EQUATIONS. SETS AND SUBSETS.. Definition of set. A set is ny collection of objects which re clled its elements. If x is n element of the set S, we sy tht x belongs to S nd write If y does

### CHAPTER 11 Numerical Differentiation and Integration

CHAPTER 11 Numericl Differentition nd Integrtion Differentition nd integrtion re bsic mthemticl opertions with wide rnge of pplictions in mny res of science. It is therefore importnt to hve good methods

### Metric Spaces Joseph Muscat 2003 (Last revised May 2009)

1 Distance J Muscat 1 Metric Spaces Joseph Muscat 2003 (Last revised May 2009) (A revised and expanded version of these notes are now published by Springer.) 1 Distance A metric space can be thought of

### RIGHT TRIANGLES AND THE PYTHAGOREAN TRIPLETS

RIGHT TRIANGLES AND THE PYTHAGOREAN TRIPLETS Known for over 500 yers is the fct tht the sum of the squres of the legs of right tringle equls the squre of the hypotenuse. Tht is +b c. A simple proof is

### Lecture 3 Gaussian Probability Distribution

Lecture 3 Gussin Probbility Distribution Introduction l Gussin probbility distribution is perhps the most used distribution in ll of science. u lso clled bell shped curve or norml distribution l Unlike

### AA1H Calculus Notes Math1115, Honours 1 1998. John Hutchinson

AA1H Clculus Notes Mth1115, Honours 1 1998 John Hutchinson Author ddress: Deprtment of Mthemtics, School of Mthemticl Sciences, Austrlin Ntionl University E-mil ddress: John.Hutchinson@nu.edu.u Contents

### 4 Approximations. 4.1 Background. D. Levy

D. Levy 4 Approximtions 4.1 Bckground In this chpter we re interested in pproximtion problems. Generlly speking, strting from function f(x) we would like to find different function g(x) tht belongs to

### Integration. 148 Chapter 7 Integration

48 Chpter 7 Integrtion 7 Integrtion t ech, by supposing tht during ech tenth of second the object is going t constnt speed Since the object initilly hs speed, we gin suppose it mintins this speed, but

### Graphs on Logarithmic and Semilogarithmic Paper

0CH_PHClter_TMSETE_ 3//00 :3 PM Pge Grphs on Logrithmic nd Semilogrithmic Pper OBJECTIVES When ou hve completed this chpter, ou should be ble to: Mke grphs on logrithmic nd semilogrithmic pper. Grph empiricl

### www.mathsbox.org.uk e.g. f(x) = x domain x 0 (cannot find the square root of negative values)

www.mthsbo.org.uk CORE SUMMARY NOTES Functions A function is rule which genertes ectl ONE OUTPUT for EVERY INPUT. To be defined full the function hs RULE tells ou how to clculte the output from the input

### How To Understand The Theory Of Inequlities

Ostrowski Type Inequlities nd Applictions in Numericl Integrtion Edited By: Sever S Drgomir nd Themistocles M Rssis SS Drgomir) School nd Communictions nd Informtics, Victori University of Technology,

### DIFFERENTIATING UNDER THE INTEGRAL SIGN

DIFFEENTIATING UNDE THE INTEGAL SIGN KEITH CONAD I hd lerned to do integrls by vrious methods shown in book tht my high school physics techer Mr. Bder hd given me. [It] showed how to differentite prmeters

### All pay auctions with certain and uncertain prizes a comment

CENTER FOR RESEARC IN ECONOMICS AND MANAGEMENT CREAM Publiction No. 1-2015 All py uctions with certin nd uncertin prizes comment Christin Riis All py uctions with certin nd uncertin prizes comment Christin

### 1 if 1 x 0 1 if 0 x 1

Chapter 3 Continuity In this chapter we begin by defining the fundamental notion of continuity for real valued functions of a single real variable. When trying to decide whether a given function is or

### QUADRATURE METHODS. July 19, 2011. Kenneth L. Judd. Hoover Institution

QUADRATURE METHODS Kenneth L. Judd Hoover Institution July 19, 2011 1 Integrtion Most integrls cnnot be evluted nlyticlly Integrls frequently rise in economics Expected utility Discounted utility nd profits

### x a x 2 (1 + x 2 ) n.

Limits and continuity Suppose that we have a function f : R R. Let a R. We say that f(x) tends to the limit l as x tends to a; lim f(x) = l ; x a if, given any real number ɛ > 0, there exists a real number

### PROF. BOYAN KOSTADINOV NEW YORK CITY COLLEGE OF TECHNOLOGY, CUNY

MAT 0630 INTERNET RESOURCES, REVIEW OF CONCEPTS AND COMMON MISTAKES PROF. BOYAN KOSTADINOV NEW YORK CITY COLLEGE OF TECHNOLOGY, CUNY Contents 1. ACT Compss Prctice Tests 1 2. Common Mistkes 2 3. Distributive

### Mathematics. Vectors. hsn.uk.net. Higher. Contents. Vectors 128 HSN23100

hsn.uk.net Higher Mthemtics UNIT 3 OUTCOME 1 Vectors Contents Vectors 18 1 Vectors nd Sclrs 18 Components 18 3 Mgnitude 130 4 Equl Vectors 131 5 Addition nd Subtrction of Vectors 13 6 Multipliction by

### Babylonian Method of Computing the Square Root: Justifications Based on Fuzzy Techniques and on Computational Complexity

Bbylonin Method of Computing the Squre Root: Justifictions Bsed on Fuzzy Techniques nd on Computtionl Complexity Olg Koshelev Deprtment of Mthemtics Eduction University of Texs t El Pso 500 W. University

### Harvard College. Math 21a: Multivariable Calculus Formula and Theorem Review

Hrvrd College Mth 21: Multivrible Clculus Formul nd Theorem Review Tommy McWillim, 13 tmcwillim@college.hrvrd.edu December 15, 2009 1 Contents Tble of Contents 4 9 Vectors nd the Geometry of Spce 5 9.1

### Lectures 8 and 9 1 Rectangular waveguides

1 Lectures 8 nd 9 1 Rectngulr wveguides y b x z Consider rectngulr wveguide with 0 < x b. There re two types of wves in hollow wveguide with only one conductor; Trnsverse electric wves

### Math 135 Circles and Completing the Square Examples

Mth 135 Circles nd Completing the Squre Exmples A perfect squre is number such tht = b 2 for some rel number b. Some exmples of perfect squres re 4 = 2 2, 16 = 4 2, 169 = 13 2. We wish to hve method for

### Physics 43 Homework Set 9 Chapter 40 Key

Physics 43 Homework Set 9 Chpter 4 Key. The wve function for n electron tht is confined to x nm is. Find the normliztion constnt. b. Wht is the probbility of finding the electron in. nm-wide region t x

### 19. The Fermat-Euler Prime Number Theorem

19. The Fermt-Euler Prime Number Theorem Every prime number of the form 4n 1 cn be written s sum of two squres in only one wy (side from the order of the summnds). This fmous theorem ws discovered bout

### Exam 1 Study Guide. Differentiation and Anti-differentiation Rules from Calculus I

Exm Stuy Guie Mth 2020 - Clculus II, Winter 204 The following is list of importnt concepts from ech section tht will be teste on exm. This is not complete list of the mteril tht you shoul know for the

### 9.3. The Scalar Product. Introduction. Prerequisites. Learning Outcomes

The Sclr Product 9.3 Introduction There re two kinds of multipliction involving vectors. The first is known s the sclr product or dot product. This is so-clled becuse when the sclr product of two vectors

### Experiment 6: Friction

Experiment 6: Friction In previous lbs we studied Newton s lws in n idel setting, tht is, one where friction nd ir resistnce were ignored. However, from our everydy experience with motion, we know tht

### 6.2 Volumes of Revolution: The Disk Method

mth ppliction: volumes of revolution, prt ii Volumes of Revolution: The Disk Method One of the simplest pplictions of integrtion (Theorem ) nd the ccumultion process is to determine so-clled volumes of

### PHY 140A: Solid State Physics. Solution to Homework #2

PHY 140A: Solid Stte Physics Solution to Homework # TA: Xun Ji 1 October 14, 006 1 Emil: jixun@physics.ucl.edu Problem #1 Prove tht the reciprocl lttice for the reciprocl lttice is the originl lttice.

### Metric Spaces. Chapter 7. 7.1. Metrics

Chapter 7 Metric Spaces A metric space is a set X that has a notion of the distance d(x, y) between every pair of points x, y X. The purpose of this chapter is to introduce metric spaces and give some

### Module Summary Sheets. C3, Methods for Advanced Mathematics (Version B reference to new book) Topic 2: Natural Logarithms and Exponentials

MEI Mthemtics in Ection nd Instry Topic : Proof MEI Structured Mthemtics Mole Summry Sheets C, Methods for Anced Mthemtics (Version B reference to new book) Topic : Nturl Logrithms nd Eponentils Topic

### 9 More on differentiation

Tel Aviv University, 2013 Measure and category 75 9 More on differentiation 9a Finite Taylor expansion............... 75 9b Continuous and nowhere differentiable..... 78 9c Differentiable and nowhere monotone......

### Euler Euler Everywhere Using the Euler-Lagrange Equation to Solve Calculus of Variation Problems

Euler Euler Everywhere Using the Euler-Lgrnge Eqution to Solve Clculus of Vrition Problems Jenine Smllwood Principles of Anlysis Professor Flschk My 12, 1998 1 1. Introduction Clculus of vritions is brnch

### SPECIAL PRODUCTS AND FACTORIZATION

MODULE - Specil Products nd Fctoriztion 4 SPECIAL PRODUCTS AND FACTORIZATION In n erlier lesson you hve lernt multipliction of lgebric epressions, prticulrly polynomils. In the study of lgebr, we come

### Karlstad University. Division for Engineering Science, Physics and Mathematics. Yury V. Shestopalov and Yury G. Smirnov. Integral Equations

Krlstd University Division for Engineering Science, Physics nd Mthemtics Yury V. Shestoplov nd Yury G. Smirnov Integrl Equtions A compendium Krlstd Contents 1 Prefce 4 Notion nd exmples of integrl equtions

### Section 5-4 Trigonometric Functions

5- Trigonometric Functions Section 5- Trigonometric Functions Definition of the Trigonometric Functions Clcultor Evlution of Trigonometric Functions Definition of the Trigonometric Functions Alternte Form

### Distributions. (corresponding to the cumulative distribution function for the discrete case).

Distributions Recll tht n integrble function f : R [,] such tht R f()d = is clled probbility density function (pdf). The distribution function for the pdf is given by F() = (corresponding to the cumultive

### M5A42 APPLIED STOCHASTIC PROCESSES PROBLEM SHEET 1 SOLUTIONS Term 1 2010-2011

M5A42 APPLIED STOCHASTIC PROCESSES PROBLEM SHEET 1 SOLUTIONS Term 1 21-211 1. Clculte the men, vrince nd chrcteristic function of the following probbility density functions. ) The exponentil distribution

### Mathematical Methods of Engineering Analysis

Mathematical Methods of Engineering Analysis Erhan Çinlar Robert J. Vanderbei February 2, 2000 Contents Sets and Functions 1 1 Sets................................... 1 Subsets.............................

### SOLUTIONS TO EXERCISES FOR. MATHEMATICS 205A Part 3. Spaces with special properties

SOLUTIONS TO EXERCISES FOR MATHEMATICS 205A Part 3 Fall 2008 III. Spaces with special properties III.1 : Compact spaces I Problems from Munkres, 26, pp. 170 172 3. Show that a finite union of compact subspaces

### The Fundamental Theorem of Calculus for Lebesgue Integral

Divulgciones Mtemátics Vol. 8 No. 1 (2000), pp. 75 85 The Fundmentl Theorem of Clculus for Lebesgue Integrl El Teorem Fundmentl del Cálculo pr l Integrl de Lebesgue Diómedes Bárcens (brcens@ciens.ul.ve)

### Introduction to Topology

Introduction to Topology Tomoo Matsumura November 30, 2010 Contents 1 Topological spaces 3 1.1 Basis of a Topology......................................... 3 1.2 Comparing Topologies.......................................

### Homework 3 Solutions

CS 341: Foundtions of Computer Science II Prof. Mrvin Nkym Homework 3 Solutions 1. Give NFAs with the specified numer of sttes recognizing ech of the following lnguges. In ll cses, the lphet is Σ = {,1}.

### g(y(a), y(b)) = o, B a y(a)+b b y(b)=c, Boundary Value Problems Lecture Notes to Accompany

Lecture Notes to Accompny Scientific Computing An Introductory Survey Second Edition by Michel T Heth Boundry Vlue Problems Side conditions prescribing solution or derivtive vlues t specified points required

### Review Problems for the Final of Math 121, Fall 2014

Review Problems for the Finl of Mth, Fll The following is collection of vrious types of smple problems covering sections.,.5, nd.7 6.6 of the text which constitute only prt of the common Mth Finl. Since

### Metric Spaces. Chapter 1

Chapter 1 Metric Spaces Many of the arguments you have seen in several variable calculus are almost identical to the corresponding arguments in one variable calculus, especially arguments concerning convergence

### AREA OF A SURFACE OF REVOLUTION

AREA OF A SURFACE OF REVOLUTION h cut r πr h A surfce of revolution is formed when curve is rotted bout line. Such surfce is the lterl boundr of solid of revolution of the tpe discussed in Sections 7.

### How fast can we sort? Sorting. Decision-tree model. Decision-tree for insertion sort Sort a 1, a 2, a 3. CS 3343 -- Spring 2009

CS 4 -- Spring 2009 Sorting Crol Wenk Slides courtesy of Chrles Leiserson with smll chnges by Crol Wenk CS 4 Anlysis of Algorithms 1 How fst cn we sort? All the sorting lgorithms we hve seen so fr re comprison

### Undergraduate Notes in Mathematics. Arkansas Tech University Department of Mathematics

Undergraduate Notes in Mathematics Arkansas Tech University Department of Mathematics An Introductory Single Variable Real Analysis: A Learning Approach through Problem Solving Marcel B. Finan c All Rights

### Novel Methods of Generating Self-Invertible Matrix for Hill Cipher Algorithm

Bibhudendr chry, Girij Snkr Rth, Srt Kumr Ptr, nd Sroj Kumr Pnigrhy Novel Methods of Generting Self-Invertible Mtrix for Hill Cipher lgorithm Bibhudendr chry Deprtment of Electronics & Communiction Engineering

### Metric Spaces. Lecture Notes and Exercises, Fall 2015. M.van den Berg

Metric Spaces Lecture Notes and Exercises, Fall 2015 M.van den Berg School of Mathematics University of Bristol BS8 1TW Bristol, UK mamvdb@bristol.ac.uk 1 Definition of a metric space. Let X be a set,

### 1. Find the zeros Find roots. Set function = 0, factor or use quadratic equation if quadratic, graph to find zeros on calculator

AP Clculus Finl Review Sheet When you see the words. This is wht you think of doing. Find the zeros Find roots. Set function =, fctor or use qudrtic eqution if qudrtic, grph to find zeros on clcultor.

### Reasoning to Solve Equations and Inequalities

Lesson4 Resoning to Solve Equtions nd Inequlities In erlier work in this unit, you modeled situtions with severl vriles nd equtions. For exmple, suppose you were given usiness plns for concert showing

### Operations with Polynomials

38 Chpter P Prerequisites P.4 Opertions with Polynomils Wht you should lern: Write polynomils in stndrd form nd identify the leding coefficients nd degrees of polynomils Add nd subtrct polynomils Multiply

### CURVES ANDRÉ NEVES. that is, the curve α has finite length. v = p q p q. a i.e., the curve of smallest length connecting p to q is a straight line.

CURVES ANDRÉ NEVES 1. Problems (1) (Ex 1 of 1.3 of Do Crmo) Show tht the tngent line to the curve α(t) (3t, 3t 2, 2t 3 ) mkes constnt ngle with the line z x, y. (2) (Ex 6 of 1.3 of Do Crmo) Let α(t) (e

### Radius of the Earth - Radii Used in Geodesy James R. Clynch February 2006

dius of the Erth - dii Used in Geodesy Jmes. Clynch Februry 006 I. Erth dii Uses There is only one rdius of sphere. The erth is pproximtely sphere nd therefore, for some cses, this pproximtion is dequte.

### Basic Analysis of Autarky and Free Trade Models

Bsic Anlysis of Autrky nd Free Trde Models AUTARKY Autrky condition in prticulr commodity mrket refers to sitution in which country does not engge in ny trde in tht commodity with other countries. Consequently

### Or more simply put, when adding or subtracting quantities, their uncertainties add.

Propgtion of Uncertint through Mthemticl Opertions Since the untit of interest in n eperiment is rrel otined mesuring tht untit directl, we must understnd how error propgtes when mthemticl opertions re

### n k=1 k=0 1/k! = e. Example 6.4. The series 1/k 2 converges in R. Indeed, if s n = n then k=1 1/k, then s 2n s n = 1 n + 1 +...

6 Series We call a normed space (X, ) a Banach space provided that every Cauchy sequence (x n ) in X converges. For example, R with the norm = is an example of Banach space. Now let (x n ) be a sequence

### MA651 Topology. Lecture 6. Separation Axioms.

MA651 Topology. Lecture 6. Separation Axioms. This text is based on the following books: Fundamental concepts of topology by Peter O Neil Elements of Mathematics: General Topology by Nicolas Bourbaki Counterexamples

### MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.436J/15.085J Fall 2008 Lecture 5 9/17/2008 RANDOM VARIABLES

MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.436J/15.085J Fall 2008 Lecture 5 9/17/2008 RANDOM VARIABLES Contents 1. Random variables and measurable functions 2. Cumulative distribution functions 3. Discrete

### Notes on metric spaces

Notes on metric spaces 1 Introduction The purpose of these notes is to quickly review some of the basic concepts from Real Analysis, Metric Spaces and some related results that will be used in this course.

### Online Multicommodity Routing with Time Windows

Konrd-Zuse-Zentrum für Informtionstechnik Berlin Tkustrße 7 D-14195 Berlin-Dhlem Germny TOBIAS HARKS 1 STEFAN HEINZ MARC E. PFETSCH TJARK VREDEVELD 2 Online Multicommodity Routing with Time Windows 1 Institute

### Applications to Physics and Engineering

Section 7.5 Applictions to Physics nd Engineering Applictions to Physics nd Engineering Work The term work is used in everydy lnguge to men the totl mount of effort required to perform tsk. In physics

### Unit 6: Exponents and Radicals

Eponents nd Rdicls -: The Rel Numer Sstem Unit : Eponents nd Rdicls Pure Mth 0 Notes Nturl Numers (N): - counting numers. {,,,,, } Whole Numers (W): - counting numers with 0. {0,,,,,, } Integers (I): -

### Use Geometry Expressions to create a more complex locus of points. Find evidence for equivalence using Geometry Expressions.

Lerning Objectives Loci nd Conics Lesson 3: The Ellipse Level: Preclculus Time required: 120 minutes In this lesson, students will generlize their knowledge of the circle to the ellipse. The prmetric nd

### The Fundamental Theorem of Calculus

Section 5.4 Te Funmentl Teorem of Clculus Kiryl Tsiscnk Te Funmentl Teorem of Clculus EXAMPLE: If f is function wose grp is sown below n g() = f(t)t, fin te vlues of g(), g(), g(), g(3), g(4), n g(5).

### Algebra Review. How well do you remember your algebra?

Algebr Review How well do you remember your lgebr? 1 The Order of Opertions Wht do we men when we write + 4? If we multiply we get 6 nd dding 4 gives 10. But, if we dd + 4 = 7 first, then multiply by then

### EQUATIONS OF LINES AND PLANES

EQUATIONS OF LINES AND PLANES MATH 195, SECTION 59 (VIPUL NAIK) Corresponding mteril in the ook: Section 12.5. Wht students should definitely get: Prmetric eqution of line given in point-direction nd twopoint

### CHAPTER II THE LIMIT OF A SEQUENCE OF NUMBERS DEFINITION OF THE NUMBER e.

CHAPTER II THE LIMIT OF A SEQUENCE OF NUMBERS DEFINITION OF THE NUMBER e. This chapter contains the beginnings of the most important, and probably the most subtle, notion in mathematical analysis, i.e.,

### PROBLEMS 13 - APPLICATIONS OF DERIVATIVES Page 1

PROBLEMS - APPLICATIONS OF DERIVATIVES Pge ( ) Wter seeps out of conicl filter t the constnt rte of 5 cc / sec. When the height of wter level in the cone is 5 cm, find the rte t which the height decreses.

### Treatment Spring Late Summer Fall 0.10 5.56 3.85 0.61 6.97 3.01 1.91 3.01 2.13 2.99 5.33 2.50 1.06 3.53 6.10 Mean = 1.33 Mean = 4.88 Mean = 3.

The nlysis of vrince (ANOVA) Although the t-test is one of the most commonly used sttisticl hypothesis tests, it hs limittions. The mjor limittion is tht the t-test cn be used to compre the mens of only

### 15.6. The mean value and the root-mean-square value of a function. Introduction. Prerequisites. Learning Outcomes. Learning Style

The men vlue nd the root-men-squre vlue of function 5.6 Introduction Currents nd voltges often vry with time nd engineers my wish to know the verge vlue of such current or voltge over some prticulr time

### 6 Energy Methods And The Energy of Waves MATH 22C

6 Energy Methods And The Energy of Wves MATH 22C. Conservtion of Energy We discuss the principle of conservtion of energy for ODE s, derive the energy ssocited with the hrmonic oscilltor, nd then use this

### Vectors 2. 1. Recap of vectors

Vectors 2. Recp of vectors Vectors re directed line segments - they cn be represented in component form or by direction nd mgnitude. We cn use trigonometry nd Pythgors theorem to switch between the forms

LECTURE COMPONENTS: COMBINED LOADING Third Edition A. J. Clrk School of Engineering Deprtment of Civil nd Environmentl Engineering 24 Chpter 8.4 by Dr. Ibrhim A. Asskkf SPRING 2003 ENES 220 Mechnics of

### Lower Bound for Envy-Free and Truthful Makespan Approximation on Related Machines

Lower Bound for Envy-Free nd Truthful Mespn Approximtion on Relted Mchines Lis Fleischer Zhenghui Wng July 14, 211 Abstrct We study problems of scheduling jobs on relted mchines so s to minimize the mespn

### . At first sight a! b seems an unwieldy formula but use of the following mnemonic will possibly help. a 1 a 2 a 3 a 1 a 2

7 CHAPTER THREE. Cross Product Given two vectors = (,, nd = (,, in R, the cross product of nd written! is defined to e: " = (!,!,! Note! clled cross is VECTOR (unlike which is sclr. Exmple (,, " (4,5,6

### Module 2. Analysis of Statically Indeterminate Structures by the Matrix Force Method. Version 2 CE IIT, Kharagpur

Module Anlysis of Stticlly Indeterminte Structures by the Mtrix Force Method Version CE IIT, Khrgpur esson 9 The Force Method of Anlysis: Bems (Continued) Version CE IIT, Khrgpur Instructionl Objectives