Optimization Theory. A Concise Introduction. Jiongmin Yong


 Adela Stanley
 10 months ago
 Views:
Transcription
1 October 11, :5 wsbook9x6 Book Title Optimization Theory Lecture Notes page 1 1 Optimization Theory A Concise Introduction Jiongmin Yong
2 Optimization Theory Lecture Notes page
3 Optimization Theory Lecture Notes page iii Contents 1. Mathematical Preparations 5 1 Basics in R n Some Results of Linear Algebra Functions: Limits and Continuity Differentiation Optimization Problems and Existence of Optimal Solutions 47 1 Optimization Problems Some Examples of Optimization Problems Existence of Optimal Solutions A Constructive Method Necessary and Sufficient Conditions of Optimal Solutions 71 1 Unconstrained Problems Problems with Equality Constraints Problems with Equality and Inequality Constraints Problems without Regularity of the Constraints Problems with Convexity and QuasiConvexity Conditions Convex Sets and Convex Functions Optimization Problems under Convexity Conditions Lagrange Duality QuasiConvexity and Related Optimization Problems Linear Programming Standard and Canonical Forms iii
4 Optimization Theory Lecture Notes page 4 4 Optimization Theory A Concise Introduction Geometric Considerations and the Fundamental Theorem of Linear Programming The Simplex Method General consideration Phase II Phase I Endless cycling Sensitivity Analysis Duality Theory The Dual Simplex and the Primal Dual Methods
5 Optimization Theory Lecture Notes page 5 Chapter 1 Mathematical Preparations In this chapter, we will briefly present some basic results of advanced calculus (analysis) and linear algebra, which will be used in the later chapters. We will mainly concentrate on the definitions and statements of relevant results, with short proofs. Lengthy proofs will be omitted, and they can be found in standard textbooks of analysis and linear algebra. Also, we do not try to be exhaustive. Two types of readers can skip this chapter: Those who have solid knowledge of analysis and linear algebra, and those who are only interested in computational aspects of optimization theory. 1 Basics in R n Let R be the sets of all real numbers. For any n 1, we define { x 1 R n =. } xi R, i = 1,,, n, x n and identify R 1 = R. Elements in R n are called vectors and briefly denoted by x, y, z, etc., i.e., x = x 1. x n, y = y 1. y n, z = z 1. z n. For notational convenience and presentation consistency, we will let all vectors in R n all be column vectors, and denote (x 1,, x n ) = x 1. x n, 5
6 Optimization Theory Lecture Notes page 6 6 Optimization Theory A Concise Introduction call it a row vector, with the superscript being called the transpose. Now, let us introduce some binary relations between two vectors. For any x (x 1,, x n ), y (y 1,, y n ) R n, we write x = y, if x i = y i, i = 1,,, n, x y, if x i y i, i = 1,,, n, x > y, if x i > y i, i = 1,,, n. Note that when n = 1, for any x, y R, one must have either x y, or y x. (1.1) We refer to the relation an order in R. Further, we can refine the above as follows: For any x, y R, one and only one of the following must be true: x = y, x > y, y > x. (1.) However, if n, there are x, y R n for which none of (1.) holds. For example, for x = (1, 0) and y = (0, 1), none of relations in (1.1) holds. Hence, for the case n, we usually refer to the relation as a partial order, since it only gives relations to some pairs of vectors. Next, we define R n + = {x R n x 0}, R n ++ = {x R n x > 0}, which are called nonnegative and strictly positive orthants of R n, respectively. It is clear that x = y, x y and y x. Here, means if and only if. Also, we define x y, if y x, x < y, if y > x. Let us look at some basics on the sets in R n. If A is a set in R n consisting of vectors x R n satisfying certain property, denoted by (P), then we write For example, A = { x R n x satisfies (P) }. A = {x R x 0}. (1.3) If A is a set in R n, and a vector x is an element of A, we denote x A, and say x belongs to A, or x is in A, otherwise, we denote x / A, and say x is not in A. For example, if A is defined by (1.3), then ( ) ( ) 1 1 A, / A. 1 1
7 Optimization Theory Lecture Notes page 7 Mathematical Preparations 7 If A and B are two sets in R n such that any elements in A is in B, we call A a subset of B, denoted by A B. If A B and there is at least one element which is in B but not in A, then A is called a proper subset of B, denoted by A B. Two sets are equal if A B and B A. The set that contains no element is called the empty set, denoted by. Let A λ be a family of sets in R n with λ Λ, where Λ is an index set which could be a finite set or an infinite set. We define { A λ x R } n x A λ, for some λ Λ, λ Λ { A λ x R } n x A λ, for all λ Λ, λ Λ and they are called the union and intersection of A λ (λ Λ), respectively. Also, for any A, B R n, we define A \ B {x A x / B}, which is called A minus B. As a special case, we denote B c = R n \ B, which is called the complementary of B. It is clear that We have the following result. A B B c A c. Proposition 1.1. (de Morgan s Law) Let {A λ, λ Λ} be a family of sets in R n. Then ( ) c ( ) c A λ = A c λ, A λ = A c λ. (1.4) λ Λ λ Λ Proof. Look at the following: ( x λ Λ A λ)c x / λ Λ λ Λ x A c λ, λ Λ x λ Λ A c λ, λ Λ A λ x / A λ, λ Λ proving the first relation in (1.4). Similarly, we can prove the second one, which is left to the readers. We now introduce two operations: Addition: For any x = (x 1,, x n ), y = (y 1,, y n ) R n, define x + y = (x 1 + y 1,, x n + y n ). (1.5)
8 Optimization Theory Lecture Notes page 8 8 Optimization Theory A Concise Introduction Scalar multiplication: For any x = (x 1,, x n ) R n and λ R, define λx = (λx 1,, λx n ). (1.6) The above are called linear operations (or algebraic operations ) on R n. Inspired by the above, we introduce some abstract notions which will give us a better view on more general problems. Definition 1.. A nonempty set X is called a linear space (over R) if on X, two operations are defined: one is called addition: (x, y) x + y X, x, y X, and the other is called scalar multiplication: (λ, x) λx X, λ R, x X. These operations satisfy the following eight axioms: (i) For any x, y X, x + y = y + x; (ii) For any x, y, z X, (x + y) + z = x + (y + z); (iii) There exists a unique element called zero in X, denoted by 0, such that x + 0 = 0 + x = x, for all x X; (iv) For any x X, there exists a unique y X such that x + y = y + x = 0. Such an y is denoted by x; (v) For any x, y X and λ R, λ(x + y) = λx + λy; (vi) For any λ, µ R and x X, (λ + µ)x = λx + µx; (vii) For any x X, 1x = x; (viii) For any λ, µ R and x X, (λµ)x = λ(µx). A linear space is also called a vector space. space is called a vector. Any element in a linear As an important example, we have that R n is a linear space under the addition and scalar multiplication defined by (1.5) and (1.6) 1. If X = {0}, we call it the zero linear space whose structure is trivial. If a linear space X {0}, we call it a nonzero linear space. To study the 1 There are many other linear spaces, besides R n, for examples, the set of all (n m) matrices, the set of all polynomials, the set of all continuous functions, to mention a few.
9 Optimization Theory Lecture Notes page 9 Mathematical Preparations 9 structure of a nonzero linear space X (which could be R n ), we introduce the following important notions. Definition 1.3. Let X be a nonzero linear space over R. (i) A set {ξ 1, ξ,, ξ k } X of finitely many vectors is said to be linearly dependent if there are constants λ 1,, λ k R, at least one of them is nonzero, such that k λ 1 ξ 1 + λ ξ + + λ k ξ k λ i ξ i = 0. (1.7) Otherwise, these vectors are said to be linearly independent. The left hand side of (1.7) is called a linear combination of ξ 1,, ξ k. (ii) A set {ξ 1,, ξ k } X is called a basis of X if they are linearly independent and for any x X, there are constants λ 1,, λ k R such that k x = λ i ξ i. (1.8) i=1 i=1 (iii) A subset X 0 X is called a (linear) subspace of X if λx + µy X 0, x, y X 0, λ, µ R. For any linear space X, there are two trivial subspaces: X and {0}. Other subspaces are called proper subspaces. The following result is fundamentally important. Proposition 1.4. Let X be a nonzero linear space over R. (i) Let ξ 1,, ξ k X. Then the span of {ξ 1,, ξ k } defined by { k } span {ξ 1,, ξ k } = λ i ξ i λ i R, 1 i k, is a linear subspace of X. i=1 (ii) If X 0 {0} is a subspace of X, then there is a set {ξ 1,, ξ k } X 0 of linearly independent vectors such that X 0 = span {ξ 1,, ξ k }. (1.9) In this case, {ξ 1,, ξ k } must be a basis of X 0. Further, if {η 1,, η l } is another basis of X 0, then it must be true that l = k. (iii) If {ξ 1,, ξ k } is a basis of X, then any vector x X admits a unique representation of form (1.8).
10 Optimization Theory Lecture Notes page Optimization Theory A Concise Introduction Because of (ii) in Proposition 1.4, we call k the dimension of X, denoted by dim X = k. This is the maximum possible number of linearly independent vectors in the space X. If we let e i R n be the vector with the ith component being 1 and all other components being zero, then {e 1,, e n } is a basis of R n, which is called the canonical basis of R n. From this, we see that dim R n = n. Note that to find a basis for a nonzero linear space X, one can start from any nonzero vector, call it ξ 1. If any other vector in X is a multiple of ξ 1, we are done and {ξ 1 } is a basis of X. Otherwise, one can find a vector ξ X which is not a multiple of ξ 1. Then ξ 1 and ξ have to be linearly independent. If any vector in X is a linear combination of ξ 1 and ξ, we are done and {ξ 1, ξ } is a basis of X. Otherwise, we can continue the above procedure, and eventually, we will find a basis of X. If the above procedure stops at some finite step, i.e., dim X = k for some k, we say that X is a finitedimensional space. Otherwise, X is called an infinitedimensional space. Note that for a given linear space, the basis is not unique. From the above discussion, we see that thanks to the linear operations of R n and the notion of basis, the structure of any subspace X 0 (including R n itself) of R n becomes very simple: As long as a basis {ξ 1,, ξ k } of X 0 is found, X 0 can be represented by (1.9). We refer to the above described as the linear structure (or algebraic structure) of R n. Next, on R n, we introduce two more notions: Dot product: For any x = (x 1,, x n ), y = (y 1,, y n ) R n, let n x y x 1 y 1 + x y + + x n y n x i y i. (1.10) Euclidean norm: For any x = (x 1,, x n ) R n, define ( n x = x i ) 1. (1.11) More generally, we introduce the following abstract notions. i=1 Definition 1.5. Let X be a linear space over R. (i) A binary operation, denoted by (x, y) x y from X X to R, is called an inner product if the following are satisfied: For example, the set of all continuous functions defined on, say, [0, 1], is an infinitedimensional linear space. i=1
11 Optimization Theory Lecture Notes page 11 Mathematical Preparations 11 (a) positivity: For any x X, x x 0, and x x = 0 if and only if x = 0; (b) symmetry: For any x, y X, x y = y x; (c) linearity: For any x, y, z X, and λ, µ R, (λx + µy) z = λ(x z) + µ(y z). When a linear space X admits an inner product, it is called an inner product space. (ii) A map x x from X to R is called a norm if the following are satisfied: (a) positivity: For any x X, x 0 and x = 0 if and only if x = 0; (b) positive homogeneity: For any λ R and x X, λx = λ x ; (c) triangle inequality: For and x, y X and x + y x + y. When a linear space X admits a norm, it is called a normed linear space. The following proposition reveals some relations between inner product and norm. Proposition 1.6. Let X be an inner product space. (i) (Cauchy Schwarz inequality) For any x, y X, it holds x y (x x)(y y). (1.1) (ii) The map x x defined by the following: x = x x, x X is a norm on X, under which X is a normed linear space. In this case is called the norm induced by the inner product. Note that a norm is not necessarily induced by an inner product. Proof. (i) First of all, if y = 0, (1.1) is trivially true. Now, let y 0. For any λ R, we have 0 (x + λy) (x + λy) = (x x) + (x y)λ + (y y)λ f(λ). In particular, Hence, (1.1) follows. ( 0 f x y ) (x y) = (x x) y y (y y).
12 Optimization Theory Lecture Notes page 1 1 Optimization Theory A Concise Introduction The proof of (ii) is left to the readers. From the above, we see that the Euclidean norm defined by (1.11) is a norm on R n, which is induced by the dot product defined by (1.10), and R n is a inner product space under the dot product and a normed linear space under. In what follows, we call R n a Euclidean space if the linear operations are defined by (1.5) (1.6), and the inner product and the norm are defined by (1.10) (1.11). Having the norm in a linear space X, we can define the distance between two vectors x, y X by x y. We call x y the Euclidean distance between x, y R n, which is a natural generalization of the usual distances on the line, on the plane, and in the 3dimensional space. Clearly, x is nothing but the distance of the vector x to the zero vector 0 = (0,, 0), which can also be called the length of the vector x. Note that when n = 1, x is nothing but the absolute value of x R: { x, x 0, x = x, x < 0. A vector x in a normed linear space X is called a unit vector if x = 1. Clearly, a vector x in a normed linear space is nonzero if and only if x > 0. From the Cauchy Schwarz inequality, we can define the angle θ [0, π] between two nonzero vectors x and y in an inner product space X through the following: cos θ = x y x y. Then two vectors x, y X are said to be orthogonal, denoted by x y, if x y = 0 (which is equivalent to cos θ = 0 with θ being the angle between these two vectors). For any finitedimensional inner product space X, if {ξ 1,, ξ k } is a basis of X such that { 1, i = j, ξ i ξ j = 0, i j, which means that {ξ 1,, ξ k } is a set of mutually orthogonal unit vectors, we call {ξ 1,, ξ k } an orthonormal basis of X. It is clear that {e 1,, e n } is an orthonormal basis of R n under the dot product. Note that for a given inner product space, the orthonormal basis is not unique. The following result provides some facts about the orthogonality. Proposition 1.7. Let X be an inner product space.
13 Optimization Theory Lecture Notes page 13 Mathematical Preparations 13 (i) Suppose G is a nonempty subset of X. Then the annihilator G of G defined by G {y X y x = 0, x G} is a subspace of X, and { } (G ) = span (G) = λ i ξ i ξ i G, λ i R, i 1 G. (1.13) and i 1 (ii) If G 1 G X, then (iii) If G is a subspace of X, then G 1 G. (1.14) (G ) = G, (1.15) X = G + G {x + y x G, y G }, G G = {0}. (1.16) The proof is left to the readers. Note that by definition, one has Thus, we could simply write x y, x G, y G. When the two properties in (1.16) hold, we write G G. (1.17) X = G G, and call it an orthogonal decomposition of X. Hence, in the case G is a subspace of X, we call G the orthogonal complementary of G. To be specific, in the rest of this subsection, we will only consider Euclidean space R n. Now, we introduce the following definition. Proposition 1.8. (i) The open ball B r (x) and the closed ball Br (x) centered at x with radius r are defined by the following: { B r (x) = y R } { n y x < r, Br (x) = y R } n y x r ; (ii) A set G R n is called an open set if for any x G, there exists a δ > 0 such that B δ (x) G. (ii) A set G R n is called a closed set if G c R n \ G is open.
14 Optimization Theory Lecture Notes page Optimization Theory A Concise Introduction (iii) The interior G of a set G R n is the largest open set that is contained in G; the closure Ḡ of a set G Rn is the smallest closed set that contains G; the boundary G of G is defined as follows: G = Ḡ G c. (iv) G is called a bounded set if there exists a constant K such that G B K (0); G is called a compact set if it is bounded and closed 3. (v) G is said to be connected if there are no nonempty subsets G 1, G G such that G = G 1 G, Ḡ 1 G =, G 1 Ḡ =. (vi) G is called a domain if it is open and connected. Note that the dot product leads to the norm, the distance, and the notion of open balls, then leads to the open sets in R n (and hence closed sets, bounded sets, compact sets, etc.). Anything related to open sets, distance, and so on, is referred to as a topological property. Therefore, the dot product determines the topological structure of R n. Now, we consider sequences in R n. The most important notion for sequences is the following: Proposition 1.9. A sequence {x k } k 1 R n is convergent to x R n, denoted by x k x or lim x k = x, if for any ε > 0, there exists a K 1 k (depending on ε > 0) such that x k x < ε, k K. In this case, x is called the limit of the sequence {x k } k 1. The following proposition collects relevant results concerning the sequences in R n, whose proof is left to the readers. Proposition Let {x k } k 1 be a sequence in R n. Then the following statements are equivalent: (i) {x k } k 1 is convergent; (ii) {x k } k 1 is a Cauchy sequence, i.e., for any ε > 0, there exists a K 1 (depending on ε > 0) such that x k x l < ε, k, l K. (iii) Every subsequence of {x k } k 1 is convergent. (iv) For each i = 1,,, n, the sequence {x i k } k 1 is convergent, where x k = (x 1 k,, xn k ). 3 This definition only works for finitedimensional normed linear space.
15 Optimization Theory Lecture Notes page 15 Mathematical Preparations 15 For a sequence {x k } k 1, a subsequence, denoted by {x kj } j 1, is a sequence whose terms are selected from {x k } k 1. For example, one can choose k j = j, then {x kj } = {x j } j 1 = {x, x 4, }. In general, for any strictly increasing map σ : {1,, } {1,, }, {x σ(j) } j 1 gives a subsequence of {x k } k 1. Note that by the above result, if in a sequence {x k } k 1, one can find two subsequences which converge to two different limits, then the original sequence is not convergent. An easy example is x k = ( 1) k, k 1. Also, one sees that if a sequence {x k } k 1 is convergent, the limit must be unique. The following result is useful when one wants to prove a set to be closed. Proposition Let G R n. Then G is closed if and only if for any convergent sequence {x k } G, the limit x G. Now, let us say a little bit more on the case n = 1. Recall that on R, we have an order determined by (or ). This order enables us to define the following notion which will play a fundamental role in the optimization theory. Definition 1.1. Let G R. (i) A real number a inf G R is called the infimum (also called the greatest lower bound) of G if { x a, x G, ε > 0, x G, such that x < a + ε. In the case that inf G G, we call inf G the minimum of G, denote it by min G. (ii) A real number b sup G R is called the supremum (also called the least upper bound) of G if { x b, x G, ε > 0, x G, such that x > b ε. In the case that sup G G, we call sup G the maximum of G, denote it by max G. We have the following basic result concerning the supremum and the infimum. Proposition Let G R be bounded. Then inf G and sup G uniquely exist. Moreover, there are sequences {x k } k 1, {y k } k 1 G such that lim x k = inf G, lim y k = sup G. k k
16 Optimization Theory Lecture Notes page Optimization Theory A Concise Introduction Further, if G is closed (and hence it is compact), then sup G = max G G, inf G = min G G. In the above case, we call {x k } k 1 and {y k } k 1 a minimizing sequence and a maximizing sequence, respectively. The proof of the existence of the supremum and infimum is much more involved, for which we prefer not to get into details. However, the proof of the existence of maximizing and minimizing sequences easily follows the definition of the supremum and infimum, together with the following proposition. Proposition Let {x k } k 1 R be a sequence. (i) If x k is bounded from below and nonincreasing, i.e. for some M > 0, then x k converges to inf k 1 x k. x k M, x k x k+1, k 1, (ii) If x k is bounded from above and nondecreasing, i.e. for some M > 0, then x k converges to sup x k. k 1 x k M, x k x k+1, k 1, The following result characterizes compact sets. Proposition (Bolzano Weierstrass) Let G R n. Then G is compact, i.e., G is bounded and closed, if and only if any sequence {x k } G admits a subsequence which is convergent to some x G. Now, let {x k } k 1 be a bounded sequence in R. For any l 1, the tail sequence {x k } k l of {x k } k 1 is also bounded. Thus, by Proposition 1.13, y l inf k l x k, z l sup x k k l exist. Moreover, it is ready to see that {y l } l 1 is bounded and nondecreasing, and {z l } l 1 is bounded and nonincreasing. Therefore, by Proposition 1.14, the following limits exist: lim x k lim y l lim inf x k, k l l k l lim x k lim z l lim sup x k. k l l k l
17 Optimization Theory Lecture Notes page 17 Mathematical Preparations 17 They are called the limit inferior (liminf, for short) and limit superior (limsup, for short) of sequence {x k } k 1, respectively. We have the following simple and interesting result. Proposition For any bounded sequence {x k } k 1 R, lim x k and k lim x k exist. Moreover, if x is any limit point of {x k } k 1 (i.e., there exists k a subsequence {x kj } j 1 of {x k } k 1 such that x kj x), then Further, lim x k x lim x k. k k lim x k exists lim x k = lim x k. k k k From the above, we see that for any bounded sequence {x k } k 1, if K is the set of all limit points of the sequence, then lim x k = inf K, k lim x k = max K. k Exercises 1. Let A and B be given by the following. Calculate A B, A B, A \ B and B \ A: (i) A = [0, ] and B = [0, 1); (ii) A = {1,, 3}, B = {a, b, c}; (iii) A = {x R x 0}, B = {x R x > 0}; (iv) A = {a + b a, b Q}, B = {a + b 3 a, b Q}, where Q is the set of all rational numbers.. Prove the following: ( 3. Let λ Λ ) c A λ = A c λ. A = {a + b { a + b a, b Q}, B = c + d a, b, c, d Q, c + d 0 }. Prove or disprove A = B. λ Λ
18 Optimization Theory Lecture Notes page Optimization Theory A Concise Introduction 4. Let ξ 1,, ξ k R n. Show that { k } span {ξ 1,, ξ k } α i ξ i αi R, 1 i k is a linear subspace of R n. 5. Let ξ 1 = (0, 1, 1) and ξ = (1, 0, 0). Find span {ξ 1, ξ }. i=1 6. Determine linear independence of each given set of vectors: (i) ξ 1 = (1, 1, 0), ξ = (1, 0, 1), ξ 3 = (0, 1, 1) ; (ii) η 1 = (1, 1, 1), η = (, 0, ), η 3 = (0, 1, 0). 7. Define ( n x p = i=1 x i p) 1 p, 1 p <, x = max 1 i n x i, Show that p, 1 p, are norms on R n. x R n. 8. Let p be defined as above. Show that for any p 1, p [1, ], there is a constant K(p 1, p ) such that x p1 K(p 1, p ) x p, x R n. What can you say about this result? 9. Prove Proposition For G R n defined below, find Ḡ and G : (i) n = 1, G = {1,, 3, 4}; (ii) n =, G = {(x, y) x + y = 1}; (iii) n = 3, G = {(x, y, z) R 3 x + y + z < 1}. 11. Define sequence {x k } k 1 as below. Calculation lim x k and lim x k. k k Identify if the sequence is convergent, given your reason(s): (i) x k = ( 1)k k, k 1; (ii) x k = + ( 1) k, k 1; (iii) x k = sin kπ, k 1.
19 Optimization Theory Lecture Notes page 19 Mathematical Preparations Let G be given by the following. Find supremum, infimum, maximum and minimum. (i) G = {x [0, 1] x is irrational}; (ii) G = { 1 k k N}; (iii) G = {1 + ( 1)k k k N}; (iv) G = {x [0, π] sin x > 1 }. Some Results of Linear Algebra In this section, we briefly present some results from linear algebra. First of all, we recall that an (m n) matrix A is defined to be the following arrays: a 11 a 1 a 1n a 1 a a n A =.... (.1) a m1 a m a mn We also call the above A as a matrix of order (m n). Sometimes, we use notation A = (a ij ) when the order is clear. The set of all (m n) matrices is denoted by R m n. Two matrices A = (a ij ) and B = (b ij ) are equal if and only if they have the same order and a ij = b ij for all i and j within their ranges. When m = n, A is called a square matrix. There are two special matrices: the identity matrix I and the zero matrix 0 which are defined by the following: I =......, 0 = Sometimes, we use I n to represent the (n n) identity matrix, indicating the size of the matrix. Also, zero matrix does not have to be square. On R m n, we define addition and scalar multiplication as follows: If A = (a ij ), B = (b ij ) R m n, and λ R, then A + B = (a ij + b ij ), λa = (λa ij ). (.) One can show that R m n is a linear space under the above defined addition and scalar multiplication (see Definition 1.). Obviously, R m n is quite
20 Optimization Theory Lecture Notes page 0 0 Optimization Theory A Concise Introduction different from R n. But, as far as linear spaces are concerned, they have the same nature. If for any 1 i m, 1 j n, we let E(i, j) R m n be the matrix that the entry at (i, j) position is 1 and all other entries are zero, then {E(i, j) 1 i m, 1 j n} form a basis of R m n. Hence, Actually, we have A (a ij ) = m i=1 j=1 dim R m n = mn. n a ij E(i, j), A (a ij ) R m n. In what follows, E(i, j) might be defined in different R m n and whose order (m n) can be identified from the context. Next, for A = (a ij ) R m n given by (.1), we define its transpose A R n m by the following: a 11 a 1 a m1 A a 1 a a m =.... (.3) a 1n a 1n a mn Thus, A and A have different orders unless m = n. When A R n n, and A = A, it is called a symmetric matrix. The set of all symmetric matrices of order (n n) is denoted by S n. Also, for any square matrix A = (a ij ) R n n, we define n tr (A) = a ii, (.4) which is called the trace of A. Any A = (a ij ) R m n has n columns which are called the column vectors of A (all of them are in R m ). Likewise, A has m rows which are called the row vectors of A (whose transpose are the column vectors of A and belong to R n ). On the other hand, any vector in R n can be regarded as an (n 1) matrix, and any m vectors in R n can form an (n m) matrix. Such an observation is very useful. Next, for A R m n and B R n l given by a 11 a 1 a 1n b 11 b 1 b 1l a 1 a a n A =..., B = b 1 b b l..., a m1 a m a mn b n1 b n b nl i=1
21 Optimization Theory Lecture Notes page 1 Mathematical Preparations 1 we define the product AB = (c ij ) R m l of A and B with the entries c ij given by the following: n c ij = a ik b kj, 1 i m, 1 j l. k=1 In particular, regarding any x, y R n as x, y R n 1, we see that n x y = x k y k = x y. k=1 Hereafter, in R n, we will identify x y with x y. Note that in order the product AB makes sense, the number of columns of A should be equal to the number of rows of B. Thus, when AB is defined, BA is not necessarily define. Further, if both AB and BA are all defined, they may have different orders, and even if AB and BA have the same order, we may still not necessarily have AB = BA. Also, it is interesting that as long as AB is defined, B A will also be defined and (AB) = B A. Next, in the case A R n n, sometimes there exists a B R n n such that AB = BA = I. When this happens, we say that A is invertible (or nonsingular), and in this case, one can show that the matrix B satisfying the above must be unique. Hence, we denote such a B by A 1 which is called the inverse of A. We have the following result concerning the inverse of matrices. Proposition.1. (i) Let A R n n be invertible. Then so is A and (A ) 1 = (A 1 ). (ii) Let A, B R n n be invertible. Then so are AB and BA, and (AB) 1 = B 1 A 1. Next, we note that for any A, B R m n, the product AB R m m and A B R n n are always defined. We further have the following proposition. Proposition.. (i) Let A R m n and B R n m. Then tr [AB] = tr [BA]. (.5) (ii) The map (A, B) tr [A B] is an inner product on R m n. Consequently, ( ) 1 A = tr [A A], A R m n, (.6) defines a norm in R m n.
22 Optimization Theory Lecture Notes page Optimization Theory A Concise Introduction From the above, we see that under (A, B) tr [A B], R m n is an inner product space, and therefore, it is also a normed linear space. Further, one can directly check that {E(i, j) 1 i m, 1 j n} forms an orthonormal basis of R m n, under the abovedefined inner product. Next, for any A R m n, we introduce three elementary row operations: (i) Exchange the ith and the jth rows; (ii) Multiply the ith row by λ R, λ 0; and (iii) Add the µ multiple of the jth row to the ith row, µ R. We now translate these three operations into products of matrices. To this end, we recall the definition of E(i, j) R m m, 1 i, j m. Define three types of elementary matrices as follows: T 1 (i, j) = E(k, k) + E(i, j) + E(j, i), i j, k i,j T (i ; λ) = k i E(k, k) + λe(i, i), λ 0, T 3 (i, j ; µ) = I m + µe(i, j), i j. We see that T 1 (i, j) is the matrix obtain from I m by exchange the ith and the jth columns; T (i ; λ) is the matrix obtained from I m by replacing the ith diagonal 1 by λ; and T 3 (i, j ; µ) is the matrix obtained from I m by replacing the 0 entry at (i, j) position by µ R. Direct computations show that the products T 1 (i, j)a, T (i ; λ)a, and T 3 (i, j ; µ)a are exactly the three elementary row operations applied on A, respectively. Likewise, we may introduce elementary column operations, which can be achieved as follows: First make a transpose to the matrix, followed by an elementary row operation, then make a transpose back. We leave the details to the interested readers. Now, for a given A = (a ij ) R m n, let 1 i 1 < < i k m and 1 j 1 < < j l n. Then B = (b αβ ) R k l is called a submatrix of A where b αβ = a iαj β, 1 α k, 1 β l. When k = l, we call the above B a square submatrix of A. We now introduce an important notion for square matrices, which will be useful
23 Optimization Theory Lecture Notes page 3 Mathematical Preparations 3 below. For any A = (a ij ) R n n we define its determinant det(a) by the following (inductively): a 11, n = 1, det(a) = n (.7) ( 1) i+j a ij det(a ij ), n > 1, j=1 where A ij R (n 1) (n 1) is the submatrix of A obtained by deleting the ith row and the jth column of A. We also define adj (A) = ( ( 1) i+j det(a j i ) ). This is called the adjugate of A. One should note that the entry of adj (A) at (i, j) is ( 1) i+j det(a j i ) (not ( 1) i+j det(a ij )). The following proposition collects basic properties of determinants. Proposition.3. Let A, B R n n. Then (i) det(a ) = det(a); (ii) If two rows or two columns of A are the same, then det(a) = 0; (iii) If B is obtained by exchanging two rows (or two columns) of A, then det(b) = det(a); (iv) If B is obtained by adding a multiple of a row (or a column) to another row (column) of A, then det(b) = det(a). (v) det(ab) = det(a) det(b). (vi) A adj(a) = det(a)i. The following result presents a very interesting usage of determinant. Proposition.4. Let ξ 1,, ξ k R n and let A = (ξ 1,, ξ k ) R n k. Then ξ 1,, ξ k are linearly independent if and only if there exists a (k k) square submatrix B of A such that det(b) 0. In particular, if k = n, then the column vectors of A are linearly independent if and only if det(a) 0. In this case, A must be invertible and A 1 = 1 adj (A). (.8) det(a)
24 Optimization Theory Lecture Notes page 4 4 Optimization Theory A Concise Introduction By some straightforward calculations, we have det ( T 1 (i, j) ) = 1, det ( T (i ; λ) ) = λ, det ( T 3 (i, j ; µ) ) = 1. (.9) Therefore, by Proposition.4, T 1 (i, j), T (i ; λ) and T 3 (i, j ; µ) are all invertible, for any λ 0 and µ R. Actually, one has T 1 (i, j) 1 = T 1 (i, j), T (i ; λ) 1 = T (i ; λ 1 ), which are still elementary matrices. T 3 (i, j ; µ) 1 = T 3 (i, j ; µ), Now, we return to the product of matrices. As an important special case, for any A = (a ij ) R m n and x = (x 1,, x n ) R n, Ax makes sense: a 11 a 1 a 1n x 1 b 1 a 1 a a n x Ax =.... = b. = b Rm, a m1 a m a mn with b j = x n b m n a ik x k, 1 j m. k=1 Thus, matrix A R m n induces a map from R n to R m. Moreover, this map has the following property: A(λx + µy) = λax + µay, x, y R n, λ, µ R. (.10) The above property is referred to as the linearity. Hence, we say that the map induced by A (hereafter, it will be identified with A) is a linear map (or a linear transformation). Further, if we write A = (ξ 1,, ξ n ), ξ i R m, 1 i n, and x = (x 1,, x n ) R n, then Ax = n x i ξ i, i=1 which is a linear combination of ξ 1,, ξ n. We now introduce some more relevant notions. The kernel N (A) of a matrix A R m n is defined by N (A) = {x R } n Ax = 0. (.11)
25 Optimization Theory Lecture Notes page 5 Mathematical Preparations 5 The range R(A) of a matrix A R m n is defined by { R(A) = Ax x R n}. (.1) We have the following result. Proposition.5. (i) Let A R m n. Then N (A) and R(A) are linear subspaces of R n and R m, respectively. Moreover, (ii) Let A R n n. Then R(A) = N (A ), N (A) = R(A ). (.13) A 1 exists N (A) = {0} R(A) = R n det(a) 0 A = E 1 E, E k, with E l (1 l k) being elementary matrices. Let us prove (.13). Note that y R(A) 0 = y (Ax) = (A y) x, x R n A y = 0 y N (A ). This proves the first relation in (.13). Applying the first relation in (.13) to A, we have R(A ) = N (A). Then taking orthogonal complimentary on both sides, we obtain the second relation in (.13). The proofs of the other conclusions are left to the readers. Next, for any A = (a 1,, a n ) R m n with a i R m, we define the rank of A by the following: ( ) rank (A) = dim R(A) = dim span {a 1,, a n }. (.14) Thus, rank (A) is the maximum number of linearly independent vectors in the set {a 1,, a n }. According to Proposition.4, this is also the maximum order of the square submatrix B of A so that det(b) 0. Such an observation leads to a proof of the following proposition, part (i). Proposition.6. (i) For any A R m n, rank (A) = rank (A ). (.15) (ii) Let B R m m and C R n n be invertible. Then for any A R m n, rank (BA) = rank (AC) = rank (A). (.16)
26 Optimization Theory Lecture Notes page 6 6 Optimization Theory A Concise Introduction In particular, for any λ 0, µ R, rank ( AT 1 (i, j) ) = rank ( AT (i ; λ) ) = rank ( AT 1 (i, j ; µ) ) = rank (A). (.17) One can usually use the above to find the rank of a given matrix A by performing elementary row operations. Also, this can be used to find the inverse of A as follows: Assume A is invertible. Then by (ii) of Proposition.5, A = E 1 E E k, with E 1,, E k being elementary matrices. This leads to A 1 = E 1 k E 1 k 1 E 1 E 1 1. Hence, by performing elementary row operations E1 1, E 1,, E 1 k 1, E 1 k consecutively to the augmented matrix (A, I), we have E 1 1 E 1 E 1 k (A, I) = (A 1 A, A 1 ) = (I, A 1 ). Practically, the above method is very effective. The following result is about linear equation of form Ax = b. Proposition.7. Let A R m n. (i) Let b R m. Linear equation Ax = b has at least one solution if and only if b R(A), which is also equivalent to the following: rank (A) = rank (A, b). (.18) (ii) Linear equation Ax = b has at least one solution for every b R m if and only if R(A) = R m. (iii) Linear equation Ax = b has at most one solution for some b R m if and only if N (A) = {0}, which is also equivalent to the fact that the equation Ax = 0 only admits the zero solution. If this happens, then it is necessary that m n. (iv) Linear equation Ax = b admits a unique solution for any b R m if and only if m = n and det(a) 0; in this case, A 1 exists and for any b R n, the unique solution of equation Ax = b admits the following representation: x = A 1 b. From the above, we obtain a very important corollary. Corollary.8. Let A R m n. Linear equation Ax = 0 admits a nonzero solution if and only if either m < n, or m = n with det(a) = 0.
27 Optimization Theory Lecture Notes page 7 Mathematical Preparations 7 We also note that by performing the elementary row operations, one can solve linear equation Ax = b. More precisely, suppose A is invertible. Then with elementary row operations, say, E 1, E,, E k, one will end up with E k E k 1 E 1 A = I. Therefore, applying such a sequence of operations, we will have x = E k E k 1 E 1 Ax = E k E k 1 E 1 b A 1 b, which gives the solution. This procedure is called the Gaussian elimination method. Even when A is not invertible, this method will still work. In general, after a sequence of elementary row operations, we end up with an equation A 0 x = b 0 with A 0 being a simplified form, called a reduced echelon form of A. Since elementary row operations are reversible, the resulting equation A 0 x = b 0 is equivalent to the original one, in the sense that they have the same set of solutions. Next, we introduce the following definition. Definition.9. Let A R n n. (i) The polynomial det(λi A) is called the characteristic polynomial of A. (ii) Any root of the characteristic equation det(λi A) = 0, which could be complex, is called an eigenvalue of A. The set of all eigenvalues of A is denoted by σ(a) and is called the spectrum of A. (iii) If λ C is an eigenvalue of A and ξ, η R n such that ξ + iη 0 and A(ξ + iη) = λ(ξ + iη), then ξ + iη is called an eigenvector of A. Now, for any A S n, we define a map x x Ax which is called a quadratic form. This is a map from R n to R. We introduce the following notions. Definition.10. Let A S n. (i) A is said to be positive semidefinite, denoted by A 0, if x Ax 0, x R n. (ii) A is said to be positive definite, denoted by A > 0, if x Ax > 0, x R n \ {0}. (iii) A is said to be negative semidefinite, denoted by A 0, if A is positive semidefinite; and A is said to be negative definite, denoted by A < 0, if A is positive definite.
28 Optimization Theory Lecture Notes page 8 8 Optimization Theory A Concise Introduction We have the following criterion for positive definiteness of symmetric matrices. Theorem.11. (Sylvester) Let A = (a ij ) S n. Define ( ) a11 a d 1 = a 11, d = det 1,, d n = det(a). a 1 a Then A is positive definite if and only if d 1, d,, d n > 0. (.19) Note that we do not have a similar criterion for positive semidefiniteness of matrices. Namely, if instead of (.19), one has d 1, d,, d n 0, the matrix A is not necessarily positive semidefinite. For example, for ( ) 0 0 A =, 0 1 we have d 1 = d = 0. But the above matrix A is not positive semidefinite. However, we have the following result. Proposition.1. Let A S n. Then σ(a) R. Moreover, A is positive semidefinite if and only if σ(a) [0, ), and A is positive definite if and only if σ(a) (0, ). Sometimes, the following extension of Definition.10 is useful. Definition.13. Let A S n and X R n be a subspace. (i) A is said to be positive semidefinite on X if x Ax 0, x X. (.0) (ii) A is said to be positive definite on X if x Ax > 0, x X \ {0}. (.1) (iii) A is said to be negative semidefinite on X if A is positive semidefinite on X; and A is said to be negative definite on X if A is positive definite.
29 Optimization Theory Lecture Notes page 9 Mathematical Preparations 9 Let us look at two typical cases of the above. (i) X = R(B), for some B R n m. In this case, x X if and only if x = By for some y R m. Thus, x Ax = y (B AB)y. Consequently, A is positive semidefinite (resp. positive definite, negative semidefinite, negative definite) on X if and only if so is B AB. (ii) X = N (B), for some B R m n. In this case, we let N (B) = span {ξ 1,, ξ k } R n and let C = (ξ 1,, ξ k ) R n k. Then X = R(C). Thus, by (i), we see that A is positive semidefinite (resp. positive definite, negative semidefinite, negative definite) on X if and only if so is C AC. Note that N (B) can be found by solving linear equation Bx = 0. Exercises 1. Show that R m n is a linear space under the addition and scalar multiplication defined by (.).. Show that (A, B) tr [A B] is an inner product of R m n, and {E(i, j) 1 i m, 1 j n} is an orthonormal basis of R m n. 3. Calculate the following determinants: (i) 1 1 ; (ii) cos θ sin θ sin θ cos θ ; (iii) ; (iv) sin ϕ cos θ sin ϕ sin θ cos ϕ ρ cos ϕ cos θ ρ cos ϕ sin θ ρ sin ϕ ρ sin ϕ sin θ ρ sin ϕ cos θ Let ξ 1,, ξ k R n and let A = (ξ 1,, ξ k ) R n k. Show that ξ 1,, ξ k are linearly independent if and only if there exists a (k k) square submatrix B of A such that det(b) Let A R m n. Show that N (A) and R(A) are linear subspaces of R n and R m, respectively. 6. Let A be given by the following. Find N (A), N (A ), R(A), and R(A ):
30 Optimization Theory Lecture Notes page Optimization Theory A Concise Introduction 1 ( ) (i) A = ; (ii) A = Compare N (A) with R(A ), and N (A ) with R(A). 7. Find examples showing that AB and BA have the same order, but AB BA. 8. Let A R n n such that AB = BA for all B R n n. Show that A = λi for some λ R. 9. Calculate eigenvalues and corresponding eigenvectors of A: ( ) ( ) 1 1 (i) A = ; (ii) A = Let A S n. Show that every eigenvalue of A must be a real number. 11. Let A S n be positive definite. Define x, y A = x Ay, x, y R n. Show the above is an inner product in R n. ( ) 1 1. Let A =. 1 1 (i) Determine if A is positive definite. { ( ) 1 } (ii) Let X = span. Is A positive definite on X? Give your 1 reasons. 13. For any p [1, ], let A p = sup Ax p, A R m n. x p=1 Show that p is a norm on R m n. (Recall x p defined by Problem 7 of Exercises in Section 1.) 3 Functions: Limits and Continuity In what follows, for notational simplicity, will stand for the Euclidean norm of R n (unless otherwise stated). Any map f : R n R is called a (scalarvalued) function. If n = 1, such a function is called a singlevariable function and if n, such a function is called a multivariable function.
31 Optimization Theory Lecture Notes page 31 Mathematical Preparations 31 We make the following convention: For general case n 1, the vectors in R n are denoted by x = (x 1,, x n ), y = (y 1,, y n ), etc. However, traditionally, for n = 1,, 3, the vectors in R n are denoted by x, (x, y), and (x, y, z), respectively. The following definition collects several relevant notions. Definition 3.1. Let G R n, and f : G R. (i) Let x Ḡ. If for any ε > 0, there exists a δ = δ( x, ε) > 0, such that f(x) L < ε, x x < δ, x G \ { x}, (3.1) then we say that f(x) admits a limit L as x approaches to x, denoted by lim f(x) = L. x x In the case that x G and f( x) = L, we say that f( ) is continuous at x. If f( ) is continuous at every point x G, we say that f( ) is continuous on G. Further, if f( ) is continuous on G with δ( x, ε) independent of x, then f( ) is uniformly continuous on G. (ii) Suppose for x G, there exist L, δ > 0 such that f(x) f(y) L x y, x, y G B δ ( x). Then f( ) is said to be Lipschitz continuous near x. If f( ) is Lipschitz continuous near any x G, we say that f( ) is locally Lipschitz continuous on G. Further, if f( ) is locally Lipschitz continuous on G with constant(s) L and δ uniformly in x G, then f( ) is said to be globally Lipschitz continuous on G. Definition 3.. Let G R n and f : G R. (i) A point x 0 G is called a global minimum (respectively, global maximum) of f( ) over G if ( ) f(x 0 ) f(x), x G. resp. f(x 0 ) f(x), x G. When the above inequalities are strict for any x G \ {x 0 }, we call x 0 a strict global minimum (respectively, strict global maximum) of f( ) over G. (ii) A point x 0 G is called a (strict) local minimum (respectively, (strict) local maximum) of f( ) if there exists a δ > 0 such that x 0 is a (strict) global minimum (respectively, (strict) global maximum) of f( ) over G B δ (x 0 ).
32 Optimization Theory Lecture Notes page 3 3 Optimization Theory A Concise Introduction Global minimum and global maximum are also called absolute minimum and absolute maximum, respectively. Further, both are simply called global or absolute extremes. Likewise, local minimum and local maximum are also called relative minimum and relative maximum, respectively. And, both local minimum and local maximum are called local extremes. It is clear that if x 0 G is a global minimum (respectively, global maximum) of f( ) over G, then f(x 0 ) = min f(g), ( ) resp. f(x 0 ) = max f(g), and if x 0 G is a local minimum (respectively, local maximum), then for some δ > 0, f(x 0 ) = min f ( G B δ (x 0 ) ) (. resp. f(x 0 ) = max f ( G B δ (x 0 ) ) ). The following result is concerned with the existence of extremes. Theorem 3.3. Let G R n and f : G R be continuous. (i) If G is compact, so is f(g) R. Therefore, inf f(g) = min f(g) f(g), sup f(g) = max f(g) f(g). (3.) (ii) If G is connected, so is f(g) R. Proof. (i) We show that f(g) is bounded and closed. Suppose f(g) were not bounded. Then there would be a sequence x k G such that f(x k ). On the other hand, since G is compact, {x k } admits a convergent subsequence. We may assume that x k itself is convergent to some x G. Then by the continuity of f( ), we obtain f( x) = lim f(x k) =, k which is a contradiction. Hence, f(g) is bounded. To show the closedness of f(g), let y k f(g) such that y k ȳ (as k ). We can find x k G such that f(x k ) = y k. By the compactness of G, we may assume that x k x. Then by the continuity of f( ), one has ȳ = f( x) f(g). Hence, f(g) is compact. Then (3.) follows from Proposition (ii) Since f(g) R, to prove its connectedness, it suffices to prove that for any x 1, x G with f(x 1 ) < f(x ), [f(x 1 ), f(x )] f(g). (3.3) If this were not the case, then there would be some number, say, a, such that f(x 1 ) < a < f(x ), a / f(g).
33 Optimization Theory Lecture Notes page 33 Mathematical Preparations 33 Define G 1 = {x G f(x) < a}, G = {x G f(x) > a}. Clearly, G 1 G = G. On the other hand, if there exists a point x G 1 G, then f( x) > a, and one must have a sequence x k G 1 converging to x. It follows from x k G 1 that f(x k ) < a. Hence, by the continuity of f( ), we have a < f( x) = lim k f(x k) a, which is a contradiction. Thus, G 1 G =. Likewise, G 1 G =. Hence, G is disconnected, contradicting to the connectedness of G. Part (i) of the above theorem is called Weierstrass Theorem. Note that (3.) means that when G is compact and f : G R is continuous, then f( ) attains its minimum and maximum over G. Part (ii) of the above is called the (generalized) Intermediate Value Theorem, which says that if a, b f(g), then for every c (a, b), there exists some x 0 G such that f(x 0 ) = c. Let us now look at other types of continuity for functions. It is known that for a given function f( ) and x, the limit lim f(x) does x x not necessarily exist. Therefore, we would like to look at a little weaker notions. For any bounded function f : G R, and x Ḡ, define f ( x ; δ) = inf f ( G B δ ( x) \ { x} ), f + ( x ; δ) = sup f ( G B δ ( x) \ { x} ). (3.4) It is easy to see that δ f ( x ; δ) is nonincreasing and δ f + ( x ; δ) is nondecreasing. Hence, the limits on the righthands of the following exist: lim f(x) = lim f ( x ; δ), x x δ 0 lim f(x) = lim f + ( x ; δ). (3.5) x x δ 0 They are called limit inferior and limit superior (or simply called liminf and limsup), respectively, of f( ) as x approaches to x. Note that for any bounded function f( ), liminf and limsup always exist. Here is a very typical example. Let Then it is straightforward that f(x) = sin 1 x, x 0. lim f(x) = 1, x 0 lim f(x) = 1. x 0
34 Optimization Theory Lecture Notes page Optimization Theory A Concise Introduction We have the following result which is comparable with Proposition Proposition 3.4. Let G R n be a domain and x 0 Ḡ. Let f : G R. Then Further, In this case, lim f(x) lim f(x). (3.6) x x 0 x x 0 lim f(x) exists lim f(x) = lim f(x). (3.7) x x 0 x x 0 x x 0 lim f(x) = lim f(x) = lim f(x). (3.8) x x 0 x x 0 x x 0 Next, we introduce the following notions which are generalizations of the continuity. Definition 3.5. Let f : G R and x G. (i) f( ) is lower semicontinuous at x if f( x) lim f(x). x x (ii) f( ) is upper semicontinuous at x if f( x) lim x x f(x). The following example is worthy of remembering: Let { { ϕ (x) = 1, x = 0, ϕ + (x) = 1, x = 0, 0, x 0, 0, x 0. Then ϕ ( ) is lower semicontinuous and ϕ + ( ) is upper semicontinuous. (3.9) It is clear that f( ) is lower semicontinuous if and only if f( ) is upper semicontinuous. The following result reveals some further interesting relations among lower semicontinuity, upper semicontinuity and continuity of functions. Theorem 3.6. Let G R n and f : G R. (i) f( ) is lower semicontinuous on G if and only if for every a R, is open in G. {f > a} {x G f(x) > a}
35 Optimization Theory Lecture Notes page 35 Mathematical Preparations 35 (ii) f( ) is upper semicontinuous on G if and only if for every a R, is open in G. {f < a} {x G f(x) < a} (iii) f( ) is continuous on G if and only if for every a R, both {f < a} and {f > a} are open in G. (iv) f( ) is continuous on G if and only if for every open set V R, the set f 1 (V ) {x G f(x) V } is open in G, i.e., there exists an open set U R n such that f 1 (V ) = G U. The proof of the above result follows from the definitions of the continuity, the lower and upper semicontinuity. Let us present a case for which the above result plays an interesting role. Proposition 3.7. Let G R n be a compact set and let f λ : G R be a family of functions, with λ Λ, for some index set Λ. (i) Suppose each f λ ( ) is upper semicontinuous on G, so is f + ( ) where f + (x) inf λ Λ f λ(x), x G. (ii) Suppose each f λ ( ) is lower semicontinuous on G, so is f ( ) where f (x) sup f λ (x), x G. λ Λ (iii) In particular, if each f λ ( ) is continuous on G, then f + ( ) is upper semicontinuous and f + ( ) is lower semicontinuous. Note that in the above part (iii), functions f ± ( ) are not necessarily continuous. Let us look at the following examples. Example 3.8. Let f k (x) = (1 x ) k, x [ 1, 1], k 1. Then each f k ( ) is continuous and is nonincreasing in k. Hence, inf k 1 f k(x) = lim k f k(x) = ϕ + (x), x [ 1, 1],
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
More informationSome Background Material
Chapter 1 Some Background Material In the first chapter, we present a quick review of elementary  but important  material as a way of dipping our toes in the water. This chapter also introduces important
More informationLinear 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
More informationAN ELEMENTARY PROOF OF THE SPECTRAL RADIUS FORMULA FOR MATRICES
AN ELEMENTARY PROOF OF THE SPECTRAL RADIUS FORMULA FOR MATRICES JOEL A. TROPP Abstract. We present an elementary proof that the spectral radius of a matrix A may be obtained using the formula ρ(a) lim
More information1. 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
More informationMath 443 Differential Geometry Spring Handout 3: Bilinear and Quadratic Forms This handout should be read just before Chapter 4 of the textbook.
Math 443 Differential Geometry Spring 2013 Handout 3: Bilinear and Quadratic Forms This handout should be read just before Chapter 4 of the textbook. Endomorphisms of a Vector Space This handout discusses
More informationLecture Notes in Advanced Calculus 1 (80315) Raz Kupferman Institute of Mathematics The Hebrew University
Lecture Notes in Advanced Calculus 1 (80315) Raz Kupferman Institute of Mathematics The Hebrew University February 7, 2007 2 Contents 1 Metric Spaces 1 1.1 Basic definitions...........................
More informationStat 159/259: Linear Algebra Notes
Stat 159/259: Linear Algebra Notes Jarrod Millman November 16, 2015 Abstract These notes assume you ve taken a semester of undergraduate linear algebra. In particular, I assume you are familiar with the
More informationIn 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
More informationREVIEW OF ESSENTIAL MATH 346 TOPICS
REVIEW OF ESSENTIAL MATH 346 TOPICS 1. AXIOMATIC STRUCTURE OF R Doğan Çömez The real number system is a complete ordered field, i.e., it is a set R which is endowed with addition and multiplication operations
More information1. Select the unique answer (choice) for each problem. Write only the answer.
MATH 5 Practice Problem Set Spring 7. Select the unique answer (choice) for each problem. Write only the answer. () Determine all the values of a for which the system has infinitely many solutions: x +
More information1 Matrices and Systems of Linear Equations
March 3, 203 66. Systems of Linear Equations Matrices and Systems of Linear Equations An m n matrix is an array A = a ij of the form a a n a 2 a 2n... a m a mn where each a ij is a real or complex number.
More informationCHAPTER 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
More informationELEMENTARY LINEAR ALGEBRA WITH APPLICATIONS. 1. Linear Equations and Matrices
ELEMENTARY LINEAR ALGEBRA WITH APPLICATIONS KOLMAN & HILL NOTES BY OTTO MUTZBAUER 11 Systems of Linear Equations 1 Linear Equations and Matrices Numbers in our context are either real numbers or complex
More informationIn particular, if A is a square matrix and λ is one of its eigenvalues, then we can find a nonzero column vector X with
Appendix: Matrix Estimates and the PerronFrobenius Theorem. This Appendix will first present some well known estimates. For any m n matrix A = [a ij ] over the real or complex numbers, it will be convenient
More informationNOTES (1) FOR MATH 375, FALL 2012
NOTES 1) FOR MATH 375, FALL 2012 1 Vector Spaces 11 Axioms Linear algebra grows out of the problem of solving simultaneous systems of linear equations such as 3x + 2y = 5, 111) x 3y = 9, or 2x + 3y z =
More informationLinear 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,
More informationMA 265 FINAL EXAM Fall 2012
MA 265 FINAL EXAM Fall 22 NAME: INSTRUCTOR S NAME:. There are a total of 25 problems. You should show work on the exam sheet, and pencil in the correct answer on the scantron. 2. No books, notes, or calculators
More informationReal Analysis Math 131AH Rudin, Chapter #1. Dominique Abdi
Real Analysis Math 3AH Rudin, Chapter # Dominique Abdi.. If r is rational (r 0) and x is irrational, prove that r + x and rx are irrational. Solution. Assume the contrary, that r+x and rx are rational.
More informationTopic 2 Quiz 2. choice C implies B and B implies C. correctchoice C implies B, but B does not imply C
Topic 1 Quiz 1 text A reduced rowechelon form of a 3 by 4 matrix can have how many leading one s? choice must have 3 choice may have 1, 2, or 3 correctchoice may have 0, 1, 2, or 3 choice may have 0,
More information1 9/5 Matrices, vectors, and their applications
1 9/5 Matrices, vectors, and their applications Algebra: study of objects and operations on them. Linear algebra: object: matrices and vectors. operations: addition, multiplication etc. Algorithms/Geometric
More informationMath Linear Algebra Final Exam Review Sheet
Math 151 Linear Algebra Final Exam Review Sheet Vector Operations Vector addition is a componentwise operation. Two vectors v and w may be added together as long as they contain the same number n of
More informationIr O D = D = ( ) Section 2.6 Example 1. (Bottom of page 119) dim(v ) = dim(l(v, W )) = dim(v ) dim(f ) = dim(v )
Section 3.2 Theorem 3.6. Let A be an m n matrix of rank r. Then r m, r n, and, by means of a finite number of elementary row and column operations, A can be transformed into the matrix ( ) Ir O D = 1 O
More informationEE/ACM Applications of Convex Optimization in Signal Processing and Communications Lecture 2
EE/ACM 150  Applications of Convex Optimization in Signal Processing and Communications Lecture 2 Andre Tkacenko Signal Processing Research Group Jet Propulsion Laboratory April 5, 2012 Andre Tkacenko
More informationElements of Convex Optimization Theory
Elements of Convex Optimization Theory Costis Skiadas August 2015 This is a revised and extended version of Appendix A of Skiadas (2009), providing a selfcontained overview of elements of convex optimization
More informationChapter 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
More informationMath Linear Algebra II. 1. Inner Products and Norms
Math 342  Linear Algebra II Notes 1. Inner Products and Norms One knows from a basic introduction to vectors in R n Math 254 at OSU) that the length of a vector x = x 1 x 2... x n ) T R n, denoted x,
More informationMath 18, Linear Algebra, Lecture C00, Spring 2017 Review and Practice Problems for Final Exam
Math 8, Linear Algebra, Lecture C, Spring 7 Review and Practice Problems for Final Exam. The augmentedmatrix of a linear system has been transformed by row operations into 5 4 8. Determine if the system
More informationTangent spaces, normals and extrema
Chapter 3 Tangent spaces, normals and extrema If S is a surface in 3space, with a point a S where S looks smooth, i.e., without any fold or cusp or selfcrossing, we can intuitively define the tangent
More information1 Topology Definition of a topology Basis (Base) of a topology The subspace topology & the product topology on X Y 3
Index Page 1 Topology 2 1.1 Definition of a topology 2 1.2 Basis (Base) of a topology 2 1.3 The subspace topology & the product topology on X Y 3 1.4 Basic topology concepts: limit points, closed sets,
More informationMATRICES. knowledge on matrices Knowledge on matrix operations. Matrix as a tool of solving linear equations with two or three unknowns.
MATRICES After studying this chapter you will acquire the skills in knowledge on matrices Knowledge on matrix operations. Matrix as a tool of solving linear equations with two or three unknowns. List of
More informationLinear algebra and applications to graphs Part 1
Linear algebra and applications to graphs Part 1 Written up by Mikhail Belkin and Moon Duchin Instructor: Laszlo Babai June 17, 2001 1 Basic Linear Algebra Exercise 1.1 Let V and W be linear subspaces
More informationReal Analysis Notes. Thomas Goller
Real Analysis Notes Thomas Goller September 4, 2011 Contents 1 Abstract Measure Spaces 2 1.1 Basic Definitions........................... 2 1.2 Measurable Functions........................ 2 1.3 Integration..............................
More informationHilbert spaces. 1. CauchySchwarzBunyakowsky inequality
(October 29, 2016) Hilbert spaces Paul Garrett garrett@math.umn.edu http://www.math.umn.edu/ garrett/ [This document is http://www.math.umn.edu/ garrett/m/fun/notes 201617/03 hsp.pdf] Hilbert spaces are
More informationStructure of R. Chapter Algebraic and Order Properties of R
Chapter Structure of R We will reassemble calculus by first making assumptions about the real numbers. All subsequent results will be rigorously derived from these assumptions. Most of the assumptions
More informationA 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
More informationFUNCTIONAL ANALYSIS LECTURE NOTES: COMPACT SETS AND FINITEDIMENSIONAL SPACES. 1. Compact Sets
FUNCTIONAL ANALYSIS LECTURE NOTES: COMPACT SETS AND FINITEDIMENSIONAL SPACES CHRISTOPHER HEIL 1. Compact Sets Definition 1.1 (Compact and Totally Bounded Sets). Let X be a metric space, and let E X be
More informationHOMEWORK 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
More informationCopyright 2010 Pearson Education, Inc. Publishing as Prentice Hall.
.1 Limits of Sequences. CHAPTER.1.0. a) True. If converges, then there is an M > 0 such that M. Choose by Archimedes an N N such that N > M/ε. Then n N implies /n M/n M/N < ε. b) False. = n does not converge,
More informationRecall the convention that, for us, all vectors are column vectors.
Some linear algebra Recall the convention that, for us, all vectors are column vectors. 1. Symmetric matrices Let A be a real matrix. Recall that a complex number λ is an eigenvalue of A if there exists
More informationIMPORTANT DEFINITIONS AND THEOREMS REFERENCE SHEET
IMPORTANT DEFINITIONS AND THEOREMS REFERENCE SHEET This is a (not quite comprehensive) list of definitions and theorems given in Math 1553. Pay particular attention to the ones in red. Study Tip For each
More information1: Introduction to Lattices
CSE 206A: Lattice Algorithms and Applications Winter 2012 Instructor: Daniele Micciancio 1: Introduction to Lattices UCSD CSE Lattices are regular arrangements of points in Euclidean space. The simplest
More informationExamples and MatLab. Vector and Matrix Material. Matrix Addition R = A + B. Matrix Equality A = B. Matrix Multiplication R = A * B.
Vector and Matrix Material Examples and MatLab Matrix = Rectangular array of numbers, complex numbers or functions If r rows & c columns, r*c elements, r*c is order of matrix. A is n * m matrix Square
More informationMATH 323 Linear Algebra Lecture 12: Basis of a vector space (continued). Rank and nullity of a matrix.
MATH 323 Linear Algebra Lecture 12: Basis of a vector space (continued). Rank and nullity of a matrix. Basis Definition. Let V be a vector space. A linearly independent spanning set for V is called a basis.
More informationMATH 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
More information2. Matrix Algebra and Random Vectors
2. Matrix Algebra and Random Vectors 2.1 Introduction Multivariate data can be conveniently display as array of numbers. In general, a rectangular array of numbers with, for instance, n rows and p columns
More informationSupplementary Notes on Linear Algebra
Supplementary Notes on Linear Algebra Mariusz Wodzicki May 3, 2015 1 Vector spaces 1.1 Coordinatization of a vector space 1.1.1 Given a basis B = {b 1,..., b n } in a vector space V, any vector v V can
More informationand let s calculate the image of some vectors under the transformation T.
Chapter 5 Eigenvalues and Eigenvectors 5. Eigenvalues and Eigenvectors Let T : R n R n be a linear transformation. Then T can be represented by a matrix (the standard matrix), and we can write T ( v) =
More informationLecture 3: Review of Linear Algebra
ECE 83 Fall 2 Statistical Signal Processing instructor: R Nowak Lecture 3: Review of Linear Algebra Very often in this course we will represent signals as vectors and operators (eg, filters, transforms,
More informationLecture 23: 6.1 Inner Products
Lecture 23: 6.1 Inner Products WeiTa Chu 2008/12/17 Definition An inner product on a real vector space V is a function that associates a real number u, vwith each pair of vectors u and v in V in such
More informationLecture 3: Review of Linear Algebra
ECE 83 Fall 2 Statistical Signal Processing instructor: R Nowak, scribe: R Nowak Lecture 3: Review of Linear Algebra Very often in this course we will represent signals as vectors and operators (eg, filters,
More informationHONORS LINEAR ALGEBRA (MATH V 2020) SPRING 2013
HONORS LINEAR ALGEBRA (MATH V 2020) SPRING 2013 PROFESSOR HENRY C. PINKHAM 1. Prerequisites The only prerequisite is Calculus III (Math 1201) or the equivalent: the first semester of multivariable calculus.
More informationFundamentals of Linear Algebra. Marcel B. Finan Arkansas Tech University c All Rights Reserved
Fundamentals of Linear Algebra Marcel B. Finan Arkansas Tech University c All Rights Reserved 2 PREFACE Linear algebra has evolved as a branch of mathematics with wide range of applications to the natural
More informationMATRIX ALGEBRA AND SYSTEMS OF EQUATIONS. + + x 1 x 2. x n 8 (4) 3 4 2
MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS SYSTEMS OF EQUATIONS AND MATRICES Representation of a linear system The general system of m equations in n unknowns can be written a x + a 2 x 2 + + a n x n b a
More informationMATH 304 Linear Algebra Lecture 10: Linear independence. Wronskian.
MATH 304 Linear Algebra Lecture 10: Linear independence. Wronskian. Spanning set Let S be a subset of a vector space V. Definition. The span of the set S is the smallest subspace W V that contains S. If
More informationSymmetric Matrices and Eigendecomposition
Symmetric Matrices and Eigendecomposition Robert M. Freund January, 2014 c 2014 Massachusetts Institute of Technology. All rights reserved. 1 2 1 Symmetric Matrices and Convexity of Quadratic Functions
More informationExercise Solutions to Functional Analysis
Exercise Solutions to Functional Analysis Note: References refer to M. Schechter, Principles of Functional Analysis Exersize that. Let φ,..., φ n be an orthonormal set in a Hilbert space H. Show n f n
More informationMATRIX ALGEBRA. or x = (x 1,..., x n ) R n. y 1 y 2. x 2. x m. y m. y = cos θ 1 = x 1 L x. sin θ 1 = x 2. cos θ 2 = y 1 L y.
as Basics Vectors MATRIX ALGEBRA An array of n real numbers x, x,, x n is called a vector and it is written x = x x n or x = x,, x n R n prime operation=transposing a column to a row Basic vector operations
More informationIMPORTANT DEFINITIONS AND THEOREMS REFERENCE SHEET
IMPORTANT DEFINITIONS AND THEOREMS REFERENCE SHEET This is a (not quite comprehensive) list of definitions and theorems given in Math 1553. Pay particular attention to the ones in red. Study Tip For each
More informationA Brief Introduction to Functional Analysis
A Brief Introduction to Functional Analysis Sungwook Lee Department of Mathematics University of Southern Mississippi sunglee@usm.edu July 5, 2007 Definition 1. An algebra A is a vector space over C with
More informationCalculating determinants for larger matrices
Day 26 Calculating determinants for larger matrices We now proceed to define det A for n n matrices A As before, we are looking for a function of A that satisfies the product formula det(ab) = det A det
More information7 : APPENDIX. Vectors and Matrices
7 : APPENDIX Vectors and Matrices An ntuple vector x is defined as an ordered set of n numbers. Usually we write these numbers x 1,...,x n in a column in the order indicated by their subscripts. The transpose
More informationREPRESENTATION THEORY WEEK 7
REPRESENTATION THEORY WEEK 7 1. Characters of L k and S n A character of an irreducible representation of L k is a polynomial function constant on every conjugacy class. Since the set of diagonalizable
More informationLecture 5. Theorems of Alternatives and SelfDual Embedding
IE 8534 1 Lecture 5. Theorems of Alternatives and SelfDual Embedding IE 8534 2 A system of linear equations may not have a solution. It is well known that either Ax = c has a solution, or A T y = 0, c
More information(K + L)(c x) = K(c x) + L(c x) (def of K + L) = K( x) + K( y) + L( x) + L( y) (K, L are linear) = (K L)( x) + (K L)( y).
Exercise 71 We have L( x) = x 1 L( v 1 ) + x 2 L( v 2 ) + + x n L( v n ) n = x i (a 1i w 1 + a 2i w 2 + + a mi w m ) i=1 ( n ) ( n ) ( n ) = x i a 1i w 1 + x i a 2i w 2 + + x i a mi w m i=1 Therefore y
More informationReview of some mathematical tools
MATHEMATICAL FOUNDATIONS OF SIGNAL PROCESSING Fall 2016 Benjamín Béjar Haro, Mihailo Kolundžija, Reza Parhizkar, Adam Scholefield Teaching assistants: Golnoosh Elhami, Hanjie Pan Review of some mathematical
More informationA matrix is a rectangular array of. objects arranged in rows and columns. The objects are called the entries. is called the size of the matrix, and
Section 5.5. Matrices and Vectors A matrix is a rectangular array of objects arranged in rows and columns. The objects are called the entries. A matrix with m rows and n columns is called an m n matrix.
More informationMatrices and Vectors. Definition of Matrix. An MxN matrix A is a twodimensional array of numbers A =
30 MATHEMATICS REVIEW G A.1.1 Matrices and Vectors Definition of Matrix. An MxN matrix A is a twodimensional array of numbers A = a 11 a 12... a 1N a 21 a 22... a 2N...... a M1 a M2... a MN A matrix can
More informationAn introduction to some aspects of functional analysis
An introduction to some aspects of functional analysis Stephen Semmes Rice University Abstract These informal notes deal with some very basic objects in functional analysis, including norms and seminorms
More informationSome 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
More informationCHAPTER 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
More informationFunctional Analysis Review
Outline 9.520: Statistical Learning Theory and Applications February 8, 2010 Outline 1 2 3 4 Vector Space Outline A vector space is a set V with binary operations +: V V V and : R V V such that for all
More informationLinear vector spaces and subspaces.
Math 2051 W2008 Margo Kondratieva Week 1 Linear vector spaces and subspaces. Section 1.1 The notion of a linear vector space. For the purpose of these notes we regard (m 1)matrices as mdimensional vectors,
More informationLinear Algebra in Actuarial Science: Slides to the lecture
Linear Algebra in Actuarial Science: Slides to the lecture Fall Semester 2010/2011 Linear Algebra is a ToolBox Linear Equation Systems Discretization of differential equations: solving linear equations
More informationLinear Algebra and Eigenproblems
Appendix A A Linear Algebra and Eigenproblems A working knowledge of linear algebra is key to understanding many of the issues raised in this work. In particular, many of the discussions of the details
More informationTopological vectorspaces
(July 25, 2011) Topological vectorspaces Paul Garrett garrett@math.umn.edu http://www.math.umn.edu/ garrett/ Natural nonfréchet spaces Topological vector spaces Quotients and linear maps More topological
More informationExtra Problems for Math 2050 Linear Algebra I
Extra Problems for Math 5 Linear Algebra I Find the vector AB and illustrate with a picture if A = (,) and B = (,4) Find B, given A = (,4) and [ AB = A = (,4) and [ AB = 8 If possible, express x = 7 as
More informationAlgebraic Methods in Combinatorics
Algebraic Methods in Combinatorics PoShen Loh 27 June 2008 1 Warmup 1. (A result of Bourbaki on finite geometries, from Răzvan) Let X be a finite set, and let F be a family of distinct proper subsets
More informationMATH 20F: LINEAR ALGEBRA LECTURE B00 (T. KEMP)
MATH 20F: LINEAR ALGEBRA LECTURE B00 (T KEMP) Definition 01 If T (x) = Ax is a linear transformation from R n to R m then Nul (T ) = {x R n : T (x) = 0} = Nul (A) Ran (T ) = {Ax R m : x R n } = {b R m
More informationSolutions to Final Exam 2011 (Total: 100 pts)
Page of 5 Introduction to Linear Algebra November 7, Solutions to Final Exam (Total: pts). Let T : R 3 R 3 be a linear transformation defined by: (5 pts) T (x, x, x 3 ) = (x + 3x + x 3, x x x 3, x + 3x
More information4.3  Linear Combinations and Independence of Vectors
 Linear Combinations and Independence of Vectors De nitions, Theorems, and Examples De nition 1 A vector v in a vector space V is called a linear combination of the vectors u 1, u,,u k in V if v can be
More informationThe proximal mapping
The proximal mapping http://bicmr.pku.edu.cn/~wenzw/opt2016fall.html Acknowledgement: this slides is based on Prof. Lieven Vandenberghes lecture notes Outline 2/37 1 closed function 2 Conjugate function
More informationMaths 212: Homework Solutions
Maths 212: Homework Solutions 1. The definition of A ensures that x π for all x A, so π is an upper bound of A. To show it is the least upper bound, suppose x < π and consider two cases. If x < 1, then
More information2 (Bonus). Let A X consist of points (x, y) such that either x or y is a rational number. Is A measurable? What is its Lebesgue measure?
MA 6454A (Real Analysis), Dr. Chernov Homework assignment 1 (Due 9/5). Prove that every countable set A is measurable and µ(a) = 0. 2 (Bonus). Let A consist of points (x, y) such that either x or y is
More informationSAMPLE OF THE STUDY MATERIAL PART OF CHAPTER 1 Introduction to Linear Algebra
SAMPLE OF THE STUDY MATERIAL PART OF CHAPTER 1 Introduction to 1.1. Introduction Linear algebra is a specific branch of mathematics dealing with the study of vectors, vector spaces with functions that
More informationSemidefinite and Second Order Cone Programming Seminar Fall 2001 Lecture 5
Semidefinite and Second Order Cone Programming Seminar Fall 2001 Lecture 5 Instructor: Farid Alizadeh Scribe: Anton Riabov 10/08/2001 1 Overview We continue studying the maximum eigenvalue SDP, and generalize
More informationProperties of Matrices and Operations on Matrices
Properties of Matrices and Operations on Matrices A common data structure for statistical analysis is a rectangular array or matris. Rows represent individual observational units, or just observations,
More informationVector 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
More informationELEMENTARY LINEAR ALGEBRA
ELEMENTARY LINEAR ALGEBRA K. R. MATTHEWS DEPARTMENT OF MATHEMATICS UNIVERSITY OF QUEENSLAND Corrected Version, 7th April 013 Comments to the author at keithmatt@gmail.com Chapter 1 LINEAR EQUATIONS 1.1
More informationSequences. Chapter 3. n + 1 3n + 2 sin n n. 3. lim (ln(n + 1) ln n) 1. lim. 2. lim. 4. lim (1 + n)1/n. Answers: 1. 1/3; 2. 0; 3. 0; 4. 1.
Chapter 3 Sequences Both the main elements of calculus (differentiation and integration) require the notion of a limit. Sequences will play a central role when we work with limits. Definition 3.. A Sequence
More informationCalculation in the special cases n = 2 and n = 3:
9. The determinant The determinant is a function (with real numbers as values) which is defined for quadratic matrices. It allows to make conclusions about the rank and appears in diverse theorems and
More informationMathematical Methods wk 2: Linear Operators
John Magorrian, magog@thphysoxacuk These are workinprogress notes for the secondyear course on mathematical methods The most uptodate version is available from http://wwwthphysphysicsoxacuk/people/johnmagorrian/mm
More informationExercises to Applied Functional Analysis
Exercises to Applied Functional Analysis Exercises to Lecture 1 Here are some exercises about metric spaces. Some of the solutions can be found in my own additional lecture notes on Blackboard, as the
More informationMATH 4200 HW: PROBLEM SET FOUR: METRIC SPACES
MATH 4200 HW: PROBLEM SET FOUR: METRIC SPACES PETE L. CLARK 4. Metric Spaces (no more lulz) Directions: This week, please solve any seven problems. Next week, please solve seven more. Starred parts of
More informationHonors Linear Algebra, Spring Homework 8 solutions by Yifei Chen
.. Honors Linear Algebra, Spring 7. Homework 8 solutions by Yifei Chen 8... { { W {v R 4 v α v β } v x, x, x, x 4 x x + x 4 x + x x + x 4 } Solve the linear system above, we get a basis of W is {v,,,,
More informationNormed and Banach Spaces
(August 30, 2005) Normed and Banach Spaces Paul Garrett garrett@math.umn.edu http://www.math.umn.edu/ garrett/ We have seen that many interesting spaces of functions have natural structures of Banach spaces:
More informationLinear 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.....................................
More informationAlgebraic Methods in Combinatorics
Algebraic Methods in Combinatorics PoShen Loh June 2009 1 Linear independence These problems both appeared in a course of Benny Sudakov at Princeton, but the links to Olympiad problems are due to Yufei
More informationMath 240 Calculus III
The Calculus III Summer 2015, Session II Wednesday, July 8, 2015 Agenda 1. of the determinant 2. determinants 3. of determinants What is the determinant? Yesterday: Ax = b has a unique solution when A
More informationLocally convex spaces, the hyperplane separation theorem, and the KreinMilman theorem
56 Chapter 7 Locally convex spaces, the hyperplane separation theorem, and the KreinMilman theorem Recall that C(X) is not a normed linear space when X is not compact. On the other hand we could use semi
More information