Convex Sets and Functions


 Stuart Boone
 1 years ago
 Views:
Transcription
1 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 segment connecting x nd y belongs to C Exmple B2 The convex subsets of R, +, ) re the intervls of R Regulr polygons re convex subsets of R 2 Definition B3 Let U be subset of rel liner spce L, +, ) A convex combintion of U is n element of L of the form 1 x k x k, where x 1,,x k U, i for 1 i k, nd k = 1 If the conditions i re dropped, we hve n ffine combintion of U In other words, x is n ffine combintion of U if there exist 1,, k R such tht x = 1 x k x k, for x 1,,x k U, nd k i = 1 Definition B4 Let U be subset of rel liner spce L, +, ) A subset {x 1,,x n } is ffinely dependent if = 1 x n x n such tht t lest one of the numbers 1,, n is nonzero nd i = If no such ffine combintion exists, then x 1,,x n re ffinely independent Theorem B5 The set U = {x 1,,x n } is ffinely independent if nd only if the set V = {x 1 x n,x n 1 x n } is linerly independent Proof Suppose tht U is ffinely independent but V is linerly dependent; tht is, = b 1 x 1 x n ) + + b n 1 x n 1 x n ) such tht not ll numbers b i re This implies b 1 x b n 1 x n 1 n 1 b i )x n =, which contrdicts the ffine independence of U
2 574 B Convex Sets nd Functions Conversely, suppose tht V is linerly independent but U is not ffinely independent In this cse, = 1 x n x n such tht t lest one of the numbers 1,, n is nonzero nd i = This implies n = 1 i, so = 1 x 1 x n ) + + n 1 x n 1 x n ) Observe tht t lest one of the numbers 1,, n 1 must be distinct from becuse otherwise we would hve 1 = = n 1 = n = This contrdicts the liner independence of V, so U is ffinely independent Exmple B6 Let x 1 nd x 2 be two elements of the liner spce R 2, +, ) The line tht psses through x 1 nd x 2 consists of ll x such tht x x 1 nd x x 2 re colliner; tht is, x x 1 ) + bx x 2 ) = for some, b R such tht + b Thus, we hve x = 1 x x 2, where = + b + b + b = 1, so x is n ffine combintion of x 1 nd x 2 It is esy to see tht the segment of line contined between x 1 nd x 2 is given by convex combintion of x 1 nd x 2 ; tht is, by n ffine combintion 1 x x 2 such tht 1, 2 Theorem B7 If C is convex subset of rel liner spce L, +, ), then C contins ll convex liner combintions of C Proof The proof is by induction on k 2 nd is left to the reder Theorem B8 The intersection of ny collection of convex sets of liner spce L, +, ) is convex set Proof Let C = {C i i I} be collection of convex sets nd let C = C Suppose tht x 1,,x k C, i for 1 i k, nd k = 1 Since x 1,,x k C i, it follows tht 1 x k x k C i for every i I Thus, 1 x k x k C, which proves the convexity of C Corollry B9 The fmily of convex sets of liner spce L, +, ) is closure system on PL) Proof This sttement follows immeditely from Theorem B8 by observing tht the set L is convex Corollry B9 llows us to define the convex hull of subset U of L s the closure K conv U) of U reltive to the closure system of the convex subsets of L If U R n consists of n+1 points such tht no point is n ffine combintion of the other n points, then K conv U) is n ndimensionl simplex in L Exmple B1 A twodimensionl simplex is defined strting from three points x 1,x 2,x 3 in R 2 such tht none of these points is n ffine combintion of
3 B Convex Sets nd Functions 575 the other two no point is colliner with the others two) Thus, the twodimensionl symplex generted by x 1,x 2,x 3 is the full tringle determined by x 1,x 2,x 3 In generl, n ndimensionl simplex is the convex hull of set of n + 1 points x 1,,x n+1 in R n such tht no point is n ffine combintion of the remining n points Let S be the ndimensionl simplex generted by the points x 1,,x n+1 in R n nd let x S If x S, then x is convex combintion of x 1,,x n,x n+1 In other words, there exist 1,, n, n+1 such tht 1,, n, n+1, 1), +1 i = 1, nd x = 1 x n x n + n+1 x n+1 The numbers 1,, n, n+1 re the bricentric coordintes of x reltive to the simplex S nd re uniquely determined by x Indeed, if we hve x = 1 x n x n + n+1 x n+1 = b 1 x b n x n + b n+1 x n+1, nd i b i for some i, this implies 1 b 1 )x n b n )x n + n+1 b n+1 )x n+1 =, which contrdicts the ffine independence of x 1,,x n+1 The next sttement plys centrl role in the study of convexity We reproduce the proof given in [59] Theorem B11 Crthéodory s Theorem) If U is subset of R n, then for every x K conv U) we hve x = +1 ix i, where x i U, i for 1 i n + 1, nd +1 i = 1 Proof Consider x K conv U) We cn write x = p+1 ix i, where x i U, i for 1 i p + 1, nd p+1 i = 1 Let p be the smllest number which llows this kind of expression for x We prove the theorem by showing tht p n Suppose tht p n+1 Then, the set {x 1,,x p+1 } is ffinely dependent, so there exist b 1,, b p+1 not ll zero such tht = p+1 b ix i nd p+1 b i = Without loss of generlity, we cn ssume b p+1 > nd p+1 b p+1 i b i for ll i such tht 1 i p nd b i > Define i c i = b i ) p+1 b i b p+1 for 1 i p We hve c i = i p+1 b p+1 b i = 1 Furthermore, c i for 1 i p Indeed, if b i, then c i i ; if b i >, then c i becuse p+1 b p+1 i b i for ll i such tht 1 i p nd b i > Thus, we hve
4 576 B Convex Sets nd Functions c i x i = i ) p b i x i = b p i x i = x, which contrdicts the choice of p A finite set of points P in R 2 is convex polygon if no member p of P lies in the convex hull of P {p} Theorem B12 A finite set of points P in R 2 is convex polygon if nd only if no member p of P lies in twodimensionl simplex formed by three other members of P Proof The rgument is strightforwrd nd is left to the reder s n exercise Theorem B13 Rdon s Theorem) Let P = {x i R n 1 i n + 2} be set of n + 2 points in R n Then, there re two disjoint subsets R nd Q of P such tht K conv R) K conv Q) Proof Since n+2 points in R n re ffinely dependent, there exist 1,, n+2 not ll equl to such tht n+2 i x i = B1) nd +2 i = Without loss of generlity, we cn ssume tht the first k numbers re positive nd the lst n + 2 k re not Let = k i > nd let b j = j for 1 j k Similrly, let c l = l for k + 1 l n + 2 Equlity B1) cn now be written s k b j x j = j=1 n+2 l=k+1 c l x l Since the numbers b j nd c l re nonnegtive nd k j=1 b j = +2 l=k+1 c l = 1, it follows tht K conv {x 1,,x k }) K conv {x k+1,,x n+2 }) Theorem B14 Klein s Theorem) If P R 2 is set of five points such tht no three of them re colliner, then P contins four points tht form convex qudrilterl Proof Let P = {x i 1 i } If these five points form convex polygon, then ny four of them form convex qudrilterl If exctly one point is in the interior of convex qudrilterl formed by the remining four points, then the desired conclusion is reched Suppose tht none of the previous cses occur Then, two of the points, sy x p,x q, re locted inside the tringle formed by the remining points x i,x j,x k Note tht the line x p x q intersects two sides of the tringle x i x j x k,
5 B Convex Sets nd Functions 577 x i x q x p x k x j Fig B1 A fivepoint configurtion in R 2 sy x i x j nd x i x k see Figure B1) Then x p x q x k x j is convex qudrilterl A function f : R R is convex if its grph on n intervl is locted below the chord determined by the endpoints of the intervl More formlly, we hve the following definition Definition B15 A function f : R R is convex if ftx + 1 t)y) tfx) + 1 t)fy) for every x, y Domf) nd t [, 1] The function g : R R is concve if g is convex Theorem B16 If f : R R is convex function nd < b c, then fb) f) b fc) f) c Proof Since < b c, we cn write b = t + 1 t)c, where t = c b c, 1] The convexity of f yields the inequlity fb) c b c f) + b c fc), which is esily seen to be equivlent with the desired inequlity A similr result follows Theorem B17 If f : R R is convex function nd b < c, then fc) f) c fc) fb) c b
6 578 B Convex Sets nd Functions Proof The rgument is similr to the proof of Theorem B16 Corollry B18 Let f : R R be convex function nd let p, q, p, q be four numbers such tht p p < q q We hve the inequlity fq) fp) q p fq ) fp ) q p B2) Proof By Theorem B16 pplied to the numbers p, q, q, we hve fq) fp ) q p fq ) fp ) q p Similrly, by pplying Theorem B17 to p, p, q, we obtin fq) fp) q p fq) fp ) q p The inequlity of the corollry cn be obtined by combining the lst two inequlities From Corollry B18, it follows tht if f : R R is convex nd differentible everywhere, then its derivtive is n incresing function The converse is lso true; nmely, if f is differentible everywhere nd its derivtive is n incresing function, then f is convex Indeed, let, b, c be three numbers such tht < b < c By the men vlue theorem, there is p, b) nd q b, c) such tht f p) = fb) f) b Since f p) f q), we obtin nd f q) = fc) fb) c b fb) f) b fc) fb), c b which implies fb) c b c f) + b c fc); tht is, the convexity of f Thus, if f is twice differentible everywhere nd its second derivtive is nonnegtive everywhere, then it follows tht f is convex Clerly, under the sme conditions of differentibility s bove, if the second derivtive is nonpositive everywhere, then f is concve The functions listed in the Tble B1, defined on the set R, provide exmples of convex or concve) functions Theorem B19 Jensen s Theorem) Let f be function tht is convex on n intervl I If t 1,,t n [, 1] re n numbers such tht t i = 1, then
7 B Convex Sets nd Functions 579 n ) f t i x i t i fx i ) for every x 1,, x n I Proof The rgument is by induction on n, where n 2 The bsis step, n = 2, follows immeditely from Definition B15 Suppose tht the sttement holds for n, nd let u 1,, u n, u n+1 be n + 1 numbers such tht +1 u i = 1 We hve fu 1 x u n 1 x n 1 + u n x n + u n+1 x n+1 ) = f u 1 x u n 1 x n 1 + u n + u n+1 ) u ) nx n + u n+1 x n+1 u n + u n+1 By the inductive hypothesis, we cn write fu 1 x u n 1 x n 1 + u n x n + u n+1 x n+1 ) ) un x n + u n+1 x n+1 u 1 fx 1 ) + + u n 1 fx n 1 ) + u n + u n+1 )f u n + u n+1 Next, by the convexity of f, we hve ) un x n + u n+1 x n+1 u n f fx n ) + u n+1 fx n+1 ) u n + u n+1 u n + u n+1 u n + u n+1 Combining this inequlity with the previous inequlity gives the desired conclusion Of course, if f is concve function nd t 1,,t n [, 1] re n numbers such tht t i = 1, then n ) f t i x i t i fx i ) B3) Tble B1 Exmples of convex or concve functions Function Second Convexity Derivtive Property x r for rr 1)x r 2 concve for r < 1 r > convex for r 1 ln x 1 x 2 concve xln x 1 x convex e x e x convex
8 58 B Convex Sets nd Functions Exmple B2 We sw tht the function fx) = ln x is concve Therefore, if t 1,, t n [, 1] re n numbers such tht t i = 1, then n ) ln t i x i t i lnx i This inequlity cn be written s n ) n ln t i x i ln x ti i, or equivlently n t i x i n x ti i, for x 1,,x n, ) In the specil cse where t 1 = = t n = 1 n, we hve the inequlity tht reltes the rithmetic to the geometric verge on n positive numbers: x x n n n x i ) 1 n B4) Let w = w 1,,w n ) R n be such tht w i = 1 For r, the wweighted men of order r of sequence of n positive numbers x = x 1,, x n ) R n > is the number n ) 1 r µ r w x) = w i x r i Of course, µ r w x) is not defined for r = ; we will give s specil definition µ wx) = lim r µ r wx) We hve lim r lnµr w x) = lim r = lim r n = = ln ln w ix r i r w ix r i lnx i w ix r i w i lnx i n x wi i
9 B Convex Sets nd Functions 581 Thus, if we define µ w x) = n xwi i, the weighted men of order r becomes function continuous everywhere with respect to r For w 1 = = w n = 1 n, we hve µ 1 nx 1 x n w x) = x 2 x n + + x 1 x n 1 the hrmonic verge of x), µ wx) = x 1 x n ) 1 n the geometric verge of x), µ 1 wx) = x x n n the rithmetic verge of x) Theorem B21 If p < r, we hve µ p wx) µ r wx) Proof There re three cses depending on the position of reltive to p nd r In the first cse, suppose tht r > p > The function fx) = x r p is convex, so by Jensen s inequlity pplied to x p 1,, xp n, we hve which implies ) r p w i x p i n w i x r i, ) 1 p w i x p i w i x r i ) 1 r, which is the inequlity of the theorem If r > > p, the function fx) = x r p is gin convex becuse f x) = r r p p )x 1 r p 2 Thus, the sme rgument works s in the previous cse Finlly, suppose tht > r > p Since < r p < 1, the function fx) = x r p is concve Thus, by Jensen s inequlity, ) r p w i x p i n w i x r i Since 1 r <, we obtin gin ) 1 p w i x p i w i x r i ) 1 r
10
11 C Useful Integrls nd Formuls C1 Euler s Integrls The integrls B, b) = Γ) = x 1 1 x) b 1 dx, x 1 e x dx, re known s Euler s integrl of the first type nd Euler s integrl of the second type, respectively We ssume here tht nd b re positive numbers to ensure tht the integrls re convergent Replcing x by 1 x yields the equlity B, b) = which shows tht B is symmetric Integrting B, b) by prts, we obtin B, b) = = 1 x 1 1 x) b 1 dx 1 x) b 1 d x 1 = x 1 x) 1 b) = b 1 = b 1 1 x) 1 x) b 1 dx = Bb, ), + b 1 x 1 x) b 2 dx x 1 1 x) b 2 dx b 1 b 1 B, b 1) B, b), x 1 1 x) b 1 dx
Best Approximation in the 2norm
Jim Lmbers MAT 77 Fll Semester 111 Lecture 1 Notes These notes correspond to Sections 9. nd 9.3 in the text. Best Approximtion in the norm Suppose tht we wish to obtin function f n (x) tht is liner combintion
More informationAdvanced Calculus: MATH 410 Notes on Integrals and Integrability Professor David Levermore 17 October 2004
Advnced Clculus: MATH 410 Notes on Integrls nd Integrbility Professor Dvid Levermore 17 October 2004 1. Definite Integrls In this section we revisit the definite integrl tht you were introduced to when
More informationTheoretical foundations of Gaussian quadrature
Theoreticl foundtions of Gussin qudrture 1 Inner product vector spce Definition 1. A vector spce (or liner spce) is set V = {u, v, w,...} in which the following two opertions re defined: (A) Addition of
More informationMAA 4212 Improper Integrals
Notes by Dvid Groisser, Copyright c 1995; revised 2002, 2009, 2014 MAA 4212 Improper Integrls The Riemnn integrl, while perfectly welldefined, is too restrictive for mny purposes; there re functions which
More informationMath Solutions to homework 1
Mth 75  Solutions to homework Cédric De Groote October 5, 07 Problem, prt : This problem explores the reltionship between norms nd inner products Let X be rel vector spce ) Suppose tht is norm on X tht
More informationUNIFORM CONVERGENCE. Contents 1. Uniform Convergence 1 2. Properties of uniform convergence 3
UNIFORM CONVERGENCE Contents 1. Uniform Convergence 1 2. Properties of uniform convergence 3 Suppose f n : Ω R or f n : Ω C is sequence of rel or complex functions, nd f n f s n in some sense. Furthermore,
More informationEuler, Ioachimescu and the trapezium rule. G.J.O. Jameson (Math. Gazette 96 (2012), )
Euler, Iochimescu nd the trpezium rule G.J.O. Jmeson (Mth. Gzette 96 (0), 36 4) The following results were estblished in recent Gzette rticle [, Theorems, 3, 4]. Given > 0 nd 0 < s
More informationTHE EXISTENCEUNIQUENESS THEOREM FOR FIRSTORDER DIFFERENTIAL EQUATIONS.
THE EXISTENCEUNIQUENESS THEOREM FOR FIRSTORDER DIFFERENTIAL EQUATIONS RADON ROSBOROUGH https://intuitiveexplntionscom/picrdlindeloftheorem/ This document is proof of the existenceuniqueness theorem
More informationLecture 3 ( ) (translated and slightly adapted from lecture notes by Martin Klazar)
Lecture 3 (5.3.2018) (trnslted nd slightly dpted from lecture notes by Mrtin Klzr) Riemnn integrl Now we define precisely the concept of the re, in prticulr, the re of figure U(, b, f) under the grph of
More informationMath 61CM  Solutions to homework 9
Mth 61CM  Solutions to homework 9 Cédric De Groote November 30 th, 2018 Problem 1: Recll tht the left limit of function f t point c is defined s follows: lim f(x) = l x c if for ny > 0 there exists δ
More informationMath 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 informationMORE FUNCTION GRAPHING; OPTIMIZATION. (Last edited October 28, 2013 at 11:09pm.)
MORE FUNCTION GRAPHING; OPTIMIZATION FRI, OCT 25, 203 (Lst edited October 28, 203 t :09pm.) Exercise. Let n be n rbitrry positive integer. Give n exmple of function with exctly n verticl symptotes. Give
More information8 Laplace s Method and Local Limit Theorems
8 Lplce s Method nd Locl Limit Theorems 8. Fourier Anlysis in Higher DImensions Most of the theorems of Fourier nlysis tht we hve proved hve nturl generliztions to higher dimensions, nd these cn be proved
More informationA BRIEF INTRODUCTION TO UNIFORM CONVERGENCE. In the study of Fourier series, several questions arise naturally, such as: c n e int
A BRIEF INTRODUCTION TO UNIFORM CONVERGENCE HANS RINGSTRÖM. Questions nd exmples In the study of Fourier series, severl questions rise nturlly, such s: () (2) re there conditions on c n, n Z, which ensure
More informationUnit #9 : Definite Integral Properties; Fundamental Theorem of Calculus
Unit #9 : Definite Integrl Properties; Fundmentl Theorem of Clculus Gols: Identify properties of definite integrls Define odd nd even functions, nd reltionship to integrl vlues Introduce the Fundmentl
More informationIntegration Techniques
Integrtion Techniques. Integrtion of Trigonometric Functions Exmple. Evlute cos x. Recll tht cos x = cos x. Hence, cos x Exmple. Evlute = ( + cos x) = (x + sin x) + C = x + 4 sin x + C. cos 3 x. Let u
More informationThe Regulated and Riemann Integrals
Chpter 1 The Regulted nd Riemnn Integrls 1.1 Introduction We will consider severl different pproches to defining the definite integrl f(x) dx of function f(x). These definitions will ll ssign the sme vlue
More informationSTUDY GUIDE FOR BASIC EXAM
STUDY GUIDE FOR BASIC EXAM BRYON ARAGAM This is prtil list of theorems tht frequently show up on the bsic exm. In mny cses, you my be sked to directly prove one of these theorems or these vrints. There
More informationW. We shall do so one by one, starting with I 1, and we shall do it greedily, trying
Vitli covers 1 Definition. A Vitli cover of set E R is set V of closed intervls with positive length so tht, for every δ > 0 nd every x E, there is some I V with λ(i ) < δ nd x I. 2 Lemm (Vitli covering)
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 informationLecture 3. Limits of Functions and Continuity
Lecture 3 Limits of Functions nd Continuity Audrey Terrs April 26, 21 1 Limits of Functions Notes I m skipping the lst section of Chpter 6 of Lng; the section bout open nd closed sets We cn probbly live
More informationLecture notes. Fundamental inequalities: techniques and applications
Lecture notes Fundmentl inequlities: techniques nd pplictions Mnh Hong Duong Mthemtics Institute, University of Wrwick Emil: m.h.duong@wrwick.c.uk Februry 8, 207 2 Abstrct Inequlities re ubiquitous in
More informationMATH1050 CauchySchwarz Inequality and Triangle Inequality
MATH050 CuchySchwrz Inequlity nd Tringle Inequlity 0 Refer to the Hndout Qudrtic polynomils Definition (Asolute extrem for relvlued functions of one rel vrile) Let I e n intervl, nd h : D R e relvlued
More informationg i fφdx dx = x i i=1 is a Hilbert space. We shall, henceforth, abuse notation and write g i f(x) = f
1. Appliction of functionl nlysis to PEs 1.1. Introduction. In this section we give little introduction to prtil differentil equtions. In prticulr we consider the problem u(x) = f(x) x, u(x) = x (1) where
More information(e) if x = y + z and a divides any two of the integers x, y, or z, then a divides the remaining integer
Divisibility In this note we introduce the notion of divisibility for two integers nd b then we discuss the division lgorithm. First we give forml definition nd note some properties of the division opertion.
More informationMath Advanced Calculus II
Mth 452  Advnced Clculus II Line Integrls nd Green s Theorem The min gol of this chpter is to prove Stoke s theorem, which is the multivrible version of the fundmentl theorem of clculus. We will be focused
More informationAdvanced Calculus: MATH 410 Uniform Convergence of Functions Professor David Levermore 11 December 2015
Advnced Clculus: MATH 410 Uniform Convergence of Functions Professor Dvid Levermore 11 December 2015 12. Sequences of Functions We now explore two notions of wht it mens for sequence of functions {f n
More informationIntegral points on the rational curve
Integrl points on the rtionl curve y x bx c x ;, b, c integers. Konstntine Zeltor Mthemtics University of Wisconsin  Mrinette 750 W. Byshore Street Mrinette, WI 5443453 Also: Konstntine Zeltor P.O. Box
More informationReview of Calculus, cont d
Jim Lmbers MAT 460 Fll Semester 200910 Lecture 3 Notes These notes correspond to Section 1.1 in the text. Review of Clculus, cont d Riemnn Sums nd the Definite Integrl There re mny cses in which some
More informationa n = 1 58 a n+1 1 = 57a n + 1 a n = 56(a n 1) 57 so 0 a n+1 1, and the required result is true, by induction.
MAS221(21617) Exm Solutions 1. (i) A is () bounded bove if there exists K R so tht K for ll A ; (b) it is bounded below if there exists L R so tht L for ll A. e.g. the set { n; n N} is bounded bove (by
More informationReview of Riemann Integral
1 Review of Riemnn Integrl In this chpter we review the definition of Riemnn integrl of bounded function f : [, b] R, nd point out its limittions so s to be convinced of the necessity of more generl integrl.
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 informationQuadratic Forms. Quadratic Forms
Qudrtic Forms Recll the Simon & Blume excerpt from n erlier lecture which sid tht the min tsk of clculus is to pproximte nonliner functions with liner functions. It s ctully more ccurte to sy tht we pproximte
More information7.2 Riemann Integrable Functions
7.2 Riemnn Integrble Functions Theorem 1. If f : [, b] R is step function, then f R[, b]. Theorem 2. If f : [, b] R is continuous on [, b], then f R[, b]. Theorem 3. If f : [, b] R is bounded nd continuous
More informationExam 2, Mathematics 4701, Section ETY6 6:05 pm 7:40 pm, March 31, 2016, IH1105 Instructor: Attila Máté 1
Exm, Mthemtics 471, Section ETY6 6:5 pm 7:4 pm, Mrch 1, 16, IH115 Instructor: Attil Máté 1 17 copies 1. ) Stte the usul sufficient condition for the fixedpoint itertion to converge when solving the eqution
More informationAbstract inner product spaces
WEEK 4 Abstrct inner product spces Definition An inner product spce is vector spce V over the rel field R equipped with rule for multiplying vectors, such tht the product of two vectors is sclr, nd the
More information5.4, 6.1, 6.2 Handout. As we ve discussed, the integral is in some way the opposite of taking a derivative. The exact relationship
5.4, 6.1, 6.2 Hnout As we ve iscusse, the integrl is in some wy the opposite of tking erivtive. The exct reltionship is given by the Funmentl Theorem of Clculus: The Funmentl Theorem of Clculus: If f is
More information1.3 The Lemma of DuBoisReymond
28 CHAPTER 1. INDIRECT METHODS 1.3 The Lemm of DuBoisReymond We needed extr regulrity to integrte by prts nd obtin the Euler Lgrnge eqution. The following result shows tht, t lest sometimes, the extr
More informationNote 16. Stokes theorem Differential Geometry, 2005
Note 16. Stokes theorem ifferentil Geometry, 2005 Stokes theorem is the centrl result in the theory of integrtion on mnifolds. It gives the reltion between exterior differentition (see Note 14) nd integrtion
More information1 The Riemann Integral
The Riemnn Integrl. An exmple leding to the notion of integrl (res) We know how to find (i.e. define) the re of rectngle (bse height), tringle ( (sum of res of tringles). But how do we find/define n re
More informationA REVIEW OF CALCULUS CONCEPTS FOR JDEP 384H. Thomas Shores Department of Mathematics University of Nebraska Spring 2007
A REVIEW OF CALCULUS CONCEPTS FOR JDEP 384H Thoms Shores Deprtment of Mthemtics University of Nebrsk Spring 2007 Contents Rtes of Chnge nd Derivtives 1 Dierentils 4 Are nd Integrls 5 Multivrite Clculus
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 informationn f(x i ) x. i=1 In section 4.2, we defined the definite integral of f from x = a to x = b as n f(x i ) x; f(x) dx = lim i=1
The Fundmentl Theorem of Clculus As we continue to study the re problem, let s think bck to wht we know bout computing res of regions enclosed by curves. If we wnt to find the re of the region below the
More informationf(x i ) x. i=1 In section 4.2, we defined the definite integral of f from x = a to x = b as f(x) dx = lim f(x i ) x; i=1
The Fundmentl Theorem of Clculus As we continue to study the re problem, let s think bck to wht we know bout computing res of regions enclosed by curves. If we wnt to find the re of the region below the
More informationLecture 14: Quadrature
Lecture 14: Qudrture This lecture is concerned with the evlution of integrls fx)dx 1) over finite intervl [, b] The integrnd fx) is ssumed to be relvlues nd smooth The pproximtion of n integrl by numericl
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 information4.4 Areas, Integrals and Antiderivatives
. res, integrls nd ntiderivtives 333. Ares, Integrls nd Antiderivtives This section explores properties of functions defined s res nd exmines some connections mong res, integrls nd ntiderivtives. In order
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 information1. GaussJacobi quadrature and Legendre polynomials. p(t)w(t)dt, p {p(x 0 ),...p(x n )} p(t)w(t)dt = w k p(x k ),
1. GussJcobi qudrture nd Legendre polynomils Simpson s rule for evluting n integrl f(t)dt gives the correct nswer with error of bout O(n 4 ) (with constnt tht depends on f, in prticulr, it depends on
More informationPhysics 116C Solution of inhomogeneous ordinary differential equations using Green s functions
Physics 6C Solution of inhomogeneous ordinry differentil equtions using Green s functions Peter Young November 5, 29 Homogeneous Equtions We hve studied, especilly in long HW problem, second order liner
More informationMath 360: A primitive integral and elementary functions
Mth 360: A primitive integrl nd elementry functions D. DeTurck University of Pennsylvni October 16, 2017 D. DeTurck Mth 360 001 2017C: Integrl/functions 1 / 32 Setup for the integrl prtitions Definition:
More informationDefinition of Continuity: The function f(x) is continuous at x = a if f(a) exists and lim
Mth 9 Course Summry/Study Guide Fll, 2005 [1] Limits Definition of Limit: We sy tht L is the limit of f(x) s x pproches if f(x) gets closer nd closer to L s x gets closer nd closer to. We write lim f(x)
More informationProperties of the Riemann Integral
Properties of the Riemnn Integrl Jmes K. Peterson Deprtment of Biologicl Sciences nd Deprtment of Mthemticl Sciences Clemson University Februry 15, 2018 Outline 1 Some Infimum nd Supremum Properties 2
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 informationPresentation Problems 5
Presenttion Problems 5 21355 A For these problems, ssume ll sets re subsets of R unless otherwise specified. 1. Let P nd Q be prtitions of [, b] such tht P Q. Then U(f, P ) U(f, Q) nd L(f, P ) L(f, Q).
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 informationIndefinite Integral. Chapter Integration  reverse of differentiation
Chpter Indefinite Integrl Most of the mthemticl opertions hve inverse opertions. The inverse opertion of differentition is clled integrtion. For exmple, describing process t the given moment knowing the
More information1 The fundamental theorems of calculus.
The fundmentl theorems of clculus. The fundmentl theorems of clculus. Evluting definite integrls. The indefinite integrl new nme for ntiderivtive. Differentiting integrls. Tody we provide the connection
More informationSOLUTIONS FOR ANALYSIS QUALIFYING EXAM, FALL (1 + µ(f n )) f(x) =. But we don t need the exact bound.) Set
SOLUTIONS FOR ANALYSIS QUALIFYING EXAM, FALL 28 Nottion: N {, 2, 3,...}. (Tht is, N.. Let (X, M be mesurble spce with σfinite positive mesure µ. Prove tht there is finite positive mesure ν on (X, M such
More informationHomework 11. Andrew Ma November 30, sin x (1+x) (1+x)
Homewor Andrew M November 3, 4 Problem 9 Clim: Pf: + + d = d = sin b +b + sin (+) d sin (+) d using integrtion by prts. By pplying + d = lim b sin b +b + sin (+) d. Since limits to both sides, lim b sin
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 informationFourier series. Preliminary material on inner products. Suppose V is vector space over C and (, )
Fourier series. Preliminry mteril on inner products. Suppose V is vector spce over C nd (, ) is Hermitin inner product on V. This mens, by definition, tht (, ) : V V C nd tht the following four conditions
More informationCalculus III Review Sheet
Clculus III Review Sheet 1 Definitions 1.1 Functions A function is f is incresing on n intervl if x y implies f(x) f(y), nd decresing if x y implies f(x) f(y). It is clled monotonic if it is either incresing
More informationMATH34032: Green s Functions, Integral Equations and the Calculus of Variations 1
MATH34032: Green s Functions, Integrl Equtions nd the Clculus of Vritions 1 Section 1 Function spces nd opertors Here we gives some brief detils nd definitions, prticulrly relting to opertors. For further
More informationSections 5.2: The Definite Integral
Sections 5.2: The Definite Integrl In this section we shll formlize the ides from the lst section to functions in generl. We strt with forml definition.. The Definite Integrl Definition.. Suppose f(x)
More informationpadic Egyptian Fractions
padic Egyptin Frctions Contents 1 Introduction 1 2 Trditionl Egyptin Frctions nd Greedy Algorithm 2 3 Setup 3 4 pgreedy Algorithm 5 5 pegyptin Trditionl 10 6 Conclusion 1 Introduction An Egyptin frction
More informationMA Handout 2: Notation and Background Concepts from Analysis
MA350059 Hndout 2: Nottion nd Bckground Concepts from Anlysis This hndout summrises some nottion we will use nd lso gives recp of some concepts from other units (MA20023: PDEs nd CM, MA20218: Anlysis 2A,
More informationFUNDAMENTALS OF REAL ANALYSIS by. III.1. Measurable functions. f 1 (
FUNDAMNTALS OF RAL ANALYSIS by Doğn Çömez III. MASURABL FUNCTIONS AND LBSGU INTGRAL III.. Mesurble functions Hving the Lebesgue mesure define, in this chpter, we will identify the collection of functions
More informationODE: Existence and Uniqueness of a Solution
Mth 22 Fll 213 Jerry Kzdn ODE: Existence nd Uniqueness of Solution The Fundmentl Theorem of Clculus tells us how to solve the ordinry differentil eqution (ODE) du = f(t) dt with initil condition u() =
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 informationChapter 3. Vector Spaces
3.4 Liner Trnsformtions 1 Chpter 3. Vector Spces 3.4 Liner Trnsformtions Note. We hve lredy studied liner trnsformtions from R n into R m. Now we look t liner trnsformtions from one generl vector spce
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 informationII. Integration and Cauchy s Theorem
MTH6111 Complex Anlysis 200910 Lecture Notes c Shun Bullett QMUL 2009 II. Integrtion nd Cuchy s Theorem 1. Pths nd integrtion Wrning Different uthors hve different definitions for terms like pth nd curve.
More informationf(x)dx . Show that there 1, 0 < x 1 does not exist a differentiable function g : [ 1, 1] R such that g (x) = f(x) for all
3 Definite Integrl 3.1 Introduction In school one comes cross the definition of the integrl of rel vlued function defined on closed nd bounded intervl [, b] between the limits nd b, i.e., f(x)dx s the
More information1 Functions Defined in Terms of Integrals
November 5, 8 MAT86 Week 3 Justin Ko Functions Defined in Terms of Integrls Integrls llow us to define new functions in terms of the bsic functions introduced in Week. Given continuous function f(), consider
More informationOverview of Calculus I
Overview of Clculus I Prof. Jim Swift Northern Arizon University There re three key concepts in clculus: The limit, the derivtive, nd the integrl. You need to understnd the definitions of these three things,
More information1 The fundamental theorems of calculus.
The fundmentl theorems of clculus. The fundmentl theorems of clculus. Evluting definite integrls. The indefinite integrl new nme for ntiderivtive. Differentiting integrls. Theorem Suppose f is continuous
More informationMath 6455 Oct 10, Differential Geometry I Fall 2006, Georgia Tech
Mth 6455 Oct 10, 2006 1 Differentil Geometry I Fll 2006, Georgi Tech Lecture Notes 12 Riemnnin Metrics 0.1 Definition If M is smooth mnifold then by Riemnnin metric g on M we men smooth ssignment of n
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 informationx 2 1 dx x 3 dx = ln(x) + 2e u du = 2e u + C = 2e x + C 2x dx = arcsin x + 1 x 1 x du = 2 u + C (t + 2) 50 dt x 2 4 dx
. Compute the following indefinite integrls: ) sin(5 + )d b) c) d e d d) + d Solutions: ) After substituting u 5 +, we get: sin(5 + )d sin(u)du cos(u) + C cos(5 + ) + C b) We hve: d d ln() + + C c) Substitute
More informationNumerical Integration
Chpter 5 Numericl Integrtion Numericl integrtion is the study of how the numericl vlue of n integrl cn be found. Methods of function pproximtion discussed in Chpter??, i.e., function pproximtion vi the
More informationRiemann is the Mann! (But Lebesgue may besgue to differ.)
Riemnn is the Mnn! (But Lebesgue my besgue to differ.) Leo Livshits My 2, 2008 1 For finite intervls in R We hve seen in clss tht every continuous function f : [, b] R hs the property tht for every ɛ >
More informationThe Fundamental Theorem of Calculus. The Total Change Theorem and the Area Under a Curve.
Clculus Li Vs The Fundmentl Theorem of Clculus. The Totl Chnge Theorem nd the Are Under Curve. Recll the following fct from Clculus course. If continuous function f(x) represents the rte of chnge of F
More informationSpace Curves. Recall the parametric equations of a curve in xyplane and compare them with parametric equations of a curve in space.
Clculus 3 Li Vs Spce Curves Recll the prmetric equtions of curve in xyplne nd compre them with prmetric equtions of curve in spce. Prmetric curve in plne x = x(t) y = y(t) Prmetric curve in spce x = x(t)
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 informationMath 1B, lecture 4: Error bounds for numerical methods
Mth B, lecture 4: Error bounds for numericl methods Nthn Pflueger 4 September 0 Introduction The five numericl methods descried in the previous lecture ll operte by the sme principle: they pproximte the
More informationMathematics 19A; Fall 2001; V. Ginzburg Practice Final Solutions
Mthemtics 9A; Fll 200; V Ginzburg Prctice Finl Solutions For ech of the ten questions below, stte whether the ssertion is true or flse ) Let fx) be continuous t x Then x fx) f) Answer: T b) Let f be differentible
More informationINTRODUCTION TO INTEGRATION
INTRODUCTION TO INTEGRATION 5.1 Ares nd Distnces Assume f(x) 0 on the intervl [, b]. Let A be the re under the grph of f(x). b We will obtin n pproximtion of A in the following three steps. STEP 1: Divide
More informationUS01CMTH02 UNIT Curvature
Stu mteril of BSc(Semester  I) US1CMTH (Rdius of Curvture nd Rectifiction) Prepred by Nilesh Y Ptel Hed,Mthemtics Deprtment,VPnd RPTPScience College US1CMTH UNIT 1 Curvture Let f : I R be sufficiently
More informationSome estimates on the HermiteHadamard inequality through quasiconvex functions
Annls of University of Criov, Mth. Comp. Sci. Ser. Volume 3, 7, Pges 8 87 ISSN: 13693 Some estimtes on the HermiteHdmrd inequlity through qusiconvex functions Dniel Alexndru Ion Abstrct. In this pper
More informationSturmLiouville Eigenvalue problem: Let p(x) > 0, q(x) 0, r(x) 0 in I = (a, b). Here we assume b > a. Let X C 2 1
Ch.4. INTEGRAL EQUATIONS AND GREEN S FUNCTIONS Ronld B Guenther nd John W Lee, Prtil Differentil Equtions of Mthemticl Physics nd Integrl Equtions. Hildebrnd, Methods of Applied Mthemtics, second edition
More informationpadic Egyptian Fractions
padic Egyptin Frctions Tony Mrtino My 7, 20 Theorem 9 negtiveorder Theorem 11 clss2 Contents 1 Introduction 1 2 Trditionl Egyptin Frctions nd Greedy Algorithm 2 3 Setup 3 4 pgreedy Algorithm 5 5 pegyptin
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 informationCalculus in R. Chapter Di erentiation
Chpter 3 Clculus in R 3.1 Di erentition Definition 3.1. Suppose U R is open. A function f : U! R is di erentible t x 2 U if there exists number m such tht lim y!0 pple f(x + y) f(x) my y =0. If f is di
More informationFrobenius numbers of generalized Fibonacci semigroups
Frobenius numbers of generlized Fiboncci semigroups Gretchen L. Mtthews 1 Deprtment of Mthemticl Sciences, Clemson University, Clemson, SC 296340975, USA gmtthe@clemson.edu Received:, Accepted:, Published:
More informationCalculus of Variations
Clculus of Vritions Com S 477/577 Notes) YnBin Ji Dec 4, 2017 1 Introduction A functionl ssigns rel number to ech function or curve) in some clss. One might sy tht functionl is function of nother function
More information7.2 The Definite Integral
7.2 The Definite Integrl the definite integrl In the previous section, it ws found tht if function f is continuous nd nonnegtive, then the re under the grph of f on [, b] is given by F (b) F (), where
More informationMath& 152 Section Integration by Parts
Mth& 5 Section 7.  Integrtion by Prts Integrtion by prts is rule tht trnsforms the integrl of the product of two functions into other (idelly simpler) integrls. Recll from Clculus I tht given two differentible
More information