DOCSLIB.ORG

Multivariable Calculus Review

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Multivariable Calculus Review Outline Multi-Variable Calculus Point-Set Topology Compactness The Weierstrass Extreme Value Theorem Operator and Matrix Norms Mean Value Theorem Multivariable Calculus Review Multivariable Calculus Review Outline Multi-Variable Calculus Point-Set Topology Compactness The Weierstrass Extreme Value Theorem Operator and Matrix Norms Mean Value Theorem Multi-Variable Calculus Point-Set Topology Compactness The Weierstrass Extreme Value Theorem Operator and Matrix Norms Mean Value Theorem Multivariable Calculus Review n I ν(x) ≥ 0 8 x 2 R with equality iff x = 0. n I ν(αx) = jαjν(x) 8 x 2 R α 2 R n I ν(x + y) ≤ ν(x) + ν(y) 8 x; y 2 R We usually denote ν(x) by kxk. Norms are convex functions. lp norms 1 Pn p p kxkp := ( i=1 jxi j ) ; 1 ≤ p < 1 kxk1 = maxi=1;:::;n jxi j Outline Multi-Variable Calculus Point-Set Topology Compactness The Weierstrass Extreme Value Theorem Operator and Matrix Norms Mean Value Theorem Multi-Variable Calculus Norms: n n A function ν : R ! R is a vector norm on R if Multivariable Calculus Review n I ν(αx) = jαjν(x) 8 x 2 R α 2 R n I ν(x + y) ≤ ν(x) + ν(y) 8 x; y 2 R We usually denote ν(x) by kxk. Norms are convex functions. lp norms 1 Pn p p kxkp := ( i=1 jxi j ) ; 1 ≤ p < 1 kxk1 = maxi=1;:::;n jxi j Outline Multi-Variable Calculus Point-Set Topology Compactness The Weierstrass Extreme Value Theorem Operator and Matrix Norms Mean Value Theorem Multi-Variable Calculus Norms: n n A function ν : R ! R is a vector norm on R if n I ν(x) ≥ 0 8 x 2 R with equality iff x = 0. Multivariable Calculus Review We usually denote ν(x) by kxk. Norms are convex functions. lp norms 1 Pn p p kxkp := ( i=1 jxi j ) ; 1 ≤ p < 1 kxk1 = maxi=1;:::;n jxi j Outline Multi-Variable Calculus Point-Set Topology Compactness The Weierstrass Extreme Value Theorem Operator and Matrix Norms Mean Value Theorem Multi-Variable Calculus Norms: n n A function ν : R ! R is a vector norm on R if n I ν(x) ≥ 0 8 x 2 R with equality iff x = 0. n I ν(αx) = jαjν(x) 8 x 2 R α 2 R n I ν(x + y) ≤ ν(x) + ν(y) 8 x; y 2 R Multivariable Calculus Review lp norms 1 Pn p p kxkp := ( i=1 jxi j ) ; 1 ≤ p < 1 kxk1 = maxi=1;:::;n jxi j Outline Multi-Variable Calculus Point-Set Topology Compactness The Weierstrass Extreme Value Theorem Operator and Matrix Norms Mean Value Theorem Multi-Variable Calculus Norms: n n A function ν : R ! R is a vector norm on R if n I ν(x) ≥ 0 8 x 2 R with equality iff x = 0. n I ν(αx) = jαjν(x) 8 x 2 R α 2 R n I ν(x + y) ≤ ν(x) + ν(y) 8 x; y 2 R We usually denote ν(x) by kxk. Norms are convex functions. Multivariable Calculus Review Outline Multi-Variable Calculus Point-Set Topology Compactness The Weierstrass Extreme Value Theorem Operator and Matrix Norms Mean Value Theorem Multi-Variable Calculus Norms: n n A function ν : R ! R is a vector norm on R if n I ν(x) ≥ 0 8 x 2 R with equality iff x = 0. n I ν(αx) = jαjν(x) 8 x 2 R α 2 R n I ν(x + y) ≤ ν(x) + ν(y) 8 x; y 2 R We usually denote ν(x) by kxk. Norms are convex functions. lp norms 1 Pn p p kxkp := ( i=1 jxi j ) ; 1 ≤ p < 1 kxk1 = maxi=1;:::;n jxi j Multivariable Calculus Review I D is open if for every x 2 D there exists > 0 such that x + B ⊂ D where x + B = fx + u : u 2 Bg n and B is the unit ball of some given norm on R . I D is closed if every point x satisfying (x + B) \ D 6= ; for all > 0, must be a point in D. I D is bounded if there exists β > 0 such that kxk ≤ β for all x 2 D: Outline Multi-Variable Calculus Point-Set Topology Compactness The Weierstrass Extreme Value Theorem Operator and Matrix Norms Mean Value Theorem Elementary Topological Properties of Sets n Let D ⊂ R . Multivariable Calculus Review I D is closed if every point x satisfying (x + B) \ D 6= ; for all > 0, must be a point in D. I D is bounded if there exists β > 0 such that kxk ≤ β for all x 2 D: Outline Multi-Variable Calculus Point-Set Topology Compactness The Weierstrass Extreme Value Theorem Operator and Matrix Norms Mean Value Theorem Elementary Topological Properties of Sets n Let D ⊂ R . I D is open if for every x 2 D there exists > 0 such that x + B ⊂ D where x + B = fx + u : u 2 Bg n and B is the unit ball of some given norm on R . Multivariable Calculus Review I D is bounded if there exists β > 0 such that kxk ≤ β for all x 2 D: Outline Multi-Variable Calculus Point-Set Topology Compactness The Weierstrass Extreme Value Theorem Operator and Matrix Norms Mean Value Theorem Elementary Topological Properties of Sets n Let D ⊂ R . I D is open if for every x 2 D there exists > 0 such that x + B ⊂ D where x + B = fx + u : u 2 Bg n and B is the unit ball of some given norm on R . I D is closed if every point x satisfying (x + B) \ D 6= ; for all > 0, must be a point in D. Multivariable Calculus Review Outline Multi-Variable Calculus Point-Set Topology Compactness The Weierstrass Extreme Value Theorem Operator and Matrix Norms Mean Value Theorem Elementary Topological Properties of Sets n Let D ⊂ R . I D is open if for every x 2 D there exists > 0 such that x + B ⊂ D where x + B = fx + u : u 2 Bg n and B is the unit ball of some given norm on R . I D is closed if every point x satisfying (x + B) \ D 6= ; for all > 0, must be a point in D. I D is bounded if there exists β > 0 such that kxk ≤ β for all x 2 D: Multivariable Calculus Review I x 2 D is said to be a cluster point of D if (x + B) \ D 6= ; for every > 0. I D is compact if it is closed and bounded. Theorem: [Weierstrass Compactness Theorem] n A set D ⊂ R is compact if and only if every infinite subset of D has a cluster point and all such cluster points lie in D. Outline Multi-Variable Calculus Point-Set Topology Compactness The Weierstrass Extreme Value Theorem Operator and Matrix Norms Mean Value Theorem Elementary Topological Properties of Sets: Compactness n Let D ⊂ R . Multivariable Calculus Review I D is compact if it is closed and bounded. Theorem: [Weierstrass Compactness Theorem] n A set D ⊂ R is compact if and only if every infinite subset of D has a cluster point and all such cluster points lie in D. Outline Multi-Variable Calculus Point-Set Topology Compactness The Weierstrass Extreme Value Theorem Operator and Matrix Norms Mean Value Theorem Elementary Topological Properties of Sets: Compactness n Let D ⊂ R . I x 2 D is said to be a cluster point of D if (x + B) \ D 6= ; for every > 0. Multivariable Calculus Review Theorem: [Weierstrass Compactness Theorem] n A set D ⊂ R is compact if and only if every infinite subset of D has a cluster point and all such cluster points lie in D. Outline Multi-Variable Calculus Point-Set Topology Compactness The Weierstrass Extreme Value Theorem Operator and Matrix Norms Mean Value Theorem Elementary Topological Properties of Sets: Compactness n Let D ⊂ R . I x 2 D is said to be a cluster point of D if (x + B) \ D 6= ; for every > 0. I D is compact if it is closed and bounded. Multivariable Calculus Review Outline Multi-Variable Calculus Point-Set Topology Compactness The Weierstrass Extreme Value Theorem Operator and Matrix Norms Mean Value Theorem Elementary Topological Properties of Sets: Compactness n Let D ⊂ R . I x 2 D is said to be a cluster point of D if (x + B) \ D 6= ; for every > 0. I D is compact if it is closed and bounded. Theorem: [Weierstrass Compactness Theorem] n A set D ⊂ R is compact if and only if every infinite subset of D has a cluster point and all such cluster points lie in D. Multivariable Calculus Review n F is continuous on a set D ⊂ R if F is continuous at every point of D. Theorem: [Weierstrass Extreme Value Theorem] Every continuous function on a compact set attains its extreme values on that set. Outline Multi-Variable Calculus Point-Set Topology Compactness The Weierstrass Extreme Value Theorem Operator and Matrix Norms Mean Value Theorem Continuity and The Weierstrass Extreme Value Theorem n m The mapping F : R ! R is continuous at the point x if lim kF (x) − F (x)k = 0: kx−xk!0 Multivariable Calculus Review Theorem: [Weierstrass Extreme Value Theorem] Every continuous function on a compact set attains its extreme values on that set. Outline Multi-Variable Calculus Point-Set Topology Compactness The Weierstrass Extreme Value Theorem Operator and Matrix Norms Mean Value Theorem Continuity and The Weierstrass Extreme Value Theorem n m The mapping F : R ! R is continuous at the point x if lim kF (x) − F (x)k = 0: kx−xk!0 n F is continuous on a set D ⊂ R if F is continuous at every point of D.
Load more

