A Simple Computational Approach to the Fundamental Theorem of Asset Pricing
|
|
- Diane Barrett
- 5 years ago
- Views:
Transcription
1 Applied Mathematical Sciences, Vol. 6, 2012, no. 72, A Simple Computational Approach to the Fundamental Theorem of Asset Pricing Cherng-tiao Perng Department of Mathematics Norfolk State University 700 Park Avenue, Norfolk, VA ctperng@nsu.edu Abstract In this short note, we will establish the fundamental theorem of asset pricing (FTAP) by basic linear algebra. More precisely, we prove Stiemke s Theorem, which is equivalent to FTAP. For comparison purpose, many existing proofs rely on linear programming, the separating hyperplane theorem, or some technical algorithm. In deriving our proof, we used a version of separating hyperplane theorem in dimension two, which is easy and can be shown directly. Mathematics Subject Classification: 15A39, 91B02, 91B25 Keywords: the fundamental theorem of asset pricing, Stiemke s theorem 1 Introduction Relating the existence of an equivalent martingale measure to the no-arbitrage condition, the Fundamental Theorem of Asset Pricing plays a central role in Mathematical Finance. For example, the seminal papers by Black, Scholes and Merton (Nobel Prize for Economics, 1997) on the pricing of options were based on No Arbitrage principle. The pioneering work related to the Fundamental Theorem of Asset Pricing was done around the late eighties; we merely list some names with years without mentioning the precise works, since we will not need them in this paper: Cox and Ross method of risk neutral valuation (1976), Harrison and Kreps (1979) and Harrison and Pliska (1981, 1983). For the purpose of this paper, we don t need the martingale measure or any probability theory (which involves basically a translation using different terminologies; see [9] or any textbook on financial economics). We note that,
2 3556 Cherng-tiao Perng mathematically, the Fundamental Theorem of Asset Pricing in the single period model is equivalent to Stiemke s Theorem ([11]), which follows directly from a version of separating hyperplane theorem. There are various approaches to proving this: some involves non-constructive method such as Hahn-Banach Theorem (this requires additional work, as the versions of this theorem from any standard textbook do not directly apply). Other proofs include the ones by applying Farkas s Lemma ([5],[8]), which appears to be stronger (i.e. it implies Stiemke, but not the other way around) ([10]), by careful study of polyhedral cones ([4],[6]), by linear programming, or by Fredhlom s alternative theorem ([2]). In this note, we will use a constructive method based on basic linear algebra. To see the simplicity of our method, one may wish to compare the work [1], which used a technical algorithm devised by A. Dax ([3]). Our method resembles the approach via Arrow-Debreu securities in the manner of extending the securities to make the market complete (cf. [9]), but our proof can be done explicitly by simple geometric consideration without those terminologies and we have avoided the use of linear programming. 2 Preliminaries We briefly recall some definitions. A large part of notations follow those of [9]. A single-period market model consists of a finite number of n securities (or assets) S 1,S 2,,S n, and their values at time 0 and time 1. At time 0, the prices are known, but at time 1, the prices are random variables defined on a sample space Ω = {ω 1,ω 2,,ω m } consisting of states. We assume that the probability P(ω i ) > 0 for each i =1, 2,,m, but as far as this article is concerned, we won t need any other notions of probability. More precisely, we have the following Definition 2.1 Denote by S j (t, ω i ) the security price at time t and the state ω j. Here we are concerned with only t =0and t =1, and we assume that j =1, 2,,n and i =1, 2,,m. We denote the vector [S 1 (0,ω i ),,S n (0,ω i )] by S(0), which represents the time 0 prices of securities, since we assume that initially the prices do not depend on ω i. And we denote by S(1, Ω) the matrix (a ij ) where a ij = S j (1,ω i ). A trading strategy (or portfolio) represented by a column vector θ = [θ 1,θ 2,,θ n ] T is a buy and sell consideration of the securities, thus the corresponding price of the portfolio at time 0 is given by S(0)θ = S 1 (0)θ 1 + S 2 (0)θ S n (0)θ n,
3 Fundamental theorem of asset pricing 3557 where S j (0) = S j (0,ω i ) for 1 i m and 1 j n. Notations. X 0 means that all the entries of X are nonnegative, X>0 means that all the entries are nonnegative and there exists at least one positive entry, and X 0 means that all the entries are positive (similarly for <, and ). Furthermore, we let R n be the standard n-dimensional vector space over R, and R n + (resp. Rn ++ ) a subset of Rn consisting of vectors with nonnegative (resp. strictly positive) components. Definition 2.2 We say that the above model has an arbitrage opportunity if there exists a portfolio θ such that either of the following is true: (i) S(0)θ 0 and S(1, Ω)θ >0 (ii) S(0)θ <0 and S(1, Ω)θ =0 Note. The condition (ii) was not mentioned in [9] but tacitly assumed in their proof of the Fundamental Theorem of Asset Pricing. The author of [7] defines (i) to be type B Arbitrage, and (ii) as type A Arbitrage. Definition 2.3 A state price vector ψ is a strictly positive vector [ψ(ω 1 ),ψ(ω 2 ),,ψ(ω m )] for which S(0) = ψs(1, Ω). 2.1 The Fundamental Theorem of Asset Pricing We are now ready to state the following Theorem 2.4 (Fundamental Theorem of Asset Pricing) Keeping the above notations, the model is arbitrage free if and only if there exists a state price vector ψ 0 such that S(0) = ψs(1, Ω). 2.2 Stiemke s Theorem Stiemke s Theorem ([11]) concerns the solutions of system of linear inequalities, which is one of the famous theorems of alternative (for these formulations, see eg. [8]) in the theory of linear programming or optimization. For our purpose, it is convenient to state it in the following form. Theorem 2.5 (Stiemke s Theorem) Let A be an m n matrix. Then there does not exist any column vector x such that Ax > 0, if and only if there exists a row vector y 0 such that ya =0.
4 3558 Cherng-tiao Perng Remark. Geometrically, the above theorem says that the linear span V of the column vectors of A intersects R m + trivially (i.e. V Rm + = {0}) if and only if there exists y R m ++ such that y T A = Proof of the Fundamental Theorem of Asset Pricing Using Stiemke s Theorem Proof. (Sufficiency) If there exists a state price vector ψ with S(0) = ψs(1, Ω), then S(1, Ω)θ >0 ψs(1, Ω)θ >0 S(0)θ >0; similarly S(1, Ω)θ =0 ψs(1, Ω)θ =0 S(0)θ =0. Therefore, by Definition 2.2, there are no arbitrage opportunities. (Necessity) If there are no arbitrage opportunities, then there does not exist any portfolio θ satisfying (i) or (ii) of Definition 2.2, which is equivalent to the following condition: There does not exist any θ such that [ S(1, Ω) S(0) ] θ>0. Applying Stiemke s Theorem to the matrix [ S(1, Ω) A = S(0) ], we see that there exists a vector y 0 such that ya =0. If we normalize the last component of y and write y =[ψ,1], then we get ya =0 S(0) = ψs(1, Ω), as required. Remark. By essentially reversing the above argument, we can show that FTAP implies Stiemke s Theorem. Hence the two theorems are equivalent. 3 Constructive Proof of Stiemke s Theorem As the main result of this paper, we provide a constructive proof of Stiemke s Theorem. To facilitate the proof we make precise some definitions, and establish some lemmas.
5 Fundamental theorem of asset pricing 3559 Definition 3.1 A set W is called a linear polyhedral cone in R l if there exist column vectors v 1, v 2,, v k in R l such that { W = v v = } α i v i,α i 0, i. i Remark. If l 2, then W is easily seen to be a closed subset of R l. It is true in general that W is a closed subset. Since we will only need the case for l = 2, we do not include here the proof of this general fact (for an elementary account of this, see [10]). Lemma 3.2 Let W be a linear polyhedral cone generated by a set of vectors Λ in R 2, and V be the linear polyhedral cone generated by the standard basis {e 1, e 2 }, i.e. V = R 2 +. If W V = {0}, then there exists a nonzero vector w R 2 such that the extended linear polyhedral cone spanned by Λ {w, w} intersects V at {0}. Proof. It is convenient to possibly enlarge W be adding two more generators: e 1 and e 2 ; let s call this new linear polyhedral cone W. Then it is easy to see that W is bounded by two boundary rays enclosing an angle between 90 and 180. We may assume that the two boundary rays have slope m i, with m i 0,i=1, 2, where by we mean the boundary ray is generated by e 2. Using this convention, the choice of w is easy to describe: if the two boundary rays have the same slope m, then W must be a half-space, and we can choose w to be one of the directional vectors of a line with slope m. If the two boundary rays have different slopes m 1 and m 2 with m 1 <m 2, then we can choose w to be one of the directional vectors of a line with slope m such that m 1 <m<m 2. Lemma 3.3 Let V be a linear polyhedral cone in R n generated with nonnegative coefficients by a finite set of vectors {v i },i Λ, Λ <. Furthermore let n x 0 be a half-space constraint, where n x = 0 is a homogeneous equation of a hyperplane in R n. Then V = {v v = i α iv i,α i 0,i Λ and n v 0} is again a linear polyhedral cone, i.e. generated with nonnegative coefficients by a finite set of vectors. Proof. We partition the generators for V into 3 types, according as whether n v i > 0, =0, or < 0:{v + 1,, v + k } {v0 1,, v 0 l } {v 1,, v m} (a priori, either of the sets could be empty). By multiplying by a positive constant, we may assume that their inner products with n are either 1, 0or 1. It suffices to prove the
6 3560 Cherng-tiao Perng Claim. The vectors v 1 +,, v + k, v0 1,, v0 l, and v+ i +vj, where 1 i k and 1 j m, form a set of generators for V. Proof of Claim. Any nonnegative linear combination of the above vectors is clearly in V. Conversely, if v = α 1 v α k v + k + β 1v1 + + β m vm + γ 1 v γ lvl 0 (all coefficients being nonnegative) is in V, then we have α α k β 1 β m 0, using n v 0. By subtracting suitable combination of v + and all the combination of v0, we easily reduce to the case v = α 1 v α k v + k +β 1v1 + +β m vm with α 1 + +α k β 1 β m =0 and it suffices to prove that this can be generated by vectors of the form w ij := v + i + v j, i.e. v = ij α ijw ij, where α ij 0. This can be done by rearranging terms: for example, if α 1 β 1, we can let α 11 = β 1,α 1 = α 1 β 1 and write v = α 11 (v 1 + +v1 )+α 1 v α k v + k +β 2v2 + +β m vm ;ifα 1 <β 1, we can let α 11 = α 1,β 1 = α 1 + β 1, and write v = α 11(v v 1 )+α 2v α k v + k +β 1v1 +β 2 v2 + +β m vm. Dropping the first term α 11 (v 1 + +v2 ), we have less terms in the combination, while keeping α 1 +α 2+ +α k β 2 β m =0 (resp. α α k β 1 β 2 β m = 0). Hence by induction, we are able to replace the terms v + or v by v + i + v j with suitable i and j and α ij 0. Proof of Theorem 2.5. Given an m n matrix A, suppose that there does not exist any column vector x such that Ax > 0. We assert that there exists a row vector y 0 such that ya =0. Clearly we may assume that the column vectors are linearly independent. Furthermore, our assumption implies that m>n: since the rank of A equals n, we have necessarily m n by rank consideration; if m = n, then A is invertible, and there always exists x such that Ax > 0. We will prove our assertion by induction on d = m n. Case 1. d = 1. Choose a permutation [ matrix ] P such that the first n rows of B PA is linearly independent, say PA =, where B is an n n invertible C matrix. Let Q be the inverse of B. Then PAQ is of the form PAQ= [ I C where C = CQ is a row vector. It follows that all the entries of C must be negative, otherwise there will be a column vector of the form Ax in AQ satisfying Ax > 0 contradicting our assumption. Letting C =[ a 1,, a n ] with a i > 0, i, and y 0 =[a 1,,a n, 1], it is straightforward to check that y 0 PAQ =0. Therefore y := y 0 P satisfies ya = 0 and y 0, thus Case 1 is proven. ],
7 Fundamental theorem of asset pricing 3561 Case 2. d =2. Choose P and Q as in Case 1 such that PAQ is of the form [ ] I A := PAQ = C, where C is a 2 n matrix. Thinking of C as given by n column vectors in R 2, it is clear by assumption that the vector formed by any nontrivial linear combination with nonnegative coefficients must contain a negative entry. Geometrically this says the linear polyhedral cone determined by the column vectors of C intersects the first quadrant (including the boundary) of R 2 at 0. By Lemma 3.2, there exists a nonzero vector w such that the linear polyhedral cone W positively spanned (i.e. the coefficients are nonnegative) by the column vectors of C and {w, w} satisfies W R 2 + = {0}. [ ] I 0 Now define an m (n + 1) matrix A 1 by A 1 = C. It is easy to see w that rank(a 1 )=n + 1 and that A 1 x 1 > 0 is false for any x 1 R n+1, using the property of w constructed above. Therefore by Case 1, there exists y 0 0 such that y 0 A 1 =0. But y 0 A 1 =0 y 0 A = y 0 PAQ =0. Therefore, as in Case 1, the vector y := y 0 P satisfies y 0 and ya =0. This establishes Case 2, i.e. when d =2. To prove the theorem, it suffices to show that for any d>2, we can describe a procedure analogous to Case 2, so at to reduce to the case of d 1, then the result follows by induction. Starting with A with d = m n>2, we can find a permutation matrix P and an invertible matrix Q such that PAQ is of the following form [ ] I PAQ= C, where C is an (m n) n matrix. Let V be the linear polyhedral cone formed by taking nonnegative linear combination of the column vectors of PAQ. Let W be the subset of V such that the last m (n+2) components are nonnegative. By Lemma 3.3, W is another linear polyhedral cone, since it is obtained from V by taking successive halfspace constraints. Necessarily either the (n + 1)-th or (n + 2)-th component of any nonzero vector in W must be negative. Put in a different way, by restricting W to the (n + 1)-th and (n + 2)-th components, we obtain a 2 n matrix, satisfying the same condition as in Case 2, if W 0. Now we just need to consider two subcases: Subcase 1. If W 0, we can use the argument in Case 2 to choose w so that adding a column vector of the form [0, w T, 0] T to PAQ reduces to the case d 1. Here and below, the column vector is of size n +2+(m n 2). Subcase 2. If W = 0, this would mean that for any nonzero vector in V, the last m n 2 entries contain at least one negative number. In this case, we
8 3562 Cherng-tiao Perng simply define w =[1, 1] T and add the column vector [0, w T, 0] T to PAQ. Hence by induction, we have shown the direction: there does not exist x such that Ax > 0 implies there exists y 0 such that ya =0. To prove the other direction, we need to show that if there exists y 0 such that ya = 0, then there does not exist x such that Ax > 0. This can be seen as follows: if y 0 such that ya = 0 and Ax > 0 are both true, then Ax > 0 0=yAx > 0, a contradiction. References [1] F. Acedo, F. Benito, A. Falcó, A. Rubia and J. Torres, A computational approach to the fundamental theorem of asset pricing in a single-period market, Computational Economics, 18, number 3, (2002), [2] A. Ben-Israel, Notes on linear inequalities, I: the intersection of the nonnegative orthant with complementary orthogonal subspaces, (1963) O. N. R. Research Memorandum, No. 78, Northwestern University [3] A. Dax, An elementary proof of Farkas s lemma, SIAM Rev., 39 (1997), [4] D. Gale, Convex polyhedral cones and linear inequalities, Cowles Commission for Research in Economics, Monograph No. 13, New York, 1951, [5] D. Gale, The theory of linear economic models, McGraw-Hill, New York, [6] M. Gerstenhaber, Theory of convex polyhedral cones, Cowles Commission for Research in Economics, Monograph No. 13, New York, 1951, [7] D. Luenberger, Investment Science, Oxford University Press, 1998, [8] O. Mangasarian, Nonlinear programming, McGraw-Hill, New York, [9] H. Panjer, et al., Financial Economics: With Applications to Investments, Insurance and Pensions, The Actuarial Foundation, The Society of Actuaries, Illinois, [10] C. Perng, A note on Farkas s lemma and related theorems, submitted. [11] E. Stiemke, Über positive Lösungen homogener linearer Gleichungen, Math. Ann., 76 (1915), Received: March, 2012
A Note on D. Bartl s Algebraic Proof of Farkas s Lemma
International Mathematical Forum, Vol. 7, 2012, no. 27, 1343-1349 A Note on D. Bartl s Algebraic Proof of Farkas s Lemma Cherng-tiao Perng Department of Mathematics Norfolk State University 700 Park Avenue,
More informationThe Asymptotic Theory of Transaction Costs
The Asymptotic Theory of Transaction Costs Lecture Notes by Walter Schachermayer Nachdiplom-Vorlesung, ETH Zürich, WS 15/16 1 Models on Finite Probability Spaces In this section we consider a stock price
More informationChapter 1. Preliminaries
Introduction This dissertation is a reading of chapter 4 in part I of the book : Integer and Combinatorial Optimization by George L. Nemhauser & Laurence A. Wolsey. The chapter elaborates links between
More informationFinite-Dimensional Cones 1
John Nachbar Washington University March 28, 2018 1 Basic Definitions. Finite-Dimensional Cones 1 Definition 1. A set A R N is a cone iff it is not empty and for any a A and any γ 0, γa A. Definition 2.
More information3. Vector spaces 3.1 Linear dependence and independence 3.2 Basis and dimension. 5. Extreme points and basic feasible solutions
A. LINEAR ALGEBRA. CONVEX SETS 1. Matrices and vectors 1.1 Matrix operations 1.2 The rank of a matrix 2. Systems of linear equations 2.1 Basic solutions 3. Vector spaces 3.1 Linear dependence and independence
More informationA Criterion for the Stochasticity of Matrices with Specified Order Relations
Rend. Istit. Mat. Univ. Trieste Vol. XL, 55 64 (2009) A Criterion for the Stochasticity of Matrices with Specified Order Relations Luca Bortolussi and Andrea Sgarro Abstract. We tackle the following problem:
More informationDiscrete-Time Market Models
Discrete-Time Market Models 80-646-08 Stochastic Calculus I Geneviève Gauthier HEC Montréal I We will study in depth Section 2: The Finite Theory in the article Martingales, Stochastic Integrals and Continuous
More informationMath 54 HW 4 solutions
Math 54 HW 4 solutions 2.2. Section 2.2 (a) False: Recall that performing a series of elementary row operations A is equivalent to multiplying A by a series of elementary matrices. Suppose that E,...,
More informationDetermine whether the following system has a trivial solution or non-trivial solution:
Practice Questions Lecture # 7 and 8 Question # Determine whether the following system has a trivial solution or non-trivial solution: x x + x x x x x The coefficient matrix is / R, R R R+ R The corresponding
More informationA Polyhedral Cone Counterexample
Division of the Humanities and Social Sciences A Polyhedral Cone Counterexample KCB 9/20/2003 Revised 12/12/2003 Abstract This is an example of a pointed generating convex cone in R 4 with 5 extreme rays,
More informationUsing Economic Contexts to Advance in Mathematics
Using Economic Contexts to Advance in Mathematics Erik Balder University of Utrecht, Netherlands DEE 2013 presentation, Exeter Erik Balder (Mathematical Institute, University of Utrecht)using economic
More informationSystems of Linear Equations
Systems of Linear Equations Math 108A: August 21, 2008 John Douglas Moore Our goal in these notes is to explain a few facts regarding linear systems of equations not included in the first few chapters
More informationLecture 5. Theorems of Alternatives and Self-Dual Embedding
IE 8534 1 Lecture 5. Theorems of Alternatives and Self-Dual 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 informationMath 3108: Linear Algebra
Math 3108: Linear Algebra Instructor: Jason Murphy Department of Mathematics and Statistics Missouri University of Science and Technology 1 / 323 Contents. Chapter 1. Slides 3 70 Chapter 2. Slides 71 118
More informationMathematics Department Stanford University Math 61CM/DM Inner products
Mathematics Department Stanford University Math 61CM/DM Inner products Recall the definition of an inner product space; see Appendix A.8 of the textbook. Definition 1 An inner product space V is a vector
More information(6, 4) Is there arbitrage in this market? If so, find all arbitrages. If not, find all pricing kernels.
Advanced Financial Models Example sheet - Michaelmas 208 Michael Tehranchi Problem. Consider a two-asset model with prices given by (P, P 2 ) (3, 9) /4 (4, 6) (6, 8) /4 /2 (6, 4) Is there arbitrage in
More informationChapter 2: Preliminaries and elements of convex analysis
Chapter 2: Preliminaries and elements of convex analysis Edoardo Amaldi DEIB Politecnico di Milano edoardo.amaldi@polimi.it Website: http://home.deib.polimi.it/amaldi/opt-14-15.shtml Academic year 2014-15
More informationFootnotes to Linear Algebra (MA 540 fall 2013), T. Goodwillie, Bases
Footnotes to Linear Algebra (MA 540 fall 2013), T. Goodwillie, Bases November 18, 2013 1 Spanning and linear independence I will outline a slightly different approach to the material in Chapter 2 of Axler
More informationNo Arbitrage: On the Work of David Kreps
No Arbitrage: On the Work of David Kreps Walter Schachermayer Vienna University of Technology Abstract Since the seminal papers by Black, Scholes and Merton on the pricing of options (Nobel Prize for Economics,
More informationSystems of Linear Equations
LECTURE 6 Systems of Linear Equations You may recall that in Math 303, matrices were first introduced as a means of encapsulating the essential data underlying a system of linear equations; that is to
More informationA NICE PROOF OF FARKAS LEMMA
A NICE PROOF OF FARKAS LEMMA DANIEL VICTOR TAUSK Abstract. The goal of this short note is to present a nice proof of Farkas Lemma which states that if C is the convex cone spanned by a finite set and if
More informationReview Notes for Linear Algebra True or False Last Updated: February 22, 2010
Review Notes for Linear Algebra True or False Last Updated: February 22, 2010 Chapter 4 [ Vector Spaces 4.1 If {v 1,v 2,,v n } and {w 1,w 2,,w n } are linearly independent, then {v 1 +w 1,v 2 +w 2,,v n
More information1. What is the determinant of the following matrix? a 1 a 2 4a 3 2a 2 b 1 b 2 4b 3 2b c 1. = 4, then det
What is the determinant of the following matrix? 3 4 3 4 3 4 4 3 A 0 B 8 C 55 D 0 E 60 If det a a a 3 b b b 3 c c c 3 = 4, then det a a 4a 3 a b b 4b 3 b c c c 3 c = A 8 B 6 C 4 D E 3 Let A be an n n matrix
More informationMath 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 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 informationLinear Algebra (part 1) : Vector Spaces (by Evan Dummit, 2017, v. 1.07) 1.1 The Formal Denition of a Vector Space
Linear Algebra (part 1) : Vector Spaces (by Evan Dummit, 2017, v. 1.07) Contents 1 Vector Spaces 1 1.1 The Formal Denition of a Vector Space.................................. 1 1.2 Subspaces...................................................
More informationAssignment 1: From the Definition of Convexity to Helley Theorem
Assignment 1: From the Definition of Convexity to Helley Theorem Exercise 1 Mark in the following list the sets which are convex: 1. {x R 2 : x 1 + i 2 x 2 1, i = 1,..., 10} 2. {x R 2 : x 2 1 + 2ix 1x
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 informationEXTENSIONS OF CONVEX FUNCTIONALS ON CONVEX CONES
APPLICATIONES MATHEMATICAE 25,3 (1998), pp. 381 386 E. IGNACZAK (Szczecin) A. PASZKIEWICZ ( Lódź) EXTENSIONS OF CONVEX FUNCTIONALS ON CONVEX CONES Abstract. We prove that under some topological assumptions
More informationMath 3C Lecture 25. John Douglas Moore
Math 3C Lecture 25 John Douglas Moore June 1, 2009 Let V be a vector space. A basis for V is a collection of vectors {v 1,..., v k } such that 1. V = Span{v 1,..., v k }, and 2. {v 1,..., v k } are linearly
More informationLecture 7: Positive Semidefinite Matrices
Lecture 7: Positive Semidefinite Matrices Rajat Mittal IIT Kanpur The main aim of this lecture note is to prepare your background for semidefinite programming. We have already seen some linear algebra.
More informationElementary linear algebra
Chapter 1 Elementary linear algebra 1.1 Vector spaces Vector spaces owe their importance to the fact that so many models arising in the solutions of specific problems turn out to be vector spaces. The
More informationDivision of the Humanities and Social Sciences. Sums of sets, etc.
Division of the Humanities and Social Sciences Sums of sets, etc. KC Border September 2002 Rev. November 2012 Rev. September 2013 If E and F are subsets of R m, define the sum E + F = {x + y : x E; y F
More informationCSL361 Problem set 4: Basic linear algebra
CSL361 Problem set 4: Basic linear algebra February 21, 2017 [Note:] If the numerical matrix computations turn out to be tedious, you may use the function rref in Matlab. 1 Row-reduced echelon matrices
More informationWhat is A + B? What is A B? What is AB? What is BA? What is A 2? and B = QUESTION 2. What is the reduced row echelon matrix of A =
STUDENT S COMPANIONS IN BASIC MATH: THE ELEVENTH Matrix Reloaded by Block Buster Presumably you know the first part of matrix story, including its basic operations (addition and multiplication) and row
More informationMAT-INF4110/MAT-INF9110 Mathematical optimization
MAT-INF4110/MAT-INF9110 Mathematical optimization Geir Dahl August 20, 2013 Convexity Part IV Chapter 4 Representation of convex sets different representations of convex sets, boundary polyhedra and polytopes:
More informationSample of Ph.D. Advisory Exam For MathFinance
Sample of Ph.D. Advisory Exam For MathFinance Students who wish to enter the Ph.D. program of Mathematics of Finance are required to take the advisory exam. This exam consists of three major parts. The
More informationIntroduction to Mathematical Programming IE406. Lecture 3. Dr. Ted Ralphs
Introduction to Mathematical Programming IE406 Lecture 3 Dr. Ted Ralphs IE406 Lecture 3 1 Reading for This Lecture Bertsimas 2.1-2.2 IE406 Lecture 3 2 From Last Time Recall the Two Crude Petroleum example.
More informationMAT2342 : Introduction to Applied Linear Algebra Mike Newman, fall Projections. introduction
MAT4 : Introduction to Applied Linear Algebra Mike Newman fall 7 9. Projections introduction One reason to consider projections is to understand approximate solutions to linear systems. A common example
More informationweb: HOMEWORK 1
MAT 207 LINEAR ALGEBRA I 2009207 Dokuz Eylül University, Faculty of Science, Department of Mathematics Instructor: Engin Mermut web: http://kisideuedutr/enginmermut/ HOMEWORK VECTORS IN THE n-dimensional
More informationNormal Fans of Polyhedral Convex Sets
Set-Valued Analysis manuscript No. (will be inserted by the editor) Normal Fans of Polyhedral Convex Sets Structures and Connections Shu Lu Stephen M. Robinson Received: date / Accepted: date Dedicated
More informationMatrices and RRE Form
Matrices and RRE Form Notation R is the real numbers, C is the complex numbers (we will only consider complex numbers towards the end of the course) is read as an element of For instance, x R means that
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 informationTangent spaces, normals and extrema
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
More informationHandout 4: Some Applications of Linear Programming
ENGG 5501: Foundations of Optimization 2018 19 First Term Handout 4: Some Applications of Linear Programming Instructor: Anthony Man Cho So October 15, 2018 1 Introduction The theory of LP has found many
More information3. Linear Programming and Polyhedral Combinatorics
Massachusetts Institute of Technology 18.433: Combinatorial Optimization Michel X. Goemans February 28th, 2013 3. Linear Programming and Polyhedral Combinatorics Summary of what was seen in the introductory
More informationEE5120 Linear Algebra: Tutorial 3, July-Dec
EE5120 Linear Algebra: Tutorial 3, July-Dec 2017-18 1. Let S 1 and S 2 be two subsets of a vector space V such that S 1 S 2. Say True/False for each of the following. If True, prove it. If False, justify
More informationConvex Analysis and Economic Theory Winter 2018
Division of the Humanities and Social Sciences Ec 181 KC Border Convex Analysis and Economic Theory Winter 2018 Topic 0: Vector spaces 0.1 Basic notation Here are some of the fundamental sets and spaces
More informationWhen are Sums Closed?
Division of the Humanities and Social Sciences Ec 181 KC Border Convex Analysis and Economic Theory Fall 2018 Winter 2019 Topic 20: When are Sums Closed? 20.1 Is a sum of closed sets closed? Example 0.2.2
More informationLinear Programming. Larry Blume Cornell University, IHS Vienna and SFI. Summer 2016
Linear Programming Larry Blume Cornell University, IHS Vienna and SFI Summer 2016 These notes derive basic results in finite-dimensional linear programming using tools of convex analysis. Most sources
More informationLinear Algebra. Preliminary Lecture Notes
Linear Algebra Preliminary Lecture Notes Adolfo J. Rumbos c Draft date April 29, 23 2 Contents Motivation for the course 5 2 Euclidean n dimensional Space 7 2. Definition of n Dimensional Euclidean Space...........
More informationMTH Linear Algebra. Study Guide. Dr. Tony Yee Department of Mathematics and Information Technology The Hong Kong Institute of Education
MTH 3 Linear Algebra Study Guide Dr. Tony Yee Department of Mathematics and Information Technology The Hong Kong Institute of Education June 3, ii Contents Table of Contents iii Matrix Algebra. Real Life
More informationOptimality Conditions for Constrained Optimization
72 CHAPTER 7 Optimality Conditions for Constrained Optimization 1. First Order Conditions In this section we consider first order optimality conditions for the constrained problem P : minimize f 0 (x)
More informationSeparation in General Normed Vector Spaces 1
John Nachbar Washington University March 12, 2016 Separation in General Normed Vector Spaces 1 1 Introduction Recall the Basic Separation Theorem for convex sets in R N. Theorem 1. Let A R N be non-empty,
More informationFinite Dimensional Optimization Part I: The KKT Theorem 1
John Nachbar Washington University March 26, 2018 1 Introduction Finite Dimensional Optimization Part I: The KKT Theorem 1 These notes characterize maxima and minima in terms of first derivatives. I focus
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 informationRow Space and Column Space of a Matrix
Row Space and Column Space of a Matrix 1/18 Summary: To a m n matrix A = (a ij ), we can naturally associate subspaces of K n and of K m, called the row space of A and the column space of A, respectively.
More informationLecture Note 18: Duality
MATH 5330: Computational Methods of Linear Algebra 1 The Dual Problems Lecture Note 18: Duality Xianyi Zeng Department of Mathematical Sciences, UTEP The concept duality, just like accuracy and stability,
More informationLinear Algebra. Preliminary Lecture Notes
Linear Algebra Preliminary Lecture Notes Adolfo J. Rumbos c Draft date May 9, 29 2 Contents 1 Motivation for the course 5 2 Euclidean n dimensional Space 7 2.1 Definition of n Dimensional Euclidean Space...........
More informationMATHEMATICAL PROGRAMMING I
MATHEMATICAL PROGRAMMING I Books There is no single course text, but there are many useful books, some more mathematical, others written at a more applied level. A selection is as follows: Bazaraa, Jarvis
More informationACI-matrices all of whose completions have the same rank
ACI-matrices all of whose completions have the same rank Zejun Huang, Xingzhi Zhan Department of Mathematics East China Normal University Shanghai 200241, China Abstract We characterize the ACI-matrices
More informationConvex 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
More informationMatrices and Matrix Algebra.
Matrices and Matrix Algebra 3.1. Operations on Matrices Matrix Notation and Terminology Matrix: a rectangular array of numbers, called entries. A matrix with m rows and n columns m n A n n matrix : a square
More informationMATH 2331 Linear Algebra. Section 2.1 Matrix Operations. Definition: A : m n, B : n p. Example: Compute AB, if possible.
MATH 2331 Linear Algebra Section 2.1 Matrix Operations Definition: A : m n, B : n p ( 1 2 p ) ( 1 2 p ) AB = A b b b = Ab Ab Ab Example: Compute AB, if possible. 1 Row-column rule: i-j-th entry of AB:
More informationSpanning and Independence Properties of Finite Frames
Chapter 1 Spanning and Independence Properties of Finite Frames Peter G. Casazza and Darrin Speegle Abstract The fundamental notion of frame theory is redundancy. It is this property which makes frames
More informationCombinatorics for algebraic geometers
Combinatorics for algebraic geometers Calculations in enumerative geometry Maria Monks March 17, 214 Motivation Enumerative geometry In the late 18 s, Hermann Schubert investigated problems in what is
More informationLinear Algebra. The analysis of many models in the social sciences reduces to the study of systems of equations.
POLI 7 - Mathematical and Statistical Foundations Prof S Saiegh Fall Lecture Notes - Class 4 October 4, Linear Algebra The analysis of many models in the social sciences reduces to the study of systems
More informationChapter 1: Linear Equations
Chapter : Linear Equations (Last Updated: September, 6) The material for these notes is derived primarily from Linear Algebra and its applications by David Lay (4ed).. Systems of Linear Equations Before
More informationLecture 18: The Rank of a Matrix and Consistency of Linear Systems
Lecture 18: The Rank of a Matrix and Consistency of Linear Systems Winfried Just Department of Mathematics, Ohio University February 28, 218 Review: The linear span Definition Let { v 1, v 2,..., v n }
More informationConvexity in R N Supplemental Notes 1
John Nachbar Washington University November 1, 2014 Convexity in R N Supplemental Notes 1 1 Introduction. These notes provide exact characterizations of support and separation in R N. The statement of
More informationLinear Algebra I. Ronald van Luijk, 2015
Linear Algebra I Ronald van Luijk, 2015 With many parts from Linear Algebra I by Michael Stoll, 2007 Contents Dependencies among sections 3 Chapter 1. Euclidean space: lines and hyperplanes 5 1.1. Definition
More informationAuerbach bases and minimal volume sufficient enlargements
Auerbach bases and minimal volume sufficient enlargements M. I. Ostrovskii January, 2009 Abstract. Let B Y denote the unit ball of a normed linear space Y. A symmetric, bounded, closed, convex set A in
More informationChapter 2: Linear Independence and Bases
MATH20300: Linear Algebra 2 (2016 Chapter 2: Linear Independence and Bases 1 Linear Combinations and Spans Example 11 Consider the vector v (1, 1 R 2 What is the smallest subspace of (the real vector space
More informationDS-GA 1002 Lecture notes 0 Fall Linear Algebra. These notes provide a review of basic concepts in linear algebra.
DS-GA 1002 Lecture notes 0 Fall 2016 Linear Algebra These notes provide a review of basic concepts in linear algebra. 1 Vector spaces You are no doubt familiar with vectors in R 2 or R 3, i.e. [ ] 1.1
More informationCharacterization of half-radial matrices
Characterization of half-radial matrices Iveta Hnětynková, Petr Tichý Faculty of Mathematics and Physics, Charles University, Sokolovská 83, Prague 8, Czech Republic Abstract Numerical radius r(a) is the
More informationTune-Up Lecture Notes Linear Algebra I
Tune-Up Lecture Notes Linear Algebra I One usually first encounters a vector depicted as a directed line segment in Euclidean space, or what amounts to the same thing, as an ordered n-tuple of numbers
More informationMath 242 fall 2008 notes on problem session for week of This is a short overview of problems that we covered.
Math 242 fall 28 notes on problem session for week of 9-3-8 This is a short overview of problems that we covered.. For each of the following sets ask the following: Does it span R 3? Is it linearly independent?
More information2. Every linear system with the same number of equations as unknowns has a unique solution.
1. For matrices A, B, C, A + B = A + C if and only if A = B. 2. Every linear system with the same number of equations as unknowns has a unique solution. 3. Every linear system with the same number of equations
More informationMath 5593 Linear Programming Week 1
University of Colorado Denver, Fall 2013, Prof. Engau 1 Problem-Solving in Operations Research 2 Brief History of Linear Programming 3 Review of Basic Linear Algebra Linear Programming - The Story About
More informationGENERALIZED CONVEXITY AND OPTIMALITY CONDITIONS IN SCALAR AND VECTOR OPTIMIZATION
Chapter 4 GENERALIZED CONVEXITY AND OPTIMALITY CONDITIONS IN SCALAR AND VECTOR OPTIMIZATION Alberto Cambini Department of Statistics and Applied Mathematics University of Pisa, Via Cosmo Ridolfi 10 56124
More informationMath 2174: Practice Midterm 1
Math 74: Practice Midterm Show your work and explain your reasoning as appropriate. No calculators. One page of handwritten notes is allowed for the exam, as well as one blank page of scratch paper.. Consider
More informationMATH 167: APPLIED LINEAR ALGEBRA Chapter 2
MATH 167: APPLIED LINEAR ALGEBRA Chapter 2 Jesús De Loera, UC Davis February 1, 2012 General Linear Systems of Equations (2.2). Given a system of m equations and n unknowns. Now m n is OK! Apply elementary
More information7. Dimension and Structure.
7. Dimension and Structure 7.1. Basis and Dimension Bases for Subspaces Example 2 The standard unit vectors e 1, e 2,, e n are linearly independent, for if we write (2) in component form, then we obtain
More informationSYMBOL EXPLANATION EXAMPLE
MATH 4310 PRELIM I REVIEW Notation These are the symbols we have used in class, leading up to Prelim I, and which I will use on the exam SYMBOL EXPLANATION EXAMPLE {a, b, c, } The is the way to write the
More informationMath 240, 4.3 Linear Independence; Bases A. DeCelles. 1. definitions of linear independence, linear dependence, dependence relation, basis
Math 24 4.3 Linear Independence; Bases A. DeCelles Overview Main ideas:. definitions of linear independence linear dependence dependence relation basis 2. characterization of linearly dependent set using
More informationMath 350 Fall 2011 Notes about inner product spaces. In this notes we state and prove some important properties of inner product spaces.
Math 350 Fall 2011 Notes about inner product spaces In this notes we state and prove some important properties of inner product spaces. First, recall the dot product on R n : if x, y R n, say x = (x 1,...,
More informationLINEAR ALGEBRA: THEORY. Version: August 12,
LINEAR ALGEBRA: THEORY. Version: August 12, 2000 13 2 Basic concepts We will assume that the following concepts are known: Vector, column vector, row vector, transpose. Recall that x is a column vector,
More informationTORIC WEAK FANO VARIETIES ASSOCIATED TO BUILDING SETS
TORIC WEAK FANO VARIETIES ASSOCIATED TO BUILDING SETS YUSUKE SUYAMA Abstract. We give a necessary and sufficient condition for the nonsingular projective toric variety associated to a building set to be
More informationAlgebraic Methods in Combinatorics
Algebraic Methods in Combinatorics Po-Shen Loh 27 June 2008 1 Warm-up 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 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 informationMath 121 Homework 5: Notes on Selected Problems
Math 121 Homework 5: Notes on Selected Problems 12.1.2. Let M be a module over the integral domain R. (a) Assume that M has rank n and that x 1,..., x n is any maximal set of linearly independent elements
More informationCutting Plane Methods I
6.859/15.083 Integer Programming and Combinatorial Optimization Fall 2009 Cutting Planes Consider max{wx : Ax b, x integer}. Cutting Plane Methods I Establishing the optimality of a solution is equivalent
More informationRow Space, Column Space, and Nullspace
Row Space, Column Space, and Nullspace MATH 322, Linear Algebra I J. Robert Buchanan Department of Mathematics Spring 2015 Introduction Every matrix has associated with it three vector spaces: row space
More informationWelsh s problem on the number of bases of matroids
Welsh s problem on the number of bases of matroids Edward S. T. Fan 1 and Tony W. H. Wong 2 1 Department of Mathematics, California Institute of Technology 2 Department of Mathematics, Kutztown University
More informationLinear equations in linear algebra
Linear equations in linear algebra Samy Tindel Purdue University Differential equations and linear algebra - MA 262 Taken from Differential equations and linear algebra Pearson Collections Samy T. Linear
More informationConstrained Optimization Theory
Constrained Optimization Theory Stephen J. Wright 1 2 Computer Sciences Department, University of Wisconsin-Madison. IMA, August 2016 Stephen Wright (UW-Madison) Constrained Optimization Theory IMA, August
More informationGaussian elimination
Gaussian elimination October 14, 2013 Contents 1 Introduction 1 2 Some definitions and examples 2 3 Elementary row operations 7 4 Gaussian elimination 11 5 Rank and row reduction 16 6 Some computational
More informationFarkas Lemma. Rudi Pendavingh. Optimization in R n, lecture 2. Eindhoven Technical University. Rudi Pendavingh (TUE) Farkas Lemma ORN2 1 / 15
Farkas Lemma Rudi Pendavingh Eindhoven Technical University Optimization in R n, lecture 2 Rudi Pendavingh (TUE) Farkas Lemma ORN2 1 / 15 Today s Lecture Theorem (Farkas Lemma, 1894) Let A be an m n matrix,
More informationMath 4A Notes. Written by Victoria Kala Last updated June 11, 2017
Math 4A Notes Written by Victoria Kala vtkala@math.ucsb.edu Last updated June 11, 2017 Systems of Linear Equations A linear equation is an equation that can be written in the form a 1 x 1 + a 2 x 2 +...
More information16 Chapter 3. Separation Properties, Principal Pivot Transforms, Classes... for all j 2 J is said to be a subcomplementary vector of variables for (3.
Chapter 3 SEPARATION PROPERTIES, PRINCIPAL PIVOT TRANSFORMS, CLASSES OF MATRICES In this chapter we present the basic mathematical results on the LCP. Many of these results are used in later chapters to
More information