# Tangent spaces, normals and extrema

Save this PDF as:

Size: px
Start display at page:

## Transcription

1 Chapter 3 Tangent spaces, normals and extrema If S is a surface in 3-space, with a point a S where S looks smooth, i.e., without any fold or cusp or self-crossing, we can intuitively define the tangent plane to S at a as follows. Consider a plane Π which lies outside S and bring it closer and closer to S until it touches S near a at only one point, namely a, without crossing into S near a. This intuitive picture is even clearer in the case of finding the tangent line to a smooth curve in the plane at a point. In the case of a plane curve arising as the graph of a nice function f, one knows that this process works and the tangent line is the graph of the function f(a) + f (a)(x a) (not quite a linear function because of the added constant f(a) f (a)a; such functions are called affine maps). In higher dimensions, if S lies in R n, one can define tangent vectors by considering smooth curves on S through the point a, and when S is a level set of the form f(x 1,..., x n ) = c, one can use the gradient of f at a to define the tangent space. But this method fails when the gradient vanishes at a. Finally, it should be noted that one often defines the tangent space at a, when it makes sense, in such a way that it becomes a vector space. But if one looks at the case of plane curves, the usual tangent line is not a vector space as it may not contain the origin (0, 0), unless of course if a = (0, 0) (see also the above remark on affine maps). It becomes a vector space if we parallel translate it to the origin by subtracting a. It is similar in higher dimensions. One calls a plane in 3-space an affine plane if it does not pass through the origin. 3.1 Tangents to parametrized curves. By a parametrized curve in R n we mean a continuous function α : [r, s] R n, 1

2 where [r, s] is a closed interval in R. A curve C in R n is the image C := α([r, s]) of such a map. Sometimes one also allows open or half open intervals, or one omits the word parametrized, i.e. assumes C implicitly given with a parametrization. Note that by Ch. 1, Lemma 3 a curve parametrized by a closed interval lies in a bounded region of R n, i.e. cannot go off to infinity. C is called a plane curve, resp. a space curve, if n = 2, resp. n = 3. An example of the former, resp.the latter, is the cycloid, resp. the right circular helix, parametrized by α : [0, 2π] R 2 with α(t) = (t sin t, 1 cos t), resp. β : [ 3π, 6π] R 3 with β(t) = (cos t, sin t, t). Note that a parametrized curve C has an orientation, i.e., a direction; it starts at P = α(r), moves along as t increases from r, and ends at Q = α(s). We call the direction from P to Q positive and the one from Q to P negative. It is customary to say that C is a closed curve if P = Q. We say that C is differentiable iff α is a differentiable function. Definition. Let C be a differentiable curve in R n parametrized by an α as above. Let a = α(t 0 ), with t 0 (r, s). Then α (t 0 ) is called the tangent vector to C at a (in the positive direction). If α (t 0 ) 0, the tangent space at a is the one dimensional subspace of R n spanned by α (t 0 ). If α (t 0 ) = 0 the tangent space at a is undefined. For example, consider the unit circle C in the plane given by α : [0, 2π] R 2, t (cos t, sin t). Clearly α is differentiable, and we have α (t) = ( sin t, cos t) for all t (0, 2π). Consider the point a = (1/2, 3/2) on the circle; clearly, a = α(π/3). By the above definition, the tangent vector to C at a is given by α (π/3) = ( 3/2, 1/2). Let us now check that this agrees with our notion of a tangent from one variable Calculus. To this end we want to think of C as the graph of a one variable function, but this is not possible for all of C. However, we can express the upper and the lower semi-circles as graphs of such functions. And since the point of interest a lies on the upper semi-circle C +, we look at the function y = f(x) with f(x) = 1 x 2, whose graph is C +. Note that (by the chain rule) f (x) = x(1 x 2 ) 1/2. The slope of the tangent to C + at a is then given by f (1/2) = 1/ 3. Hence the tangent line to C at a is the line L passing through (1/2, 3/2) of slope 1/ 3. This is the unique line passing through a in the direction of the tangent vector ( 3/2, 1/2). (In other words L is the unique line passing through a and parallel to the line joining the origin to ( 3/2, 1/2).) The situation is similar for any plane curve which is the graph of a one-variable function f, i.e. of the form α(t) = (t, f(t)). So the definition of a tangent vector above is very reasonable. At points t 0 where α (t 0 ) = 0 the curve may or may not look smooth. 2

3 Examples. a) Consider α(t) = (t 2, t 3 ). This curve has a cusp at (0, 0). b) Consider the curve defined on [ 1, 1] by α(t) = (t 2, 0) for 1 t 0 and α(t) = (0, t 2 ) for 0 t 1. This curve is differentiable at 0 (check each component is, see Ch.2, Lemma 2) with derivative α (0) = (0, 0). The curve has a corner at (0, 0). c) Consider α(t) = (t t, t 4 ). This curve is differentiable at 0 with derivative α (0) = (0, 0) but looks perfectly smooth at α(0) = (0, 0). In fact it is just a reparametrization of the parabola α(t) = (t, t 2 ) which has a well defined tangent space spanned by (1, 0) at (0, 0). So sometimes the vanishing of α (t) is just an artefact of the parametrization whereas the curve itself has a meaningful tangent space. 3.2 Tangent Spaces and Normals to Level Sets. In the last paragraph we have defined the tangent line to a parametrized curve. This is a set defined by a map into R n. Here we look at different kinds of sets which are defined by maps from R n. Definition. Let f : D R, D R n, be a scalar field. For each c R, the level set of f at c is given by L c = {x D f(x) = c} Example. f(x) = height from sea level, where x is a point on Mount Wilson (sitting in R 3 ). L c (f) consists of all points of constant height above sea level, just like those lines on a topographic map. Definition. Let f : D R, D R n, be a differentiable scalar field and a L c (f). If f(a) 0 then we define the tangent space Θ a (L c (f)) to L c (f) at a to be the vector space Θ a (L c (f)) = {x R n f(a) x = 0}. This is a solution set of one nonzero equation in R n, hence a vector space of dimension n 1. One calls a point a L c (f) where f(a) 0 a smooth point of L c (f). The idea being that a small neighborhood of a in L c (f) looks just like a small neighborhod of any point in R n 1 though we won t make this statement precise. 3

4 Definition. Let f, L c (f) and Θ a (L c (f)) be as in the previous definition. A normal vector (to L c (f) at a) is a vector v R n orthogonal to all vectors in Θ a (L c (f)). It is clear that the normal vectors are just the scalar multiples of f(a) (verify this!). Tangent vectors point in the direction of the level set whereas normal vectors point as far away as possible from the level set. Our two notions of tangent space are related by the following observation. Proposition 1 Let f : D R be a differentiable scalar field, with D R n, α : R L c (f) a curve which is differentiable at t 0 R and so that a = α(t 0 ) is a smooth point of L c (f). Then α (t 0 ) Θ a (L c (f)). Proof. Since α takes values in the level set we have f(α(t)) = c for all t R. Applying the chain rule to h(t) := f(α(t)) (a constant function!) we find which means that α (t 0 ) Θ a (L c (f)). QED 0 = h (t) = f(a) α (t 0 ) In particular, if n = 2 we know that Θ a (L c (f)) has dimension 1. So it must coincide with the tangent line defined for parametrized curves in the previous section. One can in fact show that given a smooth point a L c (f) there always is a curve α : R L c (f) with α(0) = a and α (0) any given tangent vector in Θ a (L c (f)). But we won t prove this here. Given any subset S of R n, and a point a S, one may ask whether there is always a good notion of tangent space to S at a. If one starts with the idea that α (t 0 ) for any parametrized curve : α : R S should be a tangent vector, the tangent vectors might not form a linear space. Consider the example S = {(x, y) R 2 xy = 0} at a = (0, 0). The only differentiable curves in S through a lie on one of the coordinate axes, and the tangent vectors are those of the form (0, a) or (a, 0). If a set has a corner or cusp at a S there might be no differentiable curve with a = α(t 0 ) and α (t 0 ) 0. Consider S = {(x, y) R 2 xy = 0, x 0, y 0} and a = (0, 0). However, the two classes of sets we have studied so far readily generalize and so does the notion of tangent space for them. Definition We say that S R n can be differentiably parametrized around a S if there is a bijective (one-to-one) differentiable function α : R k S R n with α(0) = a and so that the linear map T 0 α has largest possible rank, namely k. The tangent space to S at a is the simply the image of T 0 α, a linear subspace of R n. In particular we must have k n. 4

5 Definition. Let f : R n R m be a vector field with components (f 1,..., f m ). Then for c = (c 1,.., c m ) R m the level set L c (f) := {x R n f(x) = c} = L c1 (f 1 )... L cm (f m ) is defined as before, and the tangent space Θ a (L c (f)) := {x R n (T a f)(x) = 0} is defined if T a f has largest possible rank, namely m. This latter condition is equivalent to requiring f 1 (a),..., f m (a) to be linearly independent. We also have and dim R Θ a (L c (f)) = n m. Θ a (L c (f)) = Θ a (L c1 (f 1 ))... Θ a (L cm (f m )) Once we have the notion of tangent space, a normal vector is defined as before for both classes of examples. Note that n m is also the (intuitive) dimension of L c (f). Examples: (1) Find a normal to the surface S given by z = x 2 y 2 + y + 1 at (0, 0, 1): Set f(x, y, z) = x 2 y 2 + y z + 1. Then z = x 2 y 2 + y + 1 iff (x, y.z) lies on L 0 (f). Since f is a polynomial function, it is differentiable. We have: f(a) = (2xy 2, 2x 2 y + 1, 1) (0,0,1) = (0, 1, 1), which is a normal to L 0 (f) = S by the Proposition above. So a unit normal is given by n = (0, 1/ 2, 1/ 2). (2) (Physics example) Let P be a unit mass particle at (x, y, z) in R 3. Denote by F the gravitational force on P exerted by a point mass M at the origin ). Then Newton s gravitational law tells us that F = GM ( ) r, r 2 r where r = x i + y j + z k, r = r, and G the gravitational constant. (Here i, j, k denote the standard basis vectors (1, 0, 0), (0, 1, 0), (0, 0, 1).) Put V = GM/r, which is called the gravitational potential. By chain rule, V GM r V V equals. Similarly for and. x r 2 x y z Therefore V = GM r ( r 2 x, r y, r z ) = GM r (x 2 r, y r, z r ) = F. 5

6 For c < 0, the level sets L c (V ) are spheres centered at the origin of radius GM/c, and F is evidently perpendicular to each of them. Note that F gets stronger as r gets smaller as the physical intuition would suggest. (3) Let f = x 3 + y 3 + z 3 and g = x + y + z. The level set S := L 10 (f) L 4 (g) is a curve. The set S {(x, y, z) R 3 x 0, y 0, z 0} is closed and bounded hence compact (verify this!). 3.3 Relative and absolute extrema, saddle points Let f : D R be a scalar field, and let a be a point in D. Definition. The point a = (a 1,..., a n ) is a relative maximum (resp. absolute maximum) iff f(x) f(a) for every x B a (r) D where B a (r) is some open ball (resp. for every x D). We define relative and absolute minima correspondingly by replacing with and call either a (relative or absolute) extremum. Some authors call a relative extremum a local extremum. In the textbook, the condition for a relative extremum requires that the open ball B a (r) be entirely contained in D, i.e. that a is also an interior point of D. With this definition however, an absolute extremum would not automatically also be a relative extremum (because the absolute extremum could lie on the boundary of D). This is why we prefer the above definition. Examples: (1) Fix real numbers b 1, b 2,..., b n, not all zero, and consider f : R n R defined by f(x 1, x 2,..., x n ) = b 1 x 1 + b 2 x b n x n. In vector language, this is described by f(x) = b x. Then no point in R n is a relative extremum for this function. More precisely, we claim that, given any a in R n and any other v R n, f(x) f(a) is positive and negative near a along v. Indeed, if we write x = a+tv, the linearity of f shows that f(x) f(a) = tf(v), which changes sign when t does. (2) Fix a non-zero real number b and consider the scalar field f(x, y) = b(x 2 + y 2 ) on R 2. It is an easy exercise to see that f has a local extremum at (0, 0), which is a relative maximum iff b is negative. (3) Let f : R R be the function defined by f(x) = x [x], where [x] denotes the largest integer which is less than or equal to x, called the integral part of x. (For example, 6

7 [π] = 3, [ 2] = 1 and [ π] = 4.) Then it is easy to see that f(x) is always non-negative and that f(n) = 0 for all integers n. Hence the integers n are all relative minima for f. The graph of f is continuous except at the integers and is periodic of period 1. Moreover, the image of f is the half-closed interval [0, 1). We claim that there is no relative maximum. Indeed the function is increasing (with slope 1) on [n, n + 1) for any integer n, any relative maximum on [n, n + 1) has to be an absolute maximum and this does not exist; f(x) can get arbitrarily close to 1 but can never attain it. In the first two examples above, f was continuous, even differentiable. In such cases the relative extrema exert an influence on the derivative, which can be used to locate them. Lemma 1 If a = (a 1,..., a n ) is an interior point of D and a relative extremum of a differentiable scalar field f, then f(a) is zero. Proof. For every j = 1,..., n, define a one-variable function g j by g j (t) = f(a 1,..., a j 1, a j + t, a j+1,..., a n ), so that g j (0) = f(a). Since f has a relative extremum at a, g j has a local extremum at 0. Since f is differentiable, g j is differentiable as well, and we see that by Ma 1a material, g j(0) = 0 for every j. But g j(0) is none other than f x j (a). Since f(a) = ( f x 1 (a),... f x n (a)), it must be zero. QED. Definition. A stationary point of a differentiable scalar field f is a point a where f(a) = 0. It is called a saddle point if it is not a relative extremum. Some call a stationary point a critical point. In the language of the previous section, stationary points are the non-smooth points of the level set. But here we focus on the function rather than its level sets, hence the new terminology. Note that if a is a saddle point, then by definition, every open ball B a (r) contains points x with f(x) f(a) and points x such that f(x ) f(a). Examples (contd.): (3) Let f(x, y) = x 2 y 2, for all (x, y) R 2. Being a polynomial, f is differentiable everywhere, and f = (2x, 2y). So the origin is the unique stationary point. We claim that it is a saddle point. Indeed, consider any open ball B 0 (r) centered at 0. If we move away from 0 along the y direction (inside B 0 (r)), the function is z = y 2 and so the origin is a local maximum along this direction. But if we move away from 0 in the x direction, 7