Recommended publications
  • The Directional Derivative the Derivative of a Real Valued Function (Scalar field) with Respect to a Vector
    Math 253 The Directional Derivative The derivative of a real valued function (scalar field) with respect to a vector. f(x + h) f(x) What is the vector space analog to the usual derivative in one variable? f 0(x) = lim − ? h 0 h ! x -2 0 2 5 Suppose f is a real valued function (a mapping f : Rn R). ! (e.g. f(x; y) = x2 y2). − 0 Unlike the case with plane figures, functions grow in a variety of z ways at each point on a surface (or n{dimensional structure). We'll be interested in examining the way (f) changes as we move -5 from a point X~ to a nearby point in a particular direction. -2 0 y 2 Figure 1: f(x; y) = x2 y2 − The Directional Derivative x -2 0 2 5 We'll be interested in examining the way (f) changes as we move ~ in a particular direction 0 from a point X to a nearby point . z -5 -2 0 y 2 Figure 2: f(x; y) = x2 y2 − y If we give the direction by using a second vector, say ~u, then for →u X→ + h any real number h, the vector X~ + h~u represents a change in X→ position from X~ along a line through X~ parallel to ~u. →u →u h x Figure 3: Change in position along line parallel to ~u The Directional Derivative x -2 0 2 5 We'll be interested in examining the way (f) changes as we move ~ in a particular direction 0 from a point X to a nearby point .
    [Show full text]
  • Lecture 11 Line Integrals of Vector-Valued Functions (Cont'd)
    Lecture 11 Line integrals of vector-valued functions (cont’d) In the previous lecture, we considered the following physical situation: A force, F(x), which is not necessarily constant in space, is acting on a mass m, as the mass moves along a curve C from point P to point Q as shown in the diagram below. z Q P m F(x(t)) x(t) C y x The goal is to compute the total amount of work W done by the force. Clearly the constant force/straight line displacement formula, W = F · d , (1) where F is force and d is the displacement vector, does not apply here. But the fundamental idea, in the “Spirit of Calculus,” is to break up the motion into tiny pieces over which we can use Eq. (1 as an approximation over small pieces of the curve. We then “sum up,” i.e., integrate, over all contributions to obtain W . The total work is the line integral of the vector field F over the curve C: W = F · dx . (2) ZC Here, we summarize the main steps involved in the computation of this line integral: 1. Step 1: Parametrize the curve C We assume that the curve C can be parametrized, i.e., x(t)= g(t) = (x(t),y(t), z(t)), t ∈ [a, b], (3) so that g(a) is point P and g(b) is point Q. From this parametrization we can compute the velocity vector, ′ ′ ′ ′ v(t)= g (t) = (x (t),y (t), z (t)) . (4) 1 2. Step 2: Compute field vector F(g(t)) over curve C F(g(t)) = F(x(t),y(t), z(t)) (5) = (F1(x(t),y(t), z(t), F2(x(t),y(t), z(t), F3(x(t),y(t), z(t))) , t ∈ [a, b] .
    [Show full text]
  • Cauchy Integral Theorem
    Cauchy’s Theorems I Ang M.S. Augustin-Louis Cauchy October 26, 2012 1789 – 1857 References Murray R. Spiegel Complex V ariables with introduction to conformal mapping and its applications Dennis G. Zill , P. D. Shanahan A F irst Course in Complex Analysis with Applications J. H. Mathews , R. W. Howell Complex Analysis F or Mathematics and Engineerng 1 Summary • Cauchy Integral Theorem Let f be analytic in a simply connected domain D. If C is a simple closed contour that lies in D , and there is no singular point inside the contour, then ˆ f (z) dz = 0 C • Cauchy Integral Formula (For simple pole) If there is a singular point z0 inside the contour, then ˛ f(z) dz = 2πj f(z0) z − z0 • Generalized Cauchy Integral Formula (For pole with any order) ˛ f(z) 2πj (n−1) n dz = f (z0) (z − z0) (n − 1)! • Cauchy Inequality M · n! f (n)(z ) ≤ 0 rn • Gauss Mean Value Theorem ˆ 2π ( ) 1 jθ f(z0) = f z0 + re dθ 2π 0 1 2 Related Mathematics Review 2.1 Stoke’s Theorem ¨ ˛ r × F¯ · dS = F¯ · dr Σ @Σ (The proof is skipped) ¯ Consider F = (FX ;FY ;FZ ) 0 1 x^ y^ z^ B @ @ @ C r × F¯ = det B C @ @x @y @z A FX FY FZ Let FZ = 0 0 1 x^ y^ z^ B @ @ @ C r × F¯ = det B C @ @x @y @z A FX FY 0 dS =ndS ^ , for dS = dxdy , n^ =z ^ . By z^ · z^ = 1 , consider z^ component only for r × F¯ 0 1 x^ y^ z^ ( ) B @ @ @ C @F @F r × F¯ = det B C = Y − X z^ @ @x @y @z A @x @y FX FY 0 i.e.
    [Show full text]
  • Notes on Partial Differential Equations John K. Hunter
    Notes on Partial Differential Equations John K. Hunter Department of Mathematics, University of California at Davis Contents Chapter 1. Preliminaries 1 1.1. Euclidean space 1 1.2. Spaces of continuous functions 1 1.3. H¨olderspaces 2 1.4. Lp spaces 3 1.5. Compactness 6 1.6. Averages 7 1.7. Convolutions 7 1.8. Derivatives and multi-index notation 8 1.9. Mollifiers 10 1.10. Boundaries of open sets 12 1.11. Change of variables 16 1.12. Divergence theorem 16 Chapter 2. Laplace's equation 19 2.1. Mean value theorem 20 2.2. Derivative estimates and analyticity 23 2.3. Maximum principle 26 2.4. Harnack's inequality 31 2.5. Green's identities 32 2.6. Fundamental solution 33 2.7. The Newtonian potential 34 2.8. Singular integral operators 43 Chapter 3. Sobolev spaces 47 3.1. Weak derivatives 47 3.2. Examples 47 3.3. Distributions 50 3.4. Properties of weak derivatives 53 3.5. Sobolev spaces 56 3.6. Approximation of Sobolev functions 57 3.7. Sobolev embedding: p < n 57 3.8. Sobolev embedding: p > n 66 3.9. Boundary values of Sobolev functions 69 3.10. Compactness results 71 3.11. Sobolev functions on Ω ⊂ Rn 73 3.A. Lipschitz functions 75 3.B. Absolutely continuous functions 76 3.C. Functions of bounded variation 78 3.D. Borel measures on R 80 v vi CONTENTS 3.E. Radon measures on R 82 3.F. Lebesgue-Stieltjes measures 83 3.G. Integration 84 3.H. Summary 86 Chapter 4.
    [Show full text]
  • MULTIVARIABLE CALCULUS (MATH 212 ) COMMON TOPIC LIST (Approved by the Occidental College Math Department on August 28, 2009)
    MULTIVARIABLE CALCULUS (MATH 212 ) COMMON TOPIC LIST (Approved by the Occidental College Math Department on August 28, 2009) Required Topics • Multivariable functions • 3-D space o Distance o Equations of Spheres o Graphing Planes Spheres Miscellaneous function graphs Sections and level curves (contour diagrams) Level surfaces • Planes o Equations of planes, in different forms o Equation of plane from three points o Linear approximation and tangent planes • Partial Derivatives o Compute using the definition of partial derivative o Compute using differentiation rules o Interpret o Approximate, given contour diagram, table of values, or sketch of sections o Signs from real-world description o Compute a gradient vector • Vectors o Arithmetic on vectors, pictorially and by components o Dot product compute using components v v v v v ⋅ w = v w cosθ v v v v u ⋅ v = 0⇔ u ⊥ v (for nonzero vectors) o Cross product Direction and length compute using components and determinant • Directional derivatives o estimate from contour diagram o compute using the lim definition t→0 v v o v compute using fu = ∇f ⋅ u ( u a unit vector) • Gradient v o v geometry (3 facts, and understand how they follow from fu = ∇f ⋅ u ) Gradient points in direction of fastest increase Length of gradient is the directional derivative in that direction Gradient is perpendicular to level set o given contour diagram, draw a gradient vector • Chain rules • Higher-order partials o compute o mixed partials are equal (under certain conditions) • Optimization o Locate and
    [Show full text]
  • Engineering Analysis 2 : Multivariate Functions
    Multivariate functions Partial Differentiation Higher Order Partial Derivatives Total Differentiation Line Integrals Surface Integrals Engineering Analysis 2 : Multivariate functions P. Rees, O. Kryvchenkova and P.D. Ledger, [email protected] College of Engineering, Swansea University, UK PDL (CoE) SS 2017 1/ 67 Multivariate functions Partial Differentiation Higher Order Partial Derivatives Total Differentiation Line Integrals Surface Integrals Outline 1 Multivariate functions 2 Partial Differentiation 3 Higher Order Partial Derivatives 4 Total Differentiation 5 Line Integrals 6 Surface Integrals PDL (CoE) SS 2017 2/ 67 Multivariate functions Partial Differentiation Higher Order Partial Derivatives Total Differentiation Line Integrals Surface Integrals Introduction Recall from EG189: analysis of a function of single variable: Differentiation d f (x) d x Expresses the rate of change of a function f with respect to x. Integration Z f (x) d x Reverses the operation of differentiation and can used to work out areas under curves, and as we have just seen to solve ODEs. We’ve seen in vectors we often need to deal with physical fields, that depend on more than one variable. We may be interested in rates of change to each coordinate (e.g. x; y; z), time t, but sometimes also other physical fields as well. PDL (CoE) SS 2017 3/ 67 Multivariate functions Partial Differentiation Higher Order Partial Derivatives Total Differentiation Line Integrals Surface Integrals Introduction (Continue ...) Example 1: the area A of a rectangular plate of width x and breadth y can be calculated A = xy The variables x and y are independent of each other. In this case, the dependent variable A is a function of the two independent variables x and y as A = f (x; y) or A ≡ A(x; y) PDL (CoE) SS 2017 4/ 67 Multivariate functions Partial Differentiation Higher Order Partial Derivatives Total Differentiation Line Integrals Surface Integrals Introduction (Continue ...) Example 2: the volume of a rectangular plate is given by V = xyz where the thickness of the plate is in z-direction.
    [Show full text]
  • Selected Solutions to Assignment #1 (With Corrections)
    Math 310 Numerical Analysis, Fall 2010 (Bueler) September 23, 2010 Selected Solutions to Assignment #1 (with corrections) 2. Because the functions are continuous on the given intervals, we show these equations have solutions by checking that the functions have opposite signs at the ends of the given intervals, and then by invoking the Intermediate Value Theorem (IVT). a. f(0:2) = −0:28399 and f(0:3) = 0:0066009. Because f(x) is continuous on [0:2; 0:3], and because f has different signs at the ends of this interval, by the IVT there is a solution c in [0:2; 0:3] so that f(c) = 0. Similarly, for [1:2; 1:3] we see f(1:2) = 0:15483; f(1:3) = −0:13225. And etc. b. Again the function is continuous. For [1; 2] we note f(1) = 1 and f(2) = −0:69315. By the IVT there is a c in (1; 2) so that f(c) = 0. For the interval [e; 4], f(e) = −0:48407 and f(4) = 2:6137. And etc. 3. One of my purposes in assigning these was that you should recall the Extreme Value Theorem. It guarantees that these problems have a solution, and it gives an algorithm for finding it. That is, \search among the critical points and the endpoints." a. The discontinuities of this rational function are where the denominator is zero. But the solutions of x2 − 2x = 0 are at x = 2 and x = 0, so the function is continuous on the interval [0:5; 1] of interest.
    [Show full text]
  • 1 Mean Value Theorem 1 1.1 Applications of the Mean Value Theorem
    Seunghee Ye Ma 8: Week 5 Oct 28 Week 5 Summary In Section 1, we go over the Mean Value Theorem and its applications. In Section 2, we will recap what we have covered so far this term. Topics Page 1 Mean Value Theorem 1 1.1 Applications of the Mean Value Theorem . .1 2 Midterm Review 5 2.1 Proof Techniques . .5 2.2 Sequences . .6 2.3 Series . .7 2.4 Continuity and Differentiability of Functions . .9 1 Mean Value Theorem The Mean Value Theorem is the following result: Theorem 1.1 (Mean Value Theorem). Let f be a continuous function on [a; b], which is differentiable on (a; b). Then, there exists some value c 2 (a; b) such that f(b) − f(a) f 0(c) = b − a Intuitively, the Mean Value Theorem is quite trivial. Say we want to drive to San Francisco, which is 380 miles from Caltech according to Google Map. If we start driving at 8am and arrive at 12pm, we know that we were driving over the speed limit at least once during the drive. This is exactly what the Mean Value Theorem tells us. Since the distance travelled is a continuous function of time, we know that there is a point in time when our speed was ≥ 380=4 >>> speed limit. As we can see from this example, the Mean Value Theorem is usually not a tough theorem to understand. The tricky thing is realizing when you should try to use it. Roughly speaking, we use the Mean Value Theorem when we want to turn the information about a function into information about its derivative, or vice-versa.
    [Show full text]
  • 2.4 the Extreme Value Theorem and Some of Its Consequences
    2.4 The Extreme Value Theorem and Some of its Consequences The Extreme Value Theorem deals with the question of when we can be sure that for a given function f , (1) the values f (x) don’t get too big or too small, (2) and f takes on both its absolute maximum value and absolute minimum value. We’ll see that it gives another important application of the idea of compactness. 1 / 17 Definition A real-valued function f is called bounded if the following holds: (∃m, M ∈ R)(∀x ∈ Df )[m ≤ f (x) ≤ M]. If in the above definition we only require the existence of M then we say f is upper bounded; and if we only require the existence of m then say that f is lower bounded. 2 / 17 Exercise Phrase boundedness using the terms supremum and infimum, that is, try to complete the sentences “f is upper bounded if and only if ...... ” “f is lower bounded if and only if ...... ” “f is bounded if and only if ...... ” using the words supremum and infimum somehow. 3 / 17 Some examples Exercise Give some examples (in pictures) of functions which illustrates various things: a) A function can be continuous but not bounded. b) A function can be continuous, but might not take on its supremum value, or not take on its infimum value. c) A function can be continuous, and does take on both its supremum value and its infimum value. d) A function can be discontinuous, but bounded. e) A function can be discontinuous on a closed bounded interval, and not take on its supremum or its infimum value.
    [Show full text]
  • Anti-Chain Rule Name
    Anti-Chain Rule Name: The most fundamental rule for computing derivatives in calculus is the Chain Rule, from which all other differentiation rules are derived. In words, the Chain Rule states that, to differentiate f(g(x)), differentiate the outside function f and multiply by the derivative of the inside function g, so that d f(g(x)) = f 0(g(x)) · g0(x): dx The Chain Rule makes computation of nearly all derivatives fairly easy. It is tempting to think that there should be an Anti-Chain Rule that makes antidiffer- entiation as easy as the Chain Rule made differentiation. Such a rule would just reverse the process, so instead of differentiating f and multiplying by g0, we would antidifferentiate f and divide by g0. In symbols, Z F (g(x)) f(g(x)) dx = + C: g0(x) Unfortunately, the Anti-Chain Rule does not exist because the formula above is not Z always true. For example, consider (x2 + 1)2 dx. We can compute this integral (correctly) by expanding and applying the power rule: Z Z (x2 + 1)2 dx = x4 + 2x2 + 1 dx x5 2x3 = + + x + C 5 3 However, we could also think about our integrand above as f(g(x)) with f(x) = x2 and g(x) = x2 + 1. Then we have F (x) = x3=3 and g0(x) = 2x, so the Anti-Chain Rule would predict that Z F (g(x)) (x2 + 1)2 dx = + C g0(x) (x2 + 1)3 = + C 3 · 2x x6 + 3x4 + 3x2 + 1 = + C 6x x5 x3 x 1 = + + + + C 6 2 2 6x Since these answers are different, we conclude that the Anti-Chain Rule has failed us.
    [Show full text]
  • MATH 25B Professor: Bena Tshishiku Michele Tienni Lowell House
    MATH 25B Professor: Bena Tshishiku Michele Tienni Lowell House Cambridge, MA 02138 [email protected] Please note that these notes are not official and they are not to be considered as a sub- stitute for your notes. Specifically, you should not cite these notes in any of the work submitted for the class (problem sets, exams). The author does not guarantee the accu- racy of the content of this document. If you find a typo (which will probably happen) feel free to email me. Contents 1. January 225 1.1. Functions5 1.2. Limits6 2. January 247 2.1. Theorems about limits7 2.2. Continuity8 3. January 26 10 3.1. Continuity theorems 10 4. January 29 – Notes by Kim 12 4.1. Least Upper Bound property (the secret sauce of R) 12 4.2. Proof of the intermediate value theorem 13 4.3. Proof of the boundedness theorem 13 5. January 31 – Notes by Natalia 14 5.1. Generalizing the boundedness theorem 14 5.2. Subsets of Rn 14 5.3. Compactness 15 6. February 2 16 6.1. Onion ring theorem 16 6.2. Proof of Theorem 6.5 17 6.3. Compactness of closed rectangles 17 6.4. Further applications of compactness 17 7. February 5 19 7.1. Derivatives 19 7.2. Computing derivatives 20 8. February 7 22 8.1. Chain rule 22 Date: April 25, 2018. 1 8.2. Meaning of f 0 23 9. February 9 25 9.1. Polynomial approximation 25 9.2. Derivative magic wands 26 9.3. Taylor’s Theorem 27 9.4.
    [Show full text]
  • Two Fundamental Theorems About the Definite Integral
    Two Fundamental Theorems about the Definite Integral These lecture notes develop the theorem Stewart calls The Fundamental Theorem of Calculus in section 5.3. The approach I use is slightly different than that used by Stewart, but is based on the same fundamental ideas. 1 The definite integral Recall that the expression b f(x) dx ∫a is called the definite integral of f(x) over the interval [a,b] and stands for the area underneath the curve y = f(x) over the interval [a,b] (with the understanding that areas above the x-axis are considered positive and the areas beneath the axis are considered negative). In today's lecture I am going to prove an important connection between the definite integral and the derivative and use that connection to compute the definite integral. The result that I am eventually going to prove sits at the end of a chain of earlier definitions and intermediate results. 2 Some important facts about continuous functions The first intermediate result we are going to have to prove along the way depends on some definitions and theorems concerning continuous functions. Here are those definitions and theorems. The definition of continuity A function f(x) is continuous at a point x = a if the following hold 1. f(a) exists 2. lim f(x) exists xœa 3. lim f(x) = f(a) xœa 1 A function f(x) is continuous in an interval [a,b] if it is continuous at every point in that interval. The extreme value theorem Let f(x) be a continuous function in an interval [a,b].
    [Show full text]