8 we see that the origin is a local minimum along that direction. So f(x, y) f(0, 0) is both positive and negative in B 0 (r), and this is true for any r > 0. Hence the claim. Note that if we graph z = x 2 y 2 in R 3, the picture looks quite a bit like a real saddle around the origin. This is the genesis of the mathematical terminology of a saddle point. (4) The above example can be jazzed up to higher dimensions as follows: Fix positive integers n, k with k < n, and define f : R n R by f(x 1, x 2,..., x n ) = x x 2 k x 2 k+1... x 2 n. Since f = 2(x 1,..., x k, x k+1,..., x n ), the origin is the only stationary point. Again, it is a saddle point by a similar argument. 3.4 The Hessian test for relative maxima/minima Given a stationary point a of a nice two-variable function (scalar field) f, say, with continuous second partial derivatives at a, there is a test one can apply to determine whether it is a relative maximum or a relative minimum or neither. This generalizes in a non-obvious way the second derivative test in the one-variable situation. One crucial difference is that in that (one-variable) case, one does not require the continuity of the second derivative at a. This added hypothesis is needed in our (2-variable) case because the second mixed partial derivatives, namely 2 f/ x y and 2 f/ y x need not be equal at a. First we need to define the Hessian. Suppose we are given a function f : D R with D R n, and an interior point a D where the second partial derivatives 2 f/ x i x j exist for all 1 i, j n. We put ) ( 2 f Hf(a) = x i x j, 1 i,j n which is clearly an n n-matrix. It is a symmetric matrix iff all the mixed partial derivatives are independent of the order in which the partial differentiation is performed. The Hessian determinant of f at a is by definition the determinant of Hf(a), denoted det(hf(a)). We will make use of this notion in the plane. Theorem 1 Let D R 2, f : D R a scalar field, and a D o (the interior). Assume that all the second partial derivatives of f exist and are continuous at a. Suppose a is a stationary point. Then (i) If 2 f/ x 2 (a) < 0 and det(hf(a)) > 0, then a is a relative maximum for f; 8

9 (ii) 2 f/ x 2 (a) > 0 and det(hf(a)) > 0, then a is a relative minimum for f; (iii) If det(hf(a)) < 0, a is a saddle point for f. The test does not say anything if Hf(a) is singular, i.e. if it has zero determinant. Since the second partial derivatives of f exist and are continuous at a, we know from the previous chapter that 2 f x y (a) = 2 f y x (a). This means the matrix Hf(a) is symmetric (and real). So by a theorem in Linear Algebra (Ma1b), we know that we can diagonalize it. In other words, we can find an invertible matrix M such that ( ) M 1 λ1 0 Hf(a)M =, 0 λ 2 where λ 1, λ 2 are the eigenvalues. (We can even choose M to be an orthogonal matrix, i.e., with M 1 being the transpose matrix M t.) Then we have and (D) det(hf(a)) = λ 1 λ 2, (T ) tr(hf(a)) = 2 f/ x 2 (a) + 2 f/ y 2 (a) = λ 1 + λ 2, where tr denotes the trace. (Recall that the determinant and the trace do not change when a matrix is conjugated by another matrix, such as M.) Now suppose Hf(a) has positive determinant, so that 2 f/ x 2 (a) 2 f/ y 2 (a) > ( 2 f/ x y(a) ) 2 0. In this case, by (D), λ 1 and λ 2 have the same sign. Using (T), we then see that 2 f/ x 2 (a) and 2 f/ y 2 (a) must have the same sign as λ 1 and λ 2. When this sign is positive (resp. negative), a is a relative minimum (resp. relative maximum) for f. When the Hessian determinant is negative at a, λ 1 and λ 2 have opposite sign, which means that f increases in some direction and decreases in another. In other words, a is a saddle point for f. 3.5 Constrained extrema and Lagrange multipliers. Very often in practice one needs to find the extrema of a scalar field subject to some constraints imposed by the geometry of the situation. More precisely, one starts with a scalar 9

10 field f : D R, with D R n, and a subset S of the interior of D, and asks what the maxima and minima of f are when restricted to S. For example, we could consider the saddle function f(x, y) = x 2 y 2 with D = R 2, which has no relative extrema, and ask for the constrained extrema relative to S = unit circle : x 2 + y 2 = 1 This can be solved explicitly. A good way to do it is to look at the level curves L c (f). For c = 0, we get the union of the lines y = x and y = x. For c 0, we get hyperbolas with foci (± c, 0) if c > 0 and (0, ± c) if c < 0. It is clear by inspection that the constrained extrema of f on S are at the four points (1, 0), ( 1, 0), (0, 1), (0, 1); the former two are constrained maxima (with value 1) and the latter two are constrained minima (with value 1). If you like a more analytical proof, see below. The question of finding constrained extrema is very difficult to solve in general. But luckily, if f is differentiable and if S is given as the intersection of a finite number of level sets of differentiable functions (with independent gradients), there is a beautiful method due to Lagrange to find the extrema, which is efficient at least in low dimensions. Here is Lagrange s result. Theorem 2 Let f be a differentiable scalar field on R n. Suppose we are given scalars c 1, c 2,..., c r and differentiable functions g 1, g 2,..., g r on R n, so that the constraint set S is the intersection of the level sets L c1 (g 1 ), L c2 (g x ),, L cr (g r ). Let a be a point on S where g 1 (a), g 2 (a),, g r (a) are linearly independent. Then we have the following: If a is a constrained extremum of f on S, then there are scalars λ 1, λ 2,, λ r (called the Lagrange Multipliers ) such that f(a) = λ 1 g 1 (a) + + λ 1 g r (a). (3.1) Proof. We use the fact, mentioned for r = 1 in the previous section, that one can always find a differentiable curve α : R S with α(0) = a and α (0) any given tangent vector in Θ a (S) (note that S is a generalized level set and the linear independence of the g i (a) assures that Θ a (S) is defined). This is not so easy to prove and we may do this later in the course if there is time left. So if a is a constrained extremum of f on S we take such a curve α and notice that a is also an extremum of f on the image of α. So the one-variable function h(t) := f(α(t)) has vanishing derivative at t = 0 which by the chain rule implies f(a) α (0) = 0. 10

11 Since α (0) was any given tangent vector we find that f(a) is orthogonal to the whole tangent space (i.e. it is a normal vector). The normal space N, say, has dimension r since it is a solution space of a system of linear equations of rank n r (picking a basis θ 1,..., θ n r of Θ a (L c (f)) the system of equations is θ i x = 0). On the other hand g i (a) all lie in N and they are linearly independent by assumption, so they form a basis of N. Since we ve found that f(a) lies in N, f(a) must be a linear combination of these basis vectors. Done. Note that the condition (3.1) is only a necessary condition for a to be a relative extremum of f on the constraint set S. Once you find such a point a you still have to decide whether it is a maximum, minimum or saddle point. In other words, we have the same situation as with the condition f(a) = 0 for unconstrained extrema. Now let us use (a superspecial case of) this Theorem to check the answer we gave above for the problem of finding constrained extrema of f(x, y) = x 2 y 2 relative to the unit circle S centered at (0, 0). Here r = 1. Note first that S is the level set L 0 (g), where g(x, y) = x 2 + y 2 1. We need to solve f = λ g. Since f = (2x, 2y) and g = (2x, 2y), we are left to solve the simultaneous equations x = λx and y = λy. For this to happen, x and y cannot both be non-zero, as otherwise we will get λ = 1 from the first equation and λ = 1 from the second! They cannot both be zero either, as (x, y) is constrained to lie on S and so must satisfy x 2 +y 2 = 1. So, either x = 0, y = ±1, when λ = 1, or x = ±1, y = 0, in which case λ = 1. So the four candidates for constrained extrema are (0, ±1), (±1, 0). One can now check that they are indeed constrained extrema. We get the same answer as before. We come back to the example of the set S defined as the intersection of the two level sets x 3 + y 3 + z 3 = 10 and x + y + z = 4. Suppose we want to find points on S with maximal or minimal distance from the origin. We need to look at f(x, y, z) = x 2 + y 2 + z 2 and solve the system of five equations in five variables x 3 + y 3 + z 3 =10 x + y + z =4 f(x, y, z) = (2x, 2y, 2z) =λ 1 (3x 2, 3y 2, 3z 2 ) + λ 2 (1, 1, 1). These are nonlinear equations for which there is no simple method like the Gauss Jordan algorithm for linear equations. It s a good idea in every such problem to look at symmetries. Our set S is invariant under any permutation of the coordinates x, y, z, so it has a sixfold symmetry. Each of x, y, z satisfies the quadratic equation 2t = 3λ 1 t 2 + λ 2 or t 2 2 3λ 1 t + λ 2 3λ 1 = 0. ( ) 11

12 Let s check that λ 1 = 0 cannot happen. Because if λ 1 = 0 we d have x = y = z = λ 2 /2 and x + y + z = 3λ 2 /2 = 4 hence λ 2 = 8/3. But x 3 + y 3 + z 3 = 3(4/3) Contradiction! We ve also shown here that x = y = z cannot happen. In particular our quadratic equation (*) has two distinct roots, and as you well know it has exactly two roots! So two of x, y, z must coincide: x = y z, or x = z y or x y = z. Let s look at the second case. Then 2x + y = 4 and y = 4 2x which leads to 2x 3 + (4 2x) 3 = 10. This is a cubic equation which, luckily, has an obvious solution, namely x = 1 (if you were not so lucky there d still be some solution in R). Now x = 1 leads to y = 4 2 x = 2 and z = x = 1, i.e. a = (1, 2, 1). We also find λ 1 = 1/9 and λ 2 = 2/3 although we don t really need these values. However, we still need to check g 1 (a) = (3, 12, 3) is linearly independent from g 2 (a) = (1, 1, 1) which is the case. Finally, f(a) = f(1, 2, 1) = = 6. Now the cubic 2x 3 + (4 2x) 3 10 = 0 written in standard form is x 3 8x x 9 and it factors as (x 1)(x 2 7x + 9). The two roots of the quadratic part are x = 7± 13 2 and for each of them we find corresponding a = (x, y, z) namely We also have a = ( , 3 13, ), a = ( f(a ) = , , 7 13 ). 2 However, we still don t know if these three points are maxima, minima or saddle points. Suppose now we look only at the part S + of S where all of x, y, z are nonnegative. It is easy to see that S + is a closed set (being the intersection of inverse images of closed sets of the real line under continuous maps) and that S + is bounded. Hence S + is compact and so f must take on an absolute minimum and an absolute maximum somewhere on S +. Now S has no intersection with the coordinate hyperplanes where some coordinate is zero (e.g. if z = 0 then y = 4 x and x 3 + (4 x) 3 = 10 is a quadratic equation for x with no real roots). Since a / S + the only candidates for absolute extrema of f on S + which satisfy x = z are the two points a, a. By looking at the values of f we find that f has an absolute minimum at a and an absolute maximum at a. Taking into account the possibilities where the other two coordinates coincide, we ve found three absolute maxima and three absolute minima, and no other relative extrema, of f on S +. Had we found more points on S + where (3.1) is satisfied, the point with the largest (resp. smallest) value of f would be the absolute maximum (resp. minimum) but for points with intermediate values we would still need additional arguments to decide whether they are relative maxima, relative minima or saddle points. 12

13 Gradients and parallelism: We know how the gradients of a differentiable scalar field f give (non-zero) normal vectors to the level sets L c (f) at points a where fa 0. This is used in the following instances: (1) To find points of tangency between the level sets L c (f) and L c (g). In this case, if a is a point of tangency, f(a) and g(a) must be proportional. (2) To find the extrema with constraints using Lagrange multipliers. (3) To determine if two lines in R 2 meet. (Solution: Two lines L 1 and L 2 in R 2 meet if and only if their gradients are not proportional.) Similarly, one may want to know if two planes in R 3 meet, etc. One can use the following approach to solve problem (3), which generalizes well to higher dimensions. Let L 1 =level set of f(x, y) = a 1 x + a 2 y at a 0 L 2 =level set of g(x, y) = b 1 x + b 2 y at b 0 Check if f is proportional to g. ( f = (a 1, a 2 ) and g = (b 1, b 2 ).) ( ) a1 a L 1 and L 2 meet if and only if (a 1, a 2 ) λ(b 1, b 2 ). In other words, det 2 b 1 b 2 not be zero. There are 3 possibilities for L 1 L 2 : should (1) L 1 L 2 =. They are parallel but not equal, f = λ g but L 1 L 2 (2) L 1 L 2 = L 1 = L 2 : L 1 and L 2 are the same. (3) L 1 ( L 2 is ) a point: This happens IFF f is not proportional to g IFF a1 a det 2 0. b 1 b 2 13

### MATH Max-min Theory Fall 2016

MATH 20550 Max-min Theory Fall 2016 1. Definitions and main theorems Max-min theory starts with a function f of a vector variable x and a subset D of the domain of f. So far when we have worked with functions

### Implicit Functions, Curves and Surfaces

Chapter 11 Implicit Functions, Curves and Surfaces 11.1 Implicit Function Theorem Motivation. In many problems, objects or quantities of interest can only be described indirectly or implicitly. It is then

### 39.1 Absolute maxima/minima

Module 13 : Maxima, Minima Saddle Points, Constrained maxima minima Lecture 39 : Absolute maxima / minima [Section 39.1] Objectives In this section you will learn the following : The notion of absolute

### 3.7 Constrained Optimization and Lagrange Multipliers

3.7 Constrained Optimization and Lagrange Multipliers 71 3.7 Constrained Optimization and Lagrange Multipliers Overview: Constrained optimization problems can sometimes be solved using the methods of the

### Differentiation. f(x + h) f(x) Lh = L.

Analysis in R n Math 204, Section 30 Winter Quarter 2008 Paul Sally, e-mail: sally@math.uchicago.edu John Boller, e-mail: boller@math.uchicago.edu website: http://www.math.uchicago.edu/ boller/m203 Differentiation

### Conics and their duals

9 Conics and their duals You always admire what you really don t understand. Blaise Pascal So far we dealt almost exclusively with situations in which only points and lines were involved. Geometry would

### Preliminary draft only: please check for final version

ARE211, Fall2012 CALCULUS4: THU, OCT 11, 2012 PRINTED: AUGUST 22, 2012 (LEC# 15) Contents 3. Univariate and Multivariate Differentiation (cont) 1 3.6. Taylor s Theorem (cont) 2 3.7. Applying Taylor theory:

### V. Graph Sketching and Max-Min Problems

V. Graph Sketching and Max-Min Problems The signs of the first and second derivatives of a function tell us something about the shape of its graph. In this chapter we learn how to find that information.

### Math 291-3: Lecture Notes Northwestern University, Spring 2016

Math 291-3: Lecture Notes Northwestern University, Spring 216 Written by Santiago Cañez These are lecture notes for Math 291-3, the third quarter of MENU: Intensive Linear Algebra and Multivariable Calculus,

### Polynomial and Rational Functions. Chapter 3

Polynomial and Rational Functions Chapter 3 Quadratic Functions and Models Section 3.1 Quadratic Functions Quadratic function: Function of the form f(x) = ax 2 + bx + c (a, b and c real numbers, a 0) -30

### Linear Algebra Massoud Malek

CSUEB Linear Algebra Massoud Malek Inner Product and Normed Space In all that follows, the n n identity matrix is denoted by I n, the n n zero matrix by Z n, and the zero vector by θ n An inner product

### g(x,y) = c. For instance (see Figure 1 on the right), consider the optimization problem maximize subject to

1 of 11 11/29/2010 10:39 AM From Wikipedia, the free encyclopedia In mathematical optimization, the method of Lagrange multipliers (named after Joseph Louis Lagrange) provides a strategy for finding the

### Lecture 6 Positive Definite Matrices

Linear Algebra Lecture 6 Positive Definite Matrices Prof. Chun-Hung Liu Dept. of Electrical and Computer Engineering National Chiao Tung University Spring 2017 2017/6/8 Lecture 6: Positive Definite Matrices

### Ph.D. Katarína Bellová Page 1 Mathematics 2 (10-PHY-BIPMA2) EXAM - Solutions, 20 July 2017, 10:00 12:00 All answers to be justified.

PhD Katarína Bellová Page 1 Mathematics 2 (10-PHY-BIPMA2 EXAM - Solutions, 20 July 2017, 10:00 12:00 All answers to be justified Problem 1 [ points]: For which parameters λ R does the following system

### EXERCISE SET 5.1. = (kx + kx + k, ky + ky + k ) = (kx + kx + 1, ky + ky + 1) = ((k + )x + 1, (k + )y + 1)

EXERCISE SET 5. 6. The pair (, 2) is in the set but the pair ( )(, 2) = (, 2) is not because the first component is negative; hence Axiom 6 fails. Axiom 5 also fails. 8. Axioms, 2, 3, 6, 9, and are easily

PYTHAGOREAN TRIPLES KEITH CONRAD 1. Introduction A Pythagorean triple is a triple of positive integers (a, b, c) where a + b = c. Examples include (3, 4, 5), (5, 1, 13), and (8, 15, 17). Below is an ancient

### 2.3. VECTOR SPACES 25

2.3. VECTOR SPACES 25 2.3 Vector Spaces MATH 294 FALL 982 PRELIM # 3a 2.3. Let C[, ] denote the space of continuous functions defined on the interval [,] (i.e. f(x) is a member of C[, ] if f(x) is continuous

### SPRING 2006 PRELIMINARY EXAMINATION SOLUTIONS

SPRING 006 PRELIMINARY EXAMINATION SOLUTIONS 1A. Let G be the subgroup of the free abelian group Z 4 consisting of all integer vectors (x, y, z, w) such that x + 3y + 5z + 7w = 0. (a) Determine a linearly

### Problems in Linear Algebra and Representation Theory

Problems in Linear Algebra and Representation Theory (Most of these were provided by Victor Ginzburg) The problems appearing below have varying level of difficulty. They are not listed in any specific

### HOMEWORK 7 SOLUTIONS

HOMEWORK 7 SOLUTIONS MA11: ADVANCED CALCULUS, HILARY 17 (1) Using the method of Lagrange multipliers, find the largest and smallest values of the function f(x, y) xy on the ellipse x + y 1. Solution: The

### 1 Overview. 2 A Characterization of Convex Functions. 2.1 First-order Taylor approximation. AM 221: Advanced Optimization Spring 2016

AM 221: Advanced Optimization Spring 2016 Prof. Yaron Singer Lecture 8 February 22nd 1 Overview In the previous lecture we saw characterizations of optimality in linear optimization, and we reviewed the

### Let f(x) = x, but the domain of f is the interval 0 x 1. Note

I.g Maximum and Minimum. Lagrange Multipliers Recall: Suppose we are given y = f(x). We recall that the maximum/minimum points occur at the following points: (1) where f = 0; (2) where f does not exist;

### Faculty of Engineering, Mathematics and Science School of Mathematics

Faculty of Engineering, Mathematics and Science School of Mathematics GROUPS Trinity Term 06 MA3: Advanced Calculus SAMPLE EXAM, Solutions DAY PLACE TIME Prof. Larry Rolen Instructions to Candidates: Attempt

### Topics in linear algebra

Chapter 6 Topics in linear algebra 6.1 Change of basis I want to remind you of one of the basic ideas in linear algebra: change of basis. Let F be a field, V and W be finite dimensional vector spaces over

### MATH2070 Optimisation

MATH2070 Optimisation Nonlinear optimisation with constraints Semester 2, 2012 Lecturer: I.W. Guo Lecture slides courtesy of J.R. Wishart Review The full nonlinear optimisation problem with equality constraints

### CHAPTER 2: CONVEX SETS AND CONCAVE FUNCTIONS. W. Erwin Diewert January 31, 2008.

1 ECONOMICS 594: LECTURE NOTES CHAPTER 2: CONVEX SETS AND CONCAVE FUNCTIONS W. Erwin Diewert January 31, 2008. 1. Introduction Many economic problems have the following structure: (i) a linear function

### Optimality Conditions

Chapter 2 Optimality Conditions 2.1 Global and Local Minima for Unconstrained Problems When a minimization problem does not have any constraints, the problem is to find the minimum of the objective function.

### Here each term has degree 2 (the sum of exponents is 2 for all summands). A quadratic form of three variables looks as

Reading [SB], Ch. 16.1-16.3, p. 375-393 1 Quadratic Forms A quadratic function f : R R has the form f(x) = a x. Generalization of this notion to two variables is the quadratic form Q(x 1, x ) = a 11 x

### 3.2 Constructible Numbers

102 CHAPTER 3. SYMMETRIES 3.2 Constructible Numbers Armed with a straightedge, a compass and two points 0 and 1 marked on an otherwise blank number-plane, the game is to see which complex numbers you can

### Some notes on Coxeter groups

Some notes on Coxeter groups Brooks Roberts November 28, 2017 CONTENTS 1 Contents 1 Sources 2 2 Reflections 3 3 The orthogonal group 7 4 Finite subgroups in two dimensions 9 5 Finite subgroups in three

### COMP 558 lecture 18 Nov. 15, 2010

Least squares We have seen several least squares problems thus far, and we will see more in the upcoming lectures. For this reason it is good to have a more general picture of these problems and how to

### Lagrange Multipliers

Lagrange Multipliers (Com S 477/577 Notes) Yan-Bin Jia Nov 9, 2017 1 Introduction We turn now to the study of minimization with constraints. More specifically, we will tackle the following problem: minimize

### Calculus I Review Solutions

Calculus I Review Solutions. Compare and contrast the three Value Theorems of the course. When you would typically use each. The three value theorems are the Intermediate, Mean and Extreme value theorems.

### 7 Planar systems of linear ODE

7 Planar systems of linear ODE Here I restrict my attention to a very special class of autonomous ODE: linear ODE with constant coefficients This is arguably the only class of ODE for which explicit solution

### MATH 12 CLASS 5 NOTES, SEP

MATH 12 CLASS 5 NOTES, SEP 30 2011 Contents 1. Vector-valued functions 1 2. Differentiating and integrating vector-valued functions 3 3. Velocity and Acceleration 4 Over the past two weeks we have developed

### Introduction to Topology

Introduction to Topology Randall R. Holmes Auburn University Typeset by AMS-TEX Chapter 1. Metric Spaces 1. Definition and Examples. As the course progresses we will need to review some basic notions about

### GRE Math Subject Test #5 Solutions.

GRE Math Subject Test #5 Solutions. 1. E (Calculus) Apply L Hôpital s Rule two times: cos(3x) 1 3 sin(3x) 9 cos(3x) lim x 0 = lim x 2 x 0 = lim 2x x 0 = 9. 2 2 2. C (Geometry) Note that a line segment

### We are going to discuss what it means for a sequence to converge in three stages: First, we define what it means for a sequence to converge to zero

Chapter Limits of Sequences Calculus Student: lim s n = 0 means the s n are getting closer and closer to zero but never gets there. Instructor: ARGHHHHH! Exercise. Think of a better response for the instructor.

### A geometric proof of the spectral theorem for real symmetric matrices

0 0 0 A geometric proof of the spectral theorem for real symmetric matrices Robert Sachs Department of Mathematical Sciences George Mason University Fairfax, Virginia 22030 rsachs@gmu.edu January 6, 2011

### After taking the square and expanding, we get x + y 2 = (x + y) (x + y) = x 2 + 2x y + y 2, inequality in analysis, we obtain.

Lecture 1: August 25 Introduction. Topology grew out of certain questions in geometry and analysis about 100 years ago. As Wikipedia puts it, the motivating insight behind topology is that some geometric

### 106 Chapter 5 Curve Sketching. If f(x) has a local extremum at x = a and. THEOREM Fermat s Theorem f is differentiable at a, then f (a) = 0.

5 Curve Sketching Whether we are interested in a function as a purely mathematical object or in connection with some application to the real world, it is often useful to know what the graph of the function

### ARE211, Fall2015. Contents. 2. Univariate and Multivariate Differentiation (cont) Taylor s Theorem (cont) 2

ARE211, Fall2015 CALCULUS4: THU, SEP 17, 2015 PRINTED: SEPTEMBER 22, 2015 (LEC# 7) Contents 2. Univariate and Multivariate Differentiation (cont) 1 2.4. Taylor s Theorem (cont) 2 2.5. Applying Taylor theory:

### Analysis II - few selective results

Analysis II - few selective results Michael Ruzhansky December 15, 2008 1 Analysis on the real line 1.1 Chapter: Functions continuous on a closed interval 1.1.1 Intermediate Value Theorem (IVT) Theorem

### Review of Linear Algebra

Review of Linear Algebra Throughout these notes, F denotes a field (often called the scalars in this context). 1 Definition of a vector space Definition 1.1. A F -vector space or simply a vector space

### Green s Theorem in the Plane

hapter 6 Green s Theorem in the Plane Introduction Recall the following special case of a general fact proved in the previous chapter. Let be a piecewise 1 plane curve, i.e., a curve in R defined by a

### Section 3.3 Maximum and Minimum Values

Section 3.3 Maximum and Minimum Values Definition For a function f defined on a set S of real numbers and a number c in S. A) f(c) is called the absolute maximum of f on S if f(c) f(x) for all x in S.

### Advanced Calculus Notes. Michael P. Windham

Advanced Calculus Notes Michael P. Windham February 25, 2008 Contents 1 Basics 5 1.1 Euclidean Space R n............................ 5 1.2 Functions................................. 7 1.2.1 Sets and functions........................

### Vector Geometry. Chapter 5

Chapter 5 Vector Geometry In this chapter we will look more closely at certain geometric aspects of vectors in R n. We will first develop an intuitive understanding of some basic concepts by looking at

### 4.1 Distance and Length

Chapter Vector Geometry In this chapter we will look more closely at certain geometric aspects of vectors in R n. We will first develop an intuitive understanding of some basic concepts by looking at vectors

### Chapter 8. Rigid transformations

Chapter 8. Rigid transformations We are about to start drawing figures in 3D. There are no built-in routines for this purpose in PostScript, and we shall have to start more or less from scratch in extending

More Books At www.goalias.blogspot.com www.goalias.blogspot.com www.goalias.blogspot.com www.goalias.blogspot.com www.goalias.blogspot.com www.goalias.blogspot.com www.goalias.blogspot.com www.goalias.blogspot.com

### There are two things that are particularly nice about the first basis

Orthogonality and the Gram-Schmidt Process In Chapter 4, we spent a great deal of time studying the problem of finding a basis for a vector space We know that a basis for a vector space can potentially

### WA State Common Core Standards - Mathematics

Number & Quantity The Real Number System Extend the properties of exponents to rational exponents. 1. Explain how the definition of the meaning of rational exponents follows from extending the properties

### CALCULUS: Math 21C, Fall 2010 Final Exam: Solutions. 1. [25 pts] Do the following series converge or diverge? State clearly which test you use.

CALCULUS: Math 2C, Fall 200 Final Exam: Solutions. [25 pts] Do the following series converge or diverge? State clearly which test you use. (a) (d) n(n + ) ( ) cos n n= n= (e) (b) n= n= [ cos ( ) n n (c)

### Lagrange Multipliers

Optimization with Constraints As long as algebra and geometry have been separated, their progress have been slow and their uses limited; but when these two sciences have been united, they have lent each

### Good Problems. Math 641

Math 641 Good Problems Questions get two ratings: A number which is relevance to the course material, a measure of how much I expect you to be prepared to do such a problem on the exam. 3 means of course

### How well do I know the content? (scale 1 5)

Page 1 I. Number and Quantity, Algebra, Functions, and Calculus (68%) A. Number and Quantity 1. Understand the properties of exponents of s I will a. perform operations involving exponents, including negative

### Vector Calculus. Lecture Notes

Vector Calculus Lecture Notes Adolfo J. Rumbos c Draft date November 23, 211 2 Contents 1 Motivation for the course 5 2 Euclidean Space 7 2.1 Definition of n Dimensional Euclidean Space........... 7 2.2

### 6 EIGENVALUES AND EIGENVECTORS

6 EIGENVALUES AND EIGENVECTORS INTRODUCTION TO EIGENVALUES 61 Linear equations Ax = b come from steady state problems Eigenvalues have their greatest importance in dynamic problems The solution of du/dt

### Notes on Vector Calculus. Dinakar Ramakrishnan

Notes on Vector Calculus Dinakar Ramakrishnan March 26, 27 Chapter 1 Subsets of Euclidean space, vector fields, and continuity Introduction The aims of this course are the following: (i) Extend the main

### 4 ORTHOGONALITY ORTHOGONALITY OF THE FOUR SUBSPACES 4.1

4 ORTHOGONALITY ORTHOGONALITY OF THE FOUR SUBSPACES 4.1 Two vectors are orthogonal when their dot product is zero: v w = orv T w =. This chapter moves up a level, from orthogonal vectors to orthogonal

### (x 1, y 1 ) = (x 2, y 2 ) if and only if x 1 = x 2 and y 1 = y 2.

1. Complex numbers A complex number z is defined as an ordered pair z = (x, y), where x and y are a pair of real numbers. In usual notation, we write z = x + iy, where i is a symbol. The operations of

### 1 Lyapunov theory of stability

M.Kawski, APM 581 Diff Equns Intro to Lyapunov theory. November 15, 29 1 1 Lyapunov theory of stability Introduction. Lyapunov s second (or direct) method provides tools for studying (asymptotic) stability

### Note: Every graph is a level set (why?). But not every level set is a graph. Graphs must pass the vertical line test. (Level sets may or may not.

Curves in R : Graphs vs Level Sets Graphs (y = f(x)): The graph of f : R R is {(x, y) R y = f(x)} Example: When we say the curve y = x, we really mean: The graph of the function f(x) = x That is, we mean

### A LITTLE REAL ANALYSIS AND TOPOLOGY

A LITTLE REAL ANALYSIS AND TOPOLOGY 1. NOTATION Before we begin some notational definitions are useful. (1) Z = {, 3, 2, 1, 0, 1, 2, 3, }is the set of integers. (2) Q = { a b : aεz, bεz {0}} is the set

### Dot Products, Transposes, and Orthogonal Projections

Dot Products, Transposes, and Orthogonal Projections David Jekel November 13, 2015 Properties of Dot Products Recall that the dot product or standard inner product on R n is given by x y = x 1 y 1 + +

### Physics 6010, Fall 2016 Constraints and Lagrange Multipliers. Relevant Sections in Text:

Physics 6010, Fall 2016 Constraints and Lagrange Multipliers. Relevant Sections in Text: 1.3 1.6 Constraints Often times we consider dynamical systems which are defined using some kind of restrictions

### Nonlinear Programming (NLP)

Natalia Lazzati Mathematics for Economics (Part I) Note 6: Nonlinear Programming - Unconstrained Optimization Note 6 is based on de la Fuente (2000, Ch. 7), Madden (1986, Ch. 3 and 5) and Simon and Blume

### 1 Vectors and the Scalar Product

1 Vectors and the Scalar Product 1.1 Vector Algebra vector in R n : an n-tuple of real numbers v = a 1, a 2,..., a n. For example, if n = 2 and a 1 = 1 and a 2 = 1, then w = 1, 1 is vector in R 2. Vectors

### In English, this means that if we travel on a straight line between any two points in C, then we never leave C.

Convex sets In this section, we will be introduced to some of the mathematical fundamentals of convex sets. In order to motivate some of the definitions, we will look at the closest point problem from

### Review for the Final Exam

Math 171 Review for the Final Exam 1 Find the limits (4 points each) (a) lim 4x 2 3; x x (b) lim ( x 2 x x 1 )x ; (c) lim( 1 1 ); x 1 ln x x 1 sin (x 2) (d) lim x 2 x 2 4 Solutions (a) The limit lim 4x

### 1. General Vector Spaces

1.1. Vector space axioms. 1. General Vector Spaces Definition 1.1. Let V be a nonempty set of objects on which the operations of addition and scalar multiplication are defined. By addition we mean a rule

### Chapter Two Elements of Linear Algebra

Chapter Two Elements of Linear Algebra Previously, in chapter one, we have considered single first order differential equations involving a single unknown function. In the next chapter we will begin to

### Linear Algebra Notes. Lecture Notes, University of Toronto, Fall 2016

Linear Algebra Notes Lecture Notes, University of Toronto, Fall 2016 (Ctd ) 11 Isomorphisms 1 Linear maps Definition 11 An invertible linear map T : V W is called a linear isomorphism from V to W Etymology:

### CHAPTER 7. Connectedness

CHAPTER 7 Connectedness 7.1. Connected topological spaces Definition 7.1. A topological space (X, T X ) is said to be connected if there is no continuous surjection f : X {0, 1} where the two point set

### (a) For an accumulation point a of S, the number l is the limit of f(x) as x approaches a, or lim x a f(x) = l, iff

Chapter 4: Functional Limits and Continuity Definition. Let S R and f : S R. (a) For an accumulation point a of S, the number l is the limit of f(x) as x approaches a, or lim x a f(x) = l, iff ε > 0, δ

### M311 Functions of Several Variables. CHAPTER 1. Continuity CHAPTER 2. The Bolzano Weierstrass Theorem and Compact Sets CHAPTER 3.

M311 Functions of Several Variables 2006 CHAPTER 1. Continuity CHAPTER 2. The Bolzano Weierstrass Theorem and Compact Sets CHAPTER 3. Differentiability 1 2 CHAPTER 1. Continuity If (a, b) R 2 then we write

### Optimization Theory. A Concise Introduction. Jiongmin Yong

October 11, 017 16:5 ws-book9x6 Book Title Optimization Theory 017-08-Lecture Notes page 1 1 Optimization Theory A Concise Introduction Jiongmin Yong Optimization Theory 017-08-Lecture Notes page Optimization

### 2.5 The Fundamental Theorem of Algebra.

2.5. THE FUNDAMENTAL THEOREM OF ALGEBRA. 79 2.5 The Fundamental Theorem of Algebra. We ve seen formulas for the (complex) roots of quadratic, cubic and quartic polynomials. It is then reasonable to ask:

### Math 215 HW #9 Solutions

Math 5 HW #9 Solutions. Problem 4.4.. If A is a 5 by 5 matrix with all a ij, then det A. Volumes or the big formula or pivots should give some upper bound on the determinant. Answer: Let v i be the ith

### Orthogonality. 6.1 Orthogonal Vectors and Subspaces. Chapter 6

Chapter 6 Orthogonality 6.1 Orthogonal Vectors and Subspaces Recall that if nonzero vectors x, y R n are linearly independent then the subspace of all vectors αx + βy, α, β R (the space spanned by x and

### Suppose that f is continuous on [a, b] and differentiable on (a, b). Then

Lectures 1/18 Derivatives and Graphs When we have a picture of the graph of a function f(x), we can make a picture of the derivative f (x) using the slopes of the tangents to the graph of f. In this section

### EC /11. Math for Microeconomics September Course, Part II Lecture Notes. Course Outline

LONDON SCHOOL OF ECONOMICS Professor Leonardo Felli Department of Economics S.478; x7525 EC400 20010/11 Math for Microeconomics September Course, Part II Lecture Notes Course Outline Lecture 1: Tools for

### HOMEWORK PROBLEMS FROM STRANG S LINEAR ALGEBRA AND ITS APPLICATIONS (4TH EDITION)

HOMEWORK PROBLEMS FROM STRANG S LINEAR ALGEBRA AND ITS APPLICATIONS (4TH EDITION) PROFESSOR STEVEN MILLER: BROWN UNIVERSITY: SPRING 2007 1. CHAPTER 1: MATRICES AND GAUSSIAN ELIMINATION Page 9, # 3: Describe

### 4.1 Analysis of functions I: Increase, decrease and concavity

4.1 Analysis of functions I: Increase, decrease and concavity Definition Let f be defined on an interval and let x 1 and x 2 denote points in that interval. a) f is said to be increasing on the interval

### II. DIFFERENTIABLE MANIFOLDS. Washington Mio CENTER FOR APPLIED VISION AND IMAGING SCIENCES

II. DIFFERENTIABLE MANIFOLDS Washington Mio Anuj Srivastava and Xiuwen Liu (Illustrations by D. Badlyans) CENTER FOR APPLIED VISION AND IMAGING SCIENCES Florida State University WHY MANIFOLDS? Non-linearity

### Solutions to Homework #3, Math 116

Solutions to Homework #, Math 6 Keziah Cook and Michael McElroy November 5, Problem Goroff) In each of the following cases, determine the supremum of f over its domain D. If there are points x D for which

### CHAPTER 0 PRELIMINARY MATERIAL. Paul Vojta. University of California, Berkeley. 18 February 1998

CHAPTER 0 PRELIMINARY MATERIAL Paul Vojta University of California, Berkeley 18 February 1998 This chapter gives some preliminary material on number theory and algebraic geometry. Section 1 gives basic

### Linear Algebra Primer

Linear Algebra Primer David Doria daviddoria@gmail.com Wednesday 3 rd December, 2008 Contents Why is it called Linear Algebra? 4 2 What is a Matrix? 4 2. Input and Output.....................................

### Symmetric matrices and dot products

Symmetric matrices and dot products Proposition An n n matrix A is symmetric iff, for all x, y in R n, (Ax) y = x (Ay). Proof. If A is symmetric, then (Ax) y = x T A T y = x T Ay = x (Ay). If equality

### Course Notes for EE227C (Spring 2018): Convex Optimization and Approximation

Course Notes for EE7C (Spring 018): Convex Optimization and Approximation Instructor: Moritz Hardt Email: hardt+ee7c@berkeley.edu Graduate Instructor: Max Simchowitz Email: msimchow+ee7c@berkeley.edu February

### Linear Algebra Practice Problems

Linear Algebra Practice Problems Math 24 Calculus III Summer 25, Session II. Determine whether the given set is a vector space. If not, give at least one axiom that is not satisfied. Unless otherwise stated,

### Math Camp Lecture 4: Linear Algebra. Xiao Yu Wang. Aug 2010 MIT. Xiao Yu Wang (MIT) Math Camp /10 1 / 88

Math Camp 2010 Lecture 4: Linear Algebra Xiao Yu Wang MIT Aug 2010 Xiao Yu Wang (MIT) Math Camp 2010 08/10 1 / 88 Linear Algebra Game Plan Vector Spaces Linear Transformations and Matrices Determinant

### MATH 369 Linear Algebra

Assignment # Problem # A father and his two sons are together 00 years old. The father is twice as old as his older son and 30 years older than his younger son. How old is each person? Problem # 2 Determine

### Functions of Several Variables

Functions of Several Variables Extreme Values Philippe B Laval KSU April 9, 2012 Philippe B Laval (KSU) Functions of Several Variables April 9, 2012 1 / 13 Introduction In Calculus I (differential calculus

### Math 396. Bijectivity vs. isomorphism

Math 396. Bijectivity vs. isomorphism 1. Motivation Let f : X Y be a C p map between two C p -premanifolds with corners, with 1 p. Assuming f is bijective, we would like a criterion to tell us that f 1

### Convex Sets with Applications to Economics

Convex Sets with Applications to Economics Debasis Mishra March 10, 2010 1 Convex Sets A set C R n is called convex if for all x, y C, we have λx+(1 λ)y C for all λ [0, 1]. The definition says that for

### Resolution of Singularities in Algebraic Varieties

Resolution of Singularities in Algebraic Varieties Emma Whitten Summer 28 Introduction Recall that algebraic geometry is the study of objects which are or locally resemble solution sets of polynomial equations